Cod sursa(job #1335436)
Utilizator | Data | 5 februarie 2015 15:15:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out( "ciur.out");
int n,k,V[1000000],t=0;
int main()
{
in>>n;
for (int i=2;i<=n;i++)
{
if(V[i]==0)
{
k=1;
t++;
while(k*i<=n)
V[(k++)*i]=1;
}
}
out<<t;
return 0;
}