Skip to main content

Use Java to write a simple solar calendar


Photo by Ketut Subiyanto from Pexels 

The difficulty of printing a month’s calendar is to find out the number of weeks corresponding to the first day of the month. A good way to solve this problem is to find out that the first day of January of the year corresponds to Monday, so that the number of weeks on the first day of the month required = (the total number of days between the year and the year entered + the number of days lost The total number of days between January of the year and the month entered + 1)%7. Then the year I was looking for was 1900. 



import java.util.Scanner;



public class Calendar {

    public static void main(String[] args) {

        //Enter the year and month

        //Calculate the total number of days between 1900 and the year entered

        //Judging the average leap year

        Scanner scanner=new Scanner(System.in);

        System.out.println("Enter a year:");

        int year=scanner.nextInt();

        int yearTotalDays = 0;

        for(int i=1900;i<year;i++) {

            if (i % 4 == 0 && i % 100 != 0 || i % 400 == 0) {

                yearTotalDays += 366;

            } else {

                yearTotalDays += 365;

            }

        }

       //Calculate the total number of days from January of the year entered to the month entered

        System.out.println("Enter a month:");

        int month=scanner.nextInt();

        int monthTotalDays=0;

        int days=0;

        for(int m=1;m<=month;m++){      //The equal sign of m here is not used when calculating, but to avoid reconsidering how many days there are in the month when printing the input month below

            //Determine the number of days in each month (big month, small month, February (also judge whether it is a normal year or a leap year)))

            switch(m){

                case 2:

                    //Determine whether the lost year is a leap year

                    if(year%4 == 0 && year%100 != 0 || year%400 == 0){

                        days = 29;

                    }else{

                        days = 28;

                    }

                    break;

                //Small Moon

                case 4:

                case 6:

                case 9:

                case 11:

                    days=30;

                    break;

                //Big moon

                default:

                  days=31;

            }

            //Accumulate the total number of days in each month

            if(m<month){

                monthTotalDays+=days;

            }

        }

        //Calculate the week number of the first day of the entered month

            int week=(yearTotalDays+monthTotalDays+1)%7;

        //Because the value of Sunday is 0, in order to control the position of the first print, it is necessary to set Sunday to 7

        if(week==0){

           week=7;

        }

        System.out.println("一\t二\t三\t四\t五\t六\t七");

        //Control the spacing of printing

        for(int b=1;b<week;b++){

            System.out.print("\t");

        }

        //Print every day of the month

        for(int d=1;d<=days;d++) {

            System.out.print(d+"\t");

            //Judge whether every day is Sunday

            if ((yearTotalDays + monthTotalDays + d) % 7 == 0) {

                //Wrap

                System.out.println();

            }

        }

    }


}



Comments

Popular posts from this blog

Defination of the essential properties of operating systems

Define the essential properties of the following types of operating sys-tems:  Batch  Interactive  Time sharing  Real time  Network  Parallel  Distributed  Clustered  Handheld ANSWERS: a. Batch processing:-   Jobs with similar needs are batched together and run through the computer as a group by an operator or automatic job sequencer. Performance is increased by attempting to keep CPU and I/O devices busy at all times through buffering, off-line operation, spooling, and multi-programming. Batch is good for executing large jobs that need little interaction; it can be submitted and picked up later. b. Interactive System:-   This system is composed of many short transactions where the results of the next transaction may be unpredictable. Response time needs to be short (seconds) since the user submits and waits for the result. c. Time sharing:-   This systems uses CPU scheduling and multipro-gramming to provide economical interactive use of a system. The CPU switches rapidl

What is a Fair lock in multithreading?

  Photo by  João Jesus  from  Pexels In Java, there is a class ReentrantLock that is used for implementing Fair lock. This class accepts optional parameter fairness.  When fairness is set to true, the RenentrantLock will give access to the longest waiting thread.  The most popular use of Fair lock is in avoiding thread starvation.  Since longest waiting threads are always given priority in case of contention, no thread can starve.  The downside of Fair lock is the low throughput of the program.  Since low priority or slow threads are getting locks multiple times, it leads to slower execution of a program. The only exception to a Fair lock is tryLock() method of ReentrantLock.  This method does not honor the value of the fairness parameter.

How do clustered systems differ from multiprocessor systems? What is required for two machines belonging to a cluster to cooperate to provide a highly available service?

 How do clustered systems differ from multiprocessor systems? What is required for two machines belonging to a cluster to cooperate to provide a highly available service? Answer: Clustered systems are typically constructed by combining multiple computers into a single system to perform a computational task distributed across the cluster. Multiprocessor systems on the other hand could be a single physical entity comprising of multiple CPUs. A clustered system is less tightly coupled than a multiprocessor system. Clustered systems communicate using messages, while processors in a multiprocessor system could communicate using shared memory. In order for two machines to provide a highly available service, the state on the two machines should be replicated and should be consistently updated. When one of the machines fails, the other could then take‐over the functionality of the failed machine. Some computer systems do not provide a privileged mode of operation in hardware. Is it possible t