摘要:
K-th Number Time Limit: 20000MS Memory Limit: 65536K Case Time Limit: 2000MS Description You are working for Macrohard company in data structures depa 阅读全文
摘要:
As we all know,a palindrome number is the number which reads the same backward as forward,such as 666 or 747.Some numbers are not the palindrome numbe 阅读全文
摘要:
Battlestation Operational Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description > The Death Star, known 阅读全文
摘要:
Tree Time Limit: 1000MS Memory Limit: 30000K Description Give a tree with n vertices,each edge has a length(positive integer less than 1001). Define d 阅读全文
摘要:
Ch’s gift Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description Mr. Cui is working off-campus and he mi 阅读全文
摘要:
对于每个正整数 nn,我们定义它的 pp 进制表示 由 mm 个非负整数 a_1, a_2, \cdots, a_ma1,a2,⋯,am 组成,并且这些数字满足 \displaystyle n = \sum_{i = 1}^{m}{a_i p^{i - 1}}n=i=1∑m 阅读全文
摘要:
String Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Problem Description Bob has a dictionary with N words in it. 阅读全文
摘要:
Classic Quotation Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Problem Description When online chatting, we can 阅读全文
摘要:
struct NTT { ll Pow(ll x,ll n) { ll ans=1,base=x%MOD; while(n) { if(n&1) ans=ans*base%MOD; base=base*base%MOD; n>>=1; } return ans; } ll getInv(ll x) 阅读全文
摘要:
小 Q 的棋盘 题目描述 小Q正在设计一种棋类游戏。在小Q设计的游戏中,棋子可以放在棋盘上的格点中。某些格点之间有连线,棋子只能在有连线的格点之间移动。整个棋盘上共有V个格点,编号为0,1,2…,V-1,它们是连通的,也就是说棋子从任意格点出发,总能到达所有的格点。小Q在设计棋盘时,还保证棋子从一个 阅读全文