题目来源:http://poj.org/problem?id=1016 题目大意: 对一个非负整数定义一种运算(inventory):数这个数中各个数字出现的次数,然后按顺序记录下来.比如“5553141”有2个1,1个3,一个4,3个5,于是运算后为“21131435”,对于这种运算有的数字有着有趣的性质:如“31123314”,它运算后的结果和它本身是一样的(self-inventorying).如果做j次inventory运算后,第j次迭代的结果是self-inventorying的,则称…

1.搜索 //回溯 2.DP(动态规划) 3.贪心 北大ACM题分类2009-01-27 1 4.图论 //Dijkstra.最小生成树.网络流 5.数论 //解模线性方程 6.计算几何 //凸壳.同等安置矩形的并的面积与周长sp; 7.组合数学 //Polya定理 8.模拟 9.数据结构 //并查集.堆sp; 10.博弈论 1. 排序 sp; 1423, 1694, 1723, 1727, 1763, 1788, 1828, 1838, 1840, 2201, 2376, 2377, 2380…

北大ACM - POJ试题分类 -- By EXP 2017-12-03 转载请注明出处: by EXP http://exp-blog.com/2018/06/28/pid-38/ 相关推荐文: 旧版POJ分类目录: http://exp-blog.com/2018/06/10/pid-136/ ACM绝版资源公开( 参考书.模板.讲义.指导): http://exp-blog.com/2018/07/11/pid-1777/ ACM国家集训队论文集(1999-2009): http://ex…

点击打开链接 Numbers That Count Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 17922   Accepted: 5940 Description "Kronecker's Knumbers" is a little company that manufactures plastic digits for use in signs (theater marquees, gas station…

Question:http://poj.org/problem?id=1016 问题点:水题. Memory: 232K Time: 125MS Language: C++ Result: Accepted #include <iostream> #include <string> using namespace std; string inventory(string n) { int i; ]; ]; memset(t,,sizeof(t)); ;i<n.length()…

在百度文库上找到的,不知是哪位大牛整理的,真的很不错! zz题 目分类 Posted by fishhead at 2007-01-13 12:44:58.0 -------------------------------------------------------------------------------- acm.pku.edu.cn 1. 排序 1423, 1694, 1723, 1727, 1763, 1788, 1828, 1838, 1840, 2201, 2376, 23…

 FZU 2105  Digits Count Time Limit:10000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u Practice Description Given N integers A={A[0],A[1],...,A[N-1]}. Here we have some operations: Operation 1: AND opn L R Here opn, L and R are intege…

Question:http://poj.org/problem?id=1009问题点:RLE编码. Memory: 648K Time: 547MS Language: C++ Result: Accepted #include <iostream> #include <cstdlib> #include <map> #include <vector> using namespace std; map<int,int> mp; map<in…

Question:http://poj.org/problem?id=1753 问题点:穷举. #include <iostream> using namespace std; ][];//记录输入 ][];//记录操作 ][];//中间变量 bool judge() { ; ;i<;i++) { ;j<;j++) { sum+=c[i][j]; } } ||sum==) return true; else return false; } int inttobools(int k)…

Description        "Kronecker's Knumbers" is a little company that manufactures plastic digits for use in signs (theater marquees, gas station price displays, and so on). The owner and sole employee, Klyde Kronecker, keeps track of how many digi…