ShaysXIA/CodeInsightBench huggingface dataset:
Problem: 2050D - Digital string maximization
Language: C++17 (GCC 7-32)

Previous submission (verdict: Time limit exceeded on test 6):
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define vi vector<int>
#define si set<int>
#define ui unordered_set<int>
#define vll vector<long long>
#define f(i, l, h) for(int i = l; i < h; i++)
#define cf(i, l, h) for(int i = l; i <= h; i++)
#define pb push_back

void solution() {
	string s;
	cin >> s;
	int n = s.size();
	int m = n;
	f(j, 0, n) {
		f(i, 0, m) {
			if(s[i] < s[i + 1] - 1) {
				char temp = s[i];
				s[i] = s[i + 1] - 1;
				s[i + 1] = temp;
			}
		}
		m--;
	}
	cout << s << endl;
}

int main() {
	int t;
	cin >> t;
	while(t--) {
		solution();
	}
}

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

#define ll long long
#define vi vector<int>
#define si set<int>
#define ui unordered_set<int>
#define vll vector<long long>
#define f(i, l, h) for(int i = l; i < h; i++)
#define cf(i, l, h) for(int i = l; i <= h; i++)
#define rf(i, h, l) for(int i = h; i >= l; i--)
#define pb push_back

void solution() {
	string s;
	cin >> s;
	int n = s.size();
	f(i, 0, n) {
		int m = s[i] - '0';
		int pos;
		f(j, i, min(i + 10, n)) {
			if(s[j] - (j - i) > s[i]) {
				m = s[j] - '0' - (j - i);
				pos = j;
			}
		}
		rf(j, pos, i + 1) {
			s[i] = s[i - 1];
		}
		s[i] = m + '0';
	}
	cout << s << endl;
}

int main() {
	int t;
	cin >> t;
	while(t--) {
		solution();
	}
}
Problem: 2050D - Digital string maximization
Language: C++17 (GCC 7-32)


Submission (verdict: Time limit exceeded on test 6):
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define vi vector<int>
#define si set<int>
#define ui unordered_set<int>
#define vll vector<long long>
#define f(i, l, h) for(int i = l; i < h; i++)
#define cf(i, l, h) for(int i = l; i <= h; i++)
#define pb push_back

void solution() {
	string s;
	cin >> s;
	int n = s.size();
	f(j, 0, n) {
		f(i, 0, n) {
			if(s[i] < s[i + 1] - 1) {
				char temp = s[i];
				s[i] = s[i + 1] - 1;
				s[i + 1] = temp;
			}
		}
		
	}
	cout << s << endl;
}

int main() {
	int t;
	cin >> t;
	while(t--) {
		solution();
	}
}
Problem: 2050D - Digital string maximization
Language: C++17 (GCC 7-32)

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

#define ll long long
#define vi vector<int>
#define si set<int>
#define ui unordered_set<int>
#define vll vector<long long>
#define f(i, l, h) for(int i = l; i < h; i++)
#define cf(i, l, h) for(int i = l; i <= h; i++)
#define rf(i, h, l) for(int i = h; i >= l; i--)
#define pb push_back

void solution() {
	string s;
	cin >> s;
	int n = s.size();
	f(i, 0, n) {
		int m = s[i] - '0';
		int pos;
		f(j, i, min(i + 10, n)) {
			if(s[j] - (j - i) > s[i]) {
				m = s[j] - '0' - (j - i);
				pos = j;
			}
		}
		rf(j, pos, i + 1) {
			s[i] = s[i - 1];
		}
		s[i] = m + '0';
	}
	cout << s << endl;
}

int main() {
	int t;
	cin >> t;
	while(t--) {
		solution();
	}
}

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

#define ll long long
#define vi vector<int>
#define si set<int>
#define ui unordered_set<int>
#define vll vector<long long>
#define f(i, l, h) for(int i = l; i < h; i++)
#define cf(i, l, h) for(int i = l; i <= h; i++)
#define rf(i, h, l) for(int i = h; i >= l; i--)
#define pb push_back

void solution() {
	string s;
	cin >> s;
	int n = s.size();
	f(i, 0, n) {
		int m = s[i] - '0';
		int pos = i;
		f(j, i, min(i + 10, n)) {
			if(s[j] - '0' - (j - i) > m) {
				m = s[j] - '0' - (j - i);
				pos = j;
			}
		}
		rf(j, pos, i) {
			s[j] = s[j - 1];
		}
		s[i] = m + '0';
	}
	cout << s << endl;
}

int main() {
	int t;
	cin >> t;
	while(t--) {
		solution();
	}
}
Problem: 2050D - Digital string maximization
Language: PyPy 3-64

Previous submission (verdict: Time limit exceeded on test 7):
t= int(input())
for k in range(t):    
    a=input()
    b= len(a)
    for i in range(b):
        t= min(i+9,b)
        m= int(a[i])
        n=i
        for j in range(i,t):
            if (int(a[j])-j+i)> m:
                m= int(a[j])-j+i
                n= j
        a= a[0:i]+str(m)+a[i:n]+a[n+1:b]
    print(a)

Submission (verdict: Accepted):
t= int(input())
for k in range(t):    
    a=list(input())
    b= len(a)
    for i in range(b):
        t= min(i+9,b)
        m= int(a[i])
        n=i
        for j in range(i,t):
            if (int(a[j])-j+i)> m:
                m= int(a[j])-j+i
                n= j
        while n>i:
            a[n],a[n-1]= a[n-1],str(int(a[n])-1)
            n-=1
    print("".join(a))
Problem: 2050D - Digital string maximization
Language: PyPy 3-64

Previous submission (verdict: Wrong answer on test 1):
t = int(input())

for _ in range(t):
    a = list(input())  # Convert string to list for easier modification
    b = len(a)

    for i in range(b):
        max_value = int(a[i])
        max_index = i
        limit = min(i + 9, b)  # Ensures we don't go out of bounds

        for j in range(i, limit):
            value = int(a[j]) - j + i  # Adjusted value based on position
            if value > max_value:
                max_value = value
                max_index = j

        if max_index != i:
            a[max_index], a[i] = a[i], a[max_index]  # Swap values

    print("".join(a))  # Convert list back to string for output

Submission (verdict: Time limit exceeded on test 7):
t= int(input())
for k in range(t):    
    a=input()
    b= len(a)
    for i in range(b):
        t= min(i+9,b)
        m= int(a[i])
        n=i
        for j in range(i,t):
            if (int(a[j])-j+i)> m:
                m= int(a[j])-j+i
                n= j
        a= a[0:i]+str(m)+a[i:n]+a[n+1:b]
    print(a)
Problem: 2050D - Digital string maximization
Language: PyPy 3-64


Submission (verdict: Time limit exceeded on test 7):
t= int(input())
for k in range(t):    
    a=input()
    b= len(a)
    for i in range(b):
        if i<(b-8):
            t= i+9
        else:
            t= b
        m= int(a[i])
        n=i
        for j in range(i,t):
            if (int(a[j])-j+i)> m:
                m= int(a[j])-j+i
                n= j
        a= a[0:i]+str(m)+a[i:n]+a[n+1:b]
    print(a)
Problem: 2050D - Digital string maximization
Language: PyPy 3-64

Previous submission (verdict: Time limit exceeded on test 7):
t= int(input())
for k in range(t):    
    a=input()
    b= len(a)
    for i in range(b):
        if i<(b-8):
            t= i+9
        else:
            t= b
        m= int(a[i])
        n=i
        for j in range(i,t):
            if (int(a[j])-j+i)> m:
                m= int(a[j])-j+i
                n= j
        a= a[0:i]+str(m)+a[i:n]+a[n+1:b]
    print(a)

Submission (verdict: Wrong answer on test 1):
t = int(input())

for _ in range(t):
    a = list(input())  # Convert string to list for easier modification
    b = len(a)

    for i in range(b):
        max_value = int(a[i])
        max_index = i
        limit = min(i + 9, b)  # Ensures we don't go out of bounds

        for j in range(i, limit):
            value = int(a[j]) - j + i  # Adjusted value based on position
            if value > max_value:
                max_value = value
                max_index = j

        if max_index != i:
            a[max_index], a[i] = a[i], a[max_index]  # Swap values

    print("".join(a))  # Convert list back to string for output
Problem: 2050C - Uninteresting Number
Language: C++23 (GCC 14-64, msys2)

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

using namespace std;

int solve()
{
    int count_2 = 0, count_3 = 0, rem = 0;
    string s;
    cin >> s;
    for (int i = 0; i < size(s); ++i)
    {
        if (s[i] == '2')
            ++count_2;
        if (s[i] == '3')
            ++count_3;
        rem += s[i] - '0';
    }
    rem = (9 - rem % 9) % 9;
    count_3 += count_2 / 3;
    count_2 %= 3;
    while (rem < 100)
    {
        int count_1 = rem / 2;
        if (count_1 % 3 <= count_2 and count_1 / 3 <= count_3 and rem % 2 == 0)
        {
            cout << "YES" << endl;
            return 0;
        }
        rem += 9;
    }
    cout << "NO" << endl;
    return 0;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    int t;
    cin >> t;
    for (int i = 0; i < t; ++i)
        solve();
    return 0;
}

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

using namespace std;

int solve()
{
    int count_2 = 0, count_3 = 0, rem = 0;
    string s;
    cin >> s;
    for (int i = 0; i < size(s); ++i)
    {
        if (s[i] == '2')
            ++count_2;
        if (s[i] == '3')
            ++count_3;
        rem += s[i] - '0';
    }
    rem = (9 - rem % 9) % 9;
    count_3 += count_2 / 3;
    while (rem < 100)
    {
        int count_1 = rem / 2;
        if (count_1 % 3 <= count_2 and count_1 / 3 <= count_3 and rem % 2 == 0)
        {
            cout << "YES" << endl;
            return 0;
        }
        rem += 9;
    }
    cout << "NO" << endl;
    return 0;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    int t;
    cin >> t;
    for (int i = 0; i < t; ++i)
        solve();
    return 0;
}
Problem: 2050C - Uninteresting Number
Language: C++23 (GCC 14-64, msys2)

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

using namespace std;

int solve()
{
    int count_2 = 0, count_3 = 0, rem = 0;
    string s;
    cin >> s;
    for (int i = 0; i < size(s); ++i)
    {
        if (s[i] == '2')
            ++count_2;
        if (s[i] == '3')
            ++count_3;
        rem += s[i] - '0';
    }
    rem = (9 - rem % 9) % 9;
    while (rem < 100)
    {
        int count_1 = rem / 2;
        if (count_1 % 3 <= count_2 and count_1 / 3 <= count_3 and rem % 2 == 0)
        {
            cout << "YES" << endl;
            return 0;
        }
        rem += 9;
    }
    cout << "NO" << endl;
    return 0;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    int t;
    cin >> t;
    for (int i = 0; i < t; ++i)
        solve();
    return 0;
}

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

using namespace std;

int solve()
{
    int count_2 = 0, count_3 = 0, rem = 0;
    string s;
    cin >> s;
    for (int i = 0; i < size(s); ++i)
    {
        if (s[i] == '2')
            ++count_2;
        if (s[i] == '3')
            ++count_3;
        rem += s[i] - '0';
    }
    rem = (9 - rem % 9) % 9;
    count_3 += count_2 / 3;
    count_2 %= 3;
    while (rem < 100)
    {
        int count_1 = rem / 2;
        if (count_1 % 3 <= count_2 and count_1 / 3 <= count_3 and rem % 2 == 0)
        {
            cout << "YES" << endl;
            return 0;
        }
        rem += 9;
    }
    cout << "NO" << endl;
    return 0;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    int t;
    cin >> t;
    for (int i = 0; i < t; ++i)
        solve();
    return 0;
}
Problem: 2050C - Uninteresting Number
Language: C++23 (GCC 14-64, msys2)


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

using namespace std;

int solve()
{
    int count_2 = 0, count_3 = 0, rem = 0;
    string s;
    cin >> s;
    for (int i = 0; i < size(s); ++i)
    {
        if (s[i] == '2')
            ++count_2;
        if (s[i] == '3')
            ++count_3;
        rem += s[i] - '0';
    }
    rem = (9 - rem % 9) % 9;
    while (rem < 100)
    {
        int count_1 = rem / 2;
        if (count_1 % 3 <= count_2 and count_1 / 3 <= count_3 and rem % 2 == 0)
        {
            cout << "YES" << endl;
            return 0;
        }
        rem += 9;
    }
    cout << "NO" << endl;
    return 0;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    int t;
    cin >> t;
    for (int i = 0; i < t; ++i)
        solve();
    return 0;
}
Problem: 2050C - Uninteresting Number
Language: C++23 (GCC 14-64, msys2)

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

using namespace std;

int solve()
{
    int count_2 = 0, count_3 = 0, rem = 0;
    string s;
    cin >> s;
    for (int i = 0; i < size(s); ++i)
    {
        if (s[i] == '2')
            ++count_2;
        if (s[i] == '3')
            ++count_3;
        rem += s[i] - '0';
    }
    rem = (9 - rem % 9) % 9;
    while (rem < 100)
    {
        int count_1 = rem / 2;
        count_1 -= min(count_3 * 3, count_1 / 3 * 3);
        if (count_1 % 3 <= count_2 and rem % 2 == 0)
        {
            cout << "YES" << endl;
            return 0;
        }
        rem += 9;
    }
    cout << "NO" << endl;
    return 0;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    int t;
    cin >> t;
    for (int i = 0; i < t; ++i)
        solve();
    return 0;
}

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

using namespace std;

int solve()
{
    int count_2 = 0, count_3 = 0, rem = 0;
    string s;
    cin >> s;
    for (int i = 0; i < size(s); ++i)
    {
        if (s[i] == '2')
            ++count_2;
        if (s[i] == '3')
            ++count_3;
        rem += s[i] - '0';
    }
    rem = (9 - rem % 9) % 9;
    while (rem < 100)
    {
        int count_1 = rem / 2;
        count_1 -= min(count_3 * 3, count_1 / 3 * 3);
        if (count_1 <= count_2 and rem % 2 == 0)
        {
            cout << "YES" << endl;
            return 0;
        }
        rem += 9;
    }
    cout << "NO" << endl;
    return 0;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    int t;
    cin >> t;
    for (int i = 0; i < t; ++i)
        solve();
    return 0;
}
Problem: 2050C - Uninteresting Number
Language: C++23 (GCC 14-64, msys2)

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

using namespace std;

int solve()
{
    int count_2 = 0, count_3 = 0, rem = 0;
    string s;
    cin >> s;
    for (int i = 0; i < size(s); ++i)
    {
        if (s[i] == '2')
            ++count_2;
        if (s[i] == '3')
            ++count_3;
        rem += s[i] - '0';
    }
    rem = (9 - rem % 9) % 9;
    count_3 += count_2 / 3;
    while (rem < 100)
    {
        int count_1 = rem / 2;
        if (count_1 % 3 <= count_2 and count_1 / 3 <= count_3 and rem % 2 == 0)
        {
            cout << "YES" << endl;
            return 0;
        }
        rem += 9;
    }
    cout << "NO" << endl;
    return 0;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    int t;
    cin >> t;
    for (int i = 0; i < t; ++i)
        solve();
    return 0;
}

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

using namespace std;

int solve()
{
    int count_2 = 0, count_3 = 0, rem = 0;
    string s;
    cin >> s;
    for (int i = 0; i < size(s); ++i)
    {
        if (s[i] == '2')
            ++count_2;
        if (s[i] == '3')
            ++count_3;
        rem += s[i] - '0';
    }
    rem = (9 - rem % 9) % 9;
    while (rem < 100)
    {
        int count_1 = rem / 2;
        count_1 -= min(count_3 * 3, count_1 / 3 * 3);
        if (count_1 % 3 <= count_2 and rem % 2 == 0)
        {
            cout << "YES" << endl;
            return 0;
        }
        rem += 9;
    }
    cout << "NO" << endl;
    return 0;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    int t;
    cin >> t;
    for (int i = 0; i < t; ++i)
        solve();
    return 0;
}
Problem: 2061D - Kevin and Numbers
Language: C++17 (GCC 7-32)


Submission (verdict: Wrong answer on test 3):
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;

void solve()
{
    int n, m, x, y, main_counter = 0;
    cin >> n >> m;
    map<int, int> nums;
    vector<int> gather;
    for (int i = 0; i < n; ++i)
    {
        cin >> x;
        ++nums[x];
    }

    for (int i = 0; i < m; ++i)
    {
        cin >> y;
        gather.push_back(y);
    }

    for (auto y : gather)
    {
        int nechet = (y / 2) * 2 + 1, count1 = y % 2;
        int chet = (y / 2) * 2, count2 = y % 2 == 0;

        while (y)
        {
            int x1 = min(nums[nechet], count1);
            int x2 = min(nums[chet], count2);
            count1 -= x1;
            count2 -= x2;
            nums[nechet] -= x1;
            nums[chet] -= x2;
            main_counter += x1 + x2;

            if (count1 == 0 and count2 == 0)
                break;

            int nwc1 = count1;
            int nwc2 = count1;
            switch ((nechet / 2) % 2)
            {
            case 1:
                nwc1 += 2 * count2;
                break;
            case 0:
                nwc2 += 2 * count2;
            }
            nechet = nechet / 2;
            chet = nechet + 1;
            if (chet % 2)
                swap(nechet, chet);
            count1 = nwc1;
            count2 = nwc2;
            y /= 2;
            //cout << nechet << " : " << count1 << "   " << chet << " ! " << count2 << endl;
        }
        
        if (count1 or count2)
        {
            cout << "no" << endl;
            return;
        }
    }
    if (main_counter == n)
        cout << "yes" << endl;
    else
        cout << "no" << endl;
}

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int t;
    cin >> t;
    while (t--)
        solve();
    return 0;
}
Problem: 2061D - Kevin and Numbers
Language: C++17 (GCC 7-32)


Submission (verdict: Wrong answer on test 3):
#include <bits/stdc++.h>
using namespace std;
#define inf numeric_limits<int>::max()
#define rinf numeric_limits<int>::min()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ll long long
#define rep(i, s, e) for(int i=s; i<e; i++)
#define rrep(i, s, e) for(int i=e-1; i>=s; i--)
#define pb push_back
#define endl "\n";
#define yes cout << "YES" << endl
#define no cout << "NO" << endl

void solve() {
    ll n, m; 
    cin >> n >> m;
    multiset<ll> a, b;
    rep(i, 0, n) {
        ll in;
        cin >> in;
        a.insert(in);
    }
    rep(i, 0, m) {
        ll in;
        cin >> in;
        b.insert(in);
    }
    while(a.size() && b.size()){
        ll x = *a.begin(), y = *b.begin();
        if(x == y) {
            a.erase(a.begin());
            b.erase(b.begin());
        } else {
            auto it1 = a.begin();
            it1++;
           if(it1 == a.end() || (*it1 - x) > 1) {
            no;
            return;
           } else {
            ll x2 = *it1;
            a.erase(a.begin());
            a.erase(a.begin());
            a.insert(x + x2);
           }
        }
    }
    if(a.size() || b.size()) {
        no;
    } else {
        yes;
    }

}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //cout << fixed << setprecision(12);
    
    // freopen("f.in", "r", stdin);
	// freopen("f.out", "w", stdout);
    
    ll t = 1; 
    cin >> t;
    while(t--) solve();
}
Problem: 2049B - pspspsps
Language: C++17 (GCC 7-32)

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

using namespace std;

typedef long long ll;

typedef long double ld;

#define fu(i,a,b) for(int i = a; i<b; i++)

#define f(i,a) for(int i = 0; i<a; i++)

#define fi(i,a) for(int i = a-1; i>=0; i--)

const int MOD = 998244353;

const int NMAX = 200000;







int main() {

    ios::sync_with_stdio(false);

    cin.tie(0);

    

  



    int t;

    cin >> t;

    while (t--) {

        int n;

        cin >> n;

        

        string s;



        int t=0;



        cin >> s;



        if(s[0]== 's')

        {

            t=1;

        }

        else if(s[n-1]=='p')

        {

            t=1;

        }

        else

        {

            t=1;

            f(i,n)

            {

                if(s[i]!= '.')

                {

                    t=0;

                }

            }

        }



        if(t==1)

        {

            cout << "YES" << endl;

        }

        else

        {

            cout << "NO" << endl;

        }







    }



    return 0;

}



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

using namespace std;

typedef long long ll;

typedef long double ld;

#define fu(i,a,b) for(int i = a; i<b; i++)

#define f(i,a) for(int i = 0; i<a; i++)

#define fi(i,a) for(int i = a-1; i>=0; i--)

const int MOD = 998244353;

const int NMAX = 200000;







int main() {

    ios::sync_with_stdio(false);

    cin.tie(0);

    

  



    int t;

    cin >> t;

    while (t--) {

        int n;

        cin >> n;

        

        string s;



        int t=0;



        cin >> s;



        if(s[0]== 's')

        {

            t=1;

        }

        else if(s[n-1]=='p')

        {

            t=1;

        }

        else

        {

            t=1;

            f(i,n)

            {

                if(s[i]!= '.')

                {

                    t=0;

                }

            }

        }



        char m = '.';





        f(i,n)

        {





            if(s[i]=='s' && m == 'p')

            {

                t=0;

            }







                        if(s[i]=='s')

            {

                m = 's';

            }

            if(s[i]=='p')

            {

                m = 'p';

            }



        }



        if(t==1)

        {

            cout << "YES" << endl;

        }

        else

        {

            cout << "NO" << endl;

        }







    }



    return 0;

}
Problem: 2049B - pspspsps
Language: C++17 (GCC 7-32)


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

using namespace std;

typedef long long ll;

typedef long double ld;

#define fu(i,a,b) for(int i = a; i<b; i++)

#define f(i,a) for(int i = 0; i<a; i++)

#define fi(i,a) for(int i = a-1; i>=0; i--)

const int MOD = 998244353;

const int NMAX = 200000;







int main() {

    ios::sync_with_stdio(false);

    cin.tie(0);

    

  



    int t;

    cin >> t;

    while (t--) {

        int n;

        cin >> n;

        

        string s;



        int t=0;



        cin >> s;



        if(s[0]== 's')

        {

            t=1;

        }

        else if(s[n-1]=='p')

        {

            t=1;

        }

        else

        {

            t=1;

            f(i,n)

            {

                if(s[i]!= '.')

                {

                    t=0;

                }

            }

        }



        if(t==1)

        {

            cout << "YES" << endl;

        }

        else

        {

            cout << "NO" << endl;

        }







    }



    return 0;

}