Codeforces 414b Mashmokh and ACM
来源:互联网 发布:php 取字符串后几位 编辑:程序博客网 时间:2024/06/06 00:54
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).
The first line of input contains two space-separated integers n, k (1 ≤ n, k ≤ 2000).
Output a single integer — the number of good sequences of length k modulo 1000000007 (109 + 7).
3 2
5
6 4
39
2 1
2
In the first sample the good sequences are: [1, 1], [2, 2], [3, 3], [1, 2], [1, 3].
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;#define MOD1000000007#define N 2005int dp[N][N],n;void init(){int i,j,z,k;for(i=1;i<=N;i++){dp[1][i]=1;}for(i=1;i<=N;i++) for(j=1;j<=N;j++) for(z=j;z<=N;z+=j) dp[i][z]=(dp[i][z]+dp[i-1][j])%MOD; }int main(){int z,k,i,j;init();while(cin>>n>>k){ int s=0; for(i=1;i<=n;i++) { s+=dp[k][i]; s%=MOD;}cout<<s<<endl;} 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
- 无限循环ScrollView
- ImageView的scaletype属性
- CodeForces 609B The Best Gift
- Spark知识体系完整解读
- linux的mysql的
- Codeforces 414b Mashmokh and ACM
- css选择器优先级
- TOMCAT8重启一闪而过
- Android知识点深究
- 新浪微博Oauth2.0授权认证及SDK、API的使用(Android)
- Git 本地的撤销修改和删除操作
- Python的垃圾回收机制(一)之简介
- C语言生成随机数的函数、延时函数
- 将Android手机屏幕快速投影至WIN7的PC和投影仪