标签：
| Gold Rush |
| Time Limit: 2000ms, Special Time Limit:5000ms, Memory Limit:65536KB |
| Total submit users: 15, Accepted users: 10 |
| Problem 13249 : No special judgement |
| Problem description |
|
Alice and Bob are on an adventure trip. Deep in the woods they discover a mysterious deep cave which they enter flutteringly. They find an old console with a giant bar of gold in it. On the bar, there is a number n. Both tried to carry the gold out the cave, but it was still to heavy for one of them. |
| Input |
|
The input starts with the number t <= 1000 of test cases. Then t lines follow, each describing a single test case consisting of three numbers n, a and b with a, b >= 1, a + b = 2n, and 1 <= n <= 62. |
| Output |
|
Output one line for every test case with the minimal number of days that Alice and Bob are locked in the cave. |
| Sample Input |
3 2 2 2 2 1 3 10 1000 24 |
| Sample Output |
1 2 7 |
| Problem Source |
| GCPC 2014 |
#include<stdio.h> #define LL __int64 LL a,b; int main() { int n,T; scanf("%d",&T); while(T--) { scanf("%d%I64d%I64d",&n,&a,&b); int p=0,q=0; for(int i=0;i<=n;i++) { if(a%2) { p=i; break; } a/=2; } for(int i=0;i<=n;i++) { if(b%2) { q=i; break; } b/=2; } if(p<q)p=q; printf("%d\n",n-p); } return 0; }
标签：
原文地址：http://www.cnblogs.com/yuyixingkong/p/4356535.html
