#include<bits/stdc++.h> using namespace std; template<class T> int former(const vector<T> &v, T x) { return upper_bound(v.begin(), v.end(), x) - v.begin() - 1; } template<class T> int latter(const vector<T> &v, T x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); } template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } #define sum(a) ( accumulate ((a).begin(), (a).end(), 0ll)) #define mine(a) (*min_element((a).begin(), (a).end())) #define maxe(a) (*max_element((a).begin(), (a).end())) #define mini(a) ( min_element((a).begin(), (a).end()) - (a).begin()) #define maxi(a) ( max_element((a).begin(), (a).end()) - (a).begin()) #define lowb(a, x) ( lower_bound((a).begin(), (a).end(), (x)) - (a).begin()) #define uppb(a, x) ( upper_bound((a).begin(), (a).end(), (x)) - (a).begin()) int power(int x, int y){int temp;if( y == 0)return 1; temp = power(x, y / 2);if (y % 2 == 0) return temp * temp;else return x * temp * temp;} int log2n( int n){ return (n > 1) ? 1 + log2n(n / 2) : 0;} typedef long long ll; typedef long double ld; typedef unsigned long long ull; typedef tuple<int,int,int> T; #define gcd(a,b) __gcd((a),(b)) #define lcmll(a,b) a*((b)/gcd((a),(b))) #define lcm(a,b) ((a)*(b))/gcd((a),(b)) ll inf=1e18+42; const double eps = 1e-8; #define M_PI 3.14159265358979323846 const int M = 1e9+7; const int MN = 1e9; ll dp[31][31]; string solve(ll i, ll j, ll k){ if(i==0) {string s1(j,'b'); return s1;} if(j==0) {string s2(i,'a'); return s2;} if(dp[i-1][j] >= k) {cout<<"a"<<' ';cout << i-1 << ' '<<j<<' '<<k<<endl;return "a" + solve(i-1, j, k);} else {cout<<"b"<<' ';cout<<i<<' '<<j-1<<' '<<k-dp[i-1][j]<<endl;return "b" + solve(i, j-1, k-dp[i-1][j]);} } int main() { ///freopen("input.txt", "r", stdin); ///freopen("output.txt", "w", stdout); ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << fixed << setprecision(10); ll a, b, k; cin >> a >> b >> k; for(ll i=0; i<31; ++i) dp[i][0] = 1, dp[0][i] = 1; for(ll i=0; i<a; ++i){ for(ll j=0; j<b; ++j) dp[i+1][j+1] = dp[i+1][j] + dp[i][j+1]; } cout << "DP " << endl; for(ll i=0; i<a; ++i){ for(ll j=0; j<b; ++j) cout << dp[i][j] << ' '; cout << endl; } cout << solve(a, b, k) << endl; return 0; }
Write, Run & Share C++ code online using OneCompiler's C++ online compiler for free. It's one of the robust, feature-rich online compilers for C++ language, running on the latest version 17. Getting started with the OneCompiler's C++ compiler is simple and pretty fast. The editor shows sample boilerplate code when you choose language as C++
and start coding!
OneCompiler's C++ online compiler supports stdin and users can give inputs to programs using the STDIN textbox under the I/O tab. Following is a sample program which takes name as input and print your name with hello.
#include <iostream>
#include <string>
using namespace std;
int main()
{
string name;
cout << "Enter name:";
getline (cin, name);
cout << "Hello " << name;
return 0;
}
C++ is a widely used middle-level programming language.
When ever you want to perform a set of operations based on a condition If-Else is used.
if(conditional-expression) {
//code
}
else {
//code
}
You can also use if-else for nested Ifs and If-Else-If ladder when multiple conditions are to be performed on a single variable.
Switch is an alternative to If-Else-If ladder.
switch(conditional-expression){
case value1:
// code
break; // optional
case value2:
// code
break; // optional
......
default:
code to be executed when all the above cases are not matched;
}
For loop is used to iterate a set of statements based on a condition.
for(Initialization; Condition; Increment/decrement){
//code
}
While is also used to iterate a set of statements based on a condition. Usually while is preferred when number of iterations are not known in advance.
while (condition) {
// code
}
Do-while is also used to iterate a set of statements based on a condition. It is mostly used when you need to execute the statements atleast once.
do {
// code
} while (condition);
Function is a sub-routine which contains set of statements. Usually functions are written when multiple calls are required to same set of statements which increases re-usuability and modularity. Function gets run only when it is called.
return_type function_name(parameters);
function_name (parameters)
return_type function_name(parameters) {
// code
}