19 Counting Sundays - Project Euler

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);
}


}
boosting-crowd-counting-via-multifaceted-attention是一种通过多方面注意力提升人群计数的方法。该方法利用了多个方面的特征来准确估计人群数量。 在传统的人群计数方法中,往往只关注人群的整体特征,而忽略了不同区域的细节。然而,不同区域之间的人群密度可能存在差异,因此细致地分析这些区域是非常重要的。 该方法首先利用卷积神经网络(CNN)提取图像的特征。然后,通过引入多个注意力机制,分别关注图像的局部细节、稀疏区域和密集区域。 首先,该方法引入了局部注意力机制,通过对图像的局部区域进行加权来捕捉人群的局部特征。这使得网络能够更好地适应不同区域的密度变化。 其次,该方法采用了稀疏区域注意力机制,它能够识别图像中的稀疏区域并将更多的注意力放在这些区域上。这是因为稀疏区域往往是需要重点关注的区域,因为它们可能包含有人群密度的极端变化。 最后,该方法还引入了密集区域注意力机制,通过提取图像中人群密集的区域,并将更多的注意力放在这些区域上来准确估计人群数量。 综上所述,boosting-crowd-counting-via-multifaceted-attention是一种通过引入多个注意力机制来提高人群计数的方法。它能够从不同方面细致地分析图像,并利用局部、稀疏和密集区域的特征来准确估计人群数量。这个方法通过考虑人群分布的细节,提供了更精确的人群计数结果。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值