# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
15922 | 2015-08-01T12:47:37 Z | ggoh | 새로운 달력 (GCJ12KOR_calendar) | C++ | 0 ms | 1084 KB |
#include<algorithm> #include<cstdio> long long a,i,x,y,z,t,m,u,p,o[121]; main() { scanf("%lld",&a); for(p=0;p<a;p++) { m=0; u=0; scanf("%lld%lld%lld",&x,&y,&z); for(i=1;i<=z;i++) { t=y+u; m+=(t+z-1)/z; u=t%z; o[i]=m; } printf("Case #%lld: %lld\n",p+1,x/z*o[z]+o[x%z]); } }
# | 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 |