B. Binary String Constructing
time limit per test1 second
memory limit per test256 megabytes
You are given three integers a, b and x. Your task is to construct a binary string s of length n=a+b such that there are exactly a zeroes, exactly b ones and exactly x indices i (where 1≤i For example, for the string “01010” there are four indices i such that 1≤i Recall that binary string is a non-empty sequence of characters where each character is either 0 or 1. Input Output Examples 问题链接:CodeForces - 1003B Binary String Constructing
The first line of the input contains three integers a, b and x (1≤a,b≤100,1≤x
Print only one string s, where s is any binary string satisfying conditions described above. It is guaranteed that the answer always exists.
input
2 2 1
output
1100
input
3 3 3
output
101100
input
5 3 6
output
01010100
Note
All possible answers for the first example:
1100;
0011.
All possible answers for the second example:
110100;
101100;
110010;
100110;
011001;
001101;
010011;
001011.
问题简述:(略)
问题分析:(略)
AC的C++语言程序如下:
#include



