#include<stdio.h>#include<cstdlib>#define N 100 float p[N][N],s[N][N],a[N],b[N];int o;void set_TPM()  //輸入轉(zhuǎn)移概率矩陣(Transition Probability Matrix) {  int i,j; printf("Please input Number of State:"); scanf("%d",&o); for(i=0;i<o;i++) for(j=0;j<o;j++) {  printf("Please input state%d,state%d:",i,j);  scanf("%f",&p[i][j]);  rewind(stdin); }}void set_Initial_Prob() //輸入初始概率狀態(tài)（Initial Probability）{ int i; for(i=0;i<o;i++) { printf("Please input state%d Initial Prob:",i); scanf("%f",&a[i]); rewind(stdin); }}void run_Markov(int count) //Markov主算法{ int i,j,k; float c[N]; for(i=0;i<o;i++) c[i]=a[i]; for(k=0;k<count;k++) { for(i=0;i<o;i++)  for(j=0;j<o;j++)  {  s[i][j]=p[i][j]*c[i];   } for(i=0;i<o;i++) {   b[i]=0;  for(j=0;j<o;j++)  {  b[i]=b[i]+s[j][i];    }  c[i]=b[i];  } } for(i=0;i<o;i++) c[i]=0;}void print_Result() //輸出周期結(jié)果{ int i,j; for(i=0;i<o;i++) for(j=0;j<o;j++) {  printf(" %f",s[i][j]);  if(j==2) printf("/n"); } for(i=0;i<o;i++) {  printf(" %f",b[i]); } printf("/n");}main() //主函數(shù){ int a,count,i,j; for(count=0;;) { printf("Create New Project:/n"); set_TPM(); set_Initial_Prob(); for(;;) {  printf("***********************************/n"); //展示選擇菜單  printf("1.Times periods from initial./n");  printf("2.Next Period./n");  printf("3.Create New Porject./n");  printf("4.Exit./n/n");  printf("**********************************/n");  printf("Please input your choose:/n");  scanf("%d",&a);  rewind(stdin);  if(a==3) break;  switch(a)  {  case 1:   printf("Input number of time periods from initial:/n");  scanf("%d",&count);  rewind(stdin);  run_Markov(count);  print_Result();  break;  case 2:   run_Markov(count++);  print_Result();  break;  case 4: exit(1);  default: printf("Error choose!!/n");break;  } } } system("pause");}