# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
56354 |
2018-07-11T06:48:40 Z |
leejseo |
쉬운 문제 (GA3_easy) |
C++ |
|
3 ms |
792 KB |
int CountPair(int N, int *A){
int ans = 0;
for (int i=0; i<N; i++){
for(int j=0; j<i; j++) ans += (A[i]%A[j] == 0);
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
488 KB |
Output is correct |
3 |
Correct |
3 ms |
488 KB |
Output is correct |
4 |
Correct |
2 ms |
620 KB |
Output is correct |
5 |
Correct |
2 ms |
620 KB |
Output is correct |
6 |
Correct |
2 ms |
620 KB |
Output is correct |
7 |
Correct |
2 ms |
620 KB |
Output is correct |
8 |
Correct |
2 ms |
644 KB |
Output is correct |
9 |
Correct |
3 ms |
792 KB |
Output is correct |
10 |
Correct |
3 ms |
792 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
792 KB |
Output is correct |
2 |
Correct |
2 ms |
792 KB |
Output is correct |
3 |
Correct |
3 ms |
792 KB |
Output is correct |
4 |
Correct |
2 ms |
792 KB |
Output is correct |
5 |
Correct |
2 ms |
792 KB |
Output is correct |
6 |
Correct |
2 ms |
792 KB |
Output is correct |
7 |
Correct |
2 ms |
792 KB |
Output is correct |
8 |
Correct |
2 ms |
792 KB |
Output is correct |
9 |
Correct |
2 ms |
792 KB |
Output is correct |
10 |
Correct |
3 ms |
792 KB |
Output is correct |