oj.uz

Submission #698

# Submission time Handle Problem Language Result Execution time Memory
698 2013-03-01T05:56:10 Z gs12013 쉬운 문제 (GA3_easy) C++
100 / 100
 0 ms 912 KB 
#include <stdio.h>

int CountPair(int N, int *A)
{
	int i, j, ans = 0;
	for(i=0;i<N-1;i++) for(j=i+1;j<N;j++) if(!(A[j]%A[i])) ans++;
	return ans;
}

Subtask #1
40.0 / 40.0

# 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

Subtask #2
60.0 / 60.0

# 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