Cod sursa(job #1373386)
Utilizator | Data | 4 martie 2015 18:21:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
char a[2000005];
int n, m, ok, k, i, q, p, l;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=2; i<=n; i++)
{
if(a[i]==0)
{
ok++;
k=i;
while(k<=n)
{
a[k]++;
k+=i;
}
}
}
fout<<ok;
return 0;
}