Cod sursa(job #1552126)
Utilizator | Data | 17 decembrie 2015 11:48:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int i,n,j,nr;
bool v[2000010];
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int main()
{
fin >> n;
for(i=2;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)
{
nr=nr+1;
}
}
fout << nr;
}