Brayden Zee BlueZeeKing

## us.json

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                BlueZeeKing
                / us.json
            
            
              Created
              February 15, 2022 00:04
            
          
        Loading

      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## days.json
[
 {
   "day": "Dark Chocolate Day",
   "position": [245, 280],
   "info": "This state eats the most chocolate",
   "date": 1
 },
 {
   "day": "Ground Hogs Day",
   "position": [800, 222],

## Share
https://prod.liveshare.vsengsaas.visualstudio.com/join?A7296FFFF82AB4D4C356FD0AB428808BF6B2

## aps-mock.json
[{"id":88024,"date":"2023-02-02T18:38:01","date_gmt":"2023-02-02T23:38:01","guid":{"rendered":"https:\/\/www.apsva.us\/?post_type=mat_alert&#038;p=88024"},"modified":"2023-02-02T18:38:01","modified_gmt":"2023-02-02T23:38:01","slug":"wakefield-high-school-will-be-closed-for-instruction-tomorrow-fri-feb-3-2023-we-will-keep-the-building-open-during-normal-hours-to-provide-counseling-services-and-mental-health-support-for-stu","status":"publish","type":"mat_alert","link":"https:\/\/www.apsva.us\/?mat_alert=wakefield-high-school-will-be-closed-for-instruction-tomorrow-fri-feb-3-2023-we-will-keep-the-building-open-during-normal-hours-to-provide-counseling-services-and-mental-health-support-for-stu","title":{"rendered":"Wakefield High School will be closed for instruction tomorrow, Fri, Feb. 3, 2023. We will keep the building open during normal hours to provide counseling services and mental    health support for students and staff who may need help processing this week\u2019s incidents. CIGNA Employee Assistance Pr

## main.rs
use std::{ io::{ stdin, stdout, Write } };

fn main() {
    let mut input = String::new();

    print!("Please enter the sentence: ");
    stdout().lock().flush().expect("Could not write the prompt");

    stdin().read_line(&mut input).expect("Could not get input");

## main.rs
fn main() {
    println!("{}", how_many_in_common("january february march"));
}

fn how_many_in_common(input: &str) -> u32 {
    let words = input.split(" ");

    let mut combined = 0x3ffffff;

    for word in words {

## lib.rs
use std::{marker::PhantomPinned, pin::Pin};

pub struct Node<T> {
    value: T,
    next: Option<Box<Node<T>>>,
    prev: Option<*mut Node<T>>,
    _pantom: PhantomPinned,
}

pub struct List<T> {

## step_goals_solution.rs
use std::io::stdin;

fn main() {
    // Do a little parsing
    let mut lines = stdin().lines();
    let first_line = lines.next().unwrap().unwrap();
    let mut first_line_parts = first_line.split(" ");

    // Get the number of steps and trails from the input
    let num_steps: usize = first_line_parts.next().unwrap().parse().unwrap();

## et-tu-brute.rs
use std::io::stdin;

fn main() {
    let mut lines = stdin().lines().filter_map(|val| val.ok());

    let count: usize = lines.next().unwrap().parse().unwrap();

    for _ in 0..count {
        let first = lines.next().unwrap();
        let mut parts = first.split(' ');

## calendar-slicing.rs
use std::ops::Range;

#[derive(Debug, Clone)]
pub struct Event {
    initial_index: usize,
    placement_index: u32,
    size_at_calculation: u32,
    range: Range<u32>,
}
	[
	{
	"day": "Dark Chocolate Day",
	"position": [245, 280],
	"info": "This state eats the most chocolate",
	"date": 1
	},
	{
	"day": "Ground Hogs Day",
	"position": [800, 222],
	use std::{ io::{ stdin, stdout, Write } };

	fn main() {
	let mut input = String::new();

	print!("Please enter the sentence: ");
	stdout().lock().flush().expect("Could not write the prompt");

	stdin().read_line(&mut input).expect("Could not get input");
	fn main() {
	println!("{}", how_many_in_common("january february march"));
	}

	fn how_many_in_common(input: &str) -> u32 {
	let words = input.split(" ");

	let mut combined = 0x3ffffff;

	for word in words {
	use std::{marker::PhantomPinned, pin::Pin};

	pub struct Node<T> {
	value: T,
	next: Option<Box<Node<T>>>,
	prev: Option<*mut Node<T>>,
	_pantom: PhantomPinned,
	}

	pub struct List<T> {
	use std::io::stdin;

	fn main() {
	// Do a little parsing
	let mut lines = stdin().lines();
	let first_line = lines.next().unwrap().unwrap();
	let mut first_line_parts = first_line.split(" ");

	// Get the number of steps and trails from the input
	let num_steps: usize = first_line_parts.next().unwrap().parse().unwrap();
	use std::io::stdin;

	fn main() {
	let mut lines = stdin().lines().filter_map(\|val\| val.ok());

	let count: usize = lines.next().unwrap().parse().unwrap();

	for _ in 0..count {
	let first = lines.next().unwrap();
	let mut parts = first.split(' ');
	use std::ops::Range;

	#[derive(Debug, Clone)]
	pub struct Event {
	initial_index: usize,
	placement_index: u32,
	size_at_calculation: u32,
	range: Range<u32>,
	}