This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |