hdu 5051 找规律？+大trick

http://acm.hdu.edu.cn/showproblem.php?pid=5051

打表找规律

据说是http://zh.wikipedia.org/wiki/%E6%9C%AC%E7%A6%8F%E7%89%B9%E5%AE%9A%E5%BE%8B

蛋疼题

还要特判4种情况

顺道膜拜昂神

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <queue>
#include <vector>
#include<set>
#include <iostream>
#include <algorithm>
using namespace std;
#define RD(x) scanf("%d",&x)
#define RD2(x,y) scanf("%d%d",&x,&y)
#define clr0(x) memset(x,0,sizeof(x))
typedef long long LL;
int n,b,q;
void work()
{
    scanf("%d%d%d",&n,&b,&q);
    if (q != 1 && q != 10 && q != 100 && q != 1000) {
        printf("%.5f\n" , log10(1 + 1.0 / n));
    }else{
        if(q == 1){
            if (b==n||b/10==n||b/100==n||b/1000==n)
                puts("1.00000");
            else
                puts("0.00000");
            }else{
                if (b==n||b/10==n||b/100==n||b/1000==n||b*10==n||b*100==n||b*1000==n)
                    puts("1.00000");
                else
                    puts("0.00000");
            }
    }
}
int main() {
    int _,cas = 1;
    RD(_);
    while(_--){
        printf("Case #%d: ",cas++);
        work();
    }
    return 0;
}

转载于:https://www.cnblogs.com/zibaohun/p/4046819.html