06.02 刷题班
//A0413 谁赢了?
#include<bits/stdc++.h>
#include<cstring>
#include<stack>
#include<queue>
#include<vector>
#define ll long long
#define ld long double
#define ull unsigned long long
using namespace std;
int n;
int main(){
cin>>n;
int a,b,c,d,cnt1=0,cnt2=0;//1 tooyoung ; 2 33dai
for(int i=1;i<=n;i++){
cin>>a>>b>>c>>d;
if(a+b>c+d) cnt1++;
if(a+b<c+d) cnt2++;
}
if(cnt1>cnt2) cout<<"TooY0ung";
if(cnt1<cnt2) cout<<"33dai";
if(cnt1==cnt2) cout<<"tie";
return 0;
}
//A0411 奇数还是偶数
#include<bits/stdc++.h>
#include<cstring>
#include<stack>
#include<queue>
#include<vector>
#define ll long long
#define ld long double
#define ull unsigned long long
using namespace std;
string num;
int main(){
cin>>num;
int x=num[num.length()-1]-'0';//num.length()等同于num.size()
if(x%2==0) cout<<"even";
else cout<<"odd";
return 0;
}
//A0116 数组逆序重存放
#include<bits/stdc++.h>
#include<cstring>
#include<stack>
#include<queue>
#include<vector>
#define ll long long
#define ld long double
#define ull unsigned long long
using namespace std;
int n; int a[105];
int main(){
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=n;i>=1;i--) cout<<a[i]<<" ";
return 0;
}
//A0117 不与最大数相同的数字之和
#include<bits/stdc++.h>
#include<cstring>
#include<stack>
#include<queue>
#include<vector>
#define ll long long
#define ld long double
#define ull unsigned long long
using namespace std;
int n;
int a[105];
int maxx=-1e9,sum=0;
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
maxx=max(a[i],maxx);
}
for(int i=1;i<=n;i++){
if(a[i]!=maxx) sum+=a[i];
}
cout<<sum;
return 0;
}
//A0114 与指定数字相同的数的个数
#include<bits/stdc++.h>
#include<cstring>
#include<stack>
#include<queue>
#include<vector>
#define ll long long
#define ld long double
#define ull unsigned long long
using namespace std;
int n,m,cnt=0;
int a[105];
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
cin>>m;
for(int i=1;i<=n;i++){
if(a[i]==m) cnt++;
}
cout<<cnt;
return 0;
}
//A0091 求阶乘的和
#include<bits/stdc++.h>
#include<cstring>
#include<stack>
#include<queue>
#include<vector>
#define ll long long
#define ld long double
#define ull unsigned long long
using namespace std;
int fact(int x){
int res=1;
for(int i=1;i<=x;i++) res=res*i;
return res;
}
int n,sum=0;
int main(){
cin>>n;
for(int i=1;i<=n;i++){
sum+=fact(i);
}
cout<<sum;
return 0;
}
我们会审查剪贴板内容,并对发布不合适内容的同学进行相应的处理