Submission #183264
Source Code Expand
#define _USE_MATH_DEFINES #define _CRT_SECURE_NO_DEPRECATE #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <climits> #include <cfloat> #include <ctime> #include <cassert> #include <map> #include <utility> #include <set> #include <iostream> #include <memory> #include <string> #include <vector> #include <algorithm> #include <functional> #include <sstream> #include <complex> #include <stack> #include <queue> #include <numeric> #include <list> #include <iomanip> #include <fstream> #include <iterator> using namespace std; const int MOD = 1000000007; // check!!! const int INF = 100000000; //1e8 typedef long long ll; typedef pair<int, int> Pii; typedef pair<ll, ll> Pll; #define FOR(i,n) for(int i = 0; i < (n); i++) #define sz(c) ((int)(c).size()) #define ten(x) ((int)1e##x) #define tenll(x) ((ll)1e##x) template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } int main() { const int N = 7; int a[N], b[N]; FOR(i, N) cin >> a[i]; FOR(i, N) cin >> b[i]; int ans = 0; FOR(i, N) ans += max(a[i], b[i]); cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - ゴールドラッシュ |
User | math |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 1136 Byte |
Status | AC |
Exec Time | 22 ms |
Memory | 928 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
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 | 22 ms | 800 KB |
subtask0_sample-02.txt | AC | 19 ms | 796 KB |
subtask0_sample-03.txt | AC | 21 ms | 792 KB |
subtask0_sample-04.txt | AC | 21 ms | 804 KB |
subtask1_01.txt | AC | 21 ms | 804 KB |
subtask1_02.txt | AC | 21 ms | 796 KB |
subtask1_03.txt | AC | 21 ms | 928 KB |
subtask1_04.txt | AC | 22 ms | 732 KB |
subtask1_05.txt | AC | 20 ms | 792 KB |
subtask1_06.txt | AC | 21 ms | 804 KB |
subtask1_07.txt | AC | 19 ms | 924 KB |
subtask1_08.txt | AC | 20 ms | 804 KB |
subtask1_09.txt | AC | 21 ms | 800 KB |
subtask1_10.txt | AC | 21 ms | 924 KB |
subtask1_11.txt | AC | 21 ms | 800 KB |
subtask1_12.txt | AC | 20 ms | 804 KB |
subtask1_13.txt | AC | 21 ms | 800 KB |
subtask1_14.txt | AC | 21 ms | 796 KB |
subtask1_15.txt | AC | 20 ms | 800 KB |