[工学]ACM简单题二.ppt

课后任务： /showproblem.php?pid=1008 Problem Description The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 seconds to move the elevator up one floor, and 4 seconds to move down one floor. The elevator will stay for 5 seconds at each stop.For a given request list, you are to compute the total time spent to fulfill the requests on the list. The elevator is on the 0th floor at the beginning and does not have to return to the ground floor when the requests are fulfilled. Input There are multiple test cases. Each case contains a positive integer N, followed by N positive numbers. All the numbers in the input are less than 100. A test case with N = 0 denotes the end of input. This test case is not to be processed. Output Print the total time on a single line for each test case. Sample input: 1 2 3 2 3 1 0 Sample output: 17 41 #include stdio.h int main(void) { int n, i, a[101], value, sum; while(scanf(%d,n) n!=0) { a[0] = 0; for(i = 1; i = n; i++) { scanf(%d,value); a[i]=value; } sum = n * 5; for(i = 0; i n; i++) { if(a[i]a[i+1]) sum = sum + (a[i+1]-a[i])*6; else if(a[i]a[i+1]) sum = sum + (a[i]-a[i+1])*4; } printf(%d\n, sum); } return 0; } HDOJ_1061 ?Rightmost Digit /showproblem.php?pid=1061 Problem Description Given a positive integer N, you should output the most right digit of N^N. Input The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.Each test case contains a single positive integer N(1=N=1,000,000,000). Output For each test case, you should output the rightmost digit of N^N. Sample input: 2 3 4 Sample output: 7 6 数据规模? 很大 暴力方法? 该打 基本思路? 规律 HDOJ_2035 人见人爱A^B 求A^B的最后三位数表示的整数（1=A,B=10000） 2 3 12 6