Cod sursa(job #1550713)
Utilizator | Data | 14 decembrie 2015 16:24:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int i,j,m,n;
char v[2000005];
int main()
{
f>>n;
m=0;
for(i=2;i*i<=n;i++)
{
if(v[i]==0)
{
for(j=i*i;j<=n;j=j+i)
v[j]=1;
}
}
for(i=2;i<=n;i++)
if(v[i]==0)
m++;
g<<m;
return 0;
}