HDU 2604 Queuing(矩阵快速幂)
2016-03-11 11:28
351 查看
题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=2604
思路:刚开始写DP错了,看别人的题解改了还是错,直接学快速幂A了,学了一招,第二位有2维时,可以开2个一维数组,比较容易理解
AC代码:
错误代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <cmath>
#include <cctype>
const int inf = 0x3f3f3f3f;//1061109567
typedef long long ll;
using namespace std;
int dp[1000010][2];
int main()
{
int l,m;
while(scanf("%d%d",&l,&m) != EOF)
{
dp[1][0] = 1;
dp[1][1] = 1;
dp[2][0] = 2;
dp[2][1] = 2;
for(int i=3; i<=l; i++)
{
//dp[i][0] = dp[i-2][1];
dp[i][0] = (2 * dp[i-2][1] - dp[i-3][0]) % m;
dp[i][1] = (dp[i-1][0] + dp[i-1][1]) % m;
}
printf("%d\n",(dp[l][0] + dp[l][1])%m);
}
return 0;
}
错误代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <cmath>
#include <cctype>
const int inf = 0x3f3f3f3f;//1061109567
typedef long long ll;
using namespace std;
int f[1000010];
int m[1000010];
int main()
{
int l,k;
while(scanf("%d%d",&l,&k) != EOF)
{
f[1] = 1;
m[1] = 1;
f[2] = 2;
m[2] = 2;
for(int i=3; i<=l; i++)
{
f[i] = (m[i-2] * 2 - f[i-3]) % k;
m[i] = (m[i-1] + f[i-1]) % k;
}
printf("%d\n",(f[l] + m[l])%k);
}
return 0;
}
思路:刚开始写DP错了,看别人的题解改了还是错,直接学快速幂A了,学了一招,第二位有2维时,可以开2个一维数组,比较容易理解
AC代码:
错误代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <cmath>
#include <cctype>
const int inf = 0x3f3f3f3f;//1061109567
typedef long long ll;
using namespace std;
int dp[1000010][2];
int main()
{
int l,m;
while(scanf("%d%d",&l,&m) != EOF)
{
dp[1][0] = 1;
dp[1][1] = 1;
dp[2][0] = 2;
dp[2][1] = 2;
for(int i=3; i<=l; i++)
{
//dp[i][0] = dp[i-2][1];
dp[i][0] = (2 * dp[i-2][1] - dp[i-3][0]) % m;
dp[i][1] = (dp[i-1][0] + dp[i-1][1]) % m;
}
printf("%d\n",(dp[l][0] + dp[l][1])%m);
}
return 0;
}
错误代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <cmath>
#include <cctype>
const int inf = 0x3f3f3f3f;//1061109567
typedef long long ll;
using namespace std;
int f[1000010];
int m[1000010];
int main()
{
int l,k;
while(scanf("%d%d",&l,&k) != EOF)
{
f[1] = 1;
m[1] = 1;
f[2] = 2;
m[2] = 2;
for(int i=3; i<=l; i++)
{
f[i] = (m[i-2] * 2 - f[i-3]) % k;
m[i] = (m[i-1] + f[i-1]) % k;
}
printf("%d\n",(f[l] + m[l])%k);
}
return 0;
}
相关文章推荐
- UI--手势识别器
- 《iOS Human Interface Guidelines》——Container View Controller
- Scene is unreachable due to lack of entry points and does not have an identifier for runtime access
- 如何解决androidstudio build项目png的iCCP警告
- "build gradle project info" Android Studio 导入Gradle工程时引发该问题的解决办法
- String.valueOf() 方法的使用
- 放在UIImageView上 按钮不能点击
- Android Bluetooth蓝牙开发\蓝牙协议\蓝牙通信例子_Android支持蓝牙4.0版本_BLE开发
- Contacts.CONTENT_STREQUENT_URI和Contacts.CONTENT_FREQUENT_URI
- UIImageView 图片变得模糊朦胧问题
- .Net自带ChartControl报错:Auto interval does not have proper value
- IOS-CAShapeLayer与UIBezierPath的基本用法
- RequireJS 依赖关系的实例
- hdu4893Wow! Such Sequence! (线段树)
- 96 - Unique Binary Search Trees
- jboss中调用Tuexdo服务遇到的问题 - JBAS014671
- 在 UITableView 上加手势(UITableView上点击键盘消失)
- UEditor 1.4.3版本中去掉本地保存功能
- EasyUI Messager 消息框
- 给UILabel或UIButton添加下滑线