- 王老师_区赛复习1
《真·答案》
- @ 2025-12-5 19:25:39
1.
#include <bits/stdc++.h>
using namespace std;
bool cmp(int a,int b){
return a>b;
}
int a[10];
int main(){
cin>>a[1]>>a[2]>>a[3];
sort(a+1,a+1+3,cmp);
int s=0;
s+=a[1]-a[2];
s+=a[2]-a[3];
cout<<s;
return 0;
}
2.
#include<bits/stdc++.h>
#define int long long
using namespace std;
int x,y,z,a,b,c;
signed main(){
cin>>x>>y>>z;
if(x%z==0){
a=x/z;
}else {
a=x/z+1;
}
if(y%z==0){
b=y/z;
}else{
b=y/z+1;
}
cout<<a*b;
return 0;
}
3.
#include<bits/stdc++.h>
#define int long long
using namespace std;
int t,s,ans;
signed main(){
cin>>t>>s;
for(int i=0;i<=t;i++){
for(int j=0;j<=t;j++){
if(i+j<=s){
int k=s-i-j;
if(k<=t){
ans++;
}
}
}
}
cout<<ans;
return 0;
}
4.
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int t,a[100010],b[100010];
cin>>t;
string s1,s2;
while(t--){
cin>>s1>>s2;
for(int i=0;i<30;i++){
a[i]=b[i]=0;
}
for(int i=0;i<s1.size();i++){
a[s1[i]-'a']++;
}
for(int i=0;i<s2.size();i++){
b[s2[i]-'a']++;
}
sort(a,a+26);
sort(b,b+26);
int flag=1;
for(int i=0;i<26;i++){
if(a[i]!=b[i]){
flag=0;
}
}
if(flag==1){
cout<<"Yes\n";
}else{
cout<<"No\n";
}
}
return 0;
}
5.
#include <bits/stdc++.h>
using namespace std;
#define int long long
int swsz(int x){
while(x>=10){
x/=10;
}
return x;
}
int n,cnt[10][10]={0},t=0;
signed main() {
cin>>n;
for(int i=1;i<=n;i++){
int sos=i%10,sb=swsz(i);
cnt[sb][sos]++;
}
for(int i=0;i<10;i++){
for(int j=0;j<10;j++){
long long soso=cnt[i][j]*cnt[j][i];
t+=soso;
}
}
cout<<t;
return 0;
}
不要直接复制上面代码!!!
awa
2 条评论
-
zhangyisi LV 8 @ 2025-12-21 21:13:33不是8题吗?
-
@ 2025-12-13 20:48:38
e
- 1