Skip to content

Update White Лю Цзунхань БИВТ-25-9 Белая лига.cs #573

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

Closed
Liuzonghan123 wants to merge 1 commit into from
Closed

Update White Лю Цзунхань БИВТ-25-9 Белая лига.cs #573

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
80 changes: 73 additions & 7 deletions Lab1/White.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,7 +7,10 @@ public bool Task1(double d)
bool answer = false;

// code here

if (d > 0)
{
answer = true;
}
// end

return answer;
Expand All @@ -17,7 +20,10 @@ public bool Task2(int n)
bool answer = false;

// code here

if (n % 2 == 0)
{
answer = true;
}
// end

return answer;
Expand All @@ -27,17 +33,33 @@ public int Task3(int a, int b)
int answer = 0;

// code here

if (a > b)
{
answer = a;
}
else
{
answer = b;
}
// end

return answer;
}
public double Task4(double d, double f)
{

double answer = 0;

// code here

if (Math.Abs(d) > Math.Abs(f))
{
answer = f;
}
else
{
answer = d;
}
// end

return answer;
Expand All @@ -47,7 +69,14 @@ public double Task5(double x)
double answer = 0;

// code here

if (Math.Abs(x) > 1)
{
answer = 1;
}
else
{
answer = x;
}
// end

return answer;
Expand All @@ -57,6 +86,11 @@ public bool Task6(double x, double y, double r)
bool answer = false;

// code here
double difference = Math.Abs(x * x + y * y - r * r);
if (difference <= 0.0001)
{
answer = true;
}

// end

Expand All @@ -68,7 +102,24 @@ public bool Task7(int n)
bool answer = false;

// code here

{


// 1. 计算 s = n^2
int s = n * n;

// 2. 第一个判断框: s - n > 2*n
if (s - n > 2 * n)
{
// 3. 第二个判断框: n 是否为偶数
if (n % 2 == 0)
{
answer = true;
}
}

return answer;
}
// end

return answer;
Expand All @@ -78,10 +129,25 @@ public bool Task8(double L, int T, int M)
bool answer = false;

// code here
// 条件1: 速度10海里/小时，时间不超过3小时 (L/10 <= 3)
bool isTimeValid = (L / 10.0) <= 3;

// end
// 条件2: 标志物(树+山)总数不少于5
bool areLandmarksEnough = (T + M) >= 5;

// 条件3: 山的数量必须是偶数
bool isMountainsEven = (M % 2 == 0);

// 必须同时满足所有条件
if (isTimeValid && areLandmarksEnough && isMountainsEven)
{
answer = true;
}

return answer;
}
// end


}
}
}
Loading