Submission #4022283
Source Code Expand
//inlclude before define
#define _USE_MATH_DEFINES
//include
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<type_traits>
#include<numeric>
#include<assert.h>
#include<deque>
#include<iomanip>
#include<set>
#include<tuple>
#include<map>
using namespace std;
//typedef
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<char> VC;
typedef pair<int, int> P1;
typedef long long int ll;
//number
#define INF 1e9
#define NUM 1000000007
//itr
#define all(x) begin(x),end(x)
//repeat
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,a,b) for(int i=int(a);i<int(b);i++)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
//max,min
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))
//function
/*ll gcd(ll a, ll b) {
if (b == 0) return a;
else return gcd(b, a%b);
}*/
/*ll lcm(ll a,ll b) {
ll g = gcd(a, b);
return a * (b / g);
}*/
/*int dig(int a) {
int sum = 0;
while (a) {
sum += a % 10;
a /= 10;
}
return sum;
}*/
//grid template
int x[] = { -1, 0, 1, 0 };
int y[] = { 0,-1,0,1 };
int xx[] = { -1,-1,1,1 };
int yy[] = { 1,-1,1,-1 };
int main () {
int ans=0;
int c, d;
rep (i, 7) {
cin >> c >> d;
ans += max (c, d);
}
cout << ans << endl;
}
Submission Info
Submission Time |
|
Task |
A - ゴールドラッシュ |
User |
mickey_1024 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1342 Byte |
Status |
WA |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 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 |
WA |
1 ms |
256 KB |
subtask0_sample-02.txt |
WA |
1 ms |
256 KB |
subtask0_sample-03.txt |
AC |
1 ms |
256 KB |
subtask0_sample-04.txt |
WA |
1 ms |
256 KB |
subtask1_01.txt |
WA |
1 ms |
256 KB |
subtask1_02.txt |
WA |
1 ms |
256 KB |
subtask1_03.txt |
WA |
1 ms |
256 KB |
subtask1_04.txt |
WA |
1 ms |
256 KB |
subtask1_05.txt |
WA |
1 ms |
256 KB |
subtask1_06.txt |
WA |
1 ms |
256 KB |
subtask1_07.txt |
WA |
1 ms |
256 KB |
subtask1_08.txt |
WA |
1 ms |
256 KB |
subtask1_09.txt |
WA |
1 ms |
256 KB |
subtask1_10.txt |
AC |
1 ms |
256 KB |
subtask1_11.txt |
WA |
1 ms |
256 KB |
subtask1_12.txt |
WA |
1 ms |
256 KB |
subtask1_13.txt |
WA |
1 ms |
256 KB |
subtask1_14.txt |
WA |
1 ms |
256 KB |
subtask1_15.txt |
WA |
1 ms |
256 KB |