Perfect Cubes(zoj_1331-————the beginner problem)

            http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=331


解答如下(注意裁剪即可):

#include <iostream>
#include <fstream>

using namespace std;

const int MAX = 200; //the max number the problem claim
int cube[MAX];

int main(int argc, char *argv[])
{
    //ifstream cin("input.txt");

    //calculate the cube in advance
    for (int i = 1; i <= MAX; ++i)
    {
        cube[i] = i*i*i;
    }

    //start at 6, before it there is no match
    for (int a = 3; a <= 200; ++a)
    {

        for (int b = 2; b < a; ++b)
        {
            if (cube[b] + cube[b+1] + cube[b+2] > cube[a])
                break;
            for(int c = b + 1; c < a; ++c)
            {
                if(cube[b] + cube[c] + cube[c+1] > cube[a])
                    break;
                for (int d = c + 1; d < a; ++d)
                {
                    if(cube[d] + cube[c] + cube[b] == cube[a])
                        cout<<"Cube = "<<a<<", "<<"Triple = ("<<b<<","
                            <<c<<","<<d<<")"<<endl; 
                    if (cube[d] + cube[c] + cube[b] > cube[a])
                        break;
                }
            }
        }
    }
    
    return 0;
}




评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值