Cod sursa(job #2061860)
Utilizator | Data | 9 noiembrie 2017 19:32:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream c("ciur.out");
int main()
{ long long N;
int i,j,k,v[1000];
f>>N;
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[j]-v[i];
c<<v[j]<<'\n';
}
return 0;
}