B - Binary String Constructing

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 1i<n) such that sisi+1

. It is guaranteed that the answer always exists.

For example, for the string "01010" there are four indices i

such that 1i<n and sisi+1 ( i=1,2,3,4). For the string " 111001" there are two such indices i ( i=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 a

, b and x ( 1a,b100,1x<a+b)

.

Output

Print only one string s

, where s

is any binary string satisfying conditions described above. It is guaranteed that the answer always exists.

Examples
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代码(分情况讨论)

#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int a, b, x, i, n;
    while(scanf("%d %d %d",&a, &b, &x)!=EOF)
    {
      n = x;
      if(x%2==0)
      {
       n = n/2;
       if(a>=b)
       {
        for(i = 0;i<n-1;i++)
        {
         printf("01");
         a--;
         b--;
        }
        printf("0");
        a--;
        for(i = 0;i<b;i++)
        printf("1");
        for(i = 0;i<a;i++)
        printf("0");
        printf("\n");
       }
       else
       {
        for(i = 0;i<n-1;i++)
        {
         printf("10");
         a--;
         b--;
        }
        printf("1");
        b--;
        for(i = 0;i<a;i++)
        printf("0");
        for(i = 0;i<b;i++)
        printf("1");
        printf("\n");
       }
      }
      else
      {
       n = n/2;
       if(a>=b)
       {
        for(i = 0;i<n;i++)
        {
         printf("01");
         a--;
         b--;
        }
        for(i = 0;i<a;i++)
        printf("0");
        for(i = 0;i<b;i++)
        printf("1");
        printf("\n");
       }
       else
       {
        for(i = 0;i<n;i++)
        {
         printf("10");
         a--;
         b--;
        }
        for(i = 0;i<b;i++)
        {
         printf("1");
        }
        for(i = 0;i<a;i++)
        printf("0");
        printf("\n");
       }
      }
    }
    return 0;
}

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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值