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