without的博客

题目描述给你n个数，分别是a[1],a[2],…,a[n]。求一个最长的区间[x,y]，使得区间中的数(a[x],a[x+1],a[x+2],…,a[y-1],a[y])的和能被7整除。输出区间长度。若没有符合要求的区间，输出0。输入：The first line of input contains N (1 \leq N \leq 50,000). The next Nlines eac...

题目背景大家都知道，斐波那契数列是满足如下性质的一个数列：• f(1) = 1• f(2) = 1• f(n) = f(n-1) + f(n-2) (n ≥ 2 且 n 为整数)题目描述请你求出 f(n) mod 1000000007 的值。输入输出格式输入格式：·第 1 行：一个整数 n输出格式：第 1 行： f(n) mod 1000000007 的值输入15输出1...

题目描述Farmer John has just arranged his NN haybales (1 \leq N \leq 100,0001≤N≤100,000) at various points along the one-dimensional road running across his farm. To make sure they are spaced out appropr...