POJ_1426 Find The Multiple解题报告
来源：互联网 发布：中国动物资源数据库 编辑：程序博客网 时间：2024/06/06 00:36
Find The Multiple
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10905 Accepted: 4470 Special Judge
Description
Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 200 and there is a corresponding m containing no more than 100 decimal digits.
Input
The input file may contain multiple test cases. Each line contains a value of n (1 <= n <= 200). A line containing a zero terminates the input.
Output
For each value of n in the input print a line containing the corresponding value of m. The decimal representation of m must not contain more than 100 digits. If there are multiple solutions for a given value of n, any one of them is acceptable.
Sample Input
26190
Sample Output
10100100100100100100111111111111111111
题目连接：http://poj.org/problem?id=1426
算法类型：BFS && 打表.....
算法实现：
这个老是说我超内存，于是我打表了...#include<stdio.h>#include<stdlib.h>#include<string.h>int n;__int64 q[2000000];__int64 bfs( int n){__int64 U; int rear,front;rear=0;front=0;q[rear++]=1; while(front<rear) { U=q[front++]; if(U%n==0) return U; else { q[rear++]=U*10; q[rear++]=U*10+1; } } return 0;}int main(){while(scanf("%d",&n) && n){memset(q,0,sizeof(q));if(bfs(n)){printf("%I64d\n",bfs(n));}}return 0;}打表代码：#include<stdio.h>int main(){__int64 a[200]={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 n;while(scanf("%d",&n)!=EOF){if(n==0)break;printf("%I64d\n",a[n-1]);}return 0;}
- POJ_1426 Find The Multiple解题报告
- Find The Multiple(POJ_1426)
- POJ_1426 Find The Multiple（dfs）
- POJ-1426 Find The Multiple 解题报告
- E_Find The Multiple(POJ_1426)
- poj_1426 Find The Multiple（bfs + 同余模定理）
- POJ_1426 FIND THE MULITIPLE [数字dfs]
- [leetcode] 277. Find the Celebrity 解题报告
- [leetcode] 389. Find the Difference 解题报告
- leetcode 389. Find the Difference 解题报告
- 【LeetCode】Find the Difference 解题报告
- [Leetcode] 277. Find the Celebrity 解题报告
- [Leetcode] 389. Find the Difference 解题报告
- POJ1426 Find The Multiple
- poj1426 Find The Multiple
- G - Find The Multiple
- poj1426 - Find The Multiple
- POJ1426 Find The Multiple
- linux中的常用快捷键
- POJ_2676 数独解题报告
- c语言下的system（）
- POJ_3126Prime Path解题报告
- 【读书笔记】HeadFirst设计模式——工厂模式简述
- POJ_1426 Find The Multiple解题报告
- 学习android所需Java知识点列表
- Mars老师的Android学习基本路线
- hdoj 3086 Need for Speed（解方程）
- hdoj 1221 Rectangle and Circle(判点的位置)
- Ext [DDTabPanel、FoodImageField、ImageChooser]扩展组件
- poj Nearest Common Ancestors（LCA+Tarjan）
- 安装Win7提示“未找到任何驱动器”
- 为什么你是不合格的PHP程序员？（二）
