Cod sursa(job #1916982)
| Utilizator | Data | 9 martie 2017 10:50:01 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,i,j,k;
char v[2000002];
int main()
{
in>>n;
k=0;
for(i=2;i<=n;i++) v[i]=1;
for(i=2;i<=n;i++)
{
if(v[i]==1)
{
k++;
for(j=i+i;j<=n;j=j+i)
v[j]=0;
}
}
out<<k;
return 0;
}
