久久久久久久999_99精品久久精品一区二区爱城_成人欧美一区二区三区在线播放_国产精品日本一区二区不卡视频_国产午夜视频_欧美精品在线观看免费

 找回密碼
 立即注冊

QQ登錄

只需一步，快速開始

搜索
查看: 4980|回復: 1
打印 上一主題 下一主題
收起左側

魔方求解算法（基礎擰十字法實現C語言描述）

[復制鏈接]
跳轉到指定樓層
樓主
ID:102014 發表于 2016-1-6 02:35 | 只看該作者 回帖獎勵 |倒序瀏覽 |閱讀模式
本帖最后由 51黑黑 于 2016-1-6 02:36 編輯

      兩年前寫了魔方的操作框架，這次把魔方求解也做出來準備用到C寫的所以即可以很方便的移植到單片機上做解魔方機器人的核心算法，也可以直接在PC上運行然后通過數據線控制機械機構來操作。
     對魔方的解法也不是很精通所以用的最基本的十字解法來實現的，解魔方步驟一般會有100多步
  1. #include <iostream>
  2. #include <stdlib.h>
  3. //數據結構：
  4. typedef enum colors
  5. {white=1,blue,red,green,orange,yellow}Colors;//6種顏色

  7. typedef struct surface
  8. {
  9. Colors s[4][4];
  10. }Surface;//每個面有3*3個小格，從下標1開始表示，每一面的顏色是固定的

  12. typedef struct cube
  13. {
  14. Surface up,down,front,back,left,right;
  15. }Cube;//魔方的6個面

  17. typedef struct snode
  18. {
  19. char *chbuf;
  20. int times;
  21. struct snode *next;
  22. }SNode;

  24. typedef struct sequence
  25. {
  26. SNode *head;//存儲魔方轉換序列
  27. int num;//魔方轉換的次數
  28. }Sequence;

  30. Sequence CD;

  32. //程序：
  33. void SaveChBuf(char *sur,int i)//將cb序列存入chbuf中
  34. {
  35. char *str;
  36. int len=strlen(sur);
  37. SNode *p,*q;
  38. if(i%4)
  39. {
  40. str=(char *)malloc(sizeof(char)*(len+2));
  41. if(!str)
  42. {
  43. printf("內存不足!\n");
  44. exit(0);
  45. }
  46. strcpy(str,sur);
  47. q=(SNode *)malloc(sizeof(SNode));
  48. if(!q)
  49. {
  50. printf("內存不足!\n");
  51. exit(0);
  52. }
  53. q->chbuf=str;
  54. q->times=i;
  55. q->next=NULL;
  56. if(CD.head==NULL)
  57. {
  58. CD.head=q;
  59. CD.num++;
  60. }
  61. else
  62. {
  63. for(p=CD.head;p->next;p=p->next);
  64. if(!strcmp(p->chbuf,q->chbuf))
  65. {
  66. p->times=(p->times+q->times)%4;
  67. free(q->chbuf);free(q);
  68. if(!(p->times))
  69. {
  70. if(p==CD.head)
  71. {
  72. CD.head=NULL;
  73. free(p->chbuf);free(p);
  74. CD.num--;
  75. }
  76. else
  77. {
  78. for(q=CD.head;q->next!=p;q=q->next);
  79. q->next=NULL;
  80. free(p->chbuf);free(p);
  81. CD.num--;
  82. }
  83. }
  84. }
  85. else
  86. {
  87. p->next=q;
  88. CD.num++;
  89. }
  90. }
  91. }
  92. }

  94. void clockwise(Surface *sur,int i)//將sur面順時針旋轉i次
  95. {
  96. Surface t;
  97. for(;i>0;i--)
  98. {
  99. t=*sur;
  100. sur->s[1][1]=t.s[3][1];
  101. sur->s[1][2]=t.s[2][1];
  102. sur->s[1][3]=t.s[1][1];
  103. sur->s[2][1]=t.s[3][2];
  104. sur->s[2][2]=t.s[2][2];
  105. sur->s[2][3]=t.s[1][2];
  106. sur->s[3][1]=t.s[3][3];
  107. sur->s[3][2]=t.s[2][3];
  108. sur->s[3][3]=t.s[1][3];
  109. }
  110. }

  112. void F(Cube *m,int i)//將魔方的正面順時針轉i次
  113. {
  114. Cube n;
  115. for(;i>0;i--)
  116. {
  117. n=*m;
  118. clockwise(&m->front,1);
  119. m->right.s[1][1]=n.up.s[3][1];
  120. m->right.s[2][1]=n.up.s[3][2];
  121. m->right.s[3][1]=n.up.s[3][3];
  122. m->down.s[1][1]=n.right.s[3][1];
  123. m->down.s[1][2]=n.right.s[2][1];
  124. m->down.s[1][3]=n.right.s[1][1];
  125. m->left.s[1][3]=n.down.s[1][1];
  126. m->left.s[2][3]=n.down.s[1][2];
  127. m->left.s[3][3]=n.down.s[1][3];
  128. m->up.s[3][1]=n.left.s[3][3];
  129. m->up.s[3][2]=n.left.s[2][3];
  130. m->up.s[3][3]=n.left.s[1][3];
  131. }
  132. }

  134. void B(Cube *m,int i)//將魔方的背面順時針轉i次
  135. {
  136. Cube n;
  137. for(;i>0;i--)
  138. {
  139. n=*m;
  140. clockwise(&m->back,1);
  141. m->right.s[1][3]=n.down.s[3][3];
  142. m->right.s[2][3]=n.down.s[3][2];
  143. m->right.s[3][3]=n.down.s[3][1];
  144. m->down.s[3][1]=n.left.s[1][1];
  145. m->down.s[3][2]=n.left.s[2][1];
  146. m->down.s[3][3]=n.left.s[3][1];
  147. m->left.s[1][1]=n.up.s[1][3];
  148. m->left.s[2][1]=n.up.s[1][2];
  149. m->left.s[3][1]=n.up.s[1][1];
  150. m->up.s[1][1]=n.right.s[1][3];
  151. m->up.s[1][2]=n.right.s[2][3];
  152. m->up.s[1][3]=n.right.s[3][3];
  153. }
  154. }

  156. void R(Cube *m,int i)//將魔方的右面順時針轉i次
  157. {
  158. Cube n;
  159. for(;i>0;i--)
  160. {
  161. n=*m;
  162. clockwise(&m->right,1);
  163. m->up.s[1][3]=n.front.s[1][3];
  164. m->up.s[2][3]=n.front.s[2][3];
  165. m->up.s[3][3]=n.front.s[3][3];
  166. m->front.s[1][3]=n.down.s[1][3];
  167. m->front.s[2][3]=n.down.s[2][3];
  168. m->front.s[3][3]=n.down.s[3][3];
  169. m->down.s[1][3]=n.back.s[3][1];
  170. m->down.s[2][3]=n.back.s[2][1];
  171. m->down.s[3][3]=n.back.s[1][1];
  172. m->back.s[3][1]=n.up.s[1][3];
  173. m->back.s[2][1]=n.up.s[2][3];
  174. m->back.s[1][1]=n.up.s[3][3];
  175. }
  176. }

  178. void L(Cube *m,int i)//將魔方的左面順時針轉i次
  179. {
  180. Cube n;
  181. for(;i>0;i--)
  182. {
  183. n=*m;
  184. clockwise(&m->left,1);
  185. m->up.s[1][1]=n.back.s[3][3];
  186. m->up.s[2][1]=n.back.s[2][3];
  187. m->up.s[3][1]=n.back.s[1][3];
  188. m->back.s[1][3]=n.down.s[3][1];
  189. m->back.s[2][3]=n.down.s[2][1];
  190. m->back.s[3][3]=n.down.s[1][1];
  191. m->down.s[1][1]=n.front.s[1][1];
  192. m->down.s[2][1]=n.front.s[2][1];
  193. m->down.s[3][1]=n.front.s[3][1];
  194. m->front.s[1][1]=n.up.s[1][1];
  195. m->front.s[2][1]=n.up.s[2][1];
  196. m->front.s[3][1]=n.up.s[3][1];
  197. }
  198. }

  200. void U(Cube *m,int i)//將魔方的上面順時針轉i次
  201. {
  202. Cube n;
  203. for(;i>0;i--)
  204. {
  205. n=*m;
  206. clockwise(&m->up,1);
  207. m->front.s[1][1]=n.right.s[1][1];
  208. m->front.s[1][2]=n.right.s[1][2];
  209. m->front.s[1][3]=n.right.s[1][3];
  210. m->right.s[1][1]=n.back.s[1][1];
  211. m->right.s[1][2]=n.back.s[1][2];
  212. m->right.s[1][3]=n.back.s[1][3];
  213. m->back.s[1][1]=n.left.s[1][1];
  214. m->back.s[1][2]=n.left.s[1][2];
  215. m->back.s[1][3]=n.left.s[1][3];
  216. m->left.s[1][1]=n.front.s[1][1];
  217. m->left.s[1][2]=n.front.s[1][2];
  218. m->left.s[1][3]=n.front.s[1][3];
  219. }
  220. }

  222. void D(Cube *m,int i)//將魔方的底面順時針轉i次
  223. {
  224. Cube n;
  225. for(;i>0;i--)
  226. {
  227. n=*m;
  228. clockwise(&m->down,1);
  229. m->front.s[3][1]=n.left.s[3][1];
  230. m->front.s[3][2]=n.left.s[3][2];
  231. m->front.s[3][3]=n.left.s[3][3];
  232. m->left.s[3][1]=n.back.s[3][1];
  233. m->left.s[3][2]=n.back.s[3][2];
  234. m->left.s[3][3]=n.back.s[3][3];
  235. m->back.s[3][1]=n.right.s[3][1];
  236. m->back.s[3][2]=n.right.s[3][2];
  237. m->back.s[3][3]=n.right.s[3][3];
  238. m->right.s[3][1]=n.front.s[3][1];
  239. m->right.s[3][2]=n.front.s[3][2];
  240. m->right.s[3][3]=n.front.s[3][3];
  241. }
  242. }

  244. void MR(Cube *m,int i)//將魔方的左面和右面之間的面以右面為基準順時針旋轉1次
  245. {
  246. Cube n;
  247. for(;i>0;i--)
  248. {
  249. n=*m;
  250. m->up.s[1][2]=n.front.s[1][2];
  251. m->up.s[2][2]=n.front.s[2][2];
  252. m->up.s[3][2]=n.front.s[3][2];
  253. m->front.s[1][2]=n.down.s[1][2];
  254. m->front.s[2][2]=n.down.s[2][2];
  255. m->front.s[3][2]=n.down.s[3][2];
  256. m->down.s[1][2]=n.back.s[3][2];
  257. m->down.s[2][2]=n.back.s[2][2];
  258. m->down.s[3][2]=n.back.s[1][2];
  259. m->back.s[3][2]=n.up.s[1][2];
  260. m->back.s[2][2]=n.up.s[2][2];
  261. m->back.s[1][2]=n.up.s[3][2];
  262. }
  263. }

  265. void MF(Cube *m,int i)//將魔方的前面和后面之間的面以前面為基準順時針旋轉i次
  266. {
  267. Cube n;
  268. for(;i>0;i--)
  269. {
  270. n=*m;
  271. m->right.s[1][2]=n.up.s[2][1];
  272. m->right.s[2][2]=n.up.s[2][2];
  273. m->right.s[3][2]=n.up.s[2][3];
  274. m->up.s[2][1]=n.left.s[3][2];
  275. m->up.s[2][2]=n.left.s[2][2];
  276. m->up.s[2][3]=n.left.s[1][2];
  277. m->left.s[1][2]=n.down.s[2][1];
  278. m->left.s[2][2]=n.down.s[2][2];
  279. m->left.s[3][2]=n.down.s[2][3];
  280. m->down.s[2][1]=n.right.s[3][2];
  281. m->down.s[2][2]=n.right.s[2][2];
  282. m->down.s[2][3]=n.right.s[1][2];
  283. }
  284. }

  286. void MU(Cube *m,int i)//將魔方的上面和底面之間的面以上面為基準順時針旋轉i次
  287. {
  288. Cube n;
  289. for(;i>0;i--)
  290. {
  291. n=*m;
  292. m->front.s[2][1]=n.right.s[2][1];
  293. m->front.s[2][2]=n.right.s[2][2];
  294. m->front.s[2][3]=n.right.s[2][3];
  295. m->right.s[2][1]=n.back.s[2][1];
  296. m->right.s[2][2]=n.back.s[2][2];
  297. m->right.s[2][3]=n.back.s[2][3];
  298. m->back.s[2][1]=n.left.s[2][1];
  299. m->back.s[2][2]=n.left.s[2][2];
  300. m->back.s[2][3]=n.left.s[2][3];
  301. m->left.s[2][1]=n.front.s[2][1];
  302. m->left.s[2][2]=n.front.s[2][2];
  303. m->left.s[2][3]=n.front.s[2][3];
  304. }
  305. }

  307. void MoveCube(Cube *m,char *sur,int i)//根據序列cb轉換魔方m
  308. {
  309. SaveChBuf(sur,i);//將魔方轉換序列存入chbuf中
  310. if(!strcmp(sur,"f"))
  311. F(m,i);//將魔方的正面順時針旋轉i次
  312. if(!strcmp(sur,"b"))
  313. B(m,i);//將魔方的背面順時針旋轉i次
  314. if(!strcmp(sur,"r"))
  315. R(m,i);//將魔方的右面順時針旋轉i次
  316. if(!strcmp(sur,"l"))
  317. L(m,i);//將魔方的左面順時針旋轉i次
  318. if(!strcmp(sur,"u"))
  319. U(m,i);//將魔方的上面順時針旋轉i次
  320. if(!strcmp(sur,"d"))
  321. D(m,i);//將魔方的底面順時針旋轉i次
  322. if(!strcmp(sur,"mr"))
  323. MR(m,i);//將魔方的左面和右面之間的面以右面為基準順時針旋轉i次
  324. if(!strcmp(sur,"mf"))
  325. MF(m,i);//將魔方的前面和后面之間的面以前面為基準順時針旋轉i次
  326. if(!strcmp(sur,"mu"))
  327. MU(m,i);//將魔方的上面和底面之間的面以上面為基準順時針旋轉i次
  328. }

  330. void InputSurface(Surface *sur)
  331. {
  332. int i,j,a;
  333. for(i=1;i<=3;i++)
  334. for(j=1;j<=3;j++)
  335. {
  336. scanf("%d",&a);
  337. sur->s[i][j]=(Colors)a;
  338. }
  339. }

  341. void Input(Cube *magiccube)//存儲魔方
  342. {
  343. printf("獲取魔方每個面的顏色值:\n");
  344. printf("Blue--------1\tRed---------2\tYellow------3\n");
  345. printf("Green-------4\tWhite-------5\tOrange------6\n\n");
  346. printf("獲取頂面(UP)顏色值:\n");
  347. InputSurface(&(magiccube->up));//儲存頂面
  348. printf("獲取底面(Down)顏色值:\n");
  349. InputSurface(&(magiccube->down));//儲存底面
  350. printf("獲取前面(Front)顏色值:\n");
  351. InputSurface(&(magiccube->front));//儲存前面
  352. printf("獲取后面(Back)顏色值:\n");
  353. InputSurface(&(magiccube->back));//儲存后面
  354. printf("獲取左面(Left)顏色值:\n");
  355. InputSurface(&(magiccube->left));//儲存左面
  356. printf("獲取右面(Right)顏色值:\n");
  357. InputSurface(&(magiccube->right));//儲存右面
  358. }

  360. void DownCross(Cube *magiccube)//將底面拼出一個十字
  361. {
  362. while(!((magiccube->down.s[1][2]==magiccube->down.s[2][2]&&magiccube->front.s[3][2]==magiccube->front.s[2][2])
  363. &&(magiccube->down.s[2][1]==magiccube->down.s[2][2]&&magiccube->left.s[3][2]==magiccube->left.s[2][2])
  364. &&(magiccube->down.s[2][3]==magiccube->down.s[2][2]&&magiccube->right.s[3][2]==magiccube->right.s[2][2])
  365. &&(magiccube->down.s[3][2]==magiccube->down.s[2][2]&&magiccube->back.s[3][2]==magiccube->back.s[2][2])))
  366. {
  367. Surface *sur[4]={&magiccube->front,&magiccube->left,&magiccube->back,&magiccube->right};
  368. char *s[4]={"f","l","b","r"};
  369. int subscript_of_down[4][2]={{1,2},{2,1},{3,2},{2,3}};
  370. int subscript_of_up[4][2]={{3,2},{2,1},{1,2},{2,3}};
  371. char ch[3];
  372. int n;
  373. for(int i=0;i<4;i++)
  374. {
  375. if(magiccube->down.s[subscript_of_down[i][0]][subscript_of_down[i][1]]==magiccube->down.s[2][2]
  376. &&sur[i]->s[3][2]!=sur[i]->s[2][2])
  377. {
  378. strcpy(ch,s[i]);
  379. MoveCube(magiccube,ch,2);
  380. }//底面棱塊為底面色位置不對
  381. if(magiccube->up.s[subscript_of_up[i][0]][subscript_of_up[i][1]]==magiccube->down.s[2][2])
  382. {
  383. n=0;
  384. while(sur[(i+n)%4]->s[2][2]!=sur[(i+n)%4]->s[1][2])
  385. {
  386. MoveCube(magiccube,"u",1);
  387. n++;
  388. }
  389. strcpy(ch,s[(i+n)%4]);
  390. MoveCube(magiccube,ch,2);
  391. }//以上是底面棱塊在頂面的情況
  392. if(sur[i]->s[1][2]==magiccube->down.s[2][2])//側面上棱是底面色的情況
  393. {
  394. n=0;
  395. while(sur[(i+n+1)%4]->s[2][2]!=magiccube->up.s[subscript_of_up[(i+n)%4][0]][subscript_of_up[(i+n)%4][1]])
  396. {
  397. MoveCube(magiccube,"u",1);
  398. n++;
  399. }
  400. strcpy(ch,s[(i+n)%4]);
  401. MoveCube(magiccube,ch,3);
  402. strcpy(ch,s[(n+1+i)%4]);
  403. MoveCube(magiccube,ch,1);
  404. strcpy(ch,s[(i+n)%4]);
  405. MoveCube(magiccube,ch,1);
  406. }
  407. if(sur[i]->s[2][1]==magiccube->down.s[2][2])//側面左棱是底面色的情況
  408. {
  409. strcpy(ch,s[(i+1)%4]);
  410. MoveCube(magiccube,ch,3);
  411. MoveCube(magiccube,"u",1);
  412. MoveCube(magiccube,ch,1);
  413. }
  414. if(sur[i]->s[2][3]==magiccube->down.s[2][2])//側面右棱是底面色的情況
  415. {
  416. strcpy(ch,s[(i+3)%4]);
  417. MoveCube(magiccube,ch,1);
  418. MoveCube(magiccube,"u",1);
  419. MoveCube(magiccube,ch,3);
  420. }
  421. if(sur[i]->s[3][2]==magiccube->down.s[2][2])//側面底棱是底面色的情況
  422. {
  423. strcpy(ch,s[i]);
  424. MoveCube(magiccube,ch,1);
  425. strcpy(ch,s[(i+1)%4]);
  426. MoveCube(magiccube,ch,3);
  427. MoveCube(magiccube,"u",1);
  428. MoveCube(magiccube,ch,1);
  429. strcpy(ch,s[i]);
  430. MoveCube(magiccube,ch,3);
  431. }//以上是側面棱塊色是底面色的情況
  432. }
  433. }
  434. }

  436. void DownCornerRestore(Cube *magiccube)//底角還原
  437. {
  438. while(!((magiccube->down.s[1][1]==magiccube->down.s[2][2]&&magiccube->front.s[3][1]==magiccube->front.s[2][2]&&magiccube->left.s[3][3]==magiccube->left.s[2][2])
  439. &&(magiccube->down.s[1][3]==magiccube->down.s[2][2]&&magiccube->front.s[3][3]==magiccube->front.s[2][2]&&magiccube->right.s[3][1]==magiccube->right.s[2][2])
  440. &&(magiccube->down.s[3][1]==magiccube->down.s[2][2]&&magiccube->right.s[3][1]==magiccube->right.s[2][2]&&magiccube->back.s[3][3]==magiccube->back.s[2][2])
  441. &&(magiccube->down.s[3][3]==magiccube->down.s[2][2]&&magiccube->back.s[3][1]==magiccube->back.s[2][2]&&magiccube->right.s[3][3]==magiccube->right.s[2][2])))//直到底角全部歸位
  442. {
  443. Surface *sur[4]={&magiccube->front,&magiccube->left,&magiccube->back,&magiccube->right};
  444. char *s[4]={"f","l","b","r"};
  445. int subscript_of_down[4][2]={{1,1},{3,1},{3,3},{1,3}};
  446. int subscript_of_up[4][2]={{3,1},{1,1},{1,3},{3,3}};
  447. char ch[3];
  448. int n;
  449. for(int i=0;i<4;i++)
  450. {
  451. if(magiccube->down.s[subscript_of_down[i][0]][subscript_of_down[i][1]]==magiccube->down.s[2][2]&&
  452. (sur[i]->s[3][1]!=sur[i]->s[2][2]||sur[(i+1)%4]->s[3][3]!=sur[(i+1)%4]->s[2][2]))
  453. {
  454. strcpy(ch,s[i]);
  455. MoveCube(magiccube,ch,1);
  456. MoveCube(magiccube,"u",1);
  457. MoveCube(magiccube,ch,3);
  458. }//底面角塊顏色歸位但是位置不對
  459. if(magiccube->up.s[subscript_of_up[i][0]][subscript_of_up[i][1]]==magiccube->down.s[2][2])
  460. {
  461. n=0;
  462. while(sur[(i+n)%4]->s[1][1]!=sur[(i+n+1)%4]->s[2][2])
  463. {
  464. MoveCube(magiccube,"u",1);
  465. n++;
  466. }
  467. strcpy(ch,s[(i+n)%4]);
  468. MoveCube(magiccube,ch,1);
  469. MoveCube(magiccube,"u",3);
  470. MoveCube(magiccube,ch,3);
  471. MoveCube(magiccube,"u",2);
  472. }//頂面有底角色塊的情況
  473. if(sur[i]->s[1][1]==magiccube->down.s[2][2])//側面左上角是底面色的情況
  474. {
  475. n=0;
  476. while(sur[(i+n+1)%4]->s[2][2]!=sur[(i+n+1)%4]->s[1][3])
  477. {
  478. MoveCube(magiccube,"u",1);
  479. n++;
  480. }
  481. strcpy(ch,s[(n+i)%4]);
  482. MoveCube(magiccube,ch,1);
  483. MoveCube(magiccube,"u",1);
  484. MoveCube(magiccube,ch,3);
  485. }
  486. if(sur[i]->s[1][3]==magiccube->down.s[2][2])//側面右上角是底面色的情況
  487. {
  488. n=0;
  489. while(sur[(i+n+3)%4]->s[2][2]!=sur[(i+n+3)%4]->s[1][1])
  490. {
  491. MoveCube(magiccube,"u",1);
  492. n++;
  493. }
  494. strcpy(ch,s[(n+i)%4]);
  495. MoveCube(magiccube,ch,3);
  496. MoveCube(magiccube,"u",3);
  497. MoveCube(magiccube,ch,1);
  498. }
  499. if(sur[i]->s[3][1]==magiccube->down.s[2][2])//側面左下角是底面色的情況
  500. {
  501. strcpy(ch,s[i]);
  502. MoveCube(magiccube,ch,1);
  503. MoveCube(magiccube,"u",1);
  504. MoveCube(magiccube,ch,3);
  505. }
  506. if(sur[i]->s[3][3]==magiccube->down.s[2][2])//側面右下角是底面色的情況
  507. {
  508. strcpy(ch,s[i]);
  509. MoveCube(magiccube,ch,3);
  510. MoveCube(magiccube,"u",3);
  511. MoveCube(magiccube,ch,1);
  512. }//側面有底面色塊
  513. }
  514. }
  515. }

  517. void CentreEdgeRestore(Cube *magiccube)//中棱歸位
  518. {
  519. while(!((magiccube->front.s[2][1]==magiccube->front.s[2][2]&&magiccube->front.s[2][3]==magiccube->front.s[2][2])
  520. &&(magiccube->left.s[2][1]==magiccube->left.s[2][2]&&magiccube->left.s[2][3]==magiccube->left.s[2][2])
  521. &&(magiccube->back.s[2][1]==magiccube->back.s[2][2]&&magiccube->back.s[2][3]==magiccube->back.s[2][2])
  522. &&(magiccube->right.s[2][1]==magiccube->right.s[2][2]&&magiccube->right.s[2][3]==magiccube->right.s[2][2])))
  523. {
  524. Surface *sur[4]={&magiccube->front,&magiccube->left,&magiccube->back,&magiccube->right};
  525. char *s[4]={"f","l","b","r"};
  526. int subscript_of_up[4][2]={{3,2},{2,1},{1,2},{2,3}};
  527. char ch[3];
  528. int n;
  529. for(int i=0;i<4;i++)
  530. {
  531. if(!(sur[i]->s[2][1]==sur[i]->s[2][2]&&sur[(i+1)%4]->s[2][3]==sur[(i+1)%4]->s[2][2])
  532. &&(sur[i]->s[2][1]!=magiccube->up.s[2][2]&&sur[(i+1)%4]->s[2][3]!=magiccube->up.s[2][2]))
  533. {
  534. strcpy(ch,s[i]);
  535. MoveCube(magiccube,ch,3);
  536. MoveCube(magiccube,"u",3);
  537. MoveCube(magiccube,ch,3);
  538. MoveCube(magiccube,"u",3);
  539. MoveCube(magiccube,ch,3);
  540. MoveCube(magiccube,"u",1);
  541. MoveCube(magiccube,ch,1);
  542. MoveCube(magiccube,"u",1);
  543. MoveCube(magiccube,ch,1);
  544. MoveCube(magiccube,"u",2);
  545. }
  546. if(sur[i]->s[1][2]!=magiccube->up.s[2][2]
  547. &&magiccube->up.s[subscript_of_up[i][0]][subscript_of_up[i][1]]!=magiccube->up.s[2][2])
  548. {
  549. n=0;
  550. while(sur[(i+n)%4]->s[1][2]!=sur[(i+n)%4]->s[2][2])
  551. {
  552. n++;
  553. MoveCube(magiccube,"u",1);
  554. }
  555. if(magiccube->up.s[subscript_of_up[(i+n)%4][0]][subscript_of_up[(i+n)%4][1]]==sur[(i+n+3)%4]->s[2][2])
  556. {
  557. strcpy(ch,s[(i+n)%4]);
  558. MoveCube(magiccube,ch,1);
  559. MoveCube(magiccube,"u",1);
  560. MoveCube(magiccube,ch,1);
  561. MoveCube(magiccube,"u",1);
  562. MoveCube(magiccube,ch,1);
  563. MoveCube(magiccube,"u",3);
  564. MoveCube(magiccube,ch,3);
  565. MoveCube(magiccube,"u",3);
  566. MoveCube(magiccube,ch,3);
  567. }
  568. if(magiccube->up.s[subscript_of_up[(i+n)%4][0]][subscript_of_up[(i+n)%4][1]]==sur[(i+n+1)%4]->s[2][2])
  569. {
  570. strcpy(ch,s[(i+n)%4]);
  571. MoveCube(magiccube,ch,3);
  572. MoveCube(magiccube,"u",3);
  573. MoveCube(magiccube,ch,3);
  574. MoveCube(magiccube,"u",3);
  575. MoveCube(magiccube,ch,3);
  576. MoveCube(magiccube,"u",1);
  577. MoveCube(magiccube,ch,1);
  578. MoveCube(magiccube,"u",1);
  579. MoveCube(magiccube,ch,1);
  580. }
  581. }
  582. }
  583. }
  584. }

  586. void UpCross(Cube *magiccube)//頂面十字
  587. {
  588. while(!(magiccube->up.s[1][2]==magiccube->up.s[2][2]&&magiccube->up.s[2][1]==magiccube->up.s[2][2]
  589. &&magiccube->up.s[2][3]==magiccube->up.s[2][2]&&magiccube->up.s[3][2]==magiccube->up.s[2][2]))
  590. {
  591. Surface *sur[4]={&magiccube->front,&magiccube->left,&magiccube->back,&magiccube->right};
  592. char *s[4]={"f","l","b","r"};
  593. int subscript_of_up[4][2]={{3,2},{2,1},{1,2},{2,3}};
  594. char ch[3];
  595. if(magiccube->up.s[1][2]!=magiccube->up.s[2][2]&&magiccube->up.s[2][1]!=magiccube->up.s[2][2]
  596. &&magiccube->up.s[2][3]!=magiccube->up.s[2][2]&&magiccube->up.s[3][2]!=magiccube->up.s[2][2])
  597. {
  598. MoveCube(magiccube,"f",1);
  599. MoveCube(magiccube,"r",1);
  600. MoveCube(magiccube,"u",1);
  601. MoveCube(magiccube,"r",3);
  602. MoveCube(magiccube,"u",3);
  603. MoveCube(magiccube,"f",3);
  604. }
  605. for(int i=0;i<4;i++)
  606. {
  607. if(magiccube->up.s[subscript_of_up[(i+1)%4][0]][subscript_of_up[(i+1)%4][1]]==magiccube->up.s[2][2]
  608. &&magiccube->up.s[subscript_of_up[(i+2)%4][0]][subscript_of_up[(i+2)%4][1]]==magiccube->up.s[2][2]
  609. &&magiccube->up.s[subscript_of_up[i][0]][subscript_of_up[i][1]]!=magiccube->up.s[2][2]
  610. &&magiccube->up.s[subscript_of_up[(i+3)%4][0]][subscript_of_up[(i+3)%4][1]]!=magiccube->up.s[2][2])
  611. {//形成一個倒"L"
  612. strcpy(ch,s[i]);
  613. MoveCube(magiccube,ch,1);
  614. strcpy(ch,s[(i+3)%4]);
  615. MoveCube(magiccube,ch,1);
  616. MoveCube(magiccube,"u",1);
  617. MoveCube(magiccube,ch,3);
  618. MoveCube(magiccube,"u",3);
  619. strcpy(ch,s[i]);
  620. MoveCube(magiccube,ch,3);
  621. }
  622. if(magiccube->up.s[subscript_of_up[(i+1)%4][0]][subscript_of_up[(i+1)%4][1]]==magiccube->up.s[2][2]
  623. &&magiccube->up.s[subscript_of_up[(i+3)%4][0]][subscript_of_up[(i+3)%4][1]]==magiccube->up.s[2][2]
  624. &&magiccube->up.s[subscript_of_up[i][0]][subscript_of_up[i][1]]!=magiccube->up.s[2][2]
  625. &&magiccube->up.s[subscript_of_up[(i+2)%4][0]][subscript_of_up[(i+2)%4][1]]!=magiccube->up.s[2][2])
  626. {//形成一個橫"一"
  627. strcpy(ch,s[i]);
  628. MoveCube(magiccube,ch,1);
  629. strcpy(ch,s[(i+3)%4]);
  630. MoveCube(magiccube,ch,1);
  631. MoveCube(magiccube,"u",1);
  632. MoveCube(magiccube,ch,3);
  633. MoveCube(magiccube,"u",3);
  634. strcpy(ch,s[i]);
  635. MoveCube(magiccube,ch,3);
  636. }
  637. }
  638. }
  639. }

  641. void UpSurfaceCornerRestore(Cube *magiccube)//頂角面位
  642. {
  643. while(!(magiccube->up.s[1][1]==magiccube->up.s[2][2]&&magiccube->up.s[1][3]==magiccube->up.s[2][2]
  644. &&magiccube->up.s[3][1]==magiccube->up.s[2][2]&&magiccube->up.s[3][3]==magiccube->up.s[2][2]))
  645. {
  646. Surface *sur[4]={&magiccube->front,&magiccube->left,&magiccube->back,&magiccube->right};
  647. char *s[4]={"f","l","b","r"};
  648. int subscript_of_up[4][2]={{3,1},{1,1},{1,3},{3,3}};
  649. char ch[3];
  650. int n;
  651. for(int i=0;i<4;i++)
  652. {
  653. if((magiccube->up.s[1][1]!=magiccube->up.s[2][2]&&magiccube->up.s[1][3]!=magiccube->up.s[2][2]
  654. &&magiccube->up.s[3][1]!=magiccube->up.s[2][2]&&magiccube->up.s[3][3]!=magiccube->up.s[2][2])
  655. &&(sur[i]->s[1][1]==magiccube->up.s[2][2]&&sur[i]->s[1][3]==magiccube->up.s[2][2]))
  656. {//十字型（前左右與上同色）
  657. n=0;
  658. while(sur[(i+n)%4]->s[1][2]!=sur[(i+n)%4]->s[2][2])
  659. {
  660. MoveCube(magiccube,"u",1);
  661. n++;
  662. }
  663. strcpy(ch,s[(i+n+3)%4]);
  664. MoveCube(magiccube,ch,3);
  665. MoveCube(magiccube,"u",2);
  666. MoveCube(magiccube,ch,1);
  667. MoveCube(magiccube,"u",1);
  668. MoveCube(magiccube,ch,3);
  669. MoveCube(magiccube,"u",1);
  670. MoveCube(magiccube,ch,1);
  671. }
  672. if(magiccube->up.s[subscript_of_up[(i+3)%4][0]][subscript_of_up[(i+3)%4][1]]==magiccube->up.s[2][2]
  673. &&magiccube->up.s[subscript_of_up[i][0]][subscript_of_up[i][1]]!=magiccube->up.s[2][2]
  674. &&magiccube->up.s[subscript_of_up[(i+1)%4][0]][subscript_of_up[(i+1)%4][1]]!=magiccube->up.s[2][2]
  675. &&magiccube->up.s[subscript_of_up[(i+2)%4][0]][subscript_of_up[(i+2)%4][1]]!=magiccube->up.s[2][2])
  676. {//魚頭朝右下的魚
  677. if(sur[i]->s[1][1]!=magiccube->up.s[2][2])//前左與上異色
  678. {
  679. strcpy(ch,s[(i+3)%4]);
  680. MoveCube(magiccube,ch,3);
  681. MoveCube(magiccube,"u",2);
  682. MoveCube(magiccube,ch,1);
  683. MoveCube(magiccube,"u",1);
  684. MoveCube(magiccube,ch,3);
  685. MoveCube(magiccube,"u",1);
  686. MoveCube(magiccube,ch,1);
  687. }
  688. else//前左與上同色
  689. {
  690. MoveCube(magiccube,"u",3);
  691. strcpy(ch,s[(i+3)%4]);
  692. MoveCube(magiccube,ch,1);
  693. MoveCube(magiccube,"u",2);
  694. MoveCube(magiccube,ch,3);
  695. MoveCube(magiccube,"u",3);
  696. MoveCube(magiccube,ch,1);
  697. MoveCube(magiccube,"u",3);
  698. MoveCube(magiccube,ch,3);
  699. }
  700. }
  701. if(magiccube->up.s[subscript_of_up[(i+1)%4][0]][subscript_of_up[(i+1)%4][1]]==magiccube->up.s[2][2]
  702. &&magiccube->up.s[subscript_of_up[i][0]][subscript_of_up[i][1]]!=magiccube->up.s[2][2]
  703. &&magiccube->up.s[subscript_of_up[(i+3)%4][0]][subscript_of_up[(i+3)%4][1]]!=magiccube->up.s[2][2]
  704. &&magiccube->up.s[subscript_of_up[(i+2)%4][0]][subscript_of_up[(i+2)%4][1]]==magiccube->up.s[2][2])
  705. {//大炮型
  706. if(sur[i]->s[1][1]==magiccube->up.s[2][2]&&sur[i]->s[1][3]==magiccube->up.s[2][2])
  707. {//前左右與上同色
  708. strcpy(ch,s[(i+1)%4]);
  709. MoveCube(magiccube,ch,3);
  710. MoveCube(magiccube,"u",2);
  711. MoveCube(magiccube,ch,1);
  712. MoveCube(magiccube,"u",1);
  713. MoveCube(magiccube,ch,3);
  714. MoveCube(magiccube,"u",1);
  715. MoveCube(magiccube,ch,1);
  716. }
  717. else
  718. {//前左右與上異色
  719. strcpy(ch,s[(i+2)%4]);
  720. MoveCube(magiccube,ch,3);
  721. MoveCube(magiccube,"u",2);
  722. MoveCube(magiccube,ch,1);
  723. MoveCube(magiccube,"u",1);
  724. MoveCube(magiccube,ch,3);
  725. MoveCube(magiccube,"u",1);
  726. MoveCube(magiccube,ch,1);
  727. }
  728. }
  729. if(magiccube->up.s[subscript_of_up[(i+3)%4][0]][subscript_of_up[(i+3)%4][1]]==magiccube->up.s[2][2]
  730. &&magiccube->up.s[subscript_of_up[i][0]][subscript_of_up[i][1]]!=magiccube->up.s[2][2]
  731. &&magiccube->up.s[subscript_of_up[(i+1)%4][0]][subscript_of_up[(i+1)%4][1]]==magiccube->up.s[2][2]
  732. &&magiccube->up.s[subscript_of_up[(i+2)%4][0]][subscript_of_up[(i+2)%4][1]]!=magiccube->up.s[2][2])
  733. {//雙凌型
  734. MoveCube(magiccube,"u",3);
  735. strcpy(ch,s[(i+3)%4]);
  736. MoveCube(magiccube,ch,3);
  737. MoveCube(magiccube,"u",2);
  738. MoveCube(magiccube,ch,1);
  739. MoveCube(magiccube,"u",1);
  740. MoveCube(magiccube,ch,3);
  741. MoveCube(magiccube,"u",1);
  742. MoveCube(magiccube,ch,1);
  743. }
  744. }
  745. }
  746. }

  748. void UpCornerRestore(Cube *magiccube)//頂角還原
  749. {
  750. while(magiccube->front.s[1][1]!=magiccube->front.s[2][2])
  751. MoveCube(magiccube,"u",1);
  752. while(!((magiccube->front.s[1][1]==magiccube->front.s[2][2]&&magiccube->front.s[1][3]==magiccube->front.s[2][2])
  753. &&(magiccube->left.s[1][1]==magiccube->left.s[2][2]&&magiccube->left.s[1][3]==magiccube->left.s[2][2])
  754. &&(magiccube->back.s[1][1]==magiccube->back.s[2][2]&&magiccube->back.s[1][3]==magiccube->back.s[2][2])
  755. &&(magiccube->right.s[1][1]==magiccube->right.s[2][2]&&magiccube->right.s[1][3]==magiccube->right.s[2][2])))
  756. {
  757. Surface *sur[4]={&magiccube->front,&magiccube->left,&magiccube->back,&magiccube->right};
  758. char *s[4]={"f","l","b","r"};
  759. int n;
  760. char ch[3];
  761. int i;
  762. for(i=0;i<4;i++)
  763. {
  764. n=0;
  765. if(sur[i]->s[1][1]==sur[i]->s[1][3])
  766. {
  767. while(sur[(i+n)%4]->s[1][1]!=sur[(i+n)%4]->s[2][2])
  768. {
  769. MoveCube(magiccube,"u",1);
  770. n++;
  771. }
  772. break;
  773. }
  774. }
  775. strcpy(ch,s[(i+n+3)%4]);
  776. MoveCube(magiccube,ch,1);
  777. strcpy(ch,s[(i+n+2)%4]);
  778. MoveCube(magiccube,ch,3);
  779. strcpy(ch,s[(i+n+3)%4]);
  780. MoveCube(magiccube,ch,1);
  781. strcpy(ch,s[(i+n)%4]);
  782. MoveCube(magiccube,ch,2);
  783. strcpy(ch,s[(i+n+3)%4]);
  784. MoveCube(magiccube,ch,3);
  785. strcpy(ch,s[(i+n+2)%4]);
  786. MoveCube(magiccube,ch,1);
  787. strcpy(ch,s[(i+n+3)%4]);
  788. MoveCube(magiccube,ch,1);
  789. strcpy(ch,s[(i+n)%4]);
  790. MoveCube(magiccube,ch,2);
  791. strcpy(ch,s[(i+n+3)%4]);
  792. MoveCube(magiccube,ch,2);
  793. while(magiccube->front.s[1][1]!=magiccube->front.s[2][2])
  794. MoveCube(magiccube,"u",1);
  795. }
  796. }

  798. void UpEdgeRestore(Cube *magiccube)//頂棱還原
  799. {
  800. while(magiccube->front.s[1][1]!=magiccube->front.s[2][2])
  801. MoveCube(magiccube,"u",1);
  802. while(!(magiccube->front.s[1][2]==magiccube->front.s[2][2]&&magiccube->left.s[1][2]==magiccube->left.s[2][2]
  803. &&magiccube->back.s[1][2]==magiccube->back.s[2][2]&&magiccube->right.s[1][2]==magiccube->right.s[2][2]))
  804. {
  805. Surface *sur[4]={&magiccube->front,&magiccube->left,&magiccube->back,&magiccube->right};
  806. char *s[4]={"f","l","b","r"};
  807. int n;
  808. char ch[3];
  809. int i;
  810. for(i=0;i<4;i++)
  811. {
  812. n=0;
  813. if(sur[i]->s[1][1]==sur[i]->s[1][2]&&sur[i]->s[1][2]==sur[i]->s[1][3])
  814. {
  815. while(sur[(i+n)%4]->s[1][1]!=sur[(i+n)%4]->s[2][2])
  816. {
  817. MoveCube(magiccube,"u",1);
  818. n++;
  819. }
  820. break;
  821. }
  822. }
  823. strcpy(ch,s[(i+n+1)%4]);
  824. MoveCube(magiccube,ch,1);
  825. MoveCube(magiccube,"u",3);
  826. MoveCube(magiccube,ch,1);
  827. MoveCube(magiccube,"u",1);
  828. MoveCube(magiccube,ch,1);
  829. MoveCube(magiccube,"u",1);
  830. MoveCube(magiccube,ch,1);
  831. MoveCube(magiccube,"u",3);
  832. MoveCube(magiccube,ch,3);
  833. MoveCube(magiccube,"u",3);
  834. MoveCube(magiccube,ch,2);
  835. while(magiccube->front.s[1][1]!=magiccube->front.s[2][2])
  836. MoveCube(magiccube,"u",1);
  837. }
  838. }

  840. void printsurface(Surface sur)//輸出某一面的顏色
  841. {
  842. int i,j;
  843. for(i=1;i<=3;i++)
  844. {
  845. for(j=1;j<=3;j++)
  846. printf("%d ",(int)sur.s[i][j]);
  847. printf("\n");
  848. }
  849. }

  851. void PrintMagicCube(Cube m)//輸出整個魔方的當前顏色值狀態
  852. {
  853. printf("\nUp面顏色值如下:\n");      
  854. printsurface(m.up);
  855. printf("\nDown面顏色值如下:\n");
  856. printsurface(m.down);
  857. printf("\nFront面顏色值如下:\n");
  858. printsurface(m.front);
  859. printf("\nBack面顏色值如下:\n");
  860. printsurface(m.back);
  861. printf("\nLeft面顏色值如下:\n");
  862. printsurface(m.left);
  863. printf("\nRight面顏色值如下:\n");
  864. printsurface(m.right);
  865. }

  867. void PrintBuf()
  868. {
  869. SNode *p;
  870. int i;
  871. printf("\n還原魔方所用的操作步驟如下:\n");
  872. for(p=CD.head,i=1;p;p=p->next,i++)
  873. {
  874. printf("%s%d\t",p->chbuf,p->times);
  875. if(i==5)
  876. {
  877. putchar('\n');
  878. printf("------------------------------------\n");
  879. i=0;
  880. }
  881. }
  882. printf("\n\n本次魔方還原一共進行了%d步!\n",CD.num);
  883. }

  885. void InitializationMagiccube(Cube *m)//初始化魔方
  886. {

  888. m->up.s[1][1]=(Colors)2;m->up.s[1][2]=(Colors)4;m->up.s[1][3]=(Colors)4;
  889. m->up.s[2][1]=(Colors)3;m->up.s[2][2]=(Colors)5;m->up.s[2][3]=(Colors)6;
  890. m->up.s[3][1]=(Colors)2;m->up.s[3][2]=(Colors)1;m->up.s[3][3]=(Colors)5;

  892. m->down.s[1][1]=(Colors)3;m->down.s[1][2]=(Colors)3;m->down.s[1][3]=(Colors)6;
  893. m->down.s[2][1]=(Colors)5;m->down.s[2][2]=(Colors)3;m->down.s[2][3]=(Colors)1;
  894. m->down.s[3][1]=(Colors)4;m->down.s[3][2]=(Colors)6;m->down.s[3][3]=(Colors)6;

  896. m->front.s[1][1]=(Colors)5;m->front.s[1][2]=(Colors)5;m->front.s[1][3]=(Colors)1;
  897. m->front.s[2][1]=(Colors)2;m->front.s[2][2]=(Colors)4;m->front.s[2][3]=(Colors)6;
  898. m->front.s[3][1]=(Colors)2;m->front.s[3][2]=(Colors)2;m->front.s[3][3]=(Colors)3;

  900. m->back.s[1][1]=(Colors)5;m->back.s[1][2]=(Colors)2;m->back.s[1][3]=(Colors)3;
  901. m->back.s[2][1]=(Colors)6;m->back.s[2][2]=(Colors)1;m->back.s[2][3]=(Colors)4;
  902. m->back.s[3][1]=(Colors)3;m->back.s[3][2]=(Colors)3;m->back.s[3][3]=(Colors)6;
  903. m->left.s[1][1]=(Colors)1;m->left.s[1][2]=(Colors)4;m->left.s[1][3]=(Colors)1;
  904. m->left.s[2][1]=(Colors)5;m->left.s[2][2]=(Colors)6;m->left.s[2][3]=(Colors)1;
  905. m->left.s[3][1]=(Colors)5;m->left.s[3][2]=(Colors)2;m->left.s[3][3]=(Colors)4;

  907. m->right.s[1][1]=(Colors)6;m->right.s[1][2]=(Colors)5;m->right.s[1][3]=(Colors)2;
  908. m->right.s[2][1]=(Colors)1;m->right.s[2][2]=(Colors)2;m->right.s[2][3]=(Colors)4;
  909. m->right.s[3][1]=(Colors)1;m->right.s[3][2]=(Colors)3;m->right.s[3][3]=(Colors)4;
  910. }
  911. void Exit()
  912. {
  913. SNode *p,*q;
  914. for(p=CD.head;p;p=q)
  915. {
  916. q=p->next;
  917. free(p->chbuf);free(p);//釋放所有內存空間
  918. }
  919. printf("按任意鍵繼續....");
  920. getchar();
  921. }
  922. int main(int argc, char *argv[])
  923. {
  924. Cube magiccube;
  925. int i=0;
  926. CD.num=0;
  927. CD.head=NULL;
  928. Input(&magiccube);//輸入魔方初始狀態
  929. //InitializationMagiccube(&magiccube);//初始化魔方  調試用
  930. printf("\n獲取到的魔方狀態為:");
  931. PrintMagicCube(magiccube);//輸出初始化后的魔方
  932. DownCross(&magiccube);//底部十字
  933. DownCornerRestore(&magiccube);//底角還原
  934. CentreEdgeRestore(&magiccube);//中棱還原
  935. UpCross(&magiccube);//頂面十字
  936. UpSurfaceCornerRestore(&magiccube);//頂角面位
  937. UpCornerRestore(&magiccube);//頂角還原
  938. UpEdgeRestore(&magiccube);//頂棱還原
  939. printf("\n還原轉換后的魔方狀態為:");
  940. PrintMagicCube(magiccube);//輸出變換后的魔方
  941. PrintBuf();//輸出變更序列
  942. Exit();
  943. system("PAUSE");
  944. return 0;
  945. }
復制代碼



分享到:  QQ好友和群QQ好友和群 QQ空間QQ空間 騰訊微博騰訊微博 騰訊朋友騰訊朋友
收藏收藏 分享淘帖 頂頂 踩踩
回復

使用道具 舉報

沙發
ID:281514 發表于 2018-2-1 17:29 | 只看該作者
最終能還原嗎
回復

使用道具 舉報

您需要登錄后才可以回帖 登錄 | 立即注冊

本版積分規則

手機版|小黑屋|51黑電子論壇 |51黑電子論壇6群 QQ 管理員QQ:125739409;技術交流QQ群281945664

Powered by 單片機教程網

快速回復 返回頂部 返回列表
主站蜘蛛池模板： 精品二区 | 国产免费一区二区三区 | 成人免费观看男女羞羞视频 | h漫在线观看 | 一区二区视频 | 成人午夜影院 | 久草资源在线视频 | 欧美成年网站 | 狠狠干夜夜草 | 国产精品久久久久久久久久久久久久 | 视频一区二区在线观看 | 一本岛道一二三不卡区 | 国产专区在线 | 青青草一区 | 国产一区在线视频 | 欧美日韩激情 | 2019精品手机国产品在线 | 做a视频| 一区二区三区av | 99免费看 | 国产一区二区 | 国产精品视频在线观看 | 亚洲人成人一区二区在线观看 | 一区二区免费视频 | 欧美黑人狂野猛交老妇 | 国产一区二区日韩 | 真人女人一级毛片免费播放 | 黑人精品欧美一区二区蜜桃 | 日本小电影在线 | 日韩在线视频一区 | 成人免费影院 | 亚洲视频在线免费观看 | 人人干免费 | 欧美综合视频在线 | 在线观看av网站 | 国产精品视频免费观看 | 久久国产精品久久久久久 | 羞羞的视频在线观看 | 欧美a√ | 99精品久久 | 一区观看|