Atcoder gular round 123 c题(难度真的好大

#include<bits/stdc++.h>
using namespace std;
int digit[20];
int t[20];
long long x;
int main(){
    int T;
    cin>>T;
    while(T--){
    cin>>x;
    int cnt=0;
    while(x)digit[++cnt]=x%10,x/=10;
    
    in://入口
    bool check=1;
    int need=0;
    if(digit[cnt]==0){cnt--;goto in;//回到入口重新走一遍}
    for(int i=cnt;i>=1;i--){
        need=max(need , (digit[i]+2)/3//对3向上取整);
        if(digit[i]<need){digit[i]+=10;digit[i+1]-=1;goto in;//不合法，不用再进行了没有意义，直接回到入口再走一遍}
    }
    int ans=0;
    for(int i=1;i<=cnt;i++)ans=max(ans,(digit[i]+2)/3);
    cout<<ans<<endl;

    }
}

---

下面是官方题解

from functools import lru_cache
 
@lru_cache
def f(N):
    if N == 0:
        return 0
    n, r = divmod(N, 10)
    if 1 <= r <= 3 and f(n) <= 1:
        return 1
    if 2 <= r <= 6 and f(n) <= 2:
        return 2
    if 3 <= r <= 9 and f(n) <= 3:
        return 3
    if 4 <= r <= 9 and f(n) <= 4:
        return 4
    if 0 <= r <= 2 and f(n-1) <= 4:
        return 4
    return 5
 
for N in map(int, open(0).read().split()[1:]):
    print(f(N))

看来还是得找规律

有队友在的话就记得一定要提前教ta怎么找规律