hihoCoder Challenge 10 register

Ended

Participants:522

Verdict:Accepted
Submitted:2015-04-12 19:05:06

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<iostream>
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const int MOD = 1000000007;
const int N = 100005;
const double pi = acos(-1.0);
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        if(m>n+1)puts("NO");
        else if(m==n+1)
        {
            for(int i=0;i<n;i++)
            {
                printf("10");
            }
            puts("1");
        }
        else
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX