dfs水题
#include
#include
#define maxn 20+5
#define pr 100000
using namespace std;
int n;
int visit[maxn];
int re[maxn];
int ans;
int u[pr]={0};
void prime()
{
int i,j;
u[0]=1,u[1]=1;
for(i=2;i<pr;...
分类：
其他好文 时间：
2015-05-09 16:30:25
阅读次数：
105
Strange Country II
You want to visit a strange country. There are n cities in the country. Cities are numbered from 1 to n. The unique way to travel in the country is taking planes. Strangely,
in t...
分类：
其他好文 时间：
2015-05-04 22:13:34
阅读次数：
111
Written by Samson Mulder @ Samsonlab.com For more information visit http://www.samsonlab.com 最近国外的Open Course很火。很多同学喜欢看斯坦福，麻省的公开课程。但是国产大学生最大的悲剧就是，不愿做作...
分类：
其他好文 时间：
2015-05-04 13:47:40
阅读次数：
207
DescriptionFarmer John goes to Dollar Days at The Cow Store and discovers an unlimited number of tools on sale. During his first visit, the tools are ...
分类：
其他好文 时间：
2015-04-29 19:41:54
阅读次数：
123
POJ2135 Farm Tour 最大流 最小费用流
When FJ's friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N, the first of which contains his house and the Nth of which contains the big barn. A total M (1 <...
分类：
其他好文 时间：
2015-04-29 11:54:17
阅读次数：
151
This year is the 60th anniversary of NJUST, and to make the celebration more colorful, Tom200 is going to invite distinguished alumnus back to visit and take photos.
After carefully planning, Tom200 announced his activity plan, one that contains two char...
分类：
其他好文 时间：
2015-04-29 10:07:17
阅读次数：
149
这个题要注意啦 1 在这个题中也是素数。 唉 害我苦苦找了这么久 后来人注意就行了
#include
#define num 100010
long long mark[num+10]={0},visit[num+10]={1},t=0,rec[num+10];
int main()
{
for(long long i=2;i<=num;i++)
{
if(!visit[i])...
分类：
其他好文 时间：
2015-04-28 18:33:09
阅读次数：
102
Problem Description
Ant Country consist of N towns.There are M roads connecting the towns.
Ant Tony,together with his friends,wants to go through every part of the country.
They intend to visit every road , and every road must be visited for exact one t...
分类：
其他好文 时间：
2015-04-27 13:22:54
阅读次数：
148
表t_alibaba_data的数据结构如下：各列含义分别是：用户id(user_id)，品牌id(brand_id)，用户行为(type, 其中，点击为0，购买为1，加入收藏为2，加入购物车为3)，产生行为的时间(visit_datetime)。一、用一条sql语句，找出点击过热销品牌(Top10...
分类：
数据库 时间：
2015-04-25 22:31:46
阅读次数：
155
优先队列bfs，无难度，走x不用花时间，走“.”时间为1；
#include
#include
#include
#define maxn 1000+5
using namespace std;
char mapp[maxn][maxn];
int visit[maxn][maxn];
int dir[4][2]={{0,1},{0,-1},{1,0},{-1,0}};
int n,m;
in...
分类：
其他好文 时间：
2015-04-24 09:20:00
阅读次数：
115
