Cod sursa(job #1950610)
Utilizator | Data | 3 aprilie 2017 10:28:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream input("ciur.in");
ofstream output("ciur.out");
int n,nr;
char prim[2000001];
int main(void)
{
int i,j;
input >> n;
for(i=2; i<=n; i++)
{
prim[i]=1;
}
for(i=2; i<=n; i++)
{
if(prim[i])
{
nr++;
for(j=2*i; j<=n; j+=i)
{
prim[j]=0;
}
}
}
output << nr;
}