# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
16807 |
2015-09-30T05:35:12 Z |
Namnamseo |
카드 (tutorial6) |
C++ |
|
325 ms |
43276 KB |
#include"jeehak.h"
void jeehak(int A[])
{
int as=0;
int i;
for(i=1;i<=5;++i) as+=A[i];
as%=10;
send(as%5+1,as/5);
}
#include"friends.h"
#include<cstdio>
void friends(int A[],int N,int X[],int Y[])
{
int as=1;
int i;
for(i=1;i<=5;++i) as+=A[i];
int ras = X[1]-1 + Y[1]*5;
guess((ras-as+10)%10);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
325 ms |
43276 KB |
Output isn't correct - friends 함수 오류 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
324 ms |
43276 KB |
Output isn't correct - friends 함수 오류 |