Luke的学习笔记

102. 最远距离 时间限制1000 ms     内存限制 65536 KB    题目描述正义的伙伴褋祈和葬仪社的机器人Fuyuneru正在被邪恶的GHQ部队追杀。眼看着快要逃不掉了，祈就把重要的东西塞到了机器人体内，让它先跑，自己吸引火力。假设Fuyuneru带上东西开始逃跑时所处的点为原点，朝向为正北。操纵FuyuNeru的指令有如下四种：right

时间限制 5000 ms 内存限制 65536 KB题目描述    In a parallel universe, Saber has won the champion of every kind of board games. She even defeated the AI program BetaGo recently! After all the victory

时间限制 1000 ms 内存限制 65536 KB题目描述    Artoria, also known as Saber-chan, was born into a time of chaos and war that began with the demise of the Roman empire. Somewhere in the far east, peop

时间限制 1000 ms 内存限制 65536 KB题目描述   In a parallel universe, young Saber-chan does not have a humongous appetite, instead, she likes studying math in her spare time. This afternoon when Sabe

时间限制 1000 ms 内存限制 65536 KB题目描述    Archer(Emiya), also known as the red A, is famous for his talented skill of never missing a shot. Today Archer takes part in a rather different Archery

时间限制 4000 ms 内存限制 65536 KB题目描述    Alice and Bob are old friends in game theory. This afternoon they meet in Starbucks, each ordered a cup of coffee and decided to start a new game. They

时间限制 5000 ms 内存限制 65536 KB题目描述    One day, the teacher asked Weishen to judge whether a binary string can be divided by 3 (3=(11)2) in binary system.     "It’s too simple.", Weishen

时间限制 2000 ms 内存限制 65536 KB题目描述    R_clover wants to challenge Mengmengda_wsw's math，so he give her a function f(x,k).    f(x,k)=g8(x,k)    gn(x,k)=gn−1(g(x,k),k)    where x∈[0,230−

时间限制 1000 ms 内存限制 65536 KB题目描述       Saber is fond of number games of various kinds, she particularly likes a kind of number-guessing game. The game is played in pairs, one player decide

时间限制 5000 ms 内存限制 65536 KB题目描述We define function g on an array as: g([a0,a1,⋯,an−1])=(Σn−1l=0al) mod png([a_0,a_1,\cdots,a_{n-1}]) = \frac{(\Sigma_{l=0}^{n-1} a_l) ~ mod ~ p}{n}Here, p is a given cons

85. Three Points On A Line 时间限制1000 ms     内存限制 65536 KB    题目描述Given points on a 2D plane, judge whether there're three points that locate on the same line.输入格式The number of t

90. 字符串转换 时间限制1000 ms     内存限制 65536 KB    题目描述我们将仅由若干个同一小写字母构成的字符串称之为简单串，例如"aaaa"是一个简单串，而"abcd"则不是简单串。现在给你一个仅由小写字母组成的字符串，你需要用最小的花费，将其转换成一个简单串。 花费的计算规则如下：将a到z这26个小写字母从左到右排成一排，则每个字母都有左右

89. 统计时间间隔 时间限制1000 ms     内存限制 65536 KB    题目描述给出两个时间(24小时制)，求第一个时间至少要经过多久才能到达第二个时间。给出的时间一定满足的形式，其中x 和y 分别代表小时和分钟。0≤x24,0≤y60 。输入格式第一行为数据组数T (1≤T≤50000 )。每组数据包括两行，分别代表两个时间

Problem A.奇偶求和 题目描述给出N个数，求出这N个数，奇数的和以及偶数的和。 输入格式第一行为测试数据的组数T(150)。请注意，任意两组测试数据之间是相互独立的。每组数据包括两行：第一行为一个整数N(1 <= N <=100)。第二行为N个正整数，整数之间用一个空格隔开，且每个整数的绝对值均 不大于10^5。 输出格式每组数据输出

84. Single Number 时间限制1000 ms     内存限制 65536 KB    题目描述Given an array with N  integers where all elements appear three times except for one. Find out the one which appears only once.