2022/3/03程式培力刷題記錄

刷題證明

 

A

CodeForces 1175A

From Hero to Zero

 

#include<iostream>
#include<algorithm>
using namespace std;
int main(void)
{
    int t;
    cin >> t;
    while (t--)
    {
        long long counter = 0;
        long long dividend;
        long long divisor;
        cin >> dividend >> divisor;
        while (dividend > 0)
        {
            while (dividend % divisor== 0)
            {
                dividend = dividend / divisor;
                counter++;
            }
            counter += dividend % divisor;
            dividend -= dividend % divisor;

        }
        cout << counter << endl;


    }
    return 0;
}

B

CodeForces 572A

Arrays

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n1,n2,k,m;
    cin>>n1>>n2>>k>>m;
    int a[100005];
    int b[100005];
    for(int i=0;i<n1;i++)
    {
        cin>>a[i];
    }
    for(int i=0;i<n2;i++)
    {
        cin>>b[i];
    }
    sort(a,a+n1);
    sort(b,b+n2);
    if(a[k-1]<b[n2-m])
    {
        printf("YES");
    }
    else
    {
        printf("NO");
    }
}