[codeforces] 2B - The least round way

这题一眼看去挺简单的，直接全遍历DFS就是，然后找几个优化的出口，但是很不幸，基本在13轮就WA或者LE了。研究了一下，是数字太大，long都放不下，然后就想着处理大数，如果%10=0的还好，但是%5=0的想了半天也没想到处理的方式，果断改思路。。。

version 1 source:

import java.util.Scanner;

/**
 * Created by Scruel on 2016/3/29.
 */
public class CF2_B
{
        static int min = 999999999;
        static String re = "";

        public static void main(String[] args)
        {
                Scanner input = new Scanner(System.in);
                int n = input.nextInt();
                int[][] nums = new int[n][n];
                for (int i = 0; i < n; i++)
                {
                        for (int j = 0; j < n; j++)
                                nums[i][j] = input.nextInt();
                }

                dfs(nums);
                System.out.println(min);
                System.out.println(re);
        }

        public static void dfs(int[][] nums)
        {
                dfs(nums, 0, 0, nums[0].length, 1, "", 0);
        }

        public static void dfs(int[][] nums, int i, int j, int n, long sum, String result, int count)
        {

                if (count >= min)
                        return;
                sum *= nums[i][j];
                while (sum % 10 == 0)//只会在最后一层返回
                {
                        sum /= 10;
                        count++;
                }
                if (sum % 5 != 0)
                {
                        while (sum > 10)
                                sum = sum % 10;
                }
                if (i == n - 1 && j == n - 1)
                {
                        //System.out.println(count+"   "+ result);
                        if (count < min && count != -1)
                        {
                                re = result;
                                min = count;
                        }

                        return;
                }

                if (i + 1 < n)
                        dfs(nums, i + 1, j, n, sum, result + "D", count);

                if (j + 1 < n)
                        dfs(nums, i, j + 1, n, sum, result + "R", count);

                return;
        }
}

于是之，改呗，想了下，终于发现了2 5规律，即dp时，不存储sum累加值，而是存储当前数字循环取2,5余的次数，到最后比较两个count值，取小的即可，这样就不会出现存储不了大数的情况。测试了下，在第13轮LE了。

于是优化了下，提前先存储2 5 数据，而不是在进行遍历的时候再获得，然而还是在14轮LE了。。。。

version 2 source:

import java.util.Scanner;

/**
 * Created by Scruel on 2016/3/29.
 */
public class CF2_B
{
        static int min = 999999999;
        static int n;
        static String re = "";
        static int[][] nums_2;
        static int[][] nums_5;
        static boolean b = false;

        public static void main(String[] args)
        {
                Scanner input = new Scanner(System.in);
                n = input.nextInt();
                nums_2 = new int[n][n];
                nums_5 = new int[n][n];

                for (int i = 0; i < n; i++)
                {
                        for (int j = 0; j < n; j++)
                        {
                                int count_2 = 0, count_5 = 0;
                                int num = input.nextInt();
                                if (num == 0)
                                        nums_2[i][j] = nums_5[i][j] = -1;
                                else
                                {
                                        while (num % 2 == 0)
                                        {
                                                num /= 2;
                                                count_2++;
                                        }
                                        nums_2[i][j] = count_2;
                                        if (count_2 != 0)
                                                num *= count_2 * 2;
                                        while (num % 5 == 0)
                                        {
                                                num /= 5;
                                                count_5++;
                                        }
                                        nums_5[i][j] = count_5;
                                }

                        }

                }

                dfs();
                System.out.println(min);
                System.out.println(re);
        }

        public static void dfs()
        {
                dfs(0, 0, "", 0, 0);
        }

        public static void dfs(int i, int j, String result, int count_2, int count_5)
        {
                int count;

                if (count_2 < count_5)
                        count = count_2;
                else
                        count = count_5;
                if (count >= min)//第一个出口，无脑地节省了一大堆时间及内存
                        return;

                count_2 += nums_2[i][j];
                count_5 += nums_5[i][j];
                if (nums_2[i][j] == -1 || nums_5[i][j] == -1)
                {
                        min = 1;
                        while (i++ < n)
                                re += "D";
                        while (j++ < n)
                                re += "R";
                        return;
                }

                if (i == n - 1 && j == n - 1)//主要出口，当达到右下角时判断是否是最小count，如果是则赋值，然后返回
                {
                        count = count_2 < count_5 ? count_2 : count_5;

                        if (count < min)
                        {
                                re = result;
                                min = count;
                                b = true;
                        }
                        return;
                }
                if (i + 1 < n && j + 1 < n)
                {
                        int temp_1 = count_2 + nums_2[i + 1][j] < count_5 + nums_5[i + 1][j] ? count_2 + nums_2[i + 1][j] : count_5 + nums_5[i + 1][j];//下
                        int temp_2 = count_2 + nums_2[i][j + 1] < count_5 + nums_5[i][j + 1] ? count_2 + nums_2[i][j + 1] : count_5 + nums_5[i][j + 1];//右
                        //获得下边和右边的总计，然后进行比较,哪边小就执行哪边，如果一样大就都执行。
                        if (i + 1 < n && temp_1 <= temp_2)
                                dfs(i + 1, j, result + "D", count_2, count_5);
                        if (j + 1 < n && temp_1 >= temp_2)
                                dfs(i, j + 1, result + "R", count_2, count_5);
                } else
                {
                        if (i + 1 < n)
                                dfs(i + 1, j, result + "D", count_2, count_5);
                        if (j + 1 < n)
                                dfs(i, j + 1, result + "R", count_2, count_5);
                }
                return;
        }
}

未完待续。。。