9 solutions
- 1
Information
- ID
- 596
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 4
- Tags
- # Submissions
- 155
- Accepted
- 67
- Uploaded By
#include using namespace std; int main(){ int a; cin>>a; int b[a],c; for(int i=0;i<a;i++)cin>>b[i]; cin>>c; for(int i=0;i<a;i++){ if(c==b[i]){ cout<<i+1; return 0; } } return 0; }
#include <iostream>
using namespace std;
int n,x;
int a[10001];
int main (){
cin>>n;
for( int i=1;i<=n;++i)
cin>>a[i] ;
cin>>x;
for(int i=1;i<=n;++i){
if(a[i]==x){
cout<<i;
return 0;
}
}
cout<<"-1";
return 0;
}
#include<bits/stdc++.h> using namespace std; int main(){ int a; cin>>a; int b[a],c; for(int i=0;i<a;i++){ cin>>b[i]; } cin>>c; for(int i=0;i<a;i++){ if(c==b[i]){ cout<<i+1; return 0; } } cout<<-1; }
#include<bits/stdc++.h>
using namespace std;
short n,l[10005],x;
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>l[i];}
cin>>x;
for(int i=1;i<=n;i++){
if(l[i]==x){
cout<<i;
return 0;}
}
return 0;
}
#include<iostream>
using namespace std;
int i[10001];
int main(){
int n,m;
cin>>n;
for (int a=1;a<=n;a++) cin>>i[a];
cin>>m;
int a=1;
for (;a<=n;a++){
if (i[a] == m){
cout<<a;
break;
}
}
if (a==n+1) cout<<"-1";
return 0;
}//讲个笑话,压根没有输出-1的情况
#include<bits/stdc++.h> using namespace std;
int main(){ int n,m; cin>>n; const int N=n; int a[N]; for(int i=0;i<N;i++){ cin>>a[i]; } cin>>m; for(int j=0;j<N;j++){ if(a[j]m){ cout<<j+1; break; } else if(jN-1&&a[j]!=m){ cout<<"-1"; } } return 0; }
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv){
int n,a[10005] = {0},x,s = -1;
cin >> n;
for(int i = 0;i < n;i++){
cin >> a[i];
}
cin >> x;
for (int i = 0;i < n;i++){
if (a[i] == x){
s = i + 1;
break;
}
}
cout << s;
return 0;
}
#include <iostream>
using namespace std;
int n,m,ans=0;
int main(){
cin>>n;
int a[n]={0};
for(int i=1;i<=n;i++) cin>>a[i];
cin>>m;
for(int i=1;i<=n;i++){
if(a[i]==m){
cout<<i;
return 0;
}
}
cout<<"-1";
return 0;
}
By signing up a ZXOJ universal account, you can submit code and join discussions in all online judging services provided by us.