Cod sursa(job #1800385)
| Utilizator | Data | 7 noiembrie 2016 18:54:26 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,c;
char v[2000001];
int main()
{
f>>n;
v[1]=1;
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
for(j=2*i;j<=n;j=j+i)
{
v[j]=1;
}
}
}
for(i=1;i<=n;i++)
{
if(v[i]==0) c++;
}
g<<c;
return 0;
}
