flqbestboy的专栏

#include#includeusing namespace std;int main(int ac,char *av[]){ int arr[15]={561, 1105, 1729, 2465, 2821, 6601, 8911, 10585, 15841, 29341, 41041, 46657, 52633, 62745, 63973 };//(

Description has only two SentencesTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 701 Accepted Submission(s): 214Problem Descriptiona

基本概念及思想对形如a^b mod m 的运算（b一般较大）但a,b,m都在long型范围内算法的主要思想是分治，分而治之。将大的问题分成若干个相似的较小的问题！具体实现是用递归的方法！举例2^100 mod 3像这种运算如果先算出2^100 的值，然后再模上3，相信比较困难！我们可以将100变小点2^100=(2^50)^2 =((2^25)^2)

Diophantus of AlexandriaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1683 Accepted Submission(s): 633Problem DescriptionDiophantus

Simple Addition ExpressionTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1155 Accepted Submission(s): 428Problem DescriptionA luxury

Set DefinitionTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 8784Accepted: 4036DescriptionSet S is defined as follows:(1) 1 is in S; (2) If x

http://www.tyvj.cn/Problem_Show.aspx?id=1118a^bFrom Admin描述 Description求a^b 由于结果可能很大，我们现在只需要知道这个值mod 1012就可以了（为什么是1012？我的生日）ab输入格式 InputFormat第一行两个数 a b输出格式 OutputFormat

Tr A Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 5 Accepted Submission(s) : 5Problem DescriptionA为一个方阵，则Tr A表示A的迹（就是主对角线上各项的和），现要求Tr(A^k

判断一个数是否为奇数 #includeusing namespace std;int main(){ if(3&1)cout<<"yes1"<<endl; if(4&1)cout<<"yes2"<<endl; return 0;}求两个数的最大公约数int gcd(int a,int b){ if(b==0) return

Uncle Tom's Inherited Land*Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 4 Accepted Submission(s) : 4Special JudgeProblem Description

Square Coins Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 6 Accepted Submission(s) : 6Problem DescriptionPeople in Silverland use square

Holding Bin-Laden Captive!Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 1 Accepted Submission(s) : 1Problem DescriptionWe all know that Bi

LCM ChallengeCrawling in process...Crawling failedTime Limit:2000MSMemory Limit:262144KB 64bit IO Format:%I64d & %I64uDescriptionSome days ago, I learned the concept of LCM (least co

Problem Description　　The Euler function phi is an important kind of function in number theory, (n) represents the amount of the numbers which are smaller than n and coprime to n, and this function

GCD Again Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 13 Accepted Submission(s) : 6Problem DescriptionDo you have spent some time to thi

Crawling in process...Crawling failedTime Limit:2000MSMemory Limit:262144KB 64bit IO Format:%I64d & %I64uDescriptionLet's denote d(n) as the number of divisors of a positive integer

X问题Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1968 Accepted Submission(s): 590Problem Description求在小于等于N的正整数中有多少个X满足：X mod a[0]

Lanterns Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/65536K (Java/Other)Total Submission(s) : 10 Accepted Submission(s) : 8Problem DescriptionAlice has received a beautiful pres

Air Raid Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 11 Accepted Submission(s) : 10Problem DescriptionConsider a town where all the stre

Ignatius and the Princess IIITime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 4 Accepted Submission(s) : 4Problem Description"Well, it seem

首先，我们引进一个小小概念来方便描述吧，record[n][m]是把自然数划分成所有元素不大于m的分法，例如：当n=4，m=1时，要求所有的元素都比m小，所以划分法只有1种：{1，1，1，1}；当n=4，m=2时，。。。。。。。。。。。。。。。。只有3种{1，1，1，1},{2，1，1}，{2，2}；当n=4，m=3时，。。。。。。。。。。。。。。。。只有4种{1，1，1，

一个斐波那契数列题目描述雍神对数学一直都非常感兴趣。最近在学习斐波那契数列的它，向你展示了一个数字串，它称之为“斐波那契”串：11235813471123581347112358........聪明的你当然一眼就看出了这个串是这么构造的：1.先写下两位在0~9范围内的数字a, b，构成串ab；2.取串最后的两位数字相加，将和写在串的最后面。上面雍神向