摘要:
Description Description Both Saya and Kudo like balloons. One day, they heard that in the central park, there will be thousands of people fly balloons 阅读全文
摘要:
我要逼逼:在随笔中添加你想要的一张图片,然后点击右键 -> “检查元素” -> 找到地址。然后点击“管理” -> “设置” -> “页面定制CSS代码” -> 粘贴你要的代码 这是我的背景: /*simplememory*/ #google_ad_c1, #google_ad_c2 {display 阅读全文
摘要:
链接:https://ac.nowcoder.com/acm/contest/888/G来源:牛客网 题目描述 Gromah and LZR have entered the seventh level. There are a sequence of gemstones on the wall. 阅读全文
摘要:
Problem Description Give you n ( n < 10000) necklaces ,the length of necklace will not large than 100,tell meHow many kinds of necklaces total have.(i 阅读全文
摘要:
Problem Description For a positive integer n, let's denote function f(n,m) as the m-th smallest integer x that x>n and gcd(x,n)=1. For example, f(5,1) 阅读全文
摘要:
Problem Description In computer science, a heap is a specialized tree-based data structure which is essentially an almost complete tree that satisfies 阅读全文
摘要:
链接:https://ac.nowcoder.com/acm/contest/887/A来源:牛客网 题目描述 A string is perfect if it has the smallest lexicographical ordering among its cyclic rotations 阅读全文
摘要:
Description 给定两个项链的表示,判断他们是否可能是一条项链。 给定两个项链的表示,判断他们是否可能是一条项链。 Input 输入文件只有两行,每行一个由0至9组成的字符串,描述一个项链的表示(保证项链的长度是相等的)。 输入文件只有两行,每行一个由0至9组成的字符串,描述一个项链的表示( 阅读全文
摘要:
Description Description 有n人围成一圈,顺序排号。从第1个人开始报数(从1到3报数),凡报到3的人退出圈子,问最后留下的是原来的第几号的那位。 有n人围成一圈,顺序排号。从第1个人开始报数(从1到3报数),凡报到3的人退出圈子,问最后留下的是原来的第几号的那位。 Input 阅读全文
摘要:
链接:https://ac.nowcoder.com/acm/contest/887/D来源:牛客网 题目描述 I have a very simple problem for you. Given a positive integeter n (1≤n≤1000000)n\ (1 \leq n \ 阅读全文