标签:sam spl problem div des c++ click 32位 技术
1 #include<iostream> 2 #include<iomanip> 3 //#include<bits/stdc++.h> 4 #include<cstdio> 5 #include<cmath> 6 #include<cstring> 7 #include<sstream> 8 #define PI 3.14159265358979 9 #define LL long long 10 #define eps 0.00000001 11 #define LL long long 12 using namespace std; 13 int main() 14 { 15 LL n,m;int ans[1001]; 16 while(cin>>n>>m) 17 { 18 bool r=true;int Y=n; 19 if(n<0) {r=0;n=-n;} 20 if(n==0) {cout<<0<<endl;continue;} 21 int k=1; 22 while(n) 23 { 24 ans[k++]=n%m; 25 n/=m; 26 27 } 28 if(r==0) cout<<‘-‘; 29 for(int i=k-1;i>=1;--i) 30 { 31 if(m>=10&&ans[i]>=10) cout<<char(55+ans[i]); 32 else cout<<ans[i]; 33 } 34 cout<<endl; 35 } 36 }
标签:sam spl problem div des c++ click 32位 技术
原文地址:https://www.cnblogs.com/Auroras/p/10801683.html