串
文章平均质量分 65
Grit_ICPC
Dielts
展开
-
Poj 2503 Babelfish(map+串的处理)
BabelfishTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 36520 Accepted: 15587DescriptionYou have just moved from Waterloo to a big city. The people here原创 2015-08-07 15:19:12 · 445 阅读 · 0 评论 -
PAT 1007 A除以B (20) (大数取余+除法)
思路:串的处理。#include<map>#include<queue>#include<cmath>#include<cstdio>#include<stack>#include<iostream>#include<cstring>#include<algorithm>#define ll long long#define inf 0x3f3f3f3f#define eps 1原创 2016-04-19 10:45:08 · 369 阅读 · 0 评论 -
字符串遇到指定的字符停止输入
void CIN(char *st,int len){ int i;char ch=','; for(i = 0;i < len;++ i){ st[i] = getchar(); if(st[i] == ch) break; } st[i] = '\0';}原创 2016-04-15 14:22:46 · 6077 阅读 · 0 评论 -
SDUT 2151 Phone Number 2010年山东省第一届ACM大学生程序设计竞赛
#include<map>#include<cmath>#include<queue>#include<cmath>#include<string>#include<cstdio>#include<stack>#include<iostream>#include<cstring>#include<algorithm>#define inf 0x3f3f3f3f#define e原创 2016-04-10 19:07:21 · 393 阅读 · 0 评论 -
KMP之自创匹配- -
给定两个串问能不能“唯一的确定”,后者是前者的子串,能的话输出在模式串中的位置,否则输出-1.思路:主要控制当有2 3 2 3 2 3 等这种情况时的问题,可以用一个计数器来进行控制。#include#include#include#include#include#include#include#include#define ll __int64#define原创 2015-11-04 16:59:45 · 330 阅读 · 0 评论 -
POJ 2602 Superlong sums(模拟大数加法)
Superlong sumsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 22715 Accepted: 6709DescriptionThe creators of a new programming language D++ have found out原创 2015-10-02 20:04:51 · 486 阅读 · 0 评论 -
大数+同余模
给定两数n,m(分别#includeusing namespace std;char a[1000],b[1000];int look(char a[] ){ int l=strlen(a); int an=0; for(int i=0; i<l; i++) { an= ((a[i]-'0')+an*10)%11;原创 2015-09-11 19:55:57 · 591 阅读 · 0 评论 -
Codeforces Round #256 (Div. 2) B. Suffix Structures
Bizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team.At a competition the "Bizons" got the following problem: "You are given two distinct words (strings of English lette原创 2015-08-20 15:27:07 · 798 阅读 · 0 评论 -
Poj 1936 All in All
All in AllTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 29727 Accepted: 12369DescriptionYou have devised a new encryption technique which encodes a mess原创 2015-08-10 10:05:13 · 497 阅读 · 0 评论 -
统计汉字
Sample Input2WaHaHa! WaHaHa! 今年过节不说话要说只说普通话WaHaHa! WaHaHa!马上就要期末考试了Are you ready? Sample Output149#includeusing namespace std;char a[10000000];int main(){ int原创 2015-07-29 14:27:47 · 446 阅读 · 0 评论 -
KMP的next[]的求解方法
http://wenku.baidu.com/link?url=giJqnvsvpuiJf8t8q50xyYW0vEhUgITo52tWMgErtwijZIWCK_XWlylHoxbRzU_E-8SkBvEvI_sViAneSY6es1SxayDSc9FyjlEp50Cp1Oy原创 2015-12-30 15:34:52 · 506 阅读 · 0 评论