zoukankan      html  css  js  c++  java
  • codeforce 1311 D. Three Integers

    In one move, you can add +1 or −1 to any of these integers (i.e. increase or decrease any number by one). You can perform such operation any (possibly, zero) number of times, you can even perform this operation several times with one number. Note that you cannot make non-positive numbers using such operations.

    You have to perform the minimum number of such operations in order to obtain three integers A≤B≤C such that B is divisible by A and C is divisible by B.

    You have to answer t independent test cases.

    Input
    The first line of the input contains one integer t (1≤t≤100) — the number of test cases.

    The next t lines describe test cases. Each test case is given on a separate line as three space-separated integers a,b and c (1≤a≤b≤c≤104).

    Output
    For each test case, print the answer. In the first line print res — the minimum number of operations you have to perform to obtain three integers A≤B≤C such that B is divisible by A and C is divisible by B. On the second line print any suitable triple A,B and C.

    Example
    inputCopy
    8
    1 2 3
    123 321 456
    5 10 15
    15 18 21
    100 100 101
    1 22 29
    3 19 38
    6 30 46
    outputCopy
    1
    1 1 3
    102
    114 228 456
    4
    4 8 16
    6
    18 18 18
    1
    100 100 100
    7
    1 22 22
    2
    1 19 38
    8
    6 24 48
    纯暴力枚举(有点技巧,小剪枝)

    #include <bits/stdc++.h>
    using namespace std;
    const long long maxn = 1e15 + 5;
    int main()
    {
        int t;
        cin >> t;
        while (t--)
        {
            long long a, b, c, a1, b1, c1;
            scanf("%lld %lld %lld", &a, &b, &c);
            long long cnt = maxn;
            for (long long k = 1; k <=5*c; k++)
            {
                for (long long  i = 1;  i*k<=5*c; i++)
                    for (long long  j = 1;i*k* j <=5*c ; j++)
                    {
    
                        long long temp = abs(k - a) + abs(i * k - b) + abs(j * i * k - c);
                        if (temp < cnt)
                        {
                            cnt = temp;
                            a1 = k;
                            b1 = i * k;
                            c1 = i * j * k;
                        }
                       // else
                          //  break;
                    }
            }
            printf("%lld
    ", cnt);
            printf("%lld %lld %lld
    ", a1, b1, c1);
        }
    }
    
  • 相关阅读:
    GridView与ArrayAdapter的结合
    翻翻git之---闪烁动画的TextView RevealTextView
    希捷硬盘扩容软件-----DiscWizard
    项目管理的酸甜苦辣
    【转】Bootloader之uBoot简介(转)
    【转】uboot移植(一)BootLoader基本概念
    【转】U-boot分析与移植(1)----bootloader分析
    【转】MIPS交叉编译环境的建立
    【转】RTSP实例解析
    【转】Eclipse快捷键 10个最有用的快捷键----不错
  • 原文地址:https://www.cnblogs.com/lunatic-talent/p/12798411.html
Copyright © 2011-2022 走看看