Cod sursa(job #1204982)
Utilizator | Data | 4 iulie 2014 16:28:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
char A[2000005];
int N,k;
int main() {
int i,j;
cin>>N;
for(i=2;i<=N;i++)
A[i]=1;
for(i=2;i<=N;i++){
if(A[i])
{
k++;
A[i]=0;
for(j=i+i;j<=N;j+=i)
A[j]=0;
}
}
cout<<k;
return 0;
}