方法题
文章平均质量分 81
_Magic
停更,恢复时间未知
展开
-
BC85# HDU 5776 sum
sum Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)问题描述给定一个数列,求是否存在连续子列和为m的倍数,存在输出YES,否则输出NO输入描述输入文件的第一行有一个正整数T(1\leq T \leq 101≤T≤10),表示数据组数原创 2016-08-03 20:30:21 · 543 阅读 · 0 评论 -
最长上升子序列 最长公共子序列 最长公共子串 数字三角形 等简单DP以及变形
最长公共子序列问题#include #include using namespace std;short dp[510][510];int n;int FinMaxLen(char s[],char p[]){ memset(dp,0,sizeof(dp)); int i,j; int sk=strlen(s),pk=strlen(p);原创 2017-02-07 17:11:27 · 398 阅读 · 0 评论 -
Instant Complexity poj1472 (递归模拟)
Instant ComplexityTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2157 Accepted: 747DescriptionAnalyzing the run-time complexity of algorithms is an imp原创 2017-02-18 11:17:59 · 618 阅读 · 0 评论 -
Channel Allocation poj1129 (深搜/四色/枚举)
Channel AllocationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15064 Accepted: 7655DescriptionWhen a radio station is broadcasting over a very larg原创 2017-02-11 10:46:18 · 1064 阅读 · 0 评论 -
The Moronic Cowmpouter poj3191(负进制转换以及其他进制转换模板)
The Moronic CowmpouterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4078 Accepted: 2111DescriptionInexperienced in the digital arts, the cows tried原创 2017-02-08 11:38:47 · 541 阅读 · 0 评论 -
Semi-prime H-numbers poj3292 (类比欧拉筛)
Semi-prime H-numbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9171 Accepted: 4055DescriptionThis problem is based on an exercise of David Hilber原创 2017-01-15 11:35:10 · 458 阅读 · 0 评论 -
求素数 sdut oj 1468(欧拉筛)
求素数Time Limit: 100ms Memory limit: 65536K 有疑问?点这里^_^题目描述 求小于n的所有素数的数量。输入 多组输入,输入整数n(n00),以0结束。输出 输出n以内所有素数的个数。示例输入100示例输出原创 2016-07-28 14:26:26 · 593 阅读 · 0 评论 -
poj1506 Tiling 递推 简单大数
#include #include #include using namespace std;int s[1010][110];void reset(){ s[0][0]=1; ///s[X][0] 表示这个数一共多少位 注意逆序打印 s[0][1]=1; s[1][0]=1; s[1][1]=1; int j,k,i,n,sum,num;原创 2016-12-20 19:51:08 · 518 阅读 · 0 评论 -
Message Flood sdutoj 1500 (STL map 的使用)
Message FloodTime Limit: 1500MSMemory Limit: 65536KBProblem DescriptionWell, how do you feel about mobile phone? Your answer would probably be something like that "It's so convenient and b原创 2016-10-12 21:04:07 · 723 阅读 · 0 评论 -
Area poj1265 (pick公式+网格)
AreaTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6457 Accepted: 2823DescriptionBeing well known for its highly innovative products, Merck would def原创 2017-02-09 20:25:50 · 590 阅读 · 0 评论