zoukankan      html  css  js  c++  java
  • 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[220]={
    "0","1","10","111","100","10","1110","1001","1000","111111111","10","11","11100","1001",
    "10010","1110","10000","11101","1111111110","11001","100","10101","110","110101"
    ,"111000","100","10010","1101111111","100100","1101101","1110","111011","100000"
    ,"111111","111010","10010","11111111100","111","110010","10101","1000","11111",
    "101010","1101101","1100","1111111110","1101010","10011","1110000","1100001",
    "100","100011","100100","100011","11011111110","110","1001000","11001","11011010",
    "11011111","11100","100101","1110110","1111011111","1000000","10010","1111110",
    "1101011","1110100","10000101","10010","10011","111111111000","10001","1110","11100",
    "1100100","1001","101010","10010011","10000","1111111101","111110","101011",
    "1010100","111010","11011010","11010111","11000","11010101","1111111110","1001",
    "11010100","10000011","100110","110010","11100000","11100001","11000010","11111111111111111001","100",
    "101","1000110","11100001","1001000","101010","1000110","100010011","110111111100","1001010111","110","111","10010000","1011011","110010","1101010","110110100",
    "10101111111","110111110","100111011","111000","11011","1001010","10001100111","11101100",
    "1000","11110111110","11010011","10000000","100100001","10010","101001","11111100","11101111","11010110","11011111110","11101000","10001","100001010",
    "110110101","100100","10011","100110","1001","1111111110000","11011010","100010","1100001","11100","110111","11100","1110001","11001000","10111110111","10010","1110110","1010100",
    "10101101011","100100110","100011","100000","11101111",
    "11111111010","1010111","1111100","1111110","1010110","11111011","10101000","10111101","111010","1111011111","110110100","1011001101","110101110","100100","110000","100101111",
    "110101010","11010111","11111111100","1001111","10010","100101","110101000","1110","100000110","1001011","1001100","189","110010","11101111","111000000","11001","111000010",
    "101010","110000100","1101000101","111111111111111110010","111000011","1000"
    };
    //189没有暴力出来,然而,测试数据没有189 
    int main()
    {
        int n;
        while (scanf("%d", &n)!=EOF && n) {
            cout<<arr[n]<<endl;
        }
        return 0;
    }
  • 相关阅读:
    MFC对话框编程四:输入焦点的传递
    lua笔记 一个C++调用lua函数的类的实现
    [置顶] 设计模式之享元模式
    扩展实现PHP Benchmark
    TLD如何运行OpenTLD(TLD_HY20121127)
    [Oracle] Kill Session 经验总结
    php 该如何获取从百度搜索进入网站的关键词
    php+js实现百度地图多点标注的方法
    laraveladmin 报错 Disk [admin] not configured, please add a disk config in `config/filesystems.php`....
    PHP获取当前页面的url
  • 原文地址:https://www.cnblogs.com/slothrbk/p/9074031.html
Copyright © 2011-2022 走看看