![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
笔记
Interstellar °
这个作者很懒,什么都没留下…
展开
-
zzulioj1072:青蛙爬井 用数学算法计算
#include<stdio.h> int main() { int high,up,down; int x,a,y=1; scanf("%d %d %d",&high,&up,&down); x = high-up; a = x/(up-down); y += a; printf("%d",y); }原创 2020-12-03 23:40:14 · 568 阅读 · 0 评论 -
zzuli oj 1038 用fabs函数求解
#include<stdio.h> #include<math.h> int main() { int a,b,c; int q,w,e; int max; scanf("%d %d %d",&a,&b,&c); q = fabs(a); w = fabs(b); e = fabs©; max = q; if(max<w&&e<w) { max = b; printf("%d",b); } else if(max<e&原创 2020-11-12 17:12:53 · 118 阅读 · 0 评论 -
2020-11-12
##zzuli oj 1038 绝对值最大 #include<stdio.h> #include<math.h> int main() { int a,b,c; int q,w,e; int max; scanf("%d %d %d",&a,&b,&c); q = fabs(a); w = fabs(b); e = fabs©; max = q; if(max<w&&e<w) { max = b; printf("%d",b);原创 2020-11-12 17:07:18 · 44 阅读 · 0 评论