©2020-2024 ioDraw All rights reserved
1. Divisor problem
public class Main { // For an integer , The number that can divide this integer is called the divisor of this number . // for example ：1, 2, 3, 6 All 6 Divisor of . //
Excuse me? 78120 How many divisors are there public static void main(String[] args) { int yueshu=0; for(int
i=1;i<=78120;i++){ if(78120%i==0){ yueshu++; } }
System.out.println("78120 have "+yueshu+" Divisor "); } }
This question is more basic Direct traversal Then judge the conditions
remember !! You must only submit answers No need to submit source code （doge）
2. Running training
The code is as follows ：
public class run { static int []week={6,7,1,2,3,4,5};// Saturday, January 1st , Push back in turn static int
[]months={0,31,28,31,30,31,30,31,31,30,31,30,31}; public static void
main(String[] args) { int ans=0; int sumday=0;// Total days . Used to judge the day of the week // year for(int
year=2000;year<=2020;year++){ // Determine whether it is a leap year if(!check(year)){ // Leap years are not normal for(int
month=1;month<=12;month++){ for(int day=1;day<=months[month];day++){
if(day==1||week[sumday%7]==1) ans+=2; else ans++; sumday++; } } } // It's a leap year else {
if(year==2020){// Special judgment 2020 Because this year 10 Month run for (int month = 1; month <= 10; month++)
{ if(month==10){ ans+=2; break; } if (month != 2&&month<10) { for (int day = 1;
day <= months[month]; day++) { if (day == 1 || week[sumday % 7] == 1) ans += 2;
else ans++; sumday++; } } else if(month==2){ for (int day = 1; day <= 29;
day++) { if (day == 1 || week[sumday % 7] == 1) ans += 2; else ans++; sumday++;
} } } } else { for (int month = 1; month <= 12; month++) { if (month != 2) {
for (int day = 1; day <= months[month]; day++) { if (day == 1 || week[sumday %
7] == 1) ans += 2; else ans++; sumday++; } } else { for (int day = 1; day <=
29; day++) { if (day == 1 || week[sumday % 7] == 1) ans += 2; else ans++;
sumday++; } } } } } } System.out.println(ans); } static boolean check(int
year){ if((year%4==0&&year%100!=0)||year%400==0){ return true; } else return
false; } }
I prefer the following use api Practice Better
The code is as follows ：
import java.text.SimpleDateFormat; import java.util.Calendar; public class
Main { public static void main(String[] args) { Calendar start =
Calendar.getInstance(); Calendar end = Calendar.getInstance(); start.set(2000,
Calendar.JANUARY, 1); end.set(2020, Calendar.OCTOBER, 1); int res = 0; do {
System.out.println(new SimpleDateFormat("yyyy-MM-dd").format(start.getTime()));
start.add(Calendar.HOUR, 24); res += start.get(Calendar.DAY_OF_WEEK) ==
Calendar.MONDAY || start.get(Calendar.DAY_OF_MONTH) == 1 ? 2 : 1; } while
(start.getTimeInMillis() < end.getTimeInMillis()); System.out.println(res); } }
The answer is 8878 Kilometer
Be sure to remember Direct submission The answer is good !!
The above is what I give to my friends Prepare two basic questions
I will write more similar real questions later Ha
If my article is helpful to friends
Three company, please ba（ dog's head ）
I wish you all the best a new year offer Get soft ha ha ha
Technology