Cod sursa(job #1079432)
Utilizator | Data | 12 ianuarie 2014 12:59:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,v[2000001],i,s,p,q;
int main()
{
f>>n;
v[1]=1;
s=1;
for(i=3;i<=n;i+=2)
{
p=2;q=i;
if(v[i]==0)
s++;
while(p*q<=n)
{
v[p*q]=1;
p++;
}
}
g<<s;
return 0;
}