Advertisement
Guest User

Untitled

a guest
Jan 18th, 2017
80
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.63 KB | None | 0 0
  1. enum letters{let[2]};
  2. new const l[][letters]={{"a"},{"b"},{"c"},{"d"},{"e"},{"f"},{"g"},{"h"},{"i"},{"j"},{"k"},{"l"},{"m"},{"n"},{"o"},{"p"},{"q"},{"r"},{"s"},{"t"},{"u"},{"v"},{"w"},{"x"},{"y"},{"z"},{"A"},{"B"},{"C"},{"D"},{"E"},{"F"},{"G"},{"H"},{"I"},{"J"},{"K"},{"L"},{"M"},{"N"},{"O"},{"P"},{"Q"},{"R"},{"S"},{"T"},{"U"},{"V"},{"W"},{"X"},{"Y"},{"Z"}};
  3.  
  4. stock Fibonacci(wert,wdh=0)
  5. {
  6. new startat=wert;
  7. new lastv,result=wert;
  8. for(new i=0;i<=wdh;i++)
  9. {
  10. if(i!=0){startat=lastv;}
  11. lastv=result;
  12. if(i==0){if(startat!=0){lastv=startat;}else{lastv=1;}}
  13. result=startat+lastv;
  14. printf("Fibonacci schleife-%i: %i",i,result);
  15. }
  16. return 1;
  17. }
  18. stock UnNumStr(str[])
  19. {
  20. new val,nstr[3],unns[200];
  21. format(unns,sizeof(unns),"");
  22. for(new i=0;i<strlen(str);i+=2)
  23. {
  24. strmid(nstr,str,i,i+2);
  25. val=strval(nstr);
  26. if(val<20)
  27. {
  28. format(unns,sizeof(unns),"%s%i",unns,val-10);
  29. }
  30. else
  31. {
  32. format(unns,sizeof(unns),"%s%s",unns,l[val-20]);
  33. }
  34. }
  35. return unns;
  36. }
  37. stock NumStr(str[])
  38. {
  39. new nstr[2],nvalstr[100];
  40. //new sv=strlen(str);
  41. for(new i=0;i<strlen(str);i++)
  42. {
  43. strmid(nstr,str,i,i+1);
  44. if (nstr[0] <= '9' && nstr[0] >= '0')
  45. {
  46. format(nvalstr,sizeof(nvalstr),"%s%i",nvalstr,strval(nstr)+10);
  47. }
  48. else
  49. {
  50. for(new x=0;x<52;x++)
  51. {
  52. if(strcmp(nstr,l[x],false)==0)
  53. {
  54. format(nvalstr,sizeof(nvalstr),"%s%i",nvalstr,x+20);
  55. }
  56. }
  57. }
  58. }
  59. /*if(strlen(nvalstr) > 1)
  60. {
  61. //new val=strval(nvalstr);
  62. return nvalstr;
  63. }*/
  64. return nvalstr;
  65. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement