38.換分幣
用一元人民幣兌換成1分、2分和5分硬幣,共有多少種不同的兌換方法。
*題目分析與算法設(shè)計(jì)
根據(jù)題意設(shè)i,j,k分別為兌換的1分、2分、5分硬幣所具有的錢數(shù)(分),則i,j,k的值應(yīng)滿足:
i+j+k=100
*程序說(shuō)明與注釋
#include
void main()
{
int i,j,k,count=1;
printf("There are follwing small exchange plans for 1 Yuan note:\n");
for(i=0;i<=100;i++) /*i為1分硬幣錢數(shù),可取值0,1,2...,100*/
for(j=0;j<=100-i;j+=2) /*j為2分硬幣錢數(shù),可取0值,2,4,...,100*/
for(k=0;k<=100-i-2*j;k+=5) /*k為5分硬幣錢數(shù)*/
if(i+j+k==100)
printf(count%4?"%d:1*%d+2*%d+5*%d\t":"%d:1*%d+2*%d+5*%d\n",count++,i,j/2,k/5);
}
*運(yùn)行結(jié)果
There are follwing small exchange plans for 1 Yuan note:
用一元人民幣兌換成1分、2分和5分硬幣,共有多少種不同的兌換方法。
*題目分析與算法設(shè)計(jì)
根據(jù)題意設(shè)i,j,k分別為兌換的1分、2分、5分硬幣所具有的錢數(shù)(分),則i,j,k的值應(yīng)滿足:
i+j+k=100
*程序說(shuō)明與注釋
#include
void main()
{
int i,j,k,count=1;
printf("There are follwing small exchange plans for 1 Yuan note:\n");
for(i=0;i<=100;i++) /*i為1分硬幣錢數(shù),可取值0,1,2...,100*/
for(j=0;j<=100-i;j+=2) /*j為2分硬幣錢數(shù),可取0值,2,4,...,100*/
for(k=0;k<=100-i-2*j;k+=5) /*k為5分硬幣錢數(shù)*/
if(i+j+k==100)
printf(count%4?"%d:1*%d+2*%d+5*%d\t":"%d:1*%d+2*%d+5*%d\n",count++,i,j/2,k/5);
}
*運(yùn)行結(jié)果
There are follwing small exchange plans for 1 Yuan note: