Pagini recente » Cod sursa (job #2812821) | Cod sursa (job #1410632) | Cod sursa (job #1397431) | Cod sursa (job #2828915) | Cod sursa (job #1329854)
#include<iostream>
#include<conio.h>
#include<math.h>
#include<fstream>
using namespace std;
int a,b,n;
int cmmdc(int a,int b)
{ while((a!=b)&&(a>0)&&(b>0))
{if(a>b)a=a-b;
else b=b-a;
}
return a;
}
/*bool prim (int n)
{
if((n%2==0) && (n!=2))
return false;
for(int i=3; i<(n/2); i=i+2)
if(n%i==0)return false;
return true;
}
*/
int main()
{int c=0,s=0;
ifstream f ("fractii.in");
ofstream g ("fractii.out");
/*cout<<"a=";
cin>>a;
cout<<"b=";
cin>>b;
cout<<"Cmmdc="<<cmmdc(a,b)<<"\n";
if(prim(n))cout<<"Numarul este prim"<<"\n";
else cout<<"Numarul nu este prim"<<"\n";
*/
f>>n;
f.close();
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
if(cmmdc(i,j)==1)s+=1;
}
g<<s;
g.close();
return 0;
}