-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPsequence.java
57 lines (47 loc) · 1.38 KB
/
Psequence.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
import java.util.Arrays;
import java.util.Scanner;
class Psequence{
public static int Psequences(int n, int p){
int l=Math.min(p, (int)(2*Math.sqrt(p)+20));
long limites[]=new long [l];
int aux=1, aux2=0;
while(aux*aux<=p){
limites[aux-1]=aux;
aux++;
}
aux--;
aux2=aux;
while(aux>0){
if(limites[aux-1]!=(p/limites[aux-1])){
limites[aux2]=p/limites[aux-1];
aux2++;
}
aux--;
}
long mat[][]=new long [n][aux2];
for(int i=0; i<aux2; i++){
mat[n-1][i]=1;
}
for(int i=n-2; i>=0;i--){
for(int j=aux2-1; j>=0; j--){
mat[i][j]=mat[i+1][aux2-j-1]*(limites[aux2-j-1]-((j==aux2-1)?0:limites[aux2-j-2]));
if(j<aux2-1){
mat[i][j]+=mat[i][j+1];
}
mat[i][j]%=1000000007;
}
}
long ans=0;
for(int i=0; i<aux2; i++){
ans+=mat[0][i]*(limites[i]-((i==0)?0:limites[i-1]));
ans%=1000000007;
}
return (int)ans;
}
public static void main(String[] args) {
Scanner in= new Scanner(System.in);
int n=in.nextInt();
int p=in.nextInt();
System.out.println(Psequences(n, p));
}
}