http://codeforces.com/problemset/problem/401/C Team

构造法构造一下，分的情况有多种但是不难想到具体还是看代码吧。

#include<iostream>
#include<queue>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
    // m - 2*t = n - t
    // m - n = t
    int n,m;
    cin >> n >> m;
    int t = m - n;
    if(t > n){
        m -= 2 * n;
        if(m <= 2){
            for(int i = 1;i <= n;++i){
                printf("110");
            }
            for(int i = 1;i <= m;++i){
                putchar('1');
            }
        }
        else{
            printf("-1");
        }
    }
    else if(t < 0){
        if(n == m + 1){
            for(int i = 1;i <= m;++i){
                printf("01");
            }
            putchar('0');
        }
        else{
            printf("-1");
        }
    }
    else{
        for(int i = 1;i <= t;++i){
            printf("110");
        }
        n -= t;
        for(int i = 1;i <= n;++i){
            printf("10");
        }
    }
    putchar('\n');
    return 0;
}