提出詳細
ソースコード
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cassert>
#include <exception>
#include <numeric>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<ll, ll> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<Pll> vp;
typedef vector<bool> vb;
#define rep(i, a, n) for (ll i = (a); i < (n); ++i)
#define rrep(i, a, n) for (ll i = (a); i > (n); --i)
#define erep(i, a, n) for (ll i = (a); i <= (n); ++i)
#define rerep(i, a, n) for (ll i = (a); i >= (n); --i)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define mp make_pair
#define sz(x) ((int)x.size())
#define SORT(x) sort(all(x))
#define RSORT(x) sort(all(x),greater<ll>())
#define vec_max(V) *max_element(all(V))
#define vec_min(V) *min_element(all(V))
#define vec_sum(V) accumulate(all(V), 0LL)
#define print(X) cout << (X) << "\n"
#define sprint(X) printf("%f\n", (X)) // 小数点の出力
#define _ << " " <<
#define Yes print("Yes")
#define No print("No")
#define case(X) cout << "Case #" << (X) + 1 << ":" << "\n"
static const int INF = 1e+9+7;
int main(){
ll T;
cin >> T;
rep(i,0,T){
case(i);
ll N;
cin >> N;
vll A(4);
ll count = 0;
ll a = N;
A[0] = (ll(N/1000));
N %= 1000;
A[1] = (ll(N / 100));
N %= 100;
A[2] = (ll(N / 10));
A[3] = (N % 10);
while(true){
vll lA = A;
vll sA = A;
RSORT(lA);
SORT(sA);
int tmp = (lA[0]*1000 + lA[1]*100 + lA[2]*10 + lA[3]) - (sA[0]*1000 + sA[1]*100 + sA[2]*10 + sA[3]);
// print(lA[0]*1000 + lA[1]*100 + lA[2]*10 + lA[3]);
// print(sA[0]*1000 + sA[1]*100 + sA[2]*10 + sA[3]);
if(a == tmp){
print(count);
break;
}
else{
count++;
a = tmp;
N = a;
A[0] = (ll(N/1000));
N %= 1000;
A[1] = (ll(N / 100));
N %= 100;
A[2] = (ll(N / 10));
A[3] = (N % 10);
}
}
}
return 0;
}
提出情報
提出出力結果
テストケース情報