oj.uz

Submission #12834

# Submission time Handle Problem Language Result Execution time Memory
12834 2015-01-09T23:58:09 Z yongwhan 쉬운 문제 (GA3_easy) C++
100 / 100
 0 ms 1088 KB 
int CountPair(int N, int A[]) {
  int ret=0;
  for (int i=0; i<N; i++) for (int j=i+1; j<N; j++) {
    int x=A[i], y=A[j];
    if(x) if(y%x==0) ret++;
  }
  return ret;
}

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