poj-1426-Find The Multiple(打表水过)

思路：

2的最近可以整除的数是10

所以，很关键的一点，只要是偶数，例如：

6:2*3，可以拆分为能够被2整除和能够被3整除的乘积，所以，10*111=1110

144:72*2,8*9*2,2*2*2*2*3*3，能够整除9的后面加4个0，1111111110000

java至于素数，java暴力打表

#include<stdio.h>
#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
string arr[]={
"","","","","","","","","","","","","","",
"","","","","","","","","",""
,"","","","","","","","",""
,"","","","","","","","","",
"","","","","","","","",
"","","","","","","","","",
"","","","","","","","",
"","","","","","","","","",
"","","","","","","","",
"","","","","","","","",
"","","","","","","","","",
"","","","","","","","","","","","","","","","",
"","","","","","","","",
"","","","","","","","","","","","","","",
"","","","","","","","","","","","","","","","","","",
"","","","","",
"","","","","","","","","","","","","","","","",
"","","","","","","","","","","","","","","","","",
"","","","","",""
};
//189没有暴力出来，然而，测试数据没有189
int main()
{
    int n;
    while (scanf("%d", &n)!=EOF && n) {
        cout<<arr[n]<<endl;
    }
    return ;
}