2021年度训练联盟热身训练赛第五场 补题

A Binary Seating

#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+5;
int main()
{
    int n;
    double sum=0,ans=1,a[maxn];
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%lf",&a[i]);
    sort(a+1,a+n+1);
    for(int i=n;i>0;i--)
    {
        ans*=.5;
        sum+=ans*a[i];
    }
    long long k=sum*1000000000;
    if(k%1000000000 == 0)
        printf("%d",(int)sum);
    else
        printf("%f",sum);
    return 0;
}

C Ducky Debugging

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int len;
    char str[15000];
    char end[]={"I quacked the code!"};
    while(1)
    {
        cin.get(str,15000);
        cin.get();
        if(strcmp(end,str)==0)
            break;
        len=strlen(str);
        if(str[len-1] == '.')
        {
            printf("*Nod*\n");
            continue;
        }
        if(str[len-1] == '?')
        {
            printf("Quack!\n");
            continue;
        }
        memset(str,0,sizeof(str));
    }
    return 0;
}

I Jam-packed

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn=2e5+5;
int main()
{
    LL n,k,cnt,ans;
    scanf("%lld%lld",&n,&k);
    if(n%k == 0)
        cnt=n/k;
    else
        cnt=n/k+1;
    ans=n/cnt;
    printf("%lld",ans);
    return 0;
}