Advertisement
Guest User

Untitled

a guest
Oct 7th, 2015
94
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 4.87 KB | None | 0 0
  1. class Program
  2. {
  3. static void Mahsanit1(Stack<char> s1, int x)
  4. {
  5. char A;
  6. Stack<char> S2 = new Stack<char>();
  7.  
  8. while (!s1.IsEmpty())
  9. {
  10. A = s1.Pop();
  11.  
  12. for (int i = 0; i < x; i++)
  13. Console.Write(A); }
  14. S2.Push(A);
  15. }
  16. while (!S2.IsEmpty())
  17. {
  18. s1.Push(S2.Pop());
  19. }
  20. }
  21. static void Mahsanit2(Stack<int> s1)
  22. {
  23. int intLow, intTemp;
  24. Stack<int> tempint = new Stack<int>();
  25.  
  26. intLow = s1.Pop();
  27. tempint.Push(intLow);
  28.  
  29. while (!s1.IsEmpty())
  30. {
  31. intTemp = s1.Pop();
  32. if (intLow > intTemp)
  33. {
  34. intLow = intTemp;
  35. }
  36. tempint.Push(intTemp);
  37. }
  38. while (!tempint.IsEmpty())
  39. {
  40. s1.Push(tempint.Pop());
  41. }
  42. Console.WriteLine("The smallest number is {0}", intLow);
  43. }
  44. static void Mahsanit3(Stack<int> stacknumber, Stack<int> stacknumber2)
  45. {
  46. int intTemp, intTemp2;
  47. Stack<int> tempint = new Stack<int>();
  48. Stack<int> tempint2 = new Stack<int>();
  49. Stack<int> tempint3 = new Stack<int>();
  50.  
  51. while (!stacknumber.IsEmpty())
  52. {
  53. intTemp = stacknumber.Pop();
  54. intTemp2 = stacknumber2.Pop();
  55. if (intTemp != intTemp2)
  56. {
  57. tempint.Push(intTemp);
  58. }
  59.  
  60. tempint2.Push(intTemp);
  61. tempint3.Push(intTemp2);
  62. }
  63. while (!tempint2.IsEmpty() && !tempint3.IsEmpty())
  64. {
  65. stacknumber.Push(tempint2.Pop());
  66. stacknumber2.Push(tempint3.Pop());
  67. }
  68. }
  69. static void Mahsanit4(Stack<int> stacknumber3)
  70. {
  71. int intTemp, intCount = 0;
  72. Stack<int> tempint = new Stack<int>();
  73. while (!stacknumber3.IsEmpty())
  74. {
  75. intTemp = stacknumber3.Pop();
  76. if ((intTemp % 10) == 3)
  77. {
  78. intCount++;
  79. }
  80. tempint.Push(intTemp);
  81. }
  82. while (!tempint.IsEmpty())
  83. {
  84. stacknumber3.Push(tempint.Pop());
  85. }
  86. }
  87. static void Mahsanit5(Stack<int> stacknumber4, Stack<int> stacknumber5)
  88. {
  89. int intTemp, intTemp2;
  90. Stack<int> tempint = new Stack<int>();
  91. Stack<int> tempint2 = new Stack<int>();
  92. Stack<int> tempint3 = new Stack<int>();
  93.  
  94. while (!stacknumber4.IsEmpty())
  95. {
  96. intTemp = stacknumber4.Pop();
  97. intTemp2 = stacknumber5.Pop();
  98. if (intTemp == intTemp2)
  99. {
  100. tempint.Push(intTemp);
  101. }
  102.  
  103. tempint2.Push(intTemp);
  104. tempint3.Push(intTemp2);
  105. }
  106. while (!tempint2.IsEmpty() && !tempint3.IsEmpty())
  107. {
  108. stacknumber4.Push(tempint2.Pop());
  109. stacknumber5.Push(tempint3.Pop());
  110. }
  111. }
  112. static void Mahsanit6(Stack<int> stacknumber, Stack<int> stacknumber2)
  113. {
  114. int intTemp, intTemp2;
  115. Stack<int> tempint = new Stack<int>();
  116. Stack<int> tempint2 = new Stack<int>();
  117. Stack<int> tempint3 = new Stack<int>();
  118.  
  119. while (!stacknumber.IsEmpty())
  120. {
  121. intTemp = stacknumber.Pop();
  122. intTemp2 = stacknumber2.Pop();
  123. if (intTemp == intTemp2)
  124. {
  125. tempint.Push(intTemp);
  126. }
  127.  
  128. tempint2.Push(intTemp);
  129. tempint3.Push(intTemp2);
  130. }
  131. while (!tempint2.IsEmpty() && !tempint3.IsEmpty())
  132. {
  133. stacknumber.Push(tempint2.Pop());
  134. stacknumber2.Push(tempint3.Pop());
  135. }
  136. }
  137. static void Mahsanit7(Stack<int> stacknumbermamoca)
  138. {
  139. int intTemp, intSum, intCount;
  140. Stack<int> tempint = new Stack<int>();
  141.  
  142. while (!stacknumber.IsEmpty())
  143. {
  144. intTemp = stacknumbermamoca.Pop();
  145. intSum += intTemp;
  146. intCount++;
  147.  
  148. tempint.Push(intTemp);
  149. }
  150. Console.WriteLine(" the Avarage is {0}", ( intSum / intCount ));
  151. while (!tempint.IsEmpty())
  152. {
  153. stacknumbermamoca.Push(tempint.Pop());
  154. }
  155. }
  156. }
  157. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement