1 solutions
-
0
C :
#include<stdio.h> #define N 100000 int main() { int n,i,m,t,k; int a[N]; while(scanf("%d",&n)!=EOF) { t=0; k=0; for(i=0;i<n;i++) { scanf("%d",&a[i]); } scanf("%d",&m); for(i=0;i<n;i++) { if(a[i]==m) { t=i+1; break; } } for(i=0;i<n;i++) { if(a[i]==m) k++; } printf("%d %d\n",t,k); } return 0; }
C++ :
#include <iostream> #include <cmath> using namespace std; long n,m,s[100002],f=0,x,i; int main() { cin>>n; for (i=1;i<=n;i++) cin>>s[i]; cin>>m; for (i=1;i<=n;i++) { if (s[i]==m) x+=1; } i=1; while (s[i]!=m && i<=n) i++; f=i; if (x==0) f=0; cout<<f<<" "<<x; // system ("pause"); return 0; }
- 1
Information
- ID
- 10159
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By