上一页 1 ··· 7 8 9 10 11 12 13 14 15 ··· 25 下一页

2014年4月18日

HDOJ -- 1015

摘要: 1.DFS 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 using namespace std; 9 char str[20], ans[10]; 10 int vis[20], fl... 阅读全文

posted @ 2014-04-18 15:06 ~Love() 阅读(149) 评论(0) 推荐(0)

HDOJ --- 1258

摘要: 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #define MAXN 20 8 using namespace std; 9 int a[MAXN], temp[MAXN], vis[MAXN]; 10 ... 阅读全文

posted @ 2014-04-18 15:01 ~Love() 阅读(155) 评论(0) 推荐(0)

HDOJ --1172

摘要: 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #define MAXN 105 8 using namespace std; 9 typedef struct{10 int num[10], a, ... 阅读全文

posted @ 2014-04-18 15:00 ~Love() 阅读(162) 评论(0) 推荐(0)

HDJ -- 1022

摘要: 1 #include 2 #include 3 #include 4 #define MAXN 10 5 using namespace std; 6 int s[MAXN], p[MAXN]; 7 string in, out; 8 int main(){ 9 int n, fl... 阅读全文

posted @ 2014-04-18 14:58 ~Love() 阅读(131) 评论(0) 推荐(0)

CF -- 414A

摘要: 1 #include 2 #include 3 #include 4 using namespace std; 5 int main(){ 6 int n,k; 7 while(~scanf("%d%d",&n,&k)){ 8 if(n == 1 && k > 0... 阅读全文

posted @ 2014-04-18 14:57 ~Love() 阅读(91) 评论(0) 推荐(0)

2014年4月11日

南阳理工OJ -- 15 括号匹配

摘要: 括号匹配(二)时间限制:1000ms | 内存限制:65535KB难度:6描述给你一个字符串,里面只包含"(",")","[","]"四种符号,请问你需要至少添加多少个括号才能使这些括号匹配起来。如:[]是匹配的([])[]是匹配的((]是不匹配的([)]是不匹配的输入第一行输入一个正整数N,表示测试数据组数(N 2 #include 3 #define MAXN 111 4 using namespace std; 5 int dp[MAXN][MAXN]; 6 string str; 7 int main(){ 阅读全文

posted @ 2014-04-11 11:44 ~Love() 阅读(271) 评论(0) 推荐(0)

2014年4月7日

POJ --- 1200 Crazy Search

摘要: Crazy SearchTime Limit:1000MSMemory Limit:65536KTotal Submissions:21585Accepted:6101DescriptionMany people like to solve hard puzzles some of which may lead them to madness. One such puzzle could be finding a hidden prime number in a given text. Such number could be the number of different substring 阅读全文

posted @ 2014-04-07 11:49 ~Love() 阅读(377) 评论(0) 推荐(0)

POJ --- 1002

摘要: 487-3279Time Limit:2000MSMemory Limit:65536KTotal Submissions:232876Accepted:40603DescriptionBusinesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phrase. For example, you can call the University of Waterloo by diali 阅读全文

posted @ 2014-04-07 10:17 ~Love() 阅读(165) 评论(0) 推荐(0)

2014年4月6日

C++ STL map

摘要: 这个链接里面对map的讲解比较好。http://blog.csdn.net/iicy266/article/details/11906189 阅读全文

posted @ 2014-04-06 21:49 ~Love() 阅读(124) 评论(0) 推荐(0)

2014年4月3日

HDOJ --- 2196 Computer

摘要: ComputerTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2764Accepted Submission(s): 1415Problem DescriptionA school bought the first computer some time ago(so this computer's id is 1). During the recent years the school bought N-1 new computers 阅读全文

posted @ 2014-04-03 21:45 ~Love() 阅读(133) 评论(0) 推荐(0)

上一页 1 ··· 7 8 9 10 11 12 13 14 15 ··· 25 下一页

导航