团体程序设计天梯赛-练习集 L1区代码

题目链接：

https://www.patest.cn/contests/gplt

 

#include<iostream>
using namespace std ;

int main()
{
    cout << "Hello World!"<<endl;
    return 0 ;
}

 

 

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
#include<set>
using namespace std ;

int main()
{
    int n ;
    char a ;
    cin >> n >> a  ;
    int temp = 1 , cnt = 3 ;
    while( temp + cnt + cnt <= n )
        {
            temp+=cnt+cnt;
            cnt+=2;
        }

    cnt -= 2 ;
    int cntt = cnt ;
    //´òÓ¡cnt¸ö* ,
    while( cnt != 1 )
        {
            for( int j = 1 ; j <= (cntt - cnt ) / 2 ; j++)
                cout <<' ' ;
            for( int i = 1 ; i <= cnt ; i++)
                cout << a ;
            cout << endl ;
            cnt-=2;

        }
    int cnttt = cntt ;
    for( int i = 1 ; i  <= (cnttt - 1 ) / 2 ; i++)
        cout <<" ";
    cout << a << endl ;
    for( int i = 3 ; i <= cntt ; i+=2 )
        {
            for( int k = 1 ; k <= (cnttt - i) / 2  ; k++)
                cout <<" " ;

            for( int j = 1 ; j <= i ; j++)
                cout << a ;
            cout << endl ;
        }
    cout << n - temp << endl ;
    return 0 ;

}

 

 

#include<iostream>
#include<cstring>
using namespace std ;

int main()
{
    string n ;
    cin >> n ;
    int a[10];
    memset(a,0,sizeof(a));
    for( int i = 0 ; i < n.length() ; i++)
    {
        a[ n[i] - '0' ]++;
    }
    
    for( int i = 0 ; i <= 9 ; i++)
    {
        if( a[i] != 0 )
            cout << i <<":" << a[i] << endl ;
    }
    
    return 0 ; 
}

 

 

#include<cstdio>
#include<cstdlib>
#include<iostream>
using namespace std ;
int main()
{
    int F ;
    cin >> F ;
    cout << "Celsius = " << 5*(F-32)/9 << endl ;
    return 0  ;
}

 

 

#include<iostream>
using namespace std ;

struct {
    string s ;
    int a , b ;
} a[1010];

int main()
{
    int n ;
    cin >> n ;
    for( int i = 1 ; i <= n ; i++)
        cin >> a[i].s >> a[i].a >> a[i].b ;
    int m ;
    cin >> m ;
    for( int i = 1 ; i <= m ; i++)
    {
        int temp ;
        cin >> temp ;
        for( int i = 1 ; i<= n ; i++)
        {
            if( a[i].a == temp )
            {
                cout << a[i].s << ' ' << a[i].b <<endl ;
                break ;
            }
        }
    }
    return 0 ; 
}

 

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
using namespace std ;

bool is_prime( long long int n )
{
    if( n == 2 )
        return true ;
    int temp = sqrt(n);
    for( int j = 2 ; j <= temp ; j++)
        if( n % j == 0 )
            return false ;
    return true ;
}
int main()
{
    long long  n ;
    cin >> n ;
    int l = 0 , r = 0 , cnt = 0 ;
    if( is_prime(n))
    {
        cout << 1 << endl ;
        cout << n << endl ;
        return 0 ;
    }
    for( int i = 2 ; i <= 30 ; i++)
        {
            int temp = i;
            int temp_cnt = 0 ;
            int temp_chengfa = 1 ;
            long long int nn = n ;
            while( nn % temp == 0 )
                {
                    temp_chengfa *= temp ;
                    nn /= temp ;
                    temp_cnt++ ;
                    temp++;
                    
                    
                }
            if( temp_cnt > cnt && ( n % temp_chengfa == 0 ) )
                cnt = temp_cnt , l = i , r = temp-1 ;
            continue  ;

        }

    cout << cnt << endl ;
    for( int i =  l ; i <= r ; i++)
        {
            if( i == l )
                cout << i ;
            else
                cout << "*" << i ;
        }
    cout << endl ;
    return 0 ;
}

 

 

#include<cstdio>
#include<iostream>
#include<cstring>
#include<iostream>
using namespace std ; 
const string NAME[] ={"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};

int main()
{
    string s ;
    cin >> s ;
    for( int i = 0 ; i < s.length() ; i++)
    {
        if( s[i] == '-' )
            cout << "fu";
        else
            cout << NAME[s[i] -'0'] ;
        if( i != s.length() - 1)
            cout << ' ' ;
    }
    cout << endl;
    return 0 ; 
}

 

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std ;

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

 

#include<bits/stdc++.h>
using namespace std ;
//存储分数
struct fraction
{
    long long numerator;
    long long denominator;
};
//求最大公约数，通分用
long long gcd( long long a , long long b )
{
    if ( a < 0 || b < 0 )
        a=abs(a),b=abs(b);
    if( b == 0 )
        return a ;
    else
        return gcd( b , a % b );
}
//分数加法，加后是个假分数形式（把b加到a上）
void add( struct fraction &a , struct fraction &b )
{    
    a.numerator  = a.numerator * b.denominator;
    b.numerator = b.numerator * a.denominator ;
    a.denominator = a.denominator * b.denominator ;
    a.numerator = a.numerator + b.numerator ;
    long long temp = gcd( a.numerator , a.denominator );
    a.numerator /= temp , a.denominator /= temp ;
    return ; 
}

int main()
{
    struct fraction a , b ;
    long long n ;
    cin >> n ;
    scanf("%lld/%lld",&a.numerator,&a.denominator);
    long long intger = 0 ;
    for( int i = 2 ; i <= n ; i++)
    {
        scanf("%lld/%lld",&b.numerator,&b.denominator);
        add(a,b);
    }
//通分
    if( abs(a.numerator )>= a.denominator )
    {
        intger = a.numerator / a.denominator ;
        a.numerator = abs(a.numerator);
        a.numerator  %= a.denominator ;
    }

//输出
    if( intger == 0 && a.numerator == 0 )
    {
        cout << 0 ;
    }
    else if ( intger != 0 && a.numerator == 0 )
        cout << intger ;
    else if( intger != 0  )
        cout << intger << ' ';
    if( a.numerator != 0   )
        printf("%lld/%lld",a.numerator,a.denominator);
    cout << endl ;
    return 0;
}

 

 

#include<bits/stdc++.h>
using namespace std ;
int a[3] ;
int main()
{
    cin >> a[0] >> a[1] >> a[2] ;
    sort(a,a+3);
    printf("%d->%d->%d\n",a[0],a[1],a[2]);
    return 0 ;
}

 

 

#include<bits/stdc++.h>
using namespace std ;
map<char,int> a ;
int main()
{
    ios::sync_with_stdio(false);
    string s1,s2;
    getline(cin,s1);
    getline(cin,s2);
    for( int i = 0 ; i < s2.length() ; i++)
    {
        a[s2[i]] = 1 ;
    }

    for( int i = 0 ; i < s1.length() ; i++)
    {
        if( a[ s1[i] ] == 1 )
            s1[i] = 0 ;
    }

    for( int i = 0 ; i < s1.length() ; i++)
        if( s1[i] != 0 )
            cout << s1[i] ;
    cout << endl ;
    return 0 ;
}

#include<bits/stdc++.h>
using namespace std ;

int main()
{
  int n ;
  cin >> n ;
  printf("2^%d = %d",n,(int)pow(2,n));
  return 0 ;
}

 

#include<bits/stdc++.h>
using namespace std ;

int fun1( int n )
{
    if( n == 1 || n == 0 )
        return 1;
    else
        return n*fun1(n-1);
}

int fun2( int n )
{
    int ans = 0;
    for( int i = 1 ; i <= n ; i++)
        ans+= fun1(i);
    return ans ;
}

int main()
{
    int n ;
    cin >> n ;
    cout << fun2(n) << endl ;
    return 0 ;
}

 

#include<bits/stdc++.h>
using namespace std ;
int main()
{
    cout << "This is a simple problem." << endl ;
    return 0 ;
}

 

 

#include<bits/stdc++.h>
using namespace std ;

void printf_line( char c, int n )
{
    for( int i = 1 ; i <= n ; i++)
        cout << c ;
    cout << endl ;
    return  ;
}

int main()
{
    int n ;
    char c ;
    cin >> n >> c ;
    for( int i = 1 ; i <= (n+1) >> 1 ; i++)
        printf_line(c,n);
    return 0 ;
}
            

 

 

#include<bits/stdc++.h>
using namespace std ; 
int a[] = {0,7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2};
int Z[] = {1,0,999,9,8,7,6,5,4,3,2};
int calculate_key( string s )
{
    int ans = 0  ;
    for( int i = 0 ; i < 17 ; i++)
        ans+= (s[i] - '0' ) * a[i+1] ;
    return (ans % 11 );
}

bool judge( int a , int b )
{
    if( Z[a] == 999 && b == 'X' - '0'  )
        return true ;
    else if( Z[a] == b )
        return true ;
    else
        return false ;
}

int main()
{
    ios::sync_with_stdio(false);
    int n ;
    string s ;
    cin >> n ;
    bool flag = true ;
    for( int i = 1 ; i <= n ; i++)
    {
        cin >> s ;
        int key = calculate_key(s);
        if( !judge(key,s[17]-'0' ))
        {
                flag=false;
                cout << s << endl ;
        }
        else
            continue ;
    }
    if( flag )
        cout << "All passed" << endl ;
    return 0 ;
    }

 

#include<bits/stdc++.h>
using namespace std ; 

int main()
{
    string s ;
    cin >> s ;
    int flag1 = true ; // + - 
    int flag2 = false; // dan shuang .
    int cnt = 0 ;
    if( s[0] == '-' )
        flag1 = false ;
    if( (s[ s.length() - 1 ] - '0' ) % 2 == 0 )
        flag2 = true ;
    for( int i = 0 ; i < s.length() ; i++)
        if( s[i] == '2' )
            cnt++;
    printf("%.2lf\%\n",(double)cnt/(( (int) s.length() - ( flag1==false ? 1 : 0 ) ))*( flag1==false ? 1.5 : 1 )*(flag2==true ? 2 : 1 )*100 ) ;
    return 0 ;
}

 

 

#include<bits/stdc++.h>
using namespace std ;

void printf_Dang( int n )
{
    for( int i = 1 ; i <= n ; i++)
        cout << "Dang" ;
    cout << endl;
    return  ;
}

int main()
{
    int h , m ;
    scanf("%d:%d",&h,&m);
    if( h >= 0 && h <= 12 )
    {
        if( h == 12 && m != 0 )
            printf_Dang( 1 ) ; 
            printf("Only %02d:%02d.  Too early to Dang.\n",h,m);
    }
    else 
    {
        if( m == 0 )
            printf_Dang( (h>12) ? (h-12) : h ) ;
        else 
            printf_Dang((h > 12 ) ? ( h - 12 + 1 ) : (h+1));
    }
    return 0 ;
}

 

 

#include<bits/stdc++.h>
using namespace std ;
int main()
{
    int jia,yi;
    cin >> jia >> yi ;
    int n ;
    cin >> n ;
    int cntjia = 0 , cntyi = 0 ; 
    for( int i = 1; i <= n ; i++)
    {
        int jiahan,jiahua,yihan,yihua ;
        cin >> jiahan >> jiahua >> yihan >> yihua ;
        if( ( jiahan + yihan ) == jiahua && (jiahan + yihan) == yihua )
            continue ;
        else if( (jiahan + yihan) == jiahua )
        {
            jia--;
            cntjia++;
        }
        else if( ( jiahan + yihan ) == yihua)
        {
            yi--;
            cntyi++;
        }

        if( jia == -1)
        {
            cout << "A" << endl ;
            cout << cntyi  << endl ;
            break ;
        }
        else if( yi == -1 )
        {
            cout << "B" << endl ;
            cout << cntjia << endl ;
            break ;
        }
    }

    return 0 ;
}

        

 

 

#include<bits/stdc++.h>
using namespace std ;
int a[100000];

int main()
{
    int n ;
    cin >> n ;
    memset(a,0,sizeof(a));
    for( int i = 1 ; i <= n ; i++)
    {
        int nn , data ; 
        cin >> nn;
        if( nn == 1 )
        {
            cin >> data ;
            continue ;
        }
        else
        {
            for( int j = 1 ; j <= nn ; j++)
            {
                cin >> data ;
                a[data]++;
            }
        }
    }

    int flag = true ;
    int nnn ;
    cin >> nnn ;
    for( int i = 1 ; i <= nnn ; i++)
    {
        int temp ;
        cin >> temp ;
        if( a[temp] == 0  && flag )
        {
            flag = false ;
            //cout << temp; 
            printf("%05d",temp);
            a[temp] = 1 ;
        }
        else if( a[temp] == 0 && (!flag) ) 
        {
            //cout << ' ' << temp ;
            printf(" %05d",temp);
            a[temp] = 1 ;
        }


    }
    if( !flag )
        cout << endl ;
    else
        cout << "No one is handsome" << endl ;
    return 0 ;
}

 

#include<bits/stdc++.h>
using namespace std ;
int main()
{
    cout << "I'm gonna WIN!" << endl ;
    cout << "I'm gonna WIN!" << endl ;
    cout << "I'm gonna WIN!" << endl ;
    return 0 ;
}

 

 

#include<bits/stdc++.h>
using namespace std ;
int main()
{
    int n ;
    cin >> n ;
    int odd = 0 , even = 0 ;
    for( int i = 1 ; i <= n ; i++)
    {
        int temp ;
        cin >> temp ;
        if( temp % 2 == 0 )
            even++;
        else 
            odd++;
    }

    cout << odd << ' ' << even << endl ;
    return 0 ;
}

 

 

#include<bits/stdc++.h>
using namespace std ;
string s ;
void p( int n )
{
    for( int i = 1 ; i <= n ; i++)
    {
        cout << "GPLT" ;
    }
    return ;
}
int main()
{
    cin >> s ;
    int G = 0 , L = 0 , P = 0 , T = 0 ;
    for( int i = 0 ; i < s.length() ; i++)
    {
        if( s[i] == 'G' || s[i] == 'g' )
            G++;
        if ( s[i] == 'L' || s[i] == 'l' )
            L++;
        if( s[i] == 'P' || s[i] == 'p' )
            P++;
        if( s[i] == 'T' || s[i] == 't' )
            T++;
    }
    while( G != 0 || L != 0 ||  P != 0 ||  T != 0 )
    {
        if( G != 0)
        {
            cout << "G";
            G--;
        }
        if( P != 0 )
        {
            cout << "P";
            P--;
        }
        if( L != 0 )
        {
            cout << "L";
            L--;
        }
        if( T != 0 )
        {
            cout << "T";
            T--;
        }
    }

    cout << endl ;
    return 0 ;
}

 

 

#include<bits/stdc++.h>
using namespace std ;

int main()
{
    int n ;
    cin >> n ;
    cout << ((  n + 2  <=7 ) ? ( n + 2 ) : ( ( n + 2 ) % 7 ))    << endl ;
    return 0 ; 
}

 

 

#include<bits/stdc++.h>
using namespace std ;

int fun( const string &s)
{
    int ans = 0;
    for( int i = 0 ; i < s.length(); i++)
    {
        if( s[i]  >= '0' && s[i]  <= '9' )
            ans= ( s[i] - '0' ) + ans * 10 ;
        else 
            return -1;
    }
    if( ans > 1000 || ans < 1 )
        return -1 ;

    return ans ;
}

int main()
{
    string s1 , s2 ;
    getline(cin,s1,' ');
    getline(cin,s2);
    int n1 = fun(s1) , n2 = fun(s2);
    if( n1 == -1)
        printf("?");
    else 
        printf("%d",n1);

    printf(" + ");

    if( n2 == -1)
        printf("?");
    else
        printf("%d",n2);

    printf(" = ");

    if( n1 == -1 || n2 == -1 )
        printf("?\n");
    else
        printf("%d\n",n1+n2);
    return 0 ;
}

 

 

#include<bits/stdc++.h>
using namespace std ;
int main()
{
    printf("I\n \nL\no\nv\ne\n \nG\nP\nL\nT\n");
    return 0 ;
}

 

 

#include<bits/stdc++.h>
using namespace std ;
int arr[100],ind[100];
int numb[100];
int te[10];

bool cmp( int a , int b )
{
    return a > b ;
}

int main()
{

    int tem = 0 ;
    string s ;
    cin >> s ;

    for( int i = 0 ; i < 11 ; i++)
    {
        numb[i] = s[i] - '0' ;
        te[numb[i]]++;
    }

    for( int i = 9 ; i >= 0 ; i-- )
    {
        if( te[i] != 0 )
            arr[tem++] = i ;
    }

    for( int i = 0 ; i < 11 ; i++)
    {
        for( int j = 0 ; j <= 9 ; j++)
        {
            if( numb[i] == arr[j] )
            {
                ind[i] = j ;
                break;
            }

        }
    }

    printf("int[] arr = new int[]{%d",arr[0]);
    for( int i = 1 ; i < tem ; i++)
        cout << ',' << arr[i] ;
    cout << "};" << endl ;
    printf("int[] index = new int[]{%d",ind[0]);
    for( int i = 1 ; i < 11 ; i++)
        cout << ',' << ind[i] ;
    cout << "};" << endl ;
    return 0 ;
}

 

 

#include<bits/stdc++.h>
using namespace std ;
bool isprime( int n )
{
    if( n == 1 )
        return false ;
    if( n == 2 )
        return true ;
    for( int i = 2 ; i <= sqrt(n) ; i++)
    {
        if( n % i == 0 )
            return false ;
    }

    return true ;
}

int main()
{
    int n ;
    cin >> n ;
    for( int i = 1 ; i <= n ; i ++)
    {
        int number ;
        cin >> number ;
        if( isprime(number))
            cout << "Yes" << endl ;
        else
            cout << "No" << endl ;
    }

    return 0 ; 
    }

 

 

#include<bits/stdc++.h>
using namespace std ;
double fun( int n )
{
    return (n-100) * 0.9 *2 ;
}

int main()
{
    int h ;
    cin >> h ;
    printf("%.1lf\n",fun(h));
    return 0 ;
}

 

 

#include<bits/stdc++.h>
using namespace std ;

struct student
{
    int sex ;
    string name ;
    int rank ;
}a[55];

void deletee( struct student &a)
{
    a.sex = -1;
    a.name.clear();
    a.rank = 0 ;
    return ;
}


int main()
{
    int n ;
    cin >> n ;
    for( int i = 1 ; i <= n ; i++)
    {
        cin >> a[i].sex >> a[i].name ;
        a[i].rank = i;
    }

    for( int i = 1 ; i <= n ; i++)
    {
        bool flag = false ; ;
        if( !a[i].name.empty())
        {
            cout << a[i].name << ' '; 
            flag = true ;
        }

        if( a[i].sex == 0 )
        {
            for( int j = n ; j>=1 ; j--)
            {
                if( a[j].sex == 1 )
                {
                    cout << a[j].name ;
                    deletee(a[j]);
                    break;
                }
            }
        }
        else if( a[i].sex == 1 )
        {
            for( int j = n ; j >= 1 ; j--)
            {
                if( a[j].sex == 0 )
                {
                    cout << a[j].name ;
                    deletee(a[j]);
                    break ;

                }
            }
        }
        if(flag)
            cout << endl ;
    }
    return 0 ;
}

 

 

#include<bits/stdc++.h>
using namespace std ;
const string s[] = {"You are wan mei!","You are tai shou le!","You are tai pang le!" } ;

int fun( int h , int w )
{
    double standard_w = (h - 100 ) * 0.9 * 2 ;
    if( fabs( standard_w - w ) < standard_w * 0.1 )
        return 0 ;
    else if( standard_w > w )
        return 1;
    else
        return 2 ;
}

int main()
{
    int n ;
    cin >> n ;
    for( int i = 1 ; i <= n ; i++)
    {
        int a , b ;
        cin >> a >> b ;
        cout << s[fun(a,b)] << endl ;
    }
    return 0 ; 
}

 

#include<bits/stdc++.h>
using namespace std ;
string s ;
string a ;

void _printf( int n , string m )
{
    if( n > s.length() - 1 )
    {
        for( int i = 0 ; i < ( n - s.length() ) ; i++)
            cout << m ;
        cout << s << endl ;
    }
    else 
    {
        for( int i = s.length() - n ; i < s.length() ; i++)
        {
            cout << s[i] ;
        }
        cout << endl ;
    }

    return ; 
}

int main()
{
    int n;
    cin >> n >> a ;
    getchar();
    getline(cin,s);
    _printf(n,a);
    return 0 ; 
}