<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[gengboting1的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/gengboting1</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; gengboting1]]></copyright><item><title><![CDATA[njsagagahgsfxZVV]]></title><link>https://blog.youkuaiyun.com/gengboting1/article/details/134678248</link><guid>https://blog.youkuaiyun.com/gengboting1/article/details/134678248</guid><author>gengboting1</author><pubDate>Tue, 28 Nov 2023 22:16:28 +0800</pubDate><description><![CDATA[Bbfzb]]></description><category></category></item><item><title><![CDATA[abcsgahhdhadha]]></title><link>https://blog.youkuaiyun.com/gengboting1/article/details/134678093</link><guid>https://blog.youkuaiyun.com/gengboting1/article/details/134678093</guid><author>gengboting1</author><pubDate>Tue, 28 Nov 2023 22:08:28 +0800</pubDate><description><![CDATA[abcsgaahahhfdh]]></description><category></category></item><item><title><![CDATA[hdu 1269  强联通分量题解；]]></title><link>https://blog.youkuaiyun.com/gengboting1/article/details/88624750</link><guid>https://blog.youkuaiyun.com/gengboting1/article/details/88624750</guid><author>gengboting1</author><pubDate>Sun, 17 Mar 2019 19:30:59 +0800</pubDate><description><![CDATA[// hdu 1269 强联通分量模板题
// 强连通分量的定义：1.在有向图里面，一个极大子图里面，任意两个点之间可以相互到达；
//          2.单个结点也是一个强连通分量；
// 强连通分量：有向图；
// 连通分量：无向图；
#include&amp;lt;iostream&amp;gt;
using namespace std;
#define maxn 10000...]]></description><category></category></item><item><title><![CDATA[虫食算 90]]></title><link>https://blog.youkuaiyun.com/gengboting1/article/details/78453538</link><guid>https://blog.youkuaiyun.com/gengboting1/article/details/78453538</guid><author>gengboting1</author><pubDate>Sun, 05 Nov 2017 23:15:37 +0800</pubDate><description><![CDATA[#include
#include
#include 
#include 
using namespace std;


int n;
 char s[4][30];
 bool used[30];
 int f[30];
 
 int id(char x)
 {
  return x-'A'+1;
 }


 


 void dfs(int x,int]]></description><category></category></item><item><title><![CDATA[选课-二叉2]]></title><link>https://blog.youkuaiyun.com/gengboting1/article/details/78347689</link><guid>https://blog.youkuaiyun.com/gengboting1/article/details/78347689</guid><author>gengboting1</author><pubDate>Wed, 25 Oct 2017 22:32:23 +0800</pubDate><description><![CDATA[#include
using namespace std;


int n,m;
int a[1010],c[1010];
int f[1001][1001];
struct node
{
    int l,r;
}tree[1001];


void build()
{
int x;
for(int i=1;i
{
x=a[i];
if (tree[x].]]></description><category></category></item><item><title><![CDATA[选课-二叉1]]></title><link>https://blog.youkuaiyun.com/gengboting1/article/details/78347680</link><guid>https://blog.youkuaiyun.com/gengboting1/article/details/78347680</guid><author>gengboting1</author><pubDate>Wed, 25 Oct 2017 22:31:35 +0800</pubDate><description><![CDATA[#include
#include
using namespace std;
const int maxn=320;


int dp[maxn][maxn];
int s[maxn],b[maxn],c[maxn];
int n,m;


void dfs(int x,int y)
{
if(dp[x][y]>=0)
return ;


if(x==0||y=]]></description><category></category></item><item><title><![CDATA[hdu 1561]]></title><link>https://blog.youkuaiyun.com/gengboting1/article/details/78333214</link><guid>https://blog.youkuaiyun.com/gengboting1/article/details/78333214</guid><author>gengboting1</author><pubDate>Tue, 24 Oct 2017 19:06:54 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
using namespace std;
#define N 205


int n,m,edgeNum=0;
int ans[N],dp[N][N],f[N][N];
int visit[N],head[N];




struct Line
{
int v,next;
} edge[N]]]></description><category></category></item><item><title><![CDATA[Rebuilding Roads]]></title><link>https://blog.youkuaiyun.com/gengboting1/article/details/78333056</link><guid>https://blog.youkuaiyun.com/gengboting1/article/details/78333056</guid><author>gengboting1</author><pubDate>Tue, 24 Oct 2017 18:53:45 +0800</pubDate><description><![CDATA[#include
#include
#include
using namespace std;


const int maxn=10000;


vector tree[200];


int dp[200][200];
int n,p;
bool son[200];




void dfs(int root)
{
int len=tree[root]]]></description><category></category></item><item><title><![CDATA[poj 2342 Anniversary party]]></title><link>https://blog.youkuaiyun.com/gengboting1/article/details/78333048</link><guid>https://blog.youkuaiyun.com/gengboting1/article/details/78333048</guid><author>gengboting1</author><pubDate>Tue, 24 Oct 2017 18:53:15 +0800</pubDate><description><![CDATA[#include
#include 
using namespace std;


int n,m;
int dp[10005][2];
int boss[10005];
 int vis[10005];
 void dis(int node)
 {
  vis[node]=1;
  for(int i=1;i
  {
  if(!vis[i]&&boss[i]==no]]></description><category></category></item><item><title><![CDATA[poj 1192]]></title><link>https://blog.youkuaiyun.com/gengboting1/article/details/78333043</link><guid>https://blog.youkuaiyun.com/gengboting1/article/details/78333043</guid><author>gengboting1</author><pubDate>Tue, 24 Oct 2017 18:52:35 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
using namespace std;


const int maxn=1010;


int n;
struct point {
int x,y,c;
}p[1010];
vector c[1010]; 


int dp[1010][2];
bool mark[1]]></description><category></category></item><item><title><![CDATA[【hdu 1520】]]></title><link>https://blog.youkuaiyun.com/gengboting1/article/details/78333040</link><guid>https://blog.youkuaiyun.com/gengboting1/article/details/78333040</guid><author>gengboting1</author><pubDate>Tue, 24 Oct 2017 18:52:14 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
using namespace std;


const int maxn=6005;
int value[maxn];
 struct node 
 {
  int fa,son,next;
 }e[maxn];
 int nume=0;
 int head[maxn];
 int n;
 v]]></description><category></category></item><item><title><![CDATA[欧拉函数打表]]></title><link>https://blog.youkuaiyun.com/gengboting1/article/details/78305970</link><guid>https://blog.youkuaiyun.com/gengboting1/article/details/78305970</guid><author>gengboting1</author><pubDate>Sat, 21 Oct 2017 20:08:53 +0800</pubDate><description><![CDATA[#include
using namespace std;


bool v[10001];
int phi[10001],p[10001];
int num=0;
int main()
{
int n;
phi[1]=1;
cin>>n;
for(int i=2;i
{
if(!v[i])
{
p[++num]=i;
phi[i]=i-1;
} 
for(i]]></description><category></category></item><item><title><![CDATA[【76】树网的核]]></title><link>https://blog.youkuaiyun.com/gengboting1/article/details/78268608</link><guid>https://blog.youkuaiyun.com/gengboting1/article/details/78268608</guid><author>gengboting1</author><pubDate>Wed, 18 Oct 2017 00:38:25 +0800</pubDate><description><![CDATA[#include
#include
using namespace std;
const int inf=0x3f;
int n,s1;
int f[301][301];
int nd=0;
int d[301];
int w;


void floyd()
{
int maxx=0;
int start,end;
for(int k=1; k
for(int i=]]></description><category></category></item><item><title><![CDATA[单源最短路径]]></title><link>https://blog.youkuaiyun.com/gengboting1/article/details/78268216</link><guid>https://blog.youkuaiyun.com/gengboting1/article/details/78268216</guid><author>gengboting1</author><pubDate>Tue, 17 Oct 2017 23:17:32 +0800</pubDate><description><![CDATA[#include
#include
using namespace std;


int s;
struct edge{
int from,to,len,nxt;
}edge[500001];
int ne=0;
int d[10001];
int head[10001];




void add(int u,int v,int w)
{
edge[++ne]]]></description><category></category></item><item><title><![CDATA[跳石头]]></title><link>https://blog.youkuaiyun.com/gengboting1/article/details/78256073</link><guid>https://blog.youkuaiyun.com/gengboting1/article/details/78256073</guid><author>gengboting1</author><pubDate>Tue, 17 Oct 2017 00:45:09 +0800</pubDate><description><![CDATA[#include
#include
using namespace std;


int L,m,n;
int d[50001];
int res=0;


bool bz(int x)
{
int num=0;
int key=0;

for(int i=1;i
{
if(d[i]-key
{
num++;
}
else
{
key=d[i];
}]]></description><category></category></item><item><title><![CDATA[火柴棒等式]]></title><link>https://blog.youkuaiyun.com/gengboting1/article/details/78256057</link><guid>https://blog.youkuaiyun.com/gengboting1/article/details/78256057</guid><author>gengboting1</author><pubDate>Tue, 17 Oct 2017 00:37:09 +0800</pubDate><description><![CDATA[#include 
using namespace std;


int a[2333];
int main()
{
int n;
cin>>n;
n-=4;

a[0]=6;a[1]=2;a[2]=5;a[3]=5;a[4]=4;a[5]=5;a[6]=6;a[7]=3;a[8]=7; a[9]=6;

for(int i=10;i
{
a[i]=a[i/10]+a]]></description><category></category></item><item><title><![CDATA[最优贸易]]></title><link>https://blog.youkuaiyun.com/gengboting1/article/details/78256056</link><guid>https://blog.youkuaiyun.com/gengboting1/article/details/78256056</guid><author>gengboting1</author><pubDate>Tue, 17 Oct 2017 00:36:11 +0800</pubDate><description><![CDATA[#include
#include
#include
using namespace std;


int n,m;
int v[100001];
struct edge{
int from,to,nxt;
}edge1[500001],edgen[500001];


int num_edge1,num_edgen;
int head1[100001],headn[1]]></description><category></category></item><item><title><![CDATA[疫情控制 40]]></title><link>https://blog.youkuaiyun.com/gengboting1/article/details/78255482</link><guid>https://blog.youkuaiyun.com/gengboting1/article/details/78255482</guid><author>gengboting1</author><pubDate>Mon, 16 Oct 2017 22:49:04 +0800</pubDate><description><![CDATA[#include
#include
#include
using namespace std;
const int maxn=50001; 


int n,m;
int head[maxn];
int num_edge=0;
int f[maxn][20],d[maxn][20];
int deep[maxn];


 


struct edge{
int ]]></description><category></category></item><item><title><![CDATA[火车运输 25 60]]></title><link>https://blog.youkuaiyun.com/gengboting1/article/details/78155797</link><guid>https://blog.youkuaiyun.com/gengboting1/article/details/78155797</guid><author>gengboting1</author><pubDate>Tue, 03 Oct 2017 19:03:51 +0800</pubDate><description><![CDATA[25
#include
#include
#include
#include
using namespace std;
#define inf 0x7fffffff




int head[10001];


struct edge{
int to,next,w;

}e[50001];
int n,m;
 
 int cnt;
 
 void add]]></description><category></category></item><item><title><![CDATA[观光公交]]></title><link>https://blog.youkuaiyun.com/gengboting1/article/details/78144874</link><guid>https://blog.youkuaiyun.com/gengboting1/article/details/78144874</guid><author>gengboting1</author><pubDate>Sat, 30 Sep 2017 19:12:07 +0800</pubDate><description><![CDATA[#include
using namespace std;


int n,m,k;
int f[1001];
int down[1001],up[1001];
int ready[1001];
int ans=0;
int arrive[1001];
int ma[1001];
bool Wait[1001];
int time,where;


int main(]]></description><category></category></item></channel></rss>