（复习次数：1——递归混乱）Find The Multiple

http://poj.org/problem?id=1426

//虽然是说100位内，但是可以先试一下long long(10^19级) ,dfs一下
//发现居然只有198不在，特判 99->111111111111111111,所以1111111111111111110
//网上说可以unsigned long long,到20位包括之：unsigned long long的最大值：18446744073709551615 
#include<stdio.h>
long long n;
int flag;//0:找到了 
void dfs(long long k,int cnt){
	if(cnt>=19)return;
	if(k%n==0){
		printf("%lld\n",k);flag=0;return;
	}
	dfs(10*k,cnt+1);
	if(flag)dfs(10*k+1,cnt+1);
}
int main()
{
	while(scanf("%lld",&n),n){
/*	for(n=1;n<=200;n++){
		{printf("%d\n",n);
		}*/
		if(n==198){
			printf("1111111111111111110\n");
		} 
		flag=1;
		dfs(1,1);
	}
	return 0;
}

复习：
5/19
打表做了，没有想到高明的办法
0msAC
1.交上去的代码

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<map>
using namespace std;
#ifdef LOCAL
FILE*fp=freopen("text.in","r",stdin);
#endif
#define ull unsigned long long
ull p[204]={0,10000000000000000000,10000000000000000000,111,10000000000000000000,10000000000000000000,1110,1001,10000000000000000000,111111111,10000000000000000000,11,11100,1001,10010,1110,10000000000000000000,11101,1111111110,11001,10000000000000000000,10101,110,110101,111000,10000000000000000000,10010,1101111111,100100,1101101,1110,111011,10000000000000000000,111111,111010,10010,11111111100,111,110010,10101,10000000000000000000,11111,101010,1101101,1100,1111111110,1101010,10011,1110000,1100001,10000000000000000000,100011,100100,100011,11011111110,110,1001000,11001,11011010,11011111,11100,100101,1110110,1111011111,10000000000000000000,10010,1111110,1101011,1110100,10000101,10010,10011,111111111000,10001,1110,11100,1100100,1001,101010,10010011,10000000000000000000,1111111101,111110,101011,1010100,111010,11011010,11010111,11000,11010101,1111111110,1001,11010100,10000011,100110,110010,11100000,11100001,11000010,111111111111111111,10000000000000000000,101,1000110,11100001,1001000,101010,1000110,100010011,110111111100,1001010111,110,111,10010000,1011011,110010,1101010,110110100,10101111111,110111110,100111011,111000,11011,1001010,10001100111,11101100,10000000000000000000,11110111110,11010011,10000000000000000000,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,10000000000000000000,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,10000000000000000000,};
int main(){
	int i;
	while(scanf("%d",&i),i){
		printf("%llu\n",p[i]);//用llu不然乱了 
	}
	return 0;
}

2.产生数据的代码：

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<map>
using namespace std;
#ifdef LOCAL
FILE*fp=freopen("text.in","r",stdin);
#endif
#define ull unsigned long long
ull book[1<<21],p[204];
map<ull,int>m;
int cnt=0;
void pre(int w,ull p){
	if(w==-1)return;
	ull now=p+(ull)pow(10,w);
	if(m[now]==0&&now!=0){
		cnt++;
		book[cnt]=now;
		m[now]=1;
		//printf("%llu\n",now);
	}
	pre(w-1,p);
	pre(w-1,now);
}
int main(){
	pre(19,0);
	for(int i=1;i<=200;i++){
		for(int j=1;j<=cnt;j++){
			if(book[j]%i==0){
				p[i]=book[j];
				printf("p %d=%llu\n",i,p[i]); 
				break;
			} 
		}
	}
	return 0;
}

而实际上可以如此dfs:

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<map>
using namespace std;
#ifdef LOCAL
FILE*fp=freopen("text.in","r",stdin);
#endif
#define ull unsigned long long
int ok;
ull n;
void dfs(ull now,int cnt){
	if(ok||cnt>20)return;
	if(now%n){
		dfs(now*10,cnt+1),dfs(now*10+1,cnt+1);
	}else{
		printf("%llu\n",now),ok=1;
	}
}
int main(){
	while(scanf("%d",&n),n){
		ok=0;
		dfs(1,1);
	} 
	return 0;
}

从简单到复杂
——这次DFS的经验
用OK全局管控递归也值得借鉴，简单不少