Cod sursa(job #1324549)
Utilizator | Data | 22 ianuarie 2015 15:38:54 | |
---|---|---|---|
Problema | Fractii | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <stdio.h>
using namespace std;
#define MAX 10000000
int v[MAX],n;
int main()
{
FILE *fin,*fout;
fin=fopen("fractii.in","r");
fout=fopen("fractii.out","w");
int i,k=0;
fscanf(fin,"%d",&n);
for(i=2;i<=n;i++)
v[i]=i-1;
for(i=2;i<=n;i++)
{
for(int j=i+i; j<=n;j+=i)
{
v[j]=v[j]-v[i];
}
k+=v[i];
}
fprintf(fout,"%d",2*k+1);
return 0;
}