题解列表

筛选

2858: 整理药名

摘要:``` #include using namespace std; const int N=110; char s[N]; int main(){ int T; cin>>T……

2904: 谁拿了最多奖学金

```#includeusingnamespacestd;constintN=110;charname[N][N],gb[N],xb[N];//gb干部xb西部;inta[N],b[N],c[N],money[N];intmain(){intn,

2904: 谁拿了最多奖学金

```#includeusingnamespacestd;constintN=110;charname[N][N],cadre[N],west[N];inta[N],b[N],c[N],money[N];intmain(){intn,sum=0,

题解 2904: 谁拿了最多奖学金

#includeusingnamespacestd;constintN=110;charname[N][N],gb[N],xb[N];inta[N],b[N],c[N],money[N];intmain(){intn,sum=0,t=0;cin>>n;for(inti=1;i>name[i]>>a[i

2914: 铺地毯

```#includeusingnamespacestd;constintN=10010;inta[N],b[N],g[N],k[N];intmain(){intn;cin>>n;for(inti=1;i>a[i]>>b[i]>>g[i]>>k[i];}intx,

2914: 铺地毯

```#includeusingnamespacestd;constintN=10010;inta[N],b[N],g[N],k[N];intmain(){intn;cin>>n;for(inti=1;i>a[i]>>b[i]>>g[i]>>k[i];}intx,

题解 2914: 铺地毯

#includeusingnamespacestd;constintN=10010;inta[N],b[N],g[N],k[N];intmain(){intn;cin>>n;for(inti=1;i>a[i]>>b[i]>>g[i]>>k[i];}intx,

菜鸡写法,分情况就ok

摘要:解题思路:注意事项:参考代码:#include <iostream>#include<string>#include<cstring>#include<algorithm>#include<cmath……

菜鸡写法,嵌套循环遍历

摘要:解题思路:注意事项:参考代码:#include <iostream>#include<string>#include<cstring>#include<algorithm>#include<cmath……

欢迎交流指正

摘要:解题思路:注意事项:参考代码:#include<iostream>#include<math.h>using namespace std;int main() { int a[100], m, n,s……