样例 特殊性 范围 1 N <10 2~3 Y <19000 4~5 N <5 6 Y >=15000 7~9 Y >=20000 10 Y >=90000 10号样例是99000多

#include<bits/stdc++.h> using namespace std; int main(){ string s; cin>>s; int num=0; stack<int>st; for(int i=0;i<s.length()-1;i++){ if(s[i]'.'){ st.push(num); num=0; }else if(s[i]>='0'&&s[i]<='9'){ num=num*10+s[i]-'0'; } else{ int r=st.top();st.pop(); int l=st.top();st.pop(); if(s[i]'-'){ st.push(l-r); }else if(s[i]'+'){ st.push(l+r); }else if(s[i]''){ st.push(lr); } } } cout<<st.top(); }

#include<bits/stdc++.h> using namespace std; int main(){ string s; cin>>s; int num=0; stack<int>st; for(int i=0;i<s.length()-1;i++){ if(s[i]'.'){ st.push(num); num=0; }else if(s[i]>='0'&&s[i]<='9'){ num=num*10+s[i]-'0'; } else{ int r=st.top();st.pop(); int l=st.top();st.pop(); if(s[i]'-'){ st.push(l-r); }else if(s[i]'+'){ st.push(l+r); }else if(s[i]''){ st.push(lr); } } } cout<<st.top(); }

#include <iostream> #include<queue> using namespace std; int main(){ queue<int> q; int n,m,p; cin>>n; for(int i=1;i<=n;i++){ cin>>m; if(m1){ cin>>p; q.push(p); }else if(m2){ if(q.empty()){ cout<<"impossible!"<<endl; }else{ q.pop(); } }else if(m==3){ if(q.empty()){ cout<<"impossible!"<<endl; }else{ cout<<q.front()<<endl; } }

#include <iostream> #include <stack> using namespace std; int main() { int n, x; cin >> n; string c; stack <int> s; for(int i = 1; i <= n; ++i) { cin >> c; if(c == "push") { cin >> x; s.push(x); } else if(c == "pop") { if(!s.empty()) { cout << "pop " << s.top() << endl; s.pop(); } else { cout << "pop fail" << endl; } } else if(c == "top") { if(!s.empty()) { cout << "top = " << s.top() << endl; } else { cout << "top fail" << endl; } } else if(c == "size") { cout << "size = " << s.size() << endl; } else if(c == "empty") { if(!s.empty()) { cout << "no" << endl; } else { cout << "yes" << endl; } } } return 0; }

#include <bits/stdc++.h> using namespace std; int n, a[105]; int main(){ cin >> n; for(int i=1;i<=n;i++)cin >> a[i]; for(int i=n;i>0;i--)cout << a[i] << " "; return 0; }

#include <bits/stdc++.h> #include <queue> using namespace std; deque <int>cx; int a[1001]; bool Nebula[1001]; int main() { int n,m; cin>>m>>n; int ans=0; for(int i=1;i<=n;i++) { int x; cin>>x; if(!Nebula[x]) { if(cx.size()==m) { int t=cx.front(); Nebula[t]=false; cx.pop_front(); } Nebula[x]=true; cx.push_back(x); ans++; } } cout<<ans; }

#include<bits/stdc++.h> using namespace std; stack<int> s; int n,m; int main(){ cin>>n>>m; int a[n+1]; for(int i=1;i<=n;i++) cin>>a[i]; while(m--){ int b[n+1],cnt=1; for(int i=1;i<=n;i++) cin>>b[i]; for(int i=1;i<=n;i++){ s.push(a[i]); while(s.top()==b[cnt]){ s.pop(); cnt++; if(s.empty()) break; } } if(s.empty()) cout<<"Yes"<<endl; else cout<<"No"<<endl; while(!s.empty()){ s.pop(); } } return 0; }

#include<iostream> #include<queue> using namespace std; queue<string> q; string op; int main(){ while(cin>>op){ if(op=="end"){ while(q.size()){ cout<<q.front()<<" "; q.pop(); } }else if(op=="out"){ int x; cin>>x; if(q.size()==0) cout<<"empty"<<endl; else{ for(int i=1;i<=x&&q.size();i++){ cout<<q.front()<<" "; q.pop(); } cout<<endl; } }else{ q.push(op); } } return 0; }

#include<iostream> #include<queue> using namespace std; int n; struct data{ int x,y; }; int a[110][110]; int dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},vis[101][101]; void bfs(int x,int y){ queue<data>q; q.push({x,y}); vis[x][y]=1; while(q.size()){ data top=q.front(); q.pop(); int cx=top.x,cy=top.y; cout<<a[cy][cx]<<" "; for(int i=0;i<4;i++){ int nx=cx+dx[i],ny=cy+dy[i]; if(nx>n||nx<1||ny>n||ny<1||vis[nx][ny]) continue; q.push({nx,ny}); vis[nx][ny]=1; } } } int main(){ cin>>n; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ cin>>a[j][i]; } bfs(1,1); return 0; }

#include<iostream> using namespace std; char a[10005],b[10005]; int m,n,head,tail,cnt; void push(char t){ b[tail]=t; } void pop(){ head; } int size(){ return tail-head; } bool check(char k){ for(int i=head+1;i<=tail;i) if(b[i]==k) return false; return true; } int main(){ cin>>n>>m; for(int i=1;i<=n;i) cin>>a[i]; for(int i=1;i<=n;i++){ if(check(a[i])){ if(size()>=m) pop(); push(a[i]); cnt++; } } cout<<cnt; return 0; }

#include <iostream> using namespace std; int f(int n,int m){ if(n0) return m; if(m0) return n%3; return f(n-1,m)-f(n,m-1)+f(n-1,m-1); }int main(){ cout<<f(5,6)<<endl; return 0; }

#include<iostream> #include<cstring> using namespace std; int head=0,tail=0; char q[101],s[101]; void push(char t){ tail++; q[tail]=t; } char front(){ return q[head+1]; } void pop(){ head++; } int size(){ return tail-head; } bool empty(){ return tail==head; } int main(){ cin>>s; for(int i=0;i<strlen(s);i++) push(s[i]); while(!empty()){ cout<<front(); pop(); push(front()); pop(); } return 0; }

#include <iostream> using namespace std; int f(int n,int m){ if(n0) return m; if(m0) return n%3; return f(n-1,m)-f(n,m-1)+f(n-1,m-1); }int main(){ cout<<f(5,6)<<endl; return 0; }

这里霉油题解 没有 题解

https://www.lddgo.net/common/countdown-days

#include <bits/stdc++.h> using namespace std; #define ll long long #define fastio ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL) int main() { fastio; int n; cin >> n; vector<int> dp(n + 1, n - 1); dp[1] = 0; for (int i = 1; i < n; i++) { dp[i + 1] = min(dp[i + 1], dp[i] + 1); for (int j = 1;; j++) // 枚举蓄力时间 { int x = i + j * j; // 蓄力跳跃的落点 if (x > n) break; dp[x] = min(dp[x], dp[i] + j + 1); } } cout << dp[n];

大哥 关注下呗

前面的AC，以后再来AC吧

祝所有人万圣节快乐！！