Cod sursa(job #1962016)
Utilizator | Data | 11 aprilie 2017 15:16:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream in ("dicsi.in");
ofstream out ("dicsi.out");
int main()
{ int n,i,mx=0,v[100000],j;
in>>n;
for(i=1;i<=n;i++)
{
v[i]=1;
}
for(i=1;i<=n;i++)
{
for(j=i+i;j<=n;j=j+i)
{
if(v[j]==v[i])
v[j]++;
if(v[i]>mx) mx=v[i];
}
}
out<<mx+1<<'\n';
for(i=1;i<=n;i++)
out<<v[i]<<" ";
return 0;
}