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
|
import std.stdio;
import std.math;
import std.string;
import std.file;
import std.regex;
struct rationnel{
int num;
int den;
};
alias rationnel rat;
int main(){
int n;
write("n : ");
readf(" %s",&n);
SB(n);
return 0;
}
void SB(int n){
int cn = 0;
File file = File("0.txt","w");
file.write("0/1\n1/0");
file.close;
while(cn < n)
{
writeln("Generating SB(",cn+1,").");
File from = File(_cast(cn)~".txt","r");
File to = File(_cast( cn+1)~".txt","w");
string A;
string B;
A = chomp(from.readln());
rat a = extract(A);
rat b;
to.write(A);
while(!from.eof())
{
B = chomp(from.readln());
b = extract(B);
rat q = oplus(a,b);
to.write("\n",q.num,"/",q.den,"\n");
to.write(B);
a = b;
}
from.close;
to.close;
cn++;
}
}
string _cast ( int n){
string s;
if (n==0) return "0";
int nb = cast (int) trunc(log(cast (real) n)/log(10));
int [] num;
while(nb>=0)
{
num ~= n / 10^^(nb);
n -= num[$-1]*10^^(nb);
nb--;
}
char [] c;
foreach(i; num)
{
switch (i)
{
case 0 : c ~= '0';
break;
case 1 : c ~= '1';
break;
case 2 : c ~= '2';
break;
case 3 : c ~= '3';
break;
case 4 : c ~= '4';
break;
case 5 : c ~= '5';
break;
case 6 : c ~= '6';
break;
case 7 : c ~= '7';
break;
case 8 : c ~= '8';
break;
case 9 : c ~= '9';
break;
default : writeln("Bad symbol encountered : ", i,".");
break;
}
}
return cast (string) c;
}
int __cast(string s){
char [] c = cast (char[]) s;
int [] num;
foreach(i; c)
{
switch (i)
{
case '0' : num ~= 0;
break;
case '1' : num ~= 1;
break;
case '2' : num ~= 2;
break;
case '3' : num ~= 3;
break;
case '4' : num ~= 4;
break;
case '5' : num ~= 5;
break;
case '6' : num ~= 6;
break;
case '7' : num ~= 7;
break;
case '8' : num ~= 8;
break;
case '9' : num ~= 9;
break;
default : writeln("Bad symbol encountered : ", i,".");
break;
}
}
num = num.reverse;
int a = 0;
for (int i = 0; i<num.length; i++)
{
a += num[i] * 10^^i;
}
return a;
}
rat extract(string s){
s = chomp(s);
auto r = regex("([0-9]+)/([0-9]+)$");
auto m = match(s, r);
return simple(rat(__cast( m.captures[1]),__cast( m.captures[2])));
}
rat oplus(rat q1, rat q2){
q1 = simple(q1);
q2 = simple(q2);
return simple(rat(q1.num + q2.num, q1.den + q2.den));
}
int pgcd (int a, int b){
int r = 1;
if (a == 0 && b== 0) return 1;
if (a == 0) return b;
if (b == 0) return a;
while(r != 0)
{
r = a % b;
a = b;
b = r;
}
return a;
}
rat simple(rat q){
int g = pgcd(q.num, q.den);
return rat(q.num/g , q.den / g);
} |
Suite de Stern-Brocot, erreur de segmentation
Répondre avec citation
Partager