# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
754 |
2013-03-02T05:57:42 Z |
CodingIsHard |
쉬운 문제 (GA3_easy) |
C++ |
|
0 ms |
916 KB |
#include <algorithm>
using namespace std;
int CountPair(int N, int *A)
{
int cnt = 0;
sort(A , A + N);
int *end = unique(A , A + N);
for(int *i = A;i != end;i++)
for(int *j = i + 1;j != end;j++)
if(*j % *i == 0)
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 |
- |