Submission #183268
Source Code Expand
#include <iostream> #include <cstdio> using namespace std; #define rep(i,n) for(int i=0;i<(n);++i) #define rep1(i,n) for(int i=1;i<=(n);++i) #define all(c) (c).begin(),(c).end() int main(){ int a[7],b[7]; rep(i,7) cin >> a[i]; rep(i,7) cin >> b[i]; int sum=0; rep(i,7) sum+=max(a[i],b[i]); cout << sum << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - ゴールドラッシュ |
User | sigma425 |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 343 Byte |
Status | AC |
Exec Time | 154 ms |
Memory | 920 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 | 27 ms | 916 KB |
subtask0_sample-02.txt | AC | 29 ms | 732 KB |
subtask0_sample-03.txt | AC | 28 ms | 784 KB |
subtask0_sample-04.txt | AC | 25 ms | 920 KB |
subtask1_01.txt | AC | 25 ms | 916 KB |
subtask1_02.txt | AC | 26 ms | 908 KB |
subtask1_03.txt | AC | 59 ms | 788 KB |
subtask1_04.txt | AC | 28 ms | 684 KB |
subtask1_05.txt | AC | 29 ms | 800 KB |
subtask1_06.txt | AC | 60 ms | 776 KB |
subtask1_07.txt | AC | 154 ms | 792 KB |
subtask1_08.txt | AC | 33 ms | 916 KB |
subtask1_09.txt | AC | 27 ms | 840 KB |
subtask1_10.txt | AC | 32 ms | 856 KB |
subtask1_11.txt | AC | 33 ms | 800 KB |
subtask1_12.txt | AC | 38 ms | 796 KB |
subtask1_13.txt | AC | 55 ms | 792 KB |
subtask1_14.txt | AC | 87 ms | 796 KB |
subtask1_15.txt | AC | 29 ms | 780 KB |