Pagini recente » Cod sursa (job #3228086) | Cod sursa (job #3241867) | Cod sursa (job #2831073) | Cod sursa (job #2629485) | Cod sursa (job #1164476)
#include <iostream>
#include <stdio.h>
using namespace std;
int n;
unsigned long long rez=0;
int m[1000][1000];
FILE *in=fopen("fractii.in","r"),*out=fopen("fractii.out","w");
int main()
{
long i,j,k;
fscanf(in,"%d",&n);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(m[i][j]==0)
{
rez++;
for(k=1;k<=n;k++)
m[i*k][j*k]=1;
}
fprintf(out,"%llu",rez);
return 0;
}