Cod sursa(job #1494893)
Utilizator | Data | 1 octombrie 2015 22:54:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
using namespace std;
int main ()
{
int N,i,j,k,x,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]!=0)
{
k++;
}
for(j=2;j<=N;j++)
{
x=i*j;
if(x>>N)
{
break;
}
v[x]=0;
}
}
fout<<k;
}