“科大讯飞杯”第18届上海大学程序设计联赛春季赛暨高校网络友谊赛补题报告2020.4.20

#include
using namespace std;
typedef long long ll;
struct f
{
int day;
int num;
float tem;
};
bool cmp(f a,f b)
{
if(a.day!=b.day)
{
return a.day>b.day;
}
else if(a.tem!=b.tem)
{
return a.tem>b.tem;
}
else
{
return a.num<b.num;
}
}
int main()
{
int n,i,j,k;
cin>>n;
int ans=0;
struct f a[200];
for(i=0;i)
{
cin>>a[i].day>>a[i].num>>a[i].tem;
if(a[i].tem>=38.0)
{
ans++;
}
}
sort(a,a+n,cmp);
cout<endl;
cout<<fixed<1);
int p=0;
for(i=0;i)
{
if(a[i].tem>=38.0)
{
cout<‘ ‘<‘ ‘<endl;
p++;
}
if(p==ans)
{
break;
}
}
return 0;
}

#include//stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
string s1,s2;
int len1,len2;
cin>>s1>>s2;
len1=s1.size();
len2=s2.size();
if(len1!=len2)
{
cout<<max(len1,len2);
}
else
{
if(s1==s2)
{
cout<<-1;
}
else
{
cout<<len1;
}
}
return 0;
}

#include
using namespace std;
int main() {
int n,t=1;
string a="00";
cin>>n;
if(n==1) {
cout<<1<<endl;
cout<<"1"<<endl;
} else if(n==2) {
cout<<2<<endl;
cout<<"1"<<endl;
cout<<"00"<<endl;
} else {
cout<1<<endl;
cout<endl;
while(t!=n-1) {
a.insert(1,"1");
cout<endl;
t++;
}
}
}

#include
#include
#include
#include
using namespace std;
typedef long long ll;
int a[100000+8];
int main()
{
ll i,j,k,n;
cin>>n;
ll sum=0;
for(i=0;i)
{
cin>>a[i];
sum+=a[i];
}
ll s1=0;
s1=((1+n-1)*(n-1))/2;
cout<s1;
return 0;
}

#include
#include