-
Notifications
You must be signed in to change notification settings - Fork 0
/
problema_27.cpp
64 lines (48 loc) · 1.17 KB
/
problema_27.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include <fstream>
using namespace std;
bool prim(unsigned int n)
{
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (unsigned int i = 5; i * i <= n; i += 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
void eliminare(unsigned int a[], unsigned int &n, unsigned int poz)
{
for (unsigned int i = poz; i < n; ++i) a[i] = a[i + 1];
--n;
}
int main()
{
fstream f("date.in", ios::in);
fstream g("date.out", ios::out);
unsigned int a[101][101];
unsigned int prime[101 * 101];
unsigned int index = 1;
unsigned int n;
f >> n;
for (unsigned int i = 1; i <= n; ++i)
for (unsigned int j = 1; j <= n; ++j)
{
f >> a[i][j];
if (prim(a[i][j])) prime[index++] = a[i][j];
}
for (unsigned int i = 1; i <= n; ++i)
{
for (unsigned int j = 1; j <= n; ++j) g << a[i][j] << ' ';
g << '\n';
}
for (unsigned int i = 1; i < index; ++i) g << prime[i] << ' ';
g << '\n';
for (unsigned int i = 1; i < index; ++i)
if (prime[i] > 9 && ((prime[i] % 100) / 10) % 2 == 1)
{
eliminare(prime, index, i);
--i;
}
for (unsigned int i = 1; i < index; ++i) g << prime[i] << ' ';
f.close();
return 0;
}