UVA 679 Dropping Balls
2018-04-02 09:50
453 查看
#include<bits/stdc++.h> int t,n,x,i,k; int main(){ scanf("%d",&t); while(t--){ scanf("%d%d",&n,&x); int k=1; for(i=0;i<n-1;i++) if(x%2){ k=(k<<1); x=((x+1)>>1); } else{ k=(k<<1)+1; x=(x>>1); } printf("%d\n",k); } return 0; }
相关文章推荐
- 例题 6-6 小球下落(Dropping Balls) UVa 679 二叉树规律
- UVa 679 - Dropping Balls
- UVa 679 - Dropping Balls
- UVA679 Dropping Balls【二叉树结点编号】
- UVA_679: Dropping Balls
- Uva - 679 - Dropping Balls
- 例题6-6 小球下落(Dropping Balls, UVa 679)
- uva679 - Dropping Balls(沾边的树的遍历问题)
- Uva679 Dropping Balls
- UVa-679 Dropping Balls
- Uva - 679 - Dropping Balls
- Dropping Balls,UVa 679
- uva 679 Dropping Balls
- UVA 679 - Dropping Balls
- UVa 679 例题6-6 小球下落(Dropping Balls)
- UVa--679 Dropping Balls(模拟)
- UVa 679 Dropping Balls
- UVa 679 - Dropping Balls
- BNU17818 UVA679 Dropping Balls
- UVa 679 - Dropping Balls