# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
16805 |
2015-09-30T05:29:55 Z |
gs14004 |
카드 (tutorial6) |
C++14 |
|
357 ms |
43276 KB |
#include "jeehak.h"
void jeehak(int A[]){
int ret = 0;
for(int i=1; i<=5; i++) ret = (ret + A[i]) % 10;
send(ret / 2 + 1, ret % 2);
}
#include "friends.h"
void friends(int A[], int N, int X[], int Y[]){
int ret = 0;
for(int i=1; i<=5; i++) if(A[i] != -1) ret = (ret + A[i]) % 10;
int tmp = (X[1] - 1) * 2 + Y[1];
guess((tmp + 10 - ret) % 10);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
357 ms |
43276 KB |
Output is correct - 최대 카드수 : 1 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
339 ms |
43276 KB |
Output is correct - 최대 카드수 : 1 |