#include<bits/stdc++.h> usingnamespace std; #define ll long long constint N = 2e5 + 10; constint INF = 0x3f3f3f3f; int T; char s[N], t[N]; intmain(){ cin >> T; while (T--) { scanf("%s", s); scanf("%s", t); int n = strlen(s), m = strlen(t); int p; for (int i = m - 1; i >= 0; i--) { if (t[i] == '1') { p = i; break; } } int ans = 0; for (int i = n - m + p; i >= 0; i--) { if (s[i] == '1')break; ans++; } printf("%d\n", ans); } return0; }
#include<bits/stdc++.h> usingnamespace std; #define ll long long constint N = 2e6 + 10; constint INF = 0x3f3f3f3f; int T; int G[20][20]; int d[20][20][20][20]; char s[N]; intmain(){ scanf("%s", s); int n = strlen(s); for (int i = 0; i < 10; i++) { for (int j = 0; j < 10; j++) { for (int u = 0; u < 10; u++) { for (int v = 0; v < 10; v++) { d[i][j][u][v] = INF; } } for (int k = 0; k < 10; k++) { d[i][j][k][(k + i) % 10] = 1; d[i][j][k][(k + j) % 10] = 1; } for (int k = 0; k < 10; k++) { for (int u = 0; u < 10; u++) { for (int v = 0; v < 10; v++) { d[i][j][u][v] = min(d[i][j][u][v], d[i][j][u][k] + d[i][j][k][v]); } } } } } for (int i = 0; i < 10; i++) { for (int j = 0; j < 10; j++) { int ans = 0; for (int k = 0; k < n - 1; k++) { ans += d[i][j][s[k] - '0'][s[k + 1] - '0'] - 1; if (ans >= INF-1) { ans = -1; break; } } printf("%d%s", ans, j == 9 ? "\n" : " "); } } return0; }
#include<bits/stdc++.h> usingnamespace std; #define ll long long constint N = 2e6 + 10; constint INF = 0x3f3f3f3f; int T, n; char s[N], tt[]{ "WASD" }; intmain(){ scanf("%d", &T); while (T--) { scanf("%s", s + 1); n = strlen(s + 1); ll a = 0, b = 0, c = 0, d = 0; ll x = 0, y = 0, mu = 0, md = 0, ml = 0, mr = 0; for (int i = 1; s[i]; i++) { if (s[i] == 'W')y++, c = max(c, y); elseif (s[i] == 'S')y--, d = min(d, y); elseif (s[i] == 'A')x--, b = min(b, x); else x++, a = max(a, x); mu = max(mu, y - d); md = max(md, c - y); mr = max(mr, x - b); ml = max(ml, a - x); } ll ans = (a - b + 1)*(c - d + 1); if (ml != mr) { if (a >= 1 && b <= -1 || a > 1 || b < -1) ans = min(ans, (a - b)*(c - d + 1)); } if (mu != md) { if (c >= 1 && d <= -1 || c > 1 || d < -1) ans = min(ans, (a - b + 1)*(c - d)); } printf("%lld\n", ans); } return0; }
#include<bits/stdc++.h> usingnamespace std; #define ll long long constint N = 2e6 + 10; constint INF = 0x3f3f3f3f; int T; ll n; ll C(ll n){ return n * (n - 1) / 2; } vector<ll>vc; intmain(){ vc.push_back(0); vc.push_back(0); for (ll i = 2; i <= 6000; i++)vc.push_back(C(i)); scanf("%d", &T); while (T--) { scanf("%lld", &n); int p = upper_bound(vc.begin(), vc.end(), n) - vc.begin() - 1; while (p >= 2) { ll a = n / vc[p]; n = n % vc[p]; p--; for (int i = 0; i < a; i++)printf("1"); printf("3"); } printf("37\n"); } return0; }