----- 素数相关
谙忆
Java相关研发架构工作经验5年。拥有Java相关发明专利8余项。从事过支付行业,研发与架构的系统稳定地支撑着公司日千万交易笔数量级的支付和对账。
二手车SaaS内核研发3年经验+,拥有二手车行业SaaS相关发明专利6项,研发、架构的元数据内核与权限系统,每日亿万级接口调用。
Java企业开发丰富的理论知识和实战经验。2020年CSDN博客之星第12名,同时在一些社区担任名誉职位。认证为CSDN博客专家、CSDN专栏签约作者、InfoQ签约作者、阿里云ACE杭州同城会会长、阿里云社区认证专家、华为云·云享专家。
展开
-
HDOJ(HDU) 2136 Largest prime factor(素数筛选)
Problem Description Everybody knows any number can be combined by the prime number. Now, your task is telling me what position of the largest prime factor. The position of prime 2 is 1, prime 3 is 2原创 2016-05-03 20:30:42 · 12435 阅读 · 0 评论 -
HDOJ/HDU 2710 Max Factor(素数快速筛选~)
Problem Description To improve the organization of his farm, Farmer John labels each of his N (1 <= N <= 5,000) cows with a distinct serial number in the range 1..20,000. Unfortunately, he is unaware原创 2016-05-19 00:39:05 · 4644 阅读 · 0 评论 -
ZOJ Problem Set - 3758 素数
Singles’ DayTime Limit: 2 Seconds Memory Limit: 65536 KB Singles’ Day(or One’s Day), an unofficial holiday in China, is a pop culture entertaining holiday on November 11 for young Chinese to celeb原创 2015-08-23 18:36:23 · 1294 阅读 · 0 评论 -
HDOJ 2012 素数判定
Problem Description 对于表达式n^2+n+41,当n在(x,y)范围内取整数值时(包括x,y)(-39<=ximport java.util.Scanner;class Main{ public static void main(String args[]){ Scanner sc = new Scanner(System.in); while(s原创 2015-11-06 19:10:26 · 1790 阅读 · 0 评论 -
HDOJ(HDU) 2161 Primes(素数打表)
Problem Description Write a program to read in a list of integers and determine whether or not each number is prime. A number, n, is prime if its only divisors are 1 and n. For this problem, the numbe原创 2016-05-05 19:24:14 · 5229 阅读 · 0 评论 -
HDOJ 2098 分拆素数和
Problem Description 把一个偶数拆成两个不同素数的和,有几种拆法呢?Input 输入包含一些正的偶数,其值不会超过10000,个数不会超过500,若遇0,则结束。Output 对应每个偶数,输出其拆成不同素数的个数,每个结果占一行。Sample Input 30 26 0Sample Output 3 2素数打表法!import java.util.Scanner;原创 2016-02-19 16:59:28 · 1692 阅读 · 0 评论 -
HDOJ 1164 Eddy's research I(拆分成素数因子)
Problem Description Eddy’s interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divided into the multiply of prime number, but he can’t writ原创 2016-04-01 19:38:21 · 3180 阅读 · 0 评论 -
HDOJ 1397 Goldbach's Conjecture(快速筛选素数法)
Problem Description Goldbach’s Conjecture: For any even number n greater than or equal to 4, there exists at least one pair of prime numbers p1 and p2 such that n = p1 + p2. This conjecture has not原创 2016-04-11 03:11:11 · 2293 阅读 · 0 评论 -
HDOJ(HDU) 2138 How many prime numbers(素数-快速筛选没用上、)
Problem Description Give you a lot of positive integers, just to find out how many prime numbers there are.Input There are a lot of cases. In each case, there is an integer N representing the num原创 2016-05-05 01:30:23 · 3099 阅读 · 0 评论 -
HDOJ(HDU) 2521 反素数(因子个数~)
Problem Description 反素数就是满足对于任意i(0< i < x),都有g(i) < g(x),(g(x)是x的因子个数),则x为一个反素数。现在给你一个整数区间[a,b],请你求出该区间的x使g(x)最大。Input 第一行输入n,接下来n行测试数据 输入包括a,b, 1<=a<=b<=5000,表示闭区间[a,b].Output 输出为一个整数,为该区间因子最多的数.如原创 2016-05-10 01:51:04 · 5461 阅读 · 0 评论