# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
870005 | 2023-11-06T14:52:06 Z | melody_rules | Rabbit Carrot (LMIO19_triusis) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; int main() { long long int n=0; long long int m=0; long long int a=0; long long int i=0; long long int tot=0; cin>>n>>m; long long int arr[n]; for(i=0;i<n;i++) { cin>>a; arr[i]=a; } a=0; for(i=0;i<n;i++) { if((m+a) < arr[i]) { arr[i]=m+a; a+=m; tot++; } } cout<<t<<endl; return 0; }