看题或提交评测
B-1
#include <bits/stdc++.h>
using namespace std;
int r;
int main()
{
string s;
while(cin>>s)
{
for(int i=0;i<(int)s.length()-4;i++)
{
if(s.substr(i,5)=="fight")
{
r++;
}
}
}
cout<<r;
return 0;
}
B-2
#include <bits/stdc++.h>
using namespace std;
int c;
int main()
{
vector<pair<int,double>>v,r;
for(int i=1;i<=5;i++)
{
double x;
cin>>x;
v.push_back({i,x});
}
do{
if(fabs(v[0].second/v[1].second-v[2].second/v[3].second)<0.5)
{
if(!c)r=v;
c++;
}
}while(next_permutation(v.begin(),v.end()));
cout<<c<<" "<<r[0].first<<" "<<r[1].first<<" "<<r[2].first<<" "<<r[3].first;
return 0;
}
B-3
#include <bits/stdc++.h>
using namespace std;
int n1,n2,a[10010],b[10010],c[10010],j,t,k;
int main()
{
cin>>n1;
for(int i=n1;i>=1;i--)
{
cin>>a[i];
j=max(j,a[i]);
}
cin>>n2;
for(int i=n2;i>=1;i--)
{
cin>>b[i];
j=max(j,b[i]);
}
j++;
for(k=1;k<=max(n1,n2);k++)
{
c[k]=(a[k]+b[k]+t)%j;
t=(a[k]+b[k]+t)/j;
}
if(t)c[k++]=t;
cout<<k-1;
for(int i=k-1;i>=1;i--)cout<<" "<<c[i];
return 0;
}