摘要：
2588: Spoj 10628. Count on a tree Description 给定一棵N个节点的树，每个点有一个权值，对于M个询问(u,v,k)，你需要回答u xor lastans和v这两个节点间第K小的点权。其中lastans是上一个询问的答案，初始为0，即第一个询问的u是明文。 阅读全文
摘要：
KiKi's K-Number Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description For the k-th number, we all shoul 阅读全文
摘要：
Fxx and game Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others) Problem Description Young theoretical computer scientis 阅读全文
摘要：
D. Strip time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Alexandra has a paper strip with 阅读全文
摘要：
To the moon Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description BackgroundTo The Moon is a independen 阅读全文
摘要：
Super Mario Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description Mario is world-famous plumber. His “b 阅读全文
摘要：
Kth number Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description Give you a sequence and ask you the k 阅读全文
摘要：
A. Pupils Redistribution time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A. Pupils Redist 阅读全文
摘要：
A. Shell Game time limit per test 0.5 seconds memory limit per test 256 megabytes input standard input output standard output Bomboslav likes to look 阅读全文
摘要：
E. GukiZ and GukiZiana time limit per test 10 seconds memory limit per test 256 megabytes input standard input output standard output Professor GukiZ 阅读全文