style: 🎨 cargo fmt
This commit is contained in:
Ahmet Kaan GÜMÜŞ
parent
7e2f12bea6
commit
a2d3b7b607
1 changed files with 269 additions and 342 deletions
611
src/main.rs
611
src/main.rs
|
|
@ -1,357 +1,284 @@
|
|||
use std::io;
|
||||
use rand::Rng;
|
||||
use std::io;
|
||||
|
||||
const PROCESS_COUNT:usize = 5;
|
||||
const RESOURCE_COUNT:usize = 3;
|
||||
const PROCESS_COUNT: usize = 5;
|
||||
const RESOURCE_COUNT: usize = 3;
|
||||
fn main() {
|
||||
println!("Hello, world!");
|
||||
|
||||
let mut restart:bool = true;
|
||||
while restart
|
||||
{
|
||||
println!("Max A Resource");
|
||||
let a:u8;
|
||||
let b:u8;
|
||||
let c:u8;
|
||||
let mut resource_input:String = String::new();
|
||||
if let Err(err_val) = io::stdin().read_line(&mut resource_input)
|
||||
{
|
||||
println!("Failed to Read: {}", err_val);
|
||||
return;
|
||||
}
|
||||
match resource_input.trim().parse::<u8>()
|
||||
{
|
||||
Ok(value) =>
|
||||
{
|
||||
a = value;
|
||||
}
|
||||
Err(err_val) =>
|
||||
{
|
||||
println!("Failed to Convert: {}", err_val);
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
println!("Max B Resource");
|
||||
let mut resource_input:String = String::new();
|
||||
if let Err(err_val) = io::stdin().read_line(&mut resource_input)
|
||||
{
|
||||
println!("Failed to Read: {}", err_val);
|
||||
return;
|
||||
}
|
||||
match resource_input.trim().parse::<u8>()
|
||||
{
|
||||
Ok(value) =>
|
||||
{
|
||||
b = value;
|
||||
}
|
||||
Err(err_val) =>
|
||||
{
|
||||
println!("Failed to Convert: {}", err_val);
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
println!("Max C Resource");
|
||||
let mut resource_input:String = String::new();
|
||||
if let Err(err_val) = io::stdin().read_line(&mut resource_input)
|
||||
{
|
||||
println!("Failed to Read: {}", err_val);
|
||||
return;
|
||||
}
|
||||
match resource_input.trim().parse::<u8>()
|
||||
{
|
||||
Ok(value) =>
|
||||
{
|
||||
c = value;
|
||||
}
|
||||
Err(err_val) =>
|
||||
{
|
||||
println!("Failed to Convert: {}", err_val);
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
println!("\n\tA = {}\n\tB = {}\n\tC = {}", a,b,c);
|
||||
if a == 0 || b == 0 || c == 0
|
||||
{
|
||||
println!("Exit: Zero as a Input Invalid");
|
||||
return;
|
||||
}
|
||||
|
||||
let mut max_needs_matrix = [[0_u8;RESOURCE_COUNT];PROCESS_COUNT];
|
||||
let mut assigned_resources_matrix = [[0_u8;RESOURCE_COUNT];PROCESS_COUNT];
|
||||
let mut info:(bool, Vec<u8>) = (false, Vec::with_capacity(PROCESS_COUNT));
|
||||
while !info.0
|
||||
{
|
||||
for i in 0..PROCESS_COUNT
|
||||
{
|
||||
let mut rng = rand::thread_rng();
|
||||
let random = rng.gen_range(0..a);
|
||||
max_needs_matrix[i][0] = random;
|
||||
if random != 0
|
||||
{
|
||||
assigned_resources_matrix[i][0] = rng.gen_range(0..random);
|
||||
}
|
||||
else
|
||||
{
|
||||
assigned_resources_matrix[i][0] = 0;
|
||||
}
|
||||
}
|
||||
for i in 0..PROCESS_COUNT
|
||||
{
|
||||
let mut rng = rand::thread_rng();
|
||||
let random = rng.gen_range(0..b);
|
||||
max_needs_matrix[i][1] = random;
|
||||
if random != 0
|
||||
{
|
||||
assigned_resources_matrix[i][1] = rng.gen_range(0..random);
|
||||
}
|
||||
else
|
||||
{
|
||||
assigned_resources_matrix[i][1] = 0;
|
||||
}
|
||||
}
|
||||
for i in 0..PROCESS_COUNT
|
||||
{
|
||||
let mut rng = rand::thread_rng();
|
||||
let random = rng.gen_range(0..c);
|
||||
max_needs_matrix[i][2] = random;
|
||||
if random != 0
|
||||
{
|
||||
assigned_resources_matrix[i][2] = rng.gen_range(0..random);
|
||||
}
|
||||
else
|
||||
{
|
||||
assigned_resources_matrix[i][2] = 0;
|
||||
}
|
||||
}
|
||||
info = banker(a, b, c, max_needs_matrix, assigned_resources_matrix);
|
||||
}
|
||||
println!("Max Needs Matrix");
|
||||
print_matrix(max_needs_matrix);
|
||||
println!("Assigned Resources Matrix");
|
||||
print_matrix(assigned_resources_matrix);
|
||||
let mut answers:[u8;PROCESS_COUNT] = [0;PROCESS_COUNT];
|
||||
for i in 0..PROCESS_COUNT
|
||||
{
|
||||
println!("Which Process Should be Done Now ?");
|
||||
let mut input = String::new();
|
||||
io::stdin().read_line(&mut input).unwrap();
|
||||
let input:u8 = input.trim().parse().unwrap();
|
||||
answers[i] = input;
|
||||
if info.1[i] == input
|
||||
{
|
||||
println!("Correct");
|
||||
}
|
||||
else
|
||||
{
|
||||
println!("Wrong it should be = {}", info.1[i]);
|
||||
}
|
||||
}
|
||||
println!("Your Answers");
|
||||
for i in 0..PROCESS_COUNT
|
||||
{
|
||||
println!("P{}", answers[i]);
|
||||
}
|
||||
println!("Correct Answers");
|
||||
for i in 0..PROCESS_COUNT
|
||||
{
|
||||
println!("P{}", info.1[i]);
|
||||
}
|
||||
|
||||
|
||||
let mut resource_input:String = String::new();
|
||||
println!("Press 'r' to Restart");
|
||||
if let Err(err_val) = io::stdin().read_line(&mut resource_input)
|
||||
{
|
||||
println!("Failed to Read: {}", err_val);
|
||||
return;
|
||||
}
|
||||
resource_input = resource_input.trim().to_string();
|
||||
match resource_input.as_str()
|
||||
{
|
||||
"r" =>
|
||||
{
|
||||
restart = true;
|
||||
println!("-------------------------------");
|
||||
}
|
||||
_ =>
|
||||
{
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
let mut restart: bool = true;
|
||||
while restart {
|
||||
println!("Max A Resource");
|
||||
let a: u8;
|
||||
let b: u8;
|
||||
let c: u8;
|
||||
let mut resource_input: String = String::new();
|
||||
if let Err(err_val) = io::stdin().read_line(&mut resource_input) {
|
||||
println!("Failed to Read: {}", err_val);
|
||||
return;
|
||||
}
|
||||
match resource_input.trim().parse::<u8>() {
|
||||
Ok(value) => {
|
||||
a = value;
|
||||
}
|
||||
Err(err_val) => {
|
||||
println!("Failed to Convert: {}", err_val);
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
println!("Max B Resource");
|
||||
let mut resource_input: String = String::new();
|
||||
if let Err(err_val) = io::stdin().read_line(&mut resource_input) {
|
||||
println!("Failed to Read: {}", err_val);
|
||||
return;
|
||||
}
|
||||
match resource_input.trim().parse::<u8>() {
|
||||
Ok(value) => {
|
||||
b = value;
|
||||
}
|
||||
Err(err_val) => {
|
||||
println!("Failed to Convert: {}", err_val);
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
println!("Max C Resource");
|
||||
let mut resource_input: String = String::new();
|
||||
if let Err(err_val) = io::stdin().read_line(&mut resource_input) {
|
||||
println!("Failed to Read: {}", err_val);
|
||||
return;
|
||||
}
|
||||
match resource_input.trim().parse::<u8>() {
|
||||
Ok(value) => {
|
||||
c = value;
|
||||
}
|
||||
Err(err_val) => {
|
||||
println!("Failed to Convert: {}", err_val);
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
println!("\n\tA = {}\n\tB = {}\n\tC = {}", a, b, c);
|
||||
if a == 0 || b == 0 || c == 0 {
|
||||
println!("Exit: Zero as a Input Invalid");
|
||||
return;
|
||||
}
|
||||
|
||||
let mut max_needs_matrix = [[0_u8; RESOURCE_COUNT]; PROCESS_COUNT];
|
||||
let mut assigned_resources_matrix = [[0_u8; RESOURCE_COUNT]; PROCESS_COUNT];
|
||||
let mut info: (bool, Vec<u8>) = (false, Vec::with_capacity(PROCESS_COUNT));
|
||||
while !info.0 {
|
||||
for i in 0..PROCESS_COUNT {
|
||||
let mut rng = rand::thread_rng();
|
||||
let random = rng.gen_range(0..a);
|
||||
max_needs_matrix[i][0] = random;
|
||||
if random != 0 {
|
||||
assigned_resources_matrix[i][0] = rng.gen_range(0..random);
|
||||
} else {
|
||||
assigned_resources_matrix[i][0] = 0;
|
||||
}
|
||||
}
|
||||
for i in 0..PROCESS_COUNT {
|
||||
let mut rng = rand::thread_rng();
|
||||
let random = rng.gen_range(0..b);
|
||||
max_needs_matrix[i][1] = random;
|
||||
if random != 0 {
|
||||
assigned_resources_matrix[i][1] = rng.gen_range(0..random);
|
||||
} else {
|
||||
assigned_resources_matrix[i][1] = 0;
|
||||
}
|
||||
}
|
||||
for i in 0..PROCESS_COUNT {
|
||||
let mut rng = rand::thread_rng();
|
||||
let random = rng.gen_range(0..c);
|
||||
max_needs_matrix[i][2] = random;
|
||||
if random != 0 {
|
||||
assigned_resources_matrix[i][2] = rng.gen_range(0..random);
|
||||
} else {
|
||||
assigned_resources_matrix[i][2] = 0;
|
||||
}
|
||||
}
|
||||
info = banker(a, b, c, max_needs_matrix, assigned_resources_matrix);
|
||||
}
|
||||
println!("Max Needs Matrix");
|
||||
print_matrix(max_needs_matrix);
|
||||
println!("Assigned Resources Matrix");
|
||||
print_matrix(assigned_resources_matrix);
|
||||
let mut answers: [u8; PROCESS_COUNT] = [0; PROCESS_COUNT];
|
||||
for i in 0..PROCESS_COUNT {
|
||||
println!("Which Process Should be Done Now ?");
|
||||
let mut input = String::new();
|
||||
io::stdin().read_line(&mut input).unwrap();
|
||||
let input: u8 = input.trim().parse().unwrap();
|
||||
answers[i] = input;
|
||||
if info.1[i] == input {
|
||||
println!("Correct");
|
||||
} else {
|
||||
println!("Wrong it should be = {}", info.1[i]);
|
||||
}
|
||||
}
|
||||
println!("Your Answers");
|
||||
for i in 0..PROCESS_COUNT {
|
||||
println!("P{}", answers[i]);
|
||||
}
|
||||
println!("Correct Answers");
|
||||
for i in 0..PROCESS_COUNT {
|
||||
println!("P{}", info.1[i]);
|
||||
}
|
||||
|
||||
let mut resource_input: String = String::new();
|
||||
println!("Press 'r' to Restart");
|
||||
if let Err(err_val) = io::stdin().read_line(&mut resource_input) {
|
||||
println!("Failed to Read: {}", err_val);
|
||||
return;
|
||||
}
|
||||
resource_input = resource_input.trim().to_string();
|
||||
match resource_input.as_str() {
|
||||
"r" => {
|
||||
restart = true;
|
||||
println!("-------------------------------");
|
||||
}
|
||||
_ => {
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
fn print_matrix(matrix:[[u8;RESOURCE_COUNT];PROCESS_COUNT])
|
||||
{
|
||||
for i in 0..5
|
||||
{
|
||||
print!("\n\t Process {}: ", i);
|
||||
for j in 0..3
|
||||
{
|
||||
if matrix[i][j] > 99
|
||||
{
|
||||
print!(" ");
|
||||
}
|
||||
else if matrix[i][j] > 9
|
||||
{
|
||||
print!(" ");
|
||||
}
|
||||
else
|
||||
{
|
||||
print!(" ");
|
||||
}
|
||||
print!("{}", matrix[i][j]);
|
||||
}
|
||||
println!();
|
||||
fn print_matrix(matrix: [[u8; RESOURCE_COUNT]; PROCESS_COUNT]) {
|
||||
for i in 0..5 {
|
||||
print!("\n\t Process {}: ", i);
|
||||
for j in 0..3 {
|
||||
if matrix[i][j] > 99 {
|
||||
print!(" ");
|
||||
} else if matrix[i][j] > 9 {
|
||||
print!(" ");
|
||||
} else {
|
||||
print!(" ");
|
||||
}
|
||||
print!("{}", matrix[i][j]);
|
||||
}
|
||||
println!();
|
||||
}
|
||||
}
|
||||
|
||||
fn banker(a:u8, b:u8, c:u8, max_needs_matrix:[[u8;RESOURCE_COUNT];PROCESS_COUNT], assigned_resources_matrix:[[u8;RESOURCE_COUNT];PROCESS_COUNT]) -> (bool, Vec<u8>)
|
||||
{
|
||||
let mut a_remaing:u8 = 0;
|
||||
let mut b_remaing:u8 = 0;
|
||||
let mut c_remaing:u8 = 0;
|
||||
let mut remaining_needs_matrix:[[u8;RESOURCE_COUNT];PROCESS_COUNT] = [[0;RESOURCE_COUNT];PROCESS_COUNT];
|
||||
for i in 0..PROCESS_COUNT
|
||||
{
|
||||
match a_remaing.checked_add(assigned_resources_matrix[i][0])
|
||||
{
|
||||
Some(result) =>
|
||||
{
|
||||
a_remaing = result;
|
||||
}
|
||||
None =>
|
||||
{
|
||||
return (false, vec![]);
|
||||
}
|
||||
}
|
||||
match b_remaing.checked_add(assigned_resources_matrix[i][1])
|
||||
{
|
||||
Some(result) =>
|
||||
{
|
||||
b_remaing = result;
|
||||
}
|
||||
None =>
|
||||
{
|
||||
return (false, vec![]);
|
||||
}
|
||||
}
|
||||
match c_remaing.checked_add(assigned_resources_matrix[i][2])
|
||||
{
|
||||
Some(result) =>
|
||||
{
|
||||
c_remaing = result;
|
||||
}
|
||||
None =>
|
||||
{
|
||||
return (false, vec![]);
|
||||
}
|
||||
}
|
||||
remaining_needs_matrix[i][0] = max_needs_matrix[i][0] - assigned_resources_matrix[i][0];
|
||||
remaining_needs_matrix[i][1] = max_needs_matrix[i][1] - assigned_resources_matrix[i][1];
|
||||
remaining_needs_matrix[i][2] = max_needs_matrix[i][2] - assigned_resources_matrix[i][2];
|
||||
fn banker(
|
||||
a: u8,
|
||||
b: u8,
|
||||
c: u8,
|
||||
max_needs_matrix: [[u8; RESOURCE_COUNT]; PROCESS_COUNT],
|
||||
assigned_resources_matrix: [[u8; RESOURCE_COUNT]; PROCESS_COUNT],
|
||||
) -> (bool, Vec<u8>) {
|
||||
let mut a_remaing: u8 = 0;
|
||||
let mut b_remaing: u8 = 0;
|
||||
let mut c_remaing: u8 = 0;
|
||||
let mut remaining_needs_matrix: [[u8; RESOURCE_COUNT]; PROCESS_COUNT] =
|
||||
[[0; RESOURCE_COUNT]; PROCESS_COUNT];
|
||||
for i in 0..PROCESS_COUNT {
|
||||
match a_remaing.checked_add(assigned_resources_matrix[i][0]) {
|
||||
Some(result) => {
|
||||
a_remaing = result;
|
||||
}
|
||||
if a_remaing > a || b_remaing > b || c_remaing > c
|
||||
{
|
||||
None => {
|
||||
return (false, vec![]);
|
||||
}
|
||||
a_remaing = a - a_remaing;
|
||||
b_remaing = b - b_remaing;
|
||||
c_remaing = c - c_remaing;
|
||||
let mut infinite_detection:u8 = 2;
|
||||
let mut done:[bool;PROCESS_COUNT] = [false;PROCESS_COUNT];
|
||||
let mut q:Vec<u8> = Vec::with_capacity(PROCESS_COUNT);
|
||||
while !done[0] || !done[1] || !done[2] || !done[3] || !done[4]
|
||||
{
|
||||
infinite_detection -= 1;
|
||||
|
||||
for i in 0..PROCESS_COUNT
|
||||
{
|
||||
if !done[i]
|
||||
{
|
||||
if a_remaing >= remaining_needs_matrix[i][0] && b_remaing >= remaining_needs_matrix[i][1] && c_remaing >= remaining_needs_matrix[i][2]
|
||||
{
|
||||
match a_remaing.checked_sub(remaining_needs_matrix[i][0])
|
||||
{
|
||||
Some(result) =>
|
||||
{
|
||||
a_remaing = result;
|
||||
}
|
||||
None =>
|
||||
{
|
||||
return (false , vec![]);
|
||||
}
|
||||
}
|
||||
match a_remaing.checked_add(max_needs_matrix[i][0])
|
||||
{
|
||||
Some(result) =>
|
||||
{
|
||||
a_remaing = result;
|
||||
}
|
||||
None =>
|
||||
{
|
||||
return (false, vec![]);
|
||||
}
|
||||
}
|
||||
match b_remaing.checked_sub(remaining_needs_matrix[i][1])
|
||||
{
|
||||
Some(result) =>
|
||||
{
|
||||
b_remaing = result;
|
||||
}
|
||||
None =>
|
||||
{
|
||||
return (false , vec![]);
|
||||
}
|
||||
}
|
||||
match b_remaing.checked_add(max_needs_matrix[i][1])
|
||||
{
|
||||
Some(result) =>
|
||||
{
|
||||
b_remaing = result;
|
||||
}
|
||||
None =>
|
||||
{
|
||||
return (false, vec![]);
|
||||
}
|
||||
}
|
||||
match c_remaing.checked_sub(remaining_needs_matrix[i][2])
|
||||
{
|
||||
Some(result) =>
|
||||
{
|
||||
c_remaing = result;
|
||||
}
|
||||
None =>
|
||||
{
|
||||
return (false , vec![]);
|
||||
}
|
||||
}
|
||||
match c_remaing.checked_add(max_needs_matrix[i][2])
|
||||
{
|
||||
Some(result) =>
|
||||
{
|
||||
c_remaing = result;
|
||||
}
|
||||
None =>
|
||||
{
|
||||
return (false, vec![]);
|
||||
}
|
||||
}
|
||||
done[i] = true;
|
||||
q.push(i as u8);
|
||||
infinite_detection = 2;
|
||||
}
|
||||
}
|
||||
}
|
||||
if infinite_detection == 0
|
||||
{
|
||||
return (false, q);
|
||||
}
|
||||
}
|
||||
match b_remaing.checked_add(assigned_resources_matrix[i][1]) {
|
||||
Some(result) => {
|
||||
b_remaing = result;
|
||||
}
|
||||
(true, q)
|
||||
}
|
||||
None => {
|
||||
return (false, vec![]);
|
||||
}
|
||||
}
|
||||
match c_remaing.checked_add(assigned_resources_matrix[i][2]) {
|
||||
Some(result) => {
|
||||
c_remaing = result;
|
||||
}
|
||||
None => {
|
||||
return (false, vec![]);
|
||||
}
|
||||
}
|
||||
remaining_needs_matrix[i][0] = max_needs_matrix[i][0] - assigned_resources_matrix[i][0];
|
||||
remaining_needs_matrix[i][1] = max_needs_matrix[i][1] - assigned_resources_matrix[i][1];
|
||||
remaining_needs_matrix[i][2] = max_needs_matrix[i][2] - assigned_resources_matrix[i][2];
|
||||
}
|
||||
if a_remaing > a || b_remaing > b || c_remaing > c {
|
||||
return (false, vec![]);
|
||||
}
|
||||
a_remaing = a - a_remaing;
|
||||
b_remaing = b - b_remaing;
|
||||
c_remaing = c - c_remaing;
|
||||
let mut infinite_detection: u8 = 2;
|
||||
let mut done: [bool; PROCESS_COUNT] = [false; PROCESS_COUNT];
|
||||
let mut q: Vec<u8> = Vec::with_capacity(PROCESS_COUNT);
|
||||
while !done[0] || !done[1] || !done[2] || !done[3] || !done[4] {
|
||||
infinite_detection -= 1;
|
||||
|
||||
for i in 0..PROCESS_COUNT {
|
||||
if !done[i] {
|
||||
if a_remaing >= remaining_needs_matrix[i][0]
|
||||
&& b_remaing >= remaining_needs_matrix[i][1]
|
||||
&& c_remaing >= remaining_needs_matrix[i][2]
|
||||
{
|
||||
match a_remaing.checked_sub(remaining_needs_matrix[i][0]) {
|
||||
Some(result) => {
|
||||
a_remaing = result;
|
||||
}
|
||||
None => {
|
||||
return (false, vec![]);
|
||||
}
|
||||
}
|
||||
match a_remaing.checked_add(max_needs_matrix[i][0]) {
|
||||
Some(result) => {
|
||||
a_remaing = result;
|
||||
}
|
||||
None => {
|
||||
return (false, vec![]);
|
||||
}
|
||||
}
|
||||
match b_remaing.checked_sub(remaining_needs_matrix[i][1]) {
|
||||
Some(result) => {
|
||||
b_remaing = result;
|
||||
}
|
||||
None => {
|
||||
return (false, vec![]);
|
||||
}
|
||||
}
|
||||
match b_remaing.checked_add(max_needs_matrix[i][1]) {
|
||||
Some(result) => {
|
||||
b_remaing = result;
|
||||
}
|
||||
None => {
|
||||
return (false, vec![]);
|
||||
}
|
||||
}
|
||||
match c_remaing.checked_sub(remaining_needs_matrix[i][2]) {
|
||||
Some(result) => {
|
||||
c_remaing = result;
|
||||
}
|
||||
None => {
|
||||
return (false, vec![]);
|
||||
}
|
||||
}
|
||||
match c_remaing.checked_add(max_needs_matrix[i][2]) {
|
||||
Some(result) => {
|
||||
c_remaing = result;
|
||||
}
|
||||
None => {
|
||||
return (false, vec![]);
|
||||
}
|
||||
}
|
||||
done[i] = true;
|
||||
q.push(i as u8);
|
||||
infinite_detection = 2;
|
||||
}
|
||||
}
|
||||
}
|
||||
if infinite_detection == 0 {
|
||||
return (false, q);
|
||||
}
|
||||
}
|
||||
(true, q)
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue