#include<bits/stdc++.h> using namespace std; const int N=300; char st[N]; int si=0,k; string str; int main(){ cin>>str>>k; for(int i=0;i<str.size();i++){ while(si>0&&k>0&&st[si]>str[i]) si--,k--; st[si]=str[i]; } while(k>0){si--;k--;} bool f0=true; for(int i=1;i<=si;i){ if(st[i]=='0'&&f0)continue; else{ f0=false; cout<<st[i]; } } if(f0)cout<<0<<endl; else cout<<endl; return 0; }

#include<bits/stdc++.h> using namespace std; const int N=300; char st[N]; int si=0,k; string str; int main(){ cin>>str>>k; for(int i=0;i<str.size();i++){ while(si>0&&k>0&&st[si]>str[i]) si--,k--; st[si]=str[i]; } while(k>0){si--;k--;} bool f0=true; for(int i=1;i<=si;i){ if(st[i]=='0'&&f0)continue; else{ f0=false; cout<<st[i]; } } if(f0)cout<<0<<endl; else cout<<endl; return 0; }

https://www.acgo.cn/application/1679077056631783424

大家可以在这里讨论C++；

#include<bits/stdc++.h> using namespace std; void move(int n,char a,char c,char b){ if(n==0)return; move(n-1,a,b,c); printf("%c --%d--> %c\n",a,n,c); move(n-1,b,c,a); } int main(){ int n; scanf("%d",&n); move(n,'A','C','B'); return 0; }

我和“聊天群”的小伙伴都在ACGO等你，快用这个专属链接加入我们吧！https://www.acgo.cn/application/1679000549005918208

https://www.acgo.cn/application/1679374859872018432

#include<bits/stdc++.h> using namespace std; const int N=1e5+10; int a[N]; long long sum=0; int main(){ int n,x; cin>>n; for(int i=1;i<=n;i++)cin>>a[i]; cin>>x; for(int i=1;i<=x;i++)sum+=a[i]; cout<<sum; return 0; }

https://chat12.aichatos.xyz/#/chat/1689158290176

C++太难了！！！！！

h e l l o w o r l d

#include <stdio.h> #include <string.h> #include <iostream> #include <algorithm> #include <queue> using namespace std; const int N = 1010; int n, m, p; int s[N][N], cost[N]; int f[N], g[N][N]; struct Node { int v, i, j; bool operator < (const Node & W) const { return v < W.v; } }; priority_queue<Node> heap[N]; int get(int x) { x %= n; if (x <= 0) { x += n; } return x; } int main(void) { scanf("%d%d%d", &n, &m, &p); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { scanf("%d", &s[i][j]); } } for (int i = 1; i <= m; i++) { for (int j = 1; j <= n; j++) { if (j == 1) { s[j][i] += s[n][i - 1]; } else { s[j][i] += s[j - 1][i - 1]; } } } memset(f, -0x3f, sizeof f); memset(g, -0x3f, sizeof g); f[0] = 0; for (int i = 1; i <= n; i++) { scanf("%d", &cost[i]); } for (int i = 1; i <= n; i++) { g[0][i] = -cost[get(i + 1)]; heap[get(0 - i)].push({ g[0][i], 0, i }); } for (int i = 1; i <= m; i++) { for (int j = 1; j <= n; j++) { auto& h = heap[get(i - j)]; while (h.size()) { auto t = h.top(); if (i - p > t.i) { h.pop(); } else { f[i] = max(f[i], s[j][i] + t.v); break; } } } for (int j = 1; j <= n; j++) { g[i][j] = f[i] - s[j][i] - cost[get(j + 1)]; heap[get(i - j)].push({ g[i][j], i, j }); } } int res = 0; for (int i = 0; i <= m; i++) { res = max(res, f[i]); } cout << res << endl; return 0; }

#include<bits/stdc++.h> #include<vector> #include<string> #include<queue> using namespace std; typedef long long ll; const ll N=1e8+5; ll n,m; int a[100005]; int q[100005]; int main(){ cin>>n; int ans=0; int r=0; int l=0; for(int i=0;i<n;i++){ int b,c,d; cin>>b>>c>>d; if(b==0){ a[r]=c; q[r]=d; r++; ans+=c; }else{ while(l<r&&d-q[l]>45){ l++; } int flag=1; for(int i=l;i<r;i++){ if(a[i]&&a[i]>=c){ flag=0; a[i]=0; break; } } if(flag) ans+=c; } } cout<<ans<<endl; return 0; }

什么鬼？？？这是从哪冒出来的破题目

#include <bits/stdc++.h> using namespace std; int main() { int a,b; cin >> a >> b; cout<<a+b; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int a,b; cin >> a >> b; cout<<a+b; return 0; }

#include <bits/stdc++.h> using namespace std; int n,m1,m2,ans = 150000; int i,j; int s[100005],f[100005]; bool p[300005]; int prime[501][3],size = 0; int main(void) { memset(p,1,sizeof(p)); memset(f,0,sizeof(f)); scanf("%d%d%d",&n,&m1,&m2); if (m1 == 1) { printf("0"); return 0; } for (i = 1; i <= n; i++) scanf("%d",&s[i]); int xx = floor(sqrt(m1)); for (i = 2; i <= xx; i++) { if (p[i]) { if (m1 % i == 0) { prime[size][1] = i; prime[size][2] = 1; } } int tim = 2; while (tim * i <= m1) { p[tim * i] = 0; tim; } } for (i = 1; i <= size; i++) { int num = prime[i][1]; while (m1 % (num * prime[i][1]) == 0) { num *= prime[i][1]; prime[i][2]; } prime[i][2] *= m2; } if (size == 0) { prime[size][1] = m1; prime[size][2] = m2; } for (i = 1; i <= n; i) { for (j = 1; j <= size; j) { if (s[i] % prime[j][1] != 0) { f[i] = 150000; break; } int tim = 1; long long num = prime[j][1]; while (s[i] % (num * prime[j][1]) == 0) { num *= prime[j][1]; tim++; } int an = (prime[j][2]-1) / tim + 1; if (an > f[i]) f[i] = an; } } for (i = 1; i <= n; i++) if (ans > f[i]) ans=f[i]; if (ans == 150000) printf("-1"); else printf("%d",ans); return 0; }

#include<iostream> #include<stdio.h> using namespace std; int main(){ int m,n; cin >> n >> m; int a[2][n]; m *= 1.5; for(int c=0 ;c<n; c++){ cin >> a[0][c] >> a[1][c]; } for(int c=0; c<n; c++){ for(int z=n-1; z > c; z--){ if(a[0][z]<a[0][z-1]){ swap(a[1][z],a[1][z-1]); swap(a[0][z],a[0][z-1]); } } } for(int c=0; c<n; c++){ for(int z=n-1; z > c; z--){ if(a[1][z]>a[1][z-1]){ swap(a[1][z],a[1][z-1]); swap(a[0][z],a[0][z-1]); } } } int c=m-1; for (; c<(n-1) && a[1][c] == a[1][c+1]; ++c); cout << a[1][c] << " " << c + 1 << endl; for(int i=0;i<=c;i++){ cout<<a[0][i]<<" "<<a[1][i]<<endl; } }

为了鉴定我特别出了一道题点击访问