Timeline for Fibonacci + Fizz Buzz = Fibo Nacci!
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 12, 2015 at 21:54 | comment | added | user16488 |
You could use the gnu dialect and use __uint128_t, maybe.
|
|
| Nov 10, 2015 at 2:25 | comment | added | user45941 | Perhaps, but at least it would be a valid entry. | |
| Nov 9, 2015 at 22:47 | history | edited | mbomb007 | CC BY-SA 3.0 |
added 1 character in body
|
| Nov 9, 2015 at 22:17 | history | edited | Zereges | CC BY-SA 3.0 |
added 1 character in body
|
| Nov 9, 2015 at 22:17 | comment | added | Zereges | @Mego Implementing addition of those strings would require much more effort. | |
| Nov 9, 2015 at 21:27 | comment | added | user45941 | Strings can be arbitrarily long (until you run out of memory). And you're right, I messed up my comment. Still, you could compute the digital sum to determine divisibility by 3. | |
| Nov 9, 2015 at 21:12 | comment | added | Zereges | @Mego I do not understand you. How it would help me to handle values, which do not fit into 64 bits. Also, You need all digits to find out if the number is divisible by 3. | |
| Nov 9, 2015 at 20:23 | comment | added | user45941 |
You could use exploded strings (template <char H, char ...T>) in your templates to (theoretically) handle arbitrary-length values. Then it would just be a matter of examining the last 2 characters in each string to determine divisibility by 2 and/or 3.
|
|
| Nov 9, 2015 at 18:46 | history | answered | Zereges | CC BY-SA 3.0 |