Meek

摘要： Alice's present Description As a doll master, Alice owns a wide range of dolls, and each of them has a number tip on it's back, the tip can be treated 阅读全文

摘要： 2588: Spoj 10628. Count on a tree Description 给定一棵N个节点的树，每个点有一个权值，对于M个询问(u,v,k)，你需要回答u xor lastans和v这两个节点间第K小的点权。其中lastans是上一个询问的答案，初始为0，即第一个询问的u是明文。 阅读全文

摘要： K-th Number Description You are working for Macrohard company in data structures department. After failing your previous task about key insertion you 阅读全文

摘要： Caocao's Bridges Problem Description Caocao was defeated by Zhuge Liang and Zhou Yu in the battle of Chibi. But he wouldn't give up. Caocao's army sti 阅读全文

摘要： Problem A: Krito的讨伐 Description Krito终于干掉了99层的boss，来到了第100层。第100层可以表示成一颗树，这棵树有n个节点（编号从0到n-1），树上每一个节点可能有很多只怪物。 Krito现在在0号节点，现在它想要区清除这一层所有的怪物。他现在有atk大小的 阅读全文

摘要： Problem F: 我是好人4 Description 众所周知，我是好人！所以不会出太难的题，题意很简单 给你n个数，问你1000000000（含1e9）以内有多少个正整数不是这n个数任意一个的倍数 最后友情提供解题代码（我真是太好人了） void solve(int p[], int n) { 阅读全文

摘要： Problem 1608 - Calculation Description Today, Alice got her math homework again! She had n integers, and she needed to divide them into several piles 阅读全文

摘要： Problem 1603 - Minimum Sum Description There are n numbers A[1] , A[2] .... A[n], you can select m numbers of it A[B[1]] , A[B[2]] ... A[B[m]] ( 1 <= 阅读全文

摘要： 1013: [JSOI2008]球形空间产生器sphere Description 有一个球形空间产生器能够在n维空间中产生一个坚硬的球体。现在，你被困在了这个n维球体中，你只知道球面上n+1个点的坐标，你需要以最快的速度确定这个n维球体的球心坐标，以便于摧毁这个球形空间产生器。 有一个球形空间产生 阅读全文

摘要： Placing Lampposts As a part of the mission ‘Beautification of Dhaka City’, the government has decided to replace all theold lampposts with new expensiv 阅读全文