Submission
Status:
PPPPPPPPPP
Subtask/Task Score:
100/100
Score: 100
User: nxtx_ss
Problemset: แปลงเลขฐาน
Language: cpp
Time: 0.003 second
Submitted On: 2025-10-03 14:37:54
#include<bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
int a[s.length()],sm=0, k[10000]={9},x;
for(int i=0; i<s.length(); i++) {
if ('A'<=s[i] && s[i]<='F') {
a[i]=(s[i]-'A'+10)*pow(16,s.length()-1-i);
}
else{
a[i]=(s[i]-'0')*pow(16,s.length()-1-i);
}
sm=a[i]+sm;
x=sm;
}
int r=0;
while (sm>0) {
k[r]=sm%2;
sm=sm/2;
r++;
}
for(int i=r-1; i>=0; i--){
cout<<k[i];
}
r=0;
cout<<"\n";
while (x>0) {
k[r]=x%8;
x=x/8;
r++;
}
for(int i=r-1; i>=0; i--){
cout<<k[i];
}
}