URI -- 1193 (Base Conversion)
Solution :
-
Solution :
-
Problem Link : http://codeforces.com/problemset/problem/236/A Solution :
-
Problem Link Algorithm used Euclidean GCD (Click the link for Tutorial). Solution :
-
Before Fast Doubling Method, lets discuss some naïve method to find nth fibonacci number. Fibonacci Table 1. Recursive Method : Rec... -
Solution :
-
Problem Link : UVA Problem # 686 ( Goldbach's Conjecture (II)) প্রবলেমটা খুব সহজ কিন্তু আমার বার বার runtime error দেখাইতেছি...
-
Problem Link Problem Name : Number Frequence Problem No : 1171 Solution :
-
Solution :
-
Solution :