Advertisement
Musna

C++_random_words_generator

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