Cod sursa(job #147520)
Utilizator | Data | 3 martie 2008 09:20:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 2.16 kb |
#include<fstream>
using namespace std;
#define input "ciur.in"
#define output "ciur.out"
ifstream fin(input);
ofstream fout(output);
int main ()
{
long long unsigned n,div,i,k,l=1,nr=0;
long long unsigned a[99999];
fin>>k;
i=1;
a[1]=2;
a[2]=3;
nr=2;
while(nr!=k-1)
{div=0;
i++;
for(n=1;n<=nr;n++)
{if(i%a[n]==0)
div++;
}
if(div==0)
{
nr++;
a[nr]=i;
}
}
for(i=1;i<=nr;i++)
{
/* if(a[i]<=9)
fout<<" ";
if(a[i]<=99)
fout<<" ";
if(a[i]<=999)
fout<<" ";
if(a[i]<=9999)
fout<<" ";
if(a[i]<=99999)
fout<<" ";*/
fout<<a[i]%10<<",";
/* if(i%15==0)
fout<<endl;*/
}
return 0;
}