
POJ中的字符串
TheAlgorithmArt
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
POJ_1056_IMMEDIATE DECODABILITY
<br />#include <iostream>#include <vector>#include <string>#include <algorithm>using namespace std;int main(){ freopen("test.txt", "r", stdin); int n; vector<string> v; string s; int t = 1; while (cin>>s) { if (s[0] == '9')原创 2010-08-26 01:00:00 · 587 阅读 · 0 评论 -
POJ_3630_Phoe List
水题#include using namespace std;char phone[10001][11];int cmp(const void* a, const void* b){ return strcmp((char*)a, (char*)b);}int main(){ int t, n; freopen("test.txt", "r", stdin); scanf("%d", &t); while (t--) { scanf("%d"原创 2010-08-25 20:14:00 · 445 阅读 · 0 评论 -
POJ_3510_A Tale from the Dark Side of the Moon
#include #include using namespace std;int main(){ freopen("test.txt", "r", stdin); while(true) { string s1; string s2 = ""; getline(cin, s1); int l = s1.length(); bool flag = true; for (int i = 0; i原创 2010-08-26 00:35:00 · 781 阅读 · 0 评论 -
POJ_3356_AGTC
<br />#include <iostream>#include <string>using namespace std;string s1, s2;int l1, l2;int LCS(int x, int y){ if (x >= l1 || y >= l2) return 0; if (s1[x] == s2[y]) return 1+LCS(x+1, y+1); return max(LCS(x, y+1), LCS(x+1, y));}原创 2010-08-26 00:29:00 · 414 阅读 · 0 评论