제출 #1164639

#제출 시각아이디문제언어결과실행 시간메모리
1164639Ghulam_JunaidRabbit Carrot (LMIO19_triusis)C++20
0 / 100
2 ms328 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n, m; cin >> n >> m; int ans = 0; int last = 0; for (int i = 1; i <= n; i ++){ int x; cin >> x; ans += (last + m < x); last = min(last + m, x); } cout << ans << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...