ENG  RUS Timus Online Judge
Online Judge
Problems
Authors
Online contests
Site news
Webboard
Problem set
Submit solution
Judge status
Guide
Register
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

## Discussion of Problem 1014. Product of Digits

fails at test 28
Posted by Gautr 7 Jan 2021 07:38
I don't know the problem

use std::io;
fn minimal_product_digit(n: i64) -> i64{
if n == 0 {return 10};
if n < 10 { return n};

let f : Vec<i64> = vec![2,3,5,7];
let mut aux = n;
let mut ret : Vec<i64> = Vec::new();
for i in f{

if  aux % i== 0 {

loop{
aux/=i;
ret.push(i);
if aux % i != 0 {
break;
}
}
}
};

if ret.is_empty() || aux > 1 {
return -1;
}

match ret.iter().fold(0,|acc,elem| if *elem == 3{acc + 1} else {acc}) {

1 => {

let index = ret .iter().position(|&x| x == 3).unwrap();

if index > 0{

ret.remove(index);

let k = ret.get_mut(index - 1).unwrap();

*k = 6;

ret.sort();

}
}

_ => ()

}
let mut v : Vec<i64> = Vec::new();
for i in ret{

match i {

2 | 3=>

match v.last_mut(){

None => v.push(i),
Some(last) if i ==3 && *last == 2 => v.push(i),
Some(last) => {
let valor = *last;
if (valor * i) < 10{
*last = valor*i
}
else{
v.push(i);
}
}
}
_ => v.push(i)
}
}

v.sort();
v.iter().fold(0, |acc, elem| acc * 10 + elem)

}

fn main() {

let mut line = String::new();