# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3026 | movie_jo | 쉬운 문제 (GA3_easy) | C11 | 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(void)
{
int A[50],N,i,j,S=0;
scanf("%d",&N);
for(i=0;i<N;i++)
scanf("%d",A+i);
for(i=0;i<N;i++)
{
for(j=i+1;j<N;j++)
{
if(A[j]%A[i]==0)
S++;
}
}
printf("%d",S);
return 0;
}