| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1164821 | KaleemRazaSyed | Rabbit Carrot (LMIO19_triusis) | C++20 | 1 ms | 328 KiB |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
int a[n];
for(int i = 0; i < n; i ++)
cin >> a[i];
int cur = 0, ans = 0;
for(int i = 0; i < n; i ++)
if(a[i] - cur > m)
{
ans++;
cur += m;
}
else
cur = a[i];
cout << ans << endl;
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
