# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
16801 |
2015-09-30T05:25:04 Z |
gs14004 |
카드 (tutorial6) |
C++14 |
|
45 ms |
43276 KB |
#include "jeehak.h"
void jeehak(int A[]){
int ret = 0;
for(int i=0; i<5; i++) ret ^= A[i];
send(ret / 2 + 1, ret % 2);
}
#include "friends.h"
void friends(int A[], int N, int X[], int Y[]){
int ret = 0;
for(int i=0; i<5; i++) if(A[i] != -1) ret ^= A[i];
int tmp = (X[0] - 1) * 2 + Y[0];
guess(ret ^ tmp);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
43 ms |
43276 KB |
Output isn't correct - jeehak 함수 오류 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
45 ms |
43276 KB |
Output isn't correct - jeehak 함수 오류 |