Cod sursa(job #1005552)
| Utilizator | Data | 5 octombrie 2013 11:38:25 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.77 kb |
#include<fstream>
#include<cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, i, a, q, t, j, v[2000001];
int main() {
fin>>n;
q=0;
v[1]=1;
for(i=1; i<=n; i++){
/*if(i==1)
v[i]=1;
else
for(j=2; j<=n; j++)
if((i%j==0)&&(i/j==1)){
t=0;
break;
}else if(i%j==0)
t=1;
if(t==0)
v[i]=0;
else
v[i]=1;
*/
if(v[i]==0){
for(j=2*i;j<=n;j+=i){
v[j]=1;
}
}
}
for(i=1; i<=n; i++)
if(v[i]==0)
q++;
fout<<q<<" ";
return 0;
}
