Cod sursa(job #1494882)
Utilizator | Data | 1 octombrie 2015 22:37:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
int main ()
{
int N,i,j,k,v[100];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
k=0;
fin>>N;
for(i=2;i<=N;i++)
{
v[i]=1;
}
for(i=2;i<=N;i++)
{
if(v[i]==1) continue;
k++;
for(j=1;j<=N;j++)
{
if(i*j>>N) break;
v[i*j]=0;
}
}
fout<<k;
}