제출 #5878

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
5878	2014-05-20 21:20:00	kriii	새로운 달력 (GCJ12KOR_calendar)	C++98	25 / 25	0 ms	1088 KiB

A

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <stdio.h>
int T,C,GO[101],DA[101],END[101],LEN,CYC,ST;
long long M,D,W,ANS,S,SUM[101],CYS;
int main()
{
  int T; scanf ("%d",&T); for (C=1;C<=T;C++){
    scanf ("%lld %lld %lld",&M,&D,&W);
    for (int i=0;i<W;i++){
      GO[i] = (D + i) % W;
      DA[i] = (D + i + W - 1) / W;
      END[i] = -1; SUM[i] = 0;
    }
    S = 0; END[0] = 0; SUM[0] = DA[0];
    while (1){
      int E = GO[S];
      if (END[E] != -1){
        LEN = END[E] + 1;
        CYC = END[S] - END[E] + 1;
        CYS = SUM[S] + DA[E] - SUM[E];
        ST = S;
        break;
      }
      SUM[E] = SUM[S] + DA[E];
      END[E] = END[S] + 1;
      S = E;
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15