Advertisement
Rajon_68

Untitled

Dec 12th, 2019
582
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.05 KB | None | 0 0
  1. #include <iostream>
  2. #include <stdio.h>
  3. #include <string.h>
  4. using namespace std;
  5.  
  6. int main()
  7. {
  8.  
  9. double pro[110];
  10. int val[110];
  11. int t;
  12. int n;
  13. int j;
  14. int cnt;
  15. double exp;
  16.  
  17. scanf("%d", &t);
  18.  
  19. for (int cs = 1; cs <= t; cs++)
  20. {
  21. scanf("%d", &n);
  22. memset(pro, 0, sizeof(pro));
  23. pro[1] = 1;
  24.  
  25.  
  26. for (int i = 1; i <= n; i++)
  27. {
  28. scanf("%d", val + i);
  29. pro[i]=1;
  30. }
  31.  
  32. exp = val[1];
  33.  
  34. for (int i = 2; i <= n; i++)
  35. {
  36.  
  37. int k=i+5;
  38. k=min(k,n);
  39. cnt=k-i+1;
  40. for(int j=1; j<=6&&i-1+j<=k; j++)
  41. {
  42. int x=i-1+j;
  43. cnt=max(1,cnt);
  44. pro[x]=pro[x]*( double(1) / double(cnt));
  45. // cout<<cnt<<" "<<x<<" "<<pro[x]<<endl;
  46. exp = exp + pro[x] * val[x];
  47. cnt--;
  48.  
  49. }
  50. if(k==n) break;
  51. }
  52. printf("Case %d: %lf\n", cs, exp);
  53.  
  54. }
  55.  
  56. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement