Mai intai trebuie sa te autentifici.
Cod sursa(job #1447385)
| Utilizator | Data | 4 iunie 2015 11:37:13 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <stdio.h>
#include <cstring>
#include <bitset>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <stdlib.h>
#include <time.h>
#include <deque>
#define nmax 10000010
using namespace std;
int n,i,j;
long long sol[nmax];
int main(){
//freopen("fractii.in","r",stdin);
//freopen("fractii.out","w",stdout);
scanf("%d",&n);
for (i=1;i<=n;i++) sol[i]=i-1;
for (i=2;i<=n;i++)
for (j=2*i;j<=n;j+=i)
sol[j]=sol[j]-sol[i];
sol[1]=1;
for (i=2;i<=n;i++)
sol[i]=2*sol[i]+sol[i-1];
printf("%lld\n",sol[n]);
return 0;
}
