Pagini recente » Cod sursa (job #3185058) | Cod sursa (job #1433107) | Cod sursa (job #326560) | Cod sursa (job #130612) | Cod sursa (job #669075)
Cod sursa(job #669075)
#include <fstream>
using namespace std;
int main()
{
int n;
int phi[10000];
ifstream in("fractii.in");
in >> n;
in.close();
for (int i = 1; i <= n; ++i)
phi[i] = i-1;
for (int i = 2; i <= n; ++i)
{
for (int j = 2*i; j <= n; j+=i)
phi[j] -= phi[i];
}
int total=0;
for (int i = 2; i<=n;++i)
total+=phi[i];
ofstream out("fractii.out");
out << 2*total + 1;
out.close();
return 0;
}