# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
16374 | 2015-08-21T17:31:21 Z | eaststar | 새로운 달력 (GCJ12KOR_calendar) | C++14 | 0 ms | 1084 KB |
#include <stdio.h> int s[110]; int main(){ int i,j,tc,b,c,t; long long a; scanf("%d",&tc); for(i=1;i<=tc;++i){ scanf("%lld%d%d",&a,&b,&c); t=b; for(j=1;j<=c;++j)s[j]=(t+c-1)/c+s[j-1],t=t%c+b; printf("Case #%d: %lld\n",i,a/c*s[c]+s[a%c]); } return 0; }
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 1084 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 1084 KB | Output is correct |