Pagini recente » Cod sursa (job #527854) | Cod sursa (job #3197234) | Cod sursa (job #2821703) | Cod sursa (job #280324) | Cod sursa (job #1109276)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int N;
int divizor(int a,int b)
{
while((a>1)&&(b>1))
{if(a%b==0) return 0;
else if((a%2==0)&&(b%2==0)) return 0;
else {if (a>b) a=a-b;
else b=b-a;}
}
return 1;
}
int main()
{ f>>N;
int nrFractii=0;
for(int i=1;i<=N;i++)
{ if (i%2==0) for (int j=1;j<=N;j=j+2)
if(divizor(j,i)==1) nrFractii++;
else {for (int j=1;j<=N;j=j++)
if(divizor(j,i)==1) nrFractii++;} }
g<<nrFractii<<'\n';
}