pat
天凉枸杞
这个作者很懒,什么都没留下…
展开
-
1001. A+B Format
题目主要考察数字的分段表示。#include #include #include int main() { int a,b,sum,abso; scanf("%d%d",&a,&b); sum=a+b; abso=abs(sum); if(abso1000) { printf("%d",sum);原创 2018-02-05 19:12:54 · 79 阅读 · 0 评论 -
1002.A+B for Polynomials
多项式的求和与输出,关注于数组下标越界等条件。#include #include #define max 1005int main(){ int num1,num2,i,sum=0; float a[max],b[max]; int j,loca=0; for(i=0;imax;i++) { a[i]=0;b[i]=0;原创 2018-02-05 19:19:18 · 125 阅读 · 0 评论 -
1004. Counting Leaves (30)
A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.InputEach input file contains one test case. Each case starts with a原创 2018-02-06 13:07:50 · 147 阅读 · 0 评论