# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1020891 |
2024-07-12T10:58:35 Z |
ajay |
Telefoni (COCI17_telefoni) |
C++14 |
|
15 ms |
2136 KB |
/* Ajay Jadhav */
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <deque>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <ctime>
#include <string.h>
#include <climits>
#include <cstring>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define all(a) (a).begin(),(a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define hell 1000000007
#define rep(i,a,b) for(int i=a;i<b;i++)
#define endl '\n'
void solve()
{
int n, d;
cin>>n>>d;
vi a(n);
rep(i,0,n)
{
cin>>a[i];
}
int i = 0;
int ans = 0;
while (i < n)
{
ans += (a[i] == 0);
i += d;
}
cout<<ans<<endl;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--)
{
solve();
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
456 KB |
Output is correct |
3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
456 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
8 |
Incorrect |
15 ms |
2136 KB |
Output isn't correct |
9 |
Incorrect |
14 ms |
2012 KB |
Output isn't correct |
10 |
Incorrect |
11 ms |
2136 KB |
Output isn't correct |