text
stringlengths 49
983k
|
|---|
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int value, source_value, count = 0;
cin >> source_value;
value = source_value;
while (value >= 10) {
count++;
string str = to_string(value);
int len = str.size(), max = 0;
for (int j = 1; j < len; j++) {
int temp1, temp2;
temp1 = stoi(str.substr(0, j));
temp2 = stoi(str.substr(j));
if (max < temp1 * temp2) {
max = temp1 * temp2;
}
}
value = max;
if (value == source_value) {
cout << -1 << endl;
goto TO;
}
}
cout << count << endl;
TO:;
}
return 0;
}
|
#include <iostream>
#include <cmath>
#include <unordered_set>
using namespace std;
int main(){
int n;
cin >> n;
for(int i=0; i<n; i++){
unordered_set<int> hold;
int x,max;
bool flag=true;
cin >> x;
while(x>=10){
max=0;
for(int j=10; j<x; j*=10){
int val = x/j * (x%j);
if(val > max){
max = val;
}
}
x=max;
if(!(hold.insert(x).second)){
flag=false;
break;
}
}
if(flag){
cout << hold.size() << endl;
}else{
cout << -1 << endl;
}
}
return 0;
}
|
#include<iostream>
using namespace std;
int modify(int n){
string s = to_string(n);
int ret = -1;
for(int i = 1; i < s.length(); i++){
string a = s.substr(0,i), b = s.substr(i);
ret = max(ret, stoi(a)*stoi(b));
}
return ret;
}
int main(){
int q;
cin >> q;
int n;
while(q-- > 0){
cin >> n;
int step = 0;
while(n > 9){
n = modify(n);
step++;
}
cout << step << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int Q, N, s, t, l, ans;
cin >> Q;
for (int i = 0; i < Q; ++i) {
cin >> N;
s = N;
ans = 0;
while (s > 9) {
++ans;
l = 10;
t = 0;
while (l < N) {
t = max(t, (s%l)*(s/l));
l *= 10;
}
s = t;
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int Q, N, C;
int digit(int n, int k = 0)
{
if (n == 0) { return k; }
return digit(n / 10, k + 1);
}
int power(int a, int b)
{
if (b == 0) { return 1; }
return power(a, b - 1) * a;
}
int main()
{
cin >> Q;
for (int i = 0; i < Q; i++)
{
cin >> N;
C = 0;
while (digit(N) > 1)
{
int Next_N = 0;
for (int j = 1; j < digit(N); j++)
{
int l = N / power(10, j);
int r = N % power(10, j);
Next_N = max(l * r, Next_N);
}
N = Next_N;
C++;
}
cout << C << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int power10(int x);
int GetDigit(int x);
int main(void)
{
int Q;
cin >> Q;
for(int i=0;i<Q;i++){
int N, cnt=0;
cin >> N;
while(N >= 10){
int Digit;
int maxi = 0;
Digit = GetDigit(N);
for(int j=1;j<Digit;j++){
int n, m;
n = N / power10(Digit-j);
m = N - n*power10(Digit-j);
maxi = max(maxi, n*m);
}
N = maxi;
cnt++;
}
cout << cnt << endl;
}
return 0;
}
int power10(int x){
if (x==0){
return 1;
}
return power10(x-1)*10;
}
int GetDigit(int x){
int ret=0;
int n=x;
do{
ret++;
}while((n/=10) != 0);
return ret;
}
|
#include <bits/stdc++.h>
#define int long long
#define double long double
#define INF 1e18
using namespace std;
int calc(int x) {
string s = to_string(x);
int ans = 0;
for (int i = 1; i < s.length(); i++) {
int a = stoi(s.substr(0, i));
int b = stoi(s.substr(i));
ans = max(ans, a*b);
}
return ans;
}
signed main() {
int Q; cin >> Q;
for (int i = 0; i < Q; i++) {
int N; cin >> N;
int ans = 0;
while (N >= 10) {
N = calc(N);
ans++;
if (ans > 100100) break;
}
if (N < 10) {
cout << ans << endl;
} else {
cout << -1 << endl;
}
}
}
|
#include <iostream>
#include <string>
using namespace std;
int main()
{
int q;
cin >> q;
while(1){
if (q <= 0) break;
int n ;
cin >> n;
int count = 0;
string hoge;
hoge = to_string(n);
while(1){
int max = 0;
int l = hoge.length();
if(l <= 1) break;
int i;
for (i = 1; i < l; i++) {
string a,b;
int c,d;
a = hoge.substr(0,i);
b = hoge.substr(i);
// cout << a << endl;
// cout << b << endl;
c = stoi(a);
d = stoi(b);
if(max < c * d) max = c * d;
// cout << max << endl;
}
count++;
if(max >= 10) hoge = to_string(max);
else break;
}
cout << count << endl;
q--;
}
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int p(int r) {
int ans = -1;
for (int i = 10; i <= r; i *= 10) {
ans = max(ans, ((r - r % i) / i)*(r % i));
}
return ans;
}
int main() {
int q; cin >> q;
for (int i = 0; i < q; i++) {
int k; cin >> k;
int cnt = 0;
while (k >= 10) { k = p(k); cnt++; }
cout << cnt << endl;
}
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
int Q, N, logn, r, l, turn;
int main(){
cin >> Q;
for (int i = 0; i < Q; i++){
cin >> N;
if (N == 0) logn = 1;
else logn = int(log10(N)) + 1; //N????????°?????????
if (logn == 1) cout << 0 << endl;
else{
turn = 0;
while (logn != 1){
int max = 0;
for (int j = 0; j < logn - 1; j++){
r = N % int(pow(10, j + 1)+0.1);
l = N / int(pow(10, j + 1) + 0.1);
if (max < r*l){
max = r*l;
}
}
N = max;
if (N == 0) logn = 1;
else logn = int(log10(N)) + 1; //N????????°?????????
turn++;
}
cout << turn << endl;
}
}
return 0;
}
|
#include<iostream>
#include<set>
using namespace std;
int main(){
int Q,N;
int ans;
cin>>Q;
for(int i=0;i<Q;i++){
cin>>N;
set<int>used;
bool ok=true;
ans=0;
while(N/10){
if(used.count(N)){
ans=-1;
break;
}
used.insert(N);
ans++;
int max=0;
for(int p=1;p<N;p*=10){
if((N/p)*(N%p)>max)max=(N/p)*(N%p);
}
N=max;
}
cout<<ans<<endl;
}
}
|
#include <iostream>
#include <sstream>
#include <set>
using namespace std;
int toInt(const string a){
stringstream ss;
ss<<a;
int b;
ss>>b;
return b;
}
string toStr(const int a){
stringstream ss;
ss<<a;
string b;
ss>>b;
return b;
}
int main(void){
int q;cin>>q;
for(int i=0;i<q;++i){
int c=0;
string s;cin>>s;
set<string> p;
p.insert(s);
for(;s.size()!=1;){
int max=0;
for(int i=1;i<s.size();++i){
int a=toInt(s.substr(i,s.size()-i)),b=toInt(s.substr(0,i));
if(max<a*b) max=a*b;
}
++c;
s=toStr(max);
if(p.find(s)!=p.end()){c=-1;break;}
p.insert(s);
}
cout<<c<<endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
void steps(int n);
int step(int n);
int main()
{
int q;
cin >> q;
int n;
for(int i = 0; i < q; i++){
cin >> n;
steps(n);
}
return 0;
}
void steps(int n)
{
int count = -1;
while(n != -1){
n = step(n);
count++;
}
cout << count << endl;
}
int step(int n)
{
if(n < 10){
return -1;
}
int fst = n;
int snd = 0;
int m = 10;
int max = 0;
while(fst > 0){
fst /= 10;
snd = n % m;
m *= 10;
if(max < fst * snd){
max = fst * snd;
}
}
return max;
}
|
#include <iostream>
#include <math.h>
#include <algorithm>
using namespace std;
int main(){
int q,n;
cin>>q;
for(int i=0;i<q;i++){
cin>>n;
int ct=0,keta=1;
while(n>9){
for(int k=6;k>=1;k--){
if(n/pow(10,k)>=1){
keta=k;
break;
}
}
int ma=0;
for(int j=1;j<=keta;j++){
int a=pow(10,j);
ma=max(ma,(n/a)*(n%a));
}
if(n==ma){
ct=-1;
break;
}
n=ma;
ct++;
}
cout<<ct<<endl;
}
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
int main()
{
for(int q;cin>>q;) while(q--){
string n; cin>>n;
int i;
for(i=0;n.size()>1;i++){
int x=-1;
for(int k=1;k<n.size();k++)
x=max(x,atoi(n.substr(0,k).c_str())*atoi(n.substr(k).c_str()));
char buf[9]; sprintf(buf,"%d",x);
n=buf;
}
cout<<i<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
unsigned long Q;
cin >> Q;
for(unsigned long iter = 0; iter < Q; ++iter){
unsigned long N;
cin >> N;
unsigned long cnt{0};
while(N > 9){
unsigned long mx{0};
for(unsigned long i = 10; i <= N; i *= 10)mx = max(mx, (N / i) * (N % i));
++cnt;
N = mx;
}
cout << cnt << endl;
}
}
|
#include <iostream>
using namespace std;
int solve(int x) {
int count = 0;
while (x >= 10) {
int ma = 0;
for (int s = 10; x / s > 0; s *= 10) {
int d = x / s;
int m = x % s;
ma = max(ma, d * m);
}
x = ma;
count++;
}
return count;
}
int main () {
int n;
for (cin >> n; n; n--) {
int x;
cin >> x;
cout << solve(x) << endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int q,n;
cin>>q;
while(q--){
cin>>n;
int c=0;
while(n/10&&c<1000000){
c++;
int a=-1;
for(int i=10;i<n;i*=10)a=max(a,(n/i)*(n%i));
n=a;
}
if(c==1000000)cout<<-1<<endl;
else cout<<c<<endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int solve(int n){
int res = 0;
while(n >= 10){
int maxVal = 0;
for(int i = 10; i <= n; i *= 10){
maxVal = max(maxVal, (n / i) * (n % i));
}
n = maxVal;
res++;
}
return res;
}
int main(){
int T;
cin >> T;
while(T--){
int n;
cin >> n;
cout << solve(n) << endl;
}
}
|
#include <iostream>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int max_multi(int x)
{
int maximum = 0;
int y = 1;
rep(i, 5){
int a, b;
y *= 10;
a = x / y;
b = x - a * y;
maximum = max(maximum, a * b);
}
return maximum;
}
int main(void)
{
int Q;
cin >> Q;
rep(i, Q){
int N, cnt = 0;
cin >> N;
//Nが一桁になるまで繰り返す
while(N >= 10){
N = max_multi(N);
cnt++;
}
cout << cnt << endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int q,n,c;
cin >> q;
while(q--){
cin >> n; c=0;
for(;;){
int m = -1,k = 10;
if(n<10){
cout << c << endl;
break;
}
for(int i=0;i<5;i++){
m=max(m,(n/k)*(n%k));
k*=10;
}
n = m; c++;
}
}
}
|
#include <iostream>
#include <vector>
#include<algorithm>
#include<iomanip>
#include<queue>
using namespace std;
#define rep(i,n) for(int i=1;i<=(int)(n);i++)
#define Rep(i,n) for(int i=0;i<=(int)(n-1);i++)
int inf=1000200000;
int max(int N){
int max =0;
for(int i=10; N/i>0;i=i*10){
int kouho;
kouho = (N/i)*(N-(N/i)*i);
if(kouho>max){
max = kouho;
}
}
return max;
}
int main() {
int Q;
cin>>Q;
Rep(i,Q){
int N;
cin>>N;
int count = 0;
rep(i,inf){
if(N<=9){
cout<<count<<endl;
break;
}
else if(i >= inf-1){
cout<<-1<<endl;
break;
}
else{
N =max(N);
count++;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int Q; cin >> Q;
while(Q--) {
int N; cin >> N;
int res = 0;
set<int> s;
while(N >= 10) {
string n;
{
stringstream ss; ss << N;
n = ss.str();
}
int maxi = -1;
for(int i = 1; i < n.size(); ++i) {
string a = n.substr(0, i);
string b = n.substr(i);
int x = atoi(a.c_str()) * atoi(b.c_str());
maxi = max(maxi, x);
}
N = maxi;
if(s.count(N)) {
res = -1; break;
}
s.insert(N);
++res;
}
cout << res << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int i,N,m,d,s;
d=10;
cin >> N;
for (int k=0; k<N; k++) {
cin >> m;
while (m>9) {
i += 1;
while (m % d != m) {
int lower = m%d;
int upper = (m-lower)/d;
int mlp = lower * upper;
if(s < mlp) s = mlp;
d *= 10;
}
m = s;
d=10;
s=0;
}
cout << i << endl;
i=0;
}
}
|
#include <stdio.h>
#include <set>
#include <math.h>
#include <algorithm>
using namespace std;
int maxNum(int N){
int maxInt=0,i=1,a,b;
int lenN=(int)log10(N)+1;
while (i<lenN){
a=N/(int)pow(10.0,(double)lenN-i);
b=N%(int)pow(10.0,(double)lenN-i);
maxInt=max(maxInt,a*b);
i++;
}
return maxInt;
}
int main(){
int Q,cnt,N;
scanf("%d",&Q);
for (int i=0;i<Q;i++){
set<int> S;
scanf("%d",&N);
cnt=0;
while (true){
set<int>::iterator iti=S.find(N);
if (N<10){
printf("%d\n",cnt);
break;
}else if (iti!=S.end()){
printf("-1\n");
break;
}else{
S.insert(N);
N=maxNum(N);
cnt++;
}
}
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(void){
int n;
string num;
cin >> n;
for(int i = 0; i < n; i++){
int cnt = 0;
cin >> num;
while(num.size() > 1){
int maxn = 0;
for(int i = 0; i < num.size() - 1; i++){
string op1(num, i + 1, num.size() - i), op2(num, 0, i + 1);
int n = stoi(op1) * stoi(op2);
if(n > maxn) maxn = n;
}
num = to_string(maxn);
cnt++;
if(cnt > 1000000) break;
}
if(cnt <= 1000000) cout << cnt << endl;
else cout << -1 << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int value, source_value, count = 0;
cin >> source_value;
value = source_value;
while (value >= 10) {
count++;
string str = to_string(value);
int len = str.size(), max = 0;
for (int j = 1; j < len; j++) {
int temp1, temp2;
temp1 = stoi(str.substr(0, j));
temp2 = stoi(str.substr(j));
if (max < temp1 * temp2) {
max = temp1 * temp2;
}
}
value = max;
}
cout << count << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
typedef long long ll;
int solve(ll n)
{
int cnt = 0;
while (n / 10 != 0) {
ll max_n = 0;
for (int i = 10; n / i != 0; i *= 10) {
ll tmp = (n / i) * (n % i);
if (tmp > max_n)
max_n = tmp;
}
n = max_n;
cnt++;
}
return cnt;
}
int main()
{
int q;
cin >> q;
while (q--) {
ll n;
cin >> n;
cout << solve(n) << endl;
}
return 0;
}
|
#include<iostream>
#include<map>
using namespace std;
int main(){
map<int,bool> h;
int q,n,cnt;
cin >> q;
while(q--){
cin >> n;
cnt = 0;
h.clear();
for(;;){
int m = -1, k = 10;
if(h[n]){
cout << -1 << endl;
break;
}
h[n] = true;
if(n<10){
cout << cnt << endl;
break;
}
for(int i=0;i<5;i++){
m = max(m,(n/k)*(n%k));
k *= 10;
}
n = m; cnt++;
}
}
}
|
#include<iostream>
#include<math.h>
using namespace std;
int tejun(int inp,int r);
int main(){
int q;
cin>>q;
for(int i=0;i<q;i++){
int num;
cin >> num;
int r=0;
r = tejun(num,r);
cout << r << endl;
}
}
int tejun(int inp,int r){
if(inp>9){
int max=0;
for(int j=1;pow(10,j)<inp;j++){
int kake=(inp/(int)pow(10,j))*(inp%(int)pow(10,j));
if(kake>max){
max=kake;
}
}
return tejun(max,r+1);
}
return r;
}
|
#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<sstream>
#include<algorithm>
using namespace std;
int Solve(int n)
{
if(n<10)
return 0;
stringstream ss;
ss<<n;
string s=ss.str();
int t=0;
for(int i=1;i<s.size();++i)
t=max(t,atoi(s.substr(0,i).c_str())*atoi(s.substr(i).c_str()));
return 1+Solve(t);
}
int main()
{
int q,n;
for(scanf("%d",&q);q--;)
{
scanf("%d",&n);
printf("%d\n",Solve(n));
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<set>
using namespace std;
int main()
{
int q; cin>>q;
while(q--)
{
int n; cin>>n;
//set<int> used;
bool used[1000001];
fill(used,used+1000001,0);
int ans=0;
//while(used.find(n)==used.end()&&9<n)
while(!used[n]&&9<n)
{
int next=0,r=0;
//used.insert(n);
used[n]=true;
int mul=1;
while(1)
{
r+=n%10*mul;
n/=10;
mul*=10;
if(n==0) break;
next=max(next,r*n);
}
n=next;
ans++;
}
if(n<=9) cout<<ans<<endl;
else cout<<-1<<endl;
}
return 0;
}
|
#include <iostream>
#include <utility>
#include <vector>
#include <algorithm>
using namespace std;
int N,Q;
int calc(int i,int n){
int num = 0;
if(n<10){
return i;
}else{
int ten = 10;
while(ten<= n){
int temp = (n/ten) * (n%ten);
if (num<temp)num=temp;
ten *= 10;
}
}
return calc(i+1,num);
}
int main(){
cin >>Q ;
for (int i=0;i<Q;i++){
cin >> N;
int ans = calc(0,N);
cout << ans <<endl;
}
}
|
#include<stdio.h>
#include<algorithm>
using namespace std;
bool v[1000001];
int d[7];
int main(){
int a;
scanf("%d",&a);
while(a--){
for(int i=0;i<1000001;i++)v[i]=0;
int ret=0;
int b;
scanf("%d",&b);
while(1){
v[b]=true;
if(b<10)break;
int c=b;
int i=0;
while(c){
d[i++]=c%10;
c/=10;
}
int to=0;
for(int j=0;j<i-1;j++){
int e=0;
int f=0;
for(int k=j;k>=0;k--){
e*=10;
e+=d[k];
}
for(int k=i-1;k>j;k--){
f*=10;
f+=d[k];
}
to=max(to,e*f);
}
if(v[to]){
ret=-1;
break;
}
b=to;
ret++;
}
printf("%d\n",ret);
}
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
int q,n,count,a,b,res;
string s,s1,s2;
cin >> q;
for(int i = 0;i < q;i++){
cin >> n;
count = 0;
while(1){
res = 0;
if(n/10 == 0)break;
s = to_string(n);
for(int j = 1;j < s.size();j++){
s1.assign(s,0,j);
s2.assign(s,j,s.size()-j);
a = stoi(s1);
b = stoi(s2);
res = max(res,a*b);
}
n = res;
count++;
}
cout << count << endl;
}
return 0;
}
|
#include <cstdio>
int p10[10];
int max(int a,int b){return a>b?a:b;}
int tejun2(int n){
int ans=-1;
for(int i=1; p10[i]<n; i++)
ans=max(ans,(n/p10[i])*(n%p10[i]));
return ans;
}
int main(){
p10[0]=1;
for(int i=1; i<10; i++)p10[i]=p10[i-1]*10;
int Q,N;
scanf("%d",&Q);
for(int i=0; i<Q; i++){
int cnt;
scanf("%d",&N);
for(cnt=0; N>=10&&cnt<100000; cnt++){
N=tejun2(N);
}
if(cnt==100000)
printf("-1\n");
else
printf("%d\n",cnt);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int f(int x){
string S = to_string(x);
int N = S.size();
int ans = 0;
for (int i = 1; i < N; i++){
ans = max(ans, stoi(S.substr(0, i)) * stoi(S.substr(i)));
}
return ans;
}
int main(){
vector<int> r(1000001, 0);
for (int i = 10; i <= 1000000; i++){
r[i] = r[f(i)] + 1;
}
int Q;
cin >> Q;
for (int i = 0; i < Q; i++){
int N;
cin >> N;
cout << r[N] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int check_digit(int t){
int res=0;
while(t!=0){
t/=10;
res++;
}
return res;
}
int sol(int t){
int cd=check_digit(t);
int c10=10;
int res=0;
for(int i=1;i<cd;i++){
int t1=t%c10;
int t2=t/c10;
res=max(res,t1*t2);
c10*=10;
}
return res;
}
int main(void){
// Your code here!
int q;
cin>>q;
int n[110];
for(int i=0;i<q;i++){
cin>>n[i];
int ans=0;
while(n[i]/10!=0){
n[i]=sol(n[i]);
ans++;
}
cout<<ans<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
string d="";
int k(int a) {
int b = 0;
for (; a < d.length(); a++) {
b = b * 10 + d[a] - 48;
}
return b;
}
int main() {
int a;
cin >> a;
for (int b = 0; b < a; b++) {
int c = 0;
cin >> d;
unordered_set<string>j;
while (c++,1) {
if (d.length() == 1) { cout << c-1 << endl; break; }
int MAX = 0;
int l =0,r=k(0);
for (int f = 0; f < d.length(); f++) {
MAX = max(MAX, l*r);
l = l * 10 + d[f] - 48;
r = k(f + 1);
}
d = to_string(MAX);
if (j.find(d) != j.end()) { puts("-1"); return 0; }
j.insert(d);
}
}
}
|
#include <iostream>
using namespace std;
int rec(int n, int count) {
if (n < 10) return count;
int mx = 0;
for (int i=10; i<=1000000; i*=10) {
mx = max(mx, (n / i) * (n % i));
}
return rec(mx, count + 1);
}
int main() {
int q, n;
cin >> q;
for (int i=0; i<q; ++i) {
cin >> n;
cout << rec(n, 0) << endl;
}
return 0;
}
|
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
int step(int n){
int digit=1,tmp;
tmp=n;
int res=0;
while((tmp=tmp / 10)>0)digit++;
for(int i=1;i<digit;i++){
int first,latter;
first=n/(int)pow(10,i);
latter=n%(int)pow(10,i);
res=max(res,first*latter);
}
return res;
}
int main(){
int q,n;
cin>>q;
for(int i=0;i<q;i++){
int ans=0;
cin>>n;
while(n>9){
n=step(n);
ans++;
}
cout << ans << endl;
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<map>
#include<queue>
using namespace std;
#define REP(i, a, n) for(int i=a; i<n; i++)
#define INF 1000000000
int main() {
int Q;
string N[101];
cin >> Q;
REP(i, 0, Q) cin >> N[i];
REP(i, 0, Q) {
int cnt = 0;
string val = N[i];
while (1) {
if (val.size() == 1) {
cout << cnt << endl;
break;
}
if (cnt > 10000) {
cout << -1 << endl;
break;
}
int maxi = 0;
REP(j, 1, val.size()) {
int l = stoi(val.substr(0, j));
int r = stoi(val.substr(j));
maxi = max(maxi, l*r);
}
val = to_string(maxi);
cnt++;
}
}
return 0;
}
|
//46
#include<iostream>
#include<set>
using namespace std;
int main(){
int q;
cin>>q;
while(q--){
int n;
cin>>n;
int a;
set<int> s;
for(a=0;n>=10&&s.insert(n).second;a++){
int m=0;
for(int p=10;p<=n;p*=10){
int h,l;
h=n/p;
l=n-h*p;
if(m<h*l){
m=h*l;
}
}
n=m;
}
cout<<((n<10)?a:-1)<<endl;
}
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<map>
using namespace std;
int N;
int R[100];
int solve(int m){
int res=0;
int mul=1;
for(int i=0;i<6;i++){
res=max(res,(m/mul)*(m%mul));
mul*=10;
}
return res;
}
int main()
{
scanf("%d",&N);
for(int i=0;i<N;i++){
map<int,int>M;
scanf("%d",&R[i]);
if(R[i]<10){
printf("0\n");
goto aaa;
}
M[R[i]]++;
while(true){
R[i]=solve(R[i]);
if(R[i]<10){
break;
}
M[R[i]]++;
if(M[R[i]]==2){
printf("-1\n");
goto aaa;
}
}
printf("%d\n",M.size());
aaa:;
}
}
|
#include <iostream>
#include <set>
using namespace std;
void solve()
{
int Q;
cin >> Q;
while(Q--)
{
int N;
cin >> N;
int count = 0;
set<int> isExist;
while(true)
{
if(N < 10)
{
cout << count << endl;
break;
}
int digit = 0;
int NBuf = N;
while(NBuf)
{
NBuf /= 10;
++digit;
}
int max = 0;
int a = 10;
for(int i = 1; i < digit; ++i)
{
int left = N / a;
int right = N % a;
if(left * right > max)
{
max = left * right;
}
a *= 10;
}
if(isExist.find(max) == isExist.end())
{
isExist.insert(max);
}
else
{
cout << -1 << endl;
break;
}
N = max;
++count;
}
}
}
int main()
{
solve();
return(0);
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int q;
cin >> q;
for(int p=0; p < q; p++){
int num;
int count = 0;
cin >> num;
while(num / 10 != 0){
int n, m, maxNum = 0;
for(int d = 10; num / d != 0; d *= 10){
maxNum = max(maxNum, (num/d) * (num % d));
}
num = maxNum;
count++;
}
cout << count << endl;
}
}
|
#include<iostream>
#include<math.h>
using namespace std;
int main(){
int q;
int n;
int count;
int max;
cin >> q;
for(int i=0;i<q;i++){
cin >> n;
count=0;
while(n/10>=1){
count+=1;
max=0;
for(int j=1;j<6;j++){
int t=pow(10,j);
int tmp=(n/t)*(n%t);
if(max<tmp) max=tmp;
}
n=max;
}
cout<<count<<endl;
}
return 0;
}
|
#include<iostream>
#include<fstream>
#include<string>
using namespace std;
int search(int num){
if(num < 10)return 0;
auto log = 10;
auto v = 0;
while(log < num)
{
auto tmp = (num % log) * (num / log);
v = max(tmp, v);
log *= 10;
}
return 1 + search(v);
}
int main(){
//ifstream fin("in.txt");
auto n = 0;
cin >> n;
for(auto i = 0; i < n; i++){
auto num = 0;
cin >> num;
cout << search(num) << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(void)
{
int q;
cin >> q;
int n;
for(int i = 0; i < q; i++)
{
cin >> n;
int counter = 0;
while(n >= 10)
{
int x, max = 0;
for(int j = 10; j < n; j *= 10)
{
x = (n / j) * (n % j);
if(x >= max)
max = x;
}
n = max;
counter++;
}
cout << counter << endl;
}
return 0;
}
|
//Kakezan
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int flag[10000000];
ll next(ll x){
ll y=x%10;
ll ret=0;
ll cnt=10;
x/=10;
while(x!=0){
if(ret<x*y)ret=x*y;
y=(x%10)*cnt+y;
x/=10;
cnt*=10;
}
return ret;
}
int main(){
int Q;
cin>>Q;
for(int i=0; i<Q; i++){
memset(flag, 0, sizeof(flag));
int N;
cin>>N;
ll cnt=0;
while(true){
flag[N]=1;
if(N<10){cout<<cnt<<endl; break;}
N=next(N);
if(flag[N]==1){cout<<"-1"<<endl; break;}
cnt++;
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) (v).begin(),(v).end()
#define int long long
typedef pair<int,int> P;
//-----------------------------------------------------------------------
int calc(int a){
string s=to_string(a);
int res=0;
for(int i=1;i<s.size();i++){
int t=stoi(s.substr(0,i))*stoi(s.substr(i));
res=max(res,t);
}
return res;
}
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin>>n;
REP(i,n){
int a; cin>>a;
int cnt=0;
while(10<=a){
a=calc(a);
cnt++;
}
cout<<cnt<<endl;
}
}
|
#include<iostream>
#include<cmath>
using namespace std;
int next_n(int n) {
int maximum = -1;
for (int p = 1; pow(10, p) < n; p++) {
int base = pow(10, p),
right = n % base,
left = (n - right) / base;
maximum = max(maximum, right * left);
}
return maximum;
}
int main() {
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
int N;
cin >> N;
int count = 0;
while (N > 9) {
N = next_n(N);
count++;
}
cout << count << endl;
}
}
|
#include <math.h>
#include <iostream>
using namespace std;
int Q;
bool ok(long int n, int c) {
if (n < 10) {
cout << c << endl;
return true;
}
return false;
}
int mul(long int n) {
int t,r = 0;
int dig = (int)log10(n);
for (int i = 1; i < dig + 1; i++) {
t = (n / (int)pow(10,i)) * (n % (int)pow(10,i));
if (t > r) {
r = t;
}
}
return r;
}
int main(){
long int N;
int c;
cin >> Q;
for (int i = 0; i < Q; i++) {
cin >> N;
c = 0;
while (!ok(N, c)) {
if (c > 10000) {
cout << -1 << endl;
break;
}
N = mul(N);
c++;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve(string N){
int l = N.size();
int ans = 0;
while(l>1){
int maxi = 0;
for(int i=1; i<l; i++){
int pre = stoi( N.substr(0,i) );
int suf = stoi( N.substr(i,l-i) );
maxi = max(maxi,pre*suf);
}
N = to_string(maxi);
l = N.size();
ans++;
}
cout << ans << endl;
}
int main(){
int Q; cin >> Q;
for(int i=0; i<Q; i++){
string N; cin >> N;
solve(N);
}
}
|
#include <iostream>
using namespace std;
int c;
int seisu_1(int n){
if(0<=n && n<10) return c;
else{
int nmax=(n/10)*(n%10), m;
for(int j=10; j<=n; j*=10){
m = (n/j)*(n%j);
if(nmax<m) nmax = m;
}
c++;
return seisu_1(nmax);
}
}
int main(void){
int Q, n;
cin >> Q;
for(int i=1; i<=Q; i++){
c = 0;
cin >> n;
cout << seisu_1(n) << endl;
}
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
const int MAX=1000000;
int func_num(int n){
int count=0;
while(1){
int x=0;
if(0<=n&&n<=9) break;
for(int i=10;i<=MAX;i*=10){
if(n/i==0) break;
x=max(x,(n/i)*(n%i));
}
n=x;
count++;
}
return count;
}
int main(){
int Q,N;
int ans;
cin>>Q;
for(int i=0;i<Q;i++){
cin>>N;
ans=func_num(N);
cout<<ans<<endl;
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<iomanip>
#include<set>
using namespace std;
int keta(long long n)
{
int cnt=0;
while(true)
{
cnt++;
n/=10;
if(n<=0)break;
}
return cnt;
}
int main()
{
int q;
cin >> q;
for(int i=0;i<q;i++)
{
long long n;
cin >> n;
long long cnt=0;
while(true)
{
int ke=keta(n);
if(ke<=1)
break;
cnt++;
long long tmp=0;
for(int j=0;j<ke;j++)
{
long long tmptmp;
long long un,up;
long long aa=1;
for(int k=0;k<j;k++)
{
aa*=10;
}
un=n%aa;
up=n/aa;
tmptmp=un*up;
if(tmp<tmptmp)tmp=tmptmp;
}
n=tmp;
}
cout << cnt << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int Q;
int main(){
cin >> Q;
for(int i=0;i<Q;i++){
set<int> F;
string n; cin >> n;
int cnt = 0;
while( n.size() > 1 ){
int mn = -1;
for(int i=1;i<n.size();i++){
string a = n.substr(i), b = n.substr(0,i);
int x = stoi(a);
int y = stoi(b);
mn = max( mn, x*y );
}
if( F.count( mn ) == 0 ) {
cnt++;
F.insert( mn );
n = to_string( mn );
} else {
cnt = -1;
break;
}
}
cout << cnt << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int q;
cin >> q;
while (q--) {
int n;
cin >> n;
int res = 0;
while (n >= 10) {
auto s = to_string(n);
int m = s.size(), mx = -1;
for (int i = 1; i < m; ++i) {
mx = max(mx, stoi(s.substr(0, i)) * stoi(s.substr(i)));
}
n = mx;
++res;
}
cout << res << '\n';
}
}
|
#include<stdio.h>
int max(int a,int b){
if(a<b)return b;
else return a;
}
int Q,A;
int t[1000005];
int solve(int id){
int i;
int cnt=0;
while(A>=10){
if(t[A]==id)return -1;
t[A]=id;
int x=-1;
for(i=10;i<A;i*=10){
int a=A/i,b=A%i;
x=max(x,a*b);
}
A=x;
cnt++;
}
return cnt;
}
int main(){
int i;
scanf("%d",&Q);
for(i=1;i<=Q;i++){
scanf("%d",&A);
printf("%d\n",solve(i));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int q, n;
cin >> q;
while(q--){
cin >> n;
int cnt = 0;
while(n >= 10){
int tmp = n, k = 0;
while(tmp >= 10){
tmp /= 10;
k++;
}
tmp = n, n = 0;
for(int i = 0; i < k; i++){
int dig = 10;
for(int j = 0; j < i; j++) dig *= 10;
n = max(n, (tmp / dig) * (tmp % dig));
}
cnt++;
}
cout << cnt << endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
int cnt = 0;
void mulspl(int n) {
int place = 0, tmp = n, i = 0;
vector<int> sp(10);
while (tmp > 0) {
sp[i] = tmp % 10;
tmp /= 10;
place++, i++;
}
if (place > 1) {
int maxi = 0;
for (int i = 1; i < place; ++i) {
int x = (n / (int)pow(10, i)) * (n % (int)pow(10, i));
maxi = max(maxi, x);
}
cnt++;
mulspl(maxi);
}
}
int main() {
int q;
cin >> q;
int n;
for (int i = 0; i < q; ++i) {
cin >> n;
mulspl(n);
cout << cnt << endl;
cnt = 0;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <sstream>
using namespace std;
int memo[1000001];
string tostr(int x){
stringstream ss;
ss << x;
string s;
ss >> s;
return s;
}
int toint(string s){
int x;
stringstream ss;
ss << s;
ss >> x;
return x;
}
int solve(int n){
if(n<10) return 0;
if(memo[n]) return memo[n];
string s = tostr(n);
int nxt = -1;
for(int i=1;i<=s.length()-1;++i){
string a = s.substr(0,i);
string b = s.substr(i,s.length()-i);
nxt = max(nxt,toint(a)*toint(b));
}
return memo[n]=solve(nxt)+1;
}
int main(){
int q;
cin >> q;
while(q--){
int n;
cin >> n;
cout << solve(n) << endl;
}
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
int main(){
int n,m,s,max,cnt;
string str,str1;
cin>>n;
for(int i=0;i<n;i++){
cin>>str;
cnt=0;
while(1){
if(str.size()==1) break;
str1=str[0],max=0;
for(int j=0;j<str.size()-1;j++){
if(j>0) str1+=str[j];
m=stoi(str1),s=stoi(&str[j+1]);
if(max<m*s) max=m*s;
}
str=to_string(max),cnt++;
}
cout<<cnt<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int foo(int x, int n){
if(x < 10) return 0;
int ma = 0, temp;
for(int i = 10;x/i; i*=10)
ma = max((x/i)*(x%i),ma);//cout<<ma<<" "<<n<<" "<<x<<endl;
temp = foo(ma, n+1)+1;
if(temp == -1 || ma == x) return -1;
else return temp;
}
int main(){
int Q, N;
cin>>Q;
for(int i = 0; i < Q; i++){
cin>>N;
cout<<foo(N,0)<<endl;
}
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <numeric>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <functional>
#include <complex>
using namespace std;
const int INF = (1<<30) - 1;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int Q; cin >> Q;
while(Q--){
int R; cin >> R;
int ans = 0;
while(R >= 10){
int next = 0;
for(int x=10; x<=R; x*=10){
next = max(next, (R/x) * (R%x));
}
R = next;
ans++;
}
cout << ans << endl;
}
return 0;
}
|
#include<iostream>
#include<map>
using namespace std;
map<int, int> mem;
int main()
{
int Q, n;
cin >> Q;
for(int q = 0; q < Q; q++)
{
mem.clear();
cin >> n;
int m = 0;
while(n >= 10)
{
m++;
mem[n] = 1;
int tmp = 0;
for(int j = 10; ; j *= 10)
{
int a, b;
a = n / j;
b = n % j;
if(!a)
break;
tmp = max(tmp, a * b);
}
n = tmp;
if(mem.count(n))
{
cout << -1 << endl;
goto end;
}
}
cout << m << endl;
end:;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int Q;
cin >> Q;
while ( Q-- ) {
int n;
int cnt = 0;
cin >> n;
map<int, bool> used;
while ( 1 ) {
if ( used[n] ) {
cnt = -1;
break;
}
used[n] = true;
if ( n < 10 ) break;
cnt++;
int m = -1;
for ( int i = 10; ; i *= 10 ) {
if ( i > n ) break;
m = max(m, (n/i)*(n%i));
}
n = m;
}
cout << cnt << endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
using namespace std;
typedef long long int ll;
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int q; cin >> q;
while(q--){
int n; cin >> n;
map<int,int> used;
int cnt=0;
while(n>=10){
int ma=0;
for(int i=10;;i*=10){
if(n<i)break;
ma=max(ma,(n%i)*(n/i));
}
if(used[ma]){
cnt=-1;
break;
}
used[ma]=1;
cnt++;
n=ma;
}
cout << cnt << endl;
}
}
|
#include<iostream>
using namespace std;
int main(){
int q,n;
cin >> q;
int i,j,k,l;
for(i=0;i<q;i++){
cin >> n;
int s=0;
while(n>=10){
int b = n;
k=0;
while(b>=10) {
b/=10;
k++;
}
b=n;
n=0;
for(j=0;j<k;j++){
int d=10;
for(l=0;l<j;l++) d*=10;
if((b/d)*(b%d)>n) n= (b/d)*(b%d);
}
s++;
}
cout << s << endl;
}
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(void){
int q;
cin>>q;
for(int r = 0 ; r < q ; r ++){
int num;
int cnt=0;
cin>>num;
while(num/10 != 0){
int n ,m ,maxn = 0;
for(int d = 10 ; num / d != 0; d *= 10){
maxn = max(maxn,(num/d)*(num%d));
}
num = maxn;
cnt++;
}
cout<<cnt<<endl;
}
}
|
#include<stdio.h>
int main(){
int n;
scanf("%d",&n);
int x;
for(int i=0;i<n;i++)
{scanf("%d",&x);
int c=0;int d=10;int w=0,y=0;int max=0;
while(x/10!=0){
for(int j=0;j<6;j++)
{
w=x/d;y=x%d;d*=10;
if(j==0)max=w*y;
else if(w*y>max)max=w*y;}
x=max;c++;d=10;}
printf("%d\n",c);
}
return 0;
}
|
#include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int n;
void solve(){
int i=0;
for(;n/10>0;i++){
int s=n,n_=0;
for(int j=10;;j*=10){
int u=s/j;
if(u==0)break;
int l=s%j;
n_=max(n_,u*l);
}
n=n_;
}
cout<<i<<endl;
}
int main(){ _;
int q;cin>>q;
REP(i,q){
cin>>n;
solve();
}
}
|
#include<iostream>
using namespace std;
int main(){
int q,n,cnt;
cin >> q;
while(q--){
cin >> n;
cnt = 0;
for(;;){
int m = -1, k = 10;
if(n<10){
cout << cnt << endl;
break;
}
for(int i=0;i<5;i++){
m = max(m,(n/k)*(n%k));
k *= 10;
}
n = m; cnt++;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int dp[10000000];
int solve(int n) {
if(dp[n] != -1) {
return dp[n];
}
if(n < 10) {
return 0;
}
int nn= 0;
for(int i = (int)log10(n); i > 0; --i) {
nn = max(nn, (n / (int)pow((double)10, i)) * (n % (int)pow((double)10, i)));
}
return dp[n] = solve(nn) + 1;
}
int main() {
int q, n;
memset(dp, -1, sizeof(dp));
cin >> q;
for(int i = 0; i < q; ++i) {
cin >> n;
cout << solve(n) << endl;
}
}
|
#include <iostream>
#include <math.h>
using namespace std;
int main(){
int q;
int inp;
cin >>q;
for(int i =0;i<q;i++){
cin >>inp;
int counter =0;
int a[5]={0};
while(inp>9){
int max = 0;
for(int i = 1;i<6;i++){
int num=1;
for(int j= 0; j<i ; j++){
num *=10;
}
a[i-1] =(inp/num)*(inp%num);
if(max<a[i-1]) max = a[i-1];
}
counter++;
inp = max;
}
cout << counter <<endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int q,r,a;
cin>>q;
for(int i=0;i<q;i++){
cin>>r;
int j=10,count=1;
a=r;
while(1){
a/=j;
if(a==0)break;
count++;
}
int count1=0;
while(1){
int max=0;
j=10;
if(r/j==0)break;
for(int k=1;k<count;k++){
a=(r/j)*(r%j);
if(max<a)max=a;
j*=10;
}
r=max;
count1++;
}
cout<<count1<<endl;
}
return 0;
}
|
#include<iostream>
#include<cmath>
#include<set>
using namespace std;
int main(){
long long Q,N,M;
long long max;
int cnt;
set<long long> inf;
cin>>Q;
while(Q--){
cin>>N;
if(!inf.empty()) inf.clear();
cnt=0;
while(N/10!=0){
M=0;
max=-1;
for(int i=0;N!=0;i++){
M+=N%10*pow(10.0,i);
N/=10;
if(M*N>max) max=N*M;
}
if(inf.find(max)!=inf.end()){
cnt=-1;
break;
}
inf.insert(max);
N=max;
cnt++;
}
cout<<cnt<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) (v).begin(),(v).end()
#define int long long
typedef pair<int,int> P;
//-----------------------------------------------------------------------
int calc(int a){
int res=0,k=10;
REP(i,6){
res=max(res,(a/k)*(a%k));
k*=10;
}
return res;
}
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin>>n;
REP(i,n){
int a; cin>>a;
int cnt=0;
while(10<=a){
a=calc(a);
cnt++;
}
cout<<cnt<<endl;
}
}
|
#include <cstdlib>
#include <iostream>
#include <map>
using namespace std;
template<class T> inline void chmax(T& a, const T& b) { if(b > a) a = b; }
map<int, int> visited;
int dfs(int n) {
if(n < 10)
return 0;
if(visited.count(n))
return visited[n];
visited[n] = -1;
int next = 0;
for(int i = 10; n / i; i *= 10) {
int a = n / i;
int b = n % i;
chmax(next, a * b);
}
return visited[n] = dfs(next) + 1;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int q;
cin >> q;
for(int i = 0; i < q; ++i) {
int n;
cin >> n;
cout << dfs(n) << endl;
}
return EXIT_SUCCESS;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
const int INF=1<<29,MOD=1e9+7;
int main(){
int q; cin>>q;
rep(i,q){
int n; cin>>n;
int cnt=0;
while(n>=10){
int div=10,tmp=0;
while(div<n){
if((n/div)*(n%div)>tmp) tmp=(n/div)*(n%div);
div*=10;
}
n=tmp; cnt++;
}
cout<<cnt<<endl;
}
return 0;
}
|
#include<cstdio>
#include<algorithm>
using namespace std;
int a[7]={1,10,100,1000,10000,100000,1000000};
int ans;
int solve(int n){
int res=0;
if(n<10) return n;
ans++;
for(int i=0;a[i]<n;i++){
res=max(res,(n/a[i])*(n%a[i]));
}
return solve(res);
}
int main(){
int q;
scanf("%d",&q);
for(int i=0;i<q;i++){
int n;
ans=0;
scanf("%d",&n);
solve(n);
printf("%d\n",ans);
}
return 0;
}
|
#include<iostream>
#include<set>
#include<algorithm>
using namespace std;
int main(){
int q;
cin>>q;
while(q--){
int n;
set<int> s;
cin>>n;
int ans=0;
while(10<=n){
if(s.find(n)!=s.end()){
ans=-1;
break;
}
s.insert(n);
int next=0;
int b=10;
while(b<=n){
int t=(n%b)*(n/b);
next=max(next,t);
b*=10;
}
n=next;
ans++;
}
cout<<ans<<endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long int n, input;
cin >> n;
for ( long long int i = 0; i < n; i++ ) {
cin >> input;
if ( input < 10 ) {
cout << 0 << endl;
continue;
}
long long int ans = 1;
while( true ) {
long long int k = 0;
for ( long long int j = 10; j <= input; j *= 10 ) {
k = max( k, ( input / j ) * ( input % j ) );
}
input = k;
if ( input < 10 ) break;
ans++;
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int q,n,cnt,d,max;
cin >> q;
for(int i = 0; i < q; i++){
cin >> n;
cnt = 0;
while(n >= 10){
max = (n % 10) * (n / 10);
for(d = 100; d < n; d *= 10){
int x,y;
x = n % d;
y = n / d;
if(max < x * y) max = x * y;
}
n = max;
cnt++;
}
cout << cnt << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int solve(int N, int cnt) {
if (N < 10) return cnt;
cnt++;
if (cnt == 10000000) return -1;
int syou, amari;
int mn = -1;
for (int i = 10; i < 10000000; i *= 10) {
syou = N / i;
if (!syou) break;
amari = N % i;
mn = max(mn, syou * amari);
}
cnt = solve(mn, cnt);
return cnt;
}
int main() {
int Q;
cin >> Q;
int N;
vector<int> ans;
for (int i = 0; i < Q; i++) {
cin >> N;
int cnt = 0;
ans.push_back(solve(N, cnt));
}
for (int i : ans) cout << i << endl;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <string>
using namespace std;
int Q;
int max_kakezan(int n){
int dec = 1;
int front,back;
int max = -1000;
while(n/dec != 0) {
front = n/dec;
back = n%dec;
if (max < front * back){
max = front * back;
}
dec *= 10;
}
return max;
}
int how_many_kakezan(int n){
int times = 0;
while (n/10 != 0) { //もしnが1桁ならば、終了,それ以外は続行
n = max_kakezan(n);
times++;
}
return times;
}
int main(){
cin >> Q;
for (int q = 0; q < Q; q++){
int n;
cin >> n;
cout << how_many_kakezan(n) << endl;
}
}
|
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int q;
scanf("%d",&q);
while(q--){
bool memo[1000001];
fill(memo,memo+1000001,false);
int n;
scanf("%d",&n);
for(int i=0;true;i++){
if(n/10==0){
printf("%d\n",i);
break;
}
int ma=0;
for(int j=10;n/j;j*=10){
int v1=n/j,v2=n%j;
ma=max(ma,v1*v2);
}
if(memo[ma]){
puts("-1");
break;
}
memo[ma]=true;
n=ma;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1e18
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
typedef pair<int, int> P;
const int mod = 1000000007;
int calc(int n){
int res = 0;
int m = 0, tmp = 1;
while(n > 0){
int x = n % 10;
n /= 10;
m = tmp * x + m;
tmp *= 10;
res = max(res, n * m);
}
return res;
}
signed main(){
int q;
cin >> q;
while(q--){
int n;
cin >> n;
int cnt = 0;
while(n >= 10){
n = calc(n);
//cout << n << endl;
cnt++;
}
cout << cnt << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int q, r, ten, ma, cnt;
int main() {
cin >> q;
for(int a = 0; a < q; ++a) {
map<int, bool> mp;
cin >> r;
cnt = 0;
while(r >= 10) {
ma = 0;
ten = 10;
while(r / ten > 0) {
if(ma < (r / ten) * (r % ten)) ma = (r / ten) * (r % ten);
ten *= 10;
}
if(mp.find(ma) != mp.end()) {
cnt = -1;
break;
}
mp[ma] = 1;
r = ma;
++cnt;
}
cout << cnt << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int q, n, m, i, j, a, b, d, cnt, max;
cin >> q;
for (i = 0; i < q; i++) {
cnt = 0;
cin >> n;
while (n / 10 != 0) {
d = 1; m = n; max = 0;
while (m / 10 != 0) {
m /= 10;
d++;
}
for (j = 1; j < d; j++) {
a = n / pow(10, j);
b = n - a * pow(10, j);
if (a * b > max) {
max = a * b;
}
}
n = max;
cnt++;
}
cout << cnt << endl;
}
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int search(int n) {
int right = 0;
int ord = 1;
int ans = 0;
while(n > 0) {
right += ord * (n % 10);
ord *= 10;
n /= 10;
ans = max(ans, n*right);
}
return ans;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int Q;
cin >> Q;
while(Q--) {
int N;
cin >> N;
int cnt = 0;
while(N >= 10) {
N = search(N);
++cnt;
}
cout << cnt << endl;
}
return 0;
}
|
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
cin >> n;
for(int i=0; i<n; i++){
int x,max,cnt=0;
cin >> x;
while(x>=10){
max=0;
for(int j=10; j<x; j*=10){
int val = x/j * (x%j);
if(val > max){
max = val;
}
}
x=max;
cnt++;
}
cout << cnt << endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int Q;
int N;
int solve(int n) {
if (0 <= n && n <= 9) return 0;
int max_n = 0;
for (int i = 10; i <= n; i *= 10) {
int a = n / i;
int b = n % i;
max_n = max(max_n, a*b);
}
return solve(max_n) + 1;
}
int main() {
cin >> Q;
for (int i = 0; i < Q; i++) {
cin >> N;
cout << solve(N) << endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <string>
#include <cstdlib>
using namespace std;
int main() {
int Q;
cin >> Q;
while(Q--) {
string s;
cin >> s;
int cnt = 0;
while(s.size() > 1) {
int maxi = 0;
for(int i = 1; i < s.size(); i++) {
string left = s.substr(0, i), right = s.substr(i, s.size() - i);
//cout << left << " " << right << endl;
maxi = max(maxi, atoi(left.c_str()) * atoi(right.c_str()));
}
s = to_string(maxi);
cnt++;
}
cout << cnt << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR( i, m, n ) for( int (i) = (m); (i) < (n); (i)++ )
#define REP( i, n ) FOR( i, 0, n )
#define ALL( a ) (a).begin(), (a).end()
int main() {
int n; cin >> n;
int r, a, b, ma , cnt;
REP( i, n ) {
cin >> r;
cnt = 0;
if( r < 10 ) cnt = 0;
else {
int j;
ma = 0;
while( 1 ) {
j = 10;
while( 1 ) {
a = r % j;
b = r / j;
if( a == r ) break;
ma = max( a * b, ma );
j *= 10;
}
cnt++;
r = ma;
ma = 0;
if( r < 10 ) break;
}
}
cout << cnt << endl;
}
}
|
#include <iostream>
#include <algorithm>
#include <string>
#include <cstdio>
#include <cstdlib>
using namespace std;
string toString(int n) {
char buff[128];
sprintf(buff, "%d", n);
return string(buff);
}
int main() {
int Q;
cin >> Q;
while(Q--) {
string N;
cin >> N;
int res;
for(res = 0; N.size() != 1; ++res) {
int maxi = -1;
for(int i = 1; i < (int)N.size(); ++i) {
string a = N.substr(0,i);
string b = N.substr(i);
int tmp = atoi(a.c_str()) * atoi(b.c_str());
maxi = max(maxi, tmp);
}
N = toString(maxi);
}
cout << res << endl;
}
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
int Q;
int A;
int t[1000005];
int ans[105];
void solve(int y){
int cnt=0;
while(A>=10){
if(t[A]==y||ans[t[A]]==-1){
ans[y]=-1; break; }
t[A]=y;
int x=-1;
for(int i=10;i<A;i*=10){
int a=A/i,b=A%i;
x=max(x,a*b);
}
A=x;
cnt++;
}
ans[y]=cnt;
}
int main(){
cin>>Q;
for(int i=1;i<=Q;i++){
cin>>A;
solve(i);
}
for(int i=1;i<=Q;i++)cout<<ans[i]<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int solve(int x){
int cnt = 0;
set<int> st;
while(x >= 10){
if(st.count(x)==0) st.insert(x);
else return -1;
string s = to_string(x);
int n = s.size();
int ma = 0;
for(int i=1;i<n;i++){
int a = stoi(s.substr(0,i)), b = stoi(s.substr(i,n-i));
ma = max(ma, a*b);
}
x = ma;
cnt++;
}
return cnt;
}
int main() {
int Q, N;
cin >> Q;
for(int i=0;i<Q;i++){
cin >> N;
cout << solve(N) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int memo[1000001];
int calc(int n) {
if(memo[n]!=-1) return memo[n];
if(n<10) return 0;
string s=to_string(n);
int to=0;
for(int i=1;i<=s.size()-1;i++) {
to=max(to,stoi(s.substr(0,i))*stoi(s.substr(i)));
}
return memo[n]=calc(to)+1;
}
int main() {
int Q,N;
scanf("%d",&Q);
memset(memo,-1,sizeof(memo));
for(int i=0;i<Q;i++) {
scanf("%d",&N);
printf("%d\n",calc(N));
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.