# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
4081 |
2013-09-01T02:35:41 Z |
tncks0121 |
카드 (tutorial6) |
C++ |
|
380 ms |
43280 KB |
#include "jeehak.h"
void jeehak (int A[]) {
int i, s=0; for(i=1; i<=5; i++) s+=A[i];
s%=10;
send(s/2+1, s%2);
}
#include "friends.h"
void friends(int A[],int N,int X[],int Y[]) {
int s = (X[0]-1) * 2 + Y[0];
int x = 0;
for(int i = 1; i <= 5; i++) if(A[i] >= 0) x += A[i];
guess((s - x%10 + 10) % 10);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
372 ms |
43280 KB |
Output isn't correct - friends 함수 오류 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
380 ms |
43280 KB |
Output isn't correct - friends 함수 오류 |