# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
4094 |
2013-09-01T02:49:09 Z |
tncks0121 |
카드 (tutorial6) |
C++ |
|
544 ms |
43280 KB |
#include "jeehak.h"
void jeehak (int A[]) {
int i, s=0; for(i=1; i<=5; i++) send(A[i]/2+1, A[i]%2);
}
#include "friends.h"
void friends(int A[],int N,int X[],int Y[]) {
int s = 0, x = 0;
for(int i = 1; i <= N; i++) s += (X[i]-1) * 2 + Y[i];
for(int i = 1; i <= 5; i++) if(A[i] > 0) x += A[i];
guess(s - x);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
532 ms |
43280 KB |
Output is correct - 최대 카드수 : 5 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
544 ms |
43280 KB |
Output is correct - 최대 카드수 : 5 |