-
Notifications
You must be signed in to change notification settings - Fork 0
/
Zad3.c
71 lines (56 loc) · 1.19 KB
/
Zad3.c
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
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define min(a,b) a<b ? a:b
int minimalno_koraka_rekurzija(int n, int *memo)
{
if (n == 1)
return 0;
if (memo[n] != -1)
return memo[n];
int rez = minimalno_koraka_rekurzija(n - 1, memo);
if (n % 2 == 0)
rez = min(rez, minimalno_koraka_rekurzija(n / 2, memo));
if (n % 3 == 0)
rez = min(rez, minimalno_koraka_rekurzija(n / 3, memo));
memo[n] = 1 + rez;
return memo[n];
}
int koraci(int n)
{
int *memo = malloc(sizeof(int)*n+1);
for (int i = 0; i <= n; i++)
memo[i] = -1;
return minimalno_koraka_rekurzija(n, memo);
}
int minimalno_koraka(int n) { // O(n)
int min = 0;
if (n < 2)
return 0;
while (n != 1) {
if ((n - 1) % 3 == 0 && (n / 2) % 2 != 0) {
n--; n /= 3; min += 2;
}
else if (n % 3 == 0) {
n /= 3; min++;
}
else if ((n - 1) % 2 == 0 && (n / 3) % 3 != 0) {
n--; n /= 2; min += 2;
}
else if (n % 2 == 0) {
n /= 2; min++;
}
else {
n--; min++;
}
}
return min;
}
int main() {
int n = 0;
scanf("%d", &n);
putchar('\n');
printf("%d", minimalno_koraka(n)); //O(n)
printf("\n%d", koraci(n));
return 0;
}