Submission #632667


Source Code Expand

#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <algorithm>
#include <functional>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)

typedef long long ll;


int main(void) {
    int d[7],j[7];
    REP(i,7) cin >> d[i];
    REP(i,7) cin >> j[i];
    int ans = 0;
    REP(i,7) ans += max(d[i],j[i]);
    cout << ans << endl;
    
    return 0;
}

Submission Info

Submission Time
Task A - ゴールドラッシュ
User TangentDay
Language C++ (G++ 4.6.4)
Score 100
Code Size 574 Byte
Status AC
Exec Time 35 ms
Memory 1056 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 4
AC × 19
Set Name Test Cases
Sample subtask0_sample-01.txt, subtask0_sample-02.txt, subtask0_sample-03.txt, subtask0_sample-04.txt
All subtask0_sample-01.txt, subtask0_sample-02.txt, subtask0_sample-03.txt, subtask0_sample-04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt
Case Name Status Exec Time Memory
subtask0_sample-01.txt AC 28 ms 920 KB
subtask0_sample-02.txt AC 28 ms 924 KB
subtask0_sample-03.txt AC 28 ms 876 KB
subtask0_sample-04.txt AC 27 ms 920 KB
subtask1_01.txt AC 29 ms 916 KB
subtask1_02.txt AC 33 ms 920 KB
subtask1_03.txt AC 35 ms 872 KB
subtask1_04.txt AC 28 ms 1056 KB
subtask1_05.txt AC 26 ms 924 KB
subtask1_06.txt AC 28 ms 824 KB
subtask1_07.txt AC 31 ms 928 KB
subtask1_08.txt AC 27 ms 1052 KB
subtask1_09.txt AC 28 ms 924 KB
subtask1_10.txt AC 27 ms 928 KB
subtask1_11.txt AC 27 ms 928 KB
subtask1_12.txt AC 27 ms 856 KB
subtask1_13.txt AC 29 ms 916 KB
subtask1_14.txt AC 29 ms 1052 KB
subtask1_15.txt AC 27 ms 1056 KB