Tag: Codeforces Round #408 (Div. 2)
Codeforces Round #408 (Div....
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 +...
Codeforces Round #408 (Div....
#include <stdio.h>
#include <string.h>
#include <stdbool.h>
#include <assert.h>
#define clr(ar) memset(ar, 0, sizeof(ar))
#define...
Codeforces Round #408 (Div....
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <numeric>
#include <climits>
using...
Codeforces Round #408 (Div....
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#define N 300000
struct E {
int i,...
Codeforces Round #408 (Div....
#include <stdio.h>
#define N 1000000
int main() {
static int hole;
int n,...
Codeforces Round #408 (Div....
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define MAX 1000000009
int main()
{
int i,n,m,k,min=MAX,t,temp;
scanf("%d %d %d",&n,&m,&k);
for(i=1;i<=n;i++)
{
scanf("%d",&t);
if(t>0 && t<=k)
{
temp=abs(m-i);
if(temp<min)
min=temp;
}
}
printf("%dn",(min*10));
return...