This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
use std::io; | |
fn main() { | |
const KILO_PER_POUND:f32 = 2.2; | |
const CALORIE_BURN_RATE:f32 = 0.0175; | |
println!("Input your weight in pounds: "); | |
let mut weight_in_pounds = String::new(); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// An implementation of BFS used for pathfinding on a graph in which all weights of a graph are of "1" | |
// Written by Patrick M. Howard | |
#include <iostream> | |
#include <vector> | |
#include <queue> | |
#include <algorithm> | |
using namespace std; | |
struct Node; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
$new_line ="--" * 20 | |
class Dnd | |
def initialize(die, times) | |
@die = die | |
@times = times | |
@dnd = {"d4" => 4, "d6" => 6, "d10" => 10, "d20" => 20, "d40" => 40} | |
end | |
def roll_dice() |