wayBack

摘要： Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 0 Accepted Submission(s): 0Special Judge Problem 阅读全文

摘要： One of the more popular activities in San Antonio is to enjoy margaritas in the park along the river know as the River Walk. Margaritas may be purchas 阅读全文

摘要： Robberies Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 2955 64-bit integer IO format: %I64d Java class nam 阅读全文

摘要： You are given a sequence of n integers a1 , a2 , ... , an in non-decreasing order. In addition to that, you are given several queries consisting of in 阅读全文

摘要： 题目描述 有两个长度都是N的序列A和B，在A和B中各取一个数相加可以得到N^2个和，求这N^2个和中最小的N个。 有两个长度都是N的序列A和B，在A和B中各取一个数相加可以得到N^2个和，求这N^2个和中最小的N个。 输入 第一行一个正整数N； 第二行N个整数Ai,满足Ai<=Ai+1且Ai<=10 阅读全文

摘要： The Pizazz Pizzeria prides itself in delivering pizzas to its customers as fast as possible. Unfortunately, due to cutbacks, they can afford to hire o 阅读全文

摘要： 题目描述 Takahashi is now competing in a programming contest, but he received TLE in a problem where the answer is YES or NO. When he checked the detailed 阅读全文

摘要： 题目描述 已知一个长度为n的整数数列a1,a2,…,an，给定查询参数l、r，问在al,al+1,…,ar区间内，有多少子序列满足异或和等于k。也就是说，对于所有的x,y(l≤x≤y≤r)，满足ax⊕ax+1⊕⋯⊕ay=k的x,y有多少组。 输入 输入第一行为3个整数n,m,k。第二行为空格分开的n 阅读全文

摘要： 具体细节，看下面这两个网站，第一个是有数据举例，第二个解释比较好。结合着看容易理解一点 1.https://blog.csdn.net/thinfatty/article/details/72581276 2.https://www.cnblogs.com/Paul-Guderian/p/69337 阅读全文

摘要： gcd(a,b) = gcd(b,a mod b) (不妨设a>b 且r=a mod b ,r不为0) 证法一 证法一 a可以表示成a = kb + r（a，b，k，r皆为正整数），则r = a mod b 假设d是a,b的一个公约数，记作d|a,d|b，即a和b都可以被d整除。 而r = a - 阅读全文