Minimum left material

将一根长为 ncm 的钢管截成长为 69cm 和 39cm 两种规格的短料。在这两种规格的短料至少各截一根的前提下, 如何截才能余料最少?
如果n<108cm,输出“error”。

输入:
369
输出:
3 4 6// 69cm 的 3 根,39cm 的 4 根,余料的长度为 6 cm。

#include <stdio.h>
#include <stdlib.h>
const int MAXN = 100;
int c,rest,a[MAXN],minrest,a39,a69; 
void input_data()
{
    scanf("%d",&c);
    if (c < 108) 
        {
            printf("error");
            exit(0);
        }
    rest = c - 108; 
    minrest = rest;
    a[39] = 1;a[69] = 1; 
    a39 = 1;a69 = 1;
}
void sear_ch(int t)
{
    a[t]++;
    rest-=t;
    if (rest < minrest)
        {
            minrest = rest;
            a39 = a[39];a69 = a[69];
        }
    if (rest >= 69) 
        sear_ch(69);
    if (rest >=39)
        sear_ch(39);
    rest+=t; 
    a[t]--;
}
void get_ans() 
{
    if (rest >= 69)
        sear_ch(69);
    if (rest >=39)
        sear_ch(39);
}
void output_ans()
{
    printf("%d\n",a69);
    printf("%d\n",a39);
    printf("%d\n",minrest);
}
int main()
{
    input_data();
    get_ans();
    output_ans();
    return 0;
}
The toy is like a Rubik&#39;s cube, but not a Rubik&#39;s cube. Specifically, it is not a 3 * 3 * 3 structure, but a 4 * 2 structure. According to the play of the toy, we can repeatedly transform it in the following three ways: A. Exchange the upper and lower lines. For example, the result of the transformation of Figure (a) is shown in Figure (b). B. Loop right shift (ZC God knows what this means from an early age). For example, the result of the transformation of Figure (b) is shown in Figure (c). C. The center rotates clockwise. For example, the result of the transformation of Figure (c) is shown in Figure (d). ZC God is a genius in this respect. He often has a hand that has not dried his nose, the other hand has quickly restored the toy in any state to the initial state shown in Figure (a). In the year when the material was extremely scarce, ZC God had only one such toy; today, the material is extremely rich, and you have many toys in different states. Now, please restore them all. Input The first line is a positive integer, which is the total number of Rubik&#39;s cube toys you have. In each one of the following N lines, 8 positive integers, i.e. an arrangement of 1~8, are included, indicating the current state of the toy. Here, the representation rule of the cube state is that the first four numbers represent the first line of the cube from left to right, and the last four numbers represent the second line from right to left. For example, the initial state is expressed as "1 2 3 4 5 6 7 8". Output A total of N lines, each line containing an integer, in turn corresponding to the minimum number of transform needs to be performed to restore each toy. In particular, if a toy is not recoverable, the corresponding line outputs -1.
12-19
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

【执珪】瑕瑜·夕环玦

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值