#include #define ll long long #define ld long double #define tag "Palnums" const long long MOD = 1e9+7; const long long N = 1e6+9; using namespace std; string a, f, s; ll n, k, ans = 0; string sumstring(string x){ int nho = 0; string y = "1", ans; ll t, l = x.size()-1; ans.resize(l+1); while(y.size() < x.size()) y = "0"+y; for(int i = l; i >= 0; i--){ t = (x[i] - '0') + (y[i] - '0') + nho; if(t >= 10){ nho = 1; t = t%10; } else nho = 0; ans[i] = t + '0'; } if(nho == 1) ans = "1"+ans; return ans; } bool sosanh(string c, string d){ if(c.size() < d.size()) return true; if(c.size() > d.size()) return false; for(int i = 0; i < c.size(); i++){ if(c[i] > d[i]) return false; if(c[i] < d[i]) return true; } return false; } string daoxau(string x){ string y = ""; for(int i = x.size()-1; i >= 0; i--){ y = y + x[i]; } return y; } string sub1(){ ll i = 0; string temp = "", temp2, temp3; string s1, s2; for(; i <= n/2-1; i++){ temp = temp + a[i]; s1 = a[i] + s1; } temp2 = temp; s1 = temp + s1; if(sosanh(a, s1)){ //cout<> s >> a; k = stoll(a); //n = s.size(); if(a.size() == 1){ for(int i = 1; i <= 9; i++) if(i%k == 0) ans++; a = "11"; } solve(); } //cc

how to code

Related code examples

Code examples by languages