Cod sursa(job #2142162)
Utilizator | Data | 24 februarie 2018 19:55:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,ciur[100001],k;
int main()
{
f>>n;
for(i=2; i<=n; i++)
if(ciur[i]==0)
for(j=2; i*j<=n; j++)
ciur[i*j]=1;
for(i=2; i<=n; i++)
if(ciur[i]==0)
g<<i<<" ";
}