#include <iostream> #include <string> #include <vector> #include <map> #include <queue> #include <algorithm> #include <numeric> #include <climits> using namespace std; int main(int...

#include <limits.h> #include <stdio.h> #include <stdlib.h> #define N 300000 struct E { int i, j, a; } ee; int...

#include <stdio.h> #define N 1000000 int main() { static int hole; int n, m, k, i,...

#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 0; }

#include<cstdio> int main() { int ans=0,a=0; char c; scanf("%d",&ans); while (scanf("%c%d",&c,&a) != EOF) { if (c=='+') ans+=a; if (c=='-') ans-=a; } a=0; if...

#include <stdio.h> #include<algorithm> #include<time.h> using namespace std; int a; int main() { int n,i; ...

#include <stdio.h> #include <string.h> int main(){ int i, num, flag=0; char str; scanf("%s", str); num = strlen(str); if(num ==...

#include<stdio.h> int main(){ int a, i, n, max=0; scanf("%d", &n); for(i=0; i<n; i++){ ...

#include<stdio.h> int main(void) { unsigned x, y, result = 0; scanf("%u", &x); do { y = x &...

#include<stdio.h> int main(void) { int mas = {4, 22, 27, 58, 85, 94, 121, 166,...

Women increasingly inhabit top ranking roles in traditionally male dominated industries, lead...

#include<bits/stdc++.h> using namespace std; int n,k,f; bitset<2001> dp; int main() { cin>>n>>k; for(int i=1,t;i<=k;i++) { scanf("%d",&t); f=1; } dp=1; int now=0; for(int i=1;i<=1000;i++) { now^=1; dp.reset(); for(int j=0;j<=1000;j++) if(f)dp|=(dp<<j)>>n; if(dp) { return 0*printf("%dn",i); } } puts("-1"); return 0; }