复兴无基础第十一课
2025-09-07 20:12:19
发布于：上海
2阅读
0回复
0点赞
T1不倒翁
#include <bits/stdc++.h>
using namespace std;
int main(){
/*
int a, b, c, d, e, f, g, h;
cin >> a >> b >> c >> d >> e >> f >> g >> h;
if(a > b && b > c && c > d && d > e && e > f && f > g && g > h){
cout << "descending";
}else if(a < b && b < c && c < d && d < e && e < f && f < g && g < h){
cout << "ascending";
}else{
cout << "mixed";
}
*/
int a[10];
for(int i = 1; i <= 8; i++){
cin >> a[i];
}
int flag = 0;//假设一开始是合法的
for(int i = 2; i <= 8; i++){
if(a[i - 1] < a[i]){
flag = 1;
break;
}
}
if(flag == 1){
for(int i = 2; i <= 8; i++){
if(a[i - 1] > a[i]){
flag = 2;
break;
}
}
if(flag == 2){
cout << "mixed";
}else{
cout << "ascending";
}
}else{
cout << "descending";
}
return 0;
}
T2K/D/A 1
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k, d, a, p;
int maxn = -1, id = -1;
char c;
cin >> n;
for(int i = 1; i <= n; i++){
cin >> k >> c >> d >> c >> a;
if(k - d >= 10){
p = k * (k - d) + a;
}else if(k >= d){
p = (k - d + 1) * 3 + a;
}else{
p = a * 2;
}
if(p > maxn){
maxn = p;
id = i;
}
}
cout << id;
return 0;
}
T3角谷猜想
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
while(n != 1){
if(n % 2 == 0){
cout << n << "/2=" << n / 2 << endl;
n /= 2;
}else{
cout << n << "*3+1=" << n * 3 + 1 << endl;
n = n * 3 + 1;
}
}
cout << "End";
return 0;
}
T4奇与偶3.0
#include <iostream>
using namespace std;
int main() {
int n,even=0,odd=0;
cin >> n;
int a[1005];
for (int i=1;i<=n;i++){
cin >> a[i];
}
for (int i=1;i<=n;i+=2){
odd += a[i];
cout << a[i] << " ";
}
cout << endl;
for (int i=2;i<=n;i+=2){
even += a[i];
cout << a[i] << " ";
}
cout << endl << odd-even;
return 0;
}
T5拼接
#include <bits/stdc++.h>
using namespace std;
int main(){
string a, b;
cin >> a >> b;
if(a > b){
cout << b << a;
}else {
cout << a << b;
}
return 0;
}
T6统计分号个数
#include <iostream>
using namespace std;
int main(){
int num = 0;
string s;
getline(cin , s);
for(int i = 0; i < s.size();i++){
if(s[i] == ';'){
num ++;
}
}
cout << num;
return 0;
}
这里空空如也
有帮助，赞一个