关于我们
未命名
HYW 发表于2026-07-30 浏览66 评论0
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m[100010];
cin>>n;
for(int i=0;i<=n-1;i++){
cin>>m[i];
}
for(int i=n-1;i>=0;i--){
cout<<m[i]<<" ";
}
return 0;
}关于我们
7.29
TYC 发表于2026-07-30 浏览57 评论0
#include<bits/stdc++.h>
using namespace std;
int a[101][101];
int main(){
int n,m,sum=0;
cin>>n>>m;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cin>>a[i][j];
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
sum+=a[i][j];
}cout<<sum<<" ";
sum=0;
}cout<<endl;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
sum+=a[j][i];
}cout<<sum<<" ";
sum=0;
}
return 0;
}关于我们
第四页第3题
TYC 发表于2026-07-30 浏览52 评论0
#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("data.in","r",stdin);
freopen("data.out","w",stdout);
int a,b;
scanf("%d %d",&a,&b);
printf("%d",a+b);
fclose(stdin);
fclose(stdout);
return 0;
}关于我们
未命名
HYW 发表于2026-07-30 浏览51 评论0
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,x=0,y=100;
cin>>n;
for(int i=1;i<=n;i++){
cin>>m;
if(x<m){
x=m;
}else{
x=x;
}
if(y>m){
y=m;
}else{
y=y;
}
}
cout<<"max="<<x<<" "<<"min="<<y;
return 0;
}关于我们
第一页第4题
TYC 发表于2026-07-30 浏览61 评论0
#include<bits/stdc++.h>
using namespace std;
struct x{
int chengji;
string xingming;
}a[1001];
bool cmp(x a,x b){
return a.chengji>b.chengji;
}
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i].xingming>>a[i].chengji;
}sort(a,a+n+2,cmp);
cout<<a[1].xingming;
return 0;
}
关于我们
Arduino
Very2 发表于2026-07-11 浏览460 评论0
关于我们
Game260707
Very2 发表于2026-07-07 浏览490 评论1
import random
name=["陈奕霖","李老师","张智芃","史蒂夫","艾利克斯","蛋仔"]
place=["马桶上","地铁上","冰箱里","大街上","李老师面前","自己的老婆面前"]
mood=["深情地","认真地","伤心地","哭着","疯狂地","开心"]
action=["啃","拉","舔","抠","亲","吃","运","喝","吐","嗦"]
thing=["棒棒糖","脚丫","手指","西瓜皮","粑粑","尿","李老师","子弹","豆包","牛粪","心脏"]
while(1):
input("按回车键开始游戏")
p1=random.choice(name)
p2=random.choice(place)
p3=random.choice(mood)
p4=random.choice(action)
p5=random.choice(thing)
print(f"{p1}在{p2}{p3}{p4}{p5}")
关于我们
思维导图
Very2 发表于2026-07-04 浏览411 评论0
关于我们
排序算法
Very2 发表于2026-06-13 浏览674 评论0
冒泡排序-普通版：
#include <iostream>
using namespace std;
int a[1001], n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n - 1; i++)
for (int j = 1; j <= n - i; j++)
if (a[j] > a[j + 1])
swap(a[j], a[j + 1]);
for (int i = 1; i <= n; i++)
cout << a[i] << " ";
return 0;
}