Cod sursa(job #1502455)
Utilizator | Data | 14 octombrie 2015 17:45:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
bool a[100000000];
int i,n,j,k;
int main()
{
f>>n;
a[2]=true;
for(i=3;i<=n;i+=2){
if(a[i]==0)
{
k++;
for(j=i;j<=n;j+=i)
a[j]=1;
}
}
g<<k+1;
return 0;
}