Cod sursa(job #920011)
Utilizator | Data | 19 martie 2013 22:54:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<stdio.h>
#include<fstream>
#include<iostream>
using namespace std;
char v[2000001];
int k;
int main()
{
int n,i,j;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++)
{
if(v[i]==1)
{
j=i;
k++;
while(i*j<=n)
{
v[i*j]=0;
j++;
}
}
}
g<<k;
f.close();
g.close();
return 0;
}