洛谷入门赛 #27:
洛谷语言入门月赛(2024 年 09 月) - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
T491400 [语言月赛 202409] A 灵感
T491400 [语言月赛 202409] A 灵感 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
Code
#include<iostream>
using namespace std;
int a , b , c , d;
int main(){
cin >> a >> b >> c >> d;
if((a + b) < (c + d)) cout << "Yes";
else cout << "No";
return 0;
}
T509588 [语言月赛 202409] B 重聚
Code
#include <iostream>
#include <climits>
using namespace std;
int main() {
int t, d, t1, d1, t2, d2;
cin >> t >> d >> t1 >> d1 >> t2 >> d2;
int waitTimeZ = INT_MAX;
if (d <= d1) waitTimeZ = max(0, t1 - t);
int waitTimeL = INT_MAX;
if (d <= d2) waitTimeL = max(0, t2 - t);
int minWait = min(waitTimeZ, waitTimeL);
if (minWait == INT_MAX) cout << -1 << endl;
else cout << minWait << endl;
return 0;
}
T487914 [语言月赛 202409] C 转盘
Code
#include<iostream>
#include<cmath>
using namespace std;
long long n;
double m;
bool f;
int main(){
cin >> n >> m;
m /= 100.0;
long long one_to_n = (n + 1) * n / 2;
long long ans = 1;
f = false;
do{
double p;
p = static_cast<double>(ans) / one_to_n; // 强制类型转换
if(p >= m){
f = true;
cout << ans << endl;
return 0;
}
ans ++;
}while(ans <= n);
cout << "-1\n";
return 0;
}
T491880 [语言月赛 202409] D 种子
Code
#include<iostream>
using namespace std;
int x , y , w , k , sum , p;
int main(){
cin >> x >> y >> w >> k;
int i = 1;
while(sum < k){
sum += (int)(i / w);
if(i >= x){
sum += y;
}
i ++;
p ++;
// cout << sum << endl;
}
cout << p;
return 0;
}
T510275 [语言月赛 202409] E 距离
Code
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
// 初始化好感度数组,全部为0
vector<vector<int> > feelings(n + 1, vector<int>(n + 1, 0));
for (int i = 0; i < m; ++i) {
int maxFeeling = 0; // 记录当前好感度的最大值
int op, a, b, c;
cin >> op >> a >> b >> c;
// 更新好感度
if (op == 1) {
feelings[a][b] += c;
} else if (op == 2) {
feelings[a][b] = max(0, feelings[a][b] - c); // 保证好感度不会变为负数
}
for(int j = 1; j <= n; j ++){
for(int k = 1; k <= n; k ++){
maxFeeling = max(maxFeeling , feelings[j][k]);
}
}
// 实际上,我们还需要遍历整个二维数组来确保找到全局最大值,但这里题目允许我们仅通过更新来追踪
// 因为每次更新都是基于当前的 maxFeeling 进行的,且题目保证好感度始终是非负的
// 输出当前的最大好感度
cout << maxFeeling << endl;
}
return 0;
}
T510276 [语言月赛 202409] F 始终
Code
#include<iostream>
#include<cstring>
using namespace std;
string s;
int ans = 0;
int main(){
cin >> s;
for(int i = 0; i < s.length(); i ++){
for(int j = s.length() - 1; j >= i; j --){
if(s[i] == s[j]){
ans ++;
}
}
}
cout << ans;
return 0;
}
T487182 [语言月赛 202409] G 数字
#include<iostream>
#include <cmath>
using namespace std;
int n , p , minRemainder = 10000000000;
long long minNum = 9223372036854775807;
int main(){
cin >> n >> p;
for(int i = pow(10, n - 1); i <= pow(10, n); i ++){
int sum = 0;
long long currentNum = i;
while(currentNum){
sum += currentNum % 10;
currentNum /= 10;
}
// cout << sum << " ";
int remainder = sum % p;
if(remainder < minRemainder || (remainder == minRemainder && i < minNum)){
minNum = i;
minRemainder = remainder;
}
}
cout << minNum;
return 0;
}
写题不宜!!!希望点赞,谢谢给位dalao