codeforces--414B--Mashmokh and ACM
来源:互联网 发布:标准型矩阵是什么 编辑:程序博客网 时间:2024/06/01 07:33
Description
Mashmokh's boss, Bimokh, didn't like Mashmokh. So he fired him. Mashmokh decided to go to university and participate in ACM instead of finding a new job. He wants to become a member of Bamokh's team. In order to join he was given some programming tasks and one week to solve them. Mashmokh is not a very experienced programmer. Actually he is not a programmer at all. So he wasn't able to solve them. That's why he asked you to help him with these tasks. One of these tasks is the following.
A sequence of l integers b1, b2, ..., bl(1 ≤ b1 ≤ b2 ≤ ... ≤ bl ≤ n) is called good if each number divides (without a remainder) by the next number in the sequence. More formally for all i(1 ≤ i ≤ l - 1).
Given n and k find the number of good sequences of length k. As the answer can be rather large print it modulo 1000000007(109 + 7).
Input
The first line of input contains two space-separated integers n, k (1 ≤ n, k ≤ 2000).
Output
Output a single integer — the number of good sequences of length k modulo 1000000007(109 + 7).
Sample Input
3 2
5
6 4
39
2 1
2
Hint
In the first sample the good sequences are: [1, 1], [2, 2], [3, 3], [1, 2], [1, 3].
给出n和k,要求k个数中的每个数都在1到n内,并且a(i)/a(i-1)整除。共有多少中。
暴搜就可以
#include <cstdio>#include <cstring>#include <algorithm>using namespace std ;#define MOD 1000000007#define LL __int64LL dp[2][2100] ;int main(){ LL n , m , k , temp , l , i , j ; while( scanf("%I64d %I64d", &n, &m) != EOF ) { memset(dp,0,sizeof(dp)) ; temp = 0 ; for(j = 1 ; j <= n ; j++) dp[temp][j] = 1 ; for(i = 2 ; i <= m ; i++) { l = 1 - temp ; for(j = 1 ; j <= n ; j++) { k = j ; while( k <= n ) { dp[l][k] += dp[temp][j] ; dp[l][k] %= MOD ; k += j ; } } memset(dp[temp],0,sizeof(dp[temp])) ; temp = l ; } LL ans = 0 ; for(j = 1 ; j <= n ; j++) ans = ( ans + dp[temp][j] ) % MOD ; printf("%I64d\n", ans) ; } return 0;}
- CodeForces 414B--Mashmokh and ACM (dp)
- Mashmokh and ACM - CodeForces 414B dp
- codeforces 414B Mashmokh and ACM
- codeforces--414B--Mashmokh and ACM
- codeforces-414B-Mashmokh and ACM
- Codeforces 414b Mashmokh and ACM
- codeforces 414B B. Mashmokh and ACM(dp)
- Codeforces 414b Mashmokh and ACM(简单DP)
- CodeForces 414B Mashmokh and ACM dp + 决策总数
- CodeForces 414B Mashmokh and ACM (DP)
- Codeforces 414B Mashmokh and ACM(DP)
- Codeforces#414B——Mashmokh and ACM
- Codeforces 414B Mashmokh and ACM【预处理+dp】
- B. Mashmokh and ACM
- B. Mashmokh and ACM
- Codeforces 414A Mashmokh and ACM(dp)
- Codeforce--414B--Mashmokh and ACM
- CF 414B Mashmokh and ACM
- matlab 初值 步长 终值 :: x=a:b:c 什么意思 说明
- Unity3D实现动态加载游戏资源
- UVa 11234 - Expressions
- 个人对man命令的一些理解
- jqGrid学习
- codeforces--414B--Mashmokh and ACM
- Ant打包APK
- jquery的each,map,has
- Android Activity启动模式
- GUI_DOWNLOAD相关
- java--流
- 12-内存管理@property的参数
- java super() this 详解
- 推荐!国外程序员整理的系统管理员资源大全