香蜜C班-期末讲解

userId_undefined

张kk

2026-01-08 16:34:02

发布于：广东

12阅读
0回复
0点赞
T1
#include <bits/stdc++.h>
using namespace std;
int main(){
    int n,m;
    cin>>n>>m;
    int all = n*10+m;
    
    cout<<all/19;
    
    
	return 0;   
}

T2
#include<bits/stdc++.h>
using namespace std;
int main(){
    long long a;
    cin >>a;
    if(a%4==0&&a%100!=0||a%400==0){
        cout <<"Y";
    }else{
        cout <<"N";
    }
    return 0;
}

T3
#include <iostream>
using namespace std;

int main(){
    int x;
    cin >> x;
    if (x % 3 == 0 && x % 5 == 0){
        cout << "YES";
    }else{
        cout << "NO";
    }
    return 0;
}

T4
#include <iostream>
using namespace std;

int main(){
	int n;
    cin >> n;
    for (int i = 1; i <= n; ++i) {
		int x = 0;
		int s = i; 
		while(s > 0){
			x = x * 10 + s % 10;   
			s = s / 10;        
		}if(x == i){
			cout << i << endl;
		}
	}   
	return 0;
}


T5
#include<iostream>
using namespace std;
int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        if(i%2==1)
        {
            cout<<i+1<<" ";
        }
        else
        {
            cout<<i-1<<" ";
        }
    }
    return 0;
}

T6
#include<iostream>
using namespace std;
int main(){
    int n, sum=0, max=0,a[100005];
    cin >> n;
    for(int i=0; i<n; i++){
        cin >> a[i];
    }
    for(int i=0; i<n; i++){
        if(a[i]==1){
            sum=sum+1;
            if(sum>max){
                max = sum;
            }
        }
        else{
            sum=0;
        }
    }
    cout << max;
    return 0;
}


T7
#include<bits/stdc++.h>
using namespace std;
int n,m,a[110][110],b;
int main(){
	cin >> n >>m;
	for(int i = 1; i <= n; i ++){
        for(int j = 1; j <= m; j ++){
            cin >> a[i][j];
        }
    }
    for(int i = 1; i <= n; i ++){
        for(int j = 1; j <= m; j ++){
            if(i==1||i==n||j==1||j==m){
                b += a[i][j];
            }
        }
    }
	cout << b;
    return 0;
}

T8
#include<bits/stdc++.h>
using namespace std;
int a[105];
int main(){
    int n;
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++)cout<<a[i]<<" ";
    return 0;
}

T9
#include <bits/stdc++.h>
using namespace std;
int a[110],b[110];

int main(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<=n;i++) cin>>b[i];
    sort(a+1,a+n+1);
    sort(b+1,b+n+1);
    int i=1,j=1,sum=0;
    while(i<=n && j<=n){
        if(a[i]>b[j]){
            sum+=200;
            i++;
            j++;
        }else{
            i++;
            sum-=200;
        }
    }
    cout<<sum;
	return 0;
}


T10
#include <bits/stdc++.h>
using namespace std; 
int n;
struct stu{
	double t;//时间 
	int id;//序号 
}a[100001];
bool cmp(stu aa,stu bb){
	return aa.t< bb.t;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].t;
		a[i].id = i;
	}
	sort(a+1,a+1+n,cmp);
	for(int i=1;i<=n;i++){
		cout<<a[i].id<<" ";
	}
	cout<<endl;
	double sum1=0,sum2=0;
	for(int i=1;i<n;i++){
		sum1 = sum1 + a[i].t;
		sum2 = sum2 + sum1;
	}
	printf("%.2f",sum2/n);
	return 0;
}
userId_undefined
去预览
0/2000
暂无数据

这里空空如也

热门讨论