# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
4082 |
2013-09-01T02:36:45 Z |
tncks0121 |
카드 (tutorial6) |
C++ |
|
392 ms |
43280 KB |
#include "jeehak.h"
void jeehak (int A[]) {
int i, s=0; for(i=1; i<=5; i++) s+=A[i];
s%=10;
send(s/2+1, s%2);
}
#include "friends.h"
void friends(int A[],int N,int X[],int Y[]) {
int s = (X[1]-1) * 2 + Y[1];
int x = 0;
for(int i = 1; i <= 5; i++) if(A[i] >= 0) x += A[i];
guess((s - x%10 + 10) % 10);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
372 ms |
43280 KB |
Output is correct - 최대 카드수 : 1 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
392 ms |
43280 KB |
Output is correct - 최대 카드수 : 1 |