codeforces C. Team

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

2、题目大意：

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

3、题目：

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 ≤ 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
*/

codeforces C. Team相关推荐

Codeforces 757F: Team Rocket Rises Again（支配树）
Description 2017新年到!Bash小朋友想给他的好友们送礼物.在他的国家里,有 n 座城市和 m 条双向道路(这里保证这 n 座城市是联通的).Bash住在城市 s 中.对于每个城市(包 ...
CodeForces - 1316E Team Building(状压dp)
题目链接:点击查看题目大意:给出 n 个人,现在需要 p 个球员和 k 个啦啦队员,n 个人当啦啦队员以及当第 i 个位置的球员所做的贡献都会给出,现在问如何分配可以使得总贡献和最大题目分析:因为 ...
codeforces 932E Team Work 高等数学求导、dp
题解这是一道纯粹的数学求导题目. 首先我们先写出要求的公式. ans=∑r=1nCnrrkans = \sum_{r=1}^{n} C_n^{r}r^kans=∑r=1nCnrrk 乍一看,雾草 ...
2021/10/14程式培力刷題記錄
刷題記錄 A CodeForces 50A Domino piling #include<bits/stdc++.h> using namespace std; int main() {i ...
【Codeforces】401C Team （01010110...）
http://codeforces.com/contest/401/problem/C 题目中,n表示0的个数,m表示1的个数,要求两个0不能连续,三个1不能连续还要判断能否输出满足要求的序列,不满 ...
codeforces水题100道第十一题 Codeforces Round #143 (Div. 2) A. Team (brute force)
题目链接:http://www.codeforces.com/problemset/problem/231/A 题意:问n道题目当中有多少道题目是至少两个人会的. C++代码: #include &l ...
Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)
A题:一个三角形,一开始在C点,给边长a,b,c问上面走n-1次走多少步. ???为什么会写错??? #include<stdio.h> #include<string.h> ...
【Codeforces gym 102388】SUFE ICPC Team Formation Test，签到题BDG
B Stars /* 题意:求二维平面上(x1,y1),(x2,y2)连成的直线上有多少个整数点思路:以(x1,y1)为原点建立新的坐标系,答案为gcd(|x2-x1|,|y2-y1|)+1 */ ...
Codeforces 107B Basketball Team 简单概率
题目链接:点击打开链接题意: 给定n m h 表示有m个部门,有个人现在在部门h 下面m个数字表示每个部门的人数.(包括他自己) 在这些人中随机挑选n个人,问挑出的人中存在和这个人同部门的概率是多少 ...
Codeforces Round #441 (Div. 1, by Moscow Team Olympiad) C. National Property CF875C
其实就是检查第i 跟 i+1 序列是否合法合法就不理它如果不合法再变一下最后再拓补检查一下构造出的解是否合法 #include <iostream> #include <alg ...

codeforces C. Team

codeforces C. Team相关推荐

最新文章

热门文章