Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- using System;
- using System.Collections.Generic;
- using System.Linq;
- using System.Text;
- using System.Collections;
- namespace oraimunka
- {
- class Program
- {
- static int maxkereses(int[,] tomb, int elemszam)
- {
- int max = 0;
- for (int i = 0; i < elemszam; i++)
- {
- if (tomb[i, 1] > max)
- {
- max = tomb[i, 1];
- }
- }
- return max;
- }
- static bool isprime(int szam)
- {
- int count = 0;
- if (szam < 0)
- {
- szam = -szam;
- }
- if (szam < 2)
- {
- return false;
- }
- else if (szam == 2)
- {
- return true;
- }
- else
- {
- for (int i = 2; i < szam; i++)
- {
- if (szam % i != 0)
- {
- count++;
- }
- }
- if (count == szam - 2)
- {
- return true;
- }
- else
- {
- return false;
- }
- }
- }
- static int osztokszama(int szam)
- {
- int db = 0;
- for (int i = 1; i <= szam; i++)
- {
- if (szam % i == 0)
- {
- db++;
- }
- }
- return db;
- }
- static void tombfeltoltes(int[,] tomb, int elsoelem, int utolsoelem, int elemszam, bool prime, Random vel)
- {
- bool talal;
- if (elsoelem > utolsoelem)
- {
- int cs;
- cs = elsoelem;
- elsoelem = utolsoelem;
- utolsoelem = cs;
- }
- if (elemszam < 2)
- {
- elemszam = utolsoelem - elsoelem + 1;
- }
- if (prime == true)
- {
- do
- {
- tomb[0, 0] = vel.Next(elsoelem, utolsoelem + 1);
- } while (!isprime(tomb[0, 0]));
- }
- else
- {
- tomb[0, 0] = vel.Next(elsoelem, utolsoelem + 1);
- }
- for (int i = 1; i < elemszam; i++)
- {
- do
- {
- talal = false;
- if (prime == true)
- {
- do
- {
- tomb[i, 0] = vel.Next(elsoelem, utolsoelem + 1);
- } while (!isprime(tomb[i, 0]));
- }
- else
- {
- tomb[i, 0] = vel.Next(elsoelem, utolsoelem + 1);
- }
- for (int j = 0; j < i; j++)
- {
- if (tomb[j, 0] == tomb[i, 0])
- {
- talal = true;
- }
- }
- } while (talal);
- }
- }
- static void Main(string[] args)
- {
- int elemszam = 10;
- int db = 0, pr = 0, db2 = 0;
- int[,] tomb = new int[elemszam, 2];
- Random vel = new Random();
- for (int j = 0; j < 10; j++)
- {
- db = 0;
- pr = 0;
- tombfeltoltes(tomb, 10, 99, elemszam, false, vel);
- Console.WriteLine("A generált számok:");
- for (int i = 0; i < elemszam; i++)
- {
- Console.Write("{0}\t", tomb[i, 0]);
- if (tomb[i, 0] % 2 == 0)
- {
- db++;
- }
- if (isprime(tomb[i, 0]))
- {
- pr++;
- }
- }
- Console.WriteLine();
- Console.WriteLine("A páros számok száma: {0}", db);
- Console.WriteLine("A prímek száma: {0}", pr);
- Console.WriteLine("A generált számok osztóinak darabszáma számonként:");
- for (int i = 0; i < elemszam; i++)
- {
- tomb[i, 1] = osztokszama(tomb[i, 0]);
- Console.Write("{0}\t", osztokszama(tomb[i, 0]));
- }
- Console.WriteLine();
- Console.WriteLine("Ezek közül a legnagyobb elem: {0}", maxkereses(tomb, 10));
- for (int k = 2; k <= maxkereses(tomb, elemszam); k++)
- {
- db2 = 0;
- for(int l = 0; l < elemszam; l++)
- {
- if(k == tomb[l, 1])
- {
- db2++;
- }
- }
- if (db2 > 0)
- {
- Console.Write("{0} osztója van a következő szám(ok)nak: ", k);
- }
- for(int i = 0; i< elemszam; i++)
- {
- if(tomb[i, 1] == k)
- {
- Console.Write("{0} ", tomb[i, 0]);
- }
- }
- if(db2 > 0)
- {
- Console.WriteLine();
- }
- }
- Console.WriteLine();
- }
- Console.ReadKey();
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement