Alex_McAvoy的博客

【概述】越底层的函数，调用越频繁，那么最底层的数学运算函数的优化至关重要。当求逆平方根时，一般做法都是用函数返回 1/sqrt(x)，但在 雷神之锤3 中，有一快速求逆平方根的算法。【知识储备】1.单精度浮点数的存储在计算机中，单精度浮点数使用 32 位来存储，其中，最高位为符号位，后面 8 位为整数位，代表浮点数的指数，再后面 23 位代表小数部分，依次表示、、......

Problem DescriptionDreamGrid has an integer sequence a1,a2,...,an and he likes it very much. Unfortunately, his naughty roommate BaoBao swapped two elements ai and aj (1<=i<j<=n) in the se...

Problem DescriptionFor integersb(b≥2)andn(n≥1), let the functionf(b,n)be defined as follows:f(b,n)=n, whenn<b f(b,n)=f(b, floor(n⁄b))+(nmodb), whenn≥bHere,floor(n⁄b)denotes the la...

Problem DescriptionOn a two-dimensional plane, there are m lines drawn parallel to the x axis, and n lines drawn parallel to the y axis. Among the lines parallel to the x axis, the i-th from the bo...

Problem DescriptionWe have a sequence of length N, a=(a1,a2,…,aN). Each ai is a positive integer.Snuke's objective is to permute the element in a so that the following condition is satisfied:Fo...

Problem DescriptionAs a token of his gratitude, Takahashi has decided to give his mother an integer sequence. The sequence A needs to satisfy the conditions below:A consists of integers between X...

Problem DescriptionYou are given an integer sequence of length n, a1,…,an. Let us consider performing the following n operations on an empty sequence b.The i-th operation is as follows:Append a...

Problem DescriptionYou are given an arrayaaconsisting ofnnintegersa1,a2,…,an. You want to split it into exactlykknon-empty non-intersecting subsegmentssuch that each subsegment has odd sum ...

Problem Descriptionnn robots have escaped from your laboratory! You have to find them as soon as possible, because these robots are experimental, and their behavior is not tested yet, so they may b...

Problem DescriptionA sequence of non-negative integersa1, a2, ..., anof lengthnis called awool sequenceif and only if there exists two integerslandr(1 ≤ l ≤ r ≤ n)such that. In other wo...

Problem DescriptionAn expedition group flew from planet ACM-1 to Earth in order to study the bipedal species (its representatives don't even have antennas on their heads!).The flying saucer, on w...

题目给出一个正整数N，将N写为若干个连续数字和的形式(长度 >= 2)。例如N = 15，可以写为1 + 2 + 3 + 4 + 5，也可以写为4 + 5 + 6，或7 + 8。如果不能写为若干个连续整数的和，则输出No Solution。输入输入1个数N(3 <= N <= 10^9)。输出输出连续整数中的第1个数，如果有多个按照递增序排列，如果不能分解为...

题目X*X mod P = A，其中P为质数。给出P和A，求<=P的所有X。输入两个数P A，中间用空格隔开。(1 <= A < P <= 1000000, P为质数)输出输出符合条件的X，且0 <= X <= P，如果有多个，按照升序排列，中间用空格隔开。如果没有符合条件的X，输出：No Solution输入样例13 3输出...

Problem DescriptionGiven a prime number C(1≤C≤2×105), and three integers k1, b1, k2 (1≤k1,k2,b1≤109). Please find all pairs (a, b) which satisfied the equation(n = 1, 2, 3, ...).InputThere are ...

【理论】快速求逆平方根：点击这里【例题】1.公式推导Answering Queries（LightOJ-1369）(公式推导)：点击这里 Applese 的减肥计划（2019牛客寒假算法基础集训营 Day4-J）(公式推导)：点击这里 处女座与线性代数（2019牛客寒假算法基础集训营 Day3-A）(公式推导)：点击这里 区间或和（2019牛客寒假算法基础集训营 Day6-G）...

Problem DescriptionThe problem you need to solve here is pretty simple. You are give a function f(A, n), where A is an array of integers and n is the number of elements in the array. f(A, n) is def...

【题目描述】处女座热爱做物理实验，为了实验，处女座必须要精确的知道物品的质量。处女座准备自己设计一套砝码，每一个砝码都是正整数，这套砝码必须能够精确测量出n以内所有正整数的质量，处女座想要知道至少需要多少个砝码。你可以在天平的任意一边放置砝码。【输入描述】一行，一个正整数n1<=n<=10^1000【输出描述】一个整数，表示最少的砝码数。【样例】示例1...

Problem DescriptionYou task is to find minimal natural number N, so that N! contains exactly Q zeroes on the trail in decimal notation. As you know N! = 1*2*...*N. For example, 5! = 120, 120 contai...

【题目描述】众所周知，处女座是数学大师。他定义了k维空间里的处女座点。对于给出的k维度空间上N个点，处女座点满足：对于这个点P和空间里任意其他两个点P1、P2，有 dot(PP1,PP2)<0。现在给你一个k维空间和这N个点，请求出这里面所有的处女座点。Hint:dot(A,B)表示两个向量的点乘（内积）。两个向量 A={a1,a2,⋯,an}和B={b1,b2,⋯...

【题目描述】Applese 最近又长胖了，于是它打算减肥——练习举重。他在举重的时候用两只手往不同方向用力，从而把杠铃举起来。已知 Applese 两只手分别产生的力的大小，以及它们之间的夹角，试求两力合力的大小。【输入描述】仅一行三个整数f1,f2,a，分别表示两只手产生的力的大小以及它们之间的夹角1≤f1,f2≤1000≤a≤180【输出描述】输出一个实数...

【题目描述】小希最近想知道一个东西，就是A+B=A|B(其中|为按位或)的二元组有多少个。当然，直接做这个式子对小希来说太难了，所以小希改变了一些条件，她仅想知道其中A,B<N的情况，其中N为2的幂次。当然，(A=1,B=0)和(A=0,B=1)被认为是不同的二元组。【输入描述】第一行输入一个非负整数M。N=2^M,M≤100【输出描述】一个整数ans，对9...

【题目描述】求a|(a+1)|(a+2)|...|(b-1)|b。其中|表示按位或【输入描述】多组输入，每行两个数表示a和b【输出描述】对于每组输入，输出一个数a|(a+1)|(a+2)|...|(b-1)|b。【样例】示例1输入99 10968 7755 6634 431111234 1114321输出11179127471179647...

Problem DescriptionI was trying to solve problem '1234 - Harmonic Number', I wrote the following codelong long H( int n ) { long long res = 0; for( int i = 1; i <= n; i++ ) re...

Problem Description度度熊最近学习了多项式和极限的概念。现在他有两个多项式 f(x) 和 g(x)，他想知道当 x 趋近无限大的时候，f(x)/g(x) 收敛于多少。Input第一行一个整数T(1≤T≤100)表示数据组数。对于每组数据，第一行一个整数 n(1≤n≤1,000) n−1表示多项式f 和g可能的最高项的次数（最高项系数不一定非...