海岛Blog

海是无垠的,岛在海中是独立的,有一片自己的天空

POJ NOI MATH-7647 余数相同问题

问题链接:POJ NOI MATH-7647 余数相同问题。 总时间限制: 1000ms内存限制: 65536kB 描述 已知三个正整数 a,b,c。 现有一个大于1的整数x,将其作为除数分别除a,b,c,得到的余数相同。 请问满足上述条件的x的最小值是多少? 数据保证x有解。 输入一行...

2017-03-31 22:54:39

阅读数:1826

评论数:0

CCF NOI1000 加密算法

问题链接:CCF NOI1000 加密算法。 时间限制: 1000 ms  空间限制: 262144 KB 题目描述   神龙数码公司设计了一个加密算法:用a代替z,用b代替y,用c代替x,......,用z代替a。现要求输入一个小写字母,对其进行加密输出。 输入   输入一个小写字母...

2017-03-31 21:50:22

阅读数:1800

评论数:0

Project Euler Problem 27 Quadratic primes

Quadratic primes Problem 27 Euler discovered the remarkable quadratic formula: n2+n+41 It turns out that the formula will produce 40 prim...

2017-03-30 19:46:48

阅读数:576

评论数:0

Project Euler Problem 118 Pandigital prime sets

Pandigital prime sets Problem 118 Using all of the digits 1 through 9 and concatenating them freely to form decimal integers, different sets can b...

2017-03-30 18:52:29

阅读数:772

评论数:0

Project Euler Problem 36 Double-base palindromes

Double-base palindromes Problem 36 The decimal number, 585 = 10010010012 (binary), is palindromic in both bases. Find the sum of all numbers, less...

2017-03-30 01:00:00

阅读数:779

评论数:0

Project Euler Problem 38 Pandigital multiples

Pandigital multiples Problem 38 Take the number 192 and multiply it by each of 1, 2, and 3: 192 × 1 = 192 192 × 2 = 384 192 × 3 = 576 ...

2017-03-29 22:00:47

阅读数:619

评论数:0

Project Euler Problem 104 Pandigital Fibonacci ends

Pandigital Fibonacci ends Problem 104 The Fibonacci sequence is defined by the recurrence relation: Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1. I...

2017-03-29 11:38:13

阅读数:587

评论数:2

Project Euler Problem 32 Pandigital products

Pandigital products Problem 32 We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once; for exampl...

2017-03-29 06:38:22

阅读数:804

评论数:0

Project Euler Problem 41 Pandigital prime

Pandigital prime Problem 41 We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once. For example, ...

2017-03-28 18:32:56

阅读数:424

评论数:0

Project Euler Problem 34 Digit factorials

Digit factorials Problem 34 145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145. Find the sum of all numbers which are equal to th...

2017-03-28 17:48:12

阅读数:470

评论数:0

UVA10079 Pizza Cutting【水题】

When someone calls Ivan lazy, he claims that it is his intelligence that helps him to be so. If hisintelligence allows him to do something at less ph...

2017-03-28 16:53:18

阅读数:601

评论数:0

UVA100 POJ1207 HDU1032 The 3n + 1 problem【水题】

The 3n + 1 problem Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 59408   Accepted: 18891 Description Pro...

2017-03-28 16:31:12

阅读数:558

评论数:0

Project Euler Problem 23 Non-abundant sums

Non-abundant sums Problem 23 A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For exampl...

2017-03-28 09:58:12

阅读数:546

评论数:0

Project Euler Problem 24 Lexicographic permutations

Lexicographic permutations Problem 24 A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of th...

2017-03-28 08:21:42

阅读数:582

评论数:0

Project Euler Problem 19 Counting Sundays

Counting Sundays Problem 19 You are given the following information, but you may prefer to do some research for yourself. 1 Jan 1900 was...

2017-03-27 04:01:18

阅读数:684

评论数:0

CCF201703-2 学生排队(100分)

试题编号:201703-2试题名称:学生排队时间限制:1.0s内存限制:256.0MB问题描述:问题描述  体育老师小明要将自己班上的学生按顺序排队。他首先让学生按学号从小到大的顺序排成一排,学号小的排在前面,然后进行多次调整。一次调整小明可能让一位同学出队,向前或者向后移动一段距离后再插入队列。...

2017-03-26 18:40:03

阅读数:7985

评论数:14

Project Euler Problem 17 Number letter counts

Number letter counts Problem 17 If the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4...

2017-03-26 15:56:58

阅读数:540

评论数:0

CCF201703-1 分蛋糕(100分)

试题编号:201703-1试题名称:分蛋糕时间限制:1.0s内存限制:256.0MB问题描述:问题描述  小明今天生日,他有n块蛋糕要分给朋友们吃,这n块蛋糕(编号为1到n)的重量分别为a1, a2, …, an。小明想分给每个朋友至少重量为k的蛋糕。小明的朋友们已经排好队准备领蛋糕,对于每个朋友...

2017-03-25 15:48:11

阅读数:8918

评论数:14

Project Euler Problem 92 Square digit chains

Square digit chains Problem 92 A number chain is created by continuously adding the square of the digits in a number to form a new number until it...

2017-03-25 08:37:03

阅读数:671

评论数:4

Project Euler Problem 543 Prime-Sum Numbers

Prime-Sum Numbers Problem 543 Define function P(n,k) = 1 if n can be written as the sum of k prime numbers (with repetitions allowed), and P...

2017-03-24 08:03:34

阅读数:819

评论数:2

提示
确定要删除当前文章?
取消 删除
关闭
关闭