Cod sursa(job #2426912)
Utilizator | Data | 29 mai 2019 23:37:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<iostream>
#include<fstream>
using namespace std;
int n,i,j,cnt;
int main(){
int p[1000000],cnt;
fstream input,output;
input.open("ciur.in.txt");
output.open("ciur.out.txt");
input>>n;
for(i=2;i<=n;i++)
p[i]=1;
for(i=2;i<=n;i++)
if(p[i]==1)
{
cnt++;
for(j=i+i;j<=n;j+=i)
p[j]=0;
}
output<<cnt<<endl;
input.close();
output.close();
return 0;
}