#include<bits/stdc++.h> using namespace std; int b[1001]; int main(){ int a,c=0,d,e=0; cin>>a; for(int i=1;i<=a;i++)cin>>b[i]; cin>>c; for(int i=1;i<=a;i++){ if(b[i]c && e0){ e=1; continue; } else cout<<b[i]<<' '; }

#include<bits/stdc++.h> using namespace std; const int maxn=1e3+9; int n,a[maxn],m; int main() { cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; cin>>m; for(int i=1;i<=n;i++) { if(a[i]!=m) cout<<a[i]<<" "; else m=1101; } return 0; }

空降坐标：CP002980 请看代码

自学数组的第3题，直直直直直直直直直接上代码

#include <bits/stdc++.h> using namespace std; const int A=10050; int a[A]; int main(){ int n,y=0; cin>>n; for(int i=0;i<=n-1;i++){ cin>>a[i]; } int c; cin>>c; for(int i=0;i<=n-1;i++){ if(y==1){ cout<<a[i]<<' ';//判断是否为第一个 }else{ if(a[i] != c){ cout <<a[i] <<' ';//判断是否跳过 }else if(a[i] == c){ y+=1; } } } return 0; }

#include<bits/stdc++.h> using namespace std; int main() { int x[1002],n,m,c; }

#include<iostream> using namespace std; int main(){ int n,a[1001]; cin >> n; for(int i = 0;i < n;i++){ cin >> a[i]; } int m,flg = 0; cin >> m; for(int i = 0;i < n;i++){ if(a[i] == m && flg == 0){ flg = 1; continue; } cout << a[i] << " "; } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int arr[n]; }

#include<bits/stdc++.h> using namespace std; int main(){ int x[1001],n,m,a=0; cin >> n; for (int i=0;i<n;i++){ cin >> x[i]; } cin >> m; for (int i=0;i<n;i++){ if(x[i]m && a0){ a++; continue; } cout << x[i] << " "; } return 0; }

#include <bits/stdc++.h> using namespace std; #define N 100001 int a[N]; int n,key; bool flag=false; int main(){ cin>>n; for(int i=1;i<=n;++i) cin>>a[i]; cin>>key; }

#include<cstdio> #include<iostream> #include<cmath> using namespace std; int main(){ int a,b; cin>>a; int n[1145]; for(int i=1;i<=a;i++){ cin>>n[i]; } cin>>b; int jj=0; for(int i=1;i<=a;i++){ if(n[i]b&&jj0){ jj=1; continue; } cout<<n[i]<<" "; } return 0; }