# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
16812 |
2015-09-30T05:44:32 Z |
khsoo01 |
카드 (tutorial6) |
C++ |
|
45 ms |
43276 KB |
#include "jeehak.h"
void jeehak (int A[]) {
int tmp=A[1]^A[2]^A[3]^A[4]^A[5];
send(tmp/2+1,tmp%2);
}
#include "friends.h"
void friends (int A[],int N,int X[],int Y[]) {
int i,tmp=0;
for(i=1;i<=5;i++) {
if(A[i]!=-1)tmp^=A[i];
}
guess(((X[1]-1)*2+Y[1])^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 함수 오류 |