Cod sursa(job #1954108)
Utilizator | Data | 5 aprilie 2017 10:45:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<iostream>
#include<fstream>
using namespace std;
int n,p[1000005],i,j,a;
int main()
{
ifstream in("ciur.in")
ofstream out("ciur.out");
p[1]=1;
in>>n;
for(i=2;i<=n;i++)
{
if(p[i]==0)
{
for(j=i+i;j<=n;j=j+i)
p[j]=1;
}
}
for(i=1;i<=n;i++)
if(p[i]==0)
a++;
out<<a;
}