public class BillClock { /* Challenge Write a program to determine the time (hh:mm:ss) on any day in which the LED clock have the lowest and highest brightness respectively. The LED clock display the time in following format. { Hour } : { Minute } : { Second } Here's the brightness of each digit represented in LED (Digit 0 first) :- */ public static final int[] lds = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6}; /* I have two problems with this challenge. Firstly, to what extent can we use our problem solving and to what do we use the computer? */ public enum Iqs{ // my 1st time using enum in Java BruteForce, // Try every possible time (Not tried. Requires 86400 iterations!) Better, // dimmest and brightest seconds are the same as the dimmest and brightest minutes Best, // 2nd digits are independent of first digits except for hours starting with 2. Knowall // The answer is obvious just looking at the problem. } public static Iqs IQ = Iqs.Best; /* Should blanks replace leading zeroes? */ public enum Blanks{ BlNone, // Don't blank any leading zeroes. BlHours, // Blank leading zeroes in hours only BlAll // Blank all leading zeroes } public static Blanks BL = Blanks.BlNone; public static void main(String[] args) { int br, h0, h1, m0, m1; int dbr=50, dh0=0, dh1=0, dm0=0, dm1=0, ds0=0, ds1=0; int bbr=0, bh0=0, bh1=0, bm0=0, bm1=0, bs0=0, bs1=0; if(IQ!=Iqs.Knowall){ int minh = BL==Blanks.BlNone?0:10; int minm = BL==Blanks.BlAll?1:0; for(int h=minh; h<24; h++){ h0 =h/10; h1 = h%10; if(IQ!=Iqs.Best){ for(m0=minm; m0<6; m0++){ for(m1=0; m1<10; m1++){ if(IQ==Iqs.BruteForce){ for(int s0=minm; s0<6; s0++){ for(int s1=0; s1<10; s1++) { br = lds[h0] + lds[h1] +lds[m0] + lds[m1] + lds[s0] + lds[s1]; if(brbbr){ bbr = br; bh0 = h0; bh1 = h1; bm0 = m0; bm1 = m1; bs0 = s0; bs1 = s1; } } } } else{ // Better br = lds[h0] + lds[h1] +lds[m0] + lds[m1]; if(brbbr){ bbr = br; bh0 = h0; bh1 = h1; bm0 = m0; bm1 = m1; bs0 = m0; bs1 = m1; } } } } } else{ // Iqs.Best br = lds[h0] + lds[h1]; if(brbbr){ bbr = br; bh0 = h0; bh1 = h1; } } } if(IQ==Iqs.Best){ dbr = 10; bbr = 0; for(m0=minm; m0<6; m0++){ br = lds[m0]; if(brbbr){ bbr = br; bm0 = m0; } } dbr = 10; bbr = 0; for(m1=minm; m1<10; m1++){ br = lds[m1]; if(brbbr){ bbr = br; bm1 = m1; } } ds0 = dm0; ds1 = dm1; bs0 = bm0; bs1 = bm1; } } else{ // Iqs.Knowall dh0 = 1; dh1 = 1; dm0 = 1; dm1 = 1; ds0 = 1; ds1 = 1; if(BL==Blanks.BlNone){ bh0 = 0; bh1 = 8; } else{ bh0 = 2; bh1 = 0; } if(BL==Blanks.BlAll){ bm0 = 2; bs0 = 2; } else{ bm0 = 0; bs0 = 0; } bm1 = 8; bs1 = 8; } System.out.print("Dimmest time = "); if(BL==Blanks.BlNone){ System.out.print(dh0); } else{ System.out.print(" "); } System.out.print(dh1 + ":"); dh0 = ' '; if(BL!=Blanks.BlAll){ System.out.print(dm0); } else{ System.out.print(" "); } System.out.print(dm1 + ":"); if(BL!=Blanks.BlAll){ System.out.print(ds0); } else{ System.out.print(" "); } System.out.println(ds1 + "."); System.out.println("Brightest time = " + bh0 + bh1 + ":" + bm0 + bm1 + ":" + bs0 + bs1 +"."); } }