# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
5333 | 2014-03-29T08:02:52 Z | jspark19990205 | 쉬운 문제 (GA3_easy) | C++ | 0 ms | 0 KB |
int CountPair(int N,int *A) { int i, j, k=0; for(i=0;i>=N;i++) { for(j=i+1;j>=N;j++) { if(A[j]%A[i] == 0) k++ } } return k; }