摘要：
无原题地址 公约数 Time Limits: 1000 ms Memory Limits: 262144 KB Detailed Limits ### Description 给定一个正整数$n$，在$[1,n]$的范围内，求出有多少个无序数对$(a,b)$满足$gcd(a,b) = a$ $xor 阅读全文
posted @ 2018-09-10 19:49
Horrigue_JyowYang
阅读(173)
评论(0)
推荐(0)
摘要：
->戳我进原题 [网络流24题] 魔术球问题 时空限制：1000ms / 128MB 问题描述 假设有n根柱子，现要按下述规则在这n根柱子中依次放入编号为1，2，3，...的球。 （1）每次只能在某根柱子的最上面放球。 （2）在同一根柱子中，任何2个相邻球的编号之和为完全平方数。 试设计一个算法，计 阅读全文
posted @ 2018-09-10 11:57
Horrigue_JyowYang
阅读(233)
评论(0)
推荐(0)
摘要：
->戳我进原题 小珂的苦恼 时间限制：1000 ms 内存限制：1000 KB 难度：2 ### 描述 小珂是一名初中生，她现在很苦恼，因为老师布置了一个让她苦恼的作业，你能不能帮助她呢？题目信息如下。 已知二元一次方程 a*x+b*y=n， 判断这个二元一次方程有没有整数解，x,y为未知数，其中a 阅读全文
posted @ 2018-09-10 11:41
Horrigue_JyowYang
阅读(224)
评论(0)
推荐(0)
摘要：
->戳我进原题 [HAOI2008]玩具取名 Time Limit: 10 Sec Memory Limit: 162 MB Submit: 2486 Solved: 1448 ### Description 某人有一套玩具，并想法给玩具命名。首先他选择WING四个字母中的任意一个字母作为玩具的基本 阅读全文
posted @ 2018-09-10 11:00
Horrigue_JyowYang
阅读(148)
评论(0)
推荐(0)
摘要：
这是本蒟蒻第一次写周报 各位有什么意见或建议可以随时在下方评论指出来哦~ 本周内容 这周是总复习的第一周 于是我大概的总结了一下NOIP的知识点 并且对之前所写过的模板进行了一次背默的记忆加深 大概有如下内容 字符串 "manacher" "trie树" "kmp" 数据结构 "ST表" "线段树" 阅读全文
posted @ 2018-09-10 03:29
Horrigue_JyowYang
阅读(181)
评论(1)
推荐(0)
摘要：
出处 "https://blog.csdn.net/txl199106/article/details/71504478" 加~号是选学，加粗为重点，重要值排序不分先后 基础算法 贪心、枚举、分治、二分、倍增、~构造、高精、模拟 图论 图 最短路（dijkstra、spfa、floyd） ，差分约束 阅读全文
posted @ 2018-09-10 02:41
Horrigue_JyowYang
阅读(208)
评论(0)
推荐(0)
摘要：
蒟蒻一枚 望神犇们多多指教 QQ：799804394 vx：Assassin__47 网易云：再见网抑云我是qq绿钻svip10 阅读全文
posted @ 2018-09-10 02:38
Horrigue_JyowYang
阅读(157)
评论(0)
推荐(0)
摘要：
感受一下两种不同的码风 第一种是我的正常码风 include include include include include using namespace std; const int N =41000010; char s[N],news[N include include include in 阅读全文
posted @ 2018-09-10 01:44
Horrigue_JyowYang
阅读(116)
评论(0)
推荐(0)
摘要：
``` include include include include using namespace std; const int LEN =110; const int N =100010; char s[LEN]; int end[N];//表示当前节点是否为结束节点 int trie[N][ 阅读全文
posted @ 2018-09-10 01:39
Horrigue_JyowYang
阅读(94)
评论(0)
推荐(0)
摘要：
这里用到了倍增的思想 include include include include using namespace std; int n,m; int dp[100001][20]; int read(){ int f=1,x=0;char s=getchar(); while(s'9'){if( 阅读全文
posted @ 2018-09-10 01:38
Horrigue_JyowYang
阅读(116)
评论(0)
推荐(0)
摘要：
``` include include include include using namespace std; const int N =1000010; int lens,lenss,nxt[N]; char s[N],ss[N];//s文本串(长串) ss模式串(短串) inline void 阅读全文
posted @ 2018-09-10 01:37
Horrigue_JyowYang
阅读(103)
评论(0)
推荐(0)
摘要：
``` include define int long long using namespace std; const int N =3000010; int n,p,inv[N]; signed main(){ scanf("%d%d",&n,&p); inv[1]=1;printf("1\n") 阅读全文
posted @ 2018-09-10 01:36
Horrigue_JyowYang
阅读(104)
评论(0)
推荐(0)
摘要：
懒标记+乘法 include include include include define int long long using namespace std; int n,m; int ans,p,num[3000100]; struct Node{ int l,r,num; int sum,la 阅读全文
posted @ 2018-09-10 01:34
Horrigue_JyowYang
阅读(143)
评论(0)
推荐(0)
摘要：
``` include include define rg register using namespace std; const int N = 1e7 + 1; int n, m, v[N], prime[N], tot; bool is_prime[N]; inline int read(){ 阅读全文
posted @ 2018-09-10 01:30
Horrigue_JyowYang
阅读(87)
评论(0)
推荐(0)
摘要：
NOIP毒瘤 include include include include using namespace std; int qa[5100],qb[5100],ans[5100],book,n; string a,b; inline bool jud(int a){ if(a 9) return 阅读全文
posted @ 2018-09-10 01:29
Horrigue_JyowYang
阅读(110)
评论(0)
推荐(0)
摘要：
1、区间查单点加 include include using namespace std; const int N =500010; int n,m,a[N],c[N]; inline int read(){ int f=0,x=0; char ch=getchar(); while(!isdigi 阅读全文
posted @ 2018-09-10 01:29
Horrigue_JyowYang
阅读(81)
评论(0)
推荐(0)
摘要：
``` include include include include include define int long long using namespace std; const int N =2e9+1; const int mod =1e9+7; int T,n; struct mat{ i 阅读全文
posted @ 2018-09-10 01:27
Horrigue_JyowYang
阅读(161)
评论(0)
推荐(0)
摘要：
``` include include define rg register using namespace std; define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1 阅读全文
posted @ 2018-09-10 01:27
Horrigue_JyowYang
阅读(106)
评论(0)
推荐(0)
摘要：
``` include include include include include define int long long using namespace std; const int N =2e9+1; const int mod =1e9+7; int T,n; struct mat{ i 阅读全文
posted @ 2018-09-10 01:26
Horrigue_JyowYang
阅读(76)
评论(0)
推荐(0)
摘要：
``` #include #define int long long int a,b,p; inline double power(int a,int b){ int ans=1; for(;b;b>>=1){ if(b&1) ans=ans*a; a=a*a; } return ans; } signed main(){ scanf("%lf%lf",&a,&b); prin... 阅读全文
posted @ 2018-09-10 01:25
Horrigue_JyowYang
阅读(82)
评论(0)
推荐(0)
摘要：
``` include include define int long long using namespace std; const int N =1e5+10; int t,n,m,p; int a[N],b[N];//两个非负整数 inline int read(){ int f=0,x=0; 阅读全文
posted @ 2018-09-10 01:25
Horrigue_JyowYang
阅读(101)
评论(0)
推荐(0)
摘要：
1、树状数组+离散化(nlogn) include include include include include define int long long using namespace std; const int N = 40010; struct node { int v,order; }; 阅读全文
posted @ 2018-09-10 01:13
Horrigue_JyowYang
阅读(83)
评论(0)
推荐(0)
摘要：
跑两遍dfs include include include include include include using namespace std; const int N =100010; const int inf =1e9+7; struct edge{ int to,nxt,w; }e[N 阅读全文
posted @ 2018-09-10 01:08
Horrigue_JyowYang
阅读(114)
评论(0)
推荐(0)
摘要：
``` #include #include #include using namespace std; void beford(string in,string after){ if(in.size()){ char ch=after[after.size()-1]; cout>inord>>aftord; beford(inord,aftord); return 0; } ``` 阅读全文
posted @ 2018-09-10 01:07
Horrigue_JyowYang
阅读(82)
评论(0)
推荐(0)
摘要：
``` include include include include include include define rg register using namespace std; inline int read(){ rg int f=0,x=0; rg char ch=getchar(); w 阅读全文
posted @ 2018-09-10 01:06
Horrigue_JyowYang
阅读(101)
评论(0)
推荐(0)
摘要：
``` include include include include include include using namespace std; const int N = 110,M = 110; struct edge{ int to,nxt; }e[M]; //边的集合 int vis[N]; 阅读全文
posted @ 2018-09-10 01:05
Horrigue_JyowYang
阅读(85)
评论(0)
推荐(0)
摘要：
``` include include include include include include using namespace std; int n,m,e[1010][1010]; inline int read(){ int f=0,x=0; char ch=getchar(); whi 阅读全文
posted @ 2018-09-10 01:05
Horrigue_JyowYang
阅读(133)
评论(0)
推荐(0)
摘要：
``` include include include include include include include include include include define N 400010 using namespace std; struct edge{ int u,v,w; } e[N 阅读全文
posted @ 2018-09-10 01:03
Horrigue_JyowYang
阅读(95)
评论(0)
推荐(0)
摘要：
``` include include include include include include include include include define MaxNode 100001 define inf 1e9+7 using namespace std; int n,m,tot=1, 阅读全文
posted @ 2018-09-10 00:59
Horrigue_JyowYang
阅读(94)
评论(0)
推荐(0)
摘要：
``` include include include include include include define N 500010 define inf 2147483647 using namespace std; int n,m,s,dis[N],head[N],tot; bool vis[ 阅读全文
posted @ 2018-09-10 00:58
Horrigue_JyowYang
阅读(88)
评论(0)
推荐(0)
摘要：
``` include include include include include define N 100010 define rint register int define inf 2147483647 using namespace std; struct edge{ int num,v 阅读全文
posted @ 2018-09-10 00:51
Horrigue_JyowYang
阅读(108)
评论(0)
推荐(0)
浙公网安备 33010602011771号