HZNU短学期题解 2023-09-14

最新推荐文章于 2024-07-27 17:56:15 发布

Aftria

最新推荐文章于 2024-07-27 17:56:15 发布

阅读量305

点赞数 4

文章标签： java 服务器前端

本文链接：https://blog.csdn.net/Aftria/article/details/132868779

版权

今天去北京了，先写一部分晚些再补最后一道题...

print("\yvan/\shen/\zhen/\ha0/\wan/")

n=eval(input())
if n%2==0:
    cnt=n//2
    for i in range(cnt):
        print("x-",end="")
    print("x",end="")
    for i in range(cnt):
        print("-x",end="")

else:
    cnt=n//2
    for i in range(cnt+1):
        print("x-",end="")
    print("x",end="")
    for i in range(cnt):
        print("-x",end="")

n=eval(input())
all_candy=list(map(int,input().split()))
all_candy.sort()
print(all_candy[2],end="")

n=eval(input())
all_score=list(map(int,input().split()))
ans=0
max_num=all_score[0]
min_num=all_score[0]
for i in range(1,len(all_score)):
    if all_score[i]<min_num:
        ans+=1
        min_num=all_score[i]
    elif all_score[i]>max_num:
        ans+=1
        max_num=all_score[i]
print(ans,end="")

5. c++

#include <bits/stdc++.h>
using namespace std;
char a[4][4];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    int a1=0,a2=0,a3=0,a4=0,a5=0,a6=0,a7=0;
    while(n--)
    {
        for(int i=0;i<4;i++)
        {
            for(int j=0;j<4;j++)
            {
                cin >> a[i][j];
            }
        }
        if(a[0][0]=='*')a1++;
        if(a[0][1]=='*' && a[1][2]=='*') a2++;
        if(a[1][1]=='*' && a[1][2]=='*' && a[2][2]=='*') a3++;
        if(a[0][1]=='*' && a[1][0]=='*') a4++;
        if(a[0][1]=='*' && a[2][2]=='*') a5++;
        if(a[0][0]=='.' && a[3][0]=='*') a6++;
        if(a[1][2]=='*' && a[1][3]=='*') a7++;
    }
    cout << a1 << ' ' << a2 << ' ' << a3 << ' ' << a4 << ' ' << a5 <<' ' << a6 << ' '<<a7;
    return 0;
}

6.c++

#include <bits/stdc++.h>
using namespace std;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    int k;
    cin >> k;
    int a[15];
    for (int i=0;i<n;i++)
    {
        cin >> a[i];
    }
    sort(a,a+n,greater<int>());
//    cout << k <<endl;
    int ret=0;
    do {
        ret++;
        if(ret==k) {
            for (int i = 0; i < n; i++) {
                cout << a[i];
            }
            break;
        }
    }while(prev_permutation(a,a+n));
//    do {
//        ret++;
//        if(ret==k) {
//            for (int i = 1; i < n; i++) {
//                cout << a[i];
//            }
//            break;
//        }
//    }while(prev_permutation(a+1,a+n));
    return 0;
}

7.c++

#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int a[N];
long long int sum=0,ans=0;
const int mod=1e9+7;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    string s;
    cin >> s;
    int cnt_t=0;
    bool successful= false;
    for (int i=0;i<n;i++) {
        if (s[i] == 'T') {
            cnt_t++;
        } else if (s[i] == 'E') {
            sum += cnt_t;
        } else if (s[i] == 'N') {
            ans += sum;
            successful = true;
        }
    }
    if (!successful || ans==0)
    {
        cout << "ten,win!!!";
    }else cout << ans%mod;
    return 0;
}