今天的主人公是什么?

60.1K!!!!

先扔代码再更新防止我等会儿一上头不打算写完题解

T1:

  1. #include<iostream>
  2. #include<cstdio>
  3. #include<algorithm>
  4. using namespace std;
  5. const double inf=;
  6. int n,k;
  7. double a[],f[][];
  8. int main()
  9. {
  10. scanf("%d%d",&n,&k);
  11. for(int i=;i<=n;i++)scanf("%lf",&a[i]);
  12. sort(a+,a+n+);
  13. n=unique(a+,a+n+)-a-;
  14. for(int i=;i<=n;i++){
  15. for(int j=;j<=k;j++)f[j][i]=inf;
  16. }
  17. f[][]=;
  18. for(int i=;i<=n;i++){
  19. for(int j=;j<=k;j++){
  20. for(int l=;l<=i;l++){
  21. f[j][i]=min(f[j][i],f[j-][l-]+(a[i]-a[l])*(a[i]-a[l]));
  22. }
  23. }
  24. }
  25. if(k>=n)printf("0.00\n");
  26. else printf("%.2lf\n",f[k][n]);
  27. return ;
  28. }

T2:

  1. #include<iostream>
  2. #include<cstdio>
  3. #include<cmath>
  4. #include<cstring>
  5. using namespace std;
  6. int val[][],a[],n,opt,num,goal,sum;
  7. double p[][][][],dice[][],ans[][],b[][][][];
  8. char s[][];
  9. int main()
  10. {
  11. // freopen("1.out","w",stdout);
  12. for(int i=;i<=;i++){
  13. for(int j=;j<=;j++)scanf("%1d",&val[i][j]);
  14. scanf("%d",&a[i]);
  15. }
  16. p[a[]][a[]][a[]][a[]]=;
  17. dice[][]=;
  18. scanf("%d",&n);
  19. for(int i=;i<=;i++){
  20. for(int j=;j<=(i<<);j++){
  21. dice[i][j]=(dice[i-][j]/3.00);
  22. if(j)dice[i][j]+=(dice[i-][j-]/3.00);
  23. if(j>=)dice[i][j]+=(dice[i-][j-]/3.00);
  24. }
  25. }
  26. for(int i=;i<=n;i++){
  27. memset(s[],,sizeof(s[]));
  28. memset(s[],,sizeof(s[]));
  29. memset(s[],,sizeof(s[]));
  30. memset(s[],,sizeof(s[]));
  31. scanf("%s%s",s[],s[]);
  32. if(s[][]=='<'||s[][]=='>'){
  33. int x;
  34. scanf("%d",&x);
  35. scanf("%s%s",s[],s[]);
  36. if(s[][]=='<'){
  37. if(s[][]=='='){
  38. if(s[][]=='i')opt=;
  39. else if(s[][]=='p')opt=;
  40. else if(s[][]=='a')opt=;
  41. else opt=;
  42. if(s[][]=='i')goal=;
  43. else if(s[][]=='p')goal=;
  44. else if(s[][]=='a')goal=;
  45. else goal=;
  46. if(s[][]=='+')num=s[][]-'';
  47. else num=-(s[][]-'');
  48. if(s[][]=='?'){//<=?
  49. for(int a1=;a1<=;a1++){
  50. for(int b1=;b1<=;b1++){
  51. for(int c1=;c1<=;c1++){
  52. for(int d1=;d1<=;d1++){
  53. for(int l=;l<=((abs(num))<<);l++){
  54. if(opt==){
  55. for(int k=;k<=(val[][a1]<<);k++){
  56. if(k<=x){
  57. if(goal==){
  58. if(a1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  59. else if(a1+(num<?-:)*l>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  60. else b[a1+(num<?-:)*l][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  61. }
  62. else if(goal==){
  63. if(b1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  64. else if(b1+(num<?-:)*l>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  65. else b[a1][b1+(num<?-:)*l][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  66. }
  67. else if(goal==){
  68. if(c1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  69. else if(c1+(num<?-:)*l>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  70. else b[a1][b1][c1+(num<?-:)*l][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  71. }
  72. else{
  73. if(d1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  74. else if(d1+(num<?-:)*l>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  75. else b[a1][b1][c1][d1+(num<?-:)*l]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  76. }
  77. }
  78. else{
  79. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k]*dice[abs(num)][l];
  80. }
  81. }
  82. }
  83. else if(opt==){
  84. for(int k=;k<=(val[][b1]<<);k++){
  85. if(k<=x){
  86. if(goal==){
  87. if(a1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  88. else if(a1+(num<?-:)*l>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  89. else b[a1+(num<?-:)*l][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  90. }
  91. else if(goal==){
  92. if(b1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  93. else if(b1+(num<?-:)*l>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  94. else b[a1][b1+(num<?-:)*l][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  95. }
  96. else if(goal==){
  97. if(c1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  98. else if(c1+(num<?-:)*l>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  99. else b[a1][b1][c1+(num<?-:)*l][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  100. }
  101. else{
  102. if(d1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  103. else if(d1+(num<?-:)*l>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  104. else b[a1][b1][c1][d1+(num<?-:)*l]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  105. }
  106. }
  107. else{
  108. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k]*dice[abs(num)][l];
  109. }
  110. }
  111. }
  112. else if(opt==){
  113. for(int k=;k<=(val[][c1]<<);k++){
  114. if(k<=x){
  115. if(goal==){
  116. if(a1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  117. else if(a1+(num<?-:)*l>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  118. else b[a1+(num<?-:)*l][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  119. }
  120. else if(goal==){
  121. if(b1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  122. else if(b1+(num<?-:)*l>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  123. else b[a1][b1+(num<?-:)*l][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  124. }
  125. else if(goal==){
  126. if(c1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  127. else if(c1+(num<?-:)*l>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  128. else b[a1][b1][c1+(num<?-:)*l][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  129. }
  130. else{
  131. if(d1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  132. else if(d1+(num<?-:)*l>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  133. else b[a1][b1][c1][d1+(num<?-:)*l]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  134. }
  135. }
  136. else{
  137. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k]*dice[abs(num)][l];
  138. }
  139. }
  140. }
  141. else{
  142. for(int k=;k<=(val[][d1]<<);k++){
  143. if(k<=x){
  144. if(goal==){
  145. if(a1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  146. else if(a1+(num<?-:)*l>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  147. else b[a1+(num<?-:)*l][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  148. }
  149. else if(goal==){
  150. if(b1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  151. else if(b1+(num<?-:)*l>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  152. else b[a1][b1+(num<?-:)*l][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  153. }
  154. else if(goal==){
  155. if(c1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  156. else if(c1+(num<?-:)*l>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  157. else b[a1][b1][c1+(num<?-:)*l][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  158. }
  159. else{
  160. if(d1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  161. else if(d1+(num<?-:)*l>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  162. else b[a1][b1][c1][d1+(num<?-:)*l]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  163. }
  164. }
  165. else{
  166. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k]*dice[abs(num)][l];
  167. }
  168. }
  169. }
  170. }
  171. }
  172. }
  173. }
  174. }
  175. }
  176. else{//<=x
  177. for(int a1=;a1<=;a1++){
  178. for(int b1=;b1<=;b1++){
  179. for(int c1=;c1<=;c1++){
  180. for(int d1=;d1<=;d1++){
  181. if(opt==){
  182. for(int k=;k<=(val[][a1]<<);k++){
  183. if(k<=x){
  184. if(goal==){
  185. if(a1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  186. else if(a1+num>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  187. else b[a1+num][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  188. }
  189. else if(goal==){
  190. if(b1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  191. else if(b1+num>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  192. else b[a1][b1+num][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  193. }
  194. else if(goal==){
  195. if(c1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  196. else if(c1+num>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  197. else b[a1][b1][c1+num][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  198. }
  199. else{
  200. if(d1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  201. else if(d1+num>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  202. else b[a1][b1][c1][d1+num]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  203. }
  204. }
  205. else{
  206. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  207. }
  208. }
  209. }
  210. else if(opt==){
  211. for(int k=;k<=(val[][b1]<<);k++){
  212. if(k<=x){
  213. if(goal==){
  214. if(a1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  215. else if(a1+num>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  216. else b[a1+num][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  217. }
  218. else if(goal==){
  219. if(b1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  220. else if(b1+num>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  221. else b[a1][b1+num][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  222. }
  223. else if(goal==){
  224. if(c1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  225. else if(c1+num>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  226. else b[a1][b1][c1+num][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  227. }
  228. else{
  229. if(d1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  230. else if(d1+num>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  231. else b[a1][b1][c1][d1+num]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  232. }
  233. }
  234. else{
  235. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  236. }
  237. }
  238. }
  239. else if(opt==){
  240. for(int k=;k<=(val[][c1]<<);k++){
  241. if(k<=x){
  242. if(goal==){
  243. if(a1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  244. else if(a1+num>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  245. else b[a1+num][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  246. }
  247. else if(goal==){
  248. if(b1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  249. else if(b1+num>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  250. else b[a1][b1+num][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  251. }
  252. else if(goal==){
  253. if(c1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  254. else if(c1+num>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  255. else b[a1][b1][c1+num][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  256. }
  257. else{
  258. if(d1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  259. else if(d1+num>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  260. else b[a1][b1][c1][d1+num]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  261. }
  262. }
  263. else{
  264. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  265. }
  266. }
  267. }
  268. else{
  269. for(int k=;k<=(val[][d1]<<);k++){
  270. if(k<=x){
  271. if(goal==){
  272. if(a1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  273. else if(a1+num>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  274. else b[a1+num][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  275. }
  276. else if(goal==){
  277. if(b1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  278. else if(b1+num>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  279. else b[a1][b1+num][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  280. }
  281. else if(goal==){
  282. if(c1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  283. else if(c1+num>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  284. else b[a1][b1][c1+num][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  285. }
  286. else{
  287. if(d1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  288. else if(d1+num>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  289. else b[a1][b1][c1][d1+num]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  290. }
  291. }
  292. else{
  293. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  294. }
  295. }
  296. }
  297. }
  298. }
  299. }
  300. }
  301. }
  302. }
  303. else{
  304. if(s[][]=='i')opt=;
  305. else if(s[][]=='p')opt=;
  306. else if(s[][]=='a')opt=;
  307. else opt=;
  308. if(s[][]=='i')goal=;
  309. else if(s[][]=='p')goal=;
  310. else if(s[][]=='a')goal=;
  311. else goal=;
  312. if(s[][]=='+')num=s[][]-'';
  313. else num=-(s[][]-'');
  314. if(s[][]=='?'){//<?
  315. for(int a1=;a1<=;a1++){
  316. for(int b1=;b1<=;b1++){
  317. for(int c1=;c1<=;c1++){
  318. for(int d1=;d1<=;d1++){
  319. for(int l=;l<=((abs(num))<<);l++){
  320. if(opt==){
  321. for(int k=;k<=(val[][a1]<<);k++){
  322. if(k<x){
  323. if(goal==){
  324. if(a1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  325. else if(a1+(num<?-:)*l>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  326. else b[a1+(num<?-:)*l][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  327. }
  328. else if(goal==){
  329. if(b1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  330. else if(b1+(num<?-:)*l>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  331. else b[a1][b1+(num<?-:)*l][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  332. }
  333. else if(goal==){
  334. if(c1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  335. else if(c1+(num<?-:)*l>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  336. else b[a1][b1][c1+(num<?-:)*l][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  337. }
  338. else{
  339. if(d1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  340. else if(d1+(num<?-:)*l>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  341. else b[a1][b1][c1][d1+(num<?-:)*l]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  342. }
  343. }
  344. else{
  345. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k]*dice[abs(num)][l];
  346. }
  347. }
  348. }
  349. else if(opt==){
  350. for(int k=;k<=(val[][b1]<<);k++){
  351. if(k<x){
  352. if(goal==){
  353. if(a1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  354. else if(a1+(num<?-:)*l>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  355. else b[a1+(num<?-:)*l][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  356. }
  357. else if(goal==){
  358. if(b1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  359. else if(b1+(num<?-:)*l>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  360. else b[a1][b1+(num<?-:)*l][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  361. }
  362. else if(goal==){
  363. if(c1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  364. else if(c1+(num<?-:)*l>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  365. else b[a1][b1][c1+(num<?-:)*l][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  366. }
  367. else{
  368. if(d1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  369. else if(d1+(num<?-:)*l>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  370. else b[a1][b1][c1][d1+(num<?-:)*l]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  371. }
  372. }
  373. else{
  374. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k]*dice[abs(num)][l];
  375. }
  376. }
  377. }
  378. else if(opt==){
  379. for(int k=;k<=(val[][c1]<<);k++){
  380. if(k<x){
  381. if(goal==){
  382. if(a1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  383. else if(a1+(num<?-:)*l>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  384. else b[a1+(num<?-:)*l][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  385. }
  386. else if(goal==){
  387. if(b1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  388. else if(b1+(num<?-:)*l>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  389. else b[a1][b1+(num<?-:)*l][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  390. }
  391. else if(goal==){
  392. if(c1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  393. else if(c1+(num<?-:)*l>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  394. else b[a1][b1][c1+(num<?-:)*l][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  395. }
  396. else{
  397. if(d1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  398. else if(d1+(num<?-:)*l>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  399. else b[a1][b1][c1][d1+(num<?-:)*l]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  400. }
  401. }
  402. else{
  403. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k]*dice[abs(num)][l];
  404. }
  405. }
  406. }
  407. else{
  408. for(int k=;k<=(val[][d1]<<);k++){
  409. if(k<x){
  410. if(goal==){
  411. if(a1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  412. else if(a1+(num<?-:)*l>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  413. else b[a1+(num<?-:)*l][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  414. }
  415. else if(goal==){
  416. if(b1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  417. else if(b1+(num<?-:)*l>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  418. else b[a1][b1+(num<?-:)*l][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  419. }
  420. else if(goal==){
  421. if(c1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  422. else if(c1+(num<?-:)*l>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  423. else b[a1][b1][c1+(num<?-:)*l][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  424. }
  425. else{
  426. if(d1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  427. else if(d1+(num<?-:)*l>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  428. else b[a1][b1][c1][d1+(num<?-:)*l]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  429. }
  430. }
  431. else{
  432. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k]*dice[abs(num)][l];
  433. }
  434. }
  435. }
  436. }
  437.  
  438. }
  439. }
  440. }
  441. }
  442. }
  443. else{//<x
  444. for(int a1=;a1<=;a1++){
  445. for(int b1=;b1<=;b1++){
  446. for(int c1=;c1<=;c1++){
  447. for(int d1=;d1<=;d1++){
  448. if(opt==){
  449. for(int k=;k<=(val[][a1]<<);k++){
  450. if(k<x){
  451. if(goal==){
  452. if(a1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  453. else if(a1+num>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  454. else b[a1+num][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  455. }
  456. else if(goal==){
  457. if(b1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  458. else if(b1+num>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  459. else b[a1][b1+num][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  460. }
  461. else if(goal==){
  462. if(c1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  463. else if(c1+num>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  464. else b[a1][b1][c1+num][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  465. }
  466. else{
  467. if(d1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  468. else if(d1+num>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  469. else b[a1][b1][c1][d1+num]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  470. }
  471. }
  472. else{
  473. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  474. }
  475. }
  476. }
  477. else if(opt==){
  478. for(int k=;k<=(val[][b1]<<);k++){
  479. if(k<x){
  480. if(goal==){
  481. if(a1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  482. else if(a1+num>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  483. else b[a1+num][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  484. }
  485. else if(goal==){
  486. if(b1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  487. else if(b1+num>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  488. else b[a1][b1+num][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  489. }
  490. else if(goal==){
  491. if(c1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  492. else if(c1+num>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  493. else b[a1][b1][c1+num][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  494. }
  495. else{
  496. if(d1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  497. else if(d1+num>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  498. else b[a1][b1][c1][d1+num]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  499. }
  500. }
  501. else{
  502. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  503. }
  504. }
  505. }
  506. else if(opt==){
  507. for(int k=;k<=(val[][c1]<<);k++){
  508. if(k<x){
  509. if(goal==){
  510. if(a1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  511. else if(a1+num>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  512. else b[a1+num][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  513. }
  514. else if(goal==){
  515. if(b1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  516. else if(b1+num>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  517. else b[a1][b1+num][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  518. }
  519. else if(goal==){
  520. if(c1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  521. else if(c1+num>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  522. else b[a1][b1][c1+num][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  523. }
  524. else{
  525. if(d1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  526. else if(d1+num>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  527. else b[a1][b1][c1][d1+num]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  528. }
  529. }
  530. else{
  531. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  532. }
  533. }
  534. }
  535. else{
  536. for(int k=;k<=(val[][d1]<<);k++){
  537. if(k<x){
  538. if(goal==){
  539. if(a1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  540. else if(a1+num>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  541. else b[a1+num][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  542. }
  543. else if(goal==){
  544. if(b1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  545. else if(b1+num>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  546. else b[a1][b1+num][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  547. }
  548. else if(goal==){
  549. if(c1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  550. else if(c1+num>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  551. else b[a1][b1][c1+num][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  552. }
  553. else{
  554. if(d1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  555. else if(d1+num>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  556. else b[a1][b1][c1][d1+num]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  557. }
  558. }
  559. else{
  560. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  561. }
  562. }
  563. }
  564. }
  565. }
  566. }
  567. }
  568. }
  569. }
  570. }
  571. else{
  572. if(s[][]=='='){
  573. if(s[][]=='i')opt=;
  574. else if(s[][]=='p')opt=;
  575. else if(s[][]=='a')opt=;
  576. else opt=;
  577. if(s[][]=='i')goal=;
  578. else if(s[][]=='p')goal=;
  579. else if(s[][]=='a')goal=;
  580. else goal=;
  581. if(s[][]=='+')num=s[][]-'';
  582. else num=-(s[][]-'');
  583. if(s[][]=='?'){//>=?
  584. for(int a1=;a1<=;a1++){
  585. for(int b1=;b1<=;b1++){
  586. for(int c1=;c1<=;c1++){
  587. for(int d1=;d1<=;d1++){
  588. for(int l=;l<=((abs(num))<<);l++){
  589. if(opt==){
  590. for(int k=;k<=(val[][a1]<<);k++){
  591. if(k>=x){
  592. if(goal==){
  593. if(a1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  594. else if(a1+(num<?-:)*l>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  595. else b[a1+(num<?-:)*l][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  596. }
  597. else if(goal==){
  598. if(b1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  599. else if(b1+(num<?-:)*l>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  600. else b[a1][b1+(num<?-:)*l][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  601. }
  602. else if(goal==){
  603. if(c1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  604. else if(c1+(num<?-:)*l>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  605. else b[a1][b1][c1+(num<?-:)*l][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  606. }
  607. else{
  608. if(d1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  609. else if(d1+(num<?-:)*l>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  610. else b[a1][b1][c1][d1+(num<?-:)*l]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  611. }
  612. }
  613. else{
  614. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k]*dice[abs(num)][l];
  615. }
  616. }
  617. }
  618. else if(opt==){
  619. for(int k=;k<=(val[][b1]<<);k++){
  620. if(k>=x){
  621. if(goal==){
  622. if(a1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  623. else if(a1+(num<?-:)*l>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  624. else b[a1+(num<?-:)*l][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  625. }
  626. else if(goal==){
  627. if(b1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  628. else if(b1+(num<?-:)*l>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  629. else b[a1][b1+(num<?-:)*l][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  630. }
  631. else if(goal==){
  632. if(c1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  633. else if(c1+(num<?-:)*l>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  634. else b[a1][b1][c1+(num<?-:)*l][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  635. }
  636. else{
  637. if(d1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  638. else if(d1+(num<?-:)*l>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  639. else b[a1][b1][c1][d1+(num<?-:)*l]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  640. }
  641. }
  642. else{
  643. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k]*dice[abs(num)][l];
  644. }
  645. }
  646. }
  647. else if(opt==){
  648. for(int k=;k<=(val[][c1]<<);k++){
  649. if(k>=x){
  650. if(goal==){
  651. if(a1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  652. else if(a1+(num<?-:)*l>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  653. else b[a1+(num<?-:)*l][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  654. }
  655. else if(goal==){
  656. if(b1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  657. else if(b1+(num<?-:)*l>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  658. else b[a1][b1+(num<?-:)*l][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  659. }
  660. else if(goal==){
  661. if(c1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  662. else if(c1+(num<?-:)*l>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  663. else b[a1][b1][c1+(num<?-:)*l][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  664. }
  665. else{
  666. if(d1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  667. else if(d1+(num<?-:)*l>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  668. else b[a1][b1][c1][d1+(num<?-:)*l]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  669. }
  670. }
  671. else{
  672. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k]*dice[abs(num)][l];
  673. }
  674. }
  675. }
  676. else{
  677. for(int k=;k<=(val[][d1]<<);k++){
  678. if(k>=x){
  679. if(goal==){
  680. if(a1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  681. else if(a1+(num<?-:)*l>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  682. else b[a1+(num<?-:)*l][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  683. }
  684. else if(goal==){
  685. if(b1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  686. else if(b1+(num<?-:)*l>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  687. else b[a1][b1+(num<?-:)*l][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  688. }
  689. else if(goal==){
  690. if(c1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  691. else if(c1+(num<?-:)*l>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  692. else b[a1][b1][c1+(num<?-:)*l][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  693. }
  694. else{
  695. if(d1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  696. else if(d1+(num<?-:)*l>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  697. else b[a1][b1][c1][d1+(num<?-:)*l]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  698. }
  699. }
  700. else{
  701. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k]*dice[abs(num)][l];
  702. }
  703. }
  704. }
  705. }
  706.  
  707. }
  708. }
  709. }
  710. }
  711. }
  712. else{//>=x
  713. for(int a1=;a1<=;a1++){
  714. for(int b1=;b1<=;b1++){
  715. for(int c1=;c1<=;c1++){
  716. for(int d1=;d1<=;d1++){
  717. if(opt==){
  718. for(int k=;k<=(val[][a1]<<);k++){
  719. if(k>=x){
  720. if(goal==){
  721. if(a1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  722. else if(a1+num>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  723. else b[a1+num][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  724. }
  725. else if(goal==){
  726. if(b1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  727. else if(b1+num>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  728. else b[a1][b1+num][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  729. }
  730. else if(goal==){
  731. if(c1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  732. else if(c1+num>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  733. else b[a1][b1][c1+num][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  734. }
  735. else{
  736. if(d1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  737. else if(d1+num>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  738. else b[a1][b1][c1][d1+num]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  739. }
  740. }
  741. else{
  742. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  743. }
  744. }
  745. }
  746. else if(opt==){
  747. for(int k=;k<=(val[][b1]<<);k++){
  748. if(k>=x){
  749. if(goal==){
  750. if(a1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  751. else if(a1+num>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  752. else b[a1+num][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  753. }
  754. else if(goal==){
  755. if(b1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  756. else if(b1+num>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  757. else b[a1][b1+num][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  758. }
  759. else if(goal==){
  760. if(c1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  761. else if(c1+num>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  762. else b[a1][b1][c1+num][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  763. }
  764. else{
  765. if(d1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  766. else if(d1+num>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  767. else b[a1][b1][c1][d1+num]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  768. }
  769. }
  770. else{
  771. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  772. }
  773. }
  774. }
  775. else if(opt==){
  776. for(int k=;k<=(val[][c1]<<);k++){
  777. if(k>=x){
  778. if(goal==){
  779. if(a1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  780. else if(a1+num>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  781. else b[a1+num][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  782. }
  783. else if(goal==){
  784. if(b1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  785. else if(b1+num>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  786. else b[a1][b1+num][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  787. }
  788. else if(goal==){
  789. if(c1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  790. else if(c1+num>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  791. else b[a1][b1][c1+num][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  792. }
  793. else{
  794. if(d1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  795. else if(d1+num>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  796. else b[a1][b1][c1][d1+num]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  797. }
  798. }
  799. else{
  800. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  801. }
  802. }
  803. }
  804. else{
  805. for(int k=;k<=(val[][d1]<<);k++){
  806. if(k>=x){
  807. if(goal==){
  808. if(a1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  809. else if(a1+num>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  810. else b[a1+num][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  811. }
  812. else if(goal==){
  813. if(b1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  814. else if(b1+num>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  815. else b[a1][b1+num][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  816. }
  817. else if(goal==){
  818. if(c1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  819. else if(c1+num>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  820. else b[a1][b1][c1+num][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  821. }
  822. else{
  823. if(d1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  824. else if(d1+num>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  825. else b[a1][b1][c1][d1+num]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  826. }
  827. }
  828. else{
  829. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  830. }
  831. }
  832. }
  833. }
  834. }
  835. }
  836. }
  837. }
  838. }
  839. else{
  840. if(s[][]=='i')opt=;
  841. else if(s[][]=='p')opt=;
  842. else if(s[][]=='a')opt=;
  843. else opt=;
  844. if(s[][]=='i')goal=;
  845. else if(s[][]=='p')goal=;
  846. else if(s[][]=='a')goal=;
  847. else goal=;
  848. if(s[][]=='+')num=s[][]-'';
  849. else num=-(s[][]-'');
  850. if(s[][]=='?'){//>?
  851. for(int a1=;a1<=;a1++){
  852. for(int b1=;b1<=;b1++){
  853. for(int c1=;c1<=;c1++){
  854. for(int d1=;d1<=;d1++){
  855. for(int l=;l<=((abs(num))<<);l++){
  856. if(opt==){
  857. for(int k=;k<=(val[][a1]<<);k++){
  858. if(k>x){
  859. if(goal==){
  860. if(a1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  861. else if(a1+(num<?-:)*l>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  862. else b[a1+(num<?-:)*l][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  863. }
  864. else if(goal==){
  865. if(b1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  866. else if(b1+(num<?-:)*l>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  867. else b[a1][b1+(num<?-:)*l][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  868. }
  869. else if(goal==){
  870. if(c1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  871. else if(c1+(num<?-:)*l>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  872. else b[a1][b1][c1+(num<?-:)*l][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  873. }
  874. else{
  875. if(d1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  876. else if(d1+(num<?-:)*l>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  877. else b[a1][b1][c1][d1+(num<?-:)*l]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][a1]][k];
  878. }
  879. }
  880. else{
  881. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k]*dice[abs(num)][l];
  882. }
  883. }
  884. }
  885. else if(opt==){
  886. for(int k=;k<=(val[][b1]<<);k++){
  887. if(k>x){
  888. if(goal==){
  889. if(a1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  890. else if(a1+(num<?-:)*l>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  891. else b[a1+(num<?-:)*l][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  892. }
  893. else if(goal==){
  894. if(b1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  895. else if(b1+(num<?-:)*l>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  896. else b[a1][b1+(num<?-:)*l][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  897. }
  898. else if(goal==){
  899. if(c1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  900. else if(c1+(num<?-:)*l>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  901. else b[a1][b1][c1+(num<?-:)*l][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  902. }
  903. else{
  904. if(d1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  905. else if(d1+(num<?-:)*l>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  906. else b[a1][b1][c1][d1+(num<?-:)*l]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][b1]][k];
  907. }
  908. }
  909. else{
  910. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k]*dice[abs(num)][l];
  911. }
  912. }
  913. }
  914. else if(opt==){
  915. for(int k=;k<=(val[][c1]<<);k++){
  916. if(k>x){
  917. if(goal==){
  918. if(a1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  919. else if(a1+(num<?-:)*l>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  920. else b[a1+(num<?-:)*l][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  921. }
  922. else if(goal==){
  923. if(b1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  924. else if(b1+(num<?-:)*l>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  925. else b[a1][b1+(num<?-:)*l][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  926. }
  927. else if(goal==){
  928. if(c1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  929. else if(c1+(num<?-:)*l>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  930. else b[a1][b1][c1+(num<?-:)*l][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  931. }
  932. else{
  933. if(d1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  934. else if(d1+(num<?-:)*l>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  935. else b[a1][b1][c1][d1+(num<?-:)*l]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][c1]][k];
  936. }
  937. }
  938. else{
  939. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k]*dice[abs(num)][l];
  940. }
  941. }
  942. }
  943. else{
  944. for(int k=;k<=(val[][d1]<<);k++){
  945. if(k>x){
  946. if(goal==){
  947. if(a1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  948. else if(a1+(num<?-:)*l>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  949. else b[a1+(num<?-:)*l][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  950. }
  951. else if(goal==){
  952. if(b1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  953. else if(b1+(num<?-:)*l>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  954. else b[a1][b1+(num<?-:)*l][c1][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  955. }
  956. else if(goal==){
  957. if(c1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  958. else if(c1+(num<?-:)*l>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  959. else b[a1][b1][c1+(num<?-:)*l][d1]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  960. }
  961. else{
  962. if(d1+(num<?-:)*l<=)b[][][][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  963. else if(d1+(num<?-:)*l>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  964. else b[a1][b1][c1][d1+(num<?-:)*l]+=p[a1][b1][c1][d1]*dice[abs(num)][l]*dice[val[][d1]][k];
  965. }
  966. }
  967. else{
  968. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k]*dice[abs(num)][l];
  969. }
  970. }
  971. }
  972. }
  973.  
  974. }
  975. }
  976. }
  977. }
  978. }
  979. else{//>x
  980. for(int a1=;a1<=;a1++){
  981. for(int b1=;b1<=;b1++){
  982. for(int c1=;c1<=;c1++){
  983. for(int d1=;d1<=;d1++){
  984. if(opt==){
  985. for(int k=;k<=(val[][a1]<<);k++){
  986. if(k>x){
  987. if(goal==){
  988. if(a1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  989. else if(a1+num>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  990. else b[a1+num][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  991. }
  992. else if(goal==){
  993. if(b1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  994. else if(b1+num>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  995. else b[a1][b1+num][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  996. }
  997. else if(goal==){
  998. if(c1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  999. else if(c1+num>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  1000. else b[a1][b1][c1+num][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  1001. }
  1002. else{
  1003. if(d1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  1004. else if(d1+num>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  1005. else b[a1][b1][c1][d1+num]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  1006. }
  1007. }
  1008. else{
  1009. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][a1]][k];
  1010. }
  1011. }
  1012. }
  1013. else if(opt==){
  1014. for(int k=;k<=(val[][b1]<<);k++){
  1015. if(k>x){
  1016. if(goal==){
  1017. if(a1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  1018. else if(a1+num>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  1019. else b[a1+num][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  1020. }
  1021. else if(goal==){
  1022. if(b1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  1023. else if(b1+num>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  1024. else b[a1][b1+num][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  1025. }
  1026. else if(goal==){
  1027. if(c1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  1028. else if(c1+num>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  1029. else b[a1][b1][c1+num][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  1030. }
  1031. else{
  1032. if(d1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  1033. else if(d1+num>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  1034. else b[a1][b1][c1][d1+num]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  1035. }
  1036. }
  1037. else{
  1038. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][b1]][k];
  1039. }
  1040. }
  1041. }
  1042. else if(opt==){
  1043. for(int k=;k<=(val[][c1]<<);k++){
  1044. if(k>x){
  1045. if(goal==){
  1046. if(a1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  1047. else if(a1+num>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  1048. else b[a1+num][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  1049. }
  1050. else if(goal==){
  1051. if(b1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  1052. else if(b1+num>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  1053. else b[a1][b1+num][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  1054. }
  1055. else if(goal==){
  1056. if(c1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  1057. else if(c1+num>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  1058. else b[a1][b1][c1+num][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  1059. }
  1060. else{
  1061. if(d1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  1062. else if(d1+num>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  1063. else b[a1][b1][c1][d1+num]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  1064. }
  1065. }
  1066. else{
  1067. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][c1]][k];
  1068. }
  1069. }
  1070. }
  1071. else{
  1072. for(int k=;k<=(val[][d1]<<);k++){
  1073. if(k>x){
  1074. if(goal==){
  1075. if(a1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  1076. else if(a1+num>=)b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  1077. else b[a1+num][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  1078. }
  1079. else if(goal==){
  1080. if(b1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  1081. else if(b1+num>=)b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  1082. else b[a1][b1+num][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  1083. }
  1084. else if(goal==){
  1085. if(c1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  1086. else if(c1+num>=)b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  1087. else b[a1][b1][c1+num][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  1088. }
  1089. else{
  1090. if(d1+num<=)b[][][][]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  1091. else if(d1+num>=)b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  1092. else b[a1][b1][c1][d1+num]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  1093. }
  1094. }
  1095. else{
  1096. b[a1][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[val[][d1]][k];
  1097. }
  1098. }
  1099. }
  1100. }
  1101. }
  1102. }
  1103. }
  1104. }
  1105. }
  1106. }
  1107. for(int a1=;a1<=;a1++){
  1108. for(int b1=;b1<=;b1++){
  1109. for(int c1=;c1<=;c1++){
  1110. for(int d1=;d1<=;d1++){
  1111. p[a1][b1][c1][d1]=b[a1][b1][c1][d1];
  1112. b[a1][b1][c1][d1]=;
  1113. // printf("%d %d %d %d %lf\n",a1,b1,c1,d1,p[a1][b1][c1][d1]);
  1114. }
  1115. }
  1116. }
  1117. }
  1118. b[][][][]=p[][][][];
  1119. }
  1120. else{
  1121. if(s[][]=='?'){
  1122. if(s[][]=='i')opt=;
  1123. else if(s[][]=='p')opt=;
  1124. else if(s[][]=='a')opt=;
  1125. else opt=;
  1126. if(s[][]=='+')num=s[][]-'';
  1127. else num=-(s[][]-'');
  1128. if(num<){
  1129. num=-num;
  1130. for(int a1=;a1<=;a1++){
  1131. for(int b1=;b1<=;b1++){
  1132. for(int c1=;c1<=;c1++){
  1133. for(int d1=;d1<=;d1++){
  1134. for(int l=;l<=(num<<);l++){
  1135. if(opt==){
  1136. if(a1-l>)b[a1-l][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[num][l];
  1137. else b[][][][]+=p[a1][b1][c1][d1]*dice[num][l];
  1138. }
  1139. else if(opt==){
  1140. if(b1-l>)b[a1][b1-l][c1][d1]+=p[a1][b1][c1][d1]*dice[num][l];
  1141. else b[][][][]+=p[a1][b1][c1][d1]*dice[num][l];
  1142. }
  1143. else if(opt==){
  1144. if(c1-l>)b[a1][b1][c1-l][d1]+=p[a1][b1][c1][d1]*dice[num][l];
  1145. else b[][][][]+=p[a1][b1][c1][d1]*dice[num][l];
  1146. }
  1147. else{
  1148. if(d1-l>)b[a1][b1][c1][d1-l]+=p[a1][b1][c1][d1]*dice[num][l];
  1149. else b[][][][]+=p[a1][b1][c1][d1]*dice[num][l];
  1150. }
  1151. }
  1152. }
  1153. }
  1154. }
  1155. }
  1156. }
  1157. else{
  1158. for(int a1=;a1>=;a1--){
  1159. for(int b1=;b1>=;b1--){
  1160. for(int c1=;c1>=;c1--){
  1161. for(int d1=;d1>=;d1--){
  1162. for(int l=;l<=(num<<);l++){
  1163. if(opt==){
  1164. if(a1+l<=)b[a1+l][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[num][l];
  1165. else b[][b1][c1][d1]+=p[a1][b1][c1][d1]*dice[num][l];
  1166. }
  1167. else if(opt==){
  1168. if(b1+l<=)b[a1][b1+l][c1][d1]+=p[a1][b1][c1][d1]*dice[num][l];
  1169. else b[a1][][c1][d1]+=p[a1][b1][c1][d1]*dice[num][l];
  1170. }
  1171. else if(opt==){
  1172. if(c1+l<=)b[a1][b1][c1+l][d1]+=p[a1][b1][c1][d1]*dice[num][l];
  1173. else b[a1][b1][][d1]+=p[a1][b1][c1][d1]*dice[num][l];
  1174. }
  1175. else{
  1176. if(d1+l<=)b[a1][b1][c1][d1+l]+=p[a1][b1][c1][d1]*dice[num][l];
  1177. else b[a1][b1][c1][]+=p[a1][b1][c1][d1]*dice[num][l];
  1178. }
  1179. }
  1180. }
  1181. }
  1182. }
  1183. }
  1184. }
  1185. }
  1186. else{
  1187. if(s[][]=='i')opt=;
  1188. else if(s[][]=='p')opt=;
  1189. else if(s[][]=='a')opt=;
  1190. else opt=;
  1191. if(s[][]=='+')num=s[][]-'';
  1192. else num=-(s[][]-'');
  1193. if(num<){
  1194. for(int a1=;a1<=;a1++){
  1195. for(int b1=;b1<=;b1++){
  1196. for(int c1=;c1<=;c1++){
  1197. for(int d1=;d1<=;d1++){
  1198. if(opt==){
  1199. if(a1+num>)b[a1+num][b1][c1][d1]+=p[a1][b1][c1][d1];
  1200. else b[][][][]+=p[a1][b1][c1][d1];
  1201. }
  1202. else if(opt==){
  1203. if(b1+num>)b[a1][b1+num][c1][d1]+=p[a1][b1][c1][d1];
  1204. else b[][][][]+=p[a1][b1][c1][d1];
  1205. }
  1206. else if(opt==){
  1207. if(c1+num>)b[a1][b1][c1+num][d1]+=p[a1][b1][c1][d1];
  1208. else b[][][][]+=p[a1][b1][c1][d1];
  1209. }
  1210. else{
  1211. if(d1+num>)b[a1][b1][c1][d1+num]+=p[a1][b1][c1][d1];
  1212. else b[][][][]+=p[a1][b1][c1][d1];
  1213. }
  1214. }
  1215. }
  1216. }
  1217. }
  1218. }
  1219. else{
  1220. for(int a1=;a1>=;a1--){
  1221. for(int b1=;b1>=;b1--){
  1222. for(int c1=;c1>=;c1--){
  1223. for(int d1=;d1>=;d1--){
  1224. if(opt==){
  1225. if(a1+num<=)b[a1+num][b1][c1][d1]+=p[a1][b1][c1][d1];
  1226. else b[][b1][c1][d1]+=p[a1][b1][c1][d1];
  1227. }
  1228. else if(opt==){
  1229. if(b1+num<=)b[a1][b1+num][c1][d1]+=p[a1][b1][c1][d1];
  1230. else b[a1][][c1][d1]+=p[a1][b1][c1][d1];
  1231. }
  1232. else if(opt==){
  1233. if(c1+num<=)b[a1][b1][c1+num][d1]+=p[a1][b1][c1][d1];
  1234. else b[a1][b1][][d1]+=p[a1][b1][c1][d1];
  1235. }
  1236. else{
  1237. if(d1+num<=)b[a1][b1][c1][d1+num]+=p[a1][b1][c1][d1];
  1238. else b[a1][b1][c1][]+=p[a1][b1][c1][d1];
  1239. }
  1240. }
  1241. }
  1242. }
  1243. }
  1244. }
  1245. }
  1246. for(int a1=;a1<=;a1++){
  1247. for(int b1=;b1<=;b1++){
  1248. for(int c1=;c1<=;c1++){
  1249. for(int d1=;d1<=;d1++){
  1250. p[a1][b1][c1][d1]=b[a1][b1][c1][d1];
  1251. b[a1][b1][c1][d1]=;
  1252. // printf("%d %d %d %d %lf\n",a1,b1,c1,d1,p[a1][b1][c1][d1]);
  1253. }
  1254. }
  1255. }
  1256. }
  1257. b[][][][]=p[][][][];
  1258. }
  1259. }
  1260. printf("%.2lf\n",p[][][][]*100.0);
  1261. for(int a1=;a1<=;a1++){
  1262. for(int b1=;b1<=;b1++){
  1263. for(int c1=;c1<=;c1++){
  1264. for(int d1=;d1<=;d1++){
  1265. ans[][val[][a1]]+=p[a1][b1][c1][d1];
  1266. ans[][val[][b1]]+=p[a1][b1][c1][d1];
  1267. ans[][val[][c1]]+=p[a1][b1][c1][d1];
  1268. ans[][val[][d1]]+=p[a1][b1][c1][d1];
  1269. }
  1270. }
  1271. }
  1272. }
  1273. for(int i=;i<=;i++){
  1274. for(int j=;j<=;j++){
  1275. printf("%.2lf ",ans[i][j]*100.0);
  1276. }
  1277. printf("\n");
  1278. }
  1279. return ;
  1280. }

最好不要点开,关爱眼睛

T3:

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n;
int k[],cnt[],vis[][][][];
struct node{
int d[],len;
}f[][][][],fir;
node cheng(node x,int sum){
node e;
memset(e.d,,sizeof(e.d));
e.len=x.len;
for(int i=;i<=x.len;i++){
e.d[i]+=x.d[i]*sum;
e.d[i+]+=e.d[i]/;
e.d[i]%=;
}
while(e.d[e.len+])e.len++;
return e;
}
node jia(node x,node y){
node e;
memset(e.d,,sizeof(e.d));
e.len=max(x.len,y.len);
for(int i=;i<=e.len;i++){
e.d[i]+=x.d[i]+y.d[i];
e.d[i+]+=e.d[i]/;
e.d[i]%=;
}
while(e.d[e.len+])e.len++;
return e;
}
node dfs(int x,int y,int z,int lst){
if(!x&&!y&&!z)return fir;
if(vis[x][y][z][lst])return f[x][y][z][lst];
vis[x][y][z][lst]=;
node num;
memset(num.d,,sizeof(num.d));
num.len=;
if(x){
num=jia(num,cheng(dfs(x-,y,z,),x-(lst==)));
}
if(y){
num=jia(num,cheng(dfs(x+,y-,z,),y-(lst==)));
}
if(z){
num=jia(num,cheng(dfs(x,y+,z-,),z));
}
return f[x][y][z][lst]=num;
}
int main()
{
scanf("%d",&n);
for(int i=;i<=n;i++){
scanf("%d",&k[i]);
cnt[k[i]]++;
}
memset(fir.d,,sizeof(fir.d));
fir.len=fir.d[]=;
node ans=dfs(cnt[],cnt[],cnt[],);
for(int i=ans.len;i>=;i--){
printf("%d",ans.d[i]);
}
return ;
}

果然不想写题解了【瘫】

2019.10.26 csp-s模拟测试88 反思总结的更多相关文章

  1. 2019.10.26 CSP%您赛第三场

    \(CSP\)凉心模拟^_^ --题源\(lqx.lhc\)等各位蒟蒻 题目名称 比赛 传递消息 开关灯 源文件名 \(competition.cpp\) \(message.cpp\) \(ligh ...

  2. 2019.8.3 [HZOI]NOIP模拟测试12 C. 分组

    2019.8.3 [HZOI]NOIP模拟测试12 C. 分组 全场比赛题解:https://pan.baidu.com/s/1eSAMuXk 刚看这题觉得很难,于是数据点分治 k只有1和2两种,分别 ...

  3. 2019.8.3 [HZOI]NOIP模拟测试12 B. 数颜色

    2019.8.3 [HZOI]NOIP模拟测试12 B. 数颜色 全场比赛题解:https://pan.baidu.com/s/1eSAMuXk 数据结构学傻的做法: 对每种颜色开动态开点线段树直接维 ...

  4. 2019.8.3 [HZOI]NOIP模拟测试12 A. 斐波那契(fibonacci)

    2019.8.3 [HZOI]NOIP模拟测试12 A. 斐波那契(fibonacci) 全场比赛题解:https://pan.baidu.com/s/1eSAMuXk 找规律 找两个节点的lca,需 ...

  5. 2019.8.14 NOIP模拟测试21 反思总结

    模拟测试20的还没改完先咕着 各种细节问题=错失190pts T1大约三分钟搞出了式子,迅速码完,T2写了一半的时候怕最后被卡评测滚去交了,然后右端点没有初始化为n…但是这样还有80pts,而我后来还 ...

  6. 2019.8.1 NOIP模拟测试11 反思总结

    延迟了一天来补一个反思总结 急匆匆赶回来考试,我们这边大家的状态都稍微有一点差,不过最后的成绩总体来看好像还不错XD 其实这次拿分的大都是暴力[?],除了某些专注于某道题的人以及远程爆踩我们的某学车神 ...

  7. 2019.8.9 NOIP模拟测试15 反思总结

    日常爆炸,考得一次比一次差XD 可能还是被身体拖慢了学习的进度吧,虽然按理来说没有影响.大家听的我也听过,大家学的我也没有缺勤多少次. 那么果然还是能力问题吗……? 虽然不愿意承认,但显然就是这样.对 ...

  8. 2019/10/17 CSP模拟 总结

    T1 补票 Ticket 没什么好说的,不讲了 T2 删数字 Number 很后悔的是其实考场上不仅想出了正解的方程,甚至连优化都想到了,却因为码力不足只打了\(O(n^2)\)暴力,甚至还因为细节挂 ...

  9. 2019.10.30 csp-s模拟测试94 反思总结

    头一次做图巨的模拟题OWO 自从上一次听图巨讲课然后骗了小礼物以后一直对图巨印象挺好的233 T1: 对于XY取对数=Y*log(x) 对于Y!取对数=log(1*2*3*...*Y)=log1+lo ...

随机推荐

  1. PAT甲级——A1122 Hamiltonian Cycle【25】

    The "Hamilton cycle problem" is to find a simple cycle that contains every vertex in a gra ...

  2. 《DSP using MATLAB》Problem 8.39

    代码: %% ------------------------------------------------------------------------ %% Output Info about ...

  3. HYNB Contest 7:2017 Asia HCMC Vietnam National Programming Contest

    A. Another Query on Array Problem B. Board Covering C. Cumulative Sums 题意 \(A_1=1,A_i=A_{i-1}+sod(A_ ...

  4. android-启动另外一个Activity

    启动另外一个Activity 在完成了上一节课的学习后,我们已经创建了一个带有text输入框和一个button的app. 在本课中,我们将在MainActivity类中添加SendButton的单击响 ...

  5. [笔记]xshell Session

    因之前正常使用的xshell5 绿色版,在重装系统之后 启动时提示缺少 MSCVP110.dll xshell5 绿色版,启动时提示缺少 MSCVP110.dll,在各网站下载了对应的Dll文件,依然 ...

  6. layui相关用法总结

    1.关闭当前弹出层 parent.layer.close(parent.layer.getFrameIndex(window.name));

  7. 从虚拟机视角谈 Java 应用性能优化

    从虚拟机视角谈 Java 应用性能优化 周 祥, 软件工程师, IBM 简介:Java 的普及和广泛应用,以及其基于虚拟机运行的机制,使得性能问题越来越重要.本文从 Java 虚拟机的角度,特别是垃圾 ...

  8. cycloneii normal mode vs. arithmetic mode

    Combout = F(data1, data2, data3 or cin, data4) 在 arithmetic mode,只有 data1\data2 参加运算. 4-LUT到2个3-LUT的 ...

  9. 二分图匹配——poj1469

    关于本题二分图的匹配关系始终是加单向边用左边去匹配右边,match表示的是右边的人匹配的对应的左边的点 /* 关于本题二分图的匹配 链接的关系始终是单向边 用左边去匹配右边,match表示的是右边的人 ...

  10. Joomla - 自定义(自定义模块、修改原有模块样式、添加全局JS)

    一.自定义模块 自定义模块 参考 Joomla - 模块系统(新建模块.模块类别.自定义模块)第三点 自定义模块部分 自定义模块布局 参考 Joomla - T3模板(非常好用的4屏响应式模板) 的第 ...