CF-Contest339-614

614A-Link/Cut Tree

比较水，注意64位int仍然可能溢出。

#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

typedef unsigned long long int LL;

LL l,r;
int k;

int main()
{
    scanf("%I64d %I64d %d",&l,&r,&k);
    int cnt = ;
    LL pow = ;
    int i = ;
    while(true)
    {
        if(pow <=r && pow >=l)
        {
            printf("%s%I64d",cnt?" ":"",pow);
            cnt++;
        }
        i++;
        if(pow > r) break;
        if(r/k < pow) break;
        pow *= k;
    }
    if(cnt == ) printf("-1\n");
}

614B-Gena's Code

很水，统计0的个数就好了

区分beautiful和非beautiful数。

#include <cstdio>
#include <cstring>

using namespace std;

int N,n0;
char unbtf[];

int main()
{
    scanf("%d",&N);
    int flag_unb = ;
    int flag_0 = ;
    getchar();

    for(int i=;i<N;i++)
    {
        char c;
        int cnt = ,flag = ,tmp0 = ;
        while((c=getchar()) && c>='' && c<='')
        {
            if(!flag_unb) unbtf[cnt] = c;
            if((c!=''&&cnt!=) || (c!=''&&c!=''&&cnt==))
            {
                flag = ;
            }
            if(c == '') tmp0++;
            cnt++;
        }
        if(!flag_unb) unbtf[cnt] = '\0';
        if(cnt ==  && tmp0 == ) flag_0 = ;
        if(flag&&cnt>) n0 += tmp0;
        else if(!flag)flag_unb = ;
    }

    if(flag_0)
    {
        printf("0\n");
        return ;
    }

    if(flag_unb) printf("%s",unbtf);
    else printf("");
    for(int i=;i<n0;i++)
        printf("");
    printf("\n");
}