1073. Square Country
Time limit: 1.0 secondMemory limit: 64 MB
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 a2 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.Sample
| input | output |
|---|---|
344 |
3 |
Problem Source: Ural State Univerisity Personal Contest Online February'2001 Students Session
给你一个数n，让你求这个数最少由多少个数的平方构成。 转为完全背包问题就是：n代表背包的容量，每个数的平方代表要占用的容量，价值为1，求最小价值。
//0.031 434 KB #include#include #include #define inf 0x3f3f3f3f using namespace std; int dp[60007]; int main() { memset(dp,inf,sizeof(dp)); dp[0]=0; for(int i=1; i<=250; i++) for(int j=i*i; j<=60000; j++) dp[j]=min(dp[j],dp[j-i*i]+1); int n; while(scanf(%d,&n)!=EOF) { printf(%d ,dp[n]); } return 0; }