05 2021 档案

摘要:输入下面的指令后报错 docker pull mindspore/mindspore-cpu:0.1.0-alpha 解决:安装daemon brew install daemon 阅读全文
posted @ 2021-05-29 16:33 脂环 阅读(49) 评论(0) 推荐(0) 编辑
摘要:链接:https://ac.nowcoder.com/acm/contest/11211/A 来源:牛客网 A. 题目描述 大科学家dddd最近在研究转基因白菜,白菜的基因序列由一串大写英文字母构成,dddd经过严谨的推理证明发现,只有当白菜的基因序列呈按位非递减形式时,这株白菜的高附加值将达到最高 阅读全文
posted @ 2021-05-28 23:51 脂环 阅读(209) 评论(0) 推荐(0) 编辑
摘要:Parsa has a humongous tree on 𝑛n vertices. On each vertex 𝑣v he has written two integers 𝑙𝑣lv and 𝑟𝑣rv. To make Parsa's tree look even more maje 阅读全文
posted @ 2021-05-25 23:53 脂环 阅读(322) 评论(0) 推荐(0) 编辑
摘要:链接:https://ac.nowcoder.com/acm/contest/11173/B 来源:牛客网 题目描述 由于小 LL 追女孩子的时间不多了,于是这里只有简单版题意。 共有 TT 组询问,每次给定 l,rl,r ,你需要求出在 [l,r][l,r] 中有多少个数在二进制下 11 的个数有 阅读全文
posted @ 2021-05-25 22:43 脂环 阅读(137) 评论(0) 推荐(0) 编辑
摘要:The weight of a sequence is defined as the number of unordered pairs of indexes (𝑖,𝑗)(i,j) (here 𝑖<𝑗i<j) with same value (𝑎𝑖=𝑎𝑗ai=aj). For exa 阅读全文
posted @ 2021-05-21 08:31 脂环 阅读(147) 评论(0) 推荐(0) 编辑
摘要:随便VP了一下大概是四题的样子 B. Build Roads 链接:https://ac.nowcoder.com/acm/contest/15600/B 来源:牛客网 题目描述 In the cat country, there are nnn cities. The cat country ki 阅读全文
posted @ 2021-05-13 19:54 脂环 阅读(327) 评论(0) 推荐(0) 编辑
摘要:有一个长度为 arrLen 的数组,开始有一个指针在索引 0 处。 每一步操作中,你可以将指针向左或向右移动 1 步,或者停在原地(指针不能被移动到数组范围外)。 给你两个整数 steps 和 arrLen ,请你计算并返回:在恰好执行 steps 次操作以后,指针仍然指向索引 0 处的方案数。 由 阅读全文
posted @ 2021-05-13 11:24 脂环 阅读(51) 评论(0) 推荐(0) 编辑
摘要:Prof. Pang plays chess against his rival Prof. Shou. They are the only two players in the game. The chessboard is very large and can be viewed as a 2D 阅读全文
posted @ 2021-05-12 23:31 脂环 阅读(471) 评论(0) 推荐(1) 编辑
摘要:With the rapid development of society, the demand for high-precision clocks is constantly rising. Recently, the China Clock Production Company is deve 阅读全文
posted @ 2021-05-12 17:02 脂环 阅读(120) 评论(0) 推荐(0) 编辑
摘要:While we enjoy chatting with friends on the internet, it is always annoying that we are overwhelmed by lots of messages in various chat groups. A grea 阅读全文
posted @ 2021-05-12 00:59 脂环 阅读(137) 评论(0) 推荐(0) 编辑
摘要:It's a sunny day with good scenery, and you come to the park for a walk. You feel curious that there are many old guys gathering by a bridge, and want 阅读全文
posted @ 2021-05-11 22:47 脂环 阅读(140) 评论(0) 推荐(0) 编辑
摘要:Alduhmellah and Behlah both like large numbers, lots of numbers and lots of large numbers. They also like to do calculations on those numbers. One day 阅读全文
posted @ 2021-05-11 21:14 脂环 阅读(118) 评论(0) 推荐(0) 编辑
摘要:Yen-Jen loves cat very much. Now, there are 10^{18}1018 cats standing in a line, the i^ith cat's cost value c_ic**i is equal to ii, the i^ith cat's in 阅读全文
posted @ 2021-05-11 19:46 脂环 阅读(70) 评论(0) 推荐(0) 编辑
摘要:有公式: num=xp+xp2+xp3+.... pk相当于1到n中$p 阅读全文
posted @ 2021-05-11 19:41 脂环 阅读(470) 评论(0) 推荐(0) 编辑
摘要:给你一个整数数组 perm ,它是前 n 个正整数的排列,且 n 是个 奇数 。 它被加密成另一个长度为 n - 1 的整数数组 encoded ,满足 encoded[i] = perm[i] XOR perm[i + 1] 。比方说,如果 perm = [1,3,2] ,那么 encoded = 阅读全文
posted @ 2021-05-11 19:28 脂环 阅读(110) 评论(0) 推荐(0) 编辑
摘要:ABC Conjecture Time limit: 3 seconds Figure 1: Shinichi Mochizuki The ABC conjecture (also known as the Oesterle–Masser conjec- ´ ture) is a famous co 阅读全文
posted @ 2021-05-11 17:20 脂环 阅读(144) 评论(0) 推荐(0) 编辑
摘要:参考https://blog.csdn.net/qq_32998593/article/details/112440843 是因为切换成了中文输入法。 只需要切换成英文输入法(或者代码的属性文件里把GUI改成false(bushi 阅读全文
posted @ 2021-05-09 12:44 脂环 阅读(946) 评论(0) 推荐(0) 编辑
摘要:Little Q is very sleepy, and he really needs some coffee to make him awake. At this time, Little L brings a pot to Little Q, and he states the pot as 阅读全文
posted @ 2021-05-08 20:41 脂环 阅读(70) 评论(0) 推荐(0) 编辑
摘要:As we already know, base64 is a common binary-to-text encoding scheme. Here we define a special series of positional systems that represent numbers us 阅读全文
posted @ 2021-05-07 10:45 脂环 阅读(113) 评论(0) 推荐(0) 编辑
摘要:We will consider the numbers 𝑎a and 𝑏b as adjacent if they differ by exactly one, that is, |𝑎−𝑏|=1|a−b|=1. We will consider cells of a square matr 阅读全文
posted @ 2021-05-06 19:06 脂环 阅读(123) 评论(0) 推荐(0) 编辑
摘要:You are playing the game "Arranging The Sheep". The goal of this game is to make the sheep line up. The level in the game is described by a string of 阅读全文
posted @ 2021-05-06 19:02 脂环 阅读(254) 评论(0) 推荐(0) 编辑
摘要:AIR学术沙龙 I《动态卷积神经网络》视频学习笔记 Convolutional Networks 多种网络模型被提出来:AlexNet,VGG... 网络在做什么?为什么要提出新的结构? 网络结构影响着: 表达能力(Representation power) 深度学习表达能力更好。 优化性质(Opt 阅读全文
posted @ 2021-05-06 11:51 脂环 阅读(157) 评论(0) 推荐(0) 编辑
摘要:Problem Description Now it's time for lunch. Today's menu is chocolate! Though every baby likes chocolate, the appetites of babies are little. After l 阅读全文
posted @ 2021-05-05 21:39 脂环 阅读(195) 评论(0) 推荐(0) 编辑
摘要:链接:https://ac.nowcoder.com/acm/problem/51073 来源:牛客网 题目描述 Urej loves to play various types of dull games. He usually asks other people to play with him 阅读全文
posted @ 2021-05-05 10:08 脂环 阅读(80) 评论(0) 推荐(0) 编辑
摘要:Problem Description Nim is a two-player mathematic game of strategy in which players take turns removing objects from distinct heaps. On each turn, a 阅读全文
posted @ 2021-05-04 23:43 脂环 阅读(49) 评论(0) 推荐(0) 编辑
摘要:题目描述 小约翰经常和他的哥哥玩一个非常有趣的游戏:桌子上有 n 堆石子,小约翰和他的哥哥轮流取石子,每个人取的时候,可以随意选择一堆石子,在这堆石子中取走任意多的石子,但不能一粒石子也不取,我们规定取到最后一粒石子的人算输。 小约翰相当固执,他坚持认为先取的人有很大的优势,所以他总是先取石子,而他 阅读全文
posted @ 2021-05-04 20:09 脂环 阅读(71) 评论(0) 推荐(0) 编辑
摘要:链接:https://ac.nowcoder.com/acm/problem/105660 来源:牛客网 题目描述 This puzzle consists of a random sequence of m black disks and n white disks on an oval-shap 阅读全文
posted @ 2021-05-04 15:36 脂环 阅读(74) 评论(0) 推荐(0) 编辑
摘要:链接:https://ac.nowcoder.com/acm/contest/11243/A 来源:牛客网 题目描述 NIT正在玩皇室战争,NIT需要一种叫滚木的卡牌。众所周知皇室战争一共有n(n<=100000)种卡牌,NIT每开一个宝箱就能得到一张卡牌(宝箱开到每种卡牌的概率都是一样的)。现在N 阅读全文
posted @ 2021-05-04 13:47 脂环 阅读(136) 评论(0) 推荐(0) 编辑
摘要:Phoenix has n blocks of height h1,h2,…,hn, and all hi don't exceed some value x. He plans to stack all 𝑛n blocks into m separate towers. The height o 阅读全文
posted @ 2021-05-03 22:12 脂环 阅读(174) 评论(0) 推荐(0) 编辑
摘要:To satisfy his love of matching socks, Phoenix has brought his n socks (n is even) to the sock store. Each of his socks has a color ci and is either a 阅读全文
posted @ 2021-05-03 20:44 脂环 阅读(172) 评论(0) 推荐(0) 编辑
摘要:如果使用vector作为离散化的容器,一般情况下会先对vector进行排序然后再unique。但这样的话unique后实际上是把剩余重复的元素移到了容器最后面而非删除,因此直接对此时的容器进行二分查找会出现错误。 可行的写法是将erase和unique结合起来: sort(v.begin(), v. 阅读全文
posted @ 2021-05-02 21:39 脂环 阅读(189) 评论(0) 推荐(0) 编辑
摘要:链接:https://ac.nowcoder.com/acm/contest/15590/L 来源:牛客网 题目描述 输入描述: 输出描述: 示例1 输入 复制 7 4 2 6 1 5 7 3 输出 复制 337 34 3401 7 780 7803 79 示例2 输入 复制 4 4 1 3 2 输 阅读全文
posted @ 2021-05-02 21:32 脂环 阅读(85) 评论(0) 推荐(0) 编辑
摘要:链接:https://ac.nowcoder.com/acm/problem/221163 来源:牛客网 示例1 输入 复制 2 3 0 5 5 0 0 1 0 3 3 0 输出 复制 0 0 3 示例2 输入 复制 6 5 -6 0 -4 0 -3 0 -4 -2 -3 -2 -2 -3 -6 - 阅读全文
posted @ 2021-05-02 21:15 脂环 阅读(110) 评论(0) 推荐(0) 编辑
摘要:链接:https://ac.nowcoder.com/acm/contest/11232/B 来源:牛客网 题目描述 学姐最近喜欢上了编码,尤其是十六进制编码,但是学姐特别挑剔,在学姐眼中,只有逐位递增的编码才是一个优美的编码,比如12,58都是优美的编码,85,22则都不是优美的编码,现在学姐得到 阅读全文
posted @ 2021-05-01 23:31 脂环 阅读(84) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示
主题色彩