From Hero to Zero
生活随笔
收集整理的這篇文章主要介紹了
From Hero to Zero
小編覺得挺不錯的,現在分享給大家,幫大家做個參考.
https://codeforces.com/contest/1175/problem/A
題解:模擬
/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int #define endl "\n" using namespace std; typedef long long ll; //typedef __int128 lll; const int N=100000+10; const int M=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; ll t,n,m,k,p,l,r,u,v; ll ans,cnt,flag,temp,sum; int a[N]; char str; struct node{}; int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);scanf("%I64d",&t);while(t--){scanf("%I64d%I64d",&n,&k);ans=0;if(k==1){cout<<n<<endl;continue;}while(n){if(n%k==0){n/=k;ans++;}else{ans+=n%k;n-=n%k;}}cout<<ans<<endl;}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }?
總結
以上是生活随笔為你收集整理的From Hero to Zero的全部內容,希望文章能夠幫你解決所遇到的問題。
- 上一篇: 离散数学实验题目-图
- 下一篇: Catch Overflow!