text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000 * 1000 * 1000 + 7;
const int MAXN = 8000 * 8000 + 5;
const int INF = INT_MAX;
array<long long, 2> get(long long x) {
array<long long, 2> res;
res[0] = -1;
res[1] = 10;
for (long long i = x; i > 0; i = i / 10) {
long long d = i % 10;
res[0] = max(res[0], d);
res[1] = min(res[1], d);
}
return res;
}
map<long long, long long> m;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
m.clear();
long long n, k;
cin >> n >> k;
int i = 2;
m[1] = n;
long long num = n;
while (true) {
auto res = get(num);
if (res[0] == 0 || res[1] == 0) break;
m[i] = num + (res[0] * res[1]);
num = m[i];
++i;
}
if (m.find(k) != m.end())
cout << m[k];
else
cout << (*m.rbegin()).second;
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int getMin(long long int n) {
int rem = 0;
int min_val = n % 10;
while (n) {
rem = n % 10;
if (rem < min_val) min_val = rem;
n = n / 10;
}
return min_val;
}
int getMax(long long int n) {
int rem = 0;
int max_val = n % 10;
while (n) {
rem = n % 10;
if (rem > max_val) max_val = rem;
n = n / 10;
}
return max_val;
}
int main() {
int t;
cin >> t;
while (t--) {
long long int a, k;
cin >> a >> k;
int cur = 1;
int min_val;
int max_val;
while (cur < k) {
min_val = getMin(a);
max_val = getMax(a);
if (min_val == 0) {
break;
}
a = a + (min_val * max_val);
cur++;
}
cout << a << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long Max(long long n) {
long long ans = INT_MIN;
for (long long i = n; i > 0; i /= 10) {
ans = max(ans, i % 10);
}
return ans;
}
long long Min(long long n) {
long long ans = INT_MAX;
for (long long i = n; i > 0; i /= 10) {
ans = min(ans, i % 10);
}
return ans;
}
bool zero(long long n) {
for (long long i = n; i > 0; i /= 10) {
if (i % 10 == 0) return true;
}
return false;
}
void solve() {
long long a, b;
cin >> a >> b;
long long cnt = 1;
long long prev = a;
while (cnt < b) {
long long n = (long long)prev + (Max(prev) * Min(prev));
if (zero(n)) {
cout << n << endl;
return;
}
prev = n;
cnt++;
}
cout << prev << endl;
return;
}
int main() {
int TC;
cin >> TC;
while (TC--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, i;
cin >> t;
while (t--) {
long long int a1, p = 1, K;
cin >> a1 >> K;
while (p != K) {
long long int temp = a1;
int min = 9, max = 0;
while (temp > 0) {
if (max < temp % 10) max = temp % 10;
if (min > temp % 10) min = temp % 10;
temp /= 10;
}
a1 = a1 + min * max;
if (min == 0) break;
p++;
}
cout << a1 << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool contains(long long a) {
while (a > 0) {
if (a % 10 == 0) return true;
a /= 10;
}
return false;
}
long long sum(long long a) {
long long minm = a % 10;
long long maxm = a % 10;
while (a > 0) {
long long temp = a % 10;
minm = min(minm, temp);
maxm = max(maxm, temp);
a /= 10;
}
return minm * maxm;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
long long a, k;
cin >> a >> k;
while (!contains(a) && k - 1 > 0) {
a += sum(a);
k -= 1;
}
cout << a << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mm(long long b) {
long long mx = -1, mn = 10;
while (b > 0) {
long long y = b % 10;
b = b / 10;
mx = max(mx, y);
mn = min(mn, y);
}
return mx * mn;
}
int main() {
long long t;
cin >> t;
while (t--) {
long long a, k, ans = 0;
cin >> a >> k;
k--;
while (k--) {
ans = mm(a);
a = a + ans;
if (ans == 0) break;
}
cout << a << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int t;
cin >> t;
while (t--) {
long long int n, k, i, y;
cin >> n >> k;
long long int pro = -1, flag = 0, c = 1;
if (k == 1)
cout << n << "\n";
else {
while (pro != 0) {
c++;
long long int min_dig = 10, max_dig = -1;
string s = to_string(n);
for (i = 0; i < s.length(); i++) {
int w;
w = (int)s[i] - 48;
if (w > max_dig) max_dig = w;
if (w < min_dig) min_dig = w;
}
pro = min_dig * max_dig;
n = n + pro;
if (c == k) {
flag = 1;
cout << n << "\n";
break;
}
if (pro == 0) {
break;
}
}
if (flag == 0) cout << n << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long maxi(long long n) {
long long m = INT_MIN;
while (n) {
m = max(m, n % 10);
n /= 10;
}
return m;
}
long long mini(long long n) {
long long m = INT_MAX;
while (n) {
m = min(m, n % 10);
n /= 10;
}
return m;
}
int32_t main() {
long long t;
cin >> t;
while (t--) {
long long a1, k;
cin >> a1 >> k;
k--;
while (k--) {
a1 = a1 + (mini(a1) * maxi(a1));
if (mini(a1) == 0) break;
}
cout << a1 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int T = 1e3 + 5;
long long t, a[T], k[T], ma, mi, cnt, tmp;
void init() {
scanf("%lld", &t);
for (int i = 0; ++i <= t; scanf("%lld%lld", &a[i], &k[i]))
;
}
void work() {
for (int i = 0; ++i <= t;)
for (int j = 1; ++j <= k[i];) {
for (ma = 0, mi = 9, cnt = a[i]; cnt;) {
tmp = cnt % 10;
cnt /= 10;
ma = max(ma, tmp);
mi = min(mi, tmp);
}
if (mi == 0) break;
a[i] += ma * mi;
}
}
void prin() {
for (int i = 0; ++i <= t; printf("%lld\n", a[i]))
;
}
int main() {
init();
work();
prin();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int fmax(string s) {
int p = s[0] - '0', ind = 0;
for (int i = 1; i < s.length(); i++) {
int t = s[i] - '0';
if (t > p) {
p = t;
ind = i;
}
}
return ind;
}
int fmin(string s) {
int p = s[0] - '0', ind = 0;
for (int i = 1; i < s.length(); i++) {
int t = s[i] - '0';
if (t < p) {
p = t;
ind = i;
}
}
return ind;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
int te;
cin >> te;
for (int w = 0; w < te; w++) {
long long int num, k;
cin >> num >> k;
k -= 1;
while (k > 0) {
string s = to_string(num);
int mind = fmin(s);
int maxd = fmax(s);
if (s[mind] == '0') break;
int a = s[mind] - '0', b = s[maxd] - '0';
num += a * b;
k -= 1;
}
cout << num << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;
long long a[20], pos;
void qaq(long long x) {
pos = 0;
while (x) {
a[pos++] = x % 10;
x /= 10;
}
sort(a, a + pos);
}
long long solve() {
long long n, k;
scanf("%lld", &n);
scanf("%lld", &k);
k--;
while (k--) {
qaq(n);
if (a[0] == 0) return printf("%lld\n", n);
n += a[0] * a[pos - 1];
}
return printf("%lld\n", n);
}
signed main() {
long long _;
scanf("%lld", &_);
while (_--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long int a, k, n;
bool complete = false;
cin >> a >> k;
k--;
while (k--) {
long long int max = 0, min = 10;
for (n = a; n != 0; n /= 10) {
if (n % 10 > max) max = n % 10;
if (n % 10 < min) min = n % 10;
}
if (max == 0 || min == 0) {
complete = true;
cout << a << "\n";
break;
} else
a = a + min * max;
}
if (!complete) cout << a << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void f(int testCase) {
long long a;
long long k;
cin >> a >> k;
long long ans, temp;
for (int i = 0; i < k - 1; i++) {
temp = a;
long long up = -1, low = 10;
while (temp > 0) {
up = max(up, temp % 10);
low = min(temp % 10, low);
temp /= 10;
}
if (low == 0 || up == 0) {
cout << a << '\n';
return;
}
a += up * low;
}
cout << a << '\n';
}
int main() {
std::ios_base::sync_with_stdio(false);
int t = 1;
cin >> t;
for (int i = 1; i <= t; i++) f(i);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long largest;
long long smallest;
void Digits(long long n) {
largest = 0;
smallest = 9;
while (n) {
long long r = n % 10;
largest = max(r, largest);
smallest = min(r, smallest);
n = n / 10;
}
return;
}
void solve();
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long TESTS = 1;
cin >> TESTS;
while (TESTS--) {
solve();
}
return 0;
}
void solve() {
long long a, k;
cin >> a >> k;
k--;
largest = 0;
smallest = 9;
while (k--) {
Digits(a);
if (largest == 0 || smallest == 0) {
break;
}
a += ((largest) * (smallest));
}
cout << a << endl;
return;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int t;
cin >> t;
while (t--) {
long long int a, k;
cin >> a >> k;
while (k > 1) {
long long int x = a;
long long int mine = 10, maxe = 0;
while (x > 0) {
mine = (x % 10 < mine ? x % 10 : mine);
maxe = (maxe > x % 10 ? maxe : x % 10);
x = x / 10;
}
a = a + maxe * mine;
if (mine == 0) {
break;
}
k--;
}
cout << a << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int n = 1e6 + 5;
int M, m;
void slove(long long a) {
while (a) {
int t = a % 10;
M = max(M, t);
m = min(m, t);
a /= 10;
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
long long a, k;
cin >> a >> k;
for (int i = 1; i < k; i++) {
M = 0, m = 1e9;
slove(a);
a += M * m;
if (M * m == 0) break;
}
cout << a << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long mx = INT32_MIN, mn = INT32_MAX;
struct maths_util {
vector<long long> fact;
vector<bool> is_prime;
maths_util(int n = 200001, long long q = 1000000007) {
fact.resize(n);
is_prime.assign(n + 1, true);
fact[0] = 1;
for (int i = 1; i < n; i++) fact[i] = (fact[i - 1] * i) % q;
is_prime[0] = is_prime[1] = false;
for (int i = 2; i <= n; i++)
if (is_prime[i])
for (int j = i + i; j <= n; j += i) is_prime[j] = false;
}
long long power_mod_q(long long x, long long n, long long q = 1000000007) {
if (n == 0) return 1;
if (n % 2 == 0)
return power_mod_q((x * x) % q, n / 2, q);
else
return (x * power_mod_q((x * x) % q, n / 2, q)) % q;
}
long long inverse_mod_q(long long n, long long q = 1000000007) {
return power_mod_q(n, q - 2, q);
}
long long nCr_mod_q(long long n, long long r, long long q = 1000000007) {
return (((fact[n] * inverse_mod_q(fact[r], q)) % q) *
inverse_mod_q(fact[n - r], q)) %
q;
}
long long power(long long x, long long n) {
if (n == 0) return 1;
if (n % 2 == 0)
return power(x * x, n / 2);
else
return x * power(x * x, n / 2);
}
vector<vector<long long>> multiply(vector<vector<long long>>& a,
vector<vector<long long>>& b) {
int p = a.size(), q = b.size(), r = b[0].size();
vector<vector<long long>> c(p, vector<long long>(r, 0));
for (int i = 0; i < p; i++)
for (int j = 0; j < r; j++)
for (int k = 0; k < q; k++) c[i][j] += a[i][k] * b[k][j];
return c;
}
vector<vector<long long>> add(vector<vector<long long>>& a,
vector<vector<long long>>& b) {
int p = a.size(), q = a[0].size();
vector<vector<long long>> c(p, vector<long long>(q));
for (int i = 0; i < p; i++)
for (int j = 0; j < q; j++) c[i][j] = a[i][j] + b[i][j];
return c;
}
vector<vector<long long>> power(vector<vector<long long>>& a, long long n) {
vector<vector<long long>> c(a.size(), vector<long long>(a.size(), 0));
if (n == 0) {
for (int i = 0; i < a.size(); i++) c[i][i] = 1;
return c;
}
if (n % 2 == 0)
return power(c = multiply(a, a), n / 2);
else
return multiply(a, c = power(c = multiply(a, a), n / 2));
}
} u(1000001);
struct dsu {
vector<int> rank, parent, num;
dsu(int n) {
rank.assign(n, 0);
parent.resize(n);
for (int i = 0; i < n; i++) parent[i] = i;
}
int find_set(int i) {
if (i == parent[i]) return i;
return parent[i] = find_set(parent[i]);
}
bool is_same_set(int i, int j) {
if (find_set(i) == find_set(j)) return true;
return false;
}
void union_set(int i, int j) {
if (!is_same_set(i, j)) {
int u = find_set(i), v = find_set(j);
if (rank[u] == rank[v]) {
parent[v] = u;
rank[u] += 1;
} else if (rank[u] > rank[v])
parent[v] = u;
else
parent[u] = v;
}
}
};
struct graph {
int v, time, count;
vector<pair<int, int>>* adj;
vector<vector<long long>> matrix;
vector<bool> visited, in_stack, ap, in_MST;
stack<int> s;
vector<int> color, cc, f, d, finish_time, l, indegree, sccs, topo, outdegree,
pred, child;
vector<long long> dist;
graph(int n) {
v = n;
adj = new vector<pair<int, int>>[n];
}
void add_edge(int u, int v, int w) {
adj[u].push_back(make_pair(v, w));
adj[v].push_back(make_pair(u, w));
}
void dfs() {
color.assign(v, 0);
cc.assign(v, -1);
d.assign(v, -1);
f.assign(v, -1);
time = count = 0;
finish_time.assign(2 * v, -1);
visited.assign(v, false);
pred.assign(v, -1);
for (int i = 0; i < v; i++) {
if (color[i] == 0) {
dfs(i);
count++;
}
}
for (int i = 0; i < v; i++) finish_time[f[i]] = i;
}
void dfs(int i) {
color[i] = 1;
cc[i] = count;
d[i] = time;
time++;
for (auto x : adj[i]) {
if (!color[x.first]) {
pred[x.first] = i;
dfs(x.first);
}
}
color[i] = 2;
f[i] = time;
time++;
}
void bfs(int u) {
color.assign(v, 0);
pred.assign(v, -1);
d.assign(v, 0);
queue<int> q;
color[u] = 1;
q.push(u);
while (!q.empty()) {
int i = q.front();
q.pop();
for (auto x : adj[i]) {
if (!color[x.first]) {
pred[x.first] = i;
color[x.first] = 1;
d[x.first] = d[i] + 1;
q.push(x.first);
}
}
color[i] = 2;
}
}
void scc() {
graph g_t(v);
for (int i = 0; i < v; i++)
for (auto x : adj[i]) g_t.add_edge(x.first, i, x.second);
dfs();
for (int i = 2 * v - 1; i >= 0; i--) {
if (finish_time[i] != -1 && g_t.color[finish_time[i]] == 0) {
g_t.dfs(finish_time[i]);
g_t.count++;
}
}
sccs = g_t.cc;
count = g_t.count;
}
void topological_sort() {
indegree.assign(v, 0);
outdegree.assign(v, 0);
for (int i = 0; i < v; i++)
if (adj[i].size()) outdegree[i] = adj[i].size();
for (int i = 0; i < v; i++)
for (auto x : adj[i]) indegree[x.first]++;
vector<int> zero;
for (int i = 0; i < v; i++)
if (!indegree[i]) zero.push_back(i);
while (!zero.empty()) {
int v = zero.back();
topo.push_back(v);
zero.pop_back();
for (auto x : adj[v]) {
indegree[x.first]--;
if (!indegree[x.first]) zero.push_back(x.first);
}
}
}
void tarjan() {
for (int i = 0; i < v; i++)
if (!color[i]) tarjan(i);
}
void tarjan(int i) {
color[i] = 1;
d[i] = time;
time++;
l[i] = d[i];
s.push(i);
in_stack[i] = true;
for (auto x : adj[i]) {
if (!color[x.first]) {
tarjan(x.first);
l[i] = min(l[i], l[x.first]);
} else if (in_stack[x.first]) {
l[i] = min(l[i], d[x.first]);
}
}
color[i] = 2;
f[i] = time;
time++;
if (d[i] == l[i]) {
while (s.top() != i)
cout << s.top() << ' ', in_stack[s.top()] = false, s.pop();
cout << s.top() << '\n', in_stack[s.top()] = false, s.pop();
}
}
graph kruskal() {
vector<pair<int, pair<int, int>>> edges;
for (int i = 0; i < v; i++)
for (auto x : adj[i])
edges.push_back(make_pair(x.second, make_pair(i, x.first)));
sort(edges.begin(), edges.end());
dsu d(v);
graph mst(v);
for (auto x : edges) {
if (!d.is_same_set(x.second.first, x.second.second)) {
mst.add_edge(x.second.first, x.second.second, x.first);
d.union_set(x.second.first, x.second.second);
}
}
return mst;
}
graph prims(int s) {
priority_queue<pair<int, int>, vector<pair<int, int>>,
greater<pair<int, int>>>
pq;
d.assign(v, INT32_MAX);
pred.assign(v, -1);
in_MST.assign(v, false);
count = 0;
d[s] = 0;
pq.push({0, s});
while (count < v) {
int u = pq.top().second;
if (!in_MST[u]) in_MST[u] = true, count++;
pq.pop();
for (auto x : adj[u]) {
if (!in_MST[x.first] && d[x.first] > x.second) {
pq.push({x.second, x.first});
pred[x.first] = u;
d[x.first] = x.second;
}
}
}
graph mst(v);
for (int i = 0; i < v; i++) {
if (pred[i] != -1) mst.add_edge(i, pred[i], d[i]);
}
return mst;
}
void dijkstra(int s) {
d.assign(v, INT32_MAX);
visited.assign(v, false);
priority_queue<pair<int, int>, vector<pair<int, int>>,
greater<pair<int, int>>>
pq;
pq.push({d[s] = 0, s});
while (!pq.empty()) {
int u = pq.top().second;
pq.pop();
if (!visited[u]) {
visited[u] = true;
for (auto x : adj[u]) {
if (d[x.first] > d[u] + x.second) {
d[x.first] = d[u] + x.second;
pq.push({d[x.first], x.first});
}
}
}
}
}
};
struct kmp {
vector<int> lps;
string p, t;
kmp(string& p, string& t) {
this->p = p;
this->t = t;
lps.assign(p.size(), 0);
lps[0] = 0;
int len = 0, i = 1, j;
while (i < p.size()) {
if (p[i] == p[len])
lps[i++] = ++len;
else if (len)
len = lps[len - 1];
else
lps[i++] = 0;
}
i = j = 0;
while (i < t.size()) {
if (p[j] == t[i]) j++, i++;
if (j == p.size()) {
j = lps[j - 1];
} else if (i < t.size() && p[j] != t[i]) {
if (j)
j = lps[j - 1];
else
i++;
}
}
}
};
struct trie {
struct node {
char c;
bool is_leaf;
vector<node*> child;
node(char ch) {
c = ch;
is_leaf = false;
child.assign(256, nullptr);
}
};
node* root;
trie() { root = new node('#'); }
void insert(string& s) {
node* temp = root;
for (auto x : s) {
if (!(temp->child)[x]) (temp->child)[x] = new node(x);
temp = (temp->child)[x];
}
temp->is_leaf = true;
}
bool has_child(node* temp) {
for (auto x : temp->child)
if (x) return true;
return false;
}
bool search(string& s) {
node* temp = root;
bool flag = true;
for (auto x : s) {
if (!(temp->child)[x]) {
flag = false;
break;
}
temp = (temp->child)[x];
}
if (flag && temp->is_leaf)
return true;
else
return false;
}
void remove(string& s) {
if (search(s)) root = remove(root, 0, s);
}
node* remove(node* root, int pos, string& s) {
if (pos <= s.length() - 1) {
(root->child)[s[pos]] = remove((root->child)[s[pos]], pos + 1, s);
bool flag = true;
for (int i = 0; i < 256; i++)
if ((root->child)[i]) flag = false;
if (root->c != '#' && root->is_leaf == false && flag) {
delete (root);
root = nullptr;
}
} else {
root->is_leaf = false;
bool flag = true;
for (int i = 0; i < 256; i++)
if ((root->child)[i]) flag = false;
if (flag) {
delete (root);
root = nullptr;
}
}
return root;
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
long long a, k;
cin >> a >> k;
vector<long long> terms;
terms.push_back(a);
while (1) {
long long next = terms.back();
mn = INT32_MAX, mx = -1 * INT32_MAX;
while (next) {
mn = min(next % 10, mn);
mx = max(next % 10, mx);
next /= 10;
}
next = terms.back() + mn * mx;
if (next == terms.back()) break;
terms.push_back(next);
}
int n = terms.size();
k--;
if (k >= n)
cout << terms.back() << '\n';
else
cout << terms[k] << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937_64 mrand(chrono::steady_clock::now().time_since_epoch().count());
const long long mod = 1000000007;
long long rnd(long long x) { return (unsigned long long)mrand() % x; }
long long powmod(long long a, long long b) {
long long res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
}
return res % mod;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
const std::vector<std::pair<int, int>> moves{{0, -1}, {-1, 0}, {0, 1}, {1, 0}};
inline int bitCount(int x) { return __builtin_popcount(x); }
inline int bitCount(long long x) { return __builtin_popcountll(x); }
inline int highestOneBit(int x) { return 1 << (31 - __builtin_clz(x | 1)); }
inline int binaryDigits(int x) { return 32 - __builtin_clz(x | 1); }
template <typename A>
string to_string(A* ptr) {
stringstream ss;
ss << "0x" << std::setw(16) << std::setfill('0') << std::hex
<< (uint64_t)(uintptr_t)ptr;
return ss.str();
}
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto& x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
void solve() {
long long n, k;
cin >> n >> k;
while (--k) {
long long a = n;
int mx = a % 10, mn = a % 10;
while (a) {
mx = max(mx, (int)(a % 10LL));
mn = min(mn, (int)(a % 10LL));
a /= 10LL;
}
if (mn == 0) break;
n += 1LL * mx * mn;
}
cout << n << '\n';
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int _;
cin >> _;
while (_--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int min_find(long long a) {
int rem;
int temp = 9;
while (a != 0) {
rem = a % 10;
if (rem <= temp) {
temp = rem;
}
a = a / 10;
}
return temp;
}
int max_find(long long a) {
int rem;
int temp = 0;
while (a != 0) {
rem = a % 10;
if (rem >= temp) {
temp = rem;
}
a = a / 10;
}
return temp;
}
int main() {
int t;
cin >> t;
while (t--) {
long long a, k;
cin >> a >> k;
int i = 1;
int a_min, a_max;
while (i < k) {
a_min = min_find(a);
a_max = max_find(a);
if (a_min == 0 || a_max == 0) {
break;
}
a = a + a_min * a_max;
i++;
}
cout << a << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long maxdigit(long long n) {
long long ans = 0;
while (n > 0) {
ans = max(ans, n % 10);
n /= 10;
}
return ans;
}
long long mindigit(long long n) {
long long ans = 9;
while (n > 0) {
ans = min(ans, n % 10);
n /= 10;
}
return ans;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t;
t = 1;
while (t--) {
long long q;
cin >> q;
for (long long i = 1; i <= q; i++) {
long long a, k;
cin >> a >> k;
long long cnt = 1;
while (1) {
if (cnt == k) {
break;
}
if (mindigit(a) == 0) {
break;
}
a = a + mindigit(a) * maxdigit(a);
cnt++;
}
cout << a << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int getMax(long long int n) {
string s = "";
while (n > 0) {
s += to_string(n % 10);
n = n / 10;
}
long long int maxN = 0;
for (char c : s) {
maxN = max(maxN, (long long int)(c - '0'));
}
return maxN;
}
long long int getMin(long long int n) {
string s = "";
while (n > 0) {
s += to_string(n % 10);
n = n / 10;
}
long long int minN = 9;
for (char c : s) {
minN = min(minN, (long long int)(c - '0'));
}
return minN;
}
void solve() {
long long int a, k;
cin >> a >> k;
long long int ans = a;
for (long long int i = 0; i < k - 1; i++) {
long long int mn = getMin(ans);
long long int mx = getMax(ans);
if (mn == 0) {
break;
}
ans = ans + mn * mx;
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int t;
cin >> t;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int minMax(long long n) {
int min = 9, max = 0;
while (n != 0) {
int d = n % 10;
n /= 10;
if (d > max) max = d;
if (d < min) min = d;
}
return min * max;
}
int get(int x) {
string s = to_string(x);
int mn = 9, mx = 0;
for (int i = 0; i < s.size(); i++) {
mn = min(mn, (s[i] - '0'));
mx = max(mx, (s[i] - '0'));
}
return mn * mx;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long t, a, k;
cin >> t;
while (t--) {
cin >> a >> k;
while (k != 1) {
int t = minMax(a);
if (t == 0) break;
a = a + t;
k--;
}
cout << a << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mind(ll x) {
ll ans = 9;
while (x > 0) {
ans = min(ans, x % 10);
x /= 10;
}
return ans;
}
ll maxd(ll x) {
ll ans = 0;
while (x > 0) {
ans = max(ans, x % 10);
x /= 10;
}
return ans;
}
int main() {
int tt;
cin >> tt;
while (tt--) {
ll a1, k;
cin >> a1 >> k;
k--;
while (k-- && mind(a1) != 0) {
a1 += mind(a1) * maxd(a1);
}
cout << a1 << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int te = 0; te < t; te++) {
long long a, k;
cin >> a >> k;
int i = 1;
int found = 0;
while (i < k) {
int mina = 10;
int maxa = -1;
long long x = a;
while (x > 0) {
int d = x % 10;
mina = min(mina, d);
maxa = max(maxa, d);
x = x / 10;
if (d == 0) found = 1;
}
a += mina * maxa;
i += 1;
if (found == 1) break;
}
cout << a << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t;
cin >> t;
while (t--) {
long long int n, k;
cin >> n >> k;
for (long long int i = 2; i <= k; i++) {
long long int x = 9, y = 0, p = n;
while (p) {
x = min(x, p % 10);
y = max(y, p % 10);
p /= 10;
}
if (!x) break;
n += (x * y);
}
cout << n << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int t;
std::cin >> t;
while (t--) {
long long int a1, k;
std::cin >> a1 >> k;
long long int ans = a1;
for (int i = 0; i < k - 1; i++) {
long long int maxi = 0, mini = 9, a = ans;
while (a > 0) {
maxi = std::max(a % 10, maxi);
mini = std::min(a % 10, mini);
a /= 10;
}
ans += maxi * mini;
if (mini == 0) break;
}
std::cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
long long a, k;
cin >> a >> k;
for (long long j = 1; j < k; j++) {
int s = to_string(a).size();
long long b = a;
vector<int> v(s);
for (int m = 0; m < s; m++) {
v[m] = b % 10;
b /= 10;
}
sort(v.begin(), v.end());
if (!v[0]) break;
a += v[0] * v[s - 1];
}
cout << a << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
int minn, maxn;
void check(long long x) {
minn = 11;
maxn = -1;
while (x != 0) {
minn = minn < x % 10 ? minn : x % 10;
maxn = maxn > x % 10 ? maxn : x % 10;
x /= 10;
}
}
int main() {
int t;
long long n, m;
scanf("%d", &t);
while (t--) {
scanf("%lld%lld", &n, &m);
for (long long i = 0; i < m - 1; i++) {
check(n);
if (minn == 0)
break;
else
n += minn * maxn;
}
printf("%lld\n", n);
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long add(long long n) {
long long mi = INT_MAX, ma = INT_MIN;
while (n > 0) {
mi = min(n % 10, mi);
ma = max(n % 10, ma);
n = n / 10;
}
return mi * ma;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
scanf("%d", &t);
while (t--) {
long long n, k;
scanf("%lld%lld", &n, &k);
k--;
while (k--) {
long long j = add(n);
n = n + j;
if (j == 0) {
break;
}
}
cout << n << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) {
long long a, k;
cin >> a >> k;
if (k == 1) {
cout << a << "\n";
} else {
bool flag = true;
for (int i = 0; i < k - 1; i++) {
set<int> st;
long long b = a;
while (1) {
st.insert(a % 10);
a /= 10;
if (a == 0) break;
}
if (*st.begin() == 0) {
cout << b << "\n";
flag = false;
break;
}
b += (*st.begin()) * (*--st.end());
a = b;
}
if (flag) cout << a << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long a, k;
cin >> a >> k;
for (int i = 1; i < k; i++) {
if (k == 1) {
cout << a << endl;
break;
}
int minv = 10;
int maxv = -1;
long long s = a;
while (s > 0) {
int temp = s % 10;
minv = min(minv, temp);
maxv = max(maxv, temp);
s = s / 10;
}
if (minv == 0) {
break;
}
a = a + minv * maxv;
}
cout << a << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int t;
cin >> t;
while (t--) {
long long a, k;
cin >> a >> k;
long long b = a;
long long mi = 10, ma = -1;
while (mi != 0 && k > 1) {
mi = 10, ma = -1;
b = a;
while (b) {
mi = min(mi, b % 10);
ma = max(ma, b % 10);
b /= 10;
}
a = a + mi * ma;
k--;
}
cout << a << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = (int)1e9 + 7;
const int MAXN = 1e5 + 12;
int t;
int main() {
ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
cin >> t;
while (t--) {
long long a, k;
cin >> a >> k;
if (k == 1) {
cout << a << endl;
continue;
}
k--;
while (k--) {
long long mx = -10, mn = 10;
long long cur = a;
while (cur) {
long long x = cur % 10;
cur /= 10;
mx = max(x, mx);
mn = min(x, mn);
}
if (mn == 0) break;
a += (mx * mn);
}
cout << a << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long getmax(long long x) {
long long a = 0;
while (x) {
a = max(a, x % 10);
x /= 10;
}
return a;
}
long long getmin(long long x) {
long long a = 10;
while (x) {
a = min(a, x % 10);
x /= 10;
}
return a;
}
int main() {
int t;
scanf("%d", &t);
while (t--) {
long long a, k;
scanf("%lld%lld", &a, &k);
for (long long i = 1; i <= k; i++) {
long long ma = getmax(a), mi = getmin(a);
if (i == k || mi == 0) {
printf("%lld\n", a);
break;
}
a = a + mi * ma;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
[[maybe_unused]] const int MOD = 1000000007;
[[maybe_unused]] const int INTMAX = numeric_limits<int>::max();
void writeln() { cout << "\n"; }
template <class T>
inline void print(T&& a);
template <class T>
inline void priws(T&& a);
template <class T>
inline void read(T& a);
template <class... Args>
inline void readln(Args&... args) {
(read(args), ...);
}
template <class H, class... T>
inline void writeln(H&& h, T&&... t) {
priws(h);
(print(t), ...);
writeln();
}
void run() {
unsigned long long a, k;
readln(a, k);
for (unsigned long long i = 1; i < k; ++i) {
int mn = 10;
int mx = -1;
auto t = a;
while (t) mn = min(mn, int(t % 10)), mx = max(mx, int(t % 10)), t /= 10;
if (mn == 0) break;
a += mn * mx;
}
writeln(a);
}
int main() {
ios_base::sync_with_stdio(false);
int t;
readln(t);
for (int i = 0; i < (int)(t); ++i) run();
cerr << fixed << setprecision(0)
<< "Execution time = " << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
template <class T1, class T2>
inline ostream& operator<<(ostream& os, pair<T1, T2> const& _a);
template <
typename T, typename D = decltype(*begin(declval<T>())),
typename enable_if<!is_same<T, basic_string<char>>::value>::type* = nullptr>
ostream& operator<<(ostream& os, T const& _a) {
auto it = begin(_a);
if (it != end(_a)) os << *it++;
while (it != end(_a))
os << "\n "[is_fundamental<typename T::value_type>::value] << *it++;
return os;
}
template <class T1, class T2>
inline ostream& operator<<(ostream& os, pair<T1, T2> const& _a) {
return os << _a.first << " " << _a.second;
}
template <class T1, class T2>
inline istream& operator>>(istream& is, pair<T1, T2>& _a) {
return is >> _a.first >> _a.second;
}
template <class T>
inline istream& operator>>(istream& is, vector<T>& _a) {
for (int i = 0; i < (int)(_a.size()); ++i) is >> _a[i];
return is;
}
template <class T>
inline void print(T&& _a) {
cout << " " << _a;
}
template <class T>
inline void priws(T&& _a) {
cout << _a;
}
template <class T>
inline void read(T& _a) {
cin >> _a;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int pro(long long int n) {
long long int min = 9, i;
long long int max = 0;
string s = to_string(n);
for (i = 0; i < s.size(); i++) {
if (s[i] - '0' < min) min = s[i] - '0';
if (s[i] - '0' > max) max = s[i] - '0';
}
return min * max;
}
int main() {
long long int n, k, i, t, x;
cin >> t;
while (t--) {
cin >> n >> k;
x = 1;
while (k > 1 && x) {
n = n + pro(n);
x = pro(n);
k--;
}
cout << n << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
bool chck(long long num) {
while (num > 0) {
if (num % 10 == 0) return true;
num /= 10;
}
return false;
}
pair<long long, long long> get(long long num) {
pair<long long, long long> p = make_pair(-1, 10);
while (num > 0) {
p.first = max(num % 10, p.first);
p.second = min(p.second, num % 10);
num /= 10;
}
return p;
}
void solve() {
long long n, k;
cin >> n >> k;
if (k == 1) {
cout << n << "\n";
return;
}
k--;
while (k) {
if (chck(n)) break;
pair<long long, long long> p = get(n);
n += (p.first) * (p.second);
k--;
}
cout << n << "\n";
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long fact[1000001];
long long inv[1000001];
long long primes[100007];
long long arr[1000007];
long long modPower(long long b, long long p) {
if (p == 0) return 1;
long long halfpow = modPower(b, p / 2);
long long toReturn = (halfpow * halfpow) % mod;
if (p % 2) toReturn = (toReturn * b) % mod;
return toReturn;
}
long long fastPower(long long b, long long p) {
if (p == 0) return 1;
long long ans = fastPower(b, p / 2);
ans = (ans * ans);
if (p % 2 != 0) ans = (ans * b);
return ans;
}
long long GcdRecursive(long long a, long long b) {
if (b == 0) return a;
return GcdRecursive(b, a % b);
}
long long modLCM(long long a, long long b) {
long long val = GcdRecursive(a, b);
long long tmp = ((a % mod) * (b % mod)) % mod;
long long finalVal = ((tmp % mod) * (arr[val] % mod)) % mod;
return finalVal;
}
long long LCM(long long a, long long b) { return (a * b) / GcdRecursive(a, b); }
void move1step(long long& a, long long& b, long long q) {
long long c = a - q * b;
a = b;
b = c;
}
long long GcdIterative(long long a, long long b) {
while (b) move1step(a, b, a / b);
return a;
}
void pre(long long n) {
fact[0] = 1;
inv[0] = 1;
for (long long i = 1; i <= n; i++) {
fact[i] = (i * fact[i - 1]) % mod;
inv[i] = modPower(fact[i], mod - 2);
arr[i] = modPower(i, mod - 2);
}
}
long long npr(long long n, long long r) {
return ((fact[n] * inv[n - r]) % mod);
}
long long ncr(long long n, long long r) {
return ((((fact[n] * inv[n - r]) % mod) * inv[r]) % mod);
}
void sieve(long long val) {
memset(primes, 1, sizeof primes);
primes[0] = primes[1] = false;
for (int i = 2; i <= val; i++) {
if (primes[i]) {
for (int j = i * i; j <= val; j += i) {
primes[j] = 0;
}
}
}
}
long double dot(complex<long double> a, complex<long double> b) {
return (conj(a) * b).real();
}
long double cross(complex<long double> a, complex<long double> b) {
return (conj(a) * b).imag();
}
long double angleBetVec(complex<long double> a, complex<long double> b) {
long double d = dot(a, b);
d /= abs(a);
d /= abs(b);
return acos(d) * 180 / acos(-1);
}
complex<long double> RotateAbout(complex<long double> a,
complex<long double> about,
long double angle) {
return (a - about) * polar((long double)1.0, angle) + about;
}
const long long MOD = 998244353;
const long long N = 1e5 + 7;
const long long inf = 1e18 + 5;
long long n, k, t = 0;
long long brr[1007];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ios_base::sync_with_stdio(0);
cin >> t;
while (t--) {
string a;
cin >> a >> k;
long long brr[10007];
brr[0] = stoll(a);
long long x = 10000;
long long mxIndex = 0;
for (int i = 1; i < x + 1; i++) {
char mx = '0', mn = '9';
for (auto e : a) mx = max(mx, e), mn = min(mn, e);
long long val = stoll(a) + ((mx - '0') * (mn - '0'));
brr[i] = val;
a = to_string(val);
if (brr[i] == brr[i - 1]) {
mxIndex = i;
break;
}
}
if (k > 10000) k = mxIndex + 1;
cout << brr[k - 1] << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 20;
int s[maxn], len, t1, t2;
void solve_m() {
t1 = -1, t2 = 10;
for (int i = 1; i <= len; i++) {
if (t1 < s[i]) {
t1 = s[i];
}
if (t2 > s[i]) t2 = s[i];
}
}
void solve(int x, int cnt) {
int remain = (s[cnt] + x) % 10;
int pass = (s[cnt] + x) / 10;
s[cnt] = remain;
while (pass) {
cnt++;
remain = (pass + s[cnt]) % 10;
pass = (pass + s[cnt]) / 10;
s[cnt] = remain;
}
len = max(len, cnt);
}
int main() {
int t;
scanf("%d", &t);
while (t--) {
long long num, k;
scanf("%lld%lld", &num, &k);
k--;
memset(s, 0, sizeof(s));
int temp = 0;
while (num) {
s[++temp] = num % 10;
num /= 10;
}
len = temp;
while (k--) {
solve_m();
int ans, cnt = 1;
ans = t1 * t2;
if (ans == 0) break;
while (ans) {
solve(ans % 10, cnt);
ans /= 10;
cnt++;
}
}
for (int i = len; i >= 1; i--) {
printf("%d", s[i]);
}
printf("\n");
}
}
|
#include <bits/stdc++.h>
using namespace std;
inline int sum(long long a) {
int mn, mx, curr;
mn = a % 10;
mx = a % 10;
while (a) {
curr = a % 10;
if (curr < mn) mn = curr;
if (curr > mx) mx = curr;
a /= 10;
}
return mn * mx;
}
int main() {
int n, t, j;
long long a, k, i;
cin >> t;
while (t--) {
cin >> a >> k;
for (i = 1; i <= min(k - 1, 2000LL); i++) {
a += sum(a);
}
cout << a << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long read() {
long long x = 0, f = 1, ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) x = (x << 1) + (x << 3) + ch - '0', ch = getchar();
return x * f;
}
int n;
long long a1, k;
long long get_min(long long x) {
register long long ans = 9;
while (x) {
ans = min(ans, x % 10);
x /= 10;
}
return ans;
}
long long get_max(long long x) {
register long long ans = 0;
while (x) {
ans = max(ans, x % 10);
x /= 10;
}
return ans;
}
signed main() {
n = read();
while (n--) {
a1 = read(), k = read() - 1;
while (k--) {
register long long mn = get_min(a1), mx = get_max(a1);
if (!mn || !mx) break;
a1 = 1ll * a1 + 1ll * mn * mx;
}
printf("%lld\n", a1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
double startTime;
double getCurrentTime() {
return ((double)clock() - startTime) / CLOCKS_PER_SEC;
}
void suraj() {
unsigned long long a, k;
cin >> a >> k;
for (int i = 1; i < k; i++) {
unsigned long long b = a;
int mx = 0;
int mn = 9;
while (b > 0) {
mn = min(int(b % 10), mn);
mx = max(int(b % 10), mx);
b = b / 10;
if (mn == 0) {
cout << a << "\n";
return;
}
}
a = a + mn * mx;
}
cout << a << "\n";
}
int main() {
startTime = (double)clock();
int t;
cin >> t;
while (t--) suraj();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int arr[2000000];
bool compare(long long int a, long long int b) { return a > b; }
long long int ans[2000000];
bool checkzero(long long int n) {
while (n > 0) {
if (n % 10 == 0) return true;
n = n / 10;
}
return false;
}
pair<long long int, long long int> checkminmax(long long int n) {
long long int m = LONG_LONG_MAX;
long long int M = LONG_LONG_MIN;
while (n > 0) {
M = max(M, n % 10);
m = min(m, n % 10);
n /= 10;
}
return make_pair(m, M);
}
int main() {
long long int t;
cin >> t;
while (t--) {
long long int n, k;
cin >> n >> k;
long long int newn;
newn = n;
while (k > 1) {
newn = n + checkminmax(n).first * checkminmax(n).second;
if (newn == n)
break;
else {
n = newn;
}
k--;
}
cout << newn << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, k, mi, ma, ans, test, digit, t;
cin >> t;
while (t--) {
cin >> a >> k;
ans = a;
for (int i = 1; i < k; ++i) {
mi = 10;
ma = 0;
test = ans;
a = ans;
while (a > 0) {
digit = a % 10;
mi = min(mi, digit);
ma = max(ma, digit);
a = a / 10;
}
ans = test + (mi * ma);
if (mi == 0) break;
}
cout << ans << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
scanf("%d", &t);
while (t--) {
long long n, k, x;
scanf("%lld%lld", &n, &k);
if (k == 1)
printf("%lld\n", n);
else {
long long mx = 0, mn = 10;
x = n;
while (n) {
mn = min(mn, n % 10);
mx = max(mx, n % 10);
n /= 10;
}
n = x + mn * mx;
while (k > 2) {
k--;
mn = 10;
mx = 0;
x = n;
while (n) {
mn = min(mn, n % 10);
mx = max(mx, n % 10);
n /= 10;
}
n = x + mn * mx;
if (!mn) break;
}
printf("%lld\n", n);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long n, k;
cin >> n >> k;
long long count = 0;
while (count < k - 1) {
long long mn = 10, mx = 0;
long long a = n;
while (a) {
long long b = a % 10;
mn = min(mn, b);
mx = max(mx, b);
a /= 10;
}
n += mn * mx;
count++;
if (mn == 0) break;
}
cout << n << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t, r, i = 0, y = 1;
int a[30];
long long int n, k, x;
cin >> t;
while (t--) {
cin >> n >> k;
{
while (k--) {
long long int b = n;
while (b > 0) {
r = b % 10;
b = b / 10;
a[i] = r;
i++;
if (r == 0) {
y = 0;
break;
}
}
sort(a, a + i);
n = n + a[0] * a[i - 1];
x = a[0] * a[i - 1];
if (y == 0) {
i = 0;
break;
}
i = 0;
}
n = n - x;
cout << n << "\n";
y = 1;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, k;
void In() { cin >> n >> k; }
void Solve() {
k--;
while (k--) {
int largest = INT_MIN, smallest = INT_MAX;
for (long long copy = n; copy; copy /= 10) {
int r = copy % 10;
largest = max(r, largest);
smallest = min(r, smallest);
}
if (largest == 0 || smallest == 0) return;
n += largest * smallest;
}
}
void Out() { cout << n << '\n'; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
cin >> t;
while (t--) {
In();
Solve();
Out();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int mak(long long int n) {
int m = 0;
while (n) {
if (m < (n % 10)) {
m = (n % 10);
}
n /= 10;
}
return m;
}
int min(long long int n) {
int m = 9;
while (n) {
if (m > (n % 10)) {
m = (n % 10);
}
n /= 10;
}
return m;
}
int main() {
int T;
cin >> T;
while (T--) {
long long int k, d, e, a;
cin >> a >> k;
for (long long i = 1; i < k; i++) {
d = mak(a);
e = min(a);
if (d && e) {
a += (d * e);
} else
break;
}
cout << a << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int main() {
ios::sync_with_stdio(false);
int T;
cin >> T;
while (T--) {
long long a1, k;
cin >> a1 >> k;
k -= 1;
while (k--) {
long long temp = a1;
long long mi = 0x3f3f3f3f, ma = -1;
while (temp) {
mi = min(temp % 10, mi);
ma = max(temp % 10, ma);
temp /= 10;
}
a1 += (mi * ma);
if (mi == 0) break;
}
cout << a1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long SIZE = 100000;
const int INF = 0x3f3f3f3f;
const long long ll_INF = 0x3f3f3f3f3f3f3f3f;
const long double PI = acos(-1);
const long long MAXN = numeric_limits<long long>::max();
const long long MAX = 2000000;
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
return (a.first > b.first);
}
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
bool isprime(long long n) {
if (n <= 1) return false;
for (long long i = 2; i < n; i++)
if (n % i == 0) return false;
return true;
}
vector<long long> prime;
long long a[MAX];
void SOE() {
memset(a, 1, sizeof(a));
for (long long i = 2; i * i <= MAX; i++) {
if (a[i])
for (long long j = i * i; j <= MAX; j += i) {
a[j] = 0;
}
}
for (long long i = 2; i < MAX; i++)
if (a[i]) prime.push_back(i);
}
map<long long, long long> powers;
vector<long long> PrimeFactors(long long n) {
vector<long long> v;
if (n % 2 == 0) {
v.push_back(2);
}
while (n % 2 == 0) {
n = n / 2;
powers[2]++;
}
for (long long i = 3; i <= sqrt(n); i++) {
if (n % i == 0) v.push_back(i);
while (n % i == 0) {
n = n / i;
powers[i]++;
}
}
if (n > 2) {
v.push_back(n);
powers[n]++;
}
return v;
}
long long FastModExpo(long long x, long long y, long long m) {
long long res = 1;
while (y > 0) {
if (y & 1) {
res = (res * x) % m;
}
x = (x * x) % m;
y = y >> 1;
}
return res;
}
long long diffbits(long long x, long long y) {
long long a = x ^ y;
long long ans = __builtin_popcountll(a);
return ans;
}
long long vis[100001];
vector<long long> adj[100001];
void dfs(long long u) {
vis[u] = 1;
for (auto x : adj[u]) {
if (vis[x] == 0) dfs(x);
}
}
pair<long long, long long> digits(long long num) {
long long mn = MAX, mx = 0;
while (num > 0) {
long long rem = num % 10;
mn = min(mn, rem);
mx = max(mx, rem);
num /= 10;
}
return {mn, mx};
}
void solve() {
long long a1, k;
cin >> a1 >> k;
long long prev = a1, nxt = 0;
for (long long i = 2; i <= k; i++) {
pair<long long, long long> p = digits(prev);
nxt = prev + (p.first * p.second);
if (nxt == prev) break;
prev = nxt;
}
cout << prev << endl;
}
int main() {
std::ios::sync_with_stdio(false);
int t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
pair<int, int> findMaxMin(long long int a) {
int mini = 100;
int maxi = -100;
while (a > 0) {
int digit = a % 10;
if (digit > maxi) {
maxi = digit;
}
if (digit < mini) {
mini = digit;
}
a = a / 10;
}
return make_pair(maxi, mini);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
long long int an, k;
cin >> an >> k;
long long int prev = an;
long long int next = an;
for (long long int i = 2; i <= k; i++) {
pair<int, int> mxmn = findMaxMin(prev);
next = prev + (mxmn.first * mxmn.second);
if (prev == next) break;
prev = next;
}
cout << next << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mindigit(long long n) {
long long smallest = 9;
while (n) {
long long r = n % 10;
smallest = min(r, smallest);
if (smallest == 0) {
return 0;
}
n /= 10;
}
return smallest;
}
long long maxdigit(long long p) {
long long largest = 0;
while (p) {
long long q = p % 10;
largest = max(q, largest);
if (largest == 9) {
return 9;
}
p /= 10;
}
return largest;
}
int main() {
long long t, a, k;
cin >> t;
while (t--) {
cin >> a >> k;
while (k > 1) {
if (mindigit(a) * maxdigit(a) == 0) break;
a += mindigit(a) * maxdigit(a);
k--;
}
cout << a << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
pair<long long int, long long int> rec(long long int n) {
long long int mini = 1e18, maxi = -1;
while (n) {
mini = min(mini, n % 10);
maxi = max(maxi, n % 10);
n /= 10;
}
return {mini, maxi};
}
int main() {
long long int t;
cin >> t;
while (t--) {
long long int n, k;
cin >> n >> k;
k--;
while (k--) {
pair<long long int, long long int> x = rec(n);
if (x.first == 0) break;
n += (x.first * x.second);
}
cout << n << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
cin >> t;
while (t--) {
long long int n, k;
cin >> n >> k;
long long int p, flag = 0;
k--;
while (k--) {
long long int maxx = INT_MIN, minn = INT_MAX;
p = n;
long long int rem;
while (p > 0) {
rem = p % 10;
maxx = max(rem, maxx);
minn = min(rem, minn);
if (minn == 0) {
flag = 1;
break;
}
p /= 10;
}
n = n + (maxx * minn);
if (flag == 1) break;
}
cout << n << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int additional(long long int n) {
int min = INT_MAX, max = INT_MIN;
while (n) {
int x = n % 10;
if (x < min) min = x;
if (x > max) max = x;
n /= 10;
}
return min * max;
}
void solve() {
long long int n, k;
cin >> n >> k;
while (--k) {
long long int ad = additional(n);
if (ad == 0) break;
n += ad;
}
cout << n << endl;
}
int main() {
int t;
cin >> t;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long getDigits(long long n) {
long long lar = 0;
long long smal = 9;
while (n != 0) {
long long r = n % 10;
lar = max(r, lar);
smal = min(r, smal);
n = n / 10;
}
return lar * smal;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
long long t;
cin >> t;
while (t--) {
long long n, k;
cin >> n >> k;
bool flag = 1;
for (long long i = 1; i < k; i++) {
long long ans = getDigits(n);
if (ans == 0) {
cout << n << '\n';
flag = 0;
break;
}
n = n + ans;
}
if (flag) cout << n << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
while (t--) {
long long a, k;
cin >> a >> k;
if (k >= 2)
for (long long i = 2; i <= k; i++) {
long long minn = 9, maxx = 0;
long long b = a;
while (b > 0) {
maxx = max(b % 10, maxx);
minn = min(b % 10, minn);
b /= 10;
if (minn == 0) break;
}
if (minn == 0)
break;
else
a += minn * maxx;
}
cout << a << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int t, minn, maxx, c;
long long n, k;
cin >> t;
while (t--) {
cin >> n >> k;
k--;
maxx = 1;
minn = n % 10;
while (minn != 0) {
maxx = 1;
minn = n % 10;
if (k == 0) break;
long long N = n;
while (N) {
c = N % 10;
minn = min(minn, c);
maxx = max(maxx, c);
N /= 10;
}
n += (minn * maxx);
k--;
}
cout << n << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using namespace std;
long long zh = 1;
long long gg(long long n) {
long long minn = 10;
long long maxx = 0;
for (int i = 1;; i++) {
long long a = n % 10;
n = n / 10;
minn = min(minn, a);
maxx = max(maxx, a);
if (a == 0) {
zh = 0;
break;
}
if (n <= 0) break;
}
return maxx * minn;
}
int main() {
int t;
cin >> t;
while (t--) {
zh = 1;
long long a, k;
cin >> a >> k;
long long yy = 0;
for (long long i = 2; i <= k; i++) {
a += gg(a);
if (zh == 0) break;
}
cout << a << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <class c>
struct rge {
c b, e;
};
template <class c>
rge<c> range(c i, c j) {
return rge<c>{i, j};
}
template <class c>
auto dud(c* x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
template <class c>
debug& operator<<(const c&) {
return *this;
}
};
long long add(long long a) {
long long mx = 0, mn = 10;
long long cp = a;
while (cp > 0) {
mx = max(cp % 10, mx);
mn = min(cp % 10, mn);
if (cp % 10 == 0 && cp > 0) {
break;
}
cp /= 10;
}
return mn * mx;
}
void solve() {
long long a, k;
cin >> a >> k;
while (k > 1) {
long long last_a = a;
long long p = add(a);
if (p == 0) {
break;
}
a += p;
k--;
}
cout << a << '\n';
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long conv(string s) {
long long tmp = 0, mul = 1;
for (int i = s.size() - 1; i >= 0; --i) {
tmp += (s[i] - '0') * mul;
mul *= 10;
}
return tmp;
}
string convs(long long tmpl) {
string tmp;
while (tmpl > 0) {
long long r = tmpl % 10;
char c = r + '0';
tmp.push_back(c);
tmpl /= 10;
}
reverse(tmp.begin(), tmp.end());
return tmp;
}
void solve() {
string s;
long long k, m, M;
cin >> s >> k;
for (int i = 0; i < k - 1; ++i) {
m = 1e18, M = 0;
string tmp = s;
sort(tmp.begin(), tmp.end());
long long tmpl = conv(s);
if (tmp[0] == '0') break;
tmpl += (tmp[0] - '0') * (tmp[tmp.size() - 1] - '0');
s.clear();
s = convs(tmpl);
}
cout << s << '\n';
return;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long a, k, maxn = 0, minn = 10;
cin >> a >> k;
if (k == 1) {
cout << a << endl;
} else {
k--;
long long a1 = a;
for (; k > 0; k--) {
maxn = 0, minn = 10;
while (a1 != 0) {
if (minn > a1 % 10) minn = a1 % 10;
if (maxn < a1 % 10) maxn = a1 % 10;
a1 /= 10;
}
if (minn == 0) {
cout << a << endl;
break;
}
a1 = a + minn * maxn;
a = a1;
}
if (minn != 0) {
cout << a << endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int min1(long long int a) {
long long int mx = 0, mi = 10;
while (a) {
mx = max(mx, a % 10);
mi = min(mi, a % 10);
a /= 10;
}
return mi * mx;
}
int main() {
int t;
cin >> t;
while (t--) {
long long int a, k;
cin >> a >> k;
long long int tem = min1(a);
while (--k && tem != 0) {
a = a + tem;
tem = min1(a);
}
cout << a << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long n, k;
cin >> n >> k;
k--;
while (k--) {
string x = to_string(n);
sort(x.begin(), x.end());
if (x[0] == '0') break;
n = n + (x[0] - '0') * (x[x.size() - 1] - '0');
}
cout << n << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int power(int a, int b, int m, int ans = 1) {
for (; b; b >>= 1, a = 1LL * a * a % m)
if (b & 1) ans = 1LL * ans * a % m;
return ans;
}
int main() {
int t;
cin >> t;
while (t--) {
long long a, k;
cin >> a >> k;
for (int i = 1; i <= min(k - 1, 1000LL); i++) {
int mi = 10, mx = 0;
long long t = a;
while (t) {
int p = t % 10;
mi = min(mi, p);
mx = max(mx, p);
t /= 10;
}
a += mi * mx;
}
cout << a << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long a1, k, mx = INT_MIN, mn = INT_MAX, res;
cin >> a1 >> k;
res = a1;
vector<long long> a;
while (a1) {
mx = max(a1 % 10, mx);
mn = min(a1 % 10, mn);
a1 /= 10;
}
while (k-- > 1) {
if (mn == 0) break;
res += mn * mx;
mx = INT_MIN;
mn = INT_MAX;
long long t = res;
while (t) {
mx = max(t % 10, mx);
mn = min(t % 10, mn);
t /= 10;
}
}
cout << res << endl;
}
int main() {
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y, long long int p) {
long long int res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
long long int modInverse(long long int A, long long int M) {
return power(A, M - 2, M);
}
void solve() {
long long int n, k;
cin >> n >> k;
vector<long long int> v;
v.push_back(0);
v.push_back(n);
while (true) {
string s = to_string(n);
sort(s.begin(), s.end());
long long int sum = ((s[0] - '0') * (s.back() - '0'));
n += sum;
if (sum == 0) break;
v.push_back(n);
}
if (v.size() > k)
cout << v[k] << "\n";
else
cout << v.back() << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
for (int i = 1; i <= t; i++) solve();
return 0;
}
|
#include <bits/stdc++.h>
int minDig(uint64_t n) {
int k = n % 10, min = k;
n /= 10;
while (n != 0) {
k = n % 10;
if (k <= min) min = k;
n /= 10;
}
return min;
}
int maxDig(uint64_t n) {
int k = n % 10, max = k;
n /= 10;
while (n != 0) {
k = n % 10;
if (k >= max) max = k;
n /= 10;
}
return max;
}
int searchzero(uint64_t n) {
while (n != 0) {
if (n % 10 == 0) return 1;
n /= 10;
}
return 0;
}
int main(void) {
int t;
uint64_t a, k;
scanf("%d", &t);
while (t--) {
scanf("%llu %llu", &a, &k);
for (uint64_t i = 1; i < k; i++) {
a += (minDig(a) * maxDig(a));
if (searchzero(a) == 1) break;
}
printf("%llu\n", a);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 0x3f3f3f3f3f3f3f3fll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long t;
cin >> t;
while (t--) {
long long n, k;
cin >> n >> k;
k--;
while (k--) {
long long m = 12, M = -1;
long long num = n;
while (num) {
m = min(m, num % 10);
M = max(M, num % 10);
num /= 10;
}
if (m == 0) break;
n += m * M;
}
cout << n << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long int a, k, b, m = 9, m1 = 0;
cin >> a >> k;
b = a;
while (k > 1) {
m = 9, m1 = 0;
while (b > 0) {
long long int i = b % 10;
m = min(m, i);
m1 = max(m1, i);
b /= 10;
}
if (m == 0) break;
a += m * m1;
b = a;
k--;
}
cout << a << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T>
void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
__print(t);
if (sizeof...(v)) cerr << ", ";
_print(v...);
}
namespace math {
template <typename T>
T lcm(T x, T y) {
return x / __gcd(x, y) * y;
}
template <typename T>
T gcdall(T arr[], int l, int r) {
T res = arr[l];
for (int i = l + 1; i < r; i++) {
res = __gcd(res, arr[i]);
}
return res;
}
template <typename T>
T lcmall(T arr[], int l, int r) {
T res = arr[l];
for (int i = l + 1; i < r; i++) {
res = lcm(res, arr[i]);
}
return res;
}
template <typename T, typename V>
V pow(T a, T b, V mod) {
V res = 1;
V A = a, B = b;
while (B > 0) {
if (B & 1) res = (res * A) % mod;
A = (A * A) % mod;
B >>= 1;
}
return res;
}
template <typename T>
vector<T> listfac(T x) {
vector<T> res;
for (T i = 2; i * i <= x; i++) {
if (!(x % i)) {
res.push_back(i);
if (x / i != i) res.push_back(x / i);
}
}
sort(res.begin(), res.end());
return res;
}
bool isprime(long long x) {
if (x == 2 or x == 3) return true;
if (x < 5) return false;
for (int i = 2; i * i <= x; i++) {
if (x % i == 0) return false;
}
return true;
}
template <typename T>
void cntfac(T x, int cnt[]) {
while (x % 2 == 0) {
x /= 2;
cnt[2]++;
}
for (T i = 3; i * i <= x; i++) {
while (x % i == 0) {
cnt[i]++;
x /= i;
}
}
if (x > 1) cnt[x]++;
}
inline void buildfac(int n, int f[], int fi[], int mod) {
vector<int> temp(n + 1);
temp[0] = 1;
temp[1] = 1;
for (int i = 2; i <= n; i++)
temp[i] = (temp[mod % i] * (mod - mod / i)) % mod;
fi[0] = 1;
fi[0] = 1;
for (int i = 1; i <= n; i++) f[i] = (1LL * i * f[i - 1]) % mod;
for (int i = 1; i <= n; i++) fi[i] = (temp[i] * fi[i - 1]) % mod;
}
inline int ncr(int n, int r, int mod, int f[], int fi[]) {
return (1LL * ((1LL * f[n] * fi[r]) % mod) * fi[n - r]) % mod;
}
} // namespace math
long long n, k;
long long solve(long long n) {
vector<int> cnt(10, 0);
while (n) {
cnt[n % 10]++;
n /= 10;
}
int minn, maxx;
for (int i = 0; i < 10; i++) {
if (cnt[i]) {
minn = i;
break;
}
}
for (int i = 9; i >= 0; i--) {
if (cnt[i]) {
maxx = i;
break;
}
}
return minn * maxx;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
long long n, k;
cin >> n >> k;
long long temp = solve(n);
int cnt = 1;
while (temp and cnt < k) {
n += temp;
cnt++;
temp = solve(n);
}
cout << n << '\n';
}
}
|
#include <bits/stdc++.h>
namespace FastIO {
bool IOerror = 0;
inline char nc() {
static char buf[100000], *p1 = buf + 100000, *pend = buf + 100000;
if (p1 == pend) {
p1 = buf;
pend = buf + fread(buf, 1, 100000, stdin);
if (pend == p1) {
IOerror = 1;
return -1;
}
}
return *p1++;
}
inline bool blank(char ch) {
return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
}
template <class T>
inline bool read(T &x) {
bool sign = 0;
char ch = nc();
x = 0;
for (; blank(ch); ch = nc())
;
if (IOerror) return false;
if (ch == '-') sign = 1, ch = nc();
for (; ch >= '0' && ch <= '9'; ch = nc()) x = x * 10 + ch - '0';
if (sign) x = -x;
return true;
}
template <class T, class... U>
bool read(T &h, U &...t) {
return read(h) && read(t...);
}
}; // namespace FastIO
using namespace std;
using namespace FastIO;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const long long INF = 0x3f3f3f3f;
const long long inf = 1e18;
long long exgcd1(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
long long d = exgcd1(b, a % b, x, y);
long long t = x;
x = y;
y = t - y * (a / b);
return d;
}
long long exgcd2(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
long long d = exgcd2(b, a % b, x, y);
long long t = x;
x = y;
y = t - y * (a / b);
return d;
}
long long exgcd3(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
long long d = exgcd3(b, a % b, x, y);
long long t = x;
x = y;
y = t - y * (a / b);
return d;
}
long long exgcd4(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
long long d = exgcd4(b, a % b, x, y);
long long t = x;
x = y;
y = t - y * (a / b);
return d;
}
long long exgcd5(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
long long d = exgcd5(b, a % b, x, y);
long long t = x;
x = y;
y = t - y * (a / b);
return d;
}
long long exgcd6(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
long long d = exgcd6(b, a % b, x, y);
long long t = x;
x = y;
y = t - y * (a / b);
return d;
}
long long exgcd7(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
long long d = exgcd7(b, a % b, x, y);
long long t = x;
x = y;
y = t - y * (a / b);
return d;
}
signed main() {
long long t;
cin >> t;
while (t--) {
long long n, k;
cin >> n >> k;
for (long long i = 1; i <= k - 1; i++) {
long long tmp = n;
long long mi = inf, ma = -1;
while (tmp) {
long long x = tmp % 10;
mi = min(x, mi);
ma = max(ma, x);
tmp /= 10;
}
if (mi == 0) {
break;
} else {
n += ma * mi;
}
}
cout << n << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int tt;
cin >> tt;
while (tt--) {
long long int a, k, temp, r;
vector<long long int> vec;
cin >> a >> k;
k--;
while (k--) {
temp = a;
while (temp > 0) {
r = temp % 10;
vec.push_back(r);
temp /= 10;
}
sort(vec.begin(), vec.end());
a = a + vec[0] * vec[vec.size() - 1];
vec.clear();
if (vec[0] == 0) break;
}
cout << a << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
const int N = (int)1e5 + 10;
void TimeExecution() {
cout << "\n\n===>> Time Execution: " << clock() / (double)1000 << " sec(s).";
}
long long sqr(long long a) { return ((a % MOD) * (a % MOD)) % MOD; }
long long msub(long long a, long long b) { return ((a - b) % MOD + MOD) % MOD; }
long long madd(long long a, long long b) { return (a + b) % MOD; }
long long mmul(long long a, long long b) {
return ((a % MOD) * (b % MOD)) % MOD;
}
int t;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> t;
while (t--) {
long long a, k;
cin >> a >> k;
long long t;
for (int i = (1); i <= (k - 1); i++) {
long long mx = 0;
long long mn = 10;
t = a;
while (t) {
mx = max(mx, t % 10);
mn = min(mn, t % 10);
t /= 10;
}
if (mx == 0 || mn == 0) break;
a += mx * mn;
}
cout << a << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
pair<int, int> getMinMax(long long n) {
long long mn = 10, mx = 0;
while (n > 0) {
long long r = n % 10;
mn = min(mn, r);
mx = max(mx, r);
n /= 10;
}
return {mn, mx};
}
int main() {
int t;
cin >> t;
while (t--) {
long long n, k;
cin >> n >> k;
for (long long i = 1; i < k; i++) {
pair<int, int> m = getMinMax(n);
long long nn = n + m.first * m.second;
if (n == nn) {
break;
}
n = nn;
}
cout << n << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long Add(long long x) {
long long m1 = 10, m2 = 0;
while (x > 0) {
long long y = x % 10;
x /= 10;
m1 = min(m1, y);
m2 = max(m2, y);
}
return m1 * m2;
}
int main() {
int t;
cin >> t;
while (t--) {
long long x, k;
cin >> x >> k;
k--;
while (k--) {
long long y = Add(x);
if (y == 0) break;
x += y;
}
printf("%lld\n", x);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool sieve[100007];
void sieve_make() {
memset(sieve, true, sizeof(sieve));
sieve[0] = sieve[1] = false;
for (long long i = 2; i * i <= 100006; i++) {
if (sieve[i]) {
for (long long j = 2 * i; j <= 100006; j += i) sieve[j] = false;
}
}
}
long long max(long long a, long long b) {
if (a > b) return a;
return b;
}
long long min(long long a, long long b) {
if (a < b) return a;
return b;
}
long long modexp(long long a, long long b, long long c) {
if (a == 0) return 0;
if (b == 0) return 1;
long long ans;
if (b % 2 == 0) {
long long small = modexp(a, b / 2, c);
ans = (small * small) % c;
} else {
long long small = modexp(a, b - 1, c);
ans = (a % c);
ans = (small * ans) % c;
}
return (ans + c) % c;
}
string rev(string s) {
reverse(s.begin(), s.end());
return s;
}
bool sign(long long x) {
if (x > 0) return true;
return false;
}
long long base3(string b) {
long long ans = 0, c = 0;
for (long long i = b.length() - 1; i >= 0; i--) {
ans += (b[i] - '0') * pow(3, c++);
}
return ans;
}
int32_t main() {
ios::sync_with_stdio(NULL);
cin.tie(NULL);
cout.tie(NULL);
long long t;
cin >> t;
while (t--) {
string n;
long long k;
cin >> n >> k;
for (long long i = 2; i <= k; i++) {
long long mn = INT_MAX, mx = INT_MIN;
for (long long i = 0; i < n.length(); i++) {
if (n[i] - '0' < mn) {
mn = n[i] - '0';
}
if (n[i] - '0' > mx) {
mx = n[i] - '0';
}
}
n = to_string(stoll(n) + mn * mx);
if (mn == 0) break;
}
cout << n << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
unsigned long long getNext(unsigned long long &a, unsigned long long &n,
unsigned long long &k) {
int maxd = 0;
int mind = 9;
unsigned long long b = a;
while (b) {
int r = b % 10;
if (maxd < r) {
maxd = r;
}
if (mind > r) {
mind = r;
}
b = b / 10;
}
n++;
a += maxd * mind;
if (n < k && mind != 0) {
getNext(a, n, k);
}
return a;
}
int main() {
int t;
cin >> t;
for (int _ = 0; _ < t; _++) {
unsigned long long a, k;
cin >> a >> k;
unsigned long long n = 1;
if (k == 1) {
cout << a << endl;
} else {
cout << getNext(a, n, k) << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int getsum(long long int n) {
int mini = INT_MAX, maxi = INT_MIN;
while (n) {
int temp = n % 10;
n = n / 10;
maxi = max(maxi, temp);
mini = min(mini, temp);
}
return maxi * mini;
}
int main() {
int t;
cin >> t;
while (t--) {
long long int n, k;
cin >> n >> k;
k--;
while (k--) {
long long int sum = getsum(n);
if (sum == 0) break;
n += sum;
}
cout << n << endl;
}
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
using namespace std;
const int N = 200003, mod = 1e9 + 7;
const long long inf = (1e18 + 11);
int add(long long x) {
int mi = 9, ma = 0, j;
while (x) {
j = x % 10;
mi = min(mi, j);
ma = max(ma, j);
x /= 10;
}
return mi * ma;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tc;
cin >> tc;
while (tc--) {
long long a, k;
cin >> a >> k;
long long x;
--k;
while (k--) {
x = add(a);
a += x;
if (!x) break;
}
cout << a << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long a, k;
cin >> a >> k;
for (long long i = 2; i <= k; i++) {
long long tmp = a, mn = 10, mx = -1;
while (tmp > 0) {
mn = min(tmp % 10, mn);
mx = max(tmp % 10, mx);
tmp /= 10;
}
if (mn == 0) break;
a += mn * mx;
}
cout << a << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int func(long long int a, long long int k) {
long long int temp = a, temp1 = a, minval = 1, maxval = 1, val = 1;
while ((val < k) && (minval != 0)) {
minval = 10, maxval = 0;
while (temp != 0) {
minval = min(minval, (temp % 10));
maxval = max(maxval, (temp % 10));
temp = temp / 10;
}
temp1 = temp1 + minval * maxval;
temp = temp1;
val++;
}
return temp;
}
int main() {
long long int t;
cin >> t;
while (t--) {
long long int a, k;
cin >> a >> k;
cout << func(a, k) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long seq(long long a, long long k) {
for (long long i = 0; i < k; i++) {
long long min = INT_MAX, max = INT_MIN;
long long temp = a;
while (a > 0) {
long long r = a % 10;
if (r > max) max = r;
if (r < min) min = r;
a = a / 10;
}
a = temp;
if (min == 0) {
break;
}
a = a + max * min;
}
return a;
}
int main() {
long long t;
cin >> t;
long long a, k, fn;
for (long long i = 0; i < t; i++) {
cin >> a >> k;
fn = seq(a, k - 1);
cout << fn << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
unsigned long long int min(unsigned long long int a1) {
int min = 9, max = 0;
while (a1 != 0) {
if (a1 % 10 > max) max = a1 % 10;
if (a1 % 10 < min) min = a1 % 10;
a1 = a1 / 10;
}
return max * min;
}
int main() {
int t;
scanf("%d", &t);
while (t--) {
unsigned long long int a1, k, i, sum = 0, d;
scanf("%llu %llu", &a1, &k);
for (i = 0; i < k; i++) {
if (i == 0) {
sum = a1;
continue;
}
d = min(sum);
if (d == 0)
break;
else
sum = sum + d;
}
printf("%llu\n", sum);
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long __gcd(long long a, long long b) {
if (a == 0) return b;
return __gcd(b % a, a);
}
pair<long long, long long> mx_mn(long long x) {
vector<long long> v;
while (x) {
v.push_back(x % 10);
x /= 10;
}
return make_pair(*max_element(v.begin(), v.end()),
*min_element(v.begin(), v.end()));
}
void solve() {
long long a, k, ans;
cin >> a >> k;
ans = a;
k--;
while (k--) {
pair<long long, long long> p = mx_mn(ans);
if (p.second == 0 || p.first == 0) break;
ans += p.first * p.second;
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e5;
const long long OO = 1e18;
const long long mod = 1e9 + 7;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
long long n, k;
cin >> n >> k;
for (long long i = 1; i < k; i++) {
long long M = 0, m = 10;
long long N = n;
while (N) {
long long aux = N % 10;
N /= 10;
M = max(M, aux), m = min(m, aux);
}
n += M * m;
if (M * m == 0) break;
}
cout << n << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
while (a--) {
unsigned long long int b, c;
cin >> b >> c;
unsigned long long int x = b;
unsigned long long int mini = LONG_MAX, maxi = 0;
unsigned long long int result = 0, cont = 0;
while (cont < c - 1) {
unsigned long long int y = x;
unsigned long int mini = LONG_MAX, maxi = 0;
while (y != 0) {
if (y % 10 > maxi) maxi = y % 10;
if (y % 10 < mini) mini = y % 10;
y = y / 10;
}
if (mini == 0) break;
result = x + mini * maxi;
x = x + mini * maxi;
cont++;
}
if (result == 0) {
cout << b << "\n";
} else
cout << result << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
template <typename T>
using pair2 = pair<T, T>;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
double startTime;
double getCurrentTime() {
return ((double)clock() - startTime) / CLOCKS_PER_SEC;
}
ll getAdd(ll x) {
ll m1 = 10, m2 = 0;
while (x > 0) {
ll y = x % 10;
x /= 10;
m1 = min(m1, y);
m2 = max(m2, y);
}
return m1 * m2;
}
int main() {
startTime = (double)clock();
int t;
scanf("%d", &t);
while (t--) {
ll x, k;
scanf("%lld%lld", &x, &k);
k--;
while (k--) {
ll y = getAdd(x);
if (y == 0) break;
x += y;
}
printf("%lld\n", x);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int mn(long long int x) {
long long int ans = 9;
while (x) {
ans = min(ans, x % 10);
x /= 10;
}
return ans;
}
long long int mx(long long int x) {
long long int ans = 0;
while (x) {
ans = max(ans, x % 10);
x /= 10;
}
return ans;
}
int main() {
int t;
cin >> t;
while (t--) {
long long int x, k;
cin >> x >> k;
for (long long int i = 1; i < k && mn(x) != 0; i++) {
x += mn(x) * mx(x);
}
cout << x << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, e, f, p, maxmax, minmin;
cin >> a;
while (a--) {
cin >> e >> f;
f--;
while (f--) {
p = e;
maxmax = -1;
minmin = 10;
while (p) {
maxmax = max(p % 10, maxmax);
minmin = min(p % 10, minmin);
p /= 10;
}
if (maxmax == 0 || minmin == 0) break;
e += maxmax * minmin;
}
cout << e << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long prod(long long n, long long &mx, long long &mn) {
mx = 0;
mn = n % 10;
while (n > 0) {
mx = max(mx, n % 10);
mn = min(mn, n % 10);
n = n / 10;
}
return mx * mn;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
;
int t;
cin >> t;
while (t--) {
long long n, k;
cin >> n >> k;
long long mx = 0, mn;
long long temp = n;
mn = temp % 10;
long long t1;
while (temp > 0) {
t1 = temp % 10;
mn = min(mn, t1);
mx = max(mx, t1);
temp = temp / 10;
}
if (k == 1) {
cout << n << endl;
continue;
}
k--;
while (k--) {
n = n + prod(n, mx, mn);
if (mx == 0 || mn == 0) break;
}
cout << n << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, k;
int t;
int get(long long n) {
long long mn = 9, mx = 0;
while (n) {
mn = min(mn, n % 10);
mx = max(mx, n % 10);
n /= 10;
}
return mn * mx;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> t;
for (int i = 0; i < t; ++i) {
cin >> n >> k;
for (int i = 1; i < min(10 * 1000ll, k); ++i) {
n += get(n);
}
cout << n << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t;
cin >> t;
while (t--) {
long long a1, k, n, r, max1, min1;
cin >> a1 >> k;
while (k > 1) {
n = a1;
max1 = -1, min1 = 10;
while (n != 0) {
r = n % 10;
min1 = min(min1, r);
max1 = max(max1, r);
n /= 10;
}
a1 += (max1 * min1);
if (min1 == 0 || max1 == 0) break;
k--;
}
cout << a1;
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
uint64_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
#pragma warning(disable : 4996)
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
for (auto& i : v) is >> i;
return is;
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> v) {
for (auto& i : v) cout << i << " ";
return os;
}
long long bp(long long a, long long n) {
long long res = 1;
while (n) {
if (n & 1) res *= a;
a *= a;
n >>= 1;
}
return res;
}
long long gcd(long long a, long long b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
vector<int> zf(string s) {
int n = (int)s.length();
vector<int> z(n);
for (int i = 1, l = 0, r = 0; i < n; ++i) {
if (i <= r) z[i] = min(r - i + 1, z[i - l]);
while (i + z[i] < n && s[z[i]] == s[i + z[i]]) ++z[i];
if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
}
return z;
}
long long mod(long long a, long long b) { return ((a % b) + b) % b; }
long long max_n(long long a) {
long long res = 0;
while (a) {
res = max(res, a % 10ll);
a /= 10ll;
}
return res;
}
long long min_n(long long a) {
long long res = 9;
while (a) {
res = min(res, a % 10ll);
a /= 10ll;
}
return res;
}
void solve() {
long long a, k;
cin >> a >> k;
for (long long i = 0; i < k - 1; i++) {
long long dif = min_n(a) * max_n(a);
if (!dif) break;
a += dif;
}
cout << a << "\n";
}
int main() {
cout.tie(0);
cin.tie(0);
ios_base::sync_with_stdio(false);
int t = 1;
cin >> t;
for (int c = 1; c < (int)(t + 1); c++) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
for (int i = 0; i < t; i++) {
long long a, b;
cin >> a >> b;
while (--b) {
long long p = a;
long long m1 = 0;
long long m2 = INT_MAX;
long long d;
while (p) {
d = p % 10;
if (d == 0) break;
m1 = max(m1, d);
m2 = min(m2, d);
p = p / 10;
}
if (d == 0)
break;
else
a = a + m1 * m2;
}
cout << a << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int maxD(long long a) {
int ans = 0;
while (a) {
ans = max(ans, (int)(a % 10));
a /= 10;
}
return ans;
}
int minD(long long a) {
int ans = 10;
while (a) {
ans = min(ans, (int)(a % 10));
a /= 10;
}
return ans;
}
int main() {
int t = 0;
cin >> t;
while (t--) {
long long a, k;
cin >> a >> k;
while (--k) {
int m = minD(a);
if (m == 0) break;
a += maxD(a) * m;
}
cout << a << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
long long product(long long n) {
int x, mini = 20, maxi = -1;
while (n != 0) {
x = n % 10;
if (x < mini) mini = x;
if (x > maxi) maxi = x;
n = n / 10;
}
return maxi * mini;
}
void solve() {
long long n, k, ans, x;
cin >> n >> k;
for (int i = 1; i < k; i++) {
x = product(n);
n = n + x;
if (x == 0) break;
}
cout << n << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void minmax(long long int a, int &m, int &mi) {
m = 0;
mi = 10;
while (a > 0) {
int r = a % 10;
m = max(m, r);
mi = min(mi, r);
a = a / 10;
}
}
int main() {
int t;
cin >> t;
while (t--) {
long long int a, k, prev, new1;
int m, mi;
cin >> a >> k;
prev = a;
new1 = a;
for (int i = 1; i < k; i++) {
minmax(prev, m, mi);
if (mi == 0) break;
new1 = prev + m * mi;
prev = new1;
}
cout << new1 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007LL;
int t, n;
long long a1, k;
int main() {
cin >> t;
for (int cas = 1; cas <= t; ++cas) {
scanf("%lld%lld", &a1, &k);
for (int i = 1; i < k; ++i) {
long long x = a1;
vector<int> ds;
ds.clear();
while (x) {
ds.push_back(x % 10);
x /= 10;
}
sort(ds.begin(), ds.end());
if (ds[0] == 0) break;
a1 += (long long)ds[0] * (long long)ds.back();
}
cout << a1 << endl;
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.