Jinbao

并查集定义：https://zh.wikipedia.org/wiki/%E5%B9%B6%E6%9F%A5%E9%9B%86 /*并查集模板*/ int parent[MAXN]; int rank[MAXN]; void init(int n){ for (int i=0;i<=n;i++){ parent[i]=i; rank[i]=0;

Matrix Power Series Time Limit: 3000MS   Memory Limit: 131072K Total Submissions: 15997   Accepted: 6840 Description Given a n × n matrix A and a positive integer k,

Fibonacci Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 9769   Accepted: 6959 Description In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = F

Counting Black Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 10360   Accepted: 6691 Description There is a board with 100 * 100 grids as shown below. The

1001 Missing number Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 748    Accepted Submission(s): 275 Problem Description T

Sumdiv Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 15033   Accepted: 3706 Description Consider two natural numbers A and B. Let S be the sum of all nat

Humidex Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 17719   Accepted: 6420 Description Adapted from Wikipedia, the free encyclopedia The humidex is a

Ancient Cipher Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 29154   Accepted: 9547 Description Ancient Roman empire had a strong government system with

Moving Tables Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 26782   Accepted: 8962 Description The famous ACM (Advanced Computer Maker) Company has rente

How many Fibs? Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10748   Accepted: 3982 Description Recall the definition of the Fibonacci numbers:  f1 := 1

The Idiot of the Year Contest! Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 3744   Accepted: 1952 Description There is just one basic rule in the Idiot

EXTENDED LIGHTS OUT Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 7202   Accepted: 4718 Description In an extended version of the game Lights Out, is a p

Solution to the n Queens Puzzle Time Limit: 1000MS   Memory Limit: 131072K Total Submissions: 3494   Accepted: 1285   Special Judge Description The eight queens puz

二叉树的链式存储结构是一类重要的数据结构，其形式定义如下： [cpp] view plaincopy //二叉树结点  typedef struct BiTNode{      //数据      char data;      //左右孩子指针      struct BiTNode *lchild,*rchild;  }BiTNode,*BiTree;   二

Tree Recovery Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 11955   Accepted: 7505 Description Little Valentine liked playing with binary trees very much

Dirichlet's Theorem on Arithmetic Progressions Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 16333   Accepted: 8205 Description If a and d are relatively

Ubiquitous Religions Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 25316   Accepted: 12489 Description There are so many different religions in the world

Is It A Tree? Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 22790   Accepted: 7814 Description A tree is a well-known data structure that is either empty

The Suspects Time Limit: 1000MS   Memory Limit: 20000K Total Submissions: 23545   Accepted: 11477 Description Severe acute respiratory syndrome (SARS), an atypical pneu

线段树多lazy-tag（两个）题意：有长为N的数列，不妨设为a1,a2,…,aN 。有如下三种操作形式： (1)把数列中的一段数全部乘一个值; (2)把数列中的一段数全部加一个值; (3)询问数列中的一段数的和，由于答案可能很大，你只需输出这个数模P的值。 解题思路： 结构体定义：typdef long long ll; struct Node{ int l,r; l

离散化的思想： 对于这样的数据 （3，10000）， （9，1000000）， （5，100000）， （1，1000）， （7，1000000） 我们可以将其处理为 （2，7）， （5，9）， （3，8）， （1，6）， （4，9） 我们再对离散化之后的数据进行处理就行了。 题目意思： n（n 求出最后还能看见多少张海报。 参考代码：

Happy 2006 Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 9987   Accepted: 3434 Description Two positive integers are said to be relatively prime to each

Red and Black Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 24058   Accepted: 13007 Description There is a rectangular room, covered with square tiles. E

Pascal Library Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 5445   Accepted: 2610 Description Pascal University, one of the oldest in the country, needs

A Simple Question of Chemistry Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 6666   Accepted: 4426 Description Your chemistry lab instructor is a very en

01000001 Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10571   Accepted: 3345 Description Adding binary numbers is a very simple task, and very similar t

Costume Party Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 11793   Accepted: 4770 Description It's Halloween! Farmer John is taking the cows to a costum

题意：有长为n的数列，初始化为全部为0，我们对它有三个操作： (1)把数列中的一段区间全部乘一个值;  (2)把数列中的一段区间全部加一个值;  (3)把数列中的一段区间全部替换成一个值； 然后再对它有一个查询操作： 求数列中的一段区间的每个数的p次方之和（1 解题思路：     因为p只有三个值，所以我们可以将这三个值分别进行求解，我将它们定义为sum，sum2，sum

Treap          Treap=Tree+Heap，Treap是一个二叉搜索树，它的左右子树都分别是一个Treap，和一般二叉排序树不同的是，Treap记录一个额外的数据(v)，就是优先级(rank)。Treap在以关键字构成二叉排序树的同时，还满足堆的性质，不过Treap不一定是完全二叉树，而堆必须是完全二叉树.   1.结构体定义： struct data{

Sky Code Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 1694   Accepted: 523 Description Stancu likes space travels but he is a poor software developer an

Are We There Yet? Time Limit: 2 Seconds      Memory Limit: 65536 KB Laurie's little brother Joey has been playing Find the Cookie with her. However, after the 32,767th time, Laurie is tired of i

题意： 告诉你a,b,n,m,求 0 解题思路：     我们首先对（a+sqrt(b))^n进行处理，由a+sqrt(b))^n的展开式我们可以知道 (a+sqrt(b))^n = Xn + Yn * sqrt(b); 那么 ( a + sqrt( b ) )^( n + 1 ) = ( a + sqrt( b ) ) * ( Xn + Yn * sqrt(b) ) = (

Balanced Lineup Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 37869   Accepted: 17751 Case Time Limit: 2000MS Description For the daily milking, Far

Ultra-QuickSort Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 46293 Accepted: 16846 Description In this problem, you have to analyze

I Hate It Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 45599    Accepted Submission(s): 17897 Problem Description 很多学校流行一种比较的习惯。

The 3n + 1 problem  Background Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will b

Palindrome Numbers Time Limit: 2 Seconds      Memory Limit: 65536 KB A palindrome is a word, number, or phrase that reads the same forwards as backwards. For example, the name "anna" is a palind

Sum of Factorials Time Limit: 1000MS Memory Limit: 30000K Description John von Neumann, b. Dec. 28, 1903, d. Feb. 8, 1957, was a Hungarian-American mathematician who made important contr

GCD & LCM Time Limit: 2 Seconds      Memory Limit: 65536 KB Given x and y (2 1) p and q are positive integers; 2) GCD(p, q) = x; 3) LCM(p, q) = y. Input x and y, one line for each test

Round and Round We Go Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 12064   Accepted: 5630 Description A cyclic number is an integer n digits in length w