beat anyone if necessary

Spoj数论专题http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=8035#overview  Problem A SPOJ ARCTAN Use of Function Arctan Problem B SPOJ CUTSQRS Cutting off

读入所有query,按右端点递增排序，hash记录当前值的下标，删去(0,t)中相同且非最后一次出现的元素，计算每个query Best solutions for Problem 3333 Language : AllG++GCCC++CPascalJava Rank Author Exe. Time Exe. Memory Code Len. Langu

#include #include using namespace std; #define lrt (rt<<1) #define rrt (rt<<1|1) #define mid ((l+r)>>1) #define lson l,mid,lrt #define rson mid+1,r,rrt #define llen mid-l+1 #define rlen r-mid const

http://acm.timus.ru/problem.aspx?space=1&num=1016 http://acm.hust.edu.cn:8080/judge/problem/viewProblem.action?id=14076 1016. Cube on the Walk Time Limit: 2.0 second Memory Limit: