Grit_ICPC的博客

Babelfish Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 36520   Accepted: 15587 Description You have just moved from Waterloo to a big city. The people here

Sample Input 2 WaHaHa! WaHaHa! 今年过节不说话要说只说普通话WaHaHa! WaHaHa! 马上就要期末考试了Are you ready?   Sample Output 14 9 #include using namespace std; char a[10000000]; int main() { int

All in All Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 29727   Accepted: 12369 Description You have devised a new encryption technique which encodes a mess

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

给定两数n,m（分别 #include using 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;

Superlong sums Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 22715   Accepted: 6709 Description The creators of a new programming language D++ have found out

给定两个串问能不能“唯一的确定”，后者是前者的子串，能的话输出在模式串中的位置，否则输出-1. 思路：主要控制当有2 3 2 3      2 3  等这种情况时的问题，可以用一个计数器来进行控制。 #include #include #include #include #include #include #include #include #define ll __int64 #define

#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

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'; }

思路：串的处理。#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

http://wenku.baidu.com/link?url=giJqnvsvpuiJf8t8q50xyYW0vEhUgITo52tWMgErtwijZIWCK_XWlylHoxbRzU_E-8SkBvEvI_sViAneSY6es1SxayDSc9FyjlEp50Cp1Oy