oj.uz

Submission #649

# Submission time Handle Problem Language Result Execution time Memory
649 2013-02-28T20:23:34 Z solve 쉬운 문제 (GA3_easy) C++
40 / 100
 0 ms 1404 KB 
#include <iostream>
#include <set>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
#include <cstdlib>
#include <memory.h>
#include <sstream>
#include <math.h>

using namespace std;

#define INF 1<<30

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

Subtask #1
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1404 KB Output is correct
2 Correct 0 ms 1404 KB Output is correct
3 Correct 0 ms 1404 KB Output is correct
4 Correct 0 ms 1404 KB Output is correct
5 Correct 0 ms 1404 KB Output is correct
6 Correct 0 ms 1404 KB Output is correct
7 Correct 0 ms 1404 KB Output is correct
8 Correct 0 ms 1404 KB Output is correct
9 Correct 0 ms 1404 KB Output is correct
10 Correct 0 ms 1404 KB Output is correct

Subtask #2
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1404 KB Output isn't correct
2 Halted 0 ms 0 KB -
3 Halted 0 ms 0 KB -
4 Halted 0 ms 0 KB -
5 Halted 0 ms 0 KB -
6 Halted 0 ms 0 KB -
7 Halted 0 ms 0 KB -
8 Halted 0 ms 0 KB -
9 Halted 0 ms 0 KB -
10 Halted 0 ms 0 KB -