Cod sursa(job #1502675)
Utilizator | Data | 14 octombrie 2015 21:49:26 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include<fstream>
#define MAX 1000001
using namespace std;
int main(){
ifstream in("fractii.in");
in>>n;
for(int i=2;i<=n;++i)
x[i] = i-1;
for(int i=2;i<=n;++i)
{
nr += 2*xi];
for(int j=2*i;j<=n;j+=i)
a[j] -= a[i];
}
ofstream out("fractii.out");
out<<nr;
in.close();
out.close();
return 0;
}