题解(自记录) | 牛客寒假集训营20250208第五场比赛

A.小L的三则运算

题目:https://ac.nowcoder.com/acm/contest/95337/A

#include<bits/stdc++.h>

using namespace std;

int main() {

long long x;string a;

cin >> x >> a;

if(a[0]=='*'){

cout << x <<" " << 1;

}

else if(a[0]=='-'){

cout << x+1 << " " << 1;

}

else{

cout << x-1 << " " << 1;

}

}

题解思路:由题意可知将输入进来的X根据运算符分为两个数输出,由于输出的值必须>1,当运算符为±时即为X±1和±1,*则为X和1

B.小L出师了

题目:https://ac.nowcoder.com/acm/contest/95337/B

#include<bits/stdc++.h>

#define ll long long

using namespace std;

int main() {

int T;

cin >> T;

while(T--){

ll n,t,k;

cin >> n >> t >> k;

ll c=(n-k)/t;

if(c>k+1)c=k+1;

cout << c << endl;

}

}

题解思路:相当于用隔板(K)将箱子分开,最大值不能大于K+1,而能使组成条件最优即(讲课次数-代讲次数)/达成条件.

C.小L的位运算

题目:https://ac.nowcoder.com/acm/contest/95337/C

D.小L的字符串翻转

题目:https://ac.nowcoder.com/acm/contest/95337/D

E.小L的井字棋

题目:https://ac.nowcoder.com/acm/contest/95337/E

F.小L的抽卡

题目:https://ac.nowcoder.com/acm/contest/95337/F

G.小L的三元组

题目:https://ac.nowcoder.com/acm/contest/95337/G

H.小L的min-max问题

题目:https://ac.nowcoder.com/acm/contest/95337/H

I.小L的数学题

题目:https://ac.nowcoder.com/acm/contest/95337/I

#include<bits/stdc++.h>

#define ll long long

using namespace std;

int main() {

int T;

cin >> T;

while(T--){

ll n,m;

cin >> n >> m;

if(n==0 && m==0){

cout << "Yes" << endl;

}

else if(n==0 || m==0){

cout << "No" << endl;

}

else{

cout << "Yes" << endl;

}

}

}

题解报告:首先若n为零,那么除非m也为零,否则不可能变化。当n和m都不为零时,对n进行无限次开方总能得到一,想象数字I(m2^j<=I<(m+1)2^j)开方j次能得到m,当j足够大时,总能找到一个数满足I所以始终存在。

J.小L的汽车行驶问题

题目:https://ac.nowcoder.com/acm/contest/95337/J

#include<bits/stdc++.h>

using namespace std;

int main() {

long long x=0,v=0,t=0;string a;

cin >> t >> a;

for(int i=0;i<t;i++){

if(a[i]=='0'){v+=10;x+=v;}

else if(a[i]=='1'){

if(v>=5)v-=5;

x+=v;

}

else{if(v>=10){

v-=10;

x+=v;

v+=10;

}}

}

cout << x;

}

题解思路:根据题目,油门增加10m/s,刹车减少5m/s,离合暂时减少10m/s,根据题意模拟即可.

K.小L的几何

题目:https://ac.nowcoder.com/acm/contest/95337/K

L.小L的构造

题目:https://ac.nowcoder.com/acm/contest/95337/L