codeforces C. Team

最新推荐文章于 2021-11-12 14:07:12 发布

sdjzping

最新推荐文章于 2021-11-12 14:07:12 发布

阅读量1.2k

点赞数

分类专栏：竞赛

本文链接：https://blog.csdn.net/sdjzping/article/details/20970627

版权

竞赛专栏收录该内容

71 篇文章 0 订阅

订阅专栏

1、http://codeforces.com/contest/401/problem/C

2、题目大意：

给出n个0，m个1，将其组成一串，最终输出的串要求不能两个0挨着，不能三个1挨着，找情况模拟输出即可

3、题目：

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 ≤ 10⁶) — the number of cards containing number 0; m (1 ≤ m ≤ 10⁶) — 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

Input

4 8

Output

110110110101

Input

4 10

Output

11011011011011

Input

1 5

Output

-1

3、AC代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        if(m<n-1 || m>(n+1)*2)
            printf("-1\n");
        else
        {
            int ans=m-(n-1);
            if(ans-2>=0)
            {
                printf("11");
                ans-=2;
            }
            else if(ans>=1)
            {
                printf("1");
                ans-=1;
            }
            for(int i=1; i<=n; i++)
            {
                printf("0");
                if(ans>0 && i!=n)
                {
                    printf("11");
                    ans--;
                }
                else if(ans==0 && i!=n)
                {
                    printf("1");
                }
                else if(i==n && ans>0)
                {
                    for(int j=1;j<=ans;j++)
                    printf("1");
                }
            }
            printf("\n");
        }
    }
    return 0;
}
/*
2 1
*/