Seminar I [Link].

Cozi
using
using
using
using
using

System;
[Link];
[Link];
[Link];
[Link];

namespace sem1
{
class Program
{
static Queue<int> queue;
static void Main()
{
queue = new Queue<int>();
do
{
[Link]();
[Link]("0: Exit, 1: Add, 2: Delete --> ");
switch ([Link]([Link]()))
{
case 1: [Link]("el=");
int x = [Link]([Link]());
[Link](x);
afis();
break;
case 2: [Link]();
afis();
break;
case 0: return;
}

}
while (true);

}
static private void afis()
{
int[] array = new int[[Link]];
[Link](array, 0);
[Link]("Array:");
for (int i = 0; i < [Link]; i++)
{
[Link](" " + array[i]);
}
[Link]();
}
}

Seminar II [Link] App trenuri

System;
[Link];
[Link];
[Link];
[Link];

namespace sem2
{
class Program
{
static void Main(string[] args)
{
int nrv = 0;
//coada
Queue<vagon> tren2 = new Queue<vagon>();
//stiva
Stack<vagon> tren3 = new Stack<vagon>();
[Link]("Citire date tren:");
nrv = [Link]([Link]());
vagon[] tren1 = new vagon[nrv];
// citire
for (int i = 0; i < nrv; i++)
{
tren1[i] = new vagon();
tren1[i].citire();
}
//afisare tren initial
for (int i = 0; i < nrv; i++)
{
[Link](tren1[i].ToString());
}
//triaj tren initial dupa clasa
for (int i = 0; i < nrv; i++)
{
if (tren1[i].clasa == 'I')
[Link](tren1[i]);
else [Link](tren1[i]);
}
//adaugare vagoane clasa a doua
foreach (vagon v in tren3)
{
[Link]([Link]());
}
//afisare tren cu structura finala
foreach (vagon v in tren2)
{
[Link]([Link]());
}
}
class vagon
{
public int id;
public char clasa;
public void citire()
{

[Link]("Introduceti vagonul:");
[Link] = [Link]([Link]());
[Link]("Introduceti clasa vagonul:");
[Link] = [Link]([Link]());
}
public override string ToString()
{
return "[" + [Link] + "," + [Link] + "]";
}
}

Seminar III Sortarea topologica. Grafuri. Noduri

using
using
using
using
using
using

System;
[Link];
[Link];
[Link];
[Link];
[Link];

namespace ConsoleApplication1
{
class Program
{
static void Main(string[] args)
{
string[]linii = [Link]("[Link]");
int n = [Link] (linii[0]);
int[] pred = new int[n];
List<int>[]succ= new List<int>[n];
for (int i = 0; i < n; i++)
{ succ[i] = new List<int>();
}
for(int i=1; i<[Link]; i++)
{
string[] atom = linii[i].Split(',');
int p = [Link](atom[0]);
int s = [Link](atom[1]);
pred[s]++;
succ[p].Add(s);
}
for(int it=0; it<n; it++)
{
for (int i = 0; i < n; i++)
if (pred[i] == 0)
{
[Link](i);
pred[i] = -1;
foreach (int s in succ[i])
pred[s]--;
}
}

}
}

Seminar IV [Link] Sort App task-urilor

using System;
using [Link];
using [Link];
using [Link];
using [Link];
using [Link];
namespace ConsoleApplication1
{
class Program
{
static void Main(string[] args)
{
string [] linii = [Link]("[Link]");
int[] v = new int [[Link]];
for (int i = 0; i < [Link]; i++)
v[i] = [Link](linii[i]);
[Link](v, descrescator);
int m;
[Link]("m = "); m=[Link]([Link]());
int[] T = new int [m];
for (int i = 0; i < [Link]; i++)
{
int imin = 0;
for (int j = 1; j < m; j++)
if (T[imin] > T[j])
imin = j;
[Link]("Task-ul {0} a fost alocat angajatului {1}", i,imin );
T[imin] += i;
foreach (int j in T)
[Link](j + " ");
[Link]();
}
[Link]();
}
static int descrescator(int x, int y)
{
return -[Link](y);
}
}
}

Seminar V Greedy App rucsac

using
using
using
using
using
using

System;
[Link];
[Link];
[Link];
[Link];
[Link];

namespace ConsoleApplication1
{
class Program
{
static void Main(string[] args)
{
float G;//capacitate rucsac
//
, AC, AG; //auxiliare pentru creare obiecte : castig, greutate
//int optiune,
// k = 0; // contor
List<Obiect> rucsac = new List<Obiect>();
String[] lines = [Link]("[Link]");
foreach (String line in lines)
{
[Link](new Obiect(line));
}
do
{
[Link]("Care este capacitatea rucsacului ?");
G = Convert.ToInt32([Link]());
if (G < 0) [Link]("Greutate gresita ! ");
} while (G < 0);
//optiune = 1;
//do
//{
// [Link]("Doriti sa introduceti un obiect nou ? 1 = DA, 0 = NU");
// optiune = Convert.ToInt32([Link]());
// if (optiune == 1)
// {
//
[Link]("Care este greutatea obiectului ?");
//
AG = Convert.ToInt32([Link]());
//
[Link]("Care este castigul obtinut in urma vanzarii obiectului ?");
//
AC = Convert.ToInt32([Link]());
//
if ((AG > 0) && (AC > 0))
//
{
//
[Link](new Obiect(AG, AC));
//
}
// }
//} while (optiune == 1);
[Link]();
int i = 0;
[Link]("Am adaugat obiectele : ");
while (G > 0 && i < [Link])
{
if (G > rucsac[i].G)
{
G -= rucsac[i].G;
[Link](rucsac[i]);
}

else
{
[Link](rucsac[i] + "-" + (G / rucsac[i].G * 100) + "%");
G = 0;
}
i++;
}
//[Link](">> " + [Link](G)+ " <<");

}
using
using
using
using
using

System;
[Link];
[Link];
[Link];
[Link];

namespace ConsoleApplication1
{
class Obiect:IComparable<Obiect>
{
int _id;
float _g // Greutate obiect
, _c // Castig obtinut in urma vanzarii obiectului, dupa ce este adaugat in rucsac
, _r; // Rentabilitate ( c / g )
public float G
{
get { return _g; }
}
public float C
{
get { return _c; }
}
public float ID
{
get { return _id; }
}
public float R
{
get { return _r; }
}
public Obiect()
{
_g = -1;
_c = -1;
_r = -1;
}
public Obiect(float g, float c)
{
_g = g;
_c = c;

if (g != 0)
_r = c / g;
else _r = -1;

public Obiect(String line)

Seminar V App Sierpinski

System;
[Link];
[Link];
[Link];

using
using
using
using
using

[Link];
[Link];
[Link];
[Link];
[Link];

namespace WindowsFormsApplication1
{
public partial class Form1 : Form
{ Graphics G;
public Form1()
{
InitializeComponent();
G = [Link]();
}
void srp(int n, Point a, Point b, Point c, int r, int g, int bl)
{
if (n > 0)
{
Point ma = new Point((b.X + c.X) / 2, (b.Y + c.Y) / 2);
Point mb = new Point((c.X + a.X) / 2, (c.Y + a.Y) / 2);
Point mc = new Point((b.X + a.X) / 2, (b.Y + a.Y) / 2);
srp(n - 1, a, mc, mb,r/2,g,bl);
srp(n - 1, mc, b, ma,r,g/2, bl);
srp(n - 1, mb, ma, c, r, g, bl/2);
}
else
{
Point[]p={a,b,c};
Color col= [Link](255, r, g, bl);
SolidBrush br = new SolidBrush(col);
[Link](br, p);
}
}
private void Form1_Paint(object sender, PaintEventArgs e)
private void comboBox1_SelectedIndexChanged(object sender, EventArgs e)
{
Refresh();
srp([Link], new Point([Link]/2, 0), new Point(0,
[Link]-1), new Point([Link], [Link]-1),255,255,255);
}
private void pictureBox1_Click(object sender, EventArgs e)
{
}
}