0tps

P3955 [NOIP2017 普及组] 图书管理员

怎么了
by ethan0919 @ 2023-10-13 17:39:46


```cpp #include <iostream> #include<algorithm> #include <cmath> using namespace std; int a[10000]; int main(){ int n,m; cin>>n>>m; for (int i=0;i<n;i++) { cin>>a[i]; } sort(a,a+n); while (m--) { int x,y; cin>>x>>y; for (int i=0;i<n;i++) { if (y==a[i] % (int)pow(10,x)) { cout<<a[i]<<endl; break; } if (i==n-1) { cout<<-1<< endl; } } } return 0; } ```
by ethan0919 @ 2023-10-13 17:41:02


``` #include<bits/stdc++.h> using namespace std; int n,q; int a[1005]; bool check(int p,int k,int len){ for(int i=1;i<=len;i++){ if(p%10 !=k%10) return false; p/=10;k/=10; } return true; } int main(){ cin>>n>>q; for(int i=1;i<=n;i++) cin>>a[i]; while(q--){ int m,num;cin>>m>>num; int minn=1e8; for(int i=1;i<=n;i++){ if(check(a[i],num,m)){ minn =min(minn,a[i]); } } if(minn==1e8) cout<<-1<<endl; else cout<<minn<<endl; } return 0; } ```
by zhang13095534103 @ 2024-01-14 18:38:55


|