ACM problem-> 1002
来源:互联网 发布:网桥用于连接什么网络 编辑:程序博客网 时间:2024/05/11 04:13
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);
}
- ACM problem-> 1002
- ACM HDOJ 1002 (A + B Problem II)
- ACM ZOJ Problem Set - 1002 fire net
- ACM:HDU-1002 A + B Problem II
- HDU ACM 1002 A + B Problem II
- Euclid Problem-ACM
- ACM Problem A
- ACM Problem B
- ACM Problem C
- [ACM]a+b problem
- [ACM]Sum Problem
- acm-A*B Problem
- acm-A-B Problem
- acm-A/B Problem
- acm-Train Problem I
- ACM-Train Problem I
- ACM Problem E
- ACM-problem A
- Unity3D 游戏引擎之C#使用Socket与HTTP连接服务器传输数据包
- iOS开发工具Xcode史上最全快捷键
- 初步了解java中的注解
- ubuntu输入正确用户密码重新跳到无法登录
- Ubuntu 下编译Opencv3.1.0, 使用IDEA下Java开发
- ACM problem-> 1002
- 我的博客即将入驻“云栖社区”,诚邀技术同仁一同入驻。
- 高级Linux Kernel Inline Hook技术分析与实现
- Linux 资源暂不可用或者unable to create new native thread
- 用MapReduce处理一组流量数据,并按总流量排序
- 正则表达式零宽断言详解
- Java Web中JavaBean的使用
- 菲波那切数列
- 知道这20个正则表达式,能让你少写1,000行代码