北京大学ACM Problems 1022: Packing Unit 4D Cubes

ToF君

于 2022-05-05 00:29:56 发布

阅读量259

点赞数

分类专栏：兔云程序 OJ大全文章标签： c++ 算法

本文链接：https://blog.csdn.net/linjingtu/article/details/124570238

版权

兔云程序同时被 2 个专栏收录

194 篇文章 12 订阅 ¥119.90 ¥299.90

订阅专栏

超级会员免费看

OJ大全

72 篇文章 0 订阅 ¥119.90 ¥299.90

订阅专栏

超级会员免费看

这是一个关于解决如何将4D立方体产品装入最小体积的4D矩形平行六面体的问题。输入包含不一致的4D立方体描述，任务是找出如果描述一致，最小包装体积或标记为'Inconsistent'。

摘要由CSDN通过智能技术生成

Packing Unit 4D Cubes

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 2965		Accepted: 1059

Description

We usually think that there are three geometric dimensions; the fourth dimension is usually time. However, the Association for Customizing Machines (ACM) has to deal with four geometrical dimensions for their strange customer EE3 who needs to pack four dimensional products into perpendicular parallelepipeds before shipping them to the newly