[patl1-046]整除光棍

解题关键：模拟除法

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<iostream>
#include<cmath>
using namespace std;
typedef long long ll;
char ans[];
int main(){
    int n;
    cin>>n;
    int p=,now=;
    for(int len=;;len++,now=now*+){
        if(p||now/n){
            ans[p++]=''+now/n;
        }
        now%=n;
        if(now==){
            printf("%s %d",ans,len);
            break;
        }
    }
    return ;
}