Pagini recente » Cod sursa (job #2180038) | Istoria paginii runda/shiggydiggy123/clasament | Cod sursa (job #2054573) | Cod sursa (job #2241258) | Cod sursa (job #1085994)
#include <fstream>
#include <iostream>
#include<math.h>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int main()
{
long b,k,i,j,a,n,m=0,v,l;
f>>n;
k=n;
for(i=2;i<=n;i++)
{ v=0;
for(l=1;l<=sqrt(i);l++)
if(i%l==0) v=1;
if(v!=0)
{
for(j=1;j<=n;j++)
if(j%i!=0){ a=i;
b=j;
while(a!=b)
if(a>b) a=a-b;
else b=b-a;
if(a==1)
k=k+1;
}}
else k=k+(n-n/i);
}
g<<k;
f.close();
g.close();
}