oj.uz

Submission #4196

# Submission time Handle Problem Language Result Execution time Memory
4196 2013-09-04T04:48:48 Z dbfud 쉬운 문제 (GA3_easy) C++
100 / 100
 0 ms 1088 KB 
int CountPair(int N, int *A){
    
    int pair = 0;
    
	for ( int i = 0 ;  i < N ; i++ )
        for( int j = 0 ; j < N ; j++)
        {
             if( ( i < j ) && ( A[j] % A[i] ) == 0  )
             {
                      pair++ ;
             }
        }

    return pair ; 
}

Subtask #1
40.0 / 40.0

# 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

Subtask #2
60.0 / 60.0

# 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