Add homework 3

Author: 1Git2Clone

Cargo.lock

@@ -4,6 +4,7 @@ version = "0.1.0"
 edition = "2021"
 
 [dependencies]
+katexit = "0.1.4"
 num-traits = "0.2.19"
 
 [features]
@@ -19,3 +20,7 @@ hw1-task-3 = []
 hw2-task-1 = []
 hw2-task-2 = []
 hw2-task-3 = []
+# ---
+# Homework 3
+# ---
+hw3-task-1 = []

Cargo.toml

@@ -29,7 +29,7 @@ algorithm](https://en.wikipedia.org/wiki/Euclidean_algorithm).
 - [x] [Task 3](https://www.hackerrank.com/contests/citb106-f2024-hw1/challenges/discrete-mathematics-and-programming-hw-1-task-3)
       ([src](./src/hw1/task_3.rs))
 
-## [Homework 2](https://www.hackerrank.com/contests/citb106-f2024-hw1/challenges)
+## [Homework 2](https://www.hackerrank.com/contests/citb106-f2024-hw2/challenges)
 
 <!-- prettier-ignore -->
 - *23/11/2024*
@@ -39,4 +39,13 @@ algorithm](https://en.wikipedia.org/wiki/Euclidean_algorithm).
 - [x] [Task 2](https://www.hackerrank.com/contests/citb106-f2024-hw2/challenges/discrete-mathematics-and-programming-hw-2-task-2)
       ([src](./src/hw2/task_2.rs))
 - [x] [Task 3](https://www.hackerrank.com/contests/citb106-f2024-hw2/challenges/discrete-mathematics-and-programming-hw-2-task-3)
-      ([src](./src/hw2/task_3.rs))
+      ([src](./src/hw2/task_3.rs))
+
+## [Homework 3](https://www.hackerrank.com/contests/citb106-f2024-hw3/challenges)
+
+<!-- prettier-ignore -->
+- *30/11/2024*
+
+- [x] [Task 1](https://www.hackerrank.com/contests/citb106-f2024-hw2/challenges/discrete-mathematics-and-programming-hw-2-task-1)
+      ([src](./src/hw3/task_1.rs))
+

README.md

@@ -0,0 +1 @@
+pub mod task_1;

src/hw3/mod.rs

@@ -0,0 +1,150 @@
+use crate::utils::{
+    gcd::ExtendedGcd,
+    input::{get_numeric_input, invalid_input, no_solution},
+    Error,
+};
+
+const MIN: i32 = 1;
+const MAX: i32 = 100;
+
+#[cfg_attr(doc, katexit::katexit)]
+/// # HOMEWORK 3 | TASK 1
+///
+/// ## Input
+///
+/// 1. Three numbers (`a`, `b` and `c`).
+///
+/// ### Constaints
+///
+/// 2. The input should be in the inclusive range of: `[1;100]`.
+///
+/// ### Output
+///
+/// The values of `x` and `y` separated by new lines based on the Bezout's identity formula[1]:
+///
+/// $$
+/// (a \times{x} + b \times{y}) \bmod{c} = 0
+/// $$
+///
+///
+/// [1]: https://en.wikipedia.org/wiki/B%C3%A9zout's_identity#Structure_of_solutions
+///
+/// ### Samples
+///
+/// #### Input Format
+///
+/// ```txt
+/// 30
+/// 18
+/// 6
+/// ```
+///
+/// #### Output Format
+///
+/// ```txt
+/// -1
+/// 2
+/// ```
+///
+/// #### Input Format
+///
+/// ```txt
+/// 30
+/// 18
+/// 4
+/// ```
+///
+/// #### Output Format
+///
+/// ```txt
+/// No solution!
+/// ```
+///
+/// #### Explanation
+///
+/// (30, 18) = 6 => 6 % 4 != 0
+///
+/// #### Input Format
+///
+/// ```txt
+/// 101
+/// 25
+/// 9
+/// ```
+///
+/// #### Output Format
+///
+/// ```txt
+/// Invalid input data!
+/// ```
+///
+/// ### Error
+///
+/// If the input is invalid, return:
+///
+/// ```rust
+/// String::from("Invalid input data!");
+/// ```
+///
+/// If there's no solution, return:
+///
+/// ```rust
+/// String::from("No solution!");
+/// ```
+///
+/// ## Test cases
+///
+/// ```rust
+/// use hackerrank::hw3::task_1::Solution;
+///
+/// assert_eq!(
+///     Solution::main(30, 18, 6),
+///     String::from("-1\n2")
+/// );
+/// assert_eq!(
+///     Solution::main(30, 18, 4),
+///     String::from("No solution!")
+/// );
+/// assert_eq!(
+///     Solution::main(101, 25, 9),
+///     String::from("Invalid input data!")
+/// );
+/// assert_eq!(
+///     Solution::main(100, 50, 100),
+///     String::from("0\n2")
+/// );
+/// assert_eq!(
+///     Solution::main(99, 33, 66),
+///     String::from("0\n2")
+/// );
+/// ```
+pub struct Solution;
+
+impl Solution {
+    pub fn main(a: i32, b: i32, c: i32) -> String {
+        if [a, b, c].iter().any(|item| !(MIN..=MAX).contains(item)) {
+            return invalid_input();
+        }
+        let ((mut x, mut y), d) = a.extended_gcd(b);
+
+        if c % d != 0 {
+            return no_solution();
+        }
+
+        let scale_to_c = c / d;
+        x *= scale_to_c;
+        y *= scale_to_c;
+
+        format!("{}\n{}", x, y)
+    }
+}
+
+pub fn main() -> Result<(), Error> {
+    let a = get_numeric_input::<i32>()?;
+    let b = get_numeric_input::<i32>()?;
+    let c = get_numeric_input::<i32>()?;
+
+    println!("{}", Solution::main(a, b, c));
+
+    Ok(())
+}

src/hw3/task_1.rs

@@ -3,4 +3,5 @@
 
 pub mod hw1;
 pub mod hw2;
+pub mod hw3;
 pub mod utils;

src/lib.rs

@@ -1,5 +1,6 @@
 mod hw1;
 mod hw2;
+mod hw3;
 
 mod utils;
 use utils::Error;
@@ -42,5 +43,12 @@ fn main() -> Result<(), Error> {
         HW_2[Task::Task3 as usize]()?;
     }
 
+    #[cfg(feature = "hw3-task-1")]
+    {
+        const HW_3: [fn() -> Result<(), Error>; 1] = [hw3::task_1::main];
+
+        HW_3[Task::Task1 as usize]()?;
+    }
+
     Ok(())
 }

src/main.rs

@@ -43,10 +43,36 @@ where
     }
 }
 
+/// Implemented based on this implementation[1].
+///
+/// [1]: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm#Pseudocode
+pub trait ExtendedGcd: Gcd {
+    /// Returns: (Self::BezoutCoefficient, Self::Gcd)
+    /// where:
+    /// - Self::BezoutCoefficient = (Self, Self)
+    /// - Self::Gcd = Self
+    fn extended_gcd(self, other: Self) -> ((Self, Self), Self) {
+        let (mut prev_r, mut r) = (self, other);
+        let (mut prev_s, mut s) = (Self::one(), Self::zero());
+        let (mut prev_t, mut t) = (Self::zero(), Self::one());
+
+        let mut q;
+        while r != Self::zero() {
+            q = prev_r / r;
+            (prev_r, r) = (r, prev_r - q * r);
+            (prev_s, s) = (s, prev_s - q * s);
+            (prev_t, t) = (t, prev_t - q * t);
+        }
+
+        ((prev_s, prev_t), prev_r)
+    }
+}
+
 macro_rules! gcd_impl {
     ($name:ident for $($x:ty)*) => ($(
         impl $name for $x {}
     )*)
 }
 
 gcd_impl!(Gcd for i8 i16 i32 i64 i128 isize u8 u16 u32 u64 u128 usize);
+gcd_impl!(ExtendedGcd for i8 i16 i32 i64 i128 isize u8 u16 u32 u64 u128 usize);

src/utils/gcd.rs

@@ -19,6 +19,12 @@ where
     Ok(tmp.trim().parse::<T>().unwrap())
 }
 
+#[must_use = "This function returns the 'Invalid input data!' value used for asserting tests."]
 pub fn invalid_input() -> String {
     String::from("Invalid input data!")
 }
+
+#[must_use = "This function returns the 'No solution!' value used for asserting tests."]
+pub fn no_solution() -> String {
+    String::from("No solution!")
+}