# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7050 | koosaga | 쉬운 문제 (GA3_easy) | C++98 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
int main(){
int n,i,j=1,r=0;
scanf("%d",&n);
int a[n];
for (i=0; i<n; i++) {
scanf("%d",&a[i]);
}
for (i=0; i<n-1; i++) {
for (j=i+1; j<n; j++) {
if(a[j]%a[i]==0) r++;
}
}
printf("%d",r);
}