Pagini recente » Cod sursa (job #2199886) | Cod sursa (job #2358272) | Cod sursa (job #500228) | Cod sursa (job #658881) | Cod sursa (job #2699812)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
long long int n;
int gcd(int a,int b) {
if (b == 0)
return a;
else
return gcd(b, (a % b));
}
void solve()
{
long long int s=n;
for(int i=2;i<n;i++) {
for(int j=1;j<=n;j++){
if(gcd(i,j)==1) s+=1;
}
}
fout<<s;
}
int main()
{
fin>>n;
solve();
}