Thread: Help on this.

once you parse month and year as ints, 1) should go easily. I assume that 2000, as you say but without looking it up, is a leap year and ignore the adjustment that they throw in once in a great that's a bit more complicated than february just having 29 days every 4 years--i.e., i'll just assume that feb has 29 days every 4 years:

if (month == 2) {
   if (year % 4 == 0) {
      System.out.print(29);
   else {
      System.out.print(28);
   }
}
else if (month <= 7) {
   if (month % 2 == 1) {
      System.out.print(31);
   }
   else {
      System.out.print(30);
   }
}
else {
   if (month % 2 == 1) {
      System.out.print(30);
   }
   else {
      System.out.print(31);
   }
}

There are also formulas out there for making interesting date calculations, but if you just need number of days in the month with no more complications than dealing with normal leap years, that should get you there.

On 2) all you really need to realize is that (a + b) % n == ((a % n) + (b % n)) % n

About #1, Do you have to actually do this yourself or are you allowed to utilize JAVA like it is intended? I ask because there are JAVA standard classes in place to do this sort of thing for you. Specifically, the Calendar (Calendar (Java Platform SE 6)) or GregorianCalendar (GregorianCalendar (Java Platform SE 6)) classes.

Example code to find the number of days in a month using the GregorianCalendar object is below:

int month, year;
 
//February
month = 1;
//Year 2000
year = 2000;
 
GregorianCalendar cal = new GregorianCalendar(year,month,1);
System.out.println("There are "+cal.getActualMaximum(GregorianCalendar.DAY_OF_MONTH)+" days in this month");