一本通1050

最新推荐文章于 2023-10-25 16:26:38 发布

aiao5412

最新推荐文章于 2023-10-25 16:26:38 发布

阅读量326

点赞数

原文链接：http://www.cnblogs.com/qf-breeze/p/10667588.html

版权

//qf
#include <bits/stdc++.h>
#define f(i,j,n) for(register int i=j;i<=n;i++)
using namespace std;
typedef long long ll;
inline ll read() {
	ll x=0;
	int f=1;
	char ch=getchar();
	while(!isdigit(ch)) {
		if(ch=='-') f=-1;
		ch=getchar();
	}
	while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch-48),ch=getchar();
	return x*f;
}
signed main() {
	int s=read();
    double bike,walk;
    bike=s/3.0+50,walk=s/1.2;
    if(bike==walk) puts("All");
	else if(bike>walk) puts("Walk");
	else puts("Bike");
	return 0;
}

转载于:https://www.cnblogs.com/qf-breeze/p/10667588.html