Bank Robbery LightOJ

题意：一个数A，如果A去掉它的最后一位就变成了B，即B=A/10，给A - B，求A

#include <iostream>
#include <cstdio>
#include <sstream>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <cmath>
#define rap(a, n) for(int i=1; i<=n; i++)
#define MOD 2018
#define LL long long
#define ULL unsigned long long
#define Pair pair<int, int>
#define mem(a, b) memset(a, b, sizeof(a))
#define _  ios_base::sync_with_stdio(0),cin.tie(0)
//freopen("1.txt", "r", stdin);
using namespace std;
const int maxn = 10010, INF = 0x7fffffff;

int main()
{
    int T, kase = 0;
    cin>> T;
    while(T--)
    {
        ULL n;
        scanf("%llu", &n);
        printf("Case %d:", ++kase);
        for(int i=9; i>=0; i--)
        {
            if((n * 10 - i) % 9 == 0)
            {
                printf(" %llu", (n * 10 - i) / 9);
            }
        }
        cout<< endl;
    }

    return 0;
}