Submission

Score: 100

User: matcherbrainner

Problemset: แปลงเลขฐาน

Language: cpp

Time: 0.004 second

Submitted On: 2026-10-03 15:52:06

#include<bits/stdc++.h>
using namespace std;
int main(){
	string num1;
	cin>>num1;
	long long n1=0;
	for(int i=0;i<num1.size();i++){
		char p=num1[i];
		int val;
		if(p>='A'&&p<='F'){
			val=p-'A'+10;
		}
		else{
			val=p-'0';
		}
		n1=n1*16+val;
	}
	long long n2=n1;
	if(n1==0){
		cout<<"0\n"<<"0";
		return 0;
	}
	string result2="",result8="";
	string dig="0123456789ABCDEF";
	while(n1>0){
		int remme=n1%2;
		result2=dig[remme]+result2;
		n1=n1/2;
	}
	while(n2>0){
		int remme=n2%8;
		result8=dig[remme]+result8;
		n2=n2/8;
	}
	
	cout<<result2<<"\n"<<result8;
}