# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
14511 |
2015-05-19T02:24:03 Z |
nosiar |
카드 (tutorial6) |
C++14 |
|
346 ms |
43276 KB |
#include"jeehak.h"
void jeehak(int A[])
{
int sum = (A[0]+A[1]+A[2]+A[3]+A[4]) % 10;
send(sum/2+1,sum%2);
}
#include"friends.h"
void friends(int A[],int N,int X[],int Y[])
{
int sum = (X[0]-1)*2 + Y[0];
int sum2 = (A[0]+A[1]+A[2]+A[3]+A[4]+1) % 10;
int ans = (10 + sum - sum2) % 10;
guess(ans);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
346 ms |
43276 KB |
Output isn't correct - friends 함수 오류 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
329 ms |
43276 KB |
Output isn't correct - friends 함수 오류 |