Team(模拟)

C. Team
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Now it's time of Olympiads. Vanya and Egor decided to make his own team to take part in a programming Olympiad. They've been best friends ever since primary school and hopefully, that can somehow help them in teamwork.

For each team Olympiad, Vanya takes his play cards with numbers. He takes only the cards containing numbers 1 and 0. The boys are very superstitious. They think that they can do well at the Olympiad if they begin with laying all the cards in a row so that:

  • there wouldn't be a pair of any side-adjacent cards with zeroes in a row;
  • there wouldn't be a group of three consecutive cards containing numbers one.

Today Vanya brought n cards with zeroes and m cards with numbers one. The number of cards was so much that the friends do not know how to put all those cards in the described way. Help them find the required arrangement of the cards or else tell the guys that it is impossible to arrange cards in such a way.

Input

The first line contains two integers: n (1 ≤ n ≤ 106) — the number of cards containing number 0; m (1 ≤ m ≤ 106) — the number of cards containing number 1.

Output

In a single line print the required sequence of zeroes and ones without any spaces. If such sequence is impossible to obtain, print -1.

Sample test(s)
input
1 2
output
101
input
4 8
output
110110110101
input
4 10
output
11011011011011
input
1 5
output
-1

 

    题意:

    给出两个数 A,B (1 ~ 1000000)分别表示 0 和 1 的个数。输出满足条件的序列:1.0不能相连;2.不能连续出现3个1。

 

    思路:

    模拟。分范围讨论即可。

 

    AC:

#include <stdio.h>

int main() {
    int one,zero;
    scanf("%d%d",&zero,&one);
    if(one  < zero - 1 || one > (zero + 1) * 2)
        printf("-1\n");
    else if(one <= zero) {
        for(int i = 1;i <= zero - 1;i++)
            printf("01");
        one == zero ? printf("01\n") : printf("0\n");
    } else if(one > zero && one <= zero * 2) {
        int left = one - zero;
        for(int i = 1;i <= left;i++)
            printf("011");
        for(int i = 1;i <= zero - left;i++)
            printf("01");
        printf("\n");
    } else if(one > zero * 2 && one <= (zero + 1) * 2) {
        one % 2 ? printf("1") : printf("11");
        for(int i = 1;i <= zero;i++)
            printf("011");
        printf("\n");
    }
    return 0;
}

 

 

 

 

 

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值