摘要: A bzoj - 3260 跳。 简单且狗儿题,最多算根号次,不取模差不多得了。 //how to get this one???? #include<bits/stdc++.h> const int mod=1e9+7; long long n,m; long long qpow(long lon 阅读全文
posted @ 2021-11-27 14:11 cirnovsky 阅读(33) 评论(0) 推荐(0)