Cod sursa(job #1976362)
Utilizator | Data | 3 mai 2017 10:25:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int main()
{
int n, i, y, rez=0, v[1000];
in>>n;
for(i=0;i<1000;i++)
{
v[i]=1;
}
for (i=2; i<n; i++)
{
if (v[i]==1)
{
for (y=i*2;y<n;y+=i)
{
v[y]=0;
}
rez++;
}
}
out<<rez;
return 0;
}