【Algorithm】算法设计与分析(第二版)- 王红梅 - JAVA实现:1.5.编写程序,求n至少为多大时,n个“1”组成的整数能被2013整除

    科技2022-07-16  109

    1.5.编写程序,求n至少为多大时,n个“1”组成的整数能被2013整除 

    package firstChapter; public class N1Division { public int n1Division() { int count = 1; double num = 1; while (count <= 10000) { num = num * 10 + 1; if (num % 2013 == 0) { break; } count ++; } // // for (count = 1; count <= 10000; count++) { // num = num * 10 + 1; // if (num % 2013 == 0) { System.out.println(num); // break; // } // } return count; } public static void main(String[] args) { N1Division n1D = new N1Division(); int res = n1D.n1Division(); System.out.println(res); } }

     

    Processed: 0.010, SQL: 8