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