19 Counting Sundays - Project Euler
来源:互联网 发布:日本人的退休生活知乎 编辑:程序博客网 时间:2024/05/16 11:20
9package xxx.xxx.xxx;
import java.util.ArrayList;
/*
* You are given the following information, but you may prefer to do some research for yourself.
* 1 Jan 1900 was a Monday.
* Thirty days has September,April, June and November.
* All the rest have thirty-one,
* Saving February alone,
* Which has twenty-eight, rain or shine.
* And on leap years, twenty-nine.
* A leap year occurs on any year evenly divisible by 4, but not on a century unless it is divisible by 400.
* How many Sundays fell on the first of the month during the twentieth century (1 Jan 1901 to 31 Dec 2000)?
*/
public class CountingSundays {
private void simpleCompute2(int standardYear, int standardMonth,int startYear,int startMonth, int endYear, int endMonth){
int year = standardYear;
int daysInANormalYear = 365;
int daysInALeapYear = 366;
int leapYearCount = 0;
int normalYearCount = 0;
ArrayList<Integer> firstDays = new ArrayList<Integer>();
int sum = 0;
while(year<=endYear){
if((year%4==0&&year%100!=0)||year%400==0){
firstDays.add(normalYearCount*365+leapYearCount*366+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+29+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+29+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+30+31+29+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+30+31+29+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+30+31+30+31+29+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+30+31+30+31+29+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+31+30+31+30+31+29+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+30+31+31+30+31+30+31+29+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+30+31+31+30+31+30+31+29+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+30+31+30+31+31+30+31+30+31+29+31+1);
sum += daysInALeapYear;
leapYearCount++;
}else{
firstDays.add(normalYearCount*365+leapYearCount*366+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+28+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+28+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+30+31+28+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+30+31+28+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+30+31+30+31+28+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+30+31+30+31+28+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+31+30+31+30+31+28+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+30+31+31+30+31+30+31+28+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+30+31+31+30+31+30+31+28+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+30+31+30+31+31+30+31+30+31+28+31+1);
sum += daysInANormalYear;
normalYearCount++;
}
year++;
}
// System.out.println(firstDays);
// System.out.println(firstDays.size());
int sundaysOnTheFirstOfAmonth = 0;
int startIndex = (startYear-standardYear)*12+startMonth-standardMonth;
for(int i = startIndex; i<firstDays.size();i++){
if(firstDays.get(i)%7==0){
sundaysOnTheFirstOfAmonth++;
// System.out.println(firstDays.get(i));
}
}
System.out.println("sundaysOnTheFirstOfAmonth "+sundaysOnTheFirstOfAmonth);
}
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
CountingSundays countingSundays =new CountingSundays();
countingSundays.simpleCompute2(1900,1,1901,1,2000,12);
}
}
import java.util.ArrayList;
/*
* You are given the following information, but you may prefer to do some research for yourself.
* 1 Jan 1900 was a Monday.
* Thirty days has September,April, June and November.
* All the rest have thirty-one,
* Saving February alone,
* Which has twenty-eight, rain or shine.
* And on leap years, twenty-nine.
* A leap year occurs on any year evenly divisible by 4, but not on a century unless it is divisible by 400.
* How many Sundays fell on the first of the month during the twentieth century (1 Jan 1901 to 31 Dec 2000)?
*/
public class CountingSundays {
private void simpleCompute2(int standardYear, int standardMonth,int startYear,int startMonth, int endYear, int endMonth){
int year = standardYear;
int daysInANormalYear = 365;
int daysInALeapYear = 366;
int leapYearCount = 0;
int normalYearCount = 0;
ArrayList<Integer> firstDays = new ArrayList<Integer>();
int sum = 0;
while(year<=endYear){
if((year%4==0&&year%100!=0)||year%400==0){
firstDays.add(normalYearCount*365+leapYearCount*366+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+29+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+29+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+30+31+29+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+30+31+29+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+30+31+30+31+29+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+30+31+30+31+29+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+31+30+31+30+31+29+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+30+31+31+30+31+30+31+29+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+30+31+31+30+31+30+31+29+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+30+31+30+31+31+30+31+30+31+29+31+1);
sum += daysInALeapYear;
leapYearCount++;
}else{
firstDays.add(normalYearCount*365+leapYearCount*366+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+28+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+28+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+30+31+28+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+30+31+28+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+30+31+30+31+28+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+30+31+30+31+28+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+31+30+31+30+31+28+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+30+31+31+30+31+30+31+28+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+31+30+31+31+30+31+30+31+28+31+1);
firstDays.add(normalYearCount*365+leapYearCount*366+30+31+30+31+31+30+31+30+31+28+31+1);
sum += daysInANormalYear;
normalYearCount++;
}
year++;
}
// System.out.println(firstDays);
// System.out.println(firstDays.size());
int sundaysOnTheFirstOfAmonth = 0;
int startIndex = (startYear-standardYear)*12+startMonth-standardMonth;
for(int i = startIndex; i<firstDays.size();i++){
if(firstDays.get(i)%7==0){
sundaysOnTheFirstOfAmonth++;
// System.out.println(firstDays.get(i));
}
}
System.out.println("sundaysOnTheFirstOfAmonth "+sundaysOnTheFirstOfAmonth);
}
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
CountingSundays countingSundays =new CountingSundays();
countingSundays.simpleCompute2(1900,1,1901,1,2000,12);
}
}
0 0
- 19 Counting Sundays - Project Euler
- Project Euler 19: Counting Sundays
- project euler 19 Counting Sundays
- Project Euler 题解 #19 Counting Sundays
- Project Euler:Problem 19 Counting Sundays
- Project Euler Problem 19 Counting Sundays
- Euler: Counting Sundays
- Problem 19:Counting Sundays
- PE 19 Counting Sundays
- Counting Sundays
- projecteuler---->problem=19----Counting Sundays
- Problem 19 Counting Sundays (计算星期天)
- [projecteuler]Counting Sundays
- Project Euler:Problem 72 Counting fractions
- Project Euler:Problem 76 Counting summations
- Project Euler:Problem 85 Counting rectangles
- 欧拉项目 第19题 Counting Sundays
- Project Euler problem 19
- hadoop的五个守护进程
- 从头认识java-4.9 枚举类型
- 【读书笔记】程序员的自我修养总结(五)
- Eclipse中JSP生成的class文件去了哪里?
- CocoaPods安装和使用
- 19 Counting Sundays - Project Euler
- awk 控制结构
- Unity3d 调用外部视频
- ecshop中 dwt, lbi 文件详解
- Spring MVC 3.2 技术预览(三):动手写一个异步Controller方法
- 取消ListView点击变色
- 深入理解网络技术内幕 阅读笔记(一)
- CocoaPods的安装和使用
- spring-boot学习