| |
 五年级出题
|
五年级的来出题!
( 2020/12/24 17:01:03 ) |
 A+B-C(高精度) |
用高精度实现100位以内的A+B和B-C
样例：
输入样例
10000000
10000000
5000000
输出样例
15000000
解释：
10000000
+10000000
----------
20000000
- 5000000
----------
15000000
时间限制 Time Limitation
各个测试点1s
文件读写格式例题：
编号为p1000的求两个数的和的free pascal c++ c 三种语言解答样例：
Free Pascal Code:
-------------------
var a,b:longint;
begin
assign(input,'p1000.in');
assign(output,'p1000.out');
reset(input);
rewrite(output);
readln(a,b);
writeln(a+b);
close(input);
close(output);
end.
C++ Code:
-------------------
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <fstream>
using namespace std;
int main(){
freopen("p1000.in","r",stdin);
freopen("p1000.out","w",stdout);
int a,b;
cin>>a>>b;
cout<<a+b<<endl;
fclose(stdin);
fclose(stdout);
return 0;
}
C++ Code:
-------------------
#include <iostream>
#include <iomanip>
#include <fstream>
using namespace std;
int main(){
ifstream cin;
ofstream cout;
cin.open("p1000.in");
cout.open("p1000.out");
int a,b;
cin>>a>>b;
cout<<a+b<<endl;
cin.close();
cout.close();
return 0;
}
C Code:
-------------------
#include<stdio.h>
#include<stdlib.h>
int main(){
int a,b,c;
FILE *fin = fopen("P1000.in","r");
FILE *fout = fopen("P1000.out","w+");
fscanf(fin,"%d%d",&a,&b);
c=a+b;
fprintf(fout,"%d",c);
close(fin);
close(fout);
return 0;
}
( ) |
| 打印字符画 |
题目背景：
有一天，小明在玩游戏，游戏需要小明画一幅字符画作为自己的人物，可他怎么也画不出来武器，请身为神牛的你来帮他画。
题目描述：
输入坦克、直升机、战斗机、航空母舰，输出相应的字符画。
__[]==== ----|---- /\____~~`__ !^
（*****） [=====]----(*) \___{___}__\ ___[=]+-________
~~~~~~ \______________/
样例:
输入样例：
坦克
输出样例：
__[]====
（*****）
时间限制 Time Limitation
各个测试点1s
( ) |
| 小明吃桃 |
小明最近迷上了吃桃。正巧,他家的果园桃子丰收了。现在有n(1<=n<=50000)个桃子,每个桃子都有它的美味度和高度,小明每向上1m就需要疲劳值m(2<=m<=10000)。请问怎样小明才能花费最少的疲劳值吃掉最多美味度的桃？
输入格式:
第一行,一个整数n,代表有n个桃子
接下来n行,两个整数a,b.第一个代表这个桃子的美味度,第二个代表着个桃子的高度。
最后一行,一个整数m,代表小明向上1m的疲劳值
输出格式:
两个整数,中间以空格隔开,分别代表花费最少疲劳值且美味值得到最多的方案花费的疲劳值及美味度
样例输入:
7
55 3
87 5
36 7
100 10
47 2
77 3
68 3
4
样例输出:
356 95
时间限制 Time Limitation:1s
文件读写格式例题：
编号为p1000的求两个数的和的free pascal c++ c 三种语言解答样例：
Free Pascal Code:
-------------------
var a,b:longint;
begin
assign(input,'p1000.in');
assign(output,'p1000.out');
reset(input);
rewrite(output);
readln(a,b);
writeln(a+b);
close(input);
close(output);
end.
C++ Code:
-------------------
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <fstream>
using namespace std;
int main(){
freopen("p1000.in","r",stdin);
freopen("p1000.out","w",stdout);
int a,b;
cin>>a>>b;
cout<<a+b<<endl;
fclose(stdin);
fclose(stdout);
return 0;
}
C++ Code:
-------------------
#include <iostream>
#include <iomanip>
#include <fstream>
using namespace std;
int main(){
ifstream cin;
ofstream cout;
cin.open("p1000.in");
cout.open("p1000.out");
int a,b;
cin>>a>>b;
cout<<a+b<<endl;
cin.close();
cout.close();
return 0;
}
C Code:
-------------------
#include<stdio.h>
#include<stdlib.h>
int main(){
int a,b,c;
FILE *fin = fopen("P1000.in","r");
FILE *fout = fopen("P1000.out","w+");
fscanf(fin,"%d%d",&a,&b);
c=a+b;
fprintf(fout,"%d",c);
close(fin);
close(fout);
return 0;
}
( ) |
| 数字三角形 |
观察下面的数字金字塔。
写一个程序来查找从最高点到底部任意处结束的路径，使路径经过数字的和最大。每一步可以走到左下方的点也可以到达右下方的点。
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
在上面的样例中,从7 到 3 到 8 到 7 到 5 的路径产生了最大
输入输出格式
输入格式：
第一个行包含 R(1<= R<=1000) ,表示行的数目。
后面每行为这个数字金字塔特定行包含的整数。
所有的被供应的整数是非负的且不大于100。
输出格式：
单独的一行,包含那个可能得到的最大的和。
输入输出样例
输入样例#1：
5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
输出样例#1：
30
( ) |
 ujfutyj |
#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}
( ) |
| ujfutyj |
#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}
( ) |
| ujfutyj |
#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}#include<iostream>
using namespace std;
int main(){
int n,i,k,l,r,a[10000]={0},mid;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&k);
l=1;r=n;
do{
mid=(l+r+1)/2;
if(a[mid]==k){
while(a[mid]==k)mid++;mid--;cout<<mid;return 0;
}
if(l==r){
cout<<"-1";return 0;
}
if(a[mid]>k)l=mid+1;
else r=mid-1;
}while(1==1);
return 0;
}
( ) |
 GG |
From sina007
中国星跳跃
背景 Background
为了for beginngers，特设此题，^_^
描述 Description
中国星跳跃（dive）
【问题描述】
继《中国梦想秀》、《中国好声音》之后，浙江卫视2013年倾力打造综艺“中国三部曲”之《中国星跳跃》。跳水王子田亮担任明星领队，国家跳水总领队周继红担当总顾问。节目将针对明星特点，对其进行全封闭的魔鬼训练，完成最后的跳水动作，树立中国励志类节目的新标杆。
裁判员按以下标准评分：
失败 0分
不好 1分或2分
普通 3分或4分
较好 5分或6分
很好 7分或8分
最好 9分或10分 比赛由5名裁判打分（0-10分的整数）。
比赛由5名裁判员评分：5名裁判员打出分数以后，先删去最高和最低的无效分，余下3名裁判员的分数之和就是明星所得分数。
请你编一程序，求出该明星的得分。
【输入格式】
输入文件为dive.in，一行有5个0-10之间的整数，中间用空格隔开。
【输出格式】
输出到文件dive.out中，只有一个整数，表示明星的最后得分。
【输入输出样例】
dive.in
4 6 8 8 9
dive.out
22
样例输入 Sample Input
4 6 8 8 9
样例输出 Sample Output
22
时间限制 Time Limitation
各个测试点1s
( ) |
| GG |
From sina007
中国星跳跃
背景 Background
为了for beginngers，特设此题，^_^
描述 Description
中国星跳跃（dive）
【问题描述】
继《中国梦想秀》、《中国好声音》之后，浙江卫视2013年倾力打造综艺“中国三部曲”之《中国星跳跃》。跳水王子田亮担任明星领队，国家跳水总领队周继红担当总顾问。节目将针对明星特点，对其进行全封闭的魔鬼训练，完成最后的跳水动作，树立中国励志类节目的新标杆。
裁判员按以下标准评分：
失败 0分
不好 1分或2分
普通 3分或4分
较好 5分或6分
很好 7分或8分
最好 9分或10分 比赛由5名裁判打分（0-10分的整数）。
比赛由5名裁判员评分：5名裁判员打出分数以后，先删去最高和最低的无效分，余下3名裁判员的分数之和就是明星所得分数。
请你编一程序，求出该明星的得分。
【输入格式】
输入文件为dive.in，一行有5个0-10之间的整数，中间用空格隔开。
【输出格式】
输出到文件dive.out中，只有一个整数，表示明星的最后得分。
【输入输出样例】
dive.in
4 6 8 8 9
dive.out
22
样例输入 Sample Input
4 6 8 8 9
样例输出 Sample Output
22
时间限制 Time Limitation
各个测试点1s
( ) |
| GG |
From sina007
中国星跳跃
背景 Background
为了for beginngers，特设此题，^_^
描述 Description
中国星跳跃（dive）
【问题描述】
继《中国梦想秀》、《中国好声音》之后，浙江卫视2013年倾力打造综艺“中国三部曲”之《中国星跳跃》。跳水王子田亮担任明星领队，国家跳水总领队周继红担当总顾问。节目将针对明星特点，对其进行全封闭的魔鬼训练，完成最后的跳水动作，树立中国励志类节目的新标杆。
裁判员按以下标准评分：
失败 0分
不好 1分或2分
普通 3分或4分
较好 5分或6分
很好 7分或8分
最好 9分或10分 比赛由5名裁判打分（0-10分的整数）。
比赛由5名裁判员评分：5名裁判员打出分数以后，先删去最高和最低的无效分，余下3名裁判员的分数之和就是明星所得分数。
请你编一程序，求出该明星的得分。
【输入格式】
输入文件为dive.in，一行有5个0-10之间的整数，中间用空格隔开。
【输出格式】
输出到文件dive.out中，只有一个整数，表示明星的最后得分。
【输入输出样例】
dive.in
4 6 8 8 9
dive.out
22
样例输入 Sample Input
4 6 8 8 9
样例输出 Sample Output
22
时间限制 Time Limitation
各个测试点1s
( ) |
| GG |
From sina007
中国星跳跃
背景 Background
为了for beginngers，特设此题，^_^
描述 Description
中国星跳跃（dive）
【问题描述】
继《中国梦想秀》、《中国好声音》之后，浙江卫视2013年倾力打造综艺“中国三部曲”之《中国星跳跃》。跳水王子田亮担任明星领队，国家跳水总领队周继红担当总顾问。节目将针对明星特点，对其进行全封闭的魔鬼训练，完成最后的跳水动作，树立中国励志类节目的新标杆。
裁判员按以下标准评分：
失败 0分
不好 1分或2分
普通 3分或4分
较好 5分或6分
很好 7分或8分
最好 9分或10分 比赛由5名裁判打分（0-10分的整数）。
比赛由5名裁判员评分：5名裁判员打出分数以后，先删去最高和最低的无效分，余下3名裁判员的分数之和就是明星所得分数。
请你编一程序，求出该明星的得分。
【输入格式】
输入文件为dive.in，一行有5个0-10之间的整数，中间用空格隔开。
【输出格式】
输出到文件dive.out中，只有一个整数，表示明星的最后得分。
【输入输出样例】
dive.in
4 6 8 8 9
dive.out
22
样例输入 Sample Input
4 6 8 8 9
样例输出 Sample Output
22
时间限制 Time Limitation
各个测试点1s
( ) |
| GG |
From sina007
中国星跳跃
背景 Background
为了for beginngers，特设此题，^_^
描述 Description
中国星跳跃（dive）
【问题描述】
继《中国梦想秀》、《中国好声音》之后，浙江卫视2013年倾力打造综艺“中国三部曲”之《中国星跳跃》。跳水王子田亮担任明星领队，国家跳水总领队周继红担当总顾问。节目将针对明星特点，对其进行全封闭的魔鬼训练，完成最后的跳水动作，树立中国励志类节目的新标杆。
裁判员按以下标准评分：
失败 0分
不好 1分或2分
普通 3分或4分
较好 5分或6分
很好 7分或8分
最好 9分或10分 比赛由5名裁判打分（0-10分的整数）。
比赛由5名裁判员评分：5名裁判员打出分数以后，先删去最高和最低的无效分，余下3名裁判员的分数之和就是明星所得分数。
请你编一程序，求出该明星的得分。
【输入格式】
输入文件为dive.in，一行有5个0-10之间的整数，中间用空格隔开。
【输出格式】
输出到文件dive.out中，只有一个整数，表示明星的最后得分。
【输入输出样例】
dive.in
4 6 8 8 9
dive.out
22
样例输入 Sample Input
4 6 8 8 9
样例输出 Sample Output
22
时间限制 Time Limitation
各个测试点1s
( ) |
| |
观察下面的数字金字塔。
写一个程序来查找从最高点到底部任意处结束的路径，使路径经过数字的和最大。每一步可以走到左下方的点也可以到达右下方的点。
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
在上面的样例中,从7 到 3 到 8 到 7 到 5 的路径产生了最大
输入输出格式
输入格式：
第一个行包含 R(1<= R<=1000) ,表示行的数目。
后面每行为这个数字金字塔特定行包含的整数。
所有的被供应的整数是非负的且不大于100。
输出格式：
单独的一行,包含那个可能得到的最大的和。
输入输出样例
输入样例#1：
5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
输出样例#1：
30
( ) |
| |
lao zi 4 nian ji
( ) |
| 123 |
打印图形
*
**
***
****
*****
( ) |
 123456789 |
打印图形
*
***
*****
*******
( ) |
| 123456789 |
打印图形
*
***
*****
*******
( ) |
| 123456789 |
打印图形
*
***
*****
*******
( ) |
| 123456789 |
打印图形
*
***
*****
*******
( ) |
| 123456789 |
打印图形
*
***
*****
*******
( ) |
| 123456789 |
打印图形
*
***
*****
*******
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
| 1 |
打印图形
*
***
*****
*******
*********
( ) |
|
