# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
16634 |
2015-08-31T08:58:22 Z |
suhgyuho_william |
카드 (tutorial6) |
C++ |
|
412 ms |
43276 KB |
#include"jeehak.h"
void jeehak(int A[])
{
int sum=A[1]+A[2]+A[3]+A[4]+A[5];
sum%=10;
send(sum/2+1,sum%2);
}
#include"friends.h"
void friends(int A[],int N,int X[],int Y[])
{
int i,sum,t;
int x,y;
for(i=1;;i++){
if(A[i]==-1) break;
}
t=i;
sum=A[1]+A[2]+A[3]+A[4]+A[5]+1;
for(i=0;i<=9;i++){
x=(sum+i)%10;
if(X[1]-1==x/2 && Y[1]==x%2) break;
}
guess(i);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
383 ms |
43276 KB |
Output is correct - 최대 카드수 : 1 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
412 ms |
43276 KB |
Output is correct - 최대 카드수 : 1 |