A Blog

摘要： bfsView Code #include <iostream>#include <cstdlib>#include <cstring>#include <cstdio>using namespace std;struct Edge{ int v, next;}edge[50];struct Node{ int f[7]; int s;}q[1000000], node;int head[10];int ecount = 0;bool vis[1000000];int step[1000000];void addedge(int a, int b 阅读全文

摘要： 高精度组合数学View Code import java.io.*;import java.util.*;import java.math.*;public class Main { public static void main(String[] args) throws FileNotFoundException { Scanner cin = new Scanner(new BufferedInputStream(System.in)); //Scanner cin = new Scanner(new FileInputStream("t.txt"... 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdlib>#include <cstring>#include <cstdio>using namespace std;#define maxn 100005int n, d;int f[maxn];int cal(int a){ int ret = 0; while (a > d) { ret += a / d; a = a / d + a % d; } return ret;}int main(){ //freopen("t.txt&qu 阅读全文

摘要： dpView Code #include <iostream>#include <cstdlib>#include <cstring>#include <cstdio>using namespace std;#define maxn 10005int n, m;int value[maxn];int f[maxn];void input(){ scanf("%d%d", &m, &n); for (int i = 1; i <= n; i++) scanf("%d", &val 阅读全文

摘要： 二分+排序View Code #include <iostream>#include <cstdlib>#include <cstring>#include <cstdio>#include <algorithm>using namespace std;#define maxn 1005#define maxl 25struct Elem{ int id, quality, price;}elem[maxn];int n, budget;char name[maxn][maxl];int tot;bool vis[maxn];int 阅读全文