Live2d Test Env
上一页 1 ··· 30 31 32 33 34 35 36 37 38 ··· 101 下一页
摘要: Kelukin is a businessman. Every day, he travels around cities to do some business. On August 17th, in memory of a great man, citizens will read a book 阅读全文
posted @ 2018-10-19 11:20 nimphy 阅读(205) 评论(0) 推荐(0) 编辑
摘要: One day, Kaitou Kiddo had stolen a priceless diamond ring. But detective Conan blocked Kiddo's path to escape from the museum. But Kiddo didn't want t 阅读全文
posted @ 2018-10-19 09:11 nimphy 阅读(149) 评论(0) 推荐(0) 编辑
摘要: There are N schedules, the i-th schedule has start time s i si and end time e i ei (1 <= i <= N). There are some machines. Each two overlapping schedu 阅读全文
posted @ 2018-10-18 15:37 nimphy 阅读(353) 评论(0) 推荐(0) 编辑
摘要: There is a nonnegative integer sequence a 1...n a1...n of length n n . HazelFan wants to do a type of transformation called prefix-XOR, which means a  阅读全文
posted @ 2018-10-18 14:37 nimphy 阅读(125) 评论(0) 推荐(0) 编辑
摘要: Bob has a dictionary with N words in it. Now there is a list of words in which the middle part of the word has continuous letters disappeared. The mid 阅读全文
posted @ 2018-10-17 21:48 nimphy 阅读(254) 评论(0) 推荐(0) 编辑
摘要: We define the distance of two strings A and B with same length n is dis A,B =∑ i=0 n−1 |A i −B n−1−i | disA,B=∑i=0n−1|Ai−Bn−1−i| The difference betwee 阅读全文
posted @ 2018-10-17 20:28 nimphy 阅读(159) 评论(0) 推荐(0) 编辑
摘要: Give an array A, the index starts from 1. Now we want to know B i =max i∤j A j Bi=maxi∤jAj , i≥2 i≥2 . InputThe first line of the input gives the numb 阅读全文
posted @ 2018-10-17 19:39 nimphy 阅读(121) 评论(0) 推荐(0) 编辑
摘要: Little Ruins is playing a number game, first he chooses two positive integers yy and KK and calculates f(y,K)f(y,K), here f(y,K)=∑z in every digits of 阅读全文
posted @ 2018-10-16 21:28 nimphy 阅读(410) 评论(0) 推荐(0) 编辑
摘要: 题目描述 阿尔比恩王国(the Albion Kingdom)潜伏着一群代号“白鸽队(Team White Pigeon)”的间谍。在没有任务的时候,她们会进行各种各样的训练,比如快速判断一个文档有没有语法错误,这有助于她们鉴别写文档的人受教育程度。 这次用于训练的是一个含有n个括号的文档。括号一共 阅读全文
posted @ 2018-10-02 10:30 nimphy 阅读(888) 评论(0) 推荐(1) 编辑
摘要: Nim is a mathematical game of strategy in which two players take turns removing objects from distinct heaps. On each turn, a player must remove at lea 阅读全文
posted @ 2018-10-01 22:09 nimphy 阅读(210) 评论(0) 推荐(0) 编辑
上一页 1 ··· 30 31 32 33 34 35 36 37 38 ··· 101 下一页