# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
4100 |
2013-09-01T09:08:34 Z |
gs13105 |
카드 (tutorial6) |
C++ |
|
372 ms |
43280 KB |
#include "jeehak.h"
void jeehak(int A[])
{
int s=(A[1]+A[2]+A[3]+A[4]+A[5])%10;
send(s%5+1,s>4);
}
#include "friends.h"
int friends(int A[],int N,int X[],int Y[])
{
guess(((X[1]+5*Y[1]-2-A[1]-A[2]-A[3]-A[4]-A[5])%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 |
372 ms |
43280 KB |
Output is correct - 최대 카드수 : 1 |