L1006~L1010

最新推荐文章于 2024-09-26 12:00:11 发布

企鹅会滑雪

最新推荐文章于 2024-09-26 12:00:11 发布

阅读量70

点赞数

分类专栏： t天梯赛练习集文章标签： c++

本文链接：https://blog.csdn.net/m0_74127166/article/details/129659915

版权

t天梯赛练习集专栏收录该内容

3 篇文章 0 订阅

订阅专栏

这组C++代码分别实现了四个功能：L1-006是找到输入整数的最大质因数及其个数；L1-007将输入的负整数或正整数转换为其中文表示；L1-008在指定范围内累加打印整数并计算总和；L1-009计算一组分数的最小公倍数和简化后的结果；L1-010对输入的三个整数进行排序并输出。

摘要由CSDN通过智能技术生成

L1-006

#include<cstdio>
#include<cmath>

using namespace std;
const int N = 100;

int main()
{
     int n;
     scanf("%d",&n);
     int Max = 0 , st,num ,cnt;
    
     for(int i = 2 ; i < sqrt(n) ; i++)
     {
         num = 1;
         cnt = 0;
        for(int j = i ; n % (num * j) == 0 ; j++)
        {
            cnt++;
            num *= j;
        }
         if(cnt > Max) 
         {
             Max = cnt;
             st = i;
         }
         
     }
     
        if(Max == 0)
        {
            printf("1\n");
            printf("%d",n);
        }
        else
        {
            printf("%d\n",Max);
            int i;
            for( i = st ; i < st + Max - 1; i++)
            {
            printf("%d*",i);    
            }
            printf("%d",i);
            
            }       
    
   
    return 0;
}

L1-007

#include<bits/stdc++.h>

using namespace std;

int main()
{
    string str;
    cin>>str;
    int i = 0;
    if(str[0] == '-')
    {
        printf("fu ");
        i = 1;
    }
   
    for(; str[i] ; i++)
    {
        int x = str[i] - '0';
        
        if(i != str.size()-1)
        { 
        switch(x)
        {
            case 0 : cout<<"ling ";break;
            case 1 : cout<<"yi ";break;
            case 2 : cout<<"er ";break;
            case 3 : cout<<"san ";break;
            case 4 : cout<<"si "; break;
            case 5 : cout<<"wu ";break;
            case 6 : cout<<"liu ";break;
            case 7 : cout<<"qi ";break;
            case 8 : cout<<"ba ";break;
            case 9 : cout<<"jiu ";break;
        }
        }
        else
        {
            switch(x)
        {
            case 0 : cout<<"ling";break;
            case 1 : cout<<"yi";break;
            case 2 : cout<<"er";break;
            case 3 : cout<<"san";break;
            case 4 : cout<<"si"; break;
            case 5 : cout<<"wu";break;
            case 6 : cout<<"liu";break;
            case 7 : cout<<"qi";break;
            case 8 : cout<<"ba";break;
            case 9 : cout<<"jiu";break;
        }
        }
        
    }
    
    return 0;
    
}

L1-008

#include<bits/stdc++.h>

using namespace std;

int main()
{
    int a,b;
    scanf("%d%d",&a,&b);
    int cnt = 0;
    int sum = 0;
    for(int i = a ; i <= b ; i++)
    {
        cnt++;
        printf("%5d",i);
        sum += i;
        if(cnt % 5 == 0) printf("\n");
    }
    if(cnt % 5 == 0) cout<<"Sum = "<<sum;
    else cout<<endl<<"Sum = "<<sum;
    
    return 0;
}

L1-009

#include<bits/stdc++.h>

using namespace std;

int long long a[101];
int long long b[101];

int Gcd(int long long a, int long long b)
{
    return b ? Gcd(b,a % b) : a;
}

int Lcm(int long long a, int long long b)
{
    return  a * b / Gcd(a,b);
}

int main()
{
    int n;
    cin>>n;
    
    int long long u = 0 , v = 1;
    
    for(int i = 0 ; i < n ; i++)
    {
        scanf("%lld/%lld",&a[i],&b[i]);
        v = Lcm(v , b[i]);
    }
 
    for(int i = 0 ; i < n ; i++)
    {
        a[i] = a[i] * v / b[i];
        u += a[i];
    }
    
     if(u == 0)
    {
        cout<<0;
        return 0;
    }
    
    
    int res = Gcd(abs(u),v);
    u /= res;
    v /= res;
    
    if(u < v)
    {
        if(u > 0)
        cout<<u<<"/"<<v;
        else
        {
            u = -u;
            cout<<"-";
            
            if(u < v)  cout<<u<<"/"<<v;
            else  if(u % v == 0)
            {
                cout<<u/v;
            }
            else
            {
                int t = u / v;
                cout<<t<<" "<<"-";
                cout<<u - t * v;
                cout<<"/"<<v;
            }
        }
    }
    else
    {
        int t = u % v;
        if(t == 0) cout<<u/v;
        else
        {
            int k = u / v;
            u = u - k * v;
            cout<<k<<" "<<u<<"/"<<v;
        }
    }
    
}

L1-010

#include<bits/stdc++.h>

using namespace std;

int main()
{
    int a[3];
    for(int i = 0 ; i < 3 ; i++) scanf("%d",&a[i]);
    
        sort(a,a+3);
    
        printf("%d->%d->%d",a[0],a[1],a[2]);

        return 0;    
}