Cod sursa(job #2155366)
Utilizator | Data | 7 martie 2018 20:14:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
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");
char n,v[2000005];
int main()
{
f>>n;
for(int i=2;i<=n;i++)
v[i]=1;
for(int i=2;i<=n;i++)
{
if(v[i]==1)
{
for(int j=i+i;j<=n;j+=i)
v[j]=0;
}
}
int s=0;
for(int i=2;i<=n;i++)
if(v[i]==1) s++;
g<<s;
return 0;
}