/* -*- coding: utf-8 -*- * * 2247.cc: No.2247 01 ZigZag - yukicoder */ #include #include using namespace std; /* constant */ const int MAX_N = 100000; const int MAX_M = 100000; const int MAX_L = MAX_N + MAX_M; /* typedef */ /* global variables */ char s[MAX_L + 4]; /* subroutines */ /* main */ int main() { int n, m, k; scanf("%d%d%d", &n, &m, &k); int l = n + m; int cs[2] = {n, m}; if (k == 0) { if (n > 0 && m > 0) { puts("-1"); return 0; } for (int i = 0; i < n; i++) s[i] = '0'; for (int i = 0; i < m; i++) s[i] = '1'; puts(s); return 0; } int d0 = (n >= m) ? 0 : 1; if (k > min(cs[d0], cs[d0 ^ 1] + 1)) { puts("-1"); return 0; } int i = 0, d = d0; while (k > 1) { s[i++] = '0' + d; cs[d]--, k--; d ^= 1; } while (cs[d]--) s[i++] = '0' + d; d ^= 1; while (cs[d]--) s[i++] = '0' + d; puts(s); return 0; }