Cod sursa(job #2023058)
Utilizator | Data | 18 septembrie 2017 09:53:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,cnt=1;
bool v[2000005];
int main()
{
int i,j;
f>>n;
v[2]=1;
for(i=3;i<=n;i+=2)
if(v[i]==0)
{
cnt++;
for(j=i+i;j<=n;j+=i)
v[j]=1;
}
g<<cnt;
return 0;
}