Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
integerDivision
//Title of this code #include <iostream> unsigned integerDivision(unsigned a, unsigned b) { if (b > a) return 0; int i = 0; do { a -= b; ++i; } while (a >= b); return i; } int main() { std::cout << integerDivision(20,5); }
run
|
edit
|
history
|
help
0
Lex cpp
prime factorization trial division
GRAPH DFS & BFS
Grundy Number
4149 coj TL
printAllPathsInMatrix
Finding the first digit of a number
Loop comparison
ListCPP
Shuffle algorithm