qq_44621644的博客

原文题目Kevin Sun wants to move his precious collection of n cowbells from Naperthrill to Exeter, where there is actually grass instead of corn. Before moving, he must pack his cowbells into k boxes of a...

原文题目You have a long stick, consisting of m segments enumerated from 1 to m. Each segment is 1 centimeter long. Sadly, some segments are broken and need to be repaired.You have an infinitely long rep...

原文题目You are given an array of integers. Vasya can permute (change order) its integers. He wants to do it so that as many as possible integers will become on a place where a smaller integer used to st...

原文题目There are n boxers, the weight of the i-th boxer is ai. Each of them can change the weight by no more than 1 before the competition (the weight cannot become equal to zero, that is, it must remai...

题目原文Nick had received an awesome array of integers a=[a1,a2,…,an] as a gift for his 5 birthday from his mother. He was already going to explore its various properties but after unpacking he was disap...

题目描述You are given integer n. You have to arrange numbers from 1 to 2n, using each of them exactly once, on the circle, so that the following condition would be satisfied:For every n consecutive numb...

（用心诠释什么叫心态炸裂）原题Recently you have received two positive integer numbers x and y. You forgot them, but you remembered a shuffled list containing all divisors of x (including 1 and x) and all divisors ...

原题This problem is actually a subproblem of problem G from the same contest.There are n candies in a candy box. The type of the i-th candy is ai (1≤ai≤n).You have to prepare a gift using some of the...

暑期学习—二分题目描述（poj-3258）Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, s...

We guessed some integer number x. You are given a list of almost all its divisors. Almost all means that there are all divisors except 1 and x in the list.Your task is to find the minimum possible in...

题意 hdoj1276 典型的队列问题，入门水题题解：（第一次做普通队列，引用了别人的算法，优化了一下，题解记录学到的一点东西）队列和数组之类的东西完全不同，和栈一样，被固定的顺序和进出卡的很死，所以在做队列的题目时，不能像数组一样思维因为是3个人，所以首先按队列的大小来卡人数，初始化的时候，从1开始进入队列，然后因为是2，3删除交替出现，所以很容易想到用奇偶性来判断是删除2还是3，之后用...

map典例 hdoj 1251 统计难题#include <bits/stdc++.h>using namespace std;int main(){ int n,i,j,k,t; string b; char a[52]; map<string,int>m; while(gets(a)) { ...

hdoj 1005题意：A number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to calculate the value of f(n).题解：开始一直想暴力递归，发现这就是一个简单的...

ACM之路水题系列：1.人见人爱A+B题意：给出了小时分钟和秒，计算加法之后的时间题解：循环判断进位，60进一次2.人见人爱A-B题意：算两个集合的差值题解：从一个数组映射到另外一个数组，对数组进行排序，定义一个新的数组来进行标记，用循环将满足条件的输出3.人见人爱A^B题意：计算A^B的最后三位数题解：循环保留最后的数字，和noj上一个类似，将保留的数字进行次方，避免超出数据...