【POJ1426】Find The Multiple(搜索+打表)

记录一个菜逼的成长。。

BFS加打表水过。。

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <deque>
#include <cctype>
#include <bitset>
#include <cmath>
using namespace std;
#define ALL(v) (v).begin(),(v).end()
#define cl(a,b) memset(a,b,sizeof(a))
#define bp __builtin_popcount
#define pb push_back
#define mp make_pair
#define fin freopen("D://in.txt","r",stdin)
#define fout freopen("D://out.txt","w",stdout)
#define lson t<<1,l,mid
#define rson t<<1|1,mid+1,r
#define seglen (node[t].r-node[t].l+1)
#define pi 3.1415926
#define exp  2.718281828459
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef vector<PII> VPII;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
template <typename T>
inline void read(T &x){
    T ans=0;
    char last=' ',ch=getchar();
    while(ch<'0' || ch>'9')last=ch,ch=getchar();
    while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
    if(last=='-')ans=-ans;
    x = ans;
}
inline bool DBread(double &num)
{
    char in;double Dec=0.1;
    bool IsN=false,IsD=false;
    in=getchar();
    if(in==EOF) return false;
    while(in!='-'&&in!='.'&&(in<'0'||in>'9'))
        in=getchar();
    if(in=='-'){IsN=true;num=0;}
    else if(in=='.'){IsD=true;num=0;}
    else num=in-'0';
    if(!IsD){
        while(in=getchar(),in>='0'&&in<='9'){
            num*=10;num+=in-'0';}
    }
    if(in!='.'){
        if(IsN) num=-num;
            return true;
    }else{
        while(in=getchar(),in>='0'&&in<='9'){
                num+=Dec*(in-'0');Dec*=0.1;
        }
    }
    if(IsN) num=-num;
    return true;
}
template <typename T>
inline void write(T a) {
    if(a < 0) { putchar('-'); a = -a; }
    if(a >= 10) write(a / 10);
    putchar(a % 10 + '0');
}
/******************head***********************/
int vis[110],n,cnt;
struct node{
    int a[110];
    int len,cal;
    node(){len = 0;}
};
int bfs()
{
    cl(vis,0);
    queue<node>q;
    node x,y;
    x.a[x.len++] = 1;
    x.cal = 1%n;
    q.push(x);
    while(!q.empty()){
        x = q.front();q.pop();
        if(x.cal % n == 0){
            printf(",{\"");
            for(int i = 0; i < x.len; i++ ){
                printf("%d",x.a[i]);
            }
            printf("\"}");
            return 1;
        }
        else {
            y = x;
            y.cal = y.cal*10 % n;//一种末尾放0;
            y.a[y.len++] = 0;
            q.push(y);
            y.cal = (y.cal + 1) % n;//一种末尾放1;
            y.a[y.len-1] = 1;
            q.push(y);
        }
    }
    return 0;
}
char ans[200][50] = {{"1"},{"10"},{"111"},{"100"},{"10"},{"1110"},{"1001"},{"1000"},{"111111111"},{"10"},{"11"},{"11100"},{"1001"},{"10010"},{"1110"},{"10000"},{"11101"},{"1111111110"},{"11001"},{"100"},{"10101"},{"110"},{"110101"},{"111000"},{"100"},{"10010"},{"1101111111"},{"100100"},{"1101101"},{"1110"},{"111011"},{"100000"},{"111111"},{"111010"},{"10010"},{"11111111100"},{"111"},{"110010"},{"10101"},{"1000"},{"11111"},{"101010"},{"1101101"},{"1100"},{"1111111110"},{"1101010"},{"10011"},{"1110000"},{"1100001"},{"100"},{"100011"},{"100100"},{"100011"},{"11011111110"},{"110"},{"1001000"},{"11001"},{"11011010"},{"11011111"},{"11100"},{"100101"},{"1110110"},{"1111011111"},{"1000000"},{"10010"},{"1111110"},{"1101011"},{"1110100"},{"10000101"},{"10010"},{"10011"},{"111111111000"},{"10001"},{"1110"},{"11100"},{"1100100"},{"1001"},{"101010"},{"10010011"},{"10000"},{"1111111101"},{"111110"},{"101011"},{"1010100"},{"111010"},{"11011010"},{"11010111"},{"11000"},{"11010101"},{"1111111110"},{"1001"},{"11010100"},{"10000011"},{"100110"},{"110010"},{"11100000"},{"11100001"},{"11000010"},{"111111111111111111"},{"100"},{"101"},{"1000110"},{"11100001"},{"1001000"},{"101010"},{"1000110"},{"100010011"},{"110111111100"},{"1001010111"},{"110"},{"111"},{"10010000"},{"1011011"},{"110010"},{"1101010"},{"110110100"},{"10101111111"},{"110111110"},{"100111011"},{"111000"},{"11011"},{"1001010"},{"10001100111"},{"11101100"},{"1000"},{"11110111110"},{"11010011"},{"10000000"},{"100100001"},{"10010"},{"101001"},{"11111100"},{"11101111"},{"11010110"},{"11011111110"},{"11101000"},{"10001"},{"100001010"},{"110110101"},{"100100"},{"10011"},{"100110"},{"1001"},{"1111111110000"},{"11011010"},{"100010"},{"1100001"},{"11100"},{"110111"},{"11100"},{"1110001"},{"11001000"},{"10111110111"},{"10010"},{"1110110"},{"1010100"},{"10101101011"},{"100100110"},{"100011"},{"100000"},{"11101111"},{"11111111010"},{"1010111"},{"1111100"},{"1111110"},{"1010110"},{"11111011"},{"10101000"},{"10111101"},{"111010"},{"1111011111"},{"110110100"},{"1011001101"},{"110101110"},{"100100"},{"110000"},{"100101111"},{"110101010"},{"11010111"},{"11111111100"},{"1001111"},{"10010"},{"100101"},{"110101000"},{"1110"},{"100000110"},{"1001011"},{"1001100"},{"1010111010111"},{"110010"},{"11101111"},{"111000000"},{"11001"},{"111000010"},{"101010"},{"110000100"},{"1101000101"},{"1111111111111111110"},{"111000011"},{"1000"}};
int main()
{
    //fin;
    //fout;
    while(~scanf("%d",&n),n){
        //bfs();
        printf("%s\n",ans[n-1]);
    }
    return 0;
}