#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define main dummy_main
int main( ) {
return 0 ;
}
#undef main
class Solution{
public :
int numberOfSteps ( int num) {
int res = 0 ;
while ( num) {
res++ ;
if ( num% 2 == 0 ) {
num / = 2 ;
}
else {
num -- ;
}
}
return res;
}
}
;
// cLay varsion 20200214-1
// --- original code ---
// #define main dummy_main
// {}
// #undef main
//
// class Solution {
// public:
// int numberOfSteps (int num) {
// int res = 0;
// while(num){
// res++;
// num if[num%2==0, /=2, --];
// }
// return res;
// }
// };
I3ByYWdtYSBHQ0Mgb3B0aW1pemUgKCJPZmFzdCIpCiNpbmNsdWRlPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgbWFpbiBkdW1teV9tYWluCmludCBtYWluKCl7CiAgcmV0dXJuIDA7Cn0KI3VuZGVmIG1haW4KY2xhc3MgU29sdXRpb257CiAgcHVibGljOgogIGludCBudW1iZXJPZlN0ZXBzIChpbnQgbnVtKXsKICAgIGludCByZXMgPSAwOwogICAgd2hpbGUobnVtKXsKICAgICAgcmVzKys7CiAgICAgIGlmKG51bSUyPT0wKXsKICAgICAgICBudW0gLz0yOwogICAgICB9CiAgICAgIGVsc2V7CiAgICAgICAgbnVtIC0tOwogICAgICB9CiAgICB9CiAgICByZXR1cm4gcmVzOwogIH0KfQo7Ci8vIGNMYXkgdmFyc2lvbiAyMDIwMDIxNC0xCgovLyAtLS0gb3JpZ2luYWwgY29kZSAtLS0KLy8gI2RlZmluZSBtYWluIGR1bW15X21haW4KLy8ge30KLy8gI3VuZGVmIG1haW4KLy8gCi8vIGNsYXNzIFNvbHV0aW9uIHsKLy8gcHVibGljOgovLyAgIGludCBudW1iZXJPZlN0ZXBzIChpbnQgbnVtKSB7Ci8vICAgICBpbnQgcmVzID0gMDsKLy8gICAgIHdoaWxlKG51bSl7Ci8vICAgICAgIHJlcysrOwovLyAgICAgICBudW0gaWZbbnVtJTI9PTAsIC89MiwgLS1dOwovLyAgICAgfQovLyAgICAgcmV0dXJuIHJlczsKLy8gICB9Ci8vIH07Cg==