Advertisement
Guest User

Untitled

a guest
Sep 19th, 2019
149
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 7.92 KB | None | 0 0
  1. // 4
  2. using System;
  3. using System.Collections.Generic;
  4. using System.Linq;
  5. using System.Text;
  6. using System.Threading.Tasks;
  7.  
  8. namespace Zad4
  9. {
  10. public class Program
  11. {
  12. public static void Main()
  13. {
  14. var numberOfElements = int.Parse(Console.ReadLine());
  15. var numbers = Console.ReadLine()
  16. .Split(' ')
  17. .Select(value => int.Parse(value))
  18. .ToArray();
  19. Console.Write("\n");
  20. Array.ForEach(ReverseArray(numberOfElements, numbers), number => Console.Write($"{number} "));
  21. Console.ReadKey();
  22. }
  23.  
  24. public static int[] ReverseArray(int numberOfElements, int[] numbers)
  25. {
  26. var newArray = new int[numberOfElements];
  27.  
  28. for (int i = 0; i < numberOfElements; i++)
  29. {
  30. newArray[numberOfElements - i - 1] = numbers[i];
  31. }
  32. return newArray;
  33. }
  34. }
  35. }
  36.  
  37. // 5
  38. using System;
  39. using System.Text.RegularExpressions;
  40.  
  41. namespace Zad5
  42. {
  43. public class Program
  44. {
  45. public static void Main()
  46. {
  47. Regex rgx = new Regex("[^a-z -]");
  48.  
  49. var text = rgx.Replace(Console.ReadLine().ToLower(), "");
  50. Console.WriteLine(Palindrome(text));
  51. Console.ReadKey();
  52. }
  53.  
  54. public static string Palindrome(string text)
  55. {
  56. for (int i = 0, j = text.Length - 1; i < j; i++, j--)
  57. {
  58. if (text[i] != text[j]) return "NO";
  59. }
  60. return "YES";
  61. }
  62. }
  63. }
  64.  
  65. // 6
  66.  
  67. using System;
  68. using System.Collections.Generic;
  69. using System.Linq;
  70.  
  71. namespace Zad6
  72. {
  73. class Program
  74. {
  75. static void Main(string[] args)
  76. {
  77. var numbers1 = Console.ReadLine()
  78. .Split(' ')
  79. .Select(value => int.Parse(value))
  80. .ToList();
  81. var numbers2 = Console.ReadLine()
  82. .Split(' ')
  83. .Select(value => int.Parse(value))
  84. .ToList();
  85. Console.WriteLine(Permutation(numbers1, numbers2));
  86. Console.ReadKey();
  87. }
  88.  
  89. static string Permutation(List<int> numbers1, List<int> numbers2)
  90. {
  91. if (numbers1.Count != numbers2.Count) return "NO";
  92. foreach (var number in numbers2)
  93. {
  94. var index = numbers1.IndexOf(number);
  95. if (index > -1) numbers1.RemoveAt(index);
  96. }
  97. if (numbers1.Count > 0) return "NO";
  98. return "YES";
  99. }
  100. }
  101. }
  102.  
  103.  
  104. // 7
  105. using System;
  106. using System.Collections.Generic;
  107. using System.Linq;
  108.  
  109. namespace Zad7
  110. {
  111. class Program
  112. {
  113. static void Main(string[] args)
  114. {
  115. var numbers = Console.ReadLine()
  116. .Split(' ')
  117. .Select(value => int.Parse(value))
  118. .ToList();
  119. var powersOfTwo = new List<int>();
  120. var greatestPowerOfTwo = 0;
  121.  
  122. foreach (var number in numbers)
  123. {
  124. var power = 1;
  125. while (true)
  126. {
  127. if (number < power) break;
  128. if (number == power && power > greatestPowerOfTwo) greatestPowerOfTwo = number;
  129. power *= 2;
  130. }
  131. }
  132.  
  133. var powerOfTwo = 1;
  134. while (true)
  135. {
  136. if (powerOfTwo <= greatestPowerOfTwo) powersOfTwo.Add(powerOfTwo);
  137. else break;
  138. powerOfTwo *= 2;
  139. }
  140.  
  141. for (int i = 0; i < powersOfTwo.Count; i++)
  142. {
  143. if (i < powersOfTwo.Count - 1) Console.Write($"{powersOfTwo[i]}, ");
  144. else Console.Write($"{powersOfTwo[i]}");
  145. }
  146.  
  147. Console.ReadKey();
  148. }
  149. }
  150. }
  151.  
  152. // 8
  153. using System;
  154. using System.Collections.Generic;
  155. using System.Linq;
  156.  
  157. namespace Zad8
  158. {
  159. class Program
  160. {
  161. static void Main(string[] args)
  162. {
  163. var numberOfLines = int.Parse(Console.ReadLine());
  164. var listOfLines = new List<int[]>();
  165.  
  166. for (int i = 0; i < numberOfLines; i++)
  167. {
  168. listOfLines.Add(Console.ReadLine()
  169. .Split(' ')
  170. .Select(value => int.Parse(value))
  171. .ToArray());
  172.  
  173. if (listOfLines[listOfLines.Count - 1].Length != 2)
  174. {
  175. Console.WriteLine("Wrong input");
  176. Console.ReadKey();
  177. Environment.Exit(1);
  178. }
  179. }
  180.  
  181. var numberOfPrimes = 0;
  182. foreach (var line in listOfLines)
  183. {
  184. var n = line[0];
  185. var m = line[1];
  186. for (; n <= m; n++)
  187. {
  188. if (IsPrime(n)) numberOfPrimes++;
  189. }
  190. Console.Write($"{numberOfPrimes} ");
  191. }
  192.  
  193. Console.ReadKey();
  194. }
  195.  
  196. static bool IsPrime(int n)
  197. {
  198. if (n <= 3) return n > 1;
  199. else if (n % 2 == 0 || n % 3 == 0) return false;
  200. var i = 5;
  201. while (i * i <= n)
  202. {
  203. if (n % i == 0 || n % (i + 2) == 0) return false;
  204. i += 6;
  205. }
  206. return true;
  207. }
  208. }
  209. }
  210.  
  211. // 11
  212. using System;
  213. using System.Collections.Generic;
  214. using System.Linq;
  215.  
  216. namespace Zad_11
  217. {
  218. class Program
  219. {
  220. static void Main(string[] args)
  221. {
  222. var numberOfElements = int.Parse(Console.ReadLine());
  223. var numbers = Console.ReadLine()
  224. .Split(' ')
  225. .Select(value => int.Parse(value))
  226. .ToArray();
  227. var digits = new List<int>();
  228.  
  229. foreach (var number in numbers)
  230. {
  231. var copyOfNumber = number;
  232. while (true)
  233. {
  234. digits.Add(copyOfNumber % 10);
  235. copyOfNumber /= 10;
  236. if (copyOfNumber == 0) break;
  237. }
  238. }
  239.  
  240. Console.WriteLine(FindTheMostRepeatedNumber(digits));
  241.  
  242. Console.ReadKey();
  243. }
  244.  
  245. static int FindTheMostRepeatedNumber(IEnumerable<int> numbers)
  246. {
  247. var repeatedNumbers = new Dictionary<int, int>();
  248.  
  249. foreach (var number in numbers)
  250. {
  251. if (!repeatedNumbers.ContainsKey(number)) repeatedNumbers.Add(number, 0);
  252. repeatedNumbers[number]++;
  253. }
  254.  
  255. var biggestNumber = repeatedNumbers.Aggregate((acc, cur) => cur.Value > acc.Value || cur.Key > acc.Key ? cur : acc).Key;
  256.  
  257. return biggestNumber;
  258. }
  259. }
  260. }
  261.  
  262. // 12
  263. using System;
  264. using System.Linq;
  265.  
  266. namespace Zad12
  267. {
  268. class Program
  269. {
  270. static void Main(string[] args)
  271. {
  272. var numberOfElements = int.Parse(Console.ReadLine());
  273. var numbers = Console.ReadLine()
  274. .Split(' ')
  275. .Select(value => int.Parse(value))
  276. .ToArray();
  277. Console.WriteLine(GreatestSumOfDigits(numbers));
  278. Console.ReadKey();
  279. }
  280.  
  281. static int GreatestSumOfDigits(int[] numbers)
  282. {
  283. var greatest = numbers.Aggregate((number: -1, sumOfDigits: -1), (acc, currentNumber) =>
  284. {
  285. var currentSum = 0;
  286. var currentNumberCounter = currentNumber;
  287. while (true)
  288. {
  289. currentSum += currentNumberCounter % 10;
  290. currentNumberCounter /= 10;
  291. if (currentNumberCounter == 0) break;
  292. }
  293.  
  294. if (acc.sumOfDigits == currentSum)
  295. {
  296. return acc.number > currentNumber ? acc : (number: currentNumber, sumOfDigits: currentSum);
  297. }
  298. return acc.sumOfDigits > currentSum ? acc : (number: currentNumber, sumOfDigits: currentSum);
  299. }).number;
  300.  
  301. return Array.IndexOf(numbers, greatest);
  302. }
  303. }
  304. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement