Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- using System;
- namespace exercise_414
- {
- class exercise_414
- {
- static void Main()
- {
- Console.Write("enter N: ");
- int n = int.Parse(Console.ReadLine());
- int[] arr = new int [n];
- int[] A = new int [n];
- int[] B = new int [n];
- int[] C = new int [n];
- int sum = 0;
- int suma = 0;
- int sumb = 0;
- int sumc = 0;
- //uslovie 1.a
- for (int i = 0; i < n; i++)
- {
- Console.Write("Enter the " + (i + 1) + " element: ");
- arr[i] = int.Parse(Console.ReadLine());
- }
- //uslovie 1.b
- for (int i = 0; i < n; i++)
- {
- if (arr[i] > 0 || arr[i] <= 100)
- {
- if (arr[i] % 2 != 0)
- {
- sum = sum + arr[i];
- }
- }
- }
- Console.WriteLine("The sum of the odd numbers is: " + sum);
- //uslovie 2
- //Da se pravi s metodite
- for (int i = 0; i < n; i++)
- {
- Console.Write("Enter the " + (i + 1) + " element: ");
- A[i] = int.Parse(Console.ReadLine());
- }
- for (int i = 0; i < n; i++)
- {
- if (A[i] > 0 || A[i] <= 100)
- {
- if (A[i] % 2 != 0)
- {
- suma = suma + A[i];
- }
- }
- }
- Console.WriteLine("The sum of the odd numbers is: " + suma);
- //Da se pravi s metodite
- for (int i = 0; i < n; i++)
- {
- Console.Write("Enter the " + (i + 1) + " element: ");
- B[i] = int.Parse(Console.ReadLine());
- }
- for (int i = 0; i < n; i++)
- {
- if (B[i] > 0 || B[i] <= 100)
- {
- if (B[i] % 2 != 0)
- {
- sumb = sumb + B[i];
- }
- }
- }
- Console.WriteLine("The sum of the odd numbers is: " + sumb);
- //Da se pravi s metodite
- for (int i = 0; i < n; i++)
- {
- Console.Write("Enter the " + (i + 1) + " element: ");
- C[i] = int.Parse(Console.ReadLine());
- }
- for (int i = 0; i < n; i++)
- {
- if (C[i] > 0 || C[i] <= 100)
- {
- if (C[i] % 2 != 0)
- {
- sumc = sumc + C[i];
- }
- }
- }
- Console.WriteLine("The sum of the odd numbers is: " + sumc);
- int max = Math.Max(suma, sumb);
- if (max > sumc)
- {
- Console.WriteLine("The highest sum is: " + max);
- }
- else
- {
- Console.WriteLine("The highest sum is: " + sumc);
- }
- //uslovie 3
- for (int i = 0; i <n; i++)
- {
- C[i] = (int)Math.Pow(A[i], 2 * (i + 1) - 1) * (int)Math.Pow(B[i], 2 * (i + 1));
- }
- for (int i = 0; i < n; i++)
- {
- Console.WriteLine(C[i]);
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement