E - Find The Multiple

复制代码

#include <iostream>
#include <algorithm>
using namespace std;

int n;
bool ok;

void dfs(unsigned long long x, int y, int k){
    if(ok == true) return ;
    if(x % y == 0){
        cout << x << endl;
        ok = true;
        return;
    }
    if(k == 19) return;
    dfs(x*10, y, k+1);
    dfs(x*10+1, y, k+1);
}

int main(){
    while(cin >> n){
        if( n == 0)
            break;
        ok = false;
        dfs(1, n, 0);
    }
    return 0;
}