-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfibb.c
218 lines (156 loc) · 3.15 KB
/
fibb.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
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
#include <stdlib.h>
#include <stdio.h>
void fibbInt(){
int a = 0;
int n1 = 0;
int n2 = 1;
while (3 > 2){
n2 = n1 + n2;
n1 = n2 - n1;
a++;
if (n2 < 0){
printf("el valor maximo en Int es %d \t valor: %d\n", a , n1);
break;
}
}
}
void fibbUInt(){
int a = 0;
unsigned int n1 = 0;
unsigned int n2 = 1;
while (3 > 2){
n2 = n1 + n2;
n1 = n2 - n1;
a++;
if (n2 < n1){
printf("el valor maximo en UInt es %d \t valor: %u\n", a , n1);
break;
}
}
}
void fibbChar(){
int a = 0;
char n1 = 0;
char n2 = 1;
while (3 > 2){
n2 = n1 + n2;
n1 = n2 - n1;
a++;
if (n2 < 0){
printf("el valor maximo en char es %d \t valor: %d\n", a , n1);
break;
}
}
}
void fibbUChar(){
int a = 0;
unsigned char n1 = 0;
unsigned char n2 = 1;
while (3 > 2){
n2 = n1 + n2;
n1 = n2 - n1;
a++;
if (n2 < n1){
printf("el valor maximo en uchar es %d \t valor: %u\n", a , n1);
break;
}
}
}
void fibbShort(){
int a = 0;
short n1 = 0;
short n2 = 1;
while (3 > 2){
n2 = n1 + n2;
n1 = n2 - n1;
a++;
if (n2 < 0){
printf("el valor maximo en short es %d \t valor: %d\n", a , n1);
break;
}
}
}
void fibbUShort(){
int a = 0;
unsigned short n1 = 0;
unsigned short n2 = 1;
while (3 > 2){
n2 = n1 + n2;
n1 = n2 - n1;
a++;
if (n2 < n1){
printf("el valor maximo en ushort es %d\t valor: %u\n", a , n1);
break;
}
}
}
void fibbLong(){
int a = 0;
long n1 = 0;
long n2 = 1;
while (3 > 2){
n2 = n1 + n2;
n1 = n2 - n1;
a++;
if (n2 < 0){
printf("el valor maximo en long es %d\t valor: %li\n", a , n1);
break;
}
}
}
void fibbULong(){
int a = 0;
unsigned long n1 = 0;
unsigned long n2 = 1;
while (3 > 2){
n2 = n1 + n2;
n1 = n2 - n1;
a++;
if (n2 < n1){
printf("el valor maximo en ulong es %d\t valor: %lu\n", a , n1);
break;
}
}
}
void fibbLongl(){
int a = 0;
long long n1 = 0;
long long n2 = 1;
while (3 > 2){
n2 = n1 + n2;
n1 = n2 - n1;
a++;
if (n2 < 0){
printf("el valor maximo en longl es %d\t valor: %lli\n", a , n1);
break;
}
}
}
void fibbULongl(){
int a = 0;
unsigned long long n1 = 0;
unsigned long long n2 = 1;
while (3 > 2){
n2 = n1 + n2;
n1 = n2 - n1;
a++;
if (n2 < n1){
printf("el valor maximo en ulongl es %d\t valor: %llu\n", a , n1);
break;
}
}
}
int main(int argc, char const *argv[])
{
fibbInt();
fibbUInt();
fibbChar();
fibbUChar();
fibbShort();
fibbUShort();
fibbLong();
fibbULong();
fibbLongl();
fibbULongl();
return 0;
}