Codeforces Round #494 (Div. 3) B. Binary String Constructing

B. Binary String Constructing
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given three integers aabb 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 1i<n1≤i<n) such that sisi+1si≠si+1. It is guaranteed that the answer always exists.

For example, for the string "01010" there are four indices ii such that 1i<n1≤i<n and sisi+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.

Input

The first line of the input contains three integers aabb and xx (1a,b100,1x<a+b)1≤a,b≤100,1≤x<a+b).

Output

Print only one string ss, where ss is any binary string satisfying conditions described above. It is guaranteed that the answer always exists.

Examples
input
Copy
2 2 1
output
Copy
1100
input
Copy
3 3 3
output
Copy
101100
input
Copy
5 3 6
output
Copy
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.

这个主要看个人的构造方法吧
我是
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;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值