Cod sursa(job #1571630)
Utilizator | Data | 18 ianuarie 2016 11:33:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
char v[1000002];
int main ()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,contor;
f>>n;
contor=n;
for (i=2; i<=n; i++)
{
if (v[i]==0)
{
for (j=2; j*i<=n; j++)
{
v[i*j]=1;
n--;
}
}
}
g<<contor<<endl;
}