-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathinput.txt
153 lines (135 loc) · 2.49 KB
/
input.txt
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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
/*=== Sample 10 ===*/
int count;
int result[50];
int abs(int a) {
if (a < 0) {
return (0-a);
} else {
return a;
} endif
}
int isMultiplier(int a, int b) {
int i;
int step;
int flag;
if (b == 0) {
return 0;
} else {
i = 1;
flag = 0;
} endif
if (a < 0) {
if (b < 0) {
i = 1;
} else {
i = 0-1;
} endif
} else {
if (b < 0) {
i = 0-1;
} else {
i = 1;
} endif
} endif
step = i;
i = i - abs(i);
if (abs(i) < abs(a) + 1) {
repeat {
if (i * b == a) {
flag = 1;
break;
} else {
i = i + step;
} endif
} until (abs(a) < abs(i))
} endif
return flag;
}
int integerDivision(int a, int b) {
int i;
int step;
int flag;
if (b == 0) {
return 123456789;
} else {
i = 1;
flag = 0;
} endif
if (a < 0) {
if (b < 0) {
i = 1;
a = a * (0-1);
b = b * (0-1);
} else {
i = 0-1;
a = a * (0-1);
b = b * (0-1);
} endif
} else {
if (b < 0) {
i = 0-1;
} else {
i = 1;
} endif
} endif
step = i;
i = i - abs(i);
if (abs(i) < abs(a) + 1) {
repeat {
if (i * b == a) {
return i;
} else {
int f1;
int f2;
int tmp;
f1 = i * b < a;
tmp = i + step;
f2 = a < tmp * b;
if (f1 == f2) {
tmp = b == abs(b);
return (i + tmp - 1);
} else {
i = i + step;
} endif
} endif
} until (abs(a) < abs(i))
} endif
return 123456789;
}
int isPrime(int a) {
int i;
int halfa;
if (a == 1) {
return 0;
} else {
i = 2;
halfa = integerDivision(a, 2);
if (i < halfa + 1) {
repeat {
if (isMultiplier(a, i)) {
return 0;
} else {
i = i + 1;
} endif
} until (halfa < i)
} endif
return 1;
} endif
}
void printPrimeNumbersLessThan(int a) {
int i;
i = 1;
if (i < a) {
repeat {
i = i + 1;
if (isPrime(i)) {
output(i);
} else {
} endif
} until (a < i + 1)
} endif
}
void main(void) {
int a;
printPrimeNumbersLessThan(20);
}