Cod sursa(job #2420258)
Utilizator | Data | 11 mai 2019 13:02:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
bool prim[2000000];
int main()
{
f>>n;
int t=0;
for(int i=1;i<=n;i++)
prim[i]=1;
for(int i=2;i<=n;i++)
{
if(prim[i])
{
t++;
for(int j=2*i;j<=n;j+=i)
prim[j]=0;
}
}
g<<t;
return 0;
}