10 2018 档案
摘要：http://poj.org/problem?id=3734 Description Panda has received an assignment of painting a line of blocks. Since Panda is such an intelligent boy, he s
阅读全文
摘要：http://poj.org/problem?id=3268 Description One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party
阅读全文
摘要：http://poj.org/problem?id=2253 Description Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on
阅读全文
摘要：#include using namespace std; const int mod = 1e9 + 7; int N; struct Matrix{ long long m[2][2]; }; Matrix Mul(Matrix A, Matrix B) { Matrix ret; for(int i = 0; i < 2; i ++) { f...
阅读全文
摘要：http://acm.hdu.edu.cn/showproblem.php?pid=2217 Problem Description Wangye is interested in traveling. One day, he want to make a visit to somedifferen
阅读全文
摘要：http://acm.hdu.edu.cn/showproblem.php?pid=2224 Problem Description There are n points on the plane, Pi(xi, yi)(1 <= i <= n), and xi < xj (i<j). You be
阅读全文
摘要：http://acm.hdu.edu.cn/showproblem.php?pid=2212 Problem Description A DFS(digital factorial sum) number is found by summing the factorial of every digi
阅读全文
摘要：http://codeforces.com/contest/1015/problem/D There are nn houses in a row. They are numbered from 11 to nn in order from left to right. Initially you
阅读全文
摘要：#include using namespace std; struct Node { int key; Node *right, *left, *parent; }; Node *root, *NIL; void insert(int k) { Node *y = NIL; Node *x = root; Node *z; z = (N...
阅读全文
摘要：https://pintia.cn/problem-sets/994805342720868352/problems/994805416519647232 If you are a fan of Harry Potter, you would know the world of magic has
阅读全文
摘要：https://pintia.cn/problem-sets/994805342720868352/problems/994805425780670464 A linked list consists of a series of structures, which are not necessar
阅读全文
摘要：http://codeforces.com/contest/1015/problem/C Ivan has nn songs on his phone. The size of the ii-th song is aiai bytes. Ivan also has a flash drive whi
阅读全文
摘要：http://codeforces.com/contest/1015/problem/B You are given two strings ss and tt. Both strings have length nn and consist of lowercase Latin letters.
阅读全文
摘要：http://codeforces.com/contest/1015/problem/A You are given a set of nn segments on the axis OxOx, each segment has integer endpoints between 11 and mm
阅读全文
摘要：https://pintia.cn/problem-sets/994805342720868352/problems/994805462535356416 Given any string of N (≥) characters, you are asked to form the characte
阅读全文
摘要：https://pintia.cn/problem-sets/994805046380707840/problems/994805138600869888 一个正整数 N 的因子中可能存在若干连续的数字。例如 630 可以分解为 3×5×6×7，其中 5、6、7 就是 3 个连续的数字。给定任一正整
阅读全文
摘要：https://pintia.cn/problem-sets/994805342720868352/problems/994805474338127872 Programming Ability Test (PAT) is organized by the College of Computer S
阅读全文
摘要：https://pintia.cn/problem-sets/994805342720868352/problems/994805476473028608 A number that will be the same when it is written forwards or backwards
阅读全文
摘要：https://pintia.cn/problem-sets/994805342720868352/problems/994805468327690240 Excel can sort records according to any column. Now you are supposed to
阅读全文
摘要：https://pintia.cn/problem-sets/994805342720868352/problems/994805500414115840 It is vitally important to have all the cities connected by highways in
阅读全文
摘要：http://codeforces.com/contest/1029/problem/D You are given an array aa, consisting of nn positive integers. Let's call a concatenation of numbers xx a
阅读全文
摘要：http://codeforces.com/contest/1029/problem/A You are given a string tt consisting of nn lowercase Latin letters and an integer number kk. Let's define
阅读全文
摘要：http://codeforces.com/contest/1066/problem/E You are given two huge binary integer numbers aa and bb of lengths nn and mm respectively. You will repea
阅读全文
摘要：http://codeforces.com/contest/1029/problem/B You are given a problemset consisting of nn problems. The difficulty of the ii-th problem is aiai. It is
阅读全文
摘要：http://codeforces.com/contest/1029/problem/C You are given nn segments on a number line; each endpoint of every segment has integer coordinates. Some
阅读全文
摘要：http://codeforces.com/contest/1066/problem/D Maksim has nn objects and mm boxes, each box has size exactly kk. Objects are numbered from 11 to nn in o
阅读全文
摘要：http://codeforces.com/contest/1066/problem/C You have got a shelf and want to put some books on it. You are given qq queries of three types: L idid —
阅读全文
摘要：http://codeforces.com/contest/1066/problem/A Vova plans to go to the conference by train. Initially, the train is at the point 11 and the destination
阅读全文
摘要：http://poj.org/problem?id=2240 Description Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into m
阅读全文
摘要：http://poj.org/problem?id=3259 Description While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is ver
阅读全文
摘要：http://poj.org/problem?id=3276 Description Farmer John has arranged his N (1 ≤ N ≤ 5,000) cows in a row and many of them are facing forward, like good
阅读全文
摘要：http://poj.org/problem?id=1004 Description Larry graduated this year and finally has a job. He's making a lot of money, but somehow never seems to hav
阅读全文
摘要：https://pintia.cn/problem-sets/994805342720868352/problems/994805451374313472 The magic shop in Mars is offering some magic coupons. Each coupon has a
阅读全文
摘要：http://poj.org/problem?id=3320 Description Jessica's a very lovely girl wooed by lots of boys. Recently she has a problem. The final exam is coming, y
阅读全文
摘要：http://poj.org/problem?id=2456 Description Farmer John has built a new long barn, with N (2 <= N <= 100,000) stalls. The stalls are located along a st
阅读全文
摘要：http://poj.org/problem?id=1258 Description Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connecti
阅读全文
摘要：http://poj.org/problem?id=1703 Description The police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs
阅读全文
摘要：http://poj.org/problem?id=2421 There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can
阅读全文
摘要：http://poj.org/problem?id=1287 You are assigned to design network connections between certain points in a wide area. You are given a set of points in
阅读全文
摘要：#include using namespace std; const int maxn = 5e5 + 10; int h[maxn], v[maxn], nx[maxn], in[maxn]; int n, m, sz; void add(int a, int b) { v[sz] = b; nx[sz] = h[a]; h[a] = sz; in[b] ++; s...
阅读全文
摘要：http://poj.org/problem?id=1251 The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads
阅读全文
摘要：http://poj.org/problem?id=1797 Description Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business.
阅读全文
浙公网安备 33010602011771号