You are given three integers aa, bb and xx. Your task is to construct a binary string ss of length n=a+bn=a+b such that there are exactly aa zeroes, exactly bb ones and exactly xx indices ii (where 1≤i<n1≤i<n) such that si≠si+1si≠si+1. It is guaranteed that the answer always exists.
For example, for the string "01010" there are four indices ii such that 1≤i<n1≤i<n and si≠si+1si≠si+1 (i=1,2,3,4i=1,2,3,4). For the string "111001" there are two such indices ii (i=3,5i=3,5).
Recall that binary string is a non-empty sequence of characters where each character is either 0 or 1.
The first line of the input contains three integers aa, bb and xx (1≤a,b≤100,1≤x<a+b)1≤a,b≤100,1≤x<a+b).
Print only one string ss, where ss is any binary string satisfying conditions described above. It is guaranteed that the answer always exists.
2 2 1
1100
3 3 3
101100
5 3 6
01010100
All possible answers for the first example:
- 1100;
- 0011.
All possible answers for the second example:
- 110100;
- 101100;
- 110010;
- 100110;
- 011001;
- 001101;
- 010011;
- 001011.
我是
10
101
1010
10101
这种,然后多出来的1和0在开头接着补上就行了
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
string s;
int a,b,x;
cin>>a>>b>>x;
if(a>b){
for(int i=0;i<a-(x/2);i++)
s+='0';
if(b!=0)
for(int i=0;i<b-(x+1)/2+1;i++)
s+='1';
for(int i=1;i<=x-1;i++){
if(i%2)
s+='0';
else s+='1';
}
}
else{
for(int i=0;i<b-(x/2);i++)
s+='1';
if(a!=0)
for(int i=0;i<a-(x+1)/2+1;i++)
s+='0';
for(int i=1;i<=x-1;i++){
if(i%2)
s+='1';
else s+='0';
}
}
cout<<s<<endl<<endl;
}