Pagini recente » Cod sursa (job #2139749) | Cod sursa (job #705054) | Cod sursa (job #438057) | Cod sursa (job #481773) | Cod sursa (job #2973334)
#include <fstream>
#include <cstring>
using namespace std;
int n, cnt;
ifstream cin("fractii.in");
ofstream cout("fractii.out");
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1 ; j <= n; j++)
if (gcd(i, j) == 1) cnt++;
cout << cnt << endl;
return 0;
}
/*#include <iostream>
#include <fstream>
#include <cstring>
#define NMAX 100005
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
bool prime[NMAX];
void eratostene(){
memset(prime,true,sizeof(prime));
prime[1]=0;
for(int i=2;i<=NMAX;i++)
for(int j=2*i;j<=NMAX;j+=i)
prime[j]=false;
}
int cmmdc(int a,int b){
if(b==0){
return a;}
else
return cmmdc(b,a%b);
}
int main()
{
int n;
//fin >> n;
eratostene();
cout<<cmmdc(13,6);
return 0;
}
*/