classSolution{public:
vector<int>plusOne(vector<int>& digits){int n = digits.size();for(int i = n -1; i >=0;--i){if(digits[i]!=9){++digits[i];for(int j = i +1; j < n;++j){
digits[j]=0;}return digits;}}
vector<int>ans(n +1);
ans[0]=1;return ans;}};
classSolution{public:inttrailingZeroes(int n){int ans =0;for(int i =5; i <= n; i +=5){for(int x = i; x %5==0; x /=5){++ans;}}return ans;}};
classSolution{public:intconsecutiveNumbersSum(int n){int ans =0;int bound =2* n;for(int k =1; k *(k +1)<= bound; k++){if(isKConsecutive(n, k)){
ans++;}}return ans;}boolisKConsecutive(int n,int k){if(k %2==1){return n % k ==0;}else{return n % k !=0&&2* n % k ==0;}}};
class Solution {public: vector<int> plusOne(vector<int>& digits) { int n = digits.size(); for (int i = n - 1; i >= 0; --i) { if (digits[i] != 9) { ++digits[i]; for (int ...