# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
2916 |
2013-08-03T13:51:55 Z |
kipa00 |
쉬운 문제 (GA3_easy) |
C++ |
|
0 ms |
1088 KB |
int cnt[101];
int CountPair(int N, int *A) {
int i, j, sum = 0;
for (i=0; i<N; ++i) {
for (j=0; j<N; ++j) {
if (*(A + j) % *(A + i) == 0) {
++sum;
}
}
}
return sum;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1088 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1088 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |