Cod sursa(job #1437592)
Utilizator | Data | 17 mai 2015 23:34:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int j,n,nr=1;
ifstream f("ciur.in");
f>>n;
char v[n+1];
for (int i=2;i<=n;i++) v[i]=0;
j=3;
while (j<=n)
{
cout<<j<<" ";
nr++;
for (int i=j;i<=n;i=i+j) v[i]=1;
while (v[j]==1) j+=2;
}
ofstream g("ciur.out");
g<<nr;
return 0;
}