Miracle_QSH的博客

新博客地址：miracle-qsh.github.io

#include<bits/stdc++.h>using namespace std;queue<int> q;const int N = 500010;struct AC_automaton{ int c[N][26], val[N], fail[N], cnt; //c数组记录字典树节点，val数组为该节点是否为字符串结尾（个数）（记录字符串...

洛谷题解：https://www.luogu.org/problemnew/solution/P2051#include <bits/stdc++.h>using namespace std;typedef long long ll;const ll MAXN = 105;const ll MOD = 9999973;ll dp[MAXN][MAXN][MAXN];...

HDU - 1166 敌兵布阵：#include <bits/stdc++.h>using namespace std;int a[50005];char cmd[1005];int main(){ int t, n, m, i, j, k, ca = 1; scanf("%d", &t); while(t--) { ...

CodeForces - 1085D - Minimum Diameter Tree：题目大意：给你一棵树，让你分配边权，使树的直径最小。解题思路：均分给叶子节点，其余边权为零，这样答案一定是最小的。#include <bits/stdc++.h>using namespace std;int du[100005] = {0};int main(){ in...

概念：1、JAVA多线程机制：不同线程之间的快速切换2、程序：静态代码3、进程：一次程序的动态执行过程4、线程：比进程更小的执行单位5、线程对象：用Thread及其子类表示多线程：public class Main { public static void main(String[] args) { // TODO Auto-generated method ...

POJ - 2631 Roads in the North：题目大意：给你一棵树，求树的最长路径，也就是树的直径。树的直径必然是树上某一个点开始往下的最长链和次长链之和，因此，对于每个节点记录两个值 dp1[ i ] 表示以 i 为根的子树中，i 到叶子节点的距离最大值，dp2[ i ] 表示以 i 为根的子树中， 除距离最大值所在的子树，i 到叶子节点的距离最大值（次大值）：d...

 POJ - 2631 Roads in the North：题目大意：给你一棵树，求这棵树的直径。树的直径：树中最长的简单路径。简单路径：路径上各点均不重复。以下证明内容转自https://www.cnblogs.com/a-clown/p/6131346.html这里给出树的直径的证明：　　主要是利用了反证法：　　假设 s-t这条路径为树的直径，或者称为树上的最长路...

struct node{ int data; bool operator < (const node b)const { return data < b.data; }}; 

题目大意：给你一棵树，让你分配边权，使树的直径最小。解题思路：均分给叶子节点，其余边权为零。#include <bits/stdc++.h>using namespace std;int du[100005] = {0};int main(){ int n, m, i, j, k; scanf("%d %d", &n, &m); ...

题目链接：https://cn.vjudge.net/problem/CodeForces-1085C题目大意：给了你三个点，让你建一条路把三个点都连起来，路径尽可能小。解题思路：构造题，找到中间位置的点，以他做垂线，两边的点水平连接。#include <bits/stdc++.h>using namespace std;set <pair<int, in...

题目HDU 4734 F(x)：题目大意是给你两个数A，B，定义F（A）= 每个数位的数 * 2 ^ (位数 - 1)。求 0 - B 区间里的 F(x) <= F(A) 的数字的个数。一个数位DP的做法（TLE）：#include <bits/stdc++.h>using namespace std;typedef long long ll;ll a[100...

HDU 2089 不要62：题目大意是给你一个区间，让你统计这个区间里不包含 4 和 62 的数字的个数。最朴素的思路是：对于每个区间 [l, r]，遍历所有在区间 [l, r] 里的数字，然后检查每个数字是不是合法（没有 4 和 62 ），如果合法答案加一。代码如下：#include<bits/stdc++.h>using namespace std;boo...

#include<bits/stdc++.h>using namespace std;typedef long long ll;ll prim[100005], lenp = 0, isprim[100005] = {0};ll data[100005], lend;ll n, m, t, ans;void getprim(){ ll i, j, k; ...

#include<bits/stdc++.h>using namespace std;typedef long long ll;ll prim[100005], lenp = 0, isprim[100005] = {0};ll data[100005], lend;ll n, m, t, ans;void getprim(){ ll i, j, k; ...

#include<bits/stdc++.h>using namespace std;typedef long long ll;ll n, m, a[15], ans, p;ll lcm(ll a, ll b){return a * b / __gcd(a, b);}void dfs(ll x, ll sum, ll num){ if(num > m)ret...

#include<bits/stdc++.h>using namespace std;typedef long long ll;ll prim[20] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61};int main(){ ll n, i, j, k, ans; while(scanf("%lld"...

#include <bits/stdc++.h>using namespace std;typedef long long ll;ll a[15];ll dp[15][200005];ll po[15], maxx;ll F(ll x){ ll pos = 0, ans = 0, num, pi = 1; while(x) { n...

decimal 十进制binary 二进制 

#include <bits/stdc++.h>using namespace std;typedef long long ll;ll a[1005], dp[1005][2][10] = {0};ll cnt(ll po, ll lim, ll la){ if(po == -1)return 1; if(dp[po][lim][la])return dp[...

#include <bits/stdc++.h>using namespace std;typedef long long ll;struct node{ ll l, r, sum;}a[400005];ll lazy[400005];ll num[100005];void build(ll loc, ll l, ll r){ if(l == r)...

#include <bits/stdc++.h>using namespace std;typedef long long ll;struct node{ ll l, r, sum;}a[1000005];ll num[200005];void build(ll loc, ll l, ll r){ if(l == r) { a[...

#include <cstring>#include <cstdlib>#include <cstdio>#include <algorithm>using namespace std;typedef long long ll;ll num[50005];char cmd[105];struct node{ ll l, r...

#include <cstring>#include <cstdio>#include <cstdlib>#include <algorithm>#include <queue>using namespace std;typedef long long ll;int mp[505][505], vis[505], s, t...

模板题 #include <bits/stdc++.h>using namespace std;typedef long long ll;ll a[15];ll dp[15][2];ll dfs(ll pos, ll sta, ll lim){ if(pos == -1)return 1; if(lim == 0 && dp[pos][...

#include <bits/stdc++.h>using namespace std;int a[105][105] = {0};int pre[205], s[205] = {0}, vis[105];int cat(int x, int n){ int i; for(i = 1; i <= n; i++) { if(vis...

题目链接：https://cn.vjudge.net/problem/CodeForces-1082C题目大意：给定n名选手，每名选手都有唯一选择的科目si和对应的能力水平。并且给定科目数量为m。求选定若干个科目，并且每个科目参与选手数量相同的情况下的最大能力水平。解题思路：首先将每个选手的能力值插入到对应的科目里面，用优先队列维护，求前缀和，不断加入的答案数组里（为负值时不加入）...

题目链接：https://cn.vjudge.net/problem/CodeForces-1082C题目大意：给定n名选手，每名选手都有唯一选择的科目si和对应的能力水平。并且给定科目数量为m。求选定若干个科目，并且每个科目参与选手数量相同的情况下的最大能力水平。解题思路：首先将每个选手的能力值插入到对应的科目里面，用优先队列维护，求前缀和，不断加入的答案数组里（为负值时不加入）...

题目链接：https://cn.vjudge.net/problem/CodeForces-1088C题目大意：给你一个长度为 n 的序列，你可以对这个序列做如下操作：1、从 1 - i ，每个元素加一个正数 x2、从 1 - i ，每个元素 mod 一个正数 x问你能否在 n + 1 步操作内使这个序列严格递增解题思路：答案与元素没有关系，第一步 1 - n mod ...

题目链接：https://cn.vjudge.net/problem/CodeForces-1084C题目大意：给你一个由小写字母组成的字符串 s ，让你找一种序列：1、对于任意一个 i ，使得 s[ p[ i ] ] == 'a'2、对于任意一个 i ，存在 p[ i ] < j < p[i + 1]，且s[ p[ i ] ] == 'b'求这种序列有多少个，答案...

#include<bits/stdc++.h>using namespace std;typedef long long ll;ll ans, p = 0, maxx, a, b, c, d;ll prim[10000007],num[10000005];void dfs(ll x, ll sum, ll num){ if(num > maxx)retur...

A简单题#include <bits/stdc++.h>using namespace std;typedef long long ll;int main(){ ll n, m, ans; cin >> n >> m; ans = m / n; if(m % n != 0)ans++; cout <...

题目链接：https://cn.vjudge.net/contest/269106#problem/Q题目大意：        m堆石子,两人轮流取.只能在1堆中取.取完者胜.先取者负输出No.先取者胜输出Yes,然后输出怎样取子.例如5堆 5,7,8,9,10先取者胜,先取者第1次取时可以从有8个的那一堆取走7个剩下1个,也可以从有9个的中那一堆取走9个剩下0个,也可以从有10个的中那一...

题目链接：https://cn.vjudge.net/contest/269106#problem/R题目大意：        有两堆石子，数量任意，可以不同。游戏开始由两个人轮流取石子。游戏规定，每次有两种不同的取法，一是可以在任意的一堆中取走任意多的石子；二是可以在两堆中同时取走相同数量的石子。最后把石子全部取完者为胜者。现在给出初始的两堆石子的数目，如果轮到你先取，假设双方都采取最好...

题目链接：https://cn.vjudge.net/contest/269106#problem/F题目大意：        1堆石子有n个,两人轮流取.先取者第1次可以取任意多个，但不能全部取完.以后每次取的石子数不能超过上次取子数的2倍。取完者胜.先取者负输出"Second win".先取者胜输出"First win".解题思路：        斐波那契博弈，n为斐波那契数时...

题目链接：https://cn.vjudge.net/contest/269106#problem/F题目大意：        1堆石子有n个,两人轮流取.先取者第1次可以取任意多个，但不能全部取完.以后每次取的石子数不能超过上次取子数的2倍。取完者胜.先取者负输出"Second win".先取者胜输出"First win".解题思路：        斐波那契博弈，n为斐波那契数时...

import java.util.Scanner;public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner cin = new Scanner(System.in); String s; int i, l, r; whil...

import java.util.Scanner;public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner cin = new Scanner(System.in); int n, x1, y1, x2, y2, x, y, an...

import java.util.Scanner;public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner cin = new Scanner(System.in); int a, b; a = cin.nextInt();...

import java.util.Scanner;public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner cin = new Scanner(System.in); int a, b, c; a = cin.nextInt(...

import java.util.Scanner;class Judge{ double a, b, c, a1, b1, c1; Judge(double a, double b,double c, double a1, double b1, double c1) { this.a = a; this.a1 = a1; this.b = b; this.b1 = b1...

import java.util.Scanner;class Judge{ double x1, y1, x2, y2, x3, y3, x4, y4; Judge(double x1, double y1, double x2, double y2, double x3, double y3, double x4, double y4) { this.x1 = x1; thi...

import java.util.Scanner;class Line{ double r, x, y, ans; int num; Line(int n, double ri, double xi, double yi) { num = n; r = ri; x = xi; y = yi; ans = 0; } void AddPoint(double xi...

import java.util.Scanner;class Time{ int a, b, c, d; Time(String s) { char ci[] = s.toCharArray(); a = ci[0] - '0'; b = ci[1] - '0'; c = ci[3] - '0'; d = ci[4] - '0'; } void Print()...

#include <stdio.h>#include <string.h>#include <stdlib.h>int a[1005][1005];int vis[1005];int qu[100005], front, tail;void init(){ memset(a, 0, sizeof(a)); memset(vis, ...

#include <stdio.h>#include <string.h>#include <stdlib.h>int a[105][105];int vis[105];int qu[10005], front, tail, flag, n;void init(){ memset(a, 0, sizeof(a)); memset(...

#include <stdio.h>#include <string.h>#include <stdlib.h>int a[105][105];int vis[105];int qu[10005], front, tail;void init(){ memset(a, 0, sizeof(a)); memset(vis, 0, s...

#include <stdio.h>#include <string.h>#include <stdlib.h>int a[10005], p;char data[10005];int vis[10005];void sort(int l, int r){ int i, j; for(i = r - 1; i >= l; i...

#include <stdio.h>#include <string.h>#include <stdlib.h>char a[105];int p, len;struct node{ char data; struct node *l, *r;};struct node *qu[10005];int front = 0, ta...

#include <stdio.h>#include <string.h>#include <stdlib.h>char a[105];int p, len;struct node{ char data; struct node *l, *r;};struct node *qu[10005];int front = 0, ta...

#include <stdio.h>#include <string.h>#include <stdlib.h>char a[105], b[105];int n;struct node{ char data; struct node *l, *r;};int max(int a, int b){return a > b ...

import java.util.Scanner;class Number{ String s; int a, b, c, d; char x; Number(String s) { this.s = s; ToData(); } void ToData() { int i; a = b = c = 0; char si[] = s.toCharArray...

import java.util.Scanner;class Number{ int a, b; Number(int z, int x) { a = z; b = x; } void Print(int x) { if(x == 1)System.out.println(a); else if(x == 2)System.out.println(b); el...

#include <stdio.h>#include <string.h>#include <stdlib.h>char a[105];int p, len;struct node{ char data; struct node *l, *r;};struct node *qu[10005];int front = 0, ta...

简单写法：#include <stdio.h>#include <stdlib.h>#include <string.h>char a[1005];int main(){ int num, i, len; while(gets(a)) { len = strlen(a); num = 0;...

import java.util.Scanner;public class Main { static int S(int r) { return r * r; } public static void main(String[] args) { Scanner cin = new Scanner(System.in); int r; while(cin.hasNex...

import java.util.Scanner;public class Main { static double S(double r) { return 3.141592653 * r * r; } public static void main(String[] args) { Scanner cin = new Scanner(System.in); int t...

import java.util.Scanner;public class Main { static int Max(int a[]) { int ans = a[0]; for(int i = 0; i < 5; i++)if(a[i] > ans)ans = a[i]; System.out.println(ans); return ans; } s...

import java.util.Scanner;class Number{ int a, b; String c; Number(int n, int m, String k) { a = n; b = m; c = k; } void Print() { int ans = 0; if(c.equals("+"))ans = a + b; else ...

import java.util.Scanner;class Number{ int a, b; Number() { a = b = 0; } Number(int n, int m) { a = n; b = m; } void Print() { System.out.println(a + " " + b); } void Does(int c,...

import java.util.Scanner;class List{ String from[][] = new String[105][2105]; String to[][] = new String[105][2105]; int len1 = 0, len2 = 0; int lens1[] = new int[105]; int lens2[] = new int[1...

import java.util.Scanner;class List{ String name[] = new String[100005]; int score[] = new int[100005]; int len; void SetLen(int n) { len = n; } void sort(int l, int r) { if(l >= r)r...

import java.util.Scanner;class Number { long l, r; void SetNum(long n, long m) { l = n; r = m; } long F(long n) { if(n <= (long)2)return 0; else { long x; if((long)Math.sqr...

import java.util.Scanner;class Number { int a, b; Number(int n, int m) { a = n; b = m; } int GetGcd() { int ai = a, bi = b; while(bi > 0) { int x = ai; ai = bi; bi = x % ...

#include <stdio.h>#include <stdlib.h>struct node{ char data; int l, r;}a[15], b[15];int check(int i, int j){ if(a[a[i].l].data == b[b[j].l].data && a[a[i].r].dat...

#include <stdio.h>#include <stdlib.h>int *a;int max(int a, int b){return a > b ? a : b;}void creat(int n){a = (int *)malloc((n + 5)*sizeof(int));}void get(int n){for(int i = 1; i ...

#include <stdio.h>#include <stdlib.h>int *a, cou = 0;int max(int a, int b){if(a > b)return a; else return b; }void creat(int n){ a = (int *)malloc((n + 5) * sizeof(n));}void...

#include <stdio.h>#include <stdlib.h>struct node{ int *h, len, size;}list;void creat(int n){ list.h = (int *)malloc((n + 5) * sizeof(int));}void get(int n){ for(int i...

#include <stdio.h>#include <stdlib.h>struct node{ int *h, len, size;}list1, list2, list;void creat(int n, int m){ list1.h = (int*)malloc((n + 5) * sizeof(int)); list2.h ...

#include <stdio.h>#include <stdlib.h>struct node{ int *h, len, size;}list;void creat(){ list.h = (int *)malloc(1000005 * sizeof(int));}void get(int n){ for(int i = 1;...

#include <stdio.h>#include <stdlib.h>struct node{ int *h, len, size;}list;void creat(){ list.h = (int *)malloc(2000005 * sizeof(int));}void get(int n){ for(int i = 1;...

#include <stdio.h>#include <stdlib.h>struct node{ int *h, len, size;}list;void creat(){ list.h = (int *)malloc(10005 * sizeof(int));}void get(int n){ for(int i = 1; i...

#include <stdio.h>#include <stdlib.h>struct node{ int *h, len, size;};int main(){ int t, n, i, j, k; scanf("%d", &t); while(t--) { scanf("%d", &n...

#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#define pi 3.1415926using namespace std;int main(){ double s; while(scanf("%lf", &s) !...

#include <bits/stdc++.h>#define ll long long#define maxn 200005using namespace std;struct node{ ll left, right; ll maxx;};node tree[maxn << 2];ll a[maxn] = {0};ll n;ll p...

#include <bits/stdc++.h>using namespace std;#define ll long longll T[10000007];ll P[10000007];ll ans[10000007];ll n, m, k;bool cmp(ll a, ll b){return a > b;}ll check(ll ti){ ll ...

#include <bits/stdc++.h>using namespace std;typedef long long ll;struct node{ ll u, v, w;}edge[200005];bool cmp(struct node a, struct node b){ return a.w < b.w;}bool cmp2(st...

#include <cstdio>#include <cstring>#include <cstdlib>#include <cmath>#include <iostream>#include <algorithm>#include <stack>#include <queue&

#include <cstdio>#include <cstring>#include <cstdlib>#include <cmath>#include <iostream>#include <algorithm>#include <stack>#include <queue&

#include <iostream>#include <algorithm>#include <cstdio>#include <cstring>#include <map>#include <queue>#include <set>#include <cmath>u

#include <algorithm>#include <iostream>#include <cstring>#include <cstdio>using namespace std;int pre[300000];int fin(int a){ if (pre[a]==a) return a; int t=a;...

#include <stdio.h>#include <stdlib.h>using namespace std;struct node{ int x, y, c;}a[1005];int main(){ int n, m, q, i, j; while(scanf("%d %d %d", &n, &m, &q...

#include <stdio.h>#include <stdlib.h>using namespace std;int a[105][105];int main(){ int n, m, i, j; while(scanf("%d %d", &n, &m) != EOF) { for(i = 1; i &...

#include <stdio.h>#include <stdlib.h>#include <string.h>int a[10000005], b[10000005], nex[10000005];void pre(int a[], int n){ int i, j; i = 0; j = nex[0] = -1; ...

#include <stdio.h>#include <stdlib.h>#include <string.h>char a[1000005], b[1000005];int next[1000005];void pre(char a[], int n){ int i, j; j = next[0] = -1; i = 0;...

SDUT - 2543 整除import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner cin = new Scanner( System.in ); int n, i; int a[] = new int [10000005]; a[1] ...

#include<stdio.h>#include<string.h>#include<stdlib.h>char a[10005][15], b[10005][15], s[15];int main(){ int n, m, i, j, flag, sum1, sum2; while(scanf("%d%d",&m,&amp...

#include <stdio.h>#include <stdlib.h>int a[15][15], dp[15][15], m, n, ans;void dfs(int x, int y){ if(x == n && y == m){ans++; return ;} dp[x][y] = 1; if(x - 1 >...

#include <stdio.h>#include <string.h>#include <stdlib.h>char s[1005], a[1005];int p = 0;int max(int a, int b){return a > b ? a : b;}int main(){ int len, i; while(g...

#include <stdio.h>#include <stdlib.h>int a[105], p = 0;int main(){ int t, n, m, i, k, data; char cmd; scanf("%d", &t); while(t--) { p = 0; scan...

#include <stdio.h>#include <string.h>int num[10005], a[10005], p = 0, q = 0;int main(){ int n, i, j, k, m, t; scanf("%d", &n); for(i = 0; i < n; i++)scanf("%d", &am...

#include <stdio.h>#include <stdlib.h>#include <string.h>struct node{ int data, next;}s[100005], *a[100005];int p = 0;int main(){ int t, n, i; scanf("%d", &t)...

#include <stdio.h>#include <stdlib.h>#include <string.h>struct node{ int data, next;}s[100005], *a[100005];int p = 0;int main(){ int t, n, i; scanf("%d", &t)...

#include <stdio.h>#include <string.h>char a[1005], s[1005];int p = 0;int main(){ char c; while(gets(s)) { p = 0; int len = strlen(s), i; for(i = 0...

#include <stdio.h>#include <string.h>int a[1005];int p = 0;int main(){ char c; while((c = getchar()) != EOF) { if(c == '#') { printf("%d
", a...

#include <stdio.h>#include <string.h>char a[1005], b[1005], p1 = 0, p2 = 0;int main(){ char c, t; int i; while((c = getchar()) != EOF) { if(c == '#') {...

#include <stdio.h>#include <string.h>int a[1005], p = 0;int main(){ int n, i, m; scanf("%d %d", &n, &m); if(n == 0){printf("0
"); return 0;} while(n) { ...

#include <stdio.h>#include <stdlib.h>struct node{ int data; struct node *last, *next;};int main(){ int n, i, m, k; scanf("%d %d", &n, &m); struct node *h...

#include <stdio.h>#include <stdlib.h>struct node{ int data; struct node *next;};int main(){ int n, i, m; while(scanf("%d", &n) != EOF) { struct node ...