Cod sursa(job #2374775)
Utilizator | Data | 7 martie 2019 20:25:38 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
long long int n,m,i,j,k,sol,x,p,s[1000005];
ifstream f("fractii.in");
ofstream g("fractii.out");
int main()
{
f>>n;
for(i=2;i<=n;i++)
s[i]=i-1;
for(i=2;i<=n;i++)
{
k=k+s[i];
for(j=i+i;j<=n;j=j+i)
s[j]=s[j]-s[i];
}
x=2*p+1;
g<<x;
}