## Welcome To SDIBT ACM-ICPC Online Judge

Problem 1449. -- Find The Multiple## Find The Multiple

Time Limit: 1 Sec Memory Limit: 64 MB Special Judge

Submit: 42 Solved: 13

[Submit][Status][Discuss]## 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

2
6
19
0

## Sample Output

10
100100100100100100
111111111111111111

## HINT

poj1426

special judge OK!!

## Source

Dhaka 2002

[Submit][Status][Discuss]

HOME
Back

한국어 中文 English

All Copyright Reserved 2008-2010 SDIBT TEAM

GPL2.0 2003-2010 HUSTOJ Project TEAM

Anything about the Problems, Please Contact Admin:admin