Cod sursa(job #1241048)
Utilizator | Data | 12 octombrie 2014 15:38:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr;
char v[2000001];
int ciur(int n)
{
int d=2,nr=0;
while(d<=n)
{
int m=2;
nr++;
v[d]='1';
while(m*d<=n)
{
v[m*d]='1';
m++;
}
while(d<=n&&v[d]=='1')
d++;
}
return nr;
}
int main()
{
f>>n;
vect(n);
g<<ciur(n);
return 0;
}