Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main() {
- int t;
- cin >> t;
- while (t--) {
- int n, k;
- vector < int > v;
- cin >> n;
- while (n > 0) {
- v.push_back(n % 10);
- n /= 10;
- }
- int s = v.size();
- for (int i = (s - 1); i >= 0; i--) {
- if (v[i] > v[i - 1]) {
- k = i;
- break;
- }
- }
- v.erase(v.begin() + k);
- int s1 = v.size();
- if (v[s1 - 1] != 0) {
- for (int i = (s1 - 1); i >= 0; i--) {
- cout << v[i];
- }
- cout << endl;
- } else if (v[s1 - 1] == 0) {
- for (int i = (s1 - 2); i >= 0; i--) {
- cout << v[i];
- }
- cout << endl;
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment