# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
14855 |
2015-07-01T14:00:03 Z |
pichulia |
카드 (tutorial6) |
C++ |
|
906 ms |
43276 KB |
#include"jeehak.h"
void jeehak(int A[])
{
int i, j, k;
for(i=1;i<=5;i++)
{
for(j=0;j<4;j++)
{
k = (A[i]&(1<<j))>>j;
send(i,k);
}
}
}
#include"friends.h"
void friends(int A[],int N,int X[],int Y[])
{
int i, j, k;
int si;
for(i=1;i<=5;i++)if(A[i] == -1)break;
si = i;
k=0;
j=0;
for(i=1;i<=N;i++)
{
if(X[i] == si)
{
k |= (Y[i] << j);
j++;
}
}
guess(k);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
807 ms |
43276 KB |
Output is correct - 최대 카드수 : 20 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
906 ms |
43276 KB |
Output is correct - 최대 카드수 : 20 |