제출 #723495

#제출 시각아이디문제언어결과실행 시간메모리
723495vjudge1Telefoni (COCI17_telefoni)C++17
16 / 80
43 ms3012 KiB
#pragma GCC optimize("Ofast") #include <bits/stdc++.h> #define S second #define F first #define ll long long #define PB push_back #define PF push_front using namespace std; signed main(){ ll n,d; ll cont = 0; cin >> n >> d; vector<int>V; for(ll i = 0;i < n;i++){ ll x; cin >> x; V.PB(x); } ll pos = 0; for(pos = 0; pos < n ;pos++){ if(V[pos]==1)continue; else{ pos += d; cont++; } } cout << cont; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...