2014-02-05 16:33:10 -06:00
|
|
|
// Copyright 2014 The Rust Project Developers. See the COPYRIGHT
|
|
|
|
// file at the top-level directory of this distribution and at
|
|
|
|
// http://rust-lang.org/COPYRIGHT.
|
|
|
|
//
|
|
|
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
|
|
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
|
|
|
// option. This file may not be copied, modified, or distributed
|
|
|
|
// except according to those terms.
|
|
|
|
|
2014-04-20 01:32:54 +02:00
|
|
|
use std::cmp::max;
|
2013-04-17 14:19:25 -07:00
|
|
|
|
2014-04-20 01:32:54 +02:00
|
|
|
fn fact(n: uint) -> uint {
|
|
|
|
range(1, n + 1).fold(1, |accu, i| accu * i)
|
2013-04-17 14:19:25 -07:00
|
|
|
}
|
|
|
|
|
2014-04-20 01:32:54 +02:00
|
|
|
fn fannkuch(n: uint, i: uint) -> (int, int) {
|
|
|
|
let mut perm = Vec::from_fn(n, |e| ((n + e - i) % n + 1) as i32);
|
|
|
|
let mut tperm = perm.clone();
|
|
|
|
let mut count = Vec::from_elem(n, 0u);
|
|
|
|
let mut perm_count = 0;
|
|
|
|
let mut checksum = 0;
|
2013-04-17 14:19:25 -07:00
|
|
|
|
2014-04-20 01:32:54 +02:00
|
|
|
for countdown in range(1, fact(n - 1) + 1).rev() {
|
|
|
|
for i in range(1, n) {
|
|
|
|
let perm0 = *perm.get(0);
|
|
|
|
for j in range(0, i) {
|
|
|
|
*perm.get_mut(j) = *perm.get(j + 1);
|
2013-04-17 14:19:25 -07:00
|
|
|
}
|
2014-04-20 01:32:54 +02:00
|
|
|
*perm.get_mut(i) = perm0;
|
2013-04-17 14:19:25 -07:00
|
|
|
|
2014-04-20 01:32:54 +02:00
|
|
|
let count_i = count.get_mut(i);
|
|
|
|
if *count_i >= i {
|
|
|
|
*count_i = 0;
|
|
|
|
} else {
|
|
|
|
*count_i += 1;
|
|
|
|
break;
|
2014-02-21 15:41:51 -08:00
|
|
|
}
|
|
|
|
}
|
2013-04-17 14:19:25 -07:00
|
|
|
|
2014-04-20 01:32:54 +02:00
|
|
|
tperm.clone_from(&perm);
|
|
|
|
let mut flips_count = 0;
|
2014-02-21 15:41:51 -08:00
|
|
|
loop {
|
2014-04-20 01:32:54 +02:00
|
|
|
let k = *tperm.get(0);
|
|
|
|
if k == 1 { break; }
|
|
|
|
tperm.mut_slice_to(k as uint).reverse();
|
|
|
|
flips_count += 1;
|
2013-04-17 14:19:25 -07:00
|
|
|
}
|
2014-04-20 01:32:54 +02:00
|
|
|
perm_count = max(perm_count, flips_count);
|
|
|
|
checksum += if countdown & 1 == 1 {flips_count} else {-flips_count}
|
2013-04-17 14:19:25 -07:00
|
|
|
}
|
2014-04-20 01:32:54 +02:00
|
|
|
(checksum, perm_count)
|
2013-04-17 14:19:25 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
fn main() {
|
2014-04-20 01:32:54 +02:00
|
|
|
let n = std::os::args().get(1).and_then(|arg| from_str(*arg)).unwrap_or(2u);
|
|
|
|
|
|
|
|
let (tx, rx) = channel();
|
|
|
|
for i in range(0, n) {
|
|
|
|
let tx = tx.clone();
|
|
|
|
spawn(proc() tx.send(fannkuch(n, i)));
|
|
|
|
}
|
|
|
|
drop(tx);
|
|
|
|
|
|
|
|
let mut checksum = 0;
|
|
|
|
let mut perm = 0;
|
|
|
|
for (cur_cks, cur_perm) in rx.iter() {
|
|
|
|
checksum += cur_cks;
|
|
|
|
perm = max(perm, cur_perm);
|
|
|
|
}
|
|
|
|
println!("{}\nPfannkuchen({}) = {}", checksum, n, perm);
|
2013-04-17 14:19:25 -07:00
|
|
|
}
|