ACM,再见！

http://acm.hdu.edu.cn/showproblem.php?pid=2899Problem DescriptionNow, here is a fuction:  F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x (0 Can you find the minimum value when x is between 0 a

http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=783http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=66

http://acm.hdu.edu.cn/showproblem.php?pid=3714Problem DescriptionJosephina is a clever girl and addicted to Machine Learning recently. Shepays much attention to a method called Linear Disc

http://acm.hdu.edu.cn/showproblem.php?pid=3509

http://acm.hdu.edu.cn/showproblem.php?pid=2814Problem DescriptionIn mathematics, the Fibonacci numbers are a sequence of numbers named after Leonardo of Pisa, known as Fibonacci (a contracti

http://acm.hdu.edu.cn/showproblem.php?pid=1757

http://acm.hdu.edu.cn/showproblem.php?pid=1588

http://acm.hit.edu.cn/hoj/problem/view?id=1864

http://poj.org/problem?id=3070

http://acm.hdu.edu.cn/showproblem.php?pid=4790Problem Description　　Coach Pang and Uncle Yang both love numbers. Every morning they play a game with number together. In each game the followin

http://www.spoj.com/problems/AMR11B/Hogwarts is under attack by the Dark Lord, He-Who-Must-Not-Be-Named. To protect the students, Harry Potter must cast protective spells so that those who are p

http://acm.hdu.edu.cn/showproblem.php?pid=5187Problem DescriptionAs one of the most powerful brushes, zhx is required to give his juniors n problems.zhx thinks the ith problem's difficul

http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=457

代码如下：#include #include #include using namespace std;typedef long long LL;const int N = 2,M=2,P=2;const int MOD=1000000007;struct Matrix{ LL m[N][N];};Matrix A={1,1, 1,0};

题目大意：判断有多少个长度为n的字符串

http://acm.nefu.edu.cn/JudgeOnline/problemshow.php

http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=459descriptionLele now is thinking about a simple function f(x).If x < 10 f(x) = x.If x >= 10 f(x) = a0 * f(x-1)

解题思路：

http://acm.hdu.edu.cn/showproblem.php?pid=4438Problem DescriptionAlice and Bob are the topmost hunters in the forest, so no preys can escape from them. However, they both think that its

http://acm.hit.edu.cn/hoj/problem/view?id=2060As we know , the Fibonacci numbers are defined as follows: """"Given two numbers a and b , calculate . """"InputThe input contains s

http://acm.hdu.edu.cn/showproblem.php?pid=3117

http://acm.timus.ru/problem.aspx?space=18&num=10J. Something EasierTime limit: 1.0 secondMemory limit: 64 MB“How do physicists define prime numbers? Very easily: prime numbers are

http://codeforces.com/problemset/problem/221/BB. Little Elephant and Numberstime limit per test2 secondsmemory limit per test256 megabytesinputstandard input

http://poj.org/problem?id=1595Prime CutsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9976 Accepted: 3822DescriptionA prime number is a counti

http://poj.org/problem?id=2739DescriptionSome positive integers can be represented by a sum of one or more consecutive prime numbers. How many such representations does a given positive intege

http://acm.hdu.edu.cn/showproblem.php?pid=1215Problem Description七夕节那天,月老来到数字王国,他在城门上贴了一张告示,并且和数字王国的人们说:"你们想知道你们的另一半是谁吗?那就按照告示上的方法去找吧!"人们纷纷来到告示前,都想知道谁才是自己的另一半.告示如下:数字N的因子就是所有比N小又

http://codeforces.com/problemset/problem/227/AA. Where do I Turn?time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard o

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=43142#problem/BDescriptionWhile preparing this problem set the jury has run into the following problem: it was necessary to send by

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=43142#problem/CDescriptionThe most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers f

http://codeforces.com/problemset/problem/276/BB. Little Girl and Gametime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstanda

http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=630

http://acm.hdu.edu.cn/showproblem.php?pid=1021Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2). InputInp

http://acm.hit.edu.cn/hoj/problem/view?id=2255

http://codeforces.com/problemset/problem/7/C

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1721

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1833A pair of numbers has a unique LCM but a single number can be the LCM of more than one possible p

http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=602description对于一个正整数n，求出它的欧拉函数值，其中1 input输入数据有多组，每组数据一行，有1个正整数为n。 out

http://vjudge.net/contest/view.action?cid=46225#problem/H Two players, S and T, are playing a game where they make alternate moves. S plays first. In this game, they start with an integer N. I

http://codeforces.com/problemset/problem/230/BB. T-primestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output

http://acm.hdu.edu.cn/showproblem.php?pid=5366Problem DescriptionZJiaQ want to become a strong man, so he decided to play the mook jong。ZJiaQ want t