[交流] Euler 工程 第十九题：每月第一天是周日的天数已有3人参与

#include

bool isLeapYear(int year){
        return ((year%4 == 0)&&(year%100 != 0))||(year%400 == 0);
}

size_t daysOfMouth(int year, int mouth){
        switch(mouth){
        case 4:case 6:case 9:case 11:
                return 30;
        case 1:case 3:case 5:case 7:case 8:case 10:case 12:
                return 31;
        case 2:
                return isLeapYear(year)?29:28;
        default:
                return 0;
        }
}

size_t eular19(size_t y1 = 1901, size_t y2 = 2001){
        size_t year = 1900;
        size_t day = 1;
        do{
                day += isLeapYear(year)?366:365;
                day %= 7;
                ++year;
        }while(year < y1);
        size_t sdays = 0;
        do{
                for(int i = 1; i <= 12; ++i){
                        day += daysOfMouth(year, i);
                        day %= 7;
                        if(day == 0)
                                ++sdays;
                }
                ++year;
        }while(year < y2);
        return sdays;
}

int main(){
        std::cout< }

# -*- coding: utf-8 -*-

days = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]

date = [1900, 1, 1]

cntSundays = 0

while date[0] < 2001:
    date[2] += 7
    if date[0] % 400 == 0 or date[0] % 4 == 0:
        days[2] = 29
    else:
        days[2] = 28

    if date[2] > days[date[1]]:
        date[2] -= days[date[1]]
        date[1] += 1

    if date[1] > 12:
        date[0] += 1
        date[1] = 1

    if 1901 <= date[0] <= 2000 and date[2] == 2:
        cntSundays += 1

print cntSundays

#include

static int month[2][12]=
       {{31,28,31,30,31,30,31,31,30,31,30,31},
        {31,29,31,30,31,30,31,31,30,31,30,31}};

int isleap(int n){
  if((n%400==0)||(n%4==0&&n%100!=0))return 1;
  else return 0;
}

int euler19(){
  int year,leap_year,m;
  int result=0;
  long days=0;
  
  for(year=1900;year<2001;year++){
    leap_year=isleap(year);
    for(m=0;m<12;m++){
      if(year>1900&&days%7==1)result++;
      days+=month[leap_year][m];
    }
  }
  
  return result;
}


int main(void){

printf("%d\n",euler19());

return 0;
}

function result = euler19()
tic;
result = 0;
dateStart = datenum(1901,1,1);
dateEnd = datenum(2000,12,31);
for i=dateStart:dateEnd
   if strcmpi(datestr(i,'dd'),'01') && strcmpi(datestr(i,'ddd'),'sun')
       result = result+1;
   end
end
toc;
end