C. Adidas vs Adivon
C. Adidas vs Adivon
cid=5202#" class="submitprob button ui-button ui-widget ui-state-default ui-corner-all ui-button-text-only" style="margin:0px 0.1em 0px -1px; padding:0px; text-decoration:none; font-family:'Trebuchet MS',Helvetica,Arial,sans-serif; font-size:1.1em; border:1px solid rgb(204,204,204); background-color:rgb(238,238,238); font-weight:bold; color:rgb(68,68,68); display:inline-block; position:relative; zoom:1; overflow:visible">Submit
Status PID:29378
+
-
“我们坐在高高的土堆上面。听妈妈讲阿迪王的事情。我出生在一个不太普通的家庭,妈妈会预知术。在我小的时候,妈妈就常跟我说:‘在未来的世界。有一种叫阿迪王的东西成为比石油、黄金还重要的东西……’那时,我痴痴地听着。一听就到半夜,听到入迷。任由鼻涕流到自己的嘴里。长大后,我最终知道阿迪王是什么东西。它是对于亿万人来说比自身生命还重要的神物……”
就我所知,一双普通的阿迪王人造革鞋的日常维护费就非常惊人了,有些亿万富翁购买了阿迪王的产品后由于不堪负担产品的日常维护费用而宣布个人破产。
“I'm coming!!!”
可是,Adidas这个从来没有听过的牌子竟然告Adivon商标侵权了!
。这是Adivon粉丝们不能容忍的!!!所以在一个夜黑风高的晚上,一位高贵的Adivon粉丝与还有一位Adidas屌丝约战于华山之巅。作为21世纪的新青年,他们选择了智力对抗,来一局博弈定胜负。
他们拿出了一张长和宽都是正整数的纸片,每次,当前一方能够选择将纸片水平或竖直撕成相等的两半(平行于长边或宽边)。扔掉一半。可是要求撕完后剩下的那部分纸片长和宽依然是正整数。直到有一方不能再撕,该方即输掉这场博弈。
Adivon的粉丝那是相当大度的。所以每次都是Adidas屌丝先手。
Input
第一行一个整数N(2<=N<=2000),表示他们进行了多少局博弈。
接下来N行,每行两个正整数L和H(1<=L,H<=1000000)。表示该局纸片的初始长宽。
Output
对于每一局游戏,输出一行。假设Adivon粉丝胜利则输出"Adivon prevails"。否则Adivon粉丝将发动神技。改变游戏结局,此种情况输出"Adidas loses".
Sample Input
2
1 2
2 2
Sample Output
Adidas loses
Adivon prevails
#include<stdio.h>
int main()
{
int n,a,b,k;
scanf("%d",&n);
while(n--)
{
scanf("%d%d",&a,&b);
k=0;
while(a%2==0)
{
k++; a/=2;
}
while(b%2==0)
{
k++; b/=2;
}
if(k%2==0)printf("Adivon prevails\n");
else printf("Adidas loses\n");
}
}
版权声明:本文博客原创文章,博客,未经同意,不得转载。
C. Adidas vs Adivon的更多相关文章
- bnu 29378 Adidas vs Adivon 基础题
Adidas vs Adivon Time Limit: 1000ms Memory Limit: 65536KB 64-bit integer IO format: %lld Java ...
- Which adidas NMD Singapore is your favorite
The adidas NMD Singapore just keeps the hits coming this fall with another change that's sure to bec ...
- The adidas NMD Singapore is one of the brands top selling
Like pointed out, we've two adidas NMD Singapore releases using the first arriving Blue and Black as ...
- The adidas NMD Camo Singapore consists of four colorways
Next within the popular selection of the adidas NMD Singapore is really a clean all-black form of th ...
- The same month as the adidas NMD Singapore is releasing
Earlier this December 2017, the inaugural adidas NMD Singapore silhouette released in the first colo ...
- Check out our list of adidas NMD Singapore retailers
The adidas NMD Singapore is confirmed to produce on The month of january 14th at select adidas Origi ...
- What do you think the coming adidas NMD Singapore
adidas NMD Singapore is surprising everybody with a lot of completely new NMD choices combined with ...
- Singapore retailer will release this adidas NMD R1
Select spots are restocking the adidas NMD Singapore this Friday, Feb 24th featuring three different ...
- Know that more adidas NMD Singapore colorways are coming
The adidas NMD Singapore continues to be the right silhouette for summer time because of a mix of a ...
随机推荐
- java 返回图片到页面
@RequestMapping(value = "/image/get") public void getImage(HttpServletRequest request, ...
- Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)
Crazy Bobo Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others) Tota ...
- 【42.38%】【BZOJ 3196】二逼平衡树
Time Limit: 10 Sec Memory Limit: 128 MB Submit: 1363 Solved: 579 [Submit][Status][Discuss] Descripti ...
- UVALive - 3977 Summits (BFS染色)
题目大意:坑爹的题目.题意那么难理解. 讲的就是,假设该点是山顶的话(高度为h).那么以该点为中心,往外辐射.走高度大于h-d的点,到达不了还有一个比它高的点 这就提示了,高度要从大到小排序,依次以高 ...
- centos7 开启端口防火墙配置(如开启3306或者80端口)
转载自https://blog.csdn.net/codepen/article/details/52738906 https://www.cnblogs.com/hantianwei/p/57362 ...
- css3 实现水晶按钮
background-image: -webkit-gradient(linear, left top, left bottom, color-stop(0%, #ee432e), color-sto ...
- RFC chinese
rfc专业性强,现实中不可能有好的全的rfc的翻译 尝试上在github上搜索 https://github.com/tidyjiang8/6lowpan-rfcs-chinese 诚如作者所说: 在 ...
- 编辑器vim简介
vi简介 vi是"Visual interface"的简称,它在Linux上的地位就仿佛Edit程序在DOS上一样.它可以执行输出.删除.查找.替换.块操作等众多文本操作,而且用户 ...
- 从多路搜索树到 B-树
1. 什么是 B 树 B 树是为磁盘或其他直接存取的辅助存储设备而设计的一种平衡二叉树: B 树类似于红黑树,但它们在降低磁盘 I/O 操作数方面要更好一点, 许多数据库系统使用 B 树或者 B 树的 ...
- 二叉苹果树 - 二叉树树型DP
传送门 中文题面: 题目描述 有一棵苹果树,如果树枝有分叉,一定是分 2 叉(就是说没有只有 1 个儿子的结点,这棵树共有N 个结点(叶子点或者树枝分叉点),编号为1-N,树根编号一定是1. 我们用一 ...