(简单搜索)Blocks (P2363)
来源:互联网 发布:mac 安装ie 编辑:程序博客网 时间:2024/05/18 03:32
这个题就是一个很简单的搜索,我只是想把速度提高了一些,所以我一开始的做法是把给的一个数进行因数分解。
把分解出的有多少个质数进行组合搜索,不过也不知道哪里不对,一直没有AC。然后我就用很直白,很暴力的搜索。
毫无压力地,还是0MS过的。
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cstdlib>using namespace std;int n;int get(int a,int b,int c){return 2*(a*b+b*c+c*a);}int main(){int i,j,k;int t;cin>>t;while (t--){int ans=100000000;cin>>n;for (i=1;i<=n;i++){for (j=i;j*i<=n;j++){for (k=j;k*i*j<=n;k++){/*if (i*j*k==n&&ans>get(i,j,k)){cout<<i<<' '<<j<<' '<<k<<' '<<get(i,j,k)<<endl;}*/if (i*j*k==n)ans=min(ans,get(i,j,k));}}}cout<<ans<<endl;}return 0;}
Blocks
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6506 Accepted: 3120
Description
Donald wishes to send a gift to his new nephew, Fooey. Donald is a bit of a traditionalist, so he has chosen to send a set of N classic baby blocks. Each block is a cube, 1 inch by 1 inch by 1 inch. Donald wants to stack the blocks together into a rectangular solid and wrap them all up in brown paper for shipping. How much brown paper does Donald need?
Input
The first line of input contains C, the number of test cases. For each case there is an additional line containing N, the number of blocks to be shipped. N does not exceed 1000.
Output
Your program should produce one line of output per case, giving the minimal area of paper (in square inches) needed to wrap the blocks when they are stacked together.
Sample Input
59102627100
Sample Output
30348254130
Source
- (简单搜索)Blocks (P2363)
- POJ 1390 Blocks ||UVA 10559 - Blocks(记忆化搜索)
- POJ 2363 Blocks(简单题)
- poj 1390 Blocks(记忆化搜索/动态规划)
- Connected Blocks dfs搜索题
- 简单搜索(基础)
- 【DP+记忆化搜索】PKU-1390-Blocks
- poj 1390 Blocks (记忆化搜索)
- UVA - 10559 Blocks 记忆化搜索
- SharePoint2010 搜索(2) 简单的搜索
- Rescue(简单搜索题)
- BFS(简单图搜索 )
- hdu 2182(简单搜索)
- zoj 1002 搜索(简单)
- 简单搜索:Dungeon Master ()
- Blocks详解(一)
- Consecutive Blocks (ZOJ3970)
- [POJ1390]Blocks(dp)
- Android BACK键和HOME键的区别
- 华为Boss力荐公司高层看的一篇文章,真的很经典!!!
- java _web之Servlet简单应用
- Class** p = (Class**)calloc(2, sizeof(Class*));
- ubuntu打死你第一,设置DNS与安装图形
- (简单搜索)Blocks (P2363)
- 多线程笔试面试题汇总
- 信号处理小结(1)
- 打印从n个数中选取m个数的组合数
- 使用DBMS_JOB创建oracle定时任务
- 排序算法-- 冒泡排序
- Hibernate开发教程(1):概述
- 关于设计模式中创建型模式的一点理解
- 思科全球CCIE认证人数最新统计列表(2010年2月版)