SYITwin的博客

Problem DescriptionA cubic number is the result of using a whole number in a multiplication three times. For example, 3×3×3=27 so 27 is a cubic number. The first few cubic numbers are 1,8,27,64 and 125. Given an prime number p. Check that if p is a differ

Problem Description一个长度不超过10000数据的顺序表，可能存在着一些值相同的“多余”数据元素（类型为整型），编写一个程序将“多余”的数据元素从顺序表中删除，使该表由一个“非纯表”（值相同的元素在表中可能有多个）变成一个“纯表”（值相同的元素在表中只保留第一个）。要求：       1、必须先定义线性表的结构与操作函数，在主函数中借助该定义与操作函数调用实现问题功能

Problem Description一个长度为len(1数据元素的类型为整型，将该表分成两半，前一半有m个元素，后一半有len-m个元素（1注意：先将顺序表元素调整为符合要求的内容后，再做输出，输出过程只能用一个循环语句实现，不能分成两个部分。 Input 第一行输入整数n，代表下面有n行输入；之后输入n行，每行先输入整数len与整数m(分别代表本表的元素总数与前半表的元素个

Problem Description已知顺序表A与B是两个有序的顺序表，其中存放的数据元素皆为普通整型，将A与B表归并为C表，要求C表包含了A、B表里所有元素，并且C表仍然保持有序。Input 输入分为三行：第一行输入m、n（1第二行输入m个有序的整数，即为表A的每一个元素；第三行输入n个有序的整数，即为表B的每一个元素；Output 输出为一

        People in Silverland use coins.They have coins of value A1,A2,A3...An Silverland dollar.One day Tony opened his money-box and found there were some coins.He decided to buy a very nice watch in...

   "OK, you are not too bad, em... But you can never pass the next test." feng5166 says."I will tell you an odd number N, and then N integers. There will be a special integer among them, you have to ...

   A group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with some blocks. If the m...

companyTime Limit: 1000 ms Memory Limit: 65536 KiB Submit Statistic Discuss Problem DescriptionThere are n kinds of goods in the company, with each of them has a inventory of...

CFTime Limit: 1000 ms Memory Limit: 65536 KiB Submit Statistic Discuss Problem DescriptionLYD loves codeforces since there are many Russian contests. In an contest lasting fo...

   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). Input The i...

   A simple mathematical formula for e is where n is allowed to go to infinity. This can actually yield very accurate approximations of e using relatively small values of n. Output ...

        The cows don't use actual bowling balls when they go bowling. They each take a number (in the range 0..99), though, and line up in a standard bowling-pin-like triangle like this: ...

   I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.Input The first line of the input contains an integer T(1<=T<=20) which means the...

ParliamentTime Limit: 1000 ms Memory Limit: 65536 KiB Submit Statistic Discuss Problem Description New convocation of The Fool Land's Parliament consists of N delegates. A...

A + B Problem IITime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 408641    Accepted Submission(s): 79199Problem DescriptionI have a very simple...

11:大整数减法原创 2017年06月20日 13:32:5814511:大整数减法查看提交统计提问12345总时间限制: 1000ms 内存限制: 65536kB描述求两个大的正整数相减的差。12输入 共2行，第1行是被减数a，第2行是减数b(a > b)。每个大整数不超过200位，不会有多余的前导零。 输出 一行，即所求的差。 样例输入9999999999999999999...

 基本算法描述：  对于不完全为 0 的非负整数 a，b，gcd（a，b）表示 a，b 的最大公约数，必然存在整数对 x，y ，使得 gcd（a，b）    =ax+by。   证明：设 a>b。  　　1，显然当 b=0，gcd（a，b）=a。此时 x=1，y=0；  　　2，ab!=0 时  　　设 ax1+by1=gcd(a,b);  　　bx2+(a...

         两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰面为止。可是它们出发之前忘记了一件很重要的事情，既没有问清楚对方的特征，也没有约定见面的具体位置。不过青蛙们都是很乐观的，它们觉得只要一直朝着某个方向跳下去，总能碰到对方的。但是除非这两只青蛙在同一时间跳到同一点上，不然是永远都不可能碰面...

        在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。 Input 输入含有多组测试数据。 每组数据的第一行是两个正整数，n k，用一个空...

        There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tile...

数据结构实验之查找四：二分查找Time Limit: 30 ms Memory Limit: 65536 KiB Submit Statistic Discuss Problem Description在一个给定的无重复元素的递增序列里，查找与给定关键字相同的元素，若存在则输出找到的位置,不存在输出-1。Input一组输入数据，输入数据第一行首先...

DescriptionGive you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbers Ai, Bj, Ck, which satisfy the formula Ai+Bj+Ck = X.  In...

Problem E: ProductTime Limit: 1 Sec  Memory Limit: 128 MBSubmit: 38  Solved: 25[Submit][Status][Web Board]DescriptionThe problem is to multiply two integers X, Y. (0<=X,Y<10250) InputThe input w...

Problem F: ExponentiationTime Limit: 1 Sec  Memory Limit: 128 MBSubmit: 9  Solved: 6[Submit][Status][Web Board]DescriptionProblems involving the computation of exact values of very large magnitude and...

Problem D: Integer InquiryTime Limit: 1 Sec  Memory Limit: 128 MBSubmit: 59  Solved: 18[Submit][Status][Web Board]DescriptionOne of the first users of BIT's new supercomputer was Chip Diller. He exten...

数字三角形(POJ1163)        在上面的数字三角形中寻找一条从顶部到底边的路径，使得路径上所经过的数字之和最大。路径上的每一步都只能往左下或 右下走。只需要求出这个最大和即可，不必给出具体路径。 三角形的行数大于1小于等于100，数字为 0 - 99    输入格式：首先输入一个整数n表示读入数字三角的层数，然后输入n层数字三角形。    5     7    3   8    8  ...

   A ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime. Note: the number ...

 最长上升子序列Time Limit: 3000 ms Memory Limit: 65536 KiBSubmit Statistic DiscussProblem Description一个数的序列bi，当b1 < b2 < ... < bS的时候，我们称这个序列是上升的。对于给定的一个序列(a1, a2, ..., aN)，我们可以得到一些上升的子序列(a...

最长公共子序列详解思路总结：https://blog.csdn.net/hrn1216/article/details/51534607最长公共子序列问题Time Limit: 1000 ms Memory Limit: 65536 KiB Submit Statistic Discuss Problem Description 给定两个序列X=...

ACM-动态规划21-三角形最长路径问题这个就是基于 https://mp.csdn.net/postedit/79832350的一个变形，原理类似。 描述如下所示的由正整数数字构成的三角形: 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 从三角形的顶部到底部有很多条不同的路径。对于每条路径，把路径上面的数加起来可以得到一个和，和最大的路径称为最佳路径。你的任...

ACM-动态规划23-大盗阿福描述阿福是一名经验丰富的大盗。趁着月黑风高，阿福打算今晚洗劫一条街上的店铺。这条街上一共有 N 家店铺，每家店中都有一些现金。阿福事先调查得知，只有当他同时洗劫了两家相邻的店铺时，街上的报警系统才会启动，然后警察就会蜂拥而至。作为一向谨慎作案的大盗，阿福不愿意冒着被警察追捕的风险行窃。他想知道，在不惊动警察的情况下，他今晚最多可以得到多少现金？输入 输入的第一行是一个...

http://blog.sina.com.cn/s/articlelist_2101275125_3_1.html

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2955RobberiesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 28543    Accepted Submission(s): 104...

Farmer John commanded his cows to search for different sets of numbers that sum to a given number. The cows use only numbers that are an integer power of 2. Here are the possible sets of numbers...

取石子游戏Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 44439   Accepted: 15133 Description有两堆石子，数量任意，可以不同。游戏开始由两个人轮流取石子。游戏规定，每次有两种不同的取法，一是可以在任意的一堆中取走任意多的石子；二是可以在两堆中同时取走相...

quadratic equationTime Limit: 2000 ms Memory Limit: 131072 KiB Submit Statistic Discuss Problem DescriptionWith given integers a,b,c, you are asked to judge whether the follo...

sum of powerTime Limit: 1000 ms Memory Limit: 65536 KiB Submit Statistic Discuss Problem DescriptionCalculate  mod (1000000000+7) for given n，m.InputInput contains two intege...

1.快速幂的目的就是做到快速求幂，所以以后遇到要求多次幂指数的时候，可以考虑快速幂算法。2.快速幂是基于二进制的： 假设我们要求a^b,按照朴素算法就是把a连乘b次，这样一来时间复杂度是O(b)也即是O(n)级别，快速幂能做到O(logn)，快了好多好多。它的原理如下：　　假设我们要求a^b，那么其实b是可以拆成二进制的，该二进制数第i位的权为2^(i-1)，例如当b==11时...

Parity checkTime Limit: 2000 ms Memory Limit: 524288 KiB Submit Statistic Discuss Problem DescriptionFascinated with the computer games, Gabriel even forgets to study. Now sh...

Description:Peppa has been learning math recently, he is trapped by a easy problem. He is given a sequence of n numbers, what he need to do is finding the number ai which have the largest number f(ai)...