码迷,mamicode.com
首页 > 其他好文 > 详细

UVALive Great Deceiver

时间:2015-10-24 20:07:47      阅读:153      评论:0      收藏:0      [点我收藏+]

标签:

题目链接:

戳我

题目大意:

 

样例解释:

 

解题思路:

 

代码:

#include <stdio.h>
#include <math.h>
#define LL long long 

LL a[100005];
int main()
{
    LL n, k;
    int i, j;
    while(~scanf("%lld %lld", &n, &k))
    {
        int Len = 0;
        while(n) a[Len++] = n % k, n /= k;
        if(Len % 2 == 0)
        {
            LL ans = pow(k, Len/2);
            printf("%lld\n", ans);
            continue;
        }
        i = Len - 2;
        for(int flag = 1; i >= 1 && flag; i -= 2)
        {
            if(a[i])
            {
                for(j = i-1; j >= 0; j -=2)
                {
                    a[j] = k-1; 
                    flag = 0;
                }
            }
        }
        LL ans = 0, mul = 1;
        for(i = 0; i < Len; i += 2)
        {
            ans += mul * a[i];
            mul *= k;
        } 
        printf("%lld\n", ans+1);
    }
    return 0;
}

  

UVALive Great Deceiver

标签:

原文地址:http://www.cnblogs.com/tenlee/p/4907450.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!