poj1426解题报告
来源:互联网 发布:打印标签软件 编辑:程序博客网 时间:2024/06/08 07:05
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
题目大意:给定一个正整数,求这个数的倍数(只由'1' '0'组成)
思路:BFS 假设M不符合 则在M基础上有两种情况M1和M0 将这两种情况都入队,然后求出符合条件的M
- poj1426解题报告
- poj1426
- poj1426
- POJ1426
- poj1426
- poj1426
- poj1426
- POJ1426
- poj1426
- poj1426
- poj1426
- poj1426
- poj1426
- POJ1426
- poj1426
- POJ1426
- POJ1426
- poj1426
- linux 下计算程序运行时间 一句话说明
- SQL批量删除用户表(先删除所有外键约束,再删除所有表)
- SQL2005 批量修改架构名
- 批量修改系统中int,varchar字段的默认值
- 平台崩溃之operator new异常(二十二)-2010-8-12
- poj1426解题报告
- 动态批量修改字段属性
- c:forEach status.index 行索引的使用[转载!]
- WinCE的LCD驱动程序编写指南
- ZOJ2059The Twin Towers题解动态规划DP
- 全文索引创建实例
- MySql 基本操作
- 在库TEST上建立全文索引
- 全文检索学习