# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4978 | 2014-01-23T16:44:26 Z | lingxiang | 쉬운 문제 (GA3_easy) | C++ | 0 ms | 0 KB |
int CountPair(int N,int a[]) { int cnt=0; for(int i=0;i<N;i++) { for(int j=i+1;j<N;j++) { if(a[j]%a[i]==0) cnt++; } } printf("%d",cnt); return 0; }