# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
651 |
2013-02-28T21:06:37 Z |
solve |
쉬운 문제 (GA3_easy) |
C++ |
|
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;
for(int i = 0;i<N;i++) {
for(int j = i + 1;j<N;j++) {
if(A[j]%A[i] == 0) res++;
}
}
return res;
}
# |
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 |
# |
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 |