Cod sursa(job #368902)
Utilizator | Bobu Andreea andreea1cool | Data | 26 noiembrie 2009 14:46:30 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<iostream.h>
#include<stdio.h>
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n,o=2,d,v[10000],i,j;
cin>>n;
for(i=1;i<=n;i++){
v[i]=i;
}
v[1]=-1;
for(i=2;i<=n;i++){
if(v[i]>0){
for(j=i+i;j<=n;j+=i)
if(v[j]>0)
v[j]=-v[j];
}
}
for(i=1;i<=n;i++){
if(v[i]>0){
cout<<v[i]<<",";
}
}
return 0;
}