# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72201 | 신딩없는 신딩팀 (#118) | Nectar with Coconut Jelly (FXCUP3_nectar) | C++17 | 21 ms | 636 KiB |
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 <stdio.h>
#include <algorithm>
using namespace std;
int cnt[1111];
int main(){
int n,j,r,t;
scanf("%d %d %d %d",&n,&j,&r,&t);
for(int i=1;i<=n;i++) cnt[i]=j;
while(t--){
for(int i=n-1;i>=1;i--){
cnt[i+1]+=(cnt[i]+r-1)/r;
cnt[i]-=(cnt[i]+r-1)/r;
}
}
for(int i=1;i<=n;i++) printf("%d\n",cnt[i]);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |