# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
16806 |
2015-09-30T05:32:13 Z |
kdh9949 |
카드 (tutorial6) |
C++ |
|
353 ms |
43276 KB |
#include"jeehak.h"
void jeehak(int A[])
{
int sum=A[1]+A[2]+A[3]+A[4]+A[5];
sum%=10;
send((sum%5)+1,sum/5);
}
#include"friends.h"
void friends(int A[],int N,int X[],int Y[])
{
int csum=A[1]+A[2]+A[3]+A[4]+A[5];
csum++;
int asum=(X[1]+Y[1]*5)-1;
while(asum<csum)asum+=10;
guess(asum-csum);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
332 ms |
43276 KB |
Output is correct - 최대 카드수 : 1 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
353 ms |
43276 KB |
Output is correct - 최대 카드수 : 1 |