摘要：
题意：取出字符串Str里的两个串S，T，问对应位置的的字符在否有一一映射关系。 hash：对于每个字符s=‘a’-‘z’，我们任意找一个i，满足Si==s，（代码里用lower_bound在区间找到最小的位置i）其对应的字符为Ti==t。然后我们判断这段区间里s的hash值是否等于t的hash值。不 阅读全文
摘要：
都是取的模板，这几天做的素数题挺多的，所以整理了放在这里，感觉有一天回用到的！ SPOJ:Nth Prime： 求第N个素数，N<1e9。 #include<bits/stdc++.h> using namespace std; typedef long long ll; const int N=2 阅读全文
摘要：
It is Dandiya Night! A certain way how dandiya is played is described: There are N pairs of people playing at a time. Both the person in a pair are pl 阅读全文
摘要：
String Play Milo has a string S of length L. Tutu picks a random prefix and Mota picks a random suffix ofS. Now, Chotku is given a task of concatenati 阅读全文
摘要：
DCE Coders admins are way much geekier than they actually seem! Kartik has been following that tradition lately. How? Well, he took the inversion coun 阅读全文
摘要：
One of DB and TN common interests is traveling. One day, they went to Grand Line and found One Piece ! The One Piece treasure has n gold coins (n is e 阅读全文
摘要：
Given a sequence of n numbers a1, a2, ..., an and a number of k-queries. A k-query is a triple (i, j, k) (1 ≤ i ≤ j ≤ n). For each k-query (i, j, k), 阅读全文
摘要：
Finding factorials are easy but they become large quickly that is why Lucky hate factorials. Today he have another task related to factorials. For a g 阅读全文
摘要：
There is a robot on the 2D plane. Robot initially standing on the position (0, 0). Robot can make a 4 different moves: After moving N times Robot gets 阅读全文
摘要：
The weather is fine today and hence it's high time to climb the nearby pine and enjoy the landscape. The pine's trunk includes several branches, locat 阅读全文