using System;
class minta
{
//tömb feltöltese
	static void feltolt(int[] x)
	{
		Random r = new Random();
		int i = 0;
		for(int hetek = 0; hetek < 6; hetek++)
		{
			x[i] = r.Next(5,15);
			i++;//hetfo
			x[i] = r.Next(8,18);
			i++;//kedd
			x[i] = r.Next(10,20);
			i++;//szerda
			x[i] = r.Next(8,18);
			i++;//csüt
			x[i] = r.Next(10,20);
			i++;//pentek
			x[i] = r.Next(5,15);
			i++;//szombat
			x[i] = r.Next(30,40);
			i++;//vasarnap
		}
		x[41] = 42;
	}//-----------------------------------------
//kiiratas
	static void kiir(int[] x)
	{
		for(int i = 0; i < x.Length; i++)
			Console.Write(x[i] + " ");
	}//-------------------------------------------------
//hetente osszegez
	static int[] summaz(int[] x)
	{

		int tindex = 0, sum;
		int[] y = new int[6];
		for(int i = 0; i < 6 && tindex < x.Length; i++)
		{
			sum = 0;
			for(int napok= 0; napok < 7 ; napok++)
			{
				sum += x[tindex];
				tindex++;
			}
		y[i] = sum;
		}
	return y;
	}//---------------------------------------------
//monoton nőtt?
	static bool monotone(int[] x)
	{
		int i =1;
		bool monoton = true;
		while(i < x.Length)
		{
			if(x[i-1] > x[i]) monoton = false;
			i++;
		}
		return monoton;
	}//-------------------------------------------------
//minimum keres
	static int fminimum(int[] x)
	{
		int minimum = x[0];
		for(int i = 1; i < x.Length; i++)
		{
			if(x[i] < minimum) minimum = x[i];
		}
		return minimum;
	}
	static void Main()
	{
	//tömb létrhozasa
	int[] t = new int[42];
	//int[] teszt = {1,2,9,4,5,6};
	feltolt(t);
	kiir(t);
	Console.WriteLine("\nHeti osszegzes: ");
	kiir(summaz(t));
	//Console.WriteLine(teszt.Length);
	if(monotone(summaz(t)))
		Console.WriteLine("Monoton");
	else
		Console.WriteLine("Nem monoton");
	// minimum kiras
	Console.WriteLine("A legkisebb tav: " + t[fminimum(t)] + "*" + fminimum(t));
	}
}