每日二题，每日一水

dfs

https://pintia.cn/problem-sets/994805260223102976/exam/problems/994805325918486528

#include<bits/stdc++.h> 

using namespace std;
typedef long long ll;
const int N=2e5+9;
void moyuhualuo(){
	
}
int ans;
void dfs(int n){
	if(n==1) return;
	if(n%2==0){
		ans++;
		dfs(n/2); 
	}else{
		dfs((3*n+1)/2);
		ans++;
	}
}
int main( )
{
	cin.tie(nullptr)->sync_with_stdio(false);
	//moyuhualuo();
	int n; cin>>n;
	dfs(n);
	cout<<ans;
    return 0;
}

纯纯模拟

https://pintia.cn/problem-sets/994805260223102976/exam/problems/994805324509200384

#include<bits/stdc++.h> 

using namespace std;
typedef long long ll;
const int N=2e5+9;
string ss[11]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu","shi"};
void moyuhualuo(){
	string s;
	cin>>s;
	ll sum=0;
	for(auto c:s){
		sum+=c-48;
	} //cout<<sum<<endl;
	string ans[10000];
	int cc=0;
	while(sum){
		ans[cc++]=ss[sum%10];
		sum/=10;
	}
	for(int i=cc-1;i>=0;i--){
		if(i==0){
			cout<<ans[i];
		}else{
				cout<<ans[i]<<' ';
		}
	}
}
int main( )
{
	cin.tie(nullptr)->sync_with_stdio(false);
	moyuhualuo();
    return 0;
}