# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
752 |
2013-03-02T05:42:38 Z |
CodingIsHard |
쉬운 문제 (GA3_easy) |
C++ |
|
0 ms |
916 KB |
#include <algorithm>
int CountPair(int N, int *A)
{
int cnt = 0;
std::sort(A , A + N);
for(int i = 0;i < N;i++)
for(int j = i + 1;j < N;j++)
if(A[j] % A[i] == 0 && A[j] > A[i])
cnt++;
return cnt;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
916 KB |
Output is correct |
2 |
Correct |
0 ms |
916 KB |
Output is correct |
3 |
Correct |
0 ms |
916 KB |
Output is correct |
4 |
Correct |
0 ms |
916 KB |
Output is correct |
5 |
Correct |
0 ms |
916 KB |
Output is correct |
6 |
Correct |
0 ms |
916 KB |
Output is correct |
7 |
Correct |
0 ms |
916 KB |
Output is correct |
8 |
Correct |
0 ms |
916 KB |
Output is correct |
9 |
Correct |
0 ms |
916 KB |
Output is correct |
10 |
Correct |
0 ms |
916 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
916 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
3 |
Halted |
0 ms |
0 KB |
- |
4 |
Halted |
0 ms |
0 KB |
- |
5 |
Halted |
0 ms |
0 KB |
- |
6 |
Halted |
0 ms |
0 KB |
- |
7 |
Halted |
0 ms |
0 KB |
- |
8 |
Halted |
0 ms |
0 KB |
- |
9 |
Halted |
0 ms |
0 KB |
- |
10 |
Halted |
0 ms |
0 KB |
- |