Lightoj 1030 Discovering Gold

Roll the dice, 1~6, ask how much the last hope.

P[now]= (P[now+1]+...+p[now+6])/6;

The end of the special award

#include<iostream>#include<functional>#include<algorithm>#include<complex>#include<cstdlib>#include<cstring>#include<fstream>#include<iomanip>#include<sstream>#include<utility>#include<bitset>#include<cctype>#include<cstdio>#include<limits>#include<memory>#include<string>#include<vector>#include<cmath>#include<ctime>#include<queue>#include<stack>#include<list>#include<map>#include<set>UsingNamespace Std;IntMain(){LongLong T, NCAs=1;scanf("%d", &t);While(T--){int n;Double A[110];scanf("%d", &n);For(int I=n; I>=1; I--){scanf("%lf", &a[I]);}For(int I=2; I<=n; I++){Double EPX=0;For(Int J=Max(1, I-6); j<i; j++){EPX+=a[j]/(min (6< Span class= "Sh-symbol" >,i-1}//cout<<epx<<endl; a[i< Span class= "Sh-symbol" >]+=epx;  printf  (\n ",ncas++,a[n return 0;< Span class= "Sh-cbracket" >             

Lightoj 1030 Discovering Gold