POJ2505之找规律

来源:互联网 发布:js bytearray 遍历 编辑:程序博客网 时间:2024/05/18 21:41

题目传送门:http://poj.org/problem?id=2505

看看代码就懂啦~。

记得要向上取整~

#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>const int MAXN=10000;using namespace std;int main (void){    long long num;    while(~scanf("%lld",&num))    {        if(num<=9)        {            printf("Stan wins.\n");            continue;        }        if(num>9&&num<=18)        {            printf("Ollie wins.\n");            continue;        }        while(num>18)        {            num=(num-1)/18+1;        }        if(num<=9)        {            printf("Stan wins.\n");            continue;        }        if(num>9&&num<=18)        {            printf("Ollie wins.\n");            continue;        }    }    return 0;}
0 0