CF1462C Unique Number

题解

本蒟数学太差惹,看到这题当时就很懵

然鹅……(xleq 50)

那感情好,我们可以利用骗分神器——打表来写这道题

打表一开始是手算,算着算着就发现规律惹……

这个规律也不大好说……相信各位看代码是可以看出来的……

Code

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

int db[51] = {-1,1,2,3,4,5,6,7,8,9,19,29,39,49,59,69,79,89,189,289,389,489,589,689,789,1789,2789,3789,4789,5789,6789,16789,26789,36789,46789,56789,156789,256789,356789,456789,1456789,2456789,3456789,13456789,23456789,123456789,-1,-1,-1,-1,-1};
int t, x;

int main()
{
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d", &x);
        printf("%d
", db[x]);
    }
    return 0;
}
原文地址:https://www.cnblogs.com/w-rb/p/14254572.html