612A - The Text Splitting - CodeForces Solution


brute force implementation strings *1300

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;

int main()
{
    ll n,p,q;
    cin>>n>>p>>q;
    string s;
    cin>>s;
    ll l,r;
    bool flag = false;
    for(ll i=0;i<=n;i++)
    {
        for(ll j=0;j<=n;j++)
        {
            if((i*p)+(j*q)==n)
            {
                l = i;
                r = j;
                flag = true;
            }
        }
    }
    if(flag)
    {
        cout<<l+r<<endl;
        ll c=0;
        for(ll i = 0;i<l;i++)
        {
            cout<<s.substr(c,p)<<endl;
            c = c+p;
        }
        for(ll i=0;i<r;i++)
        {
            cout<<s.substr(c,q)<<endl;
            c=c+q;
        }
    }
    else
    {
        cout<<"-1"<<endl;
    }
}


Comments

Submit
0 Comments
More Questions

1091A - New Year and the Christmas Ornament
1352B - Same Parity Summands
1102A - Integer Sequence Dividing
630B - Moore's Law
1004A - Sonya and Hotels
1680B - Robots
1690A - Print a Pedestal (Codeforces logo)
1295A - Display The Number
1077A - Frog Jumping
1714G - Path Prefixes
1369C - RationalLee
289B - Polo the Penguin and Matrix
1716A - 2-3 Moves
1670B - Dorms War
1716B - Permutation Chain
987A - Infinity Gauntlet
1676G - White-Black Balanced Subtrees
1716D - Chip Move
1352F - Binary String Reconstruction
1487B - Cat Cycle
1679C - Rooks Defenders
56A - Bar
1694B - Paranoid String
35A - Shell Game
1684A - Digit Minimization
43B - Letter
1017A - The Rank
1698B - Rising Sand
235A - LCM Challenge
1075B - Taxi drivers and Lyft