Cod sursa(job #1509045)
Utilizator | Data | 23 octombrie 2015 14:08:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
int main()
{
int n,i,taiat[100],poz,s,j;
cin>>n;
for(i=1;i<=n;i++)
taiat[i]=0;
for(i=2;i<=n;i++)
{
if(taiat[i] == 0)
for(j=i+i;j<=n;j=j+i)
{
taiat[j]=1;
}
}
for(i=1;i<=n;i++)
cout<<taiat[i]<<" ";
return 0;
}