Uva11384 Help is needed for Dexter

Dexter is tired of Dee Dee. So he decided to keep Dee Dee busy in a game. The game he planned for her is quite easy to play but not easy to win at least not for Dee Dee. But Dexter does not have time to spend on this silly task, so he wants your help. There will be a button, when it will be pushed a random number N will be chosen by computer. Then on screen there will be numbers from 1 to N. Dee Dee can choose any number of numbers from the numbers on the screen, and then she will command computer to subtract a positive number chosen by her (not necessarily on screen) from the selected numbers. Her objective will be to make all the numbers 0. For example if N = 3, then on screen there will be 3 numbers on screen: 1, 2, 3. Say she now selects 1 and 2. Commands to subtract 1, then the numbers on the screen will be: 0, 1, 3. Then she selects 1 and 3 and commands to subtract 1. Now the numbers are 0, 0, 2. Now she subtracts 2 from 2 and all the numbers become 0. Dexter is not so dumb to understand that this can be done very easily, so to make a twist he will give a limit L for each N and surely L will be as minimum as possible so that it is still possible to win within L moves. But Dexter does not have time to think how to determine L for each N, so he asks you to write a code which will take N as input and give L as output. Input Input consists of several lines each with N such that 1 ≤ N ≤ 1, 000, 000, 000. Input will be terminated by end of file. Output For each N output L in separate lines. Sample Input 1 2 3 Sample Output 1 2 2

 

https://odzkskevi.qnssl.com/33af24c925ae62df4c094b22a2ba7e37?v=1507989644

 

【题解】

这个题还真是蛮巧的。通过尽可能减多的一块，把剩下的转换成已有的，显然取1/2，虽然代码好写了点（捂脸）

水题不能算颓......水题！Oier的事，能算颓嘛（捂脸）？

 1 #include<iostream>
 2 #include <cstdio>
 3 #include <cstdlib>
 4 #include <cstring>
 5 #include <algorithm>
 6 #include <cmath>
 7 #define max(a, b) ((a) > (b) ? (a) : (b))
 8 #define min(a, b) ((a) < (b) ? (a) : (b))
 9 #define abs(a) (((a) < 0) ? (-1 * (a)) : (a))
10 inline void swap(int &a, int &b)
11 {
12     int tmp = a;a = b;b = tmp;
13 }
14 inline void read(long long &x)
15 {
16     x = 0;char ch = getchar(), c = ch;
17     while(ch < '0' || ch > '9')c = ch, ch = getchar();
18     while(ch <= '9' && ch >= '0')x = x * 10 + ch - '0', ch = getchar();
19     if(c == '-')x = -x; 
20 }
21 
22 const int INF = 0x3f3f3f3f;
23 
24 int dfs(long long now)
25 {
26     if(now == 1)return 1;
27     else return dfs(now/2) + 1;
28 }
29 
30 long long n; 
31 
32 int main()
33 {
34     while(scanf("%lld", &n) != EOF)
35     {
36         printf("%d\n", dfs(n));
37     }
38     return 0;
39 } 

Uva113384

 

转载于:https://www.cnblogs.com/huibixiaoxing/p/7679818.html