Nu exista pagina, dar poti sa o creezi ...
Cod sursa(job #825546)
| Utilizator | Data | 29 noiembrie 2012 10:28:44 | |
|---|---|---|---|
| Problema | Fractii | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include<stdio.h>
#include<iostream>
using namespace std;
int main()
{
unsigned long long n,nr=0,i,j;
unsigned long long phi[1000000];
FILE *in = fopen("fractii.in", "r");
FILE *out = fopen("fractii.out", "w");
fscanf(in, "%lld", &n);
for(i=1;i<=n;i++)
phi[i] = i-1;
for(i=2;i<=n;++i)
{
for(j=2*i;j<=n;j +=i)
phi[j] -= phi[i];
nr += phi[i];
if(i>=3)
nr += phi[i]-1;
}
nr += n ;
fprintf(out,"%lld", nr);
}
