Skip to content

Кавлинов Тенгис БИВТ-25-12 Белая #116

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Tengiskka wants to merge 9 commits into
base: KavlinovTS
Choose a base branch
from
Open

Кавлинов Тенгис БИВТ-25-12 Белая #116

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
9 commits
Select commit Hold shift + click to select a range
af0a491
Add files via upload
NemirovichMark Mar 10, 2026
2201215
Update Task5.cs
NemirovichMark Mar 26, 2026
c23e6f4
Update Task3.cs
NemirovichMark Mar 26, 2026
2e71294
Update Task1.cs
Tengiskka Apr 7, 2026
fa6d882
Update Task2.cs
Tengiskka Apr 7, 2026
303e32c
Update Task3.cs
Tengiskka Apr 7, 2026
77c5822
Update Task4.cs
Tengiskka Apr 7, 2026
1f7ff5f
Update Task5.cs
Tengiskka Apr 7, 2026
88676b7
Update Task5.cs
NemirovichMark Apr 12, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
196 changes: 195 additions & 1 deletion Lab8/White/Task1.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,5 +2,199 @@ namespace Lab8.White
{
public class Task1
{
public class Participant
{
//Поля
private string _surname;
private string _club;
private double _firstjump;
private double _secondjump;

//Статические поля
private static int _jumpers;
private static int _disqualified;
private static double _standard;

//Свойства
public string Surname => _surname;
public string Club => _club;
public double FirstJump => _firstjump;
public double SecondJump => _secondjump;
public double JumpSum => _firstjump + _secondjump;

//Статические свойства
public static int Jumpers => _jumpers;
public static int Disqualified => _disqualified;

//Конструктор
public Participant(string surname, string club)
{
_surname = surname;
_club = club;
_firstjump = 0;
_secondjump = 0;
_jumpers++;
}
//Статический конструктор
static Participant()
{
_jumpers = 0;
_disqualified = 0;
_standard = 5;
}
//Методы
public void Jump(double result)
{
if (_firstjump == 0) _firstjump = result; //если первый прыжок ещё не задан
else if (_secondjump == 0) _secondjump = result; //иначе если второй ещё не задан
}

public static void Disqualify(ref Participant[] participants)
{
if (participants == null || participants.Length == 0) return;
int count = 0;
for (int i = 0; i < participants.Length; i++)
{
if (participants[i].FirstJump >= _standard && participants[i].SecondJump >= _standard) count++;
else
{
_disqualified++;
_jumpers--;
}
}
//Создаём массив только для квалифицированных участников
Participant[] parti = new Participant[count];
int s = 0;

for (int i = 0; i < participants.Length; i++)
{
if (participants[i].FirstJump >= _standard && participants[i].SecondJump >= _standard)
{
parti[s] = participants[i];
s++;
}
}
//Заменяем исходный массив новым
participants = parti;
}

//Пузырьком сортируем массив участников по убыванию суммы двух прыжков
public static void Sort(Participant[] array)
{
if (array == null || array.Length == 0) return;
for (int i = 0; i < array.Length; i++)
{
for (int j = 1; j < array.Length; j++)
{
if (array[j - 1].JumpSum < array[j].JumpSum)
{
(array[j - 1], array[j]) = (array[j], array[j - 1]);
}
}

}
}
public void Print()
{
return;
}
}
}
}
public class Participant
{
//Поля
private string _surname;
private string _club;
private double _firstjump;
private double _secondjump;

//Статические поля
private static int _jumpers;
private static int _disqualified;
private static double _standard;

//Свойства
public string Surname => _surname;
public string Club => _club;
public double FirstJump => _firstjump;
public double SecondJump => _secondjump;
public double JumpSum => _firstjump + _secondjump;

//Статические свойства
public static int Jumpers => _jumpers;
public static int Disqualified => _disqualified;

//Конструктор
public Participant(string surname, string club)
{
_surname = surname;
_club = club;
_firstjump = 0;
_secondjump = 0;
_jumpers++;
}
//Статический конструктор
static Participant()
{
_jumpers = 0;
_disqualified = 0;
_standard = 5;
}
//Методы
public void Jump(double result)
{
if (_firstjump == 0) _firstjump = result; //если первый прыжок ещё не задан
else if (_secondjump == 0) _secondjump = result; //иначе если второй ещё не задан
}

public static void Disqualify(ref Participant[] participants)
{
if (participants == null || participants.Length == 0) return;
int count = 0;
for (int i = 0; i < participants.Length; i++)
{
if (participants[i].FirstJump >= _standard && participants[i].SecondJump >= _standard) count++;
else
{
_disqualified++;
_jumpers--;
}
}
//Создаём массив только для квалифицированных участников
Participant[] parti = new Participant[count];
int s = 0;

for (int i = 0; i < participants.Length; i++)
{
if (participants[i].FirstJump >= _standard && participants[i].SecondJump >= _standard)
{
parti[s] = participants[i];
s++;
}
}
//Заменяем исходный массив новым
participants = parti;
}

//Пузырьком сортируем массив участников по убыванию суммы двух прыжков
public static void Sort(Participant[] array)
{
if (array == null || array.Length == 0) return;
for (int i = 0; i < array.Length; i++)
{
for (int j = 1; j < array.Length; j++)
{
if (array[j - 1].JumpSum < array[j].JumpSum)
{
(array[j - 1], array[j]) = (array[j], array[j - 1]);
}
}

}
}
public void Print()
{
return;
}
}
}
107 changes: 106 additions & 1 deletion Lab8/White/Task2.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,5 +2,110 @@ namespace Lab8.White
{
public class Task2
{
public class Participant
{
//Поля
private string _name;
private string _surname;
private double _firstjump;
private double _secondjump;

//Статическое поле, где значение задается один раз и не может быть изменено
private static readonly double _standard;

//Свойства
public string Name => _name;
public string Surname => _surname;
public double FirstJump => _firstjump;
public double SecondJump => _secondjump;


public double BestJump
{
get
{
if (_firstjump == 0 && _secondjump == 0) return 0; //нет ни одного прыжка
else if (_firstjump != 0 && _secondjump == 0) return FirstJump; //только первый прыжок
else if (_secondjump != 0 && _firstjump == 0) return SecondJump; //только второй прыжок
else return Math.Max(_firstjump, _secondjump); //максимум, если есть оба
}
}
//Свойство, прошёл ли участник норматив
public bool IsPassed
{
get
{
return BestJump >= _standard;
}
}
//Статический конструктор
static Participant()
{
_standard = 3.0; //норматив
}
//Конструктор
public Participant(string name, string surname)
{
_name = name;
_surname = surname;
_firstjump = 0;
_secondjump = 0;
}
//Конструктор для результатов сразу двух прыжков
public Participant(string name, string surname, double firstjump, double secondjump)
{
_name = name;
_surname = surname;
_firstjump = firstjump;
_secondjump = secondjump;
}
//Методы
public static Participant[] GetPassed(Participant[] participants)
{
//Защита от null/пустого массива (возвращаем пустой массив)
if (participants == null || participants.Length == 0) return new Participant[0];
// Подсчёт количества прошедших норматив
int s = 0;
for (int i = 0; i < participants.Length; i++)
{
if (participants[i].IsPassed) s++;
}
//Создаем новый массив нужного размера
Participant[] result = new Participant[s];
int x = 0;
for (int i = 0; i < participants.Length; i++)
{
if (participants[i].IsPassed)
{
result[x++] = participants[i];
}
}
return result;
}
public void Jump(double result)
{
if (_firstjump == 0) _firstjump = result; //если первый прыжок ещё не задан
else if (_secondjump == 0) _secondjump = result; //иначе если второй ещё не задан
}
//Сортируем массив участников по убыванию лучшего прыжка
public static void Sort(Participant[] array)
{
if (array == null || array.Length == 0) return;
for (int i = 0; i < array.Length; i++)
{
for (int j = 1; j < array.Length; j++)
{
if (array[j - 1].BestJump < array[j].BestJump)
{
(array[j - 1], array[j]) = (array[j], array[j - 1]);
}
}
}
}
public void Print()
{
return;
}
}
}
}
}
Loading
Loading