- 博客(6)
- 收藏
- 关注
RSS订阅原创 HDOJ1005：Number Sequence
Problem DescriptionA number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to calculate the value of f(n).
2013-11-19 13:08:46
733
原创 HDOJ1004：Let the Balloon Rise
Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest
2013-11-19 12:21:46
751
原创 HDOJ1003：Max Sum
Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5
2013-11-18 15:16:32
796
原创 HDOJ1001：Sum Problem
Problem DescriptionHey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + ... + n. InputThe input will co
2013-11-18 14:13:37
806
原创 HDOJ1002： A + B Problem II
Java Code：import java.math.BigInteger;import java.util.Scanner;public class Main { public static void main(String[] args){ int count=1; Scanner sc=new Scanner(System.in); int T=sc.nextI
2013-11-18 13:57:18
755
原创 HDOJ1000：A + B Problem
import java.util.Scanner;public class Main {public static void main(String[] args){Scanner sc=new Scanner(System.in);while(sc.hasNext()){int a=sc.nextInt();int b=sc.nextInt();Syste
2013-11-18 13:28:33
642
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人