Pagini recente » Cod sursa (job #1581644) | Monitorul de evaluare | Cod sursa (job #456427) | Cod sursa (job #164614) | Cod sursa (job #2674543)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int N,M[2][1000000],i=1,p=1,q=1,d,S=0;
int main()
{
fin>>N;
while(i<=N*N)
{
M[1][i]=p;
p++;
M[2][i]=q;
for(d=2;d<=N;d++)
if(M[1][i]%d==0&&M[2][i]%d==0||M[1][i]==M[2][i]&&M[1][i]!=1)
{
M[1][i]=0;
M[2][i]=0;
}
if(p==N+1)
{
q++;
p=1;
}
if(M[1][i]!=0&&M[2][i]!=0)
S++;
i++;
}
fout<<S-1;
return 0;
}