-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path23F.c
164 lines (148 loc) · 3.84 KB
/
23F.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
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
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define CUP_COUNT 9
#define CUP_COUNT2 1000000
#define ROUNDS 100
#define ROUNDS2 10000000
typedef struct Cup{
int label;
int max;
struct Cup *clockwise;
struct Cup *decLabel;
} Cup;
Cup *read(FILE *in, int cupCount);
void play(Cup *cups, int rounds);
Cup *playRound(Cup *current);
void printCups(Cup *cups);
void print2(Cup *cups);
void freeCups(Cup *cups);
int main(int argc, char *argv[])
{
FILE *in = fopen("in23", "r");
Cup *cups = read(in, CUP_COUNT);
play(cups, ROUNDS);
printCups(cups);
freeCups(cups);
rewind(in);
cups = read(in, CUP_COUNT2);
play(cups, ROUNDS2);
print2(cups);
freeCups(cups);
fclose(in);
return 0;
}
void play(Cup *cups, int rounds)
{
for (int i = 1; i <= rounds; i++)
{
//printf("========\nRound %2d\n========\n", i);
cups = playRound(cups);
}
}
void printCups(Cup *cups)
{
while (cups->label != 1)
cups = cups->clockwise;
for (cups = cups->clockwise; cups->label != 1; cups = cups->clockwise)
printf("%d", cups->label);
printf("\n");
}
void print2(Cup *cups)
{
while (cups->label != 1)
cups = cups->clockwise;
int next = cups->clockwise->label;
int next2 = cups->clockwise->clockwise->label;
printf("%d * %d = %ld\n", next, next2, ((long)next) * ((long)next2));
}
void freeCups(Cup *cups)
{
while (cups->label != 1)
cups = cups->clockwise;
for (cups = cups->clockwise; cups->label != 1;)
{
Cup *curr = cups->clockwise;
free(cups);
cups = curr;
}
free(cups);
}
Cup *playRound(Cup *current)
{
Cup *n1 = current->clockwise;
Cup *n2 = n1->clockwise;
Cup *n3 = n2->clockwise;
Cup *dest = current->decLabel;
while (dest == n1 || dest == n2 || dest == n3)
dest = dest->decLabel;
//printf("%d (%d, %d, %d) -> %d\n", current->label, n1->label, n2->label, n3->label, dest->label);
//printCups(current);
current->clockwise = n3->clockwise;
n3->clockwise = dest->clockwise;
dest->clockwise = n1;
return current->clockwise;
}
Cup *read(FILE *in, int cupCount)
{
//printf("Reading %d\n", cupCount);
char *line = NULL;
size_t n = 0;
if (getline(&line, &n, in) <= 0 || *line == '\n' || *line == '\0')
{
fprintf(stderr, "Invalid input\n");
exit(1);
}
Cup *res = calloc(1, sizeof(*res));
Cup *curr = res;
Cup *maxLast = NULL;
for (int i = 0; i < CUP_COUNT; i++)
{
curr->max = cupCount;
curr->label = line[i] - '0';
//printf("Got %d\n", curr->label);
if (curr->label == CUP_COUNT)
maxLast = curr;
if (i+1 < cupCount)
{
curr->clockwise = calloc(1, sizeof(*curr->clockwise));
curr = curr->clockwise;
}
}
for (int i = CUP_COUNT+1; i <= cupCount; i++)
{
curr->max = cupCount;
curr->label = i;
curr->decLabel = maxLast;
maxLast = curr;
if (i < cupCount)
{
curr->clockwise = calloc(1, sizeof(*curr->clockwise));
curr = curr->clockwise;
}
}
Cup *a;
for (a = res; a != NULL && a->decLabel == NULL; a = a->clockwise)
{
//printf("a->label = %d\n", a->label);
Cup *b;
for (b = res; b != NULL; b = b->clockwise)
if (b->label == a->label - 1)
{
a->decLabel = b;
break;
}
// No dec found - start at max
if (b == NULL)
for (b = res; b != NULL; b = b->clockwise)
if (b->label == cupCount)
{
a->decLabel = b;
break;
}
}
//printf("Attaching %d to end of %d\n", res->label, curr->label);
curr->clockwise = res;
free (line);
return res;
}