# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
4088 |
2013-09-01T02:42:43 Z |
gs13068 |
카드 (tutorial6) |
C++ |
|
1344 ms |
43280 KB |
#include"jeehak.h"
void jeehak(int A[])
{
int i,j;
for(i=1;i<=5;i++)
{
for(j=0;j<=A[i];j++)
send(i,0);
}
}
#include"friends.h"
void friends(int A[],int N,int X[],int Y[])
{
int i,j,k=0;
for(i=1;i<=5;i++)if(A[i]==-1)break;
for(j=1;j<=N;j++)if(X[j]==i)k++;
guess(k-1);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1344 ms |
43280 KB |
Output is correct - 최대 카드수 : 50 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1328 ms |
43280 KB |
Output is correct - 최대 카드수 : 50 |