java編程思想_009吸血鬼數字

來源:互聯網
上載者:User
package com.wzs;// 吸血鬼數字是指位元為偶數的數字,可以由一對數值相乘獲得,以兩個零結尾的數值是不允許的// 例如:1260=21*60 1827=21*87 2187=27*81public class Test {public static void main(String[] args) {for (int i = 1000; i < 9999; i++) {isBloodsucker(i, com(a(i), b(i)), com(c(i), d(i)));isBloodsucker(i, com(a(i), b(i)), com(d(i), c(i)));isBloodsucker(i, com(a(i), c(i)), com(b(i), d(i)));isBloodsucker(i, com(a(i), c(i)), com(d(i), b(i)));isBloodsucker(i, com(a(i), d(i)), com(b(i), c(i)));isBloodsucker(i, com(a(i), d(i)), com(c(i), b(i)));isBloodsucker(i, com(b(i), a(i)), com(c(i), d(i)));isBloodsucker(i, com(b(i), a(i)), com(d(i), c(i)));isBloodsucker(i, com(b(i), c(i)), com(d(i), a(i)));isBloodsucker(i, com(b(i), d(i)), com(c(i), a(i)));isBloodsucker(i, com(c(i), a(i)), com(d(i), b(i)));isBloodsucker(i, com(c(i), b(i)), com(d(i), a(i)));}}// 判斷是否吸血鬼數字static void isBloodsucker(int i, int m, int n) {if (i == m * n) {System.out.println(i + " = " + m + " * " + n);}}// 組合成兩位元static int com(int i, int j) {return (i * 10) + j;}// 千位static int a(int i) {return i / 1000;}// 百位static int b(int i) {return (i % 1000) / 100;}// 十位static int c(int i) {return ((i % 1000) % 100) / 10;}// 個位static int d(int i) {return ((i % 1000) % 100) % 10;}}

輸出結果:

1260 = 21 * 601395 = 15 * 931435 = 41 * 351530 = 51 * 301827 = 87 * 212187 = 27 * 816880 = 86 * 806880 = 80 * 86

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.