# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
4084 |
2013-09-01T02:39:46 Z |
tncks0121 |
카드 (tutorial6) |
C++ |
|
1180 ms |
43280 KB |
#include "jeehak.h"
void jeehak (int A[]) {
int i; for(i=1; i<=5; i++) while(A[i]--) send(i, 0);
}
#include "friends.h"
void friends(int A[],int N,int X[],int Y[]) {
int ret=0;
int x; for(x=1; x<=5; x++) if(A[x]<0) break;
for(int i=1; i<=N; i++) if(X[i] == x) ++ret;
guess( ret);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1144 ms |
43280 KB |
Output is correct - 최대 카드수 : 45 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1180 ms |
43280 KB |
Output is correct - 최대 카드수 : 45 |