Cod sursa(job #660401)
Utilizator | Data | 12 ianuarie 2012 22:03:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
int main()
{
int n,i,nr=0,j;
char ciur[1000001];
ifstream cin("ciur.in");
ofstream cout("ciur.out");
cin>>n;
for(i=2;i<=n;i++)
{if(ciur[i]==0)
{
nr++;
for(j=i+i;j<=n;j=j+i)
ciur[j]=1;}}
cout<<nr;
cin.close();
cout.close();
return 0;}