ShaysXIA/CodeInsightBench huggingface dataset:
Problem: 2057B - Gorilla and the Exam
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 2):
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
    int t; // number of test cases
    cin >> t;
    while (t--) {
        int n, k;
        cin>>n>>k;
        vector<int> a(n);
        map<int , int> n2r; 
        for(int i = 0; i<n; i++){
            cin>>a[i];
            n2r[a[i]] += 1;
        }
        vector<int> f;
        for(auto pr : n2r){
            f.push_back(pr.second);
        }
        sort(f.begin(), f.end(), greater<int>());
        int ans = 0;
        if(k == 0){
            cout<<n2r.size()<<endl;
        }
        else if(k == n){
            cout<<1<<endl;
        }
        else{
            if((n - f[0]) %k !=0){
                ans = ((n - f[0])/k)  + 1;
            }
            else{
                ans = (n - f[0])/k;
            }
            

            cout<<ans<<endl;
        }
        
    }
    return 0;
}

Submission (verdict: Wrong answer on test 2):
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
    int t; // number of test cases
    cin >> t;
    while (t--) {
        int n, k;
        cin>>n>>k;
        vector<int> a(n);
        map<int , int> n2r; 
        for(int i = 0; i<n; i++){
            cin>>a[i];
            n2r[a[i]] += 1;
        }
        vector<int> f;
        for(auto pr : n2r){
            f.push_back(pr.second);
        }
        sort(f.begin(), f.end(), greater<int>());
        int ans = 0;
        if(k == 0){
            cout<<n2r.size()<<endl;
        }
        else if(k == n || n - f[0] == 0){
            cout<<1<<endl;
        }
        else{
            if((n - f[0]) %k !=0){
                ans = ((n - f[0])/k)  + 1;
            }
            else{
                ans = (n - f[0])/k;
            }
            

            cout<<ans<<endl;
        }
        
    }
    return 0;
}
Problem: 2057B - Gorilla and the Exam
Language: C++17 (GCC 7-32)


Submission (verdict: Wrong answer on test 2):
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
    int t; // number of test cases
    cin >> t;
    while (t--) {
        int n, k;
        cin>>n>>k;
        vector<int> a(n);
        map<int , int> n2r; 
        for(int i = 0; i<n; i++){
            cin>>a[i];
            n2r[a[i]] += 1;
        }
        vector<int> f;
        for(auto pr : n2r){
            f.push_back(pr.second);
        }
        sort(f.begin(), f.end(), greater<int>());
        int ans = 0;
        if(k == 0){
            cout<<n2r.size()<<endl;
        }
        else if(k == n){
            cout<<1<<endl;
        }
        else{
            if((n - f[0]) %k !=0){
                ans = ((n - f[0])/k)  + 1;
            }
            else{
                ans = (n - f[0])/k;
            }
            

            cout<<ans<<endl;
        }
        
    }
    return 0;
}
Problem: 2057B - Gorilla and the Exam
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 2):
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
    int t; // number of test cases
    cin >> t;
    while (t--) {
        int n, k;
        cin>>n>>k;
        vector<int> a(n);
        map<int , int> n2r; 
        for(int i = 0; i<n; i++){
            cin>>a[i];
            n2r[a[i]] += 1;
        }
        vector<int> f;
        for(auto pr : n2r){
            f.push_back(pr.second);
        }
        sort(f.begin(), f.end(), greater<int>());
        int ans = 0;
        if(k == 0){
            cout<<n2r.size()<<endl;
        }
        else if(k == n || n - f[0] == 0){
            cout<<1<<endl;
        }
        else{
            if((n - f[0]) %k !=0){
                ans = ((n - f[0])/k)  + 1;
            }
            else{
                ans = (n - f[0])/k;
            }
            

            cout<<ans<<endl;
        }
        
    }
    return 0;
}

Submission (verdict: Accepted):
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
    int t; // number of test cases
    cin >> t;
    while (t--) {
        int n, k;
        cin>>n>>k;
        vector<int> a(n);
        
        for(int i = 0; i<n; i++){
            cin>>a[i];           
        }
        sort(a.begin(), a.end());
        vector<int> fq;
        fq.push_back(1);
        for(int i = 1; i<n; i++){
            if(a[i] == a[i-1]){
                fq.back()++;
            }
            else{
                fq.push_back(1);
            }
        }
        sort(fq.begin(), fq.end());
        int s = fq.size();
        bool done = false;
        int tk = k;
        for(int i = 0; i<s-1; i++){
            
            if(fq[i] > k){
                cout<<s-i<<endl;
                done = true;
                break;
            }
            k -= fq[i];
        }
        if(!done){
            cout<<1<<endl;
        }
        
        
        
        
    }
    return 0;
}
Problem: 2062C - Cirno and Operations
Language: C++23 (GCC 14-64, msys2)


Submission (verdict: Wrong answer on test 1):
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef map<int,int> mii;
typedef unordered_set<int> usi;
typedef set<int> si; 
#define Pb push_back
#define Mp make_pair
#define FOR(i,a,b) for(int i = a ; i<b ; i++)



void solve(){
    int n;cin>>n;
    vector<int> arr(n);
    int sum = 0;
    FOR(i,0,n){
        cin>>arr[i];
        sum+=arr[i];
    }
    FOR(i,0,n)
    {
        int nsum = 0;
        FOR(j,0,n-1)
        {
            arr[j] = arr[j+1] - arr[j];
            nsum+=arr[j];
        }
        if(abs(nsum)>sum){
            sum = abs(nsum);
        }
    }
    cout<<sum<<endl;
}


int main(){
    ios :: sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin>>t;
    while(t--){
        solve();
    }
}
Problem: 2062C - Cirno and Operations
Language: C++23 (GCC 14-64, msys2)

Previous submission (verdict: Wrong answer on test 2):
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef map<int,int> mii;
typedef unordered_set<int> usi;
typedef set<int> si; 
#define Pb push_back
#define Mp make_pair
#define FOR(i,a,b) for(int i = a ; i<b ; i++)



void solve(){
    int n;cin>>n;
    vector<int> arr(n);
    int sum = 0;
    FOR(i,0,n){
        cin>>arr[i];
        sum+=arr[i];
    }
    FOR(i,1,n)
    {
        int nsum = 0;
        int prevbefore = arr[i-1];
        int prev = arr[i-1];
        FOR(j,i,n)
        {
            prevbefore = arr[j];
            arr[j] = arr[j] - prev;
            prev = prevbefore;
            nsum+=arr[j];
        }
        if(abs(nsum)>sum){
            sum = abs(nsum);
            // cout<<i<<". "<<nsum<<endl;
        }
        // cout<<i<<". "<<nsum<<endl;
    }
    cout<<sum<<endl;
}


int main(){
    ios :: sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin>>t;
    while(t--){
        solve();
    }
}

Submission (verdict: Accepted):
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef map<int,int> mii;
typedef unordered_set<int> usi;
typedef set<int> si; 
#define Pb push_back
#define Mp make_pair
#define FOR(i,a,b) for(int i = a ; i<b ; i++)
#define int long long


void solve(){
    int n;cin>>n;
    vector<int> arr(n);
    int sum = 0;
    FOR(i,0,n){
        cin>>arr[i];
        sum+=arr[i];
    }
    FOR(i,1,n)
    {
        int nsum = 0;
        int prevbefore = arr[i-1];
        int prev = arr[i-1];
        FOR(j,i,n)
        {
            prevbefore = arr[j];
            arr[j] = arr[j] - prev;
            prev = prevbefore;
            nsum+=arr[j];
        }
        if(abs(nsum)>sum){
            sum = abs(nsum);
            // cout<<i<<". "<<nsum<<endl;
        }
        // cout<<i<<". "<<nsum<<endl;
    }
    cout<<sum<<endl;
}


signed main(){
    ios :: sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin>>t;
    while(t--){
        solve();
    }
}
Problem: 2062C - Cirno and Operations
Language: C++23 (GCC 14-64, msys2)

Previous submission (verdict: Wrong answer on test 1):
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef map<int,int> mii;
typedef unordered_set<int> usi;
typedef set<int> si; 
#define Pb push_back
#define Mp make_pair
#define FOR(i,a,b) for(int i = a ; i<b ; i++)



void solve(){
    int n;cin>>n;
    vector<int> arr(n);
    int sum = 0;
    FOR(i,0,n){
        cin>>arr[i];
        sum+=arr[i];
    }
    FOR(i,0,n)
    {
        int nsum = 0;
        FOR(j,0,n-1)
        {
            arr[j] = arr[j+1] - arr[j];
            nsum+=arr[j];
        }
        if(abs(nsum)>sum){
            sum = abs(nsum);
        }
    }
    cout<<sum<<endl;
}


int main(){
    ios :: sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin>>t;
    while(t--){
        solve();
    }
}

Submission (verdict: Wrong answer on test 2):
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef map<int,int> mii;
typedef unordered_set<int> usi;
typedef set<int> si; 
#define Pb push_back
#define Mp make_pair
#define FOR(i,a,b) for(int i = a ; i<b ; i++)



void solve(){
    int n;cin>>n;
    vector<int> arr(n);
    int sum = 0;
    FOR(i,0,n){
        cin>>arr[i];
        sum+=arr[i];
    }
    FOR(i,1,n)
    {
        int nsum = 0;
        int prevbefore = arr[i-1];
        int prev = arr[i-1];
        FOR(j,i,n)
        {
            prevbefore = arr[j];
            arr[j] = arr[j] - prev;
            prev = prevbefore;
            nsum+=arr[j];
        }
        if(abs(nsum)>sum){
            sum = abs(nsum);
            // cout<<i<<". "<<nsum<<endl;
        }
        // cout<<i<<". "<<nsum<<endl;
    }
    cout<<sum<<endl;
}


int main(){
    ios :: sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin>>t;
    while(t--){
        solve();
    }
}
Problem: 2049B - pspspsps
Language: C++17 (GCC 7-32)


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

using namespace std;

#define ll long long

#define lc(t) ll t; cin >> t;

#define f(i,a,n) for (ll i=a; i<n; i++)

#define sp cout << " ";

#define nl cout << "\n";

#define fmc(i,n,a) ll a[n]; for (ll i=0; i<n; i++) cin >> a[i]

#define fout(i,n,a) for (ll i=0; i<n; i++) cout << a[i] << " "

#define pb push_back

#define all(x) x.begin(), x.end()

#define all(x,a) x, x+a

#define sz(x) (ll)x.size()

#define vi vector<int>

#define vll vector<ll>

#define F first

#define S second

#define endl "\n"

#define mod 1000000007

#define inf 1000000000000000000

#define pi 3.141592653589793238462643383279502884197169399

#define krish ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)

#define ld long double

 

bool isprime (ll n)

{

    if (n<=1) return false;

    if(n==2 || n==3) return true;

    if(n%2==0 || n%3==0) return false;

    for (ll i=5; i<=sqrt(n); i+=6)  if (n%i==0 || n%(i+2)==0) return false;

    return true;

}



bool s(ll a, ll b)

{

    return a>b;

}

 

void fun()

{

    lc(n);

    string a;

    cin >> a;

    f(i,0,n-1)

    {

        if ( a[i]=='p' && a[i+1]=='s' )

        {

            cout << "NO\n";

            return;

        }

    }

    f(i,1,n-2)

    {

        if ( a[i]=='s' && a[i+1]=='p' )

        {

            cout << "NO\n";

            return;

        }

    }

    cout << "YES\n";

    return;

}

 

int main()

{

    krish;

    lc(t);

    // ll t = 1;

    while (t--) fun();

    return 0;

}
Problem: 2049C - MEX Cycle
Language: C++17 (GCC 7-32)


Submission (verdict: Time limit exceeded on test 2):
#include <bits/stdc++.h>

using namespace std;

#define ll long long

#define lc(t) ll t; cin >> t;

#define f(i,a,n) for (ll i=a; i<n; i++)

#define sp cout << " ";

#define nl cout << "\n";

#define fmc(i,n,a) ll a[n]; for (ll i=0; i<n; i++) cin >> a[i]

#define fout(i,n,a) for (ll i=0; i<n; i++) cout << a[i] << " "

#define pb push_back

#define all(x) x.begin(), x.end()

#define sz(x) (ll)x.size()

#define vi vector<int>

#define vll vector<ll>

#define F first

#define S second

#define endl "\n"

#define mod 1000000007

#define inf 1000000000000000000

#define pi 3.141592653589793238462643383279502884197169399

#define krish ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)

#define ld long double

 

bool isprime (ll n)

{

    if (n<=1) return false;

    if(n==2 || n==3) return true;

    if(n%2==0 || n%3==0) return false;

    for (ll i=5; i<=sqrt(n); i+=6)  if (n%i==0 || n%(i+2)==0) return false;

    return true;

}



bool s(pair <string,ll> a, pair <string,ll> b)

{

    return a.second>b.second;

}

 

void fun()

{

    lc(n);

    lc(x);

    lc(y);

    vll a(n,0);

    x--, y--;

    if ( n%2==0 )

    {

        for (ll i=0; i<n; i+=2) a[i] = 1;

        if ( a[x]==0 && a[y]==0 ) a[x] = 2;

        else if ( a[x]==1 && a[y]==1 ) a[x] = 2;

        fout(i,n,a);

        cout << endl;

        return;

    }

    else

    {

        for (ll i=0; i<n-2; i+=2) a[i] = 1;

        a[n-1] = 2;

        if ( a[x]==0 && a[y]==0 )

        {

            a[y] = 2;

            if ( a[y+1]==2 ) a[y+2] = 0;

        }

        else if ( a[x]==1 && a[y]==1 ) a[y] = 2;

        fout(i,n,a);

        cout << endl;

        return;

    }

    return;

}

 

int main()

{

    krish;

    lc(t);

    // ll t = 1;

    while (t--) fun();

    return 0;

}
Problem: 2061D - Kevin and Numbers
Language: C++17 (GCC 7-32)


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

using namespace std;

#define py cout << "YES" << endl

#define pn cout << "NO" << endl

#define aans             \

    cout << ans << endl; \

    return;

#define pneg cout << "-1" << endl

#define prDouble(x, y) cout << fixed << setprecision(y) << x

#define bitcount(x) __builtin_popcount(x)

#define ll long long

#define ld long double

#define pb push_back

#define ppb pop_back

#define mp make_pair

#define eb emplace_back

#define forw(i, j, n) for (ll i = j; i < n; i++)

#define all(x) x.begin(), x.end()

#define fastfast()                    \

    ios_base::sync_with_stdio(false); \

    cin.tie(NULL);                    \

    cout.tie(NULL)

#define sz(x) ((int)(x).size())

#define input(arr, i, n) rep(j, i, n) cin >> arr[j];



typedef pair<int, int> pii;

typedef vector<int> vi;

typedef vector<ll> vll;

typedef vector<ld> vld;

typedef vector<double> vd;

typedef vector<bool> vb;

typedef vector<string> vs;

typedef pair<ll, ll> pll;

typedef vector<vector<ll>> vvll;

typedef vector<vector<ld>> vvld;

typedef vector<pll> vpll;

#define mii map<int, int>

#define mll map<ll, ll>





ll gcd(ll a, ll b)

{

    if (b == 0)

        return a;

    else

        return gcd(b, a % b);

}



ll findLCM(ll a, ll b, ll c)

{

    ll GCD = gcd(a, b);

    ll lcm = (a * b) / GCD;

    GCD = gcd(lcm, c);

    lcm = (lcm * c) / GCD;

    return lcm;

}





pair<vll, vll> sol(vll &a, vll &b)

{

    ll i = 0, j = 0;

    ll n = a.size(), m = b.size();

    vll a1, b1;

    sort(all(a));

    sort(all(b));

    while (i < n && j < m)

    {

        while (i < n && a[i] < b[j])

            a1.pb(a[i++]);

        while (i < n && j < m && a[i] == b[j])

            i++, j++;

        while (i < n && j < m && b[j] < a[i])

            b1.pb(b[j++]);

    }

    while (i < n) a1.pb(a[i++]);

    while (j < m) b1.pb(b[j++]);

    return {a1, b1};

}





vll divid(vll &v)

{

    vll a;

    for (ll x : v)

    {

        a.pb(x / 2);

        a.pb((x + 1) / 2);

    }

    sort(all(a));

    return a;

}



// Core logic

void solve()

{

    ll n, m;

    cin >> n >> m;

    vll a(n), b(m);



    for (ll i = 0; i < n; i++)

        cin >> a[i];

    for (ll i = 0; i < m; i++)

        cin >> b[i];



    sort(all(a));

    sort(all(b));



    vll ne=divid(a);

    for(auto it:ne)cout<<it<<" ";cout<<endl;return;

    vll a1, b1;

    tie(a1, b1) = sol(a, b);



    if (b1.size() > a1.size())

    {

        pn;

        return;

    }

    else if(a1==b1){

        py;return;

    }

    for (ll i = 0; i < 32; i++)

    {

        b1 = divid(b1);

        tie(a1, b1) = sol(a1, b1);

        if (a1 == b1)

        {

            py;

            return;

        }

    }



    pn;

}



// Entry point

int main()

{

    fastfast();

    int t;

    cin >> t;

    while (t--)

    {

        solve();

    }

    return 0;

}
Problem: 2063C - Remove Exactly Two
Language: C++20 (GCC 13-64)


Submission (verdict: Wrong answer on test 1):
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<numeric>
using namespace std;
typedef long long int ll;
#define mod 1000000007
#define int long long 
#define endl "\n"
#define ff  first
#define ss second
#define f(i,a,b) for(int i(a);i<b;i++)
#define rep(i,n) for(int i(0);i<n;i++)
#define fast  ios_base::sync_with_stdio(0); cin.tie(0);
#define pb push_back
#define vi vector<int>
#define vvi vector<vector<int> >
#define vpi vector<pair<int,int> >
#define pi pair<int,int>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define mp make_pair
#define mt make_tuple
#define pq priority_queue
#define pqv priority_queue<int, vector<int>, greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define inf 1e18
#define ninf -1e18
#define PI 3.1415926535897932384626433832795
#define EPS 1e-9
#define mod 1000000007
#define mod1 1000000009
#define mod2 998244353
#define mod3 1000000007
#define mod4 1000000009
#define mod5 1000000021
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//typedef __gnu_pbds::tree<int, __gnu_pbds::null_type, less<int>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update> ordered_set;

signed main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        vector<vector<int>> adj(n+1);
        vector<int> degree(n+1,0);
        multiset<int> ms;
        for(int i=1;i<n;i++)
        {
            int u,v;
            cin>>u>>v;
            adj[u].push_back(v);
            adj[v].push_back(u);
            degree[u]++;
            degree[v]++;
        }
        for(int i=1;i<=n;i++)
        {
            ms.insert(degree[i]);
        }
        int maxi=INT_MIN;
        for(int i=1;i<=n;i++)
        {
            int curr=0;
            int curr_node=i;
            ms.extract(degree[i]);
            for(auto neigh:adj[curr_node])
            {
                ms.extract(degree[neigh]);
                degree[neigh]--;
                ms.insert(degree[neigh]);
            }
            int temp= degree[curr_node]+(*ms.rbegin());
            maxi=max(maxi,temp);
            for(auto neigh:adj[curr_node])
            {
                ms.extract(degree[neigh]);
                degree[neigh]++;
                ms.insert(degree[neigh]);
            }
        }
        cout<<maxi+1<<endl;
    }
    return 0;
}
Problem: 2057C - Trip to the Olympiad
Language: C++20 (GCC 13-64)


Submission (verdict: Wrong answer on test 1):
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
#include <unordered_map>

using namespace std;
typedef int ll;

int main(){
    ll t;
    cin >> t;
    
    while(t--){
        ll l, r;
        cin >> l >> r;
        
        ll a, b, c;
        
        for(ll i = 30; i >= 0; i--){
            if((l >> i) % 2 == (r >> i) % 2)
                continue;
            
            b = (1ll << i);
            a = b - 1;
            c = 0;
            
            if(a - 1 >= l)
                c = a - 1;
            else
                c = b + 1;
            
            break;
        }
        
        cout << a << ' ' << b << ' ' << c << endl;
    }
    
    return 0;
}
Problem: 2057C - Trip to the Olympiad
Language: C++20 (GCC 13-64)

Previous submission (verdict: Wrong answer on test 1):
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
#include <unordered_map>

using namespace std;
typedef int ll;

int main(){
    ll t;
    cin >> t;
    
    while(t--){
        ll l, r;
        cin >> l >> r;
        
        ll a, b, c;
        
        for(ll i = 30; i >= 0; i--){
            if((l >> i) % 2 == (r >> i) % 2)
                continue;
            
            b = (1ll << i);
            a = b - 1;
            c = 0;
            
            if(a - 1 >= l)
                c = a - 1;
            else
                c = b + 1;
            
            break;
        }
        
        cout << a << ' ' << b << ' ' << c << endl;
    }
    
    return 0;
}


Submission (verdict: Wrong answer on test 2):
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
#include <unordered_map>

using namespace std;
typedef int ll;

int main(){
    ll t;
    cin >> t;
    
    while(t--){
        ll l, r;
        cin >> l >> r;
        
        ll a, b, c;
        ll still = 0;
        
        for(ll i = 30; i >= 0; i--){
            if((l >> i) % 2 == (r >> i) % 2){
                still += (1ll << i) * ((l >> i) & 1);
                continue;
            }
            
            b = (1ll << i);
            a = b - 1;
            c = 0;
            
            if(a - 1 >= l)
                c = a - 1;
            else
                c = b + 1;
            
            break;
        }
        
        cout << a + still << ' ' << b + still << ' ' << c + still << endl;
    }
    
    return 0;
}