当前位置:网站首页>20排位赛3
20排位赛3
2022-07-07 07:09:00 【moyangxian】
A
题意:略
题记:略
#include<bits/stdc++.h>
using namespace std;
const int N=110;
int a[N];
int main(){
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
cout<<max(0,a[2]-a[1]-a[0]+1)<<endl;
return 0;
}
B
题意:略
题记:找字符串的最长公共前后缀,用substr()函数或者求next函数。
#include<bits/stdc++.h>
using namespace std;
const int N=110;
int nxt[N];
char s[N];
int n,k;
void getnext(){
int i=0,j=-1;
nxt[0]=-1;
while(i<n){
if(j==-1||s[i]==s[j])
i++,j++,nxt[i]=j;
else
j=nxt[j];
}
}
int main(){
cin>>n>>k;
cin>>s;
getnext();
cout<<s;
for(int i=1;i<=k-1;i++)
cout<<(s+nxt[n]);
return 0;
}
C
题意:略
题记:总共可以看到n/x个灯笼,r/x表示1~ r能看到多少灯笼,(l-1)/x表示1 ~ (l-1)能看到多少灯笼。(n/x)-r/x+(l-1)/x即答案。
#include<bits/stdc++.h>
using namespace std;
const int N=110;
void solve(){
int n,x,l,r;
cin>>n>>x>>l>>r;
cout<<(n/x)-r/x+(l-1)/x<<endl;
}
int main(){
int T;
cin>>T;
while(T--){
solve();
}
return 0;
}
D
题意:略
题记:每次sum都能减去一个(a-b),所以将(a-b)作为关键字降序排序,每次将sum减一下即可。最后再判断一下sum是否大于m。
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+10;
struct Node{
int a,b;
bool operator<(const Node &W)const{
return a-b>W.a-W.b;
}
}t[N];
void solve(){
int n,m;
cin>>n>>m;
ll sum=0;
for(int i=1;i<=n;i++){
cin>>t[i].a>>t[i].b;
sum+=t[i].a;
}
sort(t+1,t+1+n);
int ans=0;
for(int i=1;i<=n;i++){
if(sum<=m) break;
sum-=t[i].a-t[i].b;
ans++;
}
if(sum<=m) cout<<ans<<endl;
else cout<<"-1"<<endl;
}
int main(){
int T=1;
//cin>>T;
while(T--){
solve();
}
return 0;
}
E
题意:略
题记:
C语言的sin函数需要传递的是弧度,弧度=角度*pi/180
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi=acos(-1.0);
int main(){
double n,r;
cin>>n>>r;
double s=sin(360/(n*2)*(pi/180));
double ans=(s*r)/(1-s);
printf("%.8f\n",ans);
return 0;
}
F
G
边栏推荐
- 基于智慧城市与储住分离数字家居模式垃圾处理方法
- How to become a senior digital IC Design Engineer (5-3) theory: ULP low power design technology (Part 2)
- Octopus future star won a reward of 250000 US dollars | Octopus accelerator 2022 summer entrepreneurship camp came to a successful conclusion
- [Frida practice] "one line" code teaches you to obtain all Lua scripts in wegame platform
- 信息安全实验三 :PGP邮件加密软件的使用
- Database multi table Association query problem
- H5网页播放器EasyPlayer.js如何实现直播视频实时录像?
- Niuke - Huawei question bank (61~70)
- 牛客网——华为题库(61~70)
- IIS redirection redirection appears eurl axd
猜你喜欢
ComputeShader
基础篇:带你从头到尾玩转注解
What development models did you know during the interview? Just read this one
基于智慧城市与储住分离数字家居模式垃圾处理方法
Detailed explanation of diffusion model
Esp8266 uses TF card and reads and writes data (based on Arduino)
How will fashion brands enter the meta universe?
浏览器中如何让视频倍速播放
4、 Fundamentals of machine learning
Unity3d interface is embedded in WPF interface (mouse and keyboard can respond normally)
随机推荐
VSCode+mingw64+cmake
在EXCEL写VBA连接ORACLE并查询数据库中的内容
AI从感知走向智能认知
Lesson 1: finding the minimum of a matrix
Impression notes finally support the default markdown preview mode
Nested (multi-level) childrn routes, query parameters, named routes, replace attribute, props configuration of routes, params parameters of routes
大佬们,有没有遇到过flink cdc读MySQLbinlog丢数据的情况,每次任务重启就有概率丢数
Dynamics 365Online ApplicationUser创建方式变更
Communication mode between processes
【BW16 应用篇】安信可BW16模组/开发板AT指令实现MQTT通讯
Esp8266 uses TF card and reads and writes data (based on Arduino)
Oracle installation enhancements error
Elaborate on MySQL mvcc multi version control
First issue of JS reverse tutorial
flink. CDC sqlserver. 可以再次写入sqlserver中么 有连接器的 dem
Unity shader (learn more about vertex fragment shaders)
MongoDB怎么实现创建删除数据库、创建删除表、数据增删改查
Huawei HCIP - datacom - Core 03 jours
第一讲:寻找矩阵的极小值
【无标题】