522 条题解
-
0
root (zhuqirui123) LV 10 @ 2023-10-07 23:27:11
/******************************************************** 备注： ********************************************************/ #include <iostream> #include <iomanip> #include <cmath> #include <cstring> #include <algorithm> #include <cstdio> using namespace std; #define LL long long #define MAXM 3010 #define MAXN 3010 const int N =1e5+10; const int INF =0x3f3f3f3f; int main () { int a,b; cin>>a>>b; cout<<a+b; return 0; } -
0
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
string name,maxName;
int exam,review,paper,bonus=0,maxBonus=0,sumBonus=0;
char cadres,west;
for (int i=1;i<=n;i++){
cin>>name>>exam>>review>>cadres>>west>>paper;
if (exam>80&&paper>=1){
bonus+=8000;
}
if (exam>85&&review>80){
bonus+=4000;
}
if (exam>90){
bonus+=2000;
}
if (exam>85&&west=='Y'){
bonus+=1000;
}
if (review>80&&cadres=='Y'){
bonus+=850;
}
if (bonus>maxBonus){
maxBonus=bonus;
maxName=name;
}
sumBonus+=bonus;
bonus=0;
}
cout<<maxName<<endl<<maxBonus<<endl<<sumBonus<<endl;
return 0;
} -
0
#include<iostream> using namespace std; int main(){ struct student{ string xm; long long int qm,py,lw,ans=0,xh; char gb,xb; }a[101]; long long int n,max1=0,max2=0; string zname; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i].xm>>a[i].qm>>a[i].py>>a[i].gb>>a[i].xb>>a[i].lw; a[i].xh=i; if((a[i].qm>80)&&(a[i].lw>=1)) a[i].ans+=8000; if((a[i].qm>85)&&(a[i].py>80)) a[i].ans+=4000; if(a[i].qm>90) a[i].ans+=2000; if((a[i].qm>85)&&(a[i].xb=='Y')) a[i].ans+=1000; if((a[i].py>80)&&(a[i].gb=='Y')) a[i].ans+=850; max2+=a[i].ans; if(a[i].ans>max1){ zname=a[i].xm; max1=a[i].ans; } } cout<<zname<<endl<<max1<<endl<<max2; return 0; } -
0
J o e (唐子瞳) LV 10 @ 2023-07-02 23:04:22
#include<bits/stdc++.h> using namespace std; const int MAXN=1e5+1; int read(){ int ans = 0, f = 1; char ch=getchar(); while(!isdigit(ch)) f*=(ch=='-')?-1:1,ch=getchar(); do ans=(ans<<1)+(ans<<3)+(ch^48),ch=getchar(); while(isdigit(ch)); return ans*f; } struct node{ string name; int grade1;//平均 int grade2;//评议 char gan; char west; int book; int all; int num; }a[MAXN]; bool cmp(node x,node y){ if(x.all==y.all)return x.num<y.num; return x.all>y.all; } int main(){ int n=read(); for(int i=1;i<=n;i++){ cin>>a[i].name>>a[i].grade1 >>a[i].grade2 >>a[i].gan >>a[i].west >>a[i].book; a[i].num=i; } for(int i=1;i<=n;i++){ if(a[i].grade1>80&&a[i].book>=1)a[i].all+=8000; if(a[i].grade1>85&&a[i].grade2>80)a[i].all+=4000; if(a[i].grade1>90)a[i].all+=2000; if(a[i].west=='Y'&&a[i].grade1>85)a[i].all+=1000; if(a[i].grade2>80&&a[i].gan=='Y')a[i].all+=850; } sort(a+1,a+n+1,cmp); cout<<a[1].name<<endl; cout<<a[1].all<<endl; int alll=0; for(int i=1;i<=n;i++)alll+=a[i].all; cout<<alll; return 0; } /*4 YaoLin 87 82 Y N 0 ChenRuiyi 88 78 N Y 1 LiXin 92 88 N N 0 ZhangQin 83 87 Y N 1*/ -
0
#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e5+1;
int read(){
int ans = 0, f = 1;
char ch=getchar();
while(!isdigit(ch))
f*=(ch=='-')?-1:1,ch=getchar();
do ans=(ans<<1)+(ans<<3)+(ch^48),ch=getchar();
while(isdigit(ch));
return ans*f;
}
struct node{
string name;
int grade1;//平均
int grade2;//评议
char gan;
char west;
int book;
int all;
int num;
}a[MAXN];
bool cmp(node x,node y){
if(x.all==y.all)return x.num<y.num;
return x.all>y.all;
}
int main(){
int n=read();
for(int i=1;i<=n;i++){
cin>>a[i].name>>a[i].grade1 >>a[i].grade2 >>a[i].gan >>a[i].west >>a[i].book;
a[i].num=i;
}
for(int i=1;i<=n;i++){
if(a[i].grade1>80&&a[i].book>=1)a[i].all+=8000;
if(a[i].grade1>85&&a[i].grade2>80)a[i].all+=4000;
if(a[i].grade1>90)a[i].all+=2000;
if(a[i].west=='Y'&&a[i].grade1>85)a[i].all+=1000;
if(a[i].grade2>80&&a[i].gan=='Y')a[i].all+=850;
}
sort(a+1,a+n+1,cmp);
cout<<a[1].name<<endl;
cout<<a[1].all<<endl;
int alll=0;
for(int i=1;i<=n;i++)alll+=a[i].all;
cout<<alll;
return 0;
} -
0
注意点：scanf格式符间加空格
#include <stdio.h> int main(void) { struct student { char name[20]; int finalScore; int commentScore; char stuLeader; char westernProvince; int paper; int sumAward; }; int sumNum = 0; scanf("%d", &sumNum); struct student STUDENT[sumNum]; for(int i = 0; i < sumNum; i++) { STUDENT[i].sumAward = 0; scanf("%s %d %d %c %c %d", STUDENT[i].name, &STUDENT[i].finalScore, &STUDENT[i].commentScore, &STUDENT[i].stuLeader, &STUDENT[i].westernProvince, &STUDENT[i].paper); if( (STUDENT[i].finalScore > 80) && (STUDENT[i].paper > 0) ) { STUDENT[i].sumAward += 8000; } if( (STUDENT[i].finalScore > 85) && (STUDENT[i].commentScore> 80) ) { STUDENT[i].sumAward += 4000; } if(STUDENT[i].finalScore > 90) { STUDENT[i].sumAward += 2000; } if( (STUDENT[i].finalScore > 85) && (STUDENT[i].westernProvince == 'Y') ) { STUDENT[i].sumAward += 1000; } if( (STUDENT[i].commentScore > 80) && (STUDENT[i].stuLeader == 'Y') ) { STUDENT[i].sumAward += 850; } } int index = 0; int stuSumAward = 0; for(int j = 0; j < sumNum; j++) { if(STUDENT[index].sumAward < STUDENT[j].sumAward) { index = j; } stuSumAward += STUDENT[j].sumAward; } printf("%s\n%d\n%d", STUDENT[index].name, STUDENT[index].sumAward, stuSumAward); return 0; } -
0
季傲然 (aaron07) LV 7 @ 2022-08-28 21:11:10
#include<bits/stdc++.h>
using namespace std;
int main()
{
int c;
cin>>c;
string name[c];
char n,m;
int x,y,z,money[c],max_money=0,s_money=0;
memset(money,0,sizeof(money));
for(int i=0;i<c;i++)
{
cin>>name[i]>>x>>y>>n>>m>>z;
if(x>80&&z>=1)money[i]+=8000;
if(x>85&&y>80)money[i]+=4000;
if(x>90)money[i]+=2000;
if(x>85&&m=='Y')money[i]+=1000;
if(y>80&&n=='Y')money[i]+=850;
if(money[i]>max_money)
max_money=money[i];
s_money+=money[i];
}
for(int i=0;i<c;i++)
if(max_money==money[i])
{
cout<<name[i]<<endl<<max_money<<endl<<s_money<<endl;
break;
}
return 0;
} -
0
这是一道较为简单的模拟题
#include<bits/stdc++.h> using namespace std; int n; struct obj{//定义结构体，方便作答 string name;//名字 int K_pj,B_pj;//考试成绩和评议成绩 char b,x;//是否是学生干部和西部省份学生 int lw;//论文 int xh;//序号（文件的顺序） int sum;//奖金总和 }arr[109]; bool cmp(obj a, obj b){//比较函数 if(a.sum>b.sum){ //奖金多的在前 return true; }else if(a.sum==b.sum){ //如果奖金一样 if(a.xh<b.xh) return true; //序号小的在前 } return false; } int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>arr[i].name>>arr[i].K_pj>>arr[i].B_pj>>arr[i].b>>arr[i].x>>arr[i].lw; arr[i].xh=i;//序号赋值 } long long Z_sum=0;//所有人的奖金值 for(int i=1;i<=n;i++){ if(arr[i].K_pj>80 && arr[i].lw>=1) arr[i].sum+=8000;//院士奖 if(arr[i].K_pj>85 && arr[i].B_pj>80) arr[i].sum+=4000;//五四奖 if(arr[i].K_pj>90) arr[i].sum+=2000;//成绩奖 if(arr[i].K_pj>85 && arr[i].x=='Y') arr[i].sum+=1000;//西部奖 if(arr[i].B_pj>80 && arr[i].b=='Y') arr[i].sum+=850;//贡献奖 Z_sum+=arr[i].sum; } sort(arr+1,arr+1+n,cmp); cout<<arr[1].name<<endl;//奖金最多的人的名字 cout<<arr[1].sum<<endl;//他的奖金数 cout<<Z_sum;//总奖金 return 0;//完美撒花 } -
0
#include<iostream>
using namespace std;
int main(){
string a,name;
int b,c,f,n,money=0,max=0,sum=0;
char d,e;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a>>b>>c>>d>>e>>f;
money=0;
if(b>80 && f>=1){
money+=8000;
}
if(b>85 && c>80){
money+=4000;
}
if(b>90){
money+=2000;
}
if(b>85 && e=='Y'){
money+=1000;
}
if(c>80 && d=='Y'){
money+=850;
}
if(max<money){
max=money;
name=a;
}
sum+=money;
}
cout<<name<<endl<<max<<endl<<sum<<endl;
return 0;
} -
0
#include <bits/stdc++.h> using namespace std; int main() { int n,score1,score2,sum = 0,max = 0,total = 0,x,i; char a,b; string name,maxn; cin >> n; for (i = 1;i <= n;i ++) { cin >> name >> score1 >> score2 >> a >> b >> x; if(score1 > 80 && x > 0) sum += 8000; if(score1 > 85 && score2 > 80) sum += 4000; if(score1 > 90) sum += 2000; if(score1 > 85 && b == 'Y') sum += 1000; if(score2 > 80 && a == 'Y') sum += 850; total += sum; if(sum > max) maxn = name,max =sum; sum = 0; } cout << maxn << endl << max << endl << total; return 0; } -
0
November (CLH_W) LV 10 @ 2022-04-09 15:31:45
#include <stdio.h> #include <stdlib.h> #define N 10 typedef struct winners { char name[20]; int finalScore; int classScore; char work; char west; int paper; int scholarship; } WIN; void Addup(WIN stu[], int n); int FindMax(WIN student[], int n); int main() { int i, n, max; printf("Input n:"); scanf("%d",&n); WIN stu[N]; for (i=0;i<n;i++) { printf("Input name:"); scanf("%s",stu[i].name); printf("Input final score:"); scanf("%d",&stu[i].finalScore); printf("Input class score:"); scanf("%d",&stu[i].classScore); printf("Class cadre or not?(Y/N):"); scanf(" %c",&stu[i].work); printf("Students from the West or not?(Y/N):"); scanf(" %c",&stu[i].west); printf("Input the number of published papers:"); scanf("%d",&stu[i].paper); Addup(stu, i); } max = FindMax(stu, n); printf("%s get the highest scholarship %d\n",stu[max].name,stu[max].scholarship); return 0; } void Addup(WIN stu[], int n) { stu[n].scholarship = 0; if (stu[n].finalScore > 80 && stu[n].paper >= 1) stu[n].scholarship += 8000; if (stu[n].finalScore > 85 && stu[n].classScore > 80) stu[n].scholarship += 4000; if (stu[n].finalScore > 90) stu[n].scholarship += 2000; if (stu[n].finalScore > 85 && stu[n].west == 'Y') stu[n].scholarship += 1000; if (stu[n].classScore >80 && stu[n].work == 'Y') stu[n].scholarship += 850; printf("name:%s,scholarship:%d\n",stu[n].name,stu[n].scholarship); } int FindMax(WIN student[], int n) { int max = 0; for (int i=1;i<n;i++) { if (student[max].scholarship < student[i].scholarship) max = i; } return max; } -
0
使用c++的类很简单就用过了，主要注意字符串的处理，直接建立一个学生的类别
一次ac!!，庆祝我的第一个c++程序
#include<iostream>
using namespace std;class CStu
{
public:
string name[100];
int score;
int classscore;
char student;
char position;
int number;
int prize;
CStu()
{
prize = 0;
}
};
int main()
{
int a=0;
int max = 0;
CStu stu[100];
cin >> a;
int total=0;
for (int i = 0; i < a; i++)
{
cin >> stu[i].name[50];
cin >> stu[i].score;
cin >> stu[i].classscore;
cin >> stu[i].student;
cin >> stu[i].position;
cin >> stu[i].number;
}
for (int b = 0; b < a; b++)
{
if ((stu[b].score > 80) && (stu[b].number >= 1))
{
stu[b].prize = stu[b].prize + 8000;
}//院士奖学金
if ((stu[b].score > 85) && (stu[b].classscore > 80))
{
stu[b].prize = stu[b].prize + 4000;
}//五四奖学金
if (stu[b].score > 90)
{
stu[b].prize = stu[b].prize + 2000;
}//成绩优秀奖学金
if ((stu[b].score > 85) && (stu[b].position == 'Y'))
{
stu[b].prize = stu[b].prize + 1000;
}//西部奖学金
if ((stu[b].classscore > 80) && (stu[b].student == 'Y'))
{
stu[b].prize = stu[b].prize + 850;
}//班级贡献奖学金
}
max = stu[0].prize;
total = 0;
for (int i = 0; i < a; i++)
{
if (max < stu[i ].prize)
{
max = stu[i].prize;
}
total = total + stu[i ].prize;
}
for (int i = 0; i < a; i++){
if (stu[i].prize == max)
{
cout << stu[i].name[50] << endl;
break;
}
}
cout << max << endl << total << endl;
return 0;
} -
0
#include<iostream>
using namespace std;class CStu
{
public:
string name[100];
int score;
int classscore;
char student;
char position;
int number;
int prize;
CStu()
{
prize = 0;
}
};
int main()
{
int a=0;
int max = 0;
CStu stu[100];
cin >> a;
int total=0;
for (int i = 0; i < a; i++)
{
cin >> stu[i].name[50];
cin >> stu[i].score;
cin >> stu[i].classscore;
cin >> stu[i].student;
cin >> stu[i].position;
cin >> stu[i].number;
}
for (int b = 0; b < a; b++)
{
if ((stu[b].score > 80) && (stu[b].number >= 1))
{
stu[b].prize = stu[b].prize + 8000;
}//院士奖学金
if ((stu[b].score > 85) && (stu[b].classscore > 80))
{
stu[b].prize = stu[b].prize + 4000;
}//五四奖学金
if (stu[b].score > 90)
{
stu[b].prize = stu[b].prize + 2000;
}//成绩优秀奖学金
if ((stu[b].score > 85) && (stu[b].position == 'Y'))
{
stu[b].prize = stu[b].prize + 1000;
}//西部奖学金
if ((stu[b].classscore > 80) && (stu[b].student == 'Y'))
{
stu[b].prize = stu[b].prize + 850;
}//班级贡献奖学金
}
max = stu[0].prize;
total = 0;
for (int i = 0; i < a; i++)
{
if (max < stu[i ].prize)
{
max = stu[i].prize;
}
total = total + stu[i ].prize;
}
for (int i = 0; i < a; i++){
if (stu[i].prize == max)
{
cout << stu[i].name[50] << endl;
break;
}
}
cout << max << endl << total << endl;
return 0;
} -
0
#include<bits/stdc++.h> using namespace std; int n,ALL; struct xs{ string name; int last_exam,class_decided; char is_worker,is_west; int photos,money,bh; }s[110]; bool cmp(xs a,xs b){ if(a.money!=b.money) return a.money>b.money; else if(a.bh!=b.bh) return a.bh<b.bh; } int main(){ cin>>n; for(int i=1;i<=n;i++){ s[i].money=0,s[i].bh=i; cin>>s[i].name; cin>>s[i].last_exam>>s[i].class_decided; cin>>s[i].is_worker>>s[i].is_west>>s[i].photos; if(s[i].last_exam>80 and s[i].photos>=1) s[i].money+=8000; if(s[i].last_exam>85 and s[i].class_decided>80) s[i].money+=4000; if(s[i].last_exam>90) s[i].money+=2000; if(s[i].last_exam>85 and s[i].is_west=='Y') s[i].money+=1000; if(s[i].class_decided>80 and s[i].is_worker=='Y') s[i].money+=850; ALL+=s[i].money; } sort(s+1,s+n+1,cmp); cout<<s[1].name<<"\n"<<s[1].money<<"\n"<<ALL; return 0; } -
0
//AC代码，但做了点小改动
#include <bits/stdc++.h>
using namespace std;
long long n,q[200],b[200],l[200],pri,maxx,t,sum;
char g[200],x[200];
string s[200];
int mian(){
cin>>n;
for(int i=1;i<=n;i++)cin>>s[i]>>q[i]>>b[i]>>g[i]>>x[i]>>l[i];
for(int i=1;i<=n;i++)//几个判断自己xiangxiang
{
if(q[i]>80&&l[i]>=1)pri+=8000;
if(q[i]>85&&b[i]>80)pri+=4000;
if(q[i]>90)pri+=2000;
if(q[i]>85&&x[i]=='Y')pri+=1000;
if(b[i]>80&&g[i]=='Y')pri+=850;
sum+=pri;if(pri>maxx){maxx=pri;t=i;}pri=0;
}
cout<<s[t]<<endl<<maxx<<endl<<sum;
return 0;
}-
洛谷超爱编程的王__ @ 2021-08-14 13:23:39
额，又是一个Markdown不会用的
-
-
0
#include <iostream>
#include <vector>
using namespace std;
struct stu
{
string name, lead, west;
int fin, grade, paper;
int money = 0;
};
int main()
{
int n;
cin >> n;
vector<stu> stus(n);
int max = 0;
int where = 0;
int sum = 0;
for (int i = 0; i != n; i++)
{
cin >> stus[i].name >> stus[i].fin >> stus[i].grade >> stus[i].lead >> stus[i].west >> stus[i].paper;
if (stus[i].fin > 80 && stus[i].paper != 0){
stus[i].money += 8000;}
if (stus[i].fin > 85 && stus[i].grade > 80){
stus[i].money += 4000;}
if (stus[i].fin > 90){
stus[i].money += 2000;}
if (stus[i].fin > 85 && stus[i].west == "Y"){
stus[i].money += 1000;}
if (stus[i].grade > 80 && stus[i].lead == "Y"){
stus[i].money += 850;}
sum+=stus[i].money;
}
for (int i = 0; i != n; i++)
{
if (max < stus[i].money)
{
max = stus[i].money;
where = i;
}
}
cout << stus[where].name << endl
<< stus[where].money << endl
<< sum << endl;
} -
0
#include<iostream>
using namespace std;
struct STUDENT{
string name;
int n1,n2;
char xsgb,xb;
int lw;
int jxj;
};
int main(){
int n;
int sum=0;
cin>>n;
struct STUDENT stu[n];
struct STUDENT zdz;
zdz.jxj=0;
for(int i=0;i<n;i++)stu[i].jxj=0;
for(int i=0;i<n;i++){
cin>>stu[i].name>>stu[i].n1>>stu[i].n2>>stu[i].xsgb>>stu[i].xb>>stu[i].lw;
if(stu[i].n1>80&&stu[i].lw>=1)stu[i].jxj+=8000;
if(stu[i].n1>85&&stu[i].n2>80)stu[i].jxj+=4000;
if(stu[i].n1>90)stu[i].jxj+=2000;
if(stu[i].n1>85&&stu[i].xb=='Y')stu[i].jxj+=1000;
if(stu[i].n2>80&&stu[i].xsgb=='Y')stu[i].jxj+=850;
if(stu[i].jxj>zdz.jxj)zdz=stu[i];
sum+=stu[i].jxj;
}
cout<<zdz.name<<endl<<zdz.jxj<<endl<<sum;
return 0;}
-
0
#include<iostream>
#include<string>
using namespace std;int main()
{
int stdNum, averageScore, commentScore, papareNum;
string name,iscadre,iswest,maxName;
int allSum = 0, perSum = 0, maxSum = 0;
cin >> stdNum;
for (int i = 0; i < stdNum; i++)
{
cin >> name >> averageScore >> commentScore >> iscadre >> iswest >> papareNum;
if (papareNum>0&&averageScore>80) //院士奖学金
{
perSum += 8000;
}
if (averageScore>85&&commentScore>80) //五四奖学金
{
perSum += 4000;
}
if (averageScore>90) // 成绩优秀奖
{
perSum += 2000;
}
if (iswest=="Y"&&averageScore>85) // 西部奖学金
{
perSum += 1000;
}
if (iscadre=="Y"&&commentScore>80) // 班级贡献奖
{
perSum += 850;
}
if (perSum>maxSum)
{
maxSum = perSum;
maxName = name;
}
allSum += perSum;
perSum = 0;
}
cout << maxName << endl;
cout << maxSum << endl;
cout << allSum << endl;
return 0;
}
root (zhuqirui123)
LV 10
@ 2023-10-07 23:27:11
