1 solutions
-
0
C :
#include <stdio.h> #include <stdlib.h> #include <limits.h> int A[10005]; int main() { int n,i,x,j; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&A[i]); } scanf("%d",&x); int flag=0; for(j=0;j<n;j++) { if(A[j]==x) { printf("%d",j+1); flag=1; break; } } if(flag==0) printf("not find"); return 0; }
C++ :
#include<bits/stdc++.h> using namespace std; int n,a[10005],x; 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<<"not find"; return 0; }
- 1
Information
- ID
- 676
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By