0
修练者
- #include <iostream>
- #include <cmath>
- using namespace std;
- int b[5]={0,1,2,3,4};
- string a[]={"W","M","A","B","C"};
- int main(){
- int n,t;
- cin>>n;
- t=n;
- if(n%5==0){ n=5-1;
- }else{
- n=n%5-1;
- }
- cout<<a[n]<<" ";
- if(t%4==0){ t=4;
- }else{
- t=t%4;
- }
- cout<<b[t];
- return 0;
- }
0
中级光能
8341
- #include<bits/stdc++.h>
- using namespace std;
- int main(){
- double m,s,a,x;
- cin>>m;
- for(int i=1;i<=m;i++){
- cin>>s>>a>>x;
- if(a==0){
- cout<<ceil(s)<<endl;
- }else if(a==1){
- cout<<s-ceil(s*x/100)<<endl;
- }
- }
- return 0; }
0
中级光能
double a,cnt=0,sum=0;
while(1){
cin>>a;
if(a==0){
break;
}
sum+=a;
cnt++;
} cout<<cnt<<endl<<setprecision(3)<<fixed<<sum/cnt;
0
中级光能
1497
- #include<iostream>
- #include<algorithm>
- #include<cstdio>
- #include<iomanip>
- #include<cmath>
- #include<string>
- using namespace std;
- struct C{
- string name;
- int s,y,news;
- }a[105];
- bool cmp(C x,C y){
- if(x.news!=y.news){
- return x.news>y.news;
- } return x.name<y.name;
- }
- int main(){
- int n;
- cin>>n;
- for(int i=1;i<=n;i++){
- cin>>a[i].name>>a[i].s>>a[i].y; a[i].news=a[i].s+a[i].y*500;
- } sort(a+1,a+n+1,cmp);
- for(int i=1;i<=n;i++){
- cout<<a[i].name<<" "<<a[i].news<<endl;
- }
- return 0;
- }
0
中级光能
- #include<iostream>
- #include<algorithm>
- #include<cstdio>
- #include<iomanip>
- #include<cmath>
- #include<string>
- using namespace std;
- struct h{ int c; double d; }a[10005];
- bool cmp(h x,h y){
- if(x.d!=y.d){
- return x.d>y.d;
- } else {
- return x.c<y.c;
- }
- }
- int main(){
- int n,m;
- cin>>n>>m;
- for(int i=1;i<=n;i++){
- cin>>a[i].c>>a[i].d;
- }sort(a+1,a+n+1,cmp);
- cout<<a[m].c<<" "<<setprecision(1)<<fixed<<a[m].d;
- return 0;
- }
0
中级光能
1281
0
中级守护
- #include<iostream> #include<cstdio> #include<iomanip> using namespace std; int main(){ int a; cin>>a; if(a<=100){ cout<<setprecision(2)<<fixed<<a*0.9; }else{ cout<<setprecision(2)<<fixed<<100.0*0.9+(a-100)*0.7; } return 0; }
