Cod sursa(job #1389281)
Utilizator | Data | 16 martie 2015 09:46:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <cstdlib>
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool v[2000001];
int main()
{
int n,i,k=0,j;
f>>n;
for(i=2;i*i<=n;i++)
{ if(v[i]==0)
for(j=i*i;j<=n;j=j+i)
v[j]=1;}
for(i=2;i<n;i++)
if(v[i]==0)
k++;
g<<k;}