题解 | 01串题

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+9;
const int mod = 1e9+9;
using ll = long long;
const char el = '\n';
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
int arr[N];
int main()
{
    IOS;
    int a,b,x;cin>>a>>b>>x;
    if(a+b<x) return cout<<-1<<el,0;
       a-=x/2,b-=x/2;
    if(a%2!=0||b%2!=0) return cout<<-1<<el,0;
    for(int i = 0;i<x/2;i++) cout<<"01";
    for(int i = 0;i<a/2;i++) cout<<"00";
    for(int i = 0;i<b/2;i++) cout<<"11";

}