URAL 1073 Square Country

最新推荐文章于 2018-05-14 10:26:10 发布

原创最新推荐文章于 2018-05-14 10:26:10 发布 · 331 阅读

CC 4.0 BY-SA版权

本文探讨了在一个完全方形国家中，如何通过平方单位的土地投资来计算获得的土地证书数量，涉及基本的数学原理和算法应用。

There live square people in a square country. Everything in this country is square also. Thus, the Square Parliament has passed a law about a land. According to the law each citizen of the country has a right to buy land. A land is sold in squares, surely. Moreover, a length of a square side must be a positive integer amount of meters. Buying a square of land with a side a one pays a² quadrics (a local currency) and gets a square certificate of a landowner.

One citizen of the country has decided to invest all of his N quadrics into the land. He can, surely, do it, buying square pieces 1 × 1 meters. At the same time the citizen has requested to minimize an amount of pieces he buys: "It will be easier for me to pay taxes," — he has said. He has bought the land successfully.

Your task is to find out a number of certificates he has gotten.

Input

The only line contains a positive integer N ≤ 60 000 , that is a number of quadrics that the citizen has invested.

Output

The only line contains a number of certificates that he has gotten.

这个题目木有甚么难度，简单的dp 就好了对于当前的体积状态，最小的土地数就是买下就j*j的一块前的土地数目加1

dp [i] = min(dp[i] , dp[i-j*j] +1);

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
#define N 60010
int dp[N];
int n;
int main()
{
    for(int i = 0; i <= 60000; i++)
        dp[i] = i;
    for(int i = 1; i <= 60000; i++)
    {
        for(int j = 1; j <= 60000; j++)
        {
            if(i - j*j >=0)
            {
                dp[i] = min(dp[i] , dp[i-j*j]+1);
            }
            else
                break;
        }
    }
    while(scanf("%d",&n)!=EOF)
    {
        printf("%d\n",dp[n]);
    }
    return 0;
}