Skip to content

Instantly share code, notes, and snippets.

@MartinSeeler
Last active August 29, 2015 14:10
Show Gist options
  • Save MartinSeeler/5fee56a6ec577da6d1fa to your computer and use it in GitHub Desktop.
Save MartinSeeler/5fee56a6ec577da6d1fa to your computer and use it in GitHub Desktop.
Euler Problems
fn main() {
let input = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450";
let digits = 4u;
for skip_n in range(0u, digits) {
let x:Vec<int> = input.as_bytes().iter().map(|&x| (x.to_int().map(|x| x - 48i).unwrap())).skip(skip_n).collect();
println!("Last prod is {}", x.chunks(digits).map(|x| (x.iter().fold(1, |x, &y| x * y), x)).max());
}
}
fn main() {
let input: Box<Vec<u8>> = box "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450".to_string().repeat(4096).bytes().collect();
let width = 13u;
match range(0u, input.len() - (width-1))
.map(|n| input.slice(n, n + width))
.map(|num_arr| (num_arr.iter().map(|x: &u8| (*x as uint) - 48u).fold(1u, |x, y| x * y), num_arr))
.max() {
Some((res, arr)) => println!("The biggest product is {} from the numbers {}", res, arr),
None => println!("There is no result"),
};
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment