# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
14512 |
2015-05-19T02:25:19 Z |
nosiar |
카드 (tutorial6) |
C++14 |
|
327 ms |
43276 KB |
#include"jeehak.h"
void jeehak(int A[])
{
int sum = (A[1]+A[2]+A[3]+A[4]+A[5]) % 10;
send(sum/2+1,sum%2);
}
#include"friends.h"
void friends(int A[],int N,int X[],int Y[])
{
int sum = (X[1]-1)*2 + Y[1];
int sum2 = (A[1]+A[2]+A[3]+A[4]+A[5]+1) % 10;
int ans = (10 + sum - sum2) % 10;
guess(ans);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
327 ms |
43276 KB |
Output is correct - 최대 카드수 : 1 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
321 ms |
43276 KB |
Output is correct - 최대 카드수 : 1 |