Picky Eater (Gym-102267A)

Problem Description

Once upon a time, Hamza was hungry, only leftover food could be found in the fridge, so he wanted to order online.

Hamza currently has x JDs, and the sandwich he wants to buy costs y JDs, can Hamza order food online or he has to face his biggest enemies, leftover food?

Input

The first and only line in the input contains exactly 2 space separated integers x,y(1≤x,y≤10), the amount of money he has, and the cost of the sandwich.

Output

If Hamza can buy the sandwich print "1"(on a single line without quotes), otherwise print "0"(on a single line without quotes).

Examples

input

4 2

output

1

input

1 10

output

0

input

5 5

output

1

题意:给出 x、y 两个数,如果 x 大于等于 y 输出 1,否则输出 0

思路:简单模拟

Source Program

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<utility>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#define EPS 1e-9
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define LL long long
#define Pair pair<int,int>
const int MOD = 1E9+7;
const int N = 400+5;
const int dx[] = {1,-1,0,0,-1,-1,1,1};
const int dy[] = {0,0,-1,1,-1,1,-1,1};
using namespace std;

int main(){
    int x,y;
    scanf("%d%d",&x,&y);
    if(x>=y)
        printf("1\n");
    else
        printf("0\n");
    return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值