# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7052 | 2014-07-20T10:29:00 Z | koosaga | 쉬운 문제 (GA3_easy) | C++ | 0 ms | 0 KB |
#include <stdio.h> int CountPair(int n, int *A){ for (i=0; i<n-1; i++) { for (j=i+1; j<n; j++) { if(a[j]%a[i]==0) r++; } } return r; }