ACM problem-> 1002

ACM Ex.1002

<SUM problem>:

A+B Problem II;

               Input:

                              Casesnumbers, next is two integers;

               Output:

                              Case#:

                                             num1+num2=results.

               Example:  sample input “2

                                                                                          12

                                                                                          34 ”

                                               sample output “

                                                                                          case1:

                                                                                          1+2=?

                                                                                          Case2:

                                                                                          3+4=?”

Key points:

a). memset(), usually used on the array initialization. In<memory.h>;

Meet Bugs:

a). fprintf(),  parameter:  (File*,”template”,var…);

C Code:

 

#include <stdio.h>

#include <stdlib.h>

#include <memory.h>

 

void main(void)

{

               FILE*fp1=NULL;

               FILE*fp2=NULL;

 

               fp1=fopen("test1","r");

               fp2=fopen("test2","r+");

              

               intlen=100;

               charch[len];

               memset(ch,0,sizeof(char)*len);

               int a=0;

               int b=0;

               int i=1;

 

               fgets(ch,len,fp1);

               //printf("%s\n",ch);

               sscanf(ch,"%d%d",&a,&b);

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

               //fprintf(fp2,"case%d\n",a);

               while(NULL!=fgets(ch,len,fp1))

                              {

                                             //printf("%s",ch);

                                             sscanf(ch,"%d%d",&a,&b);

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

                                             fprintf(fp2,"case%d :\n",i++);

                                             fprintf(fp2,"%d+%d=%d\n",a,b,a+b);

                              }

 

 

               fclose(fp1);

               fclose(fp2);

 

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值