ShaysXIA/CodeInsightBench huggingface dataset:
Problem: 2052A - Adrenaline Rush
Language: C++23 (GCC 14-64, msys2)

Previous submission (verdict: Wrong answer on test 4):
#include <bits/stdc++.h>
#define endl "\n"
typedef long long ll;
using namespace std;


int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--) {
		int n;
        cin>>n;

        vector<int>  a(n, 0);
        unordered_map<int, int> indices;

        for(int i =0;i<n; ++i){
            int it = 0;
            cin>>it;
            indices[it] = i;
        }

        for(int i= 0; i<n; ++i){
            a[i] = i+1;
        }

        unordered_map<int, set<int>> mp;
        vector<pair<int, int>>v;
        for(int i = 0; i<n; ++i){
            if(i == indices[a[i]]) continue;
            int ind = indices[i+1];
            for(int j= i+1; j<=ind; ++j){
                mp[a[i]].insert(a[j]);
                mp[a[j]].insert(a[i]);
                v.push_back({a[j], a[i]});
            } 
            for(int j = i+1; j<=ind; ++j){
                swap(a[j-1], a[j]);
            }
            --i;
            indices[a[i]] = i;
        }

        for(int i = n-2; i>=0; --i){
            set<int> st = mp[a[i]];
            if(!st.count(a[i+1])){
                v.push_back({a[i+1], a[i]});
                v.push_back({a[i], a[i+1]});
            }
        }
        cout<<v.size()<<endl;
        for(auto it: v){
            cout<<it.first<<' '<<it.second<<endl;
        }

    }
    return 0;
}

Submission (verdict: Accepted):
#include <bits/stdc++.h>
#define endl "\n"
typedef long long ll;
using namespace std;


int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--) {
		int n;
        cin>>n;

        vector<int>  a(n, 0), v(n, 0);

        for(auto &it: v) cin>>it;
        

        for(int i= 0; i<n; ++i){
            a[i] = i+1;
        }

        vector<pair<int, int>> ans;
        
        for(int i=0 ;i <n; ++i){
            for(int j = 0; j<n-i-1; ++j){
                if(a[j]==v[i]){
                    ans.push_back({a[j+1],a[j]});
                    swap(a[j],a[j+1]);
                }
            }
        }

        for(int i =0;i<n; ++i){
            for(int j = n-1; j>i; --j){
                ans.push_back({a[j],a[j-1]});
                swap(a[j],a[j-1]);
            }
        }

        cout<<ans.size()<<endl;
        for(auto &it: ans){
            cout<<it.first<<' '<<it.second<<endl;
        }

    }
    return 0;
}
Problem: 2052A - Adrenaline Rush
Language: C++23 (GCC 14-64, msys2)


Submission (verdict: Wrong answer on test 1):
#include <bits/stdc++.h>
#define endl "\n"
typedef long long ll;
using namespace std;


int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--) {
		int n;
        cin>>n;

        vector<int>  a(n, 0);
        unordered_map<int, int> indices;

        for(int i =0;i<n; ++i){
            int it = 0;
            cin>>it;
            indices[it] = i;
        }

        for(int i= 0; i<n; ++i){
            a[i] = i+1;
        }

        unordered_map<int, set<int>> mp;
        vector<pair<int, int>>v;
        for(int i = 0; i<n; ++i){
            if(i == indices[a[i]]) continue;
            int ind = indices[i+1];
            for(int j = i+1; j<=ind; ++j){
                
                mp[a[i]].insert(a[j]);
                mp[a[j]].insert(a[i]);
                v.push_back({a[j], a[i]});
                swap(a[i], a[j]);
            }
            --i;
            indices[a[i]] = i;
        }

        for(int i = n-2; i>=0; --i){
            set<int> st = mp[a[i]];
            if(!st.count(a[i+1])){
                v.push_back({a[i], a[i+1]});
                v.push_back({a[i+1], a[i]});
            }
        }
        cout<<v.size()<<endl;
        for(auto it: v){
            cout<<it.first<<' '<<it.second<<endl;
        }

    }
    return 0;
}
Problem: 2052A - Adrenaline Rush
Language: C++23 (GCC 14-64, msys2)

Previous submission (verdict: Wrong answer on test 1):
#include <bits/stdc++.h>
#define endl "\n"
typedef long long ll;
using namespace std;


int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--) {
		int n;
        cin>>n;

        vector<int>  a(n, 0);
        unordered_map<int, int> indices;

        for(int i =0;i<n; ++i){
            int it = 0;
            cin>>it;
            indices[it] = i;
        }

        for(int i= 0; i<n; ++i){
            a[i] = i+1;
        }

        unordered_map<int, set<int>> mp;
        vector<pair<int, int>>v;
        for(int i = 0; i<n; ++i){
            if(i == indices[a[i]]) continue;
            int ind = indices[i+1];
            for(int j= i+1; j<=ind; ++j){
                mp[a[i]].insert(a[j]);
                mp[a[j]].insert(a[i]);
                v.push_back({a[j], a[i]});
            } 
            for(int j = i+1; j<=ind; ++j){
                swap(a[j-1], a[j]);
            }
            --i;
            indices[a[i]] = i;
        }

        for(int i = n-2; i>=0; --i){
            set<int> st = mp[a[i]];
            if(!st.count(a[i+1])){
                v.push_back({a[i], a[i+1]});
                v.push_back({a[i+1], a[i]});
            }
        }
        cout<<v.size()<<endl;
        for(auto it: v){
            cout<<it.first<<' '<<it.second<<endl;
        }

    }
    return 0;
}

Submission (verdict: Wrong answer on test 4):
#include <bits/stdc++.h>
#define endl "\n"
typedef long long ll;
using namespace std;


int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--) {
		int n;
        cin>>n;

        vector<int>  a(n, 0);
        unordered_map<int, int> indices;

        for(int i =0;i<n; ++i){
            int it = 0;
            cin>>it;
            indices[it] = i;
        }

        for(int i= 0; i<n; ++i){
            a[i] = i+1;
        }

        unordered_map<int, set<int>> mp;
        vector<pair<int, int>>v;
        for(int i = 0; i<n; ++i){
            if(i == indices[a[i]]) continue;
            int ind = indices[i+1];
            for(int j= i+1; j<=ind; ++j){
                mp[a[i]].insert(a[j]);
                mp[a[j]].insert(a[i]);
                v.push_back({a[j], a[i]});
            } 
            for(int j = i+1; j<=ind; ++j){
                swap(a[j-1], a[j]);
            }
            --i;
            indices[a[i]] = i;
        }

        for(int i = n-2; i>=0; --i){
            set<int> st = mp[a[i]];
            if(!st.count(a[i+1])){
                v.push_back({a[i+1], a[i]});
                v.push_back({a[i], a[i+1]});
            }
        }
        cout<<v.size()<<endl;
        for(auto it: v){
            cout<<it.first<<' '<<it.second<<endl;
        }

    }
    return 0;
}
Problem: 2062C - Cirno and Operations
Language: C++20 (GCC 13-64)


Submission (verdict: Wrong answer on test 2):
#include <bits/stdc++.h>
using namespace std;

int main() {
    
    int test; cin >> test;
    while(test--) {

        int n; cin >> n;
        vector<int> arr;
        for (int i = 0; i < n; i++) {
            int x; cin >> x; 
            arr.push_back(x);
        }
        
        if (arr.size() < 2) {cout << arr[0] << endl; continue;}
        
        while (arr.size() > 2) {
            for (int i = 0; i < n - 1; i++) {
                arr[i] = arr[i + 1] - arr[i];
            }
            arr.pop_back();
        }
        cout << max(abs(arr[1] - arr[0]), arr[0] + arr[1]) << endl;
    }
    return 0;
}
Problem: 2062C - Cirno and Operations
Language: C++20 (GCC 13-64)

Previous submission (verdict: Wrong answer on test 1):
#include <bits/stdc++.h>
using namespace std;

int main() {
    
    int test; cin >> test;
    while(test--) {

        int n; cin >> n;
        vector<long long int> arr;
        long long ans = 0;
        
        for (int i = 0; i < n; i++) {
            long long int x; cin >> x;  arr.push_back(x);
            ans += arr[i];
        }
        
        while (arr.size() != 0) {
            long long temp = 0;
            for (int i = 0; i < arr.size() - 1; i++) {
                arr[i] = arr[i + 1] - arr[i];
                temp += arr[i];
            }
            arr.pop_back();
            ans = max(ans, abs(temp));
        }
        cout << ans << endl;
    }
    return 0;
}

Submission (verdict: Accepted):
#include <bits/stdc++.h>
using namespace std;

int main() {
    
    int test; cin >> test;
    while(test--) {

        int n; cin >> n;
        vector<long long int> arr;
        long long ans = 0;
        
        for (int i = 0; i < n; i++) {
            long long int x; cin >> x;  arr.push_back(x);
            ans += arr[i];
        }
        
        while (arr.size() != 0) {
            long long temp = 0;
            for (int i = 0; i < arr.size() - 1; i++) {
                arr[i] = arr[i + 1] - arr[i];
                temp += arr[i];
                if (i == arr.size()-2) ans = max(ans, abs(temp));
            }
            arr.pop_back();
        }
        cout << ans << endl;
    }
    return 0;
}
Problem: 2062C - Cirno and Operations
Language: C++20 (GCC 13-64)

Previous submission (verdict: Wrong answer on test 2):
#include <bits/stdc++.h>
using namespace std;

int main() {
    
    int test; cin >> test;
    while(test--) {

        int n; cin >> n;
        vector<long long int> arr;
        long long ans = 0;
        
        for (int i = 0; i < n; i++) {
            long long int x; cin >> x;  arr.push_back(x);
        }
        
        if (arr.size() < 2) {cout << arr[0] << endl; continue;}
        
        while (arr.size() > 2) {
            for (int i = 0; i < arr.size() - 1; i++) {
                arr[i] = arr[i + 1] - arr[i];
            }
            arr.pop_back();
        }
        cout << max(abs(arr[1] - arr[0]), arr[0] + arr[1]) << endl;
    }
    return 0;
}

Submission (verdict: Wrong answer on test 1):
#include <bits/stdc++.h>
using namespace std;

int main() {
    
    int test; cin >> test;
    while(test--) {

        int n; cin >> n;
        vector<long long int> arr;
        long long ans = 0;
        
        for (int i = 0; i < n; i++) {
            long long int x; cin >> x;  arr.push_back(x);
            ans += arr[i];
        }
        
        while (arr.size() != 0) {
            long long temp = 0;
            for (int i = 0; i < arr.size() - 1; i++) {
                arr[i] = arr[i + 1] - arr[i];
                temp += arr[i];
            }
            arr.pop_back();
            ans = max(ans, abs(temp));
        }
        cout << ans << endl;
    }
    return 0;
}
Problem: 2062C - Cirno and Operations
Language: C++20 (GCC 13-64)

Previous submission (verdict: Wrong answer on test 2):
#include <bits/stdc++.h>
using namespace std;

int main() {
    
    int test; cin >> test;
    while(test--) {

        int n; cin >> n;
        vector<long long int> arr;
        for (int i = 0; i < n; i++) {
            long long int x; cin >> x; 
            arr.push_back(x);
        }
        
        if (arr.size() < 2) {cout << arr[0] << endl; continue;}
        
        while (arr.size() > 2) {
            for (int i = 0; i < n - 1; i++) {
                arr[i] = arr[i + 1] - arr[i];
            }
            arr.pop_back();
        }
        cout << max(abs(arr[1] - arr[0]), arr[0] + arr[1]) << endl;
    }
    return 0;
}

Submission (verdict: Wrong answer on test 2):
#include <bits/stdc++.h>
using namespace std;

int main() {
    
    int test; cin >> test;
    while(test--) {

        int n; cin >> n;
        vector<long long int> arr;
        long long ans = 0;
        
        for (int i = 0; i < n; i++) {
            long long int x; cin >> x;  arr.push_back(x);
        }
        
        if (arr.size() < 2) {cout << arr[0] << endl; continue;}
        
        while (arr.size() > 2) {
            for (int i = 0; i < arr.size() - 1; i++) {
                arr[i] = arr[i + 1] - arr[i];
            }
            arr.pop_back();
        }
        cout << max(abs(arr[1] - arr[0]), arr[0] + arr[1]) << endl;
    }
    return 0;
}
Problem: 2062C - Cirno and Operations
Language: C++20 (GCC 13-64)

Previous submission (verdict: Wrong answer on test 2):
#include <bits/stdc++.h>
using namespace std;

int main() {
    
    int test; cin >> test;
    while(test--) {

        int n; cin >> n;
        vector<int> arr;
        for (int i = 0; i < n; i++) {
            int x; cin >> x; 
            arr.push_back(x);
        }
        
        if (arr.size() < 2) {cout << arr[0] << endl; continue;}
        
        while (arr.size() > 2) {
            for (int i = 0; i < n - 1; i++) {
                arr[i] = arr[i + 1] - arr[i];
            }
            arr.pop_back();
        }
        cout << max(abs(arr[1] - arr[0]), arr[0] + arr[1]) << endl;
    }
    return 0;
}

Submission (verdict: Wrong answer on test 2):
#include <bits/stdc++.h>
using namespace std;

int main() {
    
    int test; cin >> test;
    while(test--) {

        int n; cin >> n;
        vector<long long int> arr;
        for (int i = 0; i < n; i++) {
            long long int x; cin >> x; 
            arr.push_back(x);
        }
        
        if (arr.size() < 2) {cout << arr[0] << endl; continue;}
        
        while (arr.size() > 2) {
            for (int i = 0; i < n - 1; i++) {
                arr[i] = arr[i + 1] - arr[i];
            }
            arr.pop_back();
        }
        cout << max(abs(arr[1] - arr[0]), arr[0] + arr[1]) << endl;
    }
    return 0;
}
Problem: 2050C - Uninteresting Number
Language: PyPy 3-64

Previous submission (verdict: Time limit exceeded on test 5):
for _ in range(int(input())):
    s = input()
    reachable2 = [0]
    reachable3 = [0]
    div = 0
    for i in s:
        div += int(i)
        if i == '2':
            reachable2.append(reachable2[-1]+2)
        if i == '3':
            reachable3.append(reachable3[-1]+6)
    need = 9 - div%9
    if need == 9 or need == 0:
        print('yes')
    elif (need == 2 and len(reachable2) > 1) or (need == 4 and len(reachable2) > 2) or (need == 6 and (len(reachable2) > 3 or len(reachable3) > 1)) or (need == 8 and len(reachable2) > 4):
        print('yes')
    else:
        reachable = {(i+j)%9 for i in reachable2 for j in reachable3}
        #print(reachable, reachable2, reachable3)
        #print(div,need, two, three)
        #print(reachable)
        if need in reachable:
            print('yes')
        else:
            print('no')

Submission (verdict: Accepted):
for _ in range(int(input())):
    s = input()
    reachable2 = [0]
    reachable3 = [0]
    div = 0; sky2 = sky3 = 0
    finn = False 
    for i in s:
        div += int(i)
        if sky2 < 10:
            if i == '2':
                reachable2.append(reachable2[-1]+2)
                sky2 += 1
        if sky3 < 5:
            if i == '3':
                reachable3.append(reachable3[-1]+6)
                sky3 += 1 
    need = 9 - div%9
    if need == 9 or need == 0:
        print('yes')
    elif (need == 2 and len(reachable2) > 1) or (need == 4 and len(reachable2) > 2) or (need == 6 and (len(reachable2) > 3 or len(reachable3) > 1)) or (need == 8 and len(reachable2) > 4):
        print('yes')
    else:
        reachable = {(i+j)%9 for i in reachable2 for j in reachable3}
        #print(reachable, reachable2, reachable3)
        #print(div,need, two, three)
        #print(reachable)
        if need in reachable:
            print('yes')
        else:
            print('no')
Problem: 2050C - Uninteresting Number
Language: PyPy 3-64


Submission (verdict: Time limit exceeded on test 5):
for _ in range(int(input())):
    s = input()
    reachable2 = [0]
    reachable3 = [0]
    div = 0
    for i in s:
        div += int(i)
        if i == '2':
            reachable2.append(reachable2[-1]+2)
        if i == '3':
            reachable3.append(reachable3[-1]+6)
    need = 9 - div%9
    if need == 9:
        print('yes')
    else:
        reachable = {(i+j)%9 for i in reachable2 for j in reachable3}
        #print(reachable, reachable2, reachable3)
        #print(div,need, two, three)
        if need in reachable:
            print('yes')
        else:
            print('no')
Problem: 2050C - Uninteresting Number
Language: PyPy 3-64

Previous submission (verdict: Time limit exceeded on test 5):
for _ in range(int(input())):
    s = input()
    reachable2 = [0]
    reachable3 = [0]
    div = 0
    for i in s:
        div += int(i)
        if i == '2':
            reachable2.append(reachable2[-1]+2)
        if i == '3':
            reachable3.append(reachable3[-1]+6)
    need = 9 - div%9
    if need == 9:
        print('yes')
    else:
        reachable = {(i+j)%9 for i in reachable2 for j in reachable3}
        #print(reachable, reachable2, reachable3)
        #print(div,need, two, three)
        if need in reachable:
            print('yes')
        else:
            print('no')


Submission (verdict: Time limit exceeded on test 5):
for _ in range(int(input())):
    s = input()
    reachable2 = [0]
    reachable3 = [0]
    div = 0
    for i in s:
        div += int(i)
        if i == '2':
            reachable2.append(reachable2[-1]+2)
        if i == '3':
            reachable3.append(reachable3[-1]+6)
    need = 9 - div%9
    if need == 9 or need == 0:
        print('yes')
    elif (need == 2 and len(reachable2) > 1) or (need == 4 and len(reachable2) > 2) or (need == 6 and (len(reachable2) > 3 or len(reachable3) > 1)) or (need == 8 and len(reachable2) > 4):
        print('yes')
    else:
        reachable = {(i+j)%9 for i in reachable2 for j in reachable3}
        #print(reachable, reachable2, reachable3)
        #print(div,need, two, three)
        #print(reachable)
        if need in reachable:
            print('yes')
        else:
            print('no')
Problem: 2050C - Uninteresting Number
Language: C++20 (GCC 13-64)


Submission (verdict: Time limit exceeded on test 3):
// https://codeforces.com/problemset/problem/2050/C
// uninteresting numbers
#include <bits/stdc++.h>
using namespace std;
bool test(string s)
{
    int sum = 0;
    for (int i = 0; i < s.length(); i++)
    {
        sum += s[i] - '0';
    }
    if (sum % 9 == 0)
        return true;
    return false;
}
void solution(string s, bool &counter, vector<bool> visited)
{
    if (counter)
        return;
    counter = test(s);
    for (int i = 0; i < s.length(); i++)
    {
        if (!visited[i])
        {
            int no = s[i] - '0';
            visited[i] = true;
            if (no <= 3)
            {
                string copy = s;
                copy[i] = '0' + no * no;
                solution(copy, counter, visited);
            }
        }
    }
}
string uninteresting_numbers(string n)
{
    bool counter = false;
    vector<bool> visited(n.length(), false);
    solution(n, counter, visited);
    if (counter)
    {
        return "YES";
    }
    return "NO";
}
int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        string number;
        cin >> number;
        cout << uninteresting_numbers(number) << endl;
    }
    return 0;
}
Problem: 2050C - Uninteresting Number
Language: C++20 (GCC 13-64)

Previous submission (verdict: Time limit exceeded on test 3):
// https://codeforces.com/problemset/problem/2050/C
// uninteresting numbers
#include <bits/stdc++.h>
using namespace std;
bool test(string s)
{
    int sum = 0;
    for (int i = 0; i < s.length(); i++)
    {
        sum += s[i] - '0';
    }
    if (sum % 9 == 0)
        return true;
    return false;
}
void solution(string s, bool &counter, vector<bool> visited)
{
    if (counter)
        return;
    counter = test(s);
    for (int i = 0; i < s.length(); i++)
    {
        if (!visited[i])
        {
            int no = s[i] - '0';
            visited[i] = true;
            if (no <= 3)
            {
                string copy = s;
                copy[i] = '0' + no * no;
                solution(copy, counter, visited);
            }
        }
    }
}
string uninteresting_numbers(string n)
{
    bool counter = false;
    vector<bool> visited(n.length(), false);
    solution(n, counter, visited);
    if (counter)
    {
        return "YES";
    }
    return "NO";
}
int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        string number;
        cin >> number;
        cout << uninteresting_numbers(number) << endl;
    }
    return 0;
}



Submission (verdict: Wrong answer on test 1):
// https://codeforces.com/problemset/problem/2050/C
// uninteresting numbers
#include <bits/stdc++.h>
using namespace std;
bool test(string s)
{
    int sum = 0;
    for (int i = 0; i < s.length(); i++)
    {
        sum += s[i] - '0';
    }
    if (sum % 9 == 0)
        return true;
    return false;
}
void solution(string s, bool &counter, vector<bool> &visited)
{
    if (counter)
        return;
    counter = test(s);
    for (int i = 0; i < s.length(); i++)
    {
        if (!visited[i])
        {
            int no = s[i] - '0';
            visited[i] = true;
            if (no <= 3)
            {
                string copy = s;
                copy[i] = '0' + no * no;
                solution(copy, counter, visited);
            }
        }
    }
}
string uninteresting_numbers(string n)
{
    bool counter = false;
    vector<bool> visited(n.length(), false);
    solution(n, counter, visited);
    if (counter)
    {
        return "YES";
    }
    return "NO";
}
int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        string number;
        cin >> number;
        cout << uninteresting_numbers(number) << endl;
    }
    return 0;
}
Problem: 2050C - Uninteresting Number
Language: C++20 (GCC 13-64)

Previous submission (verdict: Wrong answer on test 1):
// https://codeforces.com/problemset/problem/2050/C
// uninteresting numbers
#include <bits/stdc++.h>
using namespace std;
bool test(string s)
{
    int sum = 0;
    for (int i = 0; i < s.length(); i++)
    {
        sum += s[i] - '0';
    }
    if (sum % 9 == 0)
        return true;
    return false;
}
void solution(string s, bool &counter, vector<bool> &visited)
{
    if (counter)
        return;
    counter = test(s);
    for (int i = 0; i < s.length(); i++)
    {
        if (!visited[i])
        {
            int no = s[i] - '0';
            visited[i] = true;
            if (no <= 3)
            {
                string copy = s;
                copy[i] = '0' + no * no;
                solution(copy, counter, visited);
            }
        }
    }
}
string uninteresting_numbers(string n)
{
    bool counter = false;
    vector<bool> visited(n.length(), false);
    solution(n, counter, visited);
    if (counter)
    {
        return "YES";
    }
    return "NO";
}
int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        string number;
        cin >> number;
        cout << uninteresting_numbers(number) << endl;
    }
    return 0;
}


Submission (verdict: Time limit exceeded on test 3):
#include <bits/stdc++.h>
using namespace std;
// Check if a string represents a number divisible by 9
bool isDivisibleBy9(const string &s)
{
    int sum = 0;
    for (char c : s)
    {
        sum += (c - '0');
    }
    return (sum % 9 == 0);
}

// Recursive function to explore valid transformations
void solve(string s, bool &found, int i)
{
    if (found)
    {
        return;
    }
    // cout << s << endl;
    // Check if the current number is divisible by 9
    if (isDivisibleBy9(s))
    {
        found = true;
        return;
    }
    // If the current digit is <= 3, try replacing it with its square
    if (i < s.length())
    {
        if (s[i] <= '3')
        {
            char original = s[i];
            s[i] = '0' + (original - '0') * (original - '0');
            solve(s, found, i + 1);
            s[i] = original; // Backtrack
        }
        // Skip to the next digit
        solve(s, found, i + 1);
    }
}

// Wrapper function to determine if the number is interesting
string uninteresting_numbers(const string &s)
{
    bool found = false;
    string copy = s; // Create a mutable copy
    solve(copy, found, 0);
    return found ? "YES" : "NO";
}

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        string number;
        cin >> number;
        cout << uninteresting_numbers(number) << endl;
    }
    return 0;
}