- 博客(9)
- 收藏
- 关注
RSS订阅原创 E.Multiply Pollard_rho质因数分解
2019 icpc xuzhou思路很简单， 但是这个Pollard_rho的模板要选好， 不然不是wa 就是 tle ，我太难了#include <cstdio>#include <cstdlib>#include <ctime>#include <cstring>#include <algorithm>#include ...
2019-12-09 22:46:58
281
1
原创 G.Eating Plan
Bob is hungry now and he needs to eat some food. Alice puts nn dishes of food in front of him, numbered from 11 to nn. Alice tells him that he can only eat continuous dishes of food, or he will be poi...
2019-12-09 12:15:52
222
原创 富豪凯匹配串
链接：https://ac.nowcoder.com/acm/contest/1114/C来源：牛客网题目描述有n个长度为m的文本串，每个串只含有’0’和’1’。接下来有Q次询问，每次给出一个长度为m的字符串，且只含有’0’,‘1’和’’。如10_1_1。下划线可以匹配’0’或’1’。即10_1_1可以匹配101111,101101,100111,100101四种串。每次询问求出n个文本串中...
2019-12-06 18:37:33
87
原创 F.Function!
#include <bits/stdc++.h>#pragma GCC optimize(3 , "Ofast" , "inline")using namespace std;typedef long long ll ;const int INF = 0x3f3f3f3f , N = 1e5 + 10 ;const int mod = 998244353 ; void re...
2019-12-03 14:26:05
434
原创 D.Easy problem
莫比乌斯反演欧拉降幂#include <bits/stdc++.h>using namespace std;typedef long long ll ;const int mod = 59964251 ;const int N = 1e5 + 10 ;int prime[N] , vis[N] , mu[N] , tot , sum[N] ;ll qmi(ll a , ...
2019-12-02 20:28:16
115
原创 G.Pot
区间加 ， 区间最值#include <bits/stdc++.h>#pragma GCC optimize(3 , "Ofast" , "inline")using namespace std;typedef long long ll ;const int INF = 0x3f3f3f3f , N = 1e5 + 10 ;void read(int &x){ ...
2019-12-02 17:42:35
283
转载 C.Digital Path
2019 ICPC Nanjing 复现#include <bits/stdc++.h>#pragma GCC optimize(3 , "Ofast" , "inline")using namespace std;typedef long long ll ;const int INF = 0x3f3f3f3f , N = 1010 ;void read(int &...
2019-12-02 13:37:27
239
转载 J.Spy
Over time, those coaches in BDN Collegiate Progranuning Contest split into two camps.The big danger is that, while optimists and pessimists battle it out, the environment of this area becomes ever mor...
2019-12-02 13:17:25
330
原创 Triangle
2019icpc Nanjing K比赛的时候怎么没想起来这么简单的做法啊#include <bits/stdc++.h>#pragma GCC optimize(3 , "Ofast" , "inline")using namespace std;const double eps = 1e-7 ;struct node{ double x , y ; bo...
2019-12-01 23:46:00
128
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人