# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
545 |
2013-02-28T12:23:34 Z |
a01077483940 |
쉬운 문제 (GA3_easy) |
C++ |
|
0 ms |
912 KB |
int CountPair (int N, int *A)
{
int ans = 0;
for (int i=0; i<N; i++)
for (int j=i+1; j<N; j++)
if (A[j]%A[i] == 0) ans++;
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
912 KB |
Output is correct |
2 |
Correct |
0 ms |
912 KB |
Output is correct |
3 |
Correct |
0 ms |
912 KB |
Output is correct |
4 |
Correct |
0 ms |
912 KB |
Output is correct |
5 |
Correct |
0 ms |
912 KB |
Output is correct |
6 |
Correct |
0 ms |
912 KB |
Output is correct |
7 |
Correct |
0 ms |
912 KB |
Output is correct |
8 |
Correct |
0 ms |
912 KB |
Output is correct |
9 |
Correct |
0 ms |
912 KB |
Output is correct |
10 |
Correct |
0 ms |
912 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
912 KB |
Output is correct |
2 |
Correct |
0 ms |
912 KB |
Output is correct |
3 |
Correct |
0 ms |
912 KB |
Output is correct |
4 |
Correct |
0 ms |
912 KB |
Output is correct |
5 |
Correct |
0 ms |
912 KB |
Output is correct |
6 |
Correct |
0 ms |
912 KB |
Output is correct |
7 |
Correct |
0 ms |
912 KB |
Output is correct |
8 |
Correct |
0 ms |
912 KB |
Output is correct |
9 |
Correct |
0 ms |
912 KB |
Output is correct |
10 |
Correct |
0 ms |
912 KB |
Output is correct |