ShaysXIA/CodeInsightBench huggingface dataset:
Problem: 2050C - Uninteresting Number
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 2):
#include <bits/stdc++.h>
using namespace std;
#define int long long 
#define pii pair<int,int>
const int maxn = 100005, MOD = 1e9 + 7;

void fast_io(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);   
}

// bool prime[1001];

// void SieveOfEratosthenes(int n)
// {
//     memset(prime, true, sizeof(prime));
//     for (int p = 2; p * p <= n; p++) {
//         if (prime[p] == true) {
//             for (int i = p * p; i <= n; i += p)prime[i] = false;
//         }
//     }
// }


void solve(){
    string n; cin >> n; 
    int twos = 0, threes = 0, md = 0;
    int x = n.size();
    bool ans = 0;
    for(int i = 0; i<x ; ++i){
        int temp = (int)(n[i]) - 48;
        md += temp; 
        md = (md % 9);
        // cout << temp << " ";
        if(temp == 2) twos++;
        if(temp == 3) threes++;

    }
    twos = (twos%9);
    threes = (threes%3);
    for(int i = 0; i<=twos; ++i){
        for(int j = 0; j<=threes; ++j){
            int temp = (2*i) + (6*j);
            if((md+temp) % 9 == 0) {
                ans = 1;
                break;
            }
        }
        if(ans) break;
    }
    if(ans) cout << "YES";
    else cout << "NO";
    
}

signed main() {
    fast_io();
    int t = 1;
    cin >> t;
    while(t--){
        solve();
        cout << endl;
    }
}



Submission (verdict: Wrong answer on test 3):
#include <bits/stdc++.h>
using namespace std;
#define int long long 
#define pii pair<int,int>
const int maxn = 100005, MOD = 1e9 + 7;

void fast_io(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);   
}

// bool prime[1001];

// void SieveOfEratosthenes(int n)
// {
//     memset(prime, true, sizeof(prime));
//     for (int p = 2; p * p <= n; p++) {
//         if (prime[p] == true) {
//             for (int i = p * p; i <= n; i += p)prime[i] = false;
//         }
//     }
// }


void solve(){
    string n; cin >> n; 
    int twos = 0, threes = 0, md = 0;
    int x = n.size();
    bool ans = 0;
    for(int i = 0; i<x ; ++i){
        int temp = (int)(n[i]) - 48;
        md += temp; 
        md = (md % 9);
        // cout << temp << " ";
        if(temp == 2) twos++;
        if(temp == 3) threes++;

    }
    twos = (twos%9);
    threes = (threes%9);
    for(int i = 0; i<=twos; ++i){
        for(int j = 0; j<=threes; ++j){
            int temp = (2*i) + (6*j);
            if((md+temp) % 9 == 0) {
                ans = 1;
                break;
            }
        }
        if(ans) break;
    }
    if(ans) cout << "YES";
    else cout << "NO";
    
}

signed main() {
    fast_io();
    int t = 1;
    cin >> t;
    while(t--){
        solve();
        cout << endl;
    }
}
Problem: 2050C - Uninteresting Number
Language: C++17 (GCC 7-32)


Submission (verdict: Wrong answer on test 2):
#include <bits/stdc++.h>
using namespace std;
#define int long long 
#define pii pair<int,int>
const int maxn = 100005, MOD = 1e9 + 7;

void fast_io(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);   
}

// bool prime[1001];

// void SieveOfEratosthenes(int n)
// {
//     memset(prime, true, sizeof(prime));
//     for (int p = 2; p * p <= n; p++) {
//         if (prime[p] == true) {
//             for (int i = p * p; i <= n; i += p)prime[i] = false;
//         }
//     }
// }


void solve(){
    string n; cin >> n; 
    int twos = 0, threes = 0, md = 0;
    int x = n.size();
    bool ans = 0;
    for(int i = 0; i<x ; ++i){
        int temp = (int)(n[i]) - 48;
        md += temp; 
        md = (md % 9);
        // cout << temp << " ";
        if(temp == 2) twos++;
        if(temp == 3) threes++;

    }
    twos = (twos%9);
    threes = (threes%3);
    for(int i = 0; i<=twos; ++i){
        for(int j = 0; j<=threes; ++j){
            int temp = (2*i) + (6*j);
            if((md+temp) % 9 == 0) {
                ans = 1;
                break;
            }
        }
        if(ans) break;
    }
    if(ans) cout << "YES";
    else cout << "NO";
    
}

signed main() {
    fast_io();
    int t = 1;
    cin >> t;
    while(t--){
        solve();
        cout << endl;
    }
}
Problem: 2057B - Gorilla and the Exam
Language: C++23 (GCC 14-64, msys2)

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t;
    cin >> t;
    
    while (t--) {
        int n, k;
        cin >> n >> k;
        
        unordered_map<int, int> m;
        for (int i = 0; i < n; i++) {
            int num;
            cin >> num;
            m[num]++;
        }

    
        priority_queue<int, vector<int>, greater<int>> minHeap;
        for (auto& p : m) {
            minHeap.push(p.second);
        }

        int distinct = m.size();
        
       
        while (!minHeap.empty() && k >= minHeap.top()) {
            k -= minHeap.top();
            minHeap.pop();
            distinct--;
        }

        cout << max(1, distinct) <<endl;
    }
    
  
}


Submission (verdict: Accepted):
#include <bits/stdc++.h>
using namespace std;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin>>t;
    while(t--){
        int n,k;
        cin>>n>>k;
        vector<int> a(n);
        //set<int> s;
      
        map<int,int> m;
        vector<int> freq;
        for(int i=0;i<n;i++){
            cin>>a[i];
            m[a[i]]++;
            
            //s.insert(a[i]);
        }
        for (map<int, int>::iterator it = m.begin(); it != m.end(); it++) {
            freq.push_back(it->second);
        }
        sort(freq.begin(),freq.end());

        int ans=m.size();
        for(int i=0;i<freq.size();i++){
            if(k>=freq[i]){
                k=k-freq[i];
                ans--;
            }
            else {
                break;
            }
        }
        if(ans==0) cout<<"1"<<endl;
       else  cout<<ans<<endl;


    }
}
Problem: 2057B - Gorilla and the Exam
Language: C++23 (GCC 14-64, msys2)

Previous submission (verdict: Time limit exceeded on test 11):
#include <bits/stdc++.h>
using namespace std;
int main() {
    int t;
    cin>>t;
    while(t--){
        int n,k;
        cin>>n>>k;
        vector<int> a(n);
        set<int> s;
        unordered_map<int,int> m;
        vector<int> freq;
        for(int i=0;i<n;i++){
            cin>>a[i];
            m[a[i]]++;
            
            s.insert(a[i]);
        }
        for (unordered_map<int, int>::iterator it = m.begin(); it != m.end(); it++) {
            freq.push_back(it->second);
        }
        sort(freq.begin(),freq.end());

        int ans=s.size();
        for(int i=0;i<freq.size();i++){
            if(k>=freq[i]){
                k=k-freq[i];
                ans--;
            }
            else {
                break;
            }
        }
        if(ans==0) cout<<"1"<<endl;
       else  cout<<ans<<endl;


    }
}

Submission (verdict: Time limit exceeded on test 11):
#include <bits/stdc++.h>
using namespace std;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin>>t;
    while(t--){
        int n,k;
        cin>>n>>k;
        vector<int> a(n);
        set<int> s;
        unordered_map<int,int> m;
        vector<int> freq;
        for(int i=0;i<n;i++){
            cin>>a[i];
            m[a[i]]++;
            
            s.insert(a[i]);
        }
        for (unordered_map<int, int>::iterator it = m.begin(); it != m.end(); it++) {
            freq.push_back(it->second);
        }
        sort(freq.begin(),freq.end());

        int ans=s.size();
        for(int i=0;i<freq.size();i++){
            if(k>=freq[i]){
                k=k-freq[i];
                ans--;
            }
            else {
                break;
            }
        }
        if(ans==0) cout<<"1"<<endl;
       else  cout<<ans<<endl;


    }
}
Problem: 2057B - Gorilla and the Exam
Language: C++23 (GCC 14-64, msys2)

Previous submission (verdict: Memory limit exceeded on test 1):
#include <bits/stdc++.h>
using namespace std;
int main() {
    int t;
    cin>>t;
    while(t--){
        int n,k;
        cin>>n>>k;
        vector<int> a(n);
      
       
        
        for(int i=0;i<n;i++){
            cin>>a[i];
           
            
           
        }
        vector<int> freq(1e8);
        for(int i=0;i<n;i++){
            freq[a[i]]++;
        }
        sort(freq.rbegin(),freq.rend());

        vector<int> freq1;
        for(int i=0;i<freq.size();i++){
            if(freq[i]!=0){
                freq1.push_back(freq[i]);
            }
            else {
                break;
            }
            
        }
       
        sort(freq1.begin(),freq1.end());

       int ans=freq1.size();
        for(int i=0;i<freq1.size();i++){
            if(k>=freq1[i]){
                k=k-freq1[i];
                ans--;
            }
            else {
                break;
            }
        }
        if(ans==0) cout<<"1"<<endl;
       else  cout<<ans<<endl;


    }
}

Submission (verdict: Time limit exceeded on test 11):
#include <bits/stdc++.h>
using namespace std;
int main() {
    int t;
    cin>>t;
    while(t--){
        int n,k;
        cin>>n>>k;
        vector<int> a(n);
        set<int> s;
        unordered_map<int,int> m;
        vector<int> freq;
        for(int i=0;i<n;i++){
            cin>>a[i];
            m[a[i]]++;
            
            s.insert(a[i]);
        }
        for (unordered_map<int, int>::iterator it = m.begin(); it != m.end(); it++) {
            freq.push_back(it->second);
        }
        sort(freq.begin(),freq.end());

        int ans=s.size();
        for(int i=0;i<freq.size();i++){
            if(k>=freq[i]){
                k=k-freq[i];
                ans--;
            }
            else {
                break;
            }
        }
        if(ans==0) cout<<"1"<<endl;
       else  cout<<ans<<endl;


    }
}
Problem: 2057B - Gorilla and the Exam
Language: C++23 (GCC 14-64, msys2)

Previous submission (verdict: Time limit exceeded on test 11):
#include <bits/stdc++.h>
using namespace std;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin>>t;
    while(t--){
        int n,k;
        cin>>n>>k;
        vector<int> a(n);
        set<int> s;
        unordered_map<int,int> m;
        vector<int> freq;
        for(int i=0;i<n;i++){
            cin>>a[i];
            m[a[i]]++;
            
            s.insert(a[i]);
        }
        for (unordered_map<int, int>::iterator it = m.begin(); it != m.end(); it++) {
            freq.push_back(it->second);
        }
        sort(freq.begin(),freq.end());

        int ans=s.size();
        for(int i=0;i<freq.size();i++){
            if(k>=freq[i]){
                k=k-freq[i];
                ans--;
            }
            else {
                break;
            }
        }
        if(ans==0) cout<<"1"<<endl;
       else  cout<<ans<<endl;


    }
}

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t;
    cin >> t;
    
    while (t--) {
        int n, k;
        cin >> n >> k;
        
        unordered_map<int, int> m;
        for (int i = 0; i < n; i++) {
            int num;
            cin >> num;
            m[num]++;
        }

    
        priority_queue<int, vector<int>, greater<int>> minHeap;
        for (auto& p : m) {
            minHeap.push(p.second);
        }

        int distinct = m.size();
        
       
        while (!minHeap.empty() && k >= minHeap.top()) {
            k -= minHeap.top();
            minHeap.pop();
            distinct--;
        }

        cout << max(1, distinct) <<endl;
    }
    
  
}
Problem: 2057B - Gorilla and the Exam
Language: C++23 (GCC 14-64, msys2)


Submission (verdict: Memory limit exceeded on test 1):
#include <bits/stdc++.h>
using namespace std;
int main() {
    int t;
    cin>>t;
    while(t--){
        int n,k;
        cin>>n>>k;
        vector<int> a(n);
      
       
        
        for(int i=0;i<n;i++){
            cin>>a[i];
           
            
           
        }
        vector<int> freq(1e8);
        for(int i=0;i<n;i++){
            freq[a[i]]++;
        }
        sort(freq.rbegin(),freq.rend());

        vector<int> freq1;
        for(int i=0;i<freq.size();i++){
            if(freq[i]!=0){
                freq1.push_back(freq[i]);
            }
            else {
                break;
            }
            
        }
       
        sort(freq1.begin(),freq1.end());

       int ans=freq1.size();
        for(int i=0;i<freq1.size();i++){
            if(k>=freq1[i]){
                k=k-freq1[i];
                ans--;
            }
            else {
                break;
            }
        }
        if(ans==0) cout<<"1"<<endl;
       else  cout<<ans<<endl;


    }
}
Problem: 2060D - Subtract Min Sort
Language: C++17 (GCC 7-32)


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

using namespace std;

int main() {
    int t;
    cin>>t;

    while(t--) {
        int n;
        cin>>n;

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

        bool valid_sort = true;
        int inflection_point = 0;
        for(int i=1; i<n; i++) {
            if(arr[i-1]>arr[i]) {
                int j = i-1;

                while(j-1>=inflection_point) {
                    int subtract_val = min(arr[j], arr[j-1]);
                    arr[j] -= subtract_val;
                    arr[j-1] -= subtract_val;
                    j--;
                }

                if(arr[i-1] > arr[i]) {
                    valid_sort = false;
                }

                inflection_point = i;
            }
        }

        if(valid_sort) {
            cout<<"YES"<<endl;
        } else {
            cout<<"NO"<<endl;
        }
    }

    return 0;
}
Problem: 2060D - Subtract Min Sort
Language: C++17 (GCC 7-32)

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

using namespace std;

int main() {
    int t;
    cin>>t;

    while(t--) {
        int n;
        cin>>n;

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

        bool valid_sort = true;
        int inflection_point = 0;
        for(int i=1; i<n; i++) {
            if(arr[i-1]>arr[i]) {
                int j = i-1;

                while(j-1>=inflection_point) {
                    int subtract_val = min(arr[j], arr[j-1]);
                    arr[j] -= subtract_val;
                    arr[j-1] -= subtract_val;
                    j--;
                }

                if(arr[i-1] > arr[i]) {
                    valid_sort = false;
                }

                inflection_point = i-1;
            }
        }

        if(valid_sort) {
            cout<<"YES"<<endl;
        } else {
            cout<<"NO"<<endl;
        }
    }

    return 0;
}

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

using namespace std;

int main() {
    int t;
    cin>>t;

    while(t--) {
        int n;
        cin>>n;

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

        bool valid_sort = true;
        int inflection_point = 0;
        for(int i=1; i<n; i++) {
            int j = i-1;

            while(j-1>=inflection_point && valid_sort) {
                int subtract_val = min(arr[j], arr[j-1]);
                arr[j] -= subtract_val;
                arr[j-1] -= subtract_val;
                
                if(arr[j-1] > arr[j]) {
                    valid_sort = false;
                }

                j--;
            }

            if(arr[i-1] > arr[i]) {
                valid_sort = false;
            }

            inflection_point = i-1;
        
        }

        if(valid_sort) {
            cout<<"YES"<<endl;
        } else {
            cout<<"NO"<<endl;
        }
    }

    return 0;
}
Problem: 2060D - Subtract Min Sort
Language: C++17 (GCC 7-32)

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

using namespace std;

int main() {
    int t;
    cin>>t;

    while(t--) {
        int n;
        cin>>n;

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

        bool valid_sort = true;
        int inflection_point = 0;
        for(int i=1; i<n; i++) {
            if(arr[i-1]>arr[i]) {
                int j = i-1;

                while(j-1>=inflection_point) {
                    int subtract_val = min(arr[j], arr[j-1]);
                    arr[j] -= subtract_val;
                    arr[j-1] -= subtract_val;
                    j--;
                }

                if(arr[i-1] > arr[i]) {
                    valid_sort = false;
                }

                inflection_point = i;
            }
        }

        if(valid_sort) {
            cout<<"YES"<<endl;
        } else {
            cout<<"NO"<<endl;
        }
    }

    return 0;
}

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

using namespace std;

int main() {
    int t;
    cin>>t;

    while(t--) {
        int n;
        cin>>n;

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

        bool valid_sort = true;
        int inflection_point = 0;
        for(int i=1; i<n; i++) {
            if(arr[i-1]>arr[i]) {
                int j = i-1;

                while(j-1>=inflection_point) {
                    int subtract_val = min(arr[j], arr[j-1]);
                    arr[j] -= subtract_val;
                    arr[j-1] -= subtract_val;
                    j--;
                }

                if(arr[i-1] > arr[i]) {
                    valid_sort = false;
                }

                inflection_point = i-1;
            }
        }

        if(valid_sort) {
            cout<<"YES"<<endl;
        } else {
            cout<<"NO"<<endl;
        }
    }

    return 0;
}
Problem: 2050B - Transfusion
Language: C++17 (GCC 7-32)

Previous submission (verdict: Compilation error):
#include<bits/stdc++.h>

using namespace std;

int main(){

	int t;

	scanf("%d",&t);

	int n;

	vector<int>a(n);

	while(t--){

		bool ret=true;

		scanf("%d",&n);

		int sum=0;

		for(int i=0;i<n;i++){

			scanf("%d",&a[i]);

			sum+=a[i];

		}

		if(sum%n!=0){

			printf("NO\n");

			continue;

		}

		int equal=sum/n;

		bool ret=true;

		for(int i=1;i<n-1;i++){

			int cha=a[i-1]-equal;

			if(cha!=0){

				a[i-1]=equal;

				a[i+1]+=cha;

				if(a[i+1]<0){

					ret=false;

					break;

				}

			}

		}

		if(a[n-1]!=equal){

			ret=false;

		}

		if(ret){

			printf("YES\n");

		}else{

			printf("NO\n");

		}

		

	}

	return 0;

}

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

using namespace std;

int main(){

	int t;

	scanf("%d",&t);

	int n;

	vector<int>a(n);

	while(t--){

		

		scanf("%d",&n);

		long long int sum=0;

		for(int i=0;i<n;i++){

			scanf("%d",&a[i]);

			sum+=a[i];

		}

		if(sum%n!=0){

			printf("NO\n");

			continue;

		}

		int equal=sum/n;

		bool ret=true;

		for(int i=1;i<n-1;i++){

			int cha=a[i-1]-equal;

			if(cha!=0){

				a[i-1]=equal;

				a[i+1]+=cha;

				if(a[i+1]<0){

					ret=false;

					break;

				}

			}

		}

		if(a[n-1]!=equal){

			ret=false;

		}

		if(ret){

			printf("YES\n");

		}else{

			printf("NO\n");

		}

		

	}

	return 0;

}
Problem: 2050B - Transfusion
Language: C++17 (GCC 7-32)


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

using namespace std;

int main(){

	int t;

	scanf("%d",&t);

	int n;

	vector<int>a(n);

	while(t--){

		bool ret=true;

		scanf("%d",&n);

		int sum=0;

		for(int i=0;i<n;i++){

			scanf("%d",&a[i]);

			sum+=a[i];

		}

		if(sum%n!=0){

			printf("NO\n");

			continue;

		}

		int equal=sum/n;

		bool ret=true;

		for(int i=1;i<n-1;i++){

			int cha=a[i-1]-equal;

			if(cha!=0){

				a[i-1]=equal;

				a[i+1]+=cha;

				if(a[i+1]<0){

					ret=false;

					break;

				}

			}

		}

		if(a[n-1]!=equal){

			ret=false;

		}

		if(ret){

			printf("YES\n");

		}else{

			printf("NO\n");

		}

		

	}

	return 0;

}
Problem: 2050B - Transfusion
Language: C++17 (GCC 7-32)

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

using namespace std;

int main(){

	int t;

	scanf("%d",&t);

	int n;

	vector<int>a(n);

	while(t--){

		

		scanf("%d",&n);

		long long int sum=0;

		for(int i=0;i<n;i++){

			scanf("%d",&a[i]);

			sum+=a[i];

		}

		if(sum%n!=0){

			printf("NO\n");

			continue;

		}

		int equal=sum/n;

		bool ret=true;

		for(int i=1;i<n-1;i++){

			int cha=a[i-1]-equal;

			if(cha!=0){

				a[i-1]=equal;

				a[i+1]+=cha;

				if(a[i+1]<0){

					ret=false;

					break;

				}

			}

		}

		if(a[n-1]!=equal){

			ret=false;

		}

		if(ret){

			printf("YES\n");

		}else{

			printf("NO\n");

		}

		

	}

	return 0;

}

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

using namespace std;

int main(){

	int t;

	scanf("%d",&t);

	int n;

	vector<int>a(n);

	while(t--){

		

		scanf("%d",&n);

		long long int sum_ji=0,cnt_ji=0,sum_ou=0,cnt_ou=0;

		for(int i=0;i<n;i++){

			scanf("%d",&a[i]);

			if(i==0||i%2==0){

				sum_ji+=a[i];

				cnt_ji++;

			}else{

				sum_ou+=a[i];

				cnt_ou++;

			}

		}

		

		int equal=(sum_ji+sum_ou)/n;

		

		if(cnt_ji*equal!=sum_ji){

			printf("NO\n");

			continue;

		}

		if(cnt_ou*equal!=sum_ou){

			printf("NO\n");

			continue;

		}

		printf("YES\n");

		

		

	}

	return 0;

}
Problem: 2050D - Digital string maximization
Language: C++17 (GCC 7-32)

Previous submission (verdict: Time limit exceeded on test 6):
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<unordered_map>
using namespace std;

int main(){
    int t;
    cin>>t;
    for(int i=0;i<t;i++){
       string s;
       cin>>s;
       vector<char> vec;

       for(int j=0;j<s.length();j++){
              for(int k=j;k>max(0,k-10);k--){
                     if(s[k]-s[k-1]>1){
                        int temp=s[k]-1;
                        s[k]=s[k-1];
                        s[k-1]=temp;
                     }
              }
       }  
           cout<<s<<endl;
    }
    return 0;
}

Submission (verdict: Accepted):
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<unordered_map>
using namespace std;

int main(){
    int t;
    cin>>t;
    for(int i=0;i<t;i++){
       string s;
       cin>>s;
       vector<char> vec;

       for(int j=1;j<s.length();j++){
        // int h=s[j-1]-48;
       
              for(int k=j;k>0;k--){
                //    cout<<"k";
                     if(s[k]-s[k-1]>1){
                        int temp=s[k]-1;
                        s[k]=s[k-1];
                        s[k-1]=temp;
                     }
                     else{
                        break;
                     }
              }
            //   cout<<" ";
            //    cout<<s<<endl;
       }  
           cout<<s<<endl;
    }
    return 0;
}