|
发表于 2017-11-18 22:29:38
|
显示全部楼层
只需将i++,j++,k++都改为i=Color(i+1),j=Color(j+1),k=Color(k+1)就行
口袋中有红、黄、蓝、白、黑5种颜色球若干个。每次从口袋先后取出3个球,问得到3种颜色不同的球的可能 ,输出每种排列的情况。
#include<stdio.h>
enum Color {red,yellow,blue,white,black};
int main()
{
enum Color i,j,k,pri;
int n,loop;
n=0;
for(i=red;i<=black;i=Color(i+1))//不能用i++,会报错
for(j=red;j<=black;j=Color(j+1))
if(i!=j)
{
for(k=red;k<=black;k=Color(k+1))
if((k!=i)&&(k!=j)){
n=n+1;
printf("%-4d",n);
for(loop=1;loop<=3;loop++)
{
switch(loop)
{
case 1:pri=i;break;
case 2:pri=j;break;
case 3:pri=k;break;
default :break;
}
switch(pri)
{
case red:printf("%-10s","red");break;
case yellow:printf("%-10s","yellow");break;
case blue:printf("%-10s","blue");break;
case white:printf("%-10s","white");break;
case black:printf("%-10s","black");break;
default :break;
}
}
printf("\n");
}
}
printf("\ntotal:%5d\n",n);
return 0;
}
|
|