m0_46122129的博客

Setsuna的K数列#include<iostream>#include<algorithm>#include<cstring>#include<queue>using namespace std;const int N=1000,mod=1e9+7;typedef long long LL;int main(){ int n,k; cin>>n>>k; int sum=0,a=1; while(n

Komorebi的数学课#include<iostream>#include<algorithm>#include<cstring>#include<queue>using namespace std;const int N=100010,mod=1e9+7;typedef long long LL;typedef pair<int,int>PII;int n,m;LL qmi(int a, int b, int p){