谙忆-陈浩翔

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

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

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

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

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

Problem Description 把一个偶数拆成两个不同素数的和，有几种拆法呢？Input 输入包含一些正的偶数，其值不会超过10000，个数不会超过500，若遇0，则结束。Output 对应每个偶数，输出其拆成不同素数的个数，每个结果占一行。Sample Input 30 26 0Sample Output 3 2素数打表法！import java.util.Scanner;

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

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

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

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 输出为一个整数,为该区间因子最多的数.如