练习14

practise

A chinanb

#include<stdio.h>
#include<algorithm>
#define ll long long
using namespace std;
int a[15];
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++)  scanf("%d",&a[i]);
    sort(a,a+n);
    int sum=0;
    for(int j=0;j<n-1;j++)  sum+=a[j];
    if(sum>a[n-1])   printf("Yes\n");
    else if(sum<=a[n-1])   printf("No\n");    
    return 0;
}

B Kevin7Zz

#include <cstdio>
#define rep(i,be,en) for (int i=be;i<=en;i++)
#define per(i,be,en) for (int i=en;i>=be;i--)
using namespace std;
const int N=1e4+3;
int T,n,m,k=0,fl=0;
int a[N];
int main(){
    rep(i,32,99){
        a[i*i]=1;
    }
    scanf("%d",&T);
    rep(_,1,T){
        scanf("%d",&n);
        int ans=0;
        m=n/1000;
        rep(i,1,9){
            if(i!=m){
                if(a[n-m*1000+i*1000]) ans++;
            }
        }
        m=n%1000/100;
        rep(i,0,9){
            if(i!=m){
                if(a[n-m*100+i*100]) ans++;
            }
        }
        m=n%100/10;
        rep(i,0,9){
            if(i!=m){
                if(a[n-m*10+i*10]) ans++;
            }
        }
        m=n%10;
        rep(i,0,9){
            if(i!=m){
                if(a[n-m+i]) ans++;
            }
        }
        printf("Case %d: %d\n",_,ans);
    }
    return 0 ;
}

C 201941010304

#include <iostream>
using namespace std;
long long n, k, sum = 1;
int main()
{
    cin >> n >> k;
    if (k >= n)
    {
        cout << "0";
        return 0;
    }
    long long t = 1;
    while (sum <= n)
        sum <<= 1; 
    long long a = sum >> 1;
    while (t < k)
    {
        while (a > n)
            a >>= 1; 
        n -= a;
        t++;
    }
    sum = 1;
    while (sum <= n)
        sum <<= 1; 
    cout << sum - n;
    return 0;
}