# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
5319 |
2014-03-23T08:29:24 Z |
baneling100 |
쉬운 문제 (GA3_easy) |
C++ |
|
0 ms |
1088 KB |
#include <algorithm>
using namespace std;
int CountPair(int N, int *A)
{
int i, j, cnt=0;
sort(A,A+N);
for(i=0 ; i<N-1 ; i++)
for(j=i+1 ; j<N ; j++)
if(A[j]%A[i]==0)
cnt++;
return cnt;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1088 KB |
Output is correct |
2 |
Correct |
0 ms |
1088 KB |
Output is correct |
3 |
Correct |
0 ms |
1088 KB |
Output is correct |
4 |
Correct |
0 ms |
1088 KB |
Output is correct |
5 |
Correct |
0 ms |
1088 KB |
Output is correct |
6 |
Correct |
0 ms |
1088 KB |
Output is correct |
7 |
Correct |
0 ms |
1088 KB |
Output is correct |
8 |
Correct |
0 ms |
1088 KB |
Output is correct |
9 |
Correct |
0 ms |
1088 KB |
Output is correct |
10 |
Correct |
0 ms |
1088 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1088 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |