-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSeptember7.cpp
More file actions
349 lines (277 loc) · 6.06 KB
/
Copy pathSeptember7.cpp
File metadata and controls
349 lines (277 loc) · 6.06 KB
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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>
int exercise1(int num, int dig);
int exercise2a(int num1, int num2);
void exercise2b();
int exercise3a(int num);
void exercise3b();
int exercise4a(int num);
void exercise4b();
int exercise5a(int num);
void exercise5b();
void exercise6a(int num, int digit);
void exercise6b();
void exercise7a(int *num);
void exercise7b();
int exercise12(int num1, int num2, int num3);
void exercise22(int n);
int exercise32(int num);
int exercise42();
int exercise52(int num);
void exercise62(int *num1, int *num2);
int exercise72(int arr[], int length);
int exercise8(int arr[], int length);
void exercise9(int n);
void exercise10a(int from, int to);
void exercise10b();
int special_num(int num);
void exercise11();
int main()
{
int ans, num1 = 13, num2 = 19, arr[] = {1, 2, 3, 4, 5}, len = sizeof(arr) / sizeof(int);
srand(time(NULL));
ans = exercise1(4204204, 4);
printf("%d \n", ans);
exercise2b();
exercise3b();
exercise4b();
exercise5b();
exercise6b();
exercise7b();
ans = exercise12(3, 3, 2);
printf("%d \n", ans);
exercise22(27);
ans = exercise32(123);
printf("%d \n", ans);
ans = exercise42();
printf("%d \n", ans);
ans = exercise52(123321);
printf("%d \n", ans);
exercise62(&num1, &num2);
exercise72(arr, len);
exercise8(arr, len);
exercise9(4);
exercise10b();
exercise11();
return 0;
}
int exercise1(int num, int dig)
{
int count = 0;
while (num != 0)
{
if (num % 10 == dig) count++;
num /= 10;
}
return count;
}
int exercise2a(int num1, int num2)
{
return (rand() % (num2 - --num1)) + num1 + 1;
}
void exercise2b()
{
int num1, num2;
scanf("%d %d", &num1, &num2);
while (num1 != -999 && num2 != -999)
{
for (int i = 0; i < 5; i++) printf("%d \n", exercise2a(num1, num2));
scanf("%d %d", &num1, &num2);
}
}
int exercise3a(int num)
{
int sum = 0;
while (num != 0)
{
sum += num % 10;
num /= 10;
}
return sum;
}
void exercise3b()
{
int n, num, permnum, sum = 0, res;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d", &num);
res = exercise3a(num);
if (res >= sum || i == 0)
{
permnum = num;
sum = res;
}
}
printf("The last number with the biggest sum of digits is %d with a sum of %d \n", permnum, sum);
}
int exercise4a(int num)
{
int cur = 1, sum = 0;
while (cur != num && num > 1)
{
if (num % cur == 0) sum += cur;
cur++;
}
return (num == sum);
}
void exercise4b() { for (int i = 10; i <= 1000; i++) if (exercise4a(i)) printf("%d \n", i); }
int exercise5a(int num)
{
int digit, temp;
while (num != 0)
{
digit = num % 10;
num /= 10;
temp = num;
while (digit != (temp % 10) && temp > 0) temp /= 10;
if (temp > 0) return 0;
}
return 1;
}
void exercise5b()
{
int ans = 0, num, count = 0;
while (!ans)
{
scanf("%d", &num);
count++;
ans = exercise5a(num);
}
printf("good number was %d and %d numbers were tested before it \n", num, --count);
}
void exercise6a(int num, int digit)
{
int count = 0;
for (int i = 1; num > 0; i++)
{
if (num % 10 == digit)
{
printf("%d ", i);
count++;
}
num /= 10;
}
printf((count == 0) ? "0 \n \n" : "\n \n");
}
void exercise6b()
{
int num;
scanf("%d", &num);
for (int i = 0; i <= 9; i++)
{
printf("%d \n", i);
exercise6a(num, i);
}
}
void exercise7a(int *num)
{
int mul = 1;
while (*num / mul != 0)
{
if ((*num / mul) % 10 == 1)
{
*num -= mul;
*num += mul / 10;
}
mul *= 10;
}
}
void exercise7b()
{
int num, n;
scanf("%d %d", &num, &n);
while (n-- > 0 && num <= 1111) exercise7a(&num);
printf("%d \n", num);
}
int exercise12(int num1, int num2, int num3) { return (num1 == num2) && (num2 == num3); }
void exercise22(int n) { for (int i = 1; i < n; i++) if (i % 3 == 0) printf("%d \n", i); }
int exercise32(int num)
{
int count = 0;
while (num > 0)
{
count++;
num /= 10;
}
return count;
}
int exercise42()
{
char ch;
int ans = 0;
while((ch = getchar()) != '*')
{
if (ch == EOF || ch == '\n') continue;
ans *= 10;
ans += (int)ch - 48;
}
return ans;
}
int exercise52(int num)
{
int mul1 = 1, mul2 = 1;
while (num / mul1 > 10) mul1 *= 10;
int dig1 = num % 10, dig2 = num / mul1;
while (1)
{
if (dig1 != dig2) return 0;
else if (mul1 == mul2 || mul1 == mul2 * 10) return 1;
mul1 /= 10;
mul2 *= 10;
dig1 = (num / mul2) % 10;
dig2 = (num / mul1) % 10;
}
}
void exercise62(int *num1, int *num2)
{
if (num2 > num1)
{
int temp = *num1;
*num1 = *num2;
*num2 = temp;
}
}
int exercise72(int arr[], int length)
{
int count = 0;
for (int i = 0; i < length; i++) if (i > 0 && arr[i] > arr[i - 1]) count++;
return count;
}
int exercise8(int arr[], int length)
{
for (int i = 0; i < length; i++) if (arr[i] > 99 || arr[i] < 10) return 0;
return 1;
}
void exercise9(int n)
{
int layer = 0;
while (layer++ < n)
{
for (int i = layer; i >= 1; i--) printf("%d ", i);
for (int i = 2; i <= layer; i++) printf("%d ", i);
printf("\n");
}
}
void exercise10a(int from, int to) { for (int i = from; i < to; i++) if ((i / 100) + ((i / 10) % 10) == pow(i % 10, 2)) printf("%d \n", i); }
void exercise10b() { exercise10a(500, 600); }
int special_num(int num)
{
int ans = 0, original = num;
while (num != 0)
{
ans *= 10;
ans += num % 10;
num /= 10;
}
return (original * 4 == ans);
}
void exercise11()
{
int count = 0;
for (int i = 1000; i < 10000; i++) if (special_num(i)) count++;
printf("There are %d special numbers with 4 digits \n", count);
}