Cod sursa(job #121053)
Utilizator | Data | 7 ianuarie 2008 18:16:50 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <stdio.h>
char a[160000][160000];
int main()
{ long long n,i,j,p,q,c=0;
FILE*f=fopen("fractii.in","r");
FILE*g=fopen("fractii.out","w");
fscanf(f,"%lld",&n);
for (q=1;q<=n;q++)
for (p=1;p<=n;p++)
if(a[p][q]==0)
{
j=2;
while (p*j<=1600)
{
a[p*j][q*j]=1;
j++;
}
c++;
}
fprintf(g,"%lld",c);
return 0;
}