首页 > 代码库 > POJ1426Find The Multiple[BFS]
POJ1426Find The Multiple[BFS]
Find The Multiple
| Time Limit: 1000MS | Memory Limit: 10000K | |||
| Total Submissions: 27433 | Accepted: 11408 | 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
Source
Dhaka 2002
听说long long可以过就愉快地写了一个水bfs
从头搜索每一位
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <queue>using namespace std;const int N=1e6,INF=1e9;typedef long long ll;ll n;queue<ll>q;ll bfs(){ ll x; while(!q.empty()) q.pop(); q.push(1); while(!q.empty()){ x=q.front(); q.pop(); if(x%n==0) return x; q.push(x*10); q.push(x*10+1); }}int main(){ while(~scanf("%lld",&n)){ if(n==0) break; printf("%lld\n",bfs()); } return 0;}
POJ1426Find The Multiple[BFS]
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。