1 solutions
-
0
C :
#include<stdio.h> int main() { int n,m,i,j,flag; flag=0; scanf("%d",&n); int a[n]; for(i=0;i<n;i++) scanf("%d",&a[i]); scanf("%d",&m); for(i=0;i<n;i++) { if(m==a[i]) { for(j=i;j<n-1;j++) a[j]=a[j+1]; flag++; } } if(flag==0) printf("不存在这个数!"); else for(i=0;i<n-1;i++) { printf("%d ",a[i]); } }C++ :
#include <iostream> using namespace std; int main() { int a[50],n,x,i,j; cin>>n; for(i=0;i<n;i++) cin>>a[i]; cin>>x; for(i=0;i<n;i++) { if(a[i]==x) break; } if(i==n) cout<<"不存在这个数"<<endl; else { for(j=i;j<n-1;j++) a[j]=a[j+1]; n--; for(i=0;i<n;i++) cout<<a[i]<<" "; } return 0; }
- 1
Information
- ID
- 17239
- Time
- 1000ms
- Memory
- 2MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By