数学-组合
文章平均质量分 62
数学-组合
master-dragon
weixin:dwl_1270530306
展开
-
1081. Rational Sum (20)
题目地址 http://www.patest.cn/contests/pat-a-practise/1081Given N rational numbers in the form “numerator/denominator”, you are supposed to calculate their sum.Input Specification:Each input file contains原创 2015-08-14 17:41:48 · 332 阅读 · 0 评论 -
1024. Palindromic Number (25)
1024. Palindromic Number (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA number that will be the same when it原创 2015-10-23 08:22:43 · 323 阅读 · 0 评论 -
PAT L1-009. N个数求和(辗转相除法,浮点和输出注意)
题目地址https://www.patest.cn/contests/gplt/L1-009ac代码#include <cstdio>#include <cstdlib>#include <cmath>#include <cstring>#include <iostream>#include <string>#include <vector>#include <queue>#incl原创 2016-12-07 09:57:21 · 1396 阅读 · 0 评论 -
快速幂,大数处理,递归优化
快速幂例如求3^75 O(n)求法,直接将3连续乘75次75的2进制 1001011 3^75 = 3^64 * 3^8 * 3^2 * 3^1 ,乘法次数将减少对比程序#include <cstdio>#include <cstdlib>#include <iostream>#include <vector>#include <string>#include <algorithm>原创 2016-08-03 14:22:12 · 847 阅读 · 0 评论 -
bfprt算法,中位数的中位数算法,O(n)时间复杂度求解第k大数
。。。原创 2016-12-22 09:35:58 · 7643 阅读 · 0 评论 -
1096. Consecutive Factors (20)
题目地址:http://www.patest.cn/contests/pat-a-practise/1096/*PAT1096--浙大2015机试题--Consecutive Factors (20)http://www.patest.cn/contests/pat-a-practise/1096*/#include <cstdio> #include <cstring> #incl原创 2015-08-24 13:17:46 · 644 阅读 · 0 评论 -
1049. Counting Ones (30) 从1到n整数中1出现的次数
剑指offer,leetcode,PAT转载地址(下面的博文讲解的很清楚,容易明白) http://blog.csdn.net/yi_afly/article/details/52012593PAT题目联系 https://www.patest.cn/contests/pat-a-practise/1049 ac代码#include <cstdio>#include <memory>#in转载 2017-02-07 14:01:02 · 270 阅读 · 0 评论 -
1088. Rational Arithmetic (20) -- 公约数,字符串输出处理
题目地址 http://www.patest.cn/contests/pat-a-practise/1088For two rational numbers, your task is to implement the basic arithmetics, that is, to calculate their sum, difference, product and quotient.Input原创 2015-08-16 16:08:56 · 825 阅读 · 0 评论 -
1104. Sum of Number Segments (20)
1104. Sum of Number Segments (20)时间限制200 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CAO, PengGiven a sequence of positive number原创 2016-01-21 13:48:08 · 1161 阅读 · 0 评论 -
1105. Spiral Matrix (25) -- 模拟
题目地址https://www.patest.cn/contests/pat-a-practise/1105ac代码思路是:外围转一圈的函数封装起来,然后遍历填充,注意判断是否完成了#include <cstdio>#include <cstdlib>#include <cmath>#include <cstring>#include <iostream>#include <string>原创 2017-02-14 19:18:09 · 353 阅读 · 0 评论 -
L1-006. 连续因子
题目地址https://www.patest.cn/contests/gplt/L1-006题目描述一个正整数N的因子中可能存在若干连续的数字。例如630可以分解为3*5*6*7,其中5、6、7就是3个连续的数字。给定任一正整数N,要求编写程序求出最长连续因子的个数,并输出最小的连续因子序列。输入格式:输入在一行中给出一个正整数N(1 < N < 2^31)。输出格式:首先在第1行输出最长连续因子的转载 2017-05-08 10:45:48 · 398 阅读 · 0 评论 -
无序数组中,三个数的乘积最大
给定一个无序数组,包含正数、负数和0,要求从中找出3个数的乘积,使得乘积最大,要求时间复杂度:O(n),空间复杂度:O(1) 输入,一个无序数组长度n,接着n个数43 4 1 2输出,最大的结果24ac1:(时间复杂度 O(nlogn) ,用到了排序,不符合O(n)的要求)需要排序,然后根据数据内容计算最大乘积, 注意数据使用 long long , 而非int#include <cstdio>原创 2017-10-07 19:41:03 · 2925 阅读 · 0 评论 -
1096. Consecutive Factors (20) (暴力法)
转载地址 http://www.cnblogs.com/asinlzm/p/4460935.html题目地址 https://www.patest.cn/contests/pat-a-practise/1096ac代码#include <cstdio>#include <cstdlib>#include <cmath>#include <cstring>#include <iostrea转载 2016-12-04 10:13:14 · 334 阅读 · 0 评论 -
摩尔投票法, O(n) O(1) 求出现次数大于n/2,n/3次数的数
参考 摩尔投票法讲解 http://www.cnblogs.com/grandyang/p/4606822.html 向上取整和向下取整。 http://blog.sina.com.cn/s/blog_a3137f350100zxy7.html169. Majority Elementhttps://leetcode.com/problems/majority-element/229. M转载 2016-12-12 08:54:01 · 1505 阅读 · 0 评论 -
1002. A+B for Polynomials (25)
1002. A+B for Polynomials (25)This time, you are supposed to find A+B where A and B are two polynomials.InputEach input file contains one test case. Each case occupies 2 lines, and each line c原创 2015-10-15 11:09:01 · 393 阅读 · 0 评论 -
题目1553:时钟
// 题目1553:时钟// http://ac.jobdu.com/problem.php?pid=1553#include<stdio.h>#include<iostream>#include <algorithm>using namespace std;#define N 100double angle(int hh , int mm){ double mmAngle =原创 2015-09-09 11:01:05 · 373 阅读 · 0 评论 -
1059. Prime Factors (25)
题目地址:http://www.patest.cn/contests/pat-a-practise/1059#include <cstdio> #include <iostream> #include <vector> #include <set>#include <algorithm>#include <stack>using namespace std;bool isPrime(原创 2015-09-02 21:15:18 · 274 阅读 · 0 评论 -
HDU 1248 寒冰王座
题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=1248/*HDU 1248 寒冰王座http://acm.hdu.edu.cn/showproblem.php?pid=1248*/#include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #de原创 2015-09-04 14:12:23 · 499 阅读 · 0 评论 -
1009. Product of Polynomials (25)
1009. Product of Polynomials (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueThis time, you are supposed to find原创 2015-11-14 19:04:36 · 300 阅读 · 0 评论 -
1015. Reversible Primes (20)
1015. Reversible Primes (20)A reversible prime in any number system is a prime whose "reverse" in that number system is also a prime. For example in the decimal system 73 is a reversible prime bec原创 2015-10-15 11:11:17 · 278 阅读 · 0 评论 -
1052. Linked List Sorting (25) -- 易犯错
1052. Linked List Sorting (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA linked list consists of a series of原创 2015-12-02 14:05:00 · 397 阅读 · 0 评论 -
1038. Recover the Smallest Number (30) - 剑指offer: 把数组排成最小的数
1038. Recover the Smallest Number (30)Given a collection of number segments, you are supposed to recover the smallest number from them. For example, given {32, 321, 3214, 0229, 87}, we can recover原创 2015-10-22 09:59:36 · 447 阅读 · 0 评论 -
全排列,字典顺序问题 ( permutations/leetcode)
46. Permutations题目地址 https://leetcode.com/problems/permutations/注意是distinct numbers,所以相对简单, 当然写出好的代码也是困难的,下面是ac代码(效率可能不高)方法1:采用dfs遍历class Solution {private: vector<vector<int>> ans; vector<in原创 2016-09-29 21:01:34 · 1456 阅读 · 0 评论 -
C/C++ 数据处理问题,+-*/%,overflow,运行超时等。
求平均数#include <cstdio> #include <cstdlib>#include <cstring>#include <string>#include <vector> #include <algorithm> #include <iostream>using namespace std;const int MA = 0x7fffffff; // INT 最大 = 214原创 2016-08-17 20:10:43 · 2321 阅读 · 0 评论 -
400. Nth Digit (leetcode) 。。。
题目的地址 https://leetcode.com/problems/nth-digit/题目描述 Find the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, …Note: n is positive and will fit within the range of a 32-b原创 2016-10-03 12:00:17 · 367 阅读 · 0 评论 -
Subsets 子集合问题(leetcode)
78. Subsets题目地址https://leetcode.com/problems/subsets/ 题目描述Given a set of distinct integers, nums, return all possible subsets.Note: The solution set must not contain duplicate subsets.For example, If原创 2016-10-07 12:27:14 · 550 阅读 · 0 评论 -
1082. Read Number in Chinese (25)
题目地址https://www.patest.cn/contests/pat-a-practise/1082ac思路转载 http://blog.csdn.net/apie_czx/article/details/48270285ac代码#include <cstdio>#include <cstdlib>#include <cmath>#include <cstring>#include转载 2016-11-30 12:13:52 · 249 阅读 · 0 评论 -
判断一个整型是否是2的次幂,并且求出大于等于该数的最小2的次幂数
转自云风的代码,见 https://github.com/cloudwu/buddy/blob/master/buddy.cstatic inline intis_pow_of_2(uint32_t x) { return !(x & (x-1));}static inline uint32_tnext_pow_of_2(uint32_t x) { if ( is_pow_o转载 2017-10-28 14:37:32 · 867 阅读 · 0 评论