format

Author: lrvideckis

examples/data_structures/deq_agg.rs

@@ -2,7 +2,7 @@
 
 use proconio::input;
 use programming_team_code_rust::data_structures::deq_agg::DeqAgg;
-use rand::{thread_rng, Rng};
+use rand::{Rng, thread_rng};
 use std::collections::VecDeque;
 
 const MOD: u64 = 998_244_353;

examples/data_structures/range_container_handmade.rs

@@ -1,7 +1,7 @@
 // verification-helper: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/lesson/2/ITP1/all/ITP1_1_A
 
 use programming_team_code_rust::data_structures::range_container::RangeContainer;
-use rand::{thread_rng, Rng};
+use rand::{Rng, thread_rng};
 use std::collections::BTreeMap;
 
 fn main() {

examples/helpers/lis_handmade.rs

@@ -1,7 +1,7 @@
 // verification-helper: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/lesson/2/ITP1/all/ITP1_1_A
 
 use programming_team_code_rust::helpers::lis::Lis;
-use rand::{thread_rng, Rng};
+use rand::{Rng, thread_rng};
 
 fn lis_quadratic(a: &[i32]) -> usize {
     let n = a.len();

src/graphs/count_paths_per_length.rs

@@ -1,5 +1,5 @@
 //! # Count the number of paths of each length in a tree
-use crate::graphs::cent_decomp::{cent_decomp, CentDecompDfs};
+use crate::graphs::cent_decomp::{CentDecompDfs, cent_decomp};
 use crate::numbers::fft::fft_multiply;
 
 fn conv(a: &[u64], b: &[u64]) -> Vec<u64> {