题解 | #八进制#

#include <bits/stdc++.h>
#define MAX 100
using namespace std;


void conv(int n,int mod){
    
    int data[MAX],len = 0;
	while(n){
		data[len++] = n % mod;
		n /= mod;	
	}
    for(len--; len >= 0; len--){
        cout<<data[len];
    }
    cout<<endl;	
}

int main(){
	int n;
	while(cin>>n){
		conv(n,8);
	}
	
}