Pagini recente » Cod sursa (job #1452097) | Cod sursa (job #164667) | Cod sursa (job #253035) | Cod sursa (job #65414) | Cod sursa (job #1892616)
#include <iostream>
#include <fstream>
using namespace std;
int n, i, j, k, nr, d[100000];
bool pr[10000000];
int st, dr, mid;
int main () {
ifstream fin("prim.in");
ofstream fout("prim.out");
fin >> k; n = k+1;
for (i = 2; i <= 10000000; i++)
if (pr[i] == 0)
for (j = 2; i*j<=10000000; j++) pr[i*j] = 1;
i = 2;
while (n != 0)
{
if (pr[i] == 0)
{ nr++; d[nr] = i; n--; }
i++;
}
for (i = 1; i <= k+1; i++) cout << d[i];
fout << d[k+1]*d[k+1];
}