A C++ rational (fraction) template class
All interview question.
The conjecture can be summarized as follows. Take any positive integer n. If n is even, divide it by 2 to get n / 2. If n is odd, multiply it by 3 and add 1 to obtain 3n + 1. Repeat the process (which has been called "Half Or Triple Plus One", or HOTPO) indefinitely. The conjecture is that no matter what number you start with, you will always ev…
My Codeforces handle is hobe_naki_hobe_na. Max Rating is 1647
This Repository contains all the works done in the activities and the competitions of competitive programming cell.
Implementation All Kind of Algorithm .. Such as..... Back-traking,Dinamic Progra, FBS,DFS,Number theory,Search Algorithm,Diakastra,Floyed Warshal,Hamiltonpath,KMP,Longest Common Subsequence,Robin Cup Pattern Maching,Selection Sort
A small collection of tools to work with rational numbers
Add a description, image, and links to the numbertheory topic page so that developers can more easily learn about it.
To associate your repository with the numbertheory topic, visit your repo's landing page and select "manage topics."