Section1白菜题就是多...本题做法就是一个字:数...
- {
- ID:idontknow
- PROG:friday
- LANG:PASCAL
- }
- //1,3,5,7,8,10,12:31
- //2:28, 29(leap year)
- //4,6,9,11:30
- var
- i, n, day, year : longint;
- num : array[0 .. 6] of longint;
- begin
- assign(input,'friday.in'); reset(input);
- assign(output,'friday.out'); rewrite(output);
- readln(n);
- day := 13;
- for year := 1900 to 1900 + n - 1 do begin
- inc(num[day mod 7]);
- {1}day := day + 31;
- inc(num[day mod 7]);
- {2}day := day + 28 + ord((year mod 400 = 0) or ((year mod 4 = 0) and (year mod 100 <> 0)));
- inc(num[day mod 7]);
- {3}day := day + 31;
- inc(num[day mod 7]);
- {4}day := day + 30;
- inc(num[day mod 7]);
- {5}day := day + 31;
- inc(num[day mod 7]);
- {6}day := day + 30;
- inc(num[day mod 7]);
- {7}day := day + 31;
- inc(num[day mod 7]);
- {8}day := day + 31;
- inc(num[day mod 7]);
- {9}day := day + 30;
- inc(num[day mod 7]);
- {10}day := day + 31;
- inc(num[day mod 7]);
- {11}day := day + 30;
- inc(num[day mod 7]);
- {12}day := day + 31;
- end;
- write(num[6],' ',num[0]);
- for i := 1 to 5 do
- write(' ',num[i]);
- writeln;
- close(input); close(output);
- end.