Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int binpow(int n, int m)
- {
- if (m == 0)
- return 1;
- if (m == 1)
- return n;
- int tmp = binpow(n, m/2);
- if (m % 2)
- return tmp*tmp*n;
- else
- return tmp*tmp;
- }
- int str2num(string str)
- {
- int num = 0;
- for (int i = 0; i < (int)str.size(); ++i)
- num += (str[i] - '0')*binpow(10, str.size()-i-1);
- return num;
- }
Advertisement
Add Comment
Please, Sign In to add comment