摘要： 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.What is the smallest positive number that isevenly divisibleby all of the numbers from 1 to 20?#include #include #include #include #define N 20 int gcd(int a, int b){ if(b==0) return a; ... 阅读全文

摘要： A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 9199.Find the largest palindrome made from the product of two 3-digit numbers.#include#include#include#include#include#includebool palindromic(int n) //判断一个整数是否为回文数{ char ... 阅读全文

摘要： The prime factors of 13195 are 5, 7, 13 and 29.What is the largest prime factor of the number 600851475143 ?#include#include#include#include#include#include#define N 600851475143bool prim(int n){ int i; for(i=2; i*i<=n; i++) { if(n%i==0) return false; } return true;}... 阅读全文

摘要： Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-value 阅读全文

摘要： If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.Find the sum of all the multiples of 3 or 5 below 1000.题目大意：10以下的自然数中，属于3和5的倍数的有3,5,6和9，它们之和是23.找出1000以下的自然数中，属于3和5的倍数的数字之和。#include #include #include void solve(){ in... 阅读全文

摘要： While preparing this problem set the jury has run into the following problem: it was necessary to send by e-mail the texts of the problems. As it is well known, e-mail is not reliable, messages are sent not enciphered, there is a danger that someone can intercept them. The members of the program com 阅读全文

摘要： You programmers are lucky! You don't have to deal with these terrible people – designers… This story happened with me not so long ago. We had an order from a company building a new hotel. One day they brought a sketch to our workshop. They said that THIS was invented by a very cool designer. The 阅读全文

摘要： LetAn= sin(1–sin(2+sin(3–sin(4+…sin(n))…)LetSn= (…(A1+n)A2+n–1)A3+…+2)An+1For givenNprintSNInputOne integerN. 1 ≤N≤ 200OutputLine containingSNSampleinputoutput3((sin(1)+3)sin(1–sin(2))+2)sin(1–sin(2+sin(3)))+1Problem Author:Vladimir GladkovProblem Source:Ural Collegiate Programming Contest, April 20 阅读全文

摘要： Consider the sequence of numbersai,i= 0, 1, 2, …, which satisfies the following requirements:a0= 0a1= 1a2i=aia2i+1=ai+ai+1for everyi= 1, 2, 3, … .Write a program which for a given value ofnfinds the largest number among the numbersa0,a1, …,an.InputYou are given several test cases (not more than 10). 阅读全文

摘要： Your task is to find the sum of all integer numbers lying between 1 andNinclusive.InputThe input consists of a single integerNthat is not greater than 10000 by it's absolute value.OutputWrite a single integer number that is the sum of all integer numbers lying between 1 andNinclusive.Sampleinput 阅读全文