摘要:
Nastya Studies Informatics time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Today on Infor 阅读全文
摘要:
poj主席树裸题 http://poj.org/problem?id=2104 mark一下主席树的写法以及离散化的方法 #include<iostream> #include<algorithm> #define M 200005 using namespace std; int tot=0; s 阅读全文
摘要:
Description: Goldbach's conjecture is one of the oldest and best-known unsolved problems in number theory and all of mathematics. It states: Every eve 阅读全文
摘要:
5092: Honey Heist 题目描述 0x67 is a scout ant searching for food and discovers a beehive nearby. As it approaches the honeycomb,0x67 can sense an area in 阅读全文