Skip to content

Commit 8e6b8af

Browse files
MorasstcNickolas
authored andcommitted
Add practice problems to Long Arithmetics article (#174)
1 parent 8f0eaa1 commit 8e6b8af

File tree

1 file changed

+18
-0
lines changed

1 file changed

+18
-0
lines changed

src/algebra/big-integer.md

Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -185,3 +185,21 @@ The approach is very simple: a separate integer variable is used to store the va
185185
When two such numbers are multiplied or divided, their exponents should be added or subtracted, respectively. When numbers are added or subtracted, they have to be brought to common exponent first by multiplying one of them by 10 raised to the power equal to the difference of exponent values.
186186

187187
As a final note, the exponent base doesn't have to equal 10. Based on the internal representation of floating-point numbers, it makes most sense to use 2 as the exponent base.
188+
189+
## Practice Problems
190+
191+
192+
* [UVA - How Many Fibs?](https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1124)
193+
* [UVA - Product](https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1047)
194+
* [UVA - Maximum Sub-sequence Product](https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=728)
195+
* [SPOJ - Fast Multiplication](http://www.spoj.com/problems/MUL/en/)
196+
* [SPOJ - GCD2](http://www.spoj.com/problems/GCD2/)
197+
* [UVA - Division](https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1024)
198+
* [UVA - Fibonacci Freeze](https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=436)
199+
* [UVA - Krakovia](https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1866)
200+
* [UVA - Simplifying Fractions](https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1755)
201+
* [UVA - 500!](https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=564)
202+
* [Hackerrank - Factorial digit sum](https://www.hackerrank.com/contests/projecteuler/challenges/euler020/problem)
203+
* [UVA - Immortal Rabbits](https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4803)
204+
* [SPOJ - 0110SS](http://www.spoj.com/problems/IWGBS/)
205+
* [Codeforces - Notepad](http://codeforces.com/contest/17/problem/D)

0 commit comments

Comments
 (0)