# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
5366 | 2014-04-12T16:14:44 Z | ansol4328 | 쉬운 문제 (GA3_easy) | C++ | 0 ms | 0 KB |
int CountPair(n,*a) { int cnt=0, i, j; for(i=0 ; i<n ; i++) for(j=i+1 ; j<n ; j++) if(a[j]%a[i]==0) cnt++; return cnt; }