ShaysXIA/CodeInsightBench huggingface dataset:
Problem: 2063B - Subsequence Update
Language: C++17 (GCC 7-32)

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

using namespace std;

#define endl '\n'

#define ll long long



void Test() {

    ll n, l, r;

    cin >> n >> l >> r;

    vector<pair<ll, ll> > v;

    for(ll i=1; i<=n; i++){

        ll x;

        cin >> x;

        v.push_back(make_pair(x, i));

    }

    sort(v.begin(), v.end());

    ll m = r-l+1;

    ll sum = 0;

    ll bs = 0, bc = m;

    ll ss = 0, sc = m;

    ll i = 0;

    ll flag;

    while(true){

        if(v[i].second < l){

            ss += v[i].first;

            sc--;

        }

        else if(v[i].second > r){

            bs += v[i].first;

            bc--;

        }

        else{

            sum += v[i].first;

            sc--;

            bc--;

        }

        if(!bc){

            flag = 0;

            break;

        }

        else if(!sc){

            flag = 1;

            break;

        }

        i++;

    }

    if(flag)

        sum += ss;

    else

        sum += bs;

    cout << sum << endl;

}



int main() {

   ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



    ll t;

    cin >> t;

    while(t--) {

        Test();

    }



    return 0;

}

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

void Test() {
    ll n, l, r;
    cin >> n >> l >> r;
    vector<ll> left;
    vector<ll> right;
    for(ll i=1; i<=n; i++){
        ll x;
        cin >> x;
        if(i<l)
            left.push_back(x);
        else if(i>r)
            right.push_back(x);
        else{
            left.push_back(x);
            right.push_back(x);
        }
    }
    sort(left.begin(), left.end());
    sort(right.begin(), right.end());
    ll i = 0;
    ll m = r-l+1;
    ll ls = 0, rs = 0;
    while(m--){
        ls += left[i];
        rs += right[i];
        i++;
    }
    if(ls < rs){
        cout << ls << endl;
    }
    else 
        cout << rs << endl;
}

int main() {
   ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

    ll t;
    cin >> t;
    while(t--) {
        Test();
    }

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

Previous submission (verdict: Wrong answer on test 3):
#include <iostream>

using namespace std;



int main() 

{

    int t;

    cin >> t;

    while (t--) {

        long long n;

        cin >> n;

        int c2 = 0, c3 = 0;

        long long sum = 0;

        

        long long temp_n = n;  

        while (temp_n != 0) {

            int digit = temp_n % 10;

            if (digit == 2) c2++;

            else if (digit == 3) c3++;

            sum += digit;

            temp_n /= 10;

        }



        int rem = sum % 9;

        if (rem == 0) {

            cout << "YES" << endl;

            continue;

        }

        bool flag = false;

        int temp = 0;

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

            for (int j = 0; j <= c3; j++) {

                temp = i * 2 + j * 6;

                if ((sum + temp) % 9 == 0) {

                    cout <<  "YES" << endl;

                    flag = true;

                    break;

                }

            }

            if(flag == true) break;

        }



        if(flag == false) cout << "NO" << endl;

    }

    return 0;

}



Submission (verdict: Wrong answer on test 1):
#include <iostream>

using namespace std;



int main() 

{

    int t;

    cin >> t;

    while (t--) {

        long long n;

        cin >> n;

        int c2 = 0, c3 = 0;

        long long sum = 0;

        

        long long temp_n = n;  

        while (temp_n != 0) {

            int digit = temp_n % 10;

            if (digit == 2) c2++;

            else if (digit == 3) c3++;

            sum += digit;

            temp_n /= 10;

        }



        int rem = sum % 9;

        if (rem == 0) {

            cout << "YES" << endl;

            continue;

        }

        bool flag = false;

        int temp = 0;

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

            for (int j = 0; j <= c3; j++) {

                int tmpsum=sum+i*6+j*2;

                if (tmpsum % 9 == 0) {

                    cout <<  "YES" << endl;

                    flag = true;

                    break;

                }

            }

            if(flag == true) break;

        }



        if(flag == false) cout << "NO" << endl;

    }

    return 0;

}
Problem: 2050C - Uninteresting Number
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 1):
#include <iostream>

using namespace std;



int main() 

{

    int t;

    cin >> t;

    while (t--) {

        long long n;

        cin >> n;

        int c2 = 0, c3 = 0;

        long long sum = 0;

        

        long long temp_n = n;  

        while (temp_n != 0) {

            int digit = temp_n % 10;

            if (digit == 2) c2++;

            else if (digit == 3) c3++;

            sum += digit;

            temp_n /= 10;

        }



        int rem = sum % 9;

        if (rem == 0) {

            cout << "YES" << endl;

            continue;

        }

        bool flag = false;

        int temp = 0;

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

            for (int j = 0; j <= c3; j++) {

                int tmpsum=sum+i*6+j*2;

                if (tmpsum % 9 == 0) {

                    cout <<  "YES" << endl;

                    flag = true;

                    break;

                }

            }

            if(flag == true) break;

        }



        if(flag == false) cout << "NO" << endl;

    }

    return 0;

}



Submission (verdict: Wrong answer on test 3):
#include <iostream>

using namespace std;



int main() 

{

    int t;

    cin >> t;

    while (t--) {

        long long n;

        cin >> n;

        int c2 = 0, c3 = 0;

        long long sum = 0;

        

        long long temp_n = n;  

        while (temp_n != 0) {

            int digit = temp_n % 10;

            if (digit == 2) c2++;

            else if (digit == 3) c3++;

            sum += digit;

            temp_n /= 10;

        }



        int rem = sum % 9;

        if (rem == 0) {

            cout << "YES" << endl;

            continue;

        }

        bool flag = false;

        int temp = 0;

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

            for (int j = 0; j <= c3; j++) {

                int tmpsum=sum+i*2+j*6;

                if (tmpsum % 9 == 0) {

                    cout <<  "YES" << endl;

                    flag = true;

                    break;

                }

            }

            if(flag == true) break;

        }



        if(flag == false) cout << "NO" << endl;

    }

    return 0;

}
Problem: 2050C - Uninteresting Number
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 3):
#include <iostream>

using namespace std;



int main() 

{

    int t;

    cin >> t;

    while (t--) {

        long long n;

        cin >> n;

        int c2 = 0, c3 = 0;

        long long sum = 0;

        

        long long temp_n = n;  

        while (temp_n != 0) {

            int digit = temp_n % 10;

            if (digit == 2) c2++;

            else if (digit == 3) c3++;

            sum += digit;

            temp_n /= 10;

        }



        int rem = sum % 9;

        if (rem == 0) {

            cout << "YES" << endl;

            continue;

        }

        bool flag = false;

        int temp = 0;

        for (int i = 0; i <= min(c2,9); i++) {

            for (int j = 0; j <= min(c3,3); j++) {

                int tmpsum=sum+i*2+j*6;

                if (tmpsum % 9 == 0) {

                    cout <<  "YES" << endl;

                    flag = true;

                    break;

                }

            }

            if(flag == true) break;

        }



        if(flag == false) cout << "NO" << endl;

    }

    return 0;

}



Submission (verdict: Accepted):
#include <iostream>

using namespace std;



int main() 

{

    int t;

    cin >> t;

    while (t--) {

        string s;

      int n;

       cin>>s;

       n= s.length();

       int c2=0;

       int c3=0;

       int sum=0;

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

           if(s[i]=='2')c2++;

           else if(s[i]=='3')c3++;

           sum+=s[i]-'0';

       }



        int rem = sum % 9;

        if (rem == 0) {

            cout << "YES" << endl;

            continue;

        }

        bool flag = false;

        int temp = 0;

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

            for (int j = 0; j <= c3; j++) {

                int tmpsum=sum+i*2+j*6;

                if (tmpsum % 9 == 0) {

                    cout <<  "YES" << endl;

                    flag = true;

                    break;

                }

            }

            if(flag == true) break;

        }



        if(flag == false) cout << "NO" << endl;

    }

    return 0;

}
Problem: 2050C - Uninteresting Number
Language: C++17 (GCC 7-32)


Submission (verdict: Wrong answer on test 3):
#include <iostream>

using namespace std;



int main() 

{

    int t;

    cin >> t;

    while (t--) {

        long long n;

        cin >> n;

        int c2 = 0, c3 = 0;

        long long sum = 0;

        

        long long temp_n = n;  

        while (temp_n != 0) {

            int digit = temp_n % 10;

            if (digit == 2) c2++;

            else if (digit == 3) c3++;

            sum += digit;

            temp_n /= 10;

        }



        int rem = sum % 9;

        if (rem == 0) {

            cout << "YES" << endl;

            continue;

        }

        bool flag = false;

        int temp = 0;

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

            for (int j = 0; j <= c3; j++) {

                temp = i * 2 + j * 6;

                if ((sum + temp) % 9 == 0) {

                    cout <<  "YES" << endl;

                    flag = true;

                    break;

                }

            }

            if(flag == true) break;

        }



        if(flag == false) cout << "NO" << endl;

    }

    return 0;

}
Problem: 2050C - Uninteresting Number
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 3):
#include <iostream>

using namespace std;



int main() 

{

    int t;

    cin >> t;

    while (t--) {

        long long n;

        cin >> n;

        int c2 = 0, c3 = 0;

        long long sum = 0;

        

        long long temp_n = n;  

        while (temp_n != 0) {

            int digit = temp_n % 10;

            if (digit == 2) c2++;

            else if (digit == 3) c3++;

            sum += digit;

            temp_n /= 10;

        }



        int rem = sum % 9;

        if (rem == 0) {

            cout << "YES" << endl;

            continue;

        }

        bool flag = false;

        int temp = 0;

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

            for (int j = 0; j <= c3; j++) {

                int tmpsum=sum+i*2+j*6;

                if (tmpsum % 9 == 0) {

                    cout <<  "YES" << endl;

                    flag = true;

                    break;

                }

            }

            if(flag == true) break;

        }



        if(flag == false) cout << "NO" << endl;

    }

    return 0;

}



Submission (verdict: Wrong answer on test 3):
#include <iostream>

using namespace std;



int main() 

{

    int t;

    cin >> t;

    while (t--) {

        long long n;

        cin >> n;

        int c2 = 0, c3 = 0;

        long long sum = 0;

        

        long long temp_n = n;  

        while (temp_n != 0) {

            int digit = temp_n % 10;

            if (digit == 2) c2++;

            else if (digit == 3) c3++;

            sum += digit;

            temp_n /= 10;

        }



        int rem = sum % 9;

        if (rem == 0) {

            cout << "YES" << endl;

            continue;

        }

        bool flag = false;

        int temp = 0;

        for (int i = 0; i <= min(c2,9); i++) {

            for (int j = 0; j <= min(c3,3); j++) {

                int tmpsum=sum+i*2+j*6;

                if (tmpsum % 9 == 0) {

                    cout <<  "YES" << endl;

                    flag = true;

                    break;

                }

            }

            if(flag == true) break;

        }



        if(flag == false) cout << "NO" << endl;

    }

    return 0;

}
Problem: 2063B - Subsequence Update
Language: C++17 (GCC 7-32)


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



using namespace std ;

  

int main(){

    int t ; 

    cin>>t ;

    while(t--){

        

       int a ;

       int l ;

       int r ;

       cin>>a ;

       cin>>l ;

       cin>>r ; 

       

       vector<int> vect(a , 0 ); 

       

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

           cin>>vect[i] ; 

       }

       l-- ; r-- ; 

      sort(vect.begin() , vect.begin() + l  ) ;     

      sort(vect.begin() + l  , vect.begin() + r + 1 ) ; 

      sort(vect.begin() + r + 1  , vect.end()) ; 

      int sum1 = 0  ; 

       for(int i = l ; i <= r ; i++){

           sum1 += vect[i] ; 

       }     

       int sum2 = sum1 ; 

       int i = r + 1  ; 

      int j = r ; 

       while(i < vect.size() and j >= l) {

           if(vect[i] > vect[j]) break ; 

           sum1 -= vect[j] - vect[i] ; 

           j-- ; i++ ; 

       }

       i = 0 ; 

       j = r ; 

       while( j >= l and i < l  ){

               if(vect[i] > vect[j]) break ; 

           sum2 -= vect[j] - vect[i] ; 

           j-- ; i++ ; 

       }

       cout<<min(sum1 , sum2 ) ; 

    }

}
Problem: 2063B - Subsequence Update
Language: C++17 (GCC 7-32)

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

using namespace std ;
  
int main(){
    int t ; 
    cin>>t ;
    while(t--){
        
       int a ;
       int l ;
       int r ;
       cin>>a ;
       cin>>l ;
       cin>>r ; 
       
       vector<int> vect(a , 0 ); 
       
       for(int i = 0 ; i < a ; i++){
           cin>>vect[i] ; 
       }
       l-- ; r-- ; 
      sort(vect.begin() , vect.begin() + l  ) ;     
      sort(vect.begin() + l  , vect.begin() + r + 1 ) ; 
      sort(vect.begin() + r + 1  , vect.end()) ; 
      int sum1 = 0  ; 
       for(int i = l ; i <= r ; i++){
           sum1 += vect[i] ; 
       }     
       int sum2 = sum1 ; 
       int i = r + 1  ; 
      int j = r ; 
       while(i < vect.size() and j >= l) {
           if(vect[i] > vect[j]) break ; 
           sum1 -= vect[j] - vect[i] ; 
           j-- ; i++ ; 
       }
       i = 0 ; 
       j = r ; 
       while( j >= l and i < l  ){
               if(vect[i] > vect[j]) break ; 
           sum2 -= vect[j] - vect[i] ; 
           j-- ; i++ ; 
       }
       cout<<min(sum1 , sum2 )<<endl ; 
    }
} 

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

using namespace std ;
  
int main(){
    int t ; 
    cin>>t ;
    while(t--){
        
       int a ;
       int l ;
       int r ;
       cin>>a ;
       cin>>l ;
       cin>>r ; 
       
       vector<int> vect(a , 0 ); 
       
       for(int i = 0 ; i < a ; i++){
           cin>>vect[i] ; 
       }
       l-- ; r-- ; 
      sort(vect.begin() , vect.begin() + l  ) ;     
      sort(vect.begin() + l  , vect.begin() + r + 1 ) ; 
      sort(vect.begin() + r + 1  , vect.end()) ; 
      long long sum1 = 0  ; 
       for(int i = l ; i <= r ; i++){
           sum1 += vect[i] ; 
       }     
       long long sum2 = sum1 ; 
       int i = r + 1  ; 
      int j = r ; 
       while(i < vect.size() and j >= l) {
           if(vect[i] > vect[j]) break ; 
           sum1 -= vect[j] - vect[i] ; 
           j-- ; i++ ; 
       }
       i = 0 ; 
       j = r ; 
       while( j >= l and i < l  ){
               if(vect[i] > vect[j]) break ; 
           sum2 -= vect[j] - vect[i] ; 
           j-- ; i++ ; 
       }
       cout<<min(sum1 , sum2 )<<endl ; 
    }
}
Problem: 2063B - Subsequence Update
Language: C++17 (GCC 7-32)

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



using namespace std ;

  

int main(){

    int t ; 

    cin>>t ;

    while(t--){

        

       int a ;

       int l ;

       int r ;

       cin>>a ;

       cin>>l ;

       cin>>r ; 

       

       vector<int> vect(a , 0 ); 

       

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

           cin>>vect[i] ; 

       }

       l-- ; r-- ; 

      sort(vect.begin() , vect.begin() + l  ) ;     

      sort(vect.begin() + l  , vect.begin() + r + 1 ) ; 

      sort(vect.begin() + r + 1  , vect.end()) ; 

      int sum1 = 0  ; 

       for(int i = l ; i <= r ; i++){

           sum1 += vect[i] ; 

       }     

       int sum2 = sum1 ; 

       int i = r + 1  ; 

      int j = r ; 

       while(i < vect.size() and j >= l) {

           if(vect[i] > vect[j]) break ; 

           sum1 -= vect[j] - vect[i] ; 

           j-- ; i++ ; 

       }

       i = 0 ; 

       j = r ; 

       while( j >= l and i < l  ){

               if(vect[i] > vect[j]) break ; 

           sum2 -= vect[j] - vect[i] ; 

           j-- ; i++ ; 

       }

       cout<<min(sum1 , sum2 ) ; 

    }

} 

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

using namespace std ;
  
int main(){
    int t ; 
    cin>>t ;
    while(t--){
        
       int a ;
       int l ;
       int r ;
       cin>>a ;
       cin>>l ;
       cin>>r ; 
       
       vector<int> vect(a , 0 ); 
       
       for(int i = 0 ; i < a ; i++){
           cin>>vect[i] ; 
       }
       l-- ; r-- ; 
      sort(vect.begin() , vect.begin() + l  ) ;     
      sort(vect.begin() + l  , vect.begin() + r + 1 ) ; 
      sort(vect.begin() + r + 1  , vect.end()) ; 
      int sum1 = 0  ; 
       for(int i = l ; i <= r ; i++){
           sum1 += vect[i] ; 
       }     
       int sum2 = sum1 ; 
       int i = r + 1  ; 
      int j = r ; 
       while(i < vect.size() and j >= l) {
           if(vect[i] > vect[j]) break ; 
           sum1 -= vect[j] - vect[i] ; 
           j-- ; i++ ; 
       }
       i = 0 ; 
       j = r ; 
       while( j >= l and i < l  ){
               if(vect[i] > vect[j]) break ; 
           sum2 -= vect[j] - vect[i] ; 
           j-- ; i++ ; 
       }
       cout<<min(sum1 , sum2 )<<endl ; 
    }
}
Problem: 2050D - Digital string maximization
Language: C++20 (GCC 13-64)

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

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

using namespace std;

using namespace __gnu_pbds;

#define int long long

typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;

// bool comp(int &a,int&b){

//     if(a>b+1){

//         a--;

//         return a>b;

//     }

// }

signed main(){

int t;

cin>>t;

while(t--){

int n;

cin>>n;

int x=n;

vector<int>a;

if(x==0){

cout<<0<<endl;

}

else{

while(x!=0){

a.push_back(x%10);

x/=10;

}

reverse(a.begin(),a.end());

for(int i=0;i<a.size();i++){

int y=i;

int x=i;

while((a[i]>a[x-1]+1)&&(x>0)){

a[i]--;

//cout<<a[i]<<' '<<a[x-1]<<endl;

swap(a[i],a[x-1]);

x--;

i--;

}

y=i;

}

// for(int i=0;i<)

for(int i=0;i<a.size();i++){

cout<<a[i];

}

cout<<endl;

}

}

}

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

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

using namespace std;

using namespace __gnu_pbds;

#define int long long

typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;

signed main(){

int t;

cin>>t;

while(t--){

string n;

cin>>n;

vector<char>a;

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

a.push_back(n[i]);

}

// for(int i=0;i<a.size();i++){

//     cout<<a[i]<<' ';

// }

// cout<<endl;

// reverse(a.begin(),a.end());

for(int i=0;i<a.size();i++){

int y=i;

int x=i;

while(((a[i])>(a[x-1]+('1'-'0')))&&(x>0)){

a[i]-=('1'-'0');

//cout<<a[i]<<' '<<a[x-1]<<endl;

swap(a[i],a[x-1]);

x--;

i--;

}

y=i;

}

// for(int i=0;i<)

for(int i=0;i<a.size();i++){

cout<<a[i];

}

cout<<endl;

}

}
Problem: 2050D - Digital string maximization
Language: C++20 (GCC 13-64)

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

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

using namespace std;

using namespace __gnu_pbds;

#define int long long

typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;

// bool comp(int &a,int&b){

//     if(a>b+1){

//         a--;

//         return a>b;

//     }

// }

signed main(){

int t;

cin>>t;

while(t--){

int n;

cin>>n;

int x=n;

vector<int>a;

while(x!=0){

a.push_back(x%10);

x/=10;

}

reverse(a.begin(),a.end());

for(int i=0;i<a.size();i++){

int y=i;

int x=i;

while((a[i]>a[x-1]+1)&&(x>0)){

a[i]--;

//cout<<a[i]<<' '<<a[x-1]<<endl;

swap(a[i],a[x-1]);

x--;

i--;

}

y=i;

}

// for(int i=0;i<)

for(int i=0;i<a.size();i++){

cout<<a[i];

}

cout<<endl;

}

}

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

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

using namespace std;

using namespace __gnu_pbds;

#define int long long

typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;

// bool comp(int &a,int&b){

//     if(a>b+1){

//         a--;

//         return a>b;

//     }

// }

signed main(){

int t;

cin>>t;

while(t--){

int n;

cin>>n;

int x=n;

vector<int>a;

if(x==0){

cout<<0<<endl;

}

else{

while(x!=0){

a.push_back(x%10);

x/=10;

}

reverse(a.begin(),a.end());

for(int i=0;i<a.size();i++){

int y=i;

int x=i;

while((a[i]>a[x-1]+1)&&(x>0)){

a[i]--;

//cout<<a[i]<<' '<<a[x-1]<<endl;

swap(a[i],a[x-1]);

x--;

i--;

}

y=i;

}

// for(int i=0;i<)

for(int i=0;i<a.size();i++){

cout<<a[i];

}

cout<<endl;

}

}

}
Problem: 2050D - Digital string maximization
Language: C++20 (GCC 13-64)


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

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

using namespace std;

using namespace __gnu_pbds;

#define int long long

typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;

// bool comp(int &a,int&b){

//     if(a>b+1){

//         a--;

//         return a>b;

//     }

// }

signed main(){

int t;

cin>>t;

while(t--){

int n;

cin>>n;

int x=n;

vector<int>a;

while(x!=0){

a.push_back(x%10);

x/=10;

}

reverse(a.begin(),a.end());

for(int i=0;i<a.size();i++){

int y=i;

int x=i;

while((a[i]>a[x-1]+1)&&(x>0)){

a[i]--;

//cout<<a[i]<<' '<<a[x-1]<<endl;

swap(a[i],a[x-1]);

x--;

i--;

}

y=i;

}

// for(int i=0;i<)

for(int i=0;i<a.size();i++){

cout<<a[i];

}

cout<<endl;

}

}