u013268685的专栏(有一种幸福叫AC，有一种期待叫AK)

简单递推，还是wa了很多次没过，原来hdu的long long要用%I64d才能过。。。不明白，不是只比对输出的吗。。。。#define Max 55#includeint M;char s[Max];int a,b;long long c[Max];int main(){ //freopen("input.txt","r",stdin); scanf("%d\n"

Kindergarten ElectionTime Limit: 2 Seconds      Memory Limit: 65536 KBAt the beginning of the semester in kindergarten, the n little kids (indexed from 1 to n, for convenience) in class need

本题枚举第一课树的高度即可B. Trees in a Rowtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe Queen of England has n

Relative RelativesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 3438 Accepted: 1507DescriptionToday is Ted's 100th birthday. A few weeks ago, you were

题意：给出一系列要忽略的单词，这些单词以外的单词都看作关键字。然后给出一些标题，找出标题中所有的关键字，然后按这些关键字的字典序给标题排序。注意两点：相同关键字出现在不同标题中，出现在输入较前位置的标题排在前面（从样例数据可以看出，而且multimap也正是这么做的）；同一个关键字在一个标题中出现多次，关键字位于较前位置的排在前面（从左向右扫描的话就没有问题）。#include#i

A - LIGHTOJ 1005Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%lld & %lluSubmit StatusDescriptionA rook is a piece used in the game of chess which is played on a board

#include #include #include #define max 10001int a[max],b[max];void search(int num,int N){ int low=1,high=N,mid; int ok=0; mid=(low+high)/2; while(low<high) { if(a[mid

本题注意要查找一下输入的人的国家是否已经出现Problem BList of ConquestsInput: standard inputOutput: standard outputTime Limit: 2 secondsIn Act I, Leporello is telling Donna Elvira about his master's long list

字符串处理题，需要注意的是要一直替换到没有所给的字符串为止，所以可以在change函数里返回1（代表查找成功）和0（代表没有要替换的字符了）Problem E: Automatic EditingSource file:autoedit.{c, cpp, java, pas}Input file:autoedit.inOutput fil

C. 座位编号Time Limit: 1000msCase Time Limit: 1000msMemory Limit: 65536KB64-bit integer IO format: %lld      Java class name: MainSubmit StatusFont Size: + -第十届北京师范大学

C.长长长长龙Time Limit: 3000 MSMemory Limit: 32768 KTotal Submit: 202 (73 users)Total Accepted: 50 (46 users)Special Judge: NoDescription时间：今天是

A. Nutstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have a nuts and lots of boxes. The boxes have a

#include#define MAX 1000010int N,M;int ans1[MAX],ans2[MAX];int main(){ //freopen("input.txt","r",stdin); while(scanf("%d%d",&N,&M)!=EOF) { if(!M&&!N)return 0; int t=-1; for(i

不废话，直接代码#define Max 55#include#include#includeint n;long long c[Max],k[Max],m[Max];//c,k,m分别为长度为n时方法数和非o的字符个数和字符o的个数void ans(){ k[1]=2;m[1]=1;c[1]=3; for(int i=2;i<=50;i++) {

题目1 : Lost in the City时间限制:10000ms单点时限:1000ms内存限制:256MB描述Little Hi gets lost in the city. He does not know where he is. He does not know which direction is north.Fortun