oj.uz

Submission #702

# Submission time Handle Problem Language Result Execution time Memory
702 2013-03-01T07:43:00 Z Takuma 쉬운 문제 (GA3_easy) C++
100 / 100
 1 ms 912 KB 
int CountPair(int N, int *A)
{
	int i, j, cnt = 0;
	for( i = 1 ; i < N ; i++ )
		 for( j = 0 ; j < i ; j++ )
		 {
		 	if( A[i]%A[j]==0 ) cnt++;
		 }
    return cnt;
}

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 1 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