A. Towers of Boxes<\/p>\n
B. Beautiful Numbers<\/p>\n
\u76ee\u5f55<\/p>\n
A. Towers of Boxes<\/p>\n
\u9898\u610f<\/p>\n
\u601d\u8def<\/p>\n
\u6b63\u89e3\u4ee3\u7801<\/p>\n
B. Beautiful Numbers<\/p>\n
\u9898\u610f<\/p>\n
\u601d\u8def<\/p>\n
\u6b63\u89e3\u4ee3\u7801<\/p>\n
\u9898\u76ee\u7684\u610f\u601d\u5927\u81f4\u662f：\u7ed9\u4f60 n \u4e2a\u7bb1\u5b50，\u6bcf\u4e2a\u7bb1\u5b50\u7684\u91cd\u91cf\u662f m ，\u6bcf\u4e2a\u7bb1\u5b50\u7684\u627f\u91cd\u662f d \u3002\u73b0\u5728\u8981\u5c06\u8fd9\u4e9b\u7bb1\u5b50\u50cf\u53e0\u7f57\u6c49\u4e00\u6837\u5806\u6210 x\u00a0\u5806，\u95ee\u6700\u5c0f\u7684 x\u00a0\u662f\u591a\u5c11\u3002<\/p>\n
\u53ea\u8003\u8651\u6bcf\u4e00\u5806\u6700\u5e95\u4e0b\u7684\u7bb1\u5b50，\u5c3d\u53ef\u80fd\u5f80\u4e0a\u9762\u53e0\u7bb1\u5b50，\u8fd9\u6837\u6700\u7ec8\u7684\u5806\u6570\u662f\u6700\u5c11\u7684\u3002<\/p>\n
#include<bits\/stdc++.h><\/p>\n
using namespace std;<\/p>\n
int T;<\/p>\n
inline void solve(){
\n int n,m,d;
\n cin>>n>>m>>d;
\n int each = d\/m;
\n int ans = n\/(each+1);
\n if(n%(each+1) != 0) ans++;
\n cout<<ans<<endl;
\n}<\/p>\n
int main()
\n{
\n ios::sync_with_stdio(false);
\n cin.tie(0);
\n cin>>T;
\n while(T–) solve();
\n return 0;
\n} <\/p>\n
\u8fd9\u9053\u9898\u7684\u610f\u601d\u5927\u81f4\u662f：\u7ed9\u4f60\u4e00\u4e2a\u51fd\u6570 F(x) ，\u8fd9\u4e2a\u51fd\u6570\u7684\u503c\u662f x \u7684\u5404\u4f4d\u6570\u5b57\u4e4b\u548c\u3002\u73b0\u5728\u7ed9\u4f60\u4e00\u4e2a x ，\u6bcf\u4e00\u6b21\u64cd\u4f5c\u4f60\u53ef\u4ee5\u9009\u62e9\u5176\u4efb\u610f\u4e00\u4f4d，\u6539\u53d8\u8fd9\u4e00\u4f4d\u7684\u6570（\u6700\u5927\u7684\u90a3\u4f4d\u4e0d\u80fd\u53d8\u6210 0 ），\u95ee\u4f7f F(F(x)) = F(x) \u7684\u6700\u5c0f\u64cd\u4f5c\u6b21\u6570\u662f\u591a\u5c11\u3002<\/p>\n
\u7531\u4e8e x \u7684\u8303\u56f4\u8f83\u5927（1<=x<=1e18)，\u6240\u4ee5\u6211\u4eec\u8003\u8651 F(x) \u7684\u8303\u56f4，\u60ca\u8bb6\u5730\u53d1\u73b0 0<=F(x)<=162 ，\u4e8e\u662f\u6211\u4eec\u679a\u4e3e F(x) ，\u627e\u5230 F(F(x)) = F(x) \u7684 F(x) \u7684\u503c\u3002\u518d\u6b21\u60ca\u559c\u5730\u53d1\u73b0\u53ea\u6709 0 ~ 9 \u7684 F(x) \u80fd\u591f\u6ee1\u8db3\u6761\u4ef6\u3002\u6240\u4ee5，\u6211\u4eec\u7684\u76ee\u6807\u6210\u4e3a\u4e86\u4f7f\u7528\u6700\u5c0f\u7684\u64cd\u4f5c\u6b21\u6570\u4f7f F(x) < 10\u3002<\/p>\n
\u4e8e\u662f，\u6211\u4eec\u53ef\u4ee5\u628a x \u7684\u6bcf\u4e00\u4f4d\u6570\u63d0\u53d6\u51fa\u6765，\u4ece\u5927\u5230\u5c0f\u6392\u5e8f，\u6bcf\u4e00\u6b21\u90fd\u5c06\u6700\u5927\u7684\u6570\u53d8\u6210 0 ，\u76f4\u5230\u6240\u6709\u4f4d\u7684\u6570\u4e4b\u548c\u5c0f\u4e8e 10 \u3002\u8fd9\u91cc\u9700\u8981\u6ce8\u610f\u7684\u662f\u6700\u9ad8\u4f4d\u7684\u6570\u662f\u4e0d\u80fd\u53d8\u6210 0 \u7684\u3002<\/p>\n
#include<bits\/stdc++.h>
\n#define int long long<\/p>\n
using namespace std;<\/p>\n
int T;<\/p>\n
inline int F(int x){
\n int res = 0;
\n while(x){
\n res += x%10;
\n x \/= 10;
\n }
\n return res;
\n}<\/p>\n
inline void solve(){
\n int x;
\n cin>>x;
\n int sum = 0;
\n vector<int> v;
\n while(x >= 10){
\n v.push_back(x%10);
\n sum += x%10;
\n x \/= 10;
\n }
\n v.push_back(x-1);
\n sum += x;
\n x = 0;
\n sort(v.begin(),v.end());
\n reverse(v.begin(),v.end());
\n int cnt = 0;
\n for(int i:v){
\n if(sum<10) break;
\n sum -= i;
\n cnt++;
\n }
\n cout<<cnt<<'\\\\n';
\n}<\/p>\n
signed main()
\n{
\n ios::sync_with_stdio(false);
\n cin.tie(0);
\n cin>>T;
\n while(T–) solve();
\n return 0;
\n} <\/p>\n
\u4ee5\u4e0a\u5c31\u662f\u8fd9\u7bc7\u6587\u7ae0\u7684\u5168\u90e8\u5185\u5bb9\u4e86\u3002<\/p>\n","protected":false},"excerpt":{"rendered":"
A. Towers of Boxes
\nB. Beautiful Numbers
\n\u76ee\u5f55
\nA. Towers of Boxes
\n\u9898\u610f
\n\u601d\u8def
\n\u6b63\u89e3\u4ee3\u7801
\nB. Beautiful Numbers
\n\u9898\u610f
\n\u601d\u8def
\n\u6b63\u89e3\u4ee3\u7801 A. Towers of Boxes
\n\u9898\u610f
\n\u9898\u76ee\u7684\u610f\u601d\u5927\u81f4\u662f：\u7ed9\u4f60 n \u4e2a\u7bb1\u5b50，\u6bcf\u4e2a\u7bb1\u5b50\u7684\u91cd\u91cf\u662f m ，\u6bcf\u4e2a\u7bb1\u5b50\u7684\u627f\u91cd\u662f d \u3002\u73b0\u5728\u8981\u5c06\u8fd9\u4e9b\u7bb1\u5b50\u50cf\u53e0\u7f57\u6c49\u4e00\u6837\u5806\u6210 x\u00a0\u5806，\u95ee\u6700\u5c0f\u7684 x\u00a0\u662f\u591a\u5c11<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[8615,55,427],"topic":[],"class_list":["post-78171","post","type-post","status-publish","format-standard","hentry","category-server","tag-codeforces","tag-c","tag-427"],"yoast_head":"\n