Pagini recente » Cod sursa (job #1032544) | Cod sursa (job #1109213) | Cod sursa (job #2625192) | Cod sursa (job #74951) | Cod sursa (job #348724)
Cod sursa(job #348724)
#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
int main() {
fstream f,g;
long int n,nr=0;
long int v[VMAX];
f.open("fractii.in", fstream::in);
g.open("fractii.out", fstream::out);
f>>n;
f.close();
for (long int i = 1; i<=n; i++)
v[i]=i-1;
for (long int i = 2; i<=n; i++) {
for (long int j = 2*i; j<=n; j+=i)
v[j]-=v[i];
nr+=v[i];
}
g<<2*nr+1;
g.close();
return 0;
}