杭电acmelevator问题c语言答案,杭电ACM部分题答案.doc

最新推荐文章于 2022-09-13 11:31:07 发布

K8S技术社区

最新推荐文章于 2022-09-13 11:31:07 发布

阅读量197

点赞数

文章标签：杭电acmelevator问题c语言答案

杭电ACM部分题答案.doc

下载提示(请认真阅读)1.请仔细阅读文档，确保文档完整性，对于不预览、不比对内容而直接下载带来的问题本站不予受理。

2.下载的文档，不会出现我们的网址水印。

3、该文档所得收入(下载+内容+预览)归上传者、原创作者；如果您是本文档原作者，请点此认领！既往收益都归您。

文档包含非法信息？点此举报后获取现金奖励！

下载文档到电脑，查找使用更方便

积分

还剩页未读，继续阅读

关键词：ACM

部分

答案

资源描述：

1000A + B Problem

Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 158161Accepted Submission(s): 50186

Problem Description

Calculate A + B.

Input

Each line will contain two integers A and B. Process to end of file.

Output

For each case, output A + B in one line.

Sample Input

1 1

Sample Output

Author

HDOJ

Statistic|Submit|Discuss | Note

#includeint main()

{

int a,b;

while(scanf("%d %d",&a,&b)!=EOF)

printf("%d\n",a+b);

}

1002A + B Problem II

Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 84367Accepted Submission(s): 15966

Problem Description

I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.

Input

The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line consists of two positive integers, A and B. Notice that the integers are very large, that means you should not process them by using 32-bit integer. You may assume the length of each integer will not exceed 1000.

Output

For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line is the an equation "A + B = Sum", Sum means the result of A + B. Note there are some spaces int the equation. Output a blank line between two test cases.

Sample Input

1 2

112233445566778899 998877665544332211

Sample Output

Case 1:

1 + 2 = 3

Case 2:

112233445566778899 + 998877665544332211 = 1111111111111111110

Author

Ignatius.L

Statistic|Submit|Discuss | Note

#include #include int main(){

char str1[1001], str2[1001];

int t, i, len_str1, len_str2, len_max, num = 1, k;

scanf("%d", &t);

getchar();

while(t--){

int a[1001] = {0}, b[1001] = {0}, c[1001] = {0};

scanf("%s", str1);

len_str1 = strlen(str1);

for(i = 0; i <= len_str1 - 1; ++i)

a[i] = str1[len_str1 - 1 - i] - 0;

scanf("%s",str2);

len_str2 = strlen(str2);

for(i = 0; i <= len_str2 - 1; ++i)

b[i] = str2[len_str2 - 1 - i] - 0;

if(len_str1 > len_str2)

len_max = len_str1;

else

len_max = len_str2;

k = 0;

for(i = 0; i <= len_max - 1; ++i){

c[i] = (a[i] + b[i] + k) % 10;

k = (a[i] + b[i] + k) / 10;

}

if(k != 0)

c[len_max] = 1;

printf("Case %d:\n", num);

num++;

printf("%s + %s = ", str1, str2);

if(c[len_max] == 1)

printf("1");

for(i = len_max - 1; i >= 0; --i){

printf("%d", c[i]);

}

printf("\n");

if(t >= 1)

printf("\n");

}

return 0;

}

1005Number Sequence

Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 44346Accepted Submission(s): 9722

Problem Description

A 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).

Input

The input consists of multiple test cases. Each test case contains 3 integers A, B and n on a single line (1 <= A, B <= 1000, 1 <= n <= 100,000,000). Three zeros signal the end of input and this test case is not to be processed.

Output

For each test case, print the value of f(n) on a single line.

Sample Input

1 1 3

1 2 10

0 0 0

Sample Output

Author

CHEN, Shunbao

Source

ZJCPC2004

Recommend

JGShining

Statistic|Submit|Discuss | Note

#includeint f[200];

int main()

{

int a,b,n,i;

while(scanf("%d%d%d",&a,&b,&n)&&a&&b&&n)

{

if(n>=3)

{

f[1]=1;f[2]=1;

for(i=3;i<=200;i++)

{

f[i]=(a*f[i-1]+b*f[i-2])%7;

if(f[i-1]==1&&f[i]==1)

break;

}

i-=2;

n=n%i;

if(n==0)

printf("%d\n",f[i]);

else

printf("%d\n",f[n]);

}

else

printf("1\n");

}

return 0;

}

1008Elevator

Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 17764Accepted Submission(s): 9490

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

Sample Output

Author

ZHENG, Jianqiang

Source

ZJCPC2004

Recommend

JGShining