Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
single_digit
//g++ 5.4.0 #include <iostream> using namespace std; int single_digit (int num) { static int sum = 0; if (num<10) { sum = sum + num; return sum; } sum = sum + num%10; single_digit(num/10); //return; } int main() { cout<<single_digit(34)<<endl; }
run
|
edit
|
history
|
help
1
complexity O(log(n))
by Muhammad Bilal, 3 years ago
Please
log in
to post a comment.
Discounting Future Stream
Make Bin Tree
10954
0-1 Knapsack
Vec+Mem+Adv_11
Meeting Time
Get all anagrams from given words
005#
Dynamic Programming For Combinatorics - 1
LALALALALALLLLAAA
complexity O(log(n))
by Muhammad Bilal, 3 years agoPlease log in to post a comment.