Cod sursa(job #983448)
| Utilizator | Data | 11 august 2013 20:22:36 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <iostream>
#include <cmath>
#include <bitset>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bitset <2000000> a;
char b[2000000];
int u,i,j,nr;
int main()
{
f>>u;
nr=u;
for (i=2;i*i<=u;i++)
for (j=i*i;j<=u;j+=i)
{
if (a[j]==0)
{
nr--;
a[j]=1;
}
}
g<<nr-1;
f.close();
g.close();
}
