public static int AcademySt (Queue<Student> q, int code)
Queue<Student> tmp = new Queue<Student>();
if (item.GetCode() == code)
public static int MaxSt (Queue<Student> q)
code = q.Head().GetCode();
numSt = AcademySt(q,code);
public static int Size (Queue<int> q)
Queue<int> tmp = new Queue<int>();
public static bool IsRangeQ (Queue<int> q)
Queue<int> tmp = new Queue<int>();
for (int i=2; i<=len-1; i++)
if (num <= first || num >= last)
public static int LastItemQ (Queue<int> q)
Queue<int> tmp = new Queue<int>();
for (int i=1; i<=len-1; i++)
public static Node<Triad> CreateNodeTriad (Node<Queue<int>> ls)
Node<Triad> tr = new Node<Triad> (new Triad (-1,-1,-1));
Queue<int> tmpQ = ls.GetValue();
bool ans = IsRangeQ(tmpQ);
int last = LastItemQ(tmpQ);
Triad item = new Triad (first,last,place);
pos.SetNext(new Node<Traid>(item));
public static void Main (string[] args)
Console.WriteLine("Hello World");
Node<T> temp = new Node<T>(x);
T x=this.first.GetValue();
this.first=this.first.GetNext();
return this.first.GetValue();
public override String ToString ()
Node<T> pos = this.first;
str=str+pos.GetValue().ToString();
public Node (T value, Node<T> next)
public void SetValue (T value)
public void SetNext(Node<T> next)
return this.next != null;
public override String ToString()
return this.value.ToString();