Cod sursa(job #503065)
| Utilizator | Data | 21 noiembrie 2010 12:50:37 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.4 kb |
#include<fstream.h>
#define N 1000//001
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int s[N];
long long t[N];
int main() {
int i,j,n,cu;
long long nr=0;
fin>>n;
for(i=2;i<=n;i++) t[i]=i;
for(i=2;i<=n/2;i++)
if(s[i]==0) {
for(j=2;j*i<=n;j++) {
s[i*j]++;
t[i*j]=t[j*i]*(i-1)/i;
t[i]--;
}
}
for(i=2;i<=n;i++)
nr+=t[i]; nr=nr*2;
nr--;
fout<<nr;
return 0;
}
