poj1426 Find The Multiple
来源:互联网 发布:足彩大数据app 编辑:程序博客网 时间:2024/05/05 10:09
Find The Multiple
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 29065 Accepted: 12059 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
想过用longlong试试,wa,看了题解用unsigned longlong可以过,较坑,但你想不到就过不了
#include<stdio.h>int flog=0;unsigned long long int ans[205];int dfs(unsigned long long int m,int x,int k){//printf("%lld\n",m);if(flog||k>=19)return 0;if(m%x==0){printf("%I64u\n",m);ans[x]=m;flog=1;return 0;}dfs(m*10,x,k+1);dfs(m*10+1,x,k+1);}int main(){int n;while(scanf("%d",&n),n){flog=0;dfs(1,n,0);}return 0;}
0 0
- POJ1426 Find The Multiple
- poj1426 Find The Multiple
- poj1426 - Find The Multiple
- POJ1426 Find The Multiple
- POJ1426-Find The Multiple
- poj1426 Find The Multiple
- poj1426-Find The Multiple
- POJ1426 Find the multiple
- POJ1426-Find The Multiple
- POJ1426 Find The Multiple
- poj1426 Find The Multiple
- Find The Multiple poj1426
- poj1426 find the multiple
- POJ1426 - Find The Multiple
- poj1426 Find The Multiple
- poj1426 Find The Multiple
- poj1426: Find the Multiple
- POJ1426 Find The Multiple
- 顺序表应用6:有序顺序表查询
- 【Untiy插件】Ink Unity Integration
- BurpSuite系列(九)----Comparer模块(比较器)
- Python函数-天然的模板
- leetcode 13. Roman to Integer
- poj1426 Find The Multiple
- git创建本地版本仓库
- Java SE 基础:一维数组
- tensorflow编程一些需要知道的 - 2
- poj 3279 Fliptile
- 【Java语言程序设计(基础篇)第10版 练习题答案】Practice_9_2
- genymotion
- PHP的转义函数 htmlspecialchars、strip_tags、addslashes解释
- noi-7878-金币