摘要：
JAVAMAN is visiting Dream City and he sees a yard of gold coin trees. There aren trees in the yard. Let's call them tree 1, tree 2 ...and treen. At th 阅读全文
摘要：
Chiaki has n intervals and thei-th of them is [li,ri]. She wants to delete some intervals so that there does not exist three intervalsa,b andc such th 阅读全文
摘要：
我想我是和Segmentation Fault有仇，我一直以为是空间开大的问题，然后一直减少空间，还是SF，谁让n没有给范围了，qwq。教训：以后注意输入范围和开的空间大小。#include#include#include#includeusing namespace std;int a[34000... 阅读全文
摘要：
题意：两家原始人（猴）打交道后成为一家猴，打交道时两家分别派出最帅的两位猴子，颜值各自减半，问每次打交道后新家族最帅的猴子的颜值。当然，已经是一家子就没有必要打交道了，因为没有猴希望颜值降低，毕竟还得靠这个吃饭。裸裸的并查集+大根堆：由于在下写的queue，需要重量优化，不然超时#include#i... 阅读全文
摘要：
题目要求FIFO#include#include#include#include#include#include#includeusing namespace std;struct in{ string name; int id; int dex; in(string s,int d,int x):... 阅读全文
摘要：
Accurately Say "CocaCola"!范围找到：1——700左右，然后打表就ok了#include#include#includeusing namespace std;bool a[810];int sum[810];int pos[810];void _judge(int v){ ... 阅读全文
摘要：
宣之于口 阅读全文
摘要：
Kinds of FuwasTime Limit: 2 Seconds Memory Limit:65536 KBIn the year 2008, the 29th Olympic Games will be held in Beijing. This will signify the ... 阅读全文
摘要：
http://blog.csdn.net/hackbuteer1/article/details/7450250//AW程序#include #include #include #include #define max 101#define maxnum 60#define maxint 10000... 阅读全文
摘要：
一：pow，曾经用递归溢出void _pow(int a,int b){ while(b){ if(b%2&1) { ans*a;b--; ans=ans*pow(pos(a,b/2),2); } else ans=ans*pow(pos(a,b/2),... 阅读全文