Pagini recente » Cod sursa (job #678966) | Cod sursa (job #1936148) | Cod sursa (job #2892448) | Cod sursa (job #2110660) | Cod sursa (job #348729)
Cod sursa(job #348729)
#include <fstream>
#include <vector>
#include <algorithm>
#include <cstdlib>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
#define sz(a) int((a).size())
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define tr(c,i) for(typeof((c).begin() i = (c).begin(); i != (c).end(); i++)
#define present(c,x) ((c).find(x) != (c).end())
#define cpresent(c,x) (find(all(c),x) != (c).end())
#define VMAX 1000000
long v[VMAX],n,i,j;
long long nr=1;
int main() {
fstream f,g;
f.open("fractii.in", fstream::in);
g.open("fractii.out", fstream::out);
f>>n;
f.close();
for (i = 1; i<=n; i++)
v[i]=i-1;
for (i = 2; i<=n; i++) {
for (j = 2*i; j<=n; j+=i)
v[j]-=v[i];
nr+=2*v[i];
}
g<<nr;
g.close();
return 0;
}