慕慕慕团队竞赛代码展示第一届第一名

天上飞的慕温

2025-12-05 21:49:13

发布于：浙江

4阅读

0回复

0点赞

注:检查人员不记入排名

首届“慕慕慕”团队编程竞赛初赛

第一名不会是ai的
T1代码:

#include <bits/stdc++.h>
using namespace std;
int main(){
    int a,b,c;
    cin>>a>>b>>c;
    if(c%5==a%5&&c%7==b%7){
        cout<<"Yes"<<endl;
    }else{
        cout<<"No"<<endl;
    }
    return 0;
}

T2代码:

#include <bits/stdc++.h>
using namespace std;
int main(){
    int ans,n;
    cin>>n;
    for(int i=0;i<=n/7;i++){
        int j=(n-7*i)/4;
        int k=n-i-j;
        if(k%3!=0){
            continue;
        }
        if(5*i+3*j+k/3==n){
            ans++;
        }
    }
    cout<<ans;
    return 0;
}

T3代码:

#include <bits/stdc++.h>
using namespace std;
int main(){
    char a;
    cin>>a;
    int n=int(a);
    if(n%2==0){
        cout<<"NO";
    }
    else{
        cout<<"YES";
    }
    return 0;
}

T4代码:

//这普及-难度吧
#include <iostream>
#include <cmath>
using namespace std;
long long computeMaxSum(int k) {
    if (k % 2 == 1) {
        long long t = (k + 1) / 2;
        return t * t;
    } else {
        long long t = k / 2;
        return t * (t + 1);
    }
}

int main() {
    int t;
    cin >> t;
    while (t--) {
        long long n, m;
        cin >> n >> m;
        long long d = abs(m - n);
        
        if (d == 0) {
            cout << 0 << endl;
            continue;
        }
        int k = 1;
        while (true) {
            long long maxSum = computeMaxSum(k);
            if (maxSum >= d && d >= k) {
                cout << k << endl;
                break;
            }
            k++;
        }
    }
    return 0;
}

(仿ai吗有点意思)
T5代码:

#include <bits/stdc++.h>
using namespace std;
int main(){
    string a;
    cin>>a;
    for(int i=0;i<=a.size()-1;i++){
        if(a[i]>='a' and a[i]<='z'){
            a[i]-=32;
        }
        else if(a[i]>='A' and a[i]<='Z'){
            a[i]+=32;
        }
    }
    cout<<a;
}

T6代码:

#include <bits/stdc++.h>
using namespace std;
int main(){
    int k;
	cin>>k;
    int m=0,n=1;
    while(k){
        for(int i=1;i<=n;i++){
            if(k==0){
                break;
            }
            k--;
            m+=n;
        }
        n++;
    }
    cout<<m;
    return 0;
}

T7代码:

#include <bits/stdc++.h>
using namespace std;
int main(){
    int k;
	cin>>k;
    int m=0,n=1;
    while(k){
        for(int i=1;i<=n;i++){
            if(k==0){
                break;
            }
            k--;
            m+=n;
        }
        n++;
    }
    cout<<m;
    return 0;
}

T8代码:

#include <bits/stdc++.h>
using namespace std;
short n,a[10],sum=0;
int main(){
    for(short i=0;i<10;i++){
        cin>>a[i];
    }
    cin>>n;
    for(short i=0;i<10;i++){
        if(a[i]<=(n+30)){
            sum++;
        }
    }
    cout<<sum;
    return 0;
}

T9代码:

#include <bits/stdc++.h>
using namespace std;
int main(){
	int a,b=0,c=0;
	cin>>a;
	while(1){
		b=a%10;
		c=c*10+b;
		a/=10;
		if(a==0){
			break;
		}
	}
	cout<<c;
	return 0;
}

T10代码:


#include <iostream>
using namespace std;

int main() {
    int k;
    cin >> k;
    
    double sum = 0.0;
    int n = 0;
    
    while (sum <= k) {
        n++;
        sum += 1.0 / n;
    }
    
    cout << n << endl;
    return 0;
}

有帮助，赞一个

去预览

0/2000

这里空空如也

首届“慕慕慕”团队编程竞赛初赛

热门讨论