当前位置: 首页 > news >正文

PTA刷题笔记2

·7-7 12-24小时制

代码如下:

#include<stdio.h>int main()
{int original_hour = 0;int original_minute = 0;scanf("%d:%d", &original_hour, &original_minute);if(original_hour > 12){int last_hour = original_hour - 12;printf("%d:%d PM", last_hour, original_minute);}else if(original_hour < 12 && original_hour != 0){printf("%d:%d AM", original_hour, original_minute);}else if(original_hour == 0){printf("0:%d AM", original_minute);}else if(original_hour == 12){printf("12:%d PM", original_minute);}return 0;
}

·7-8 超速判断

代码如下:

#include<stdio.h>int main()
{int n = 0;scanf("%d", &n);if(n > 60){printf("Speed: %d - Speeding", n);}else{printf("Speed: %d - OK", n);}return 0;
}

7-9 用天平找小球

代码如下:

#include<stdio.h>int main()
{int a, b, c;scanf("%d %d %d", &a, &b, &c);if(a == b){printf("C");}else if(a == c){printf("B");}else if(b == c){printf("A");}return 0;
}

·7-10 计算工资

代码如下:

#include<stdio.h>int main()
{int year = 0;int time = 0;scanf("%d %d", &year, &time);float ans = 0.0;if(year < 5){if(time <= 40){ans = 30 * time;}else{ans = 40 * 30 + (time - 40) * 45;}}else{if(time <= 40){ans = 50 * time;}else{ans = 40 * 50 + (time - 40) * 75;}}printf("%.2f", ans);return 0;
}

·7-11 分段计算居民水费

代码如下:

#include<stdio.h>int main()
{float x = 0.0;scanf("%f", &x);float y = 0.0;if(x <= 15){y = 4 * x / 3.00;}else{y = 2.5 * x - 17.5;}printf("%.2f", y);return 0;
}

7-12 两个数的简单计算器

代码如下:

#include<stdio.h>int main()
{int a, b;char ch;int ans = 0;scanf("%d %c %d", &a, &ch, &b);if(ch == '+'){ans = a + b;}else if(ch == '-'){ans = a - b;}else if(ch == '*'){ans = a * b;}else if(ch == '/'){ans = a / b;}else if(ch == '%'){ans = a % b;}else{printf("ERROR");return 0;}printf("%d", ans);return 0;
}

优化代码:

#include<stdio.h>int main()
{int a, b;char ch;scanf("%d %c %d", &a, &ch, &b);switch(ch){case'+' :printf("%d", a + b);break;case'-' :printf("%d", a - b);break;case'*':printf("%d", a * b);break;case'/' :printf("%d", a / b);break;case'%' :printf("%d", a % b);break;default :printf("ERROR");}return 0;
}

·7-13 日K蜡烛图

代码如下:

#include<stdio.h>int main()
{float Open, Close, High, low;scanf("%f %f %f %f", &Open, &High, &low, &Close);if(Close < Open){if((low < Open && low < Close) && (High > Open && High > Close)){printf("BW-Solid with Lower Shadow and Upper Shadow");}else if(low < Open && low < Close){printf("BW-Solid with Lower Shadow");}else if(High > Open && High > Close){printf("BW-Solid with Upper Shadow");}else{printf("BW-Solid");}}else if(Close > Open){if((low < Open && low < Close) && (High > Open && High > Close)){printf("R-Hollow with Lower Shadow and Upper Shadow");}else if(low < Open && low < Close){printf("R-Hollow with Lower Shadow");}else if(High > Open && High > Close){printf("R-Hollow with Upper Shadow");}else{printf("R-Hollow");}}else if(Close == Open){if((low < Open && low < Close) && (High > Open && High > Close)){printf("R-Cross with Lower Shadow and Upper Shadow");}else if(low < Open && low < Close){printf("R-Cross with Lower Shadow");}else if(High > Open && High > Close){printf("R-Cross with Upper Shadow");}else{printf("R-Cross");}}return 0;
}

优化代码:

#include <stdio.h>void printCandlePattern(const char* basePattern, int hasLowerShadow, int hasUpperShadow) {if (hasLowerShadow && hasUpperShadow) {printf("%s with Lower Shadow and Upper Shadow", basePattern);} else if (hasLowerShadow) {printf("%s with Lower Shadow", basePattern);} else if (hasUpperShadow) {printf("%s with Upper Shadow", basePattern);} else {printf("%s", basePattern);}
}int main() {float Open, Close, High, Low;scanf("%f %f %f %f", &Open, &High, &Low, &Close);int hasLowerShadow = (Low < Open && Low < Close);int hasUpperShadow = (High > Open && High > Close);if (Close < Open) {printCandlePattern("BW-Solid", hasLowerShadow, hasUpperShadow);} else if (Close > Open) {printCandlePattern("R-Hollow", hasLowerShadow, hasUpperShadow);} else { // Close == OpenprintCandlePattern("R-Cross", hasLowerShadow, hasUpperShadow);}return 0;
}

·7-14 求整数段和

代码如下:

#include<stdio.h>int main()
{int a, b = 0;scanf("%d %d", &a, &b);int sum = 0;int count = 0;for(int i = a; i <= b; i ++){printf("%5d", i);sum += i;count ++;if(count % 5 == 0 || i == b)//每五个数字换行,或者到达最后一个数字时换行{printf("\n");}}printf("Sum = %d", sum);return 0;
}

http://www.xdnf.cn/news/614971.html

相关文章:

  • AI智能体工具调研分享(未完待续)
  • 养生指南:五维打造健康新方式
  • Coze工作流文生图实战应用-哪吒表情包制作
  • LEED认证是什么?LEED认证难吗?LEED认证需要准备的资料
  • qt出现launching debugger,运行失败
  • 河道管网排口在线监测系统解决方案
  • 多路径可靠传输协议(比如 MPTCP)为什么低效
  • MIGO委外(外协)采购订单过账的增强
  • 如何选择和应用WAF技术:核心原理、应用场景与优劣势解析
  • 【接口设计文档】:在线聊天平台(Online-Chat)
  • IEC 61156-5:2020 标准技术解析与应用综述
  • 肠道微生物组研究的特有数据库
  • [C]基础15.C语言内存函数
  • centos原系统安装了Python3.7.9兼用在安装一个python3.8
  • 全面解析EDI RECADV报文:结构组成、业务应用与关键注意事项
  • Java中的集合(持续更新)
  • 如何使用WordPress区块(以及如何创建自定义区块)?
  • 常见算法题目2 - 给定一个字符串,找出其中最长的不重复子串
  • C++ std::find() 函数全解析
  • 在 Android 开发中判断用户是否开启了“允许安装未知来源应用(Install Unknown Apps)”权限
  • 字符串和常量池的进一步研究
  • Android中Binder驱动作用?
  • 影刀RPA:开启办公自动化的高效之旅
  • Vue:axios(POST请求)
  • 【JavaScript 实现导航栏顶部吸附效果】
  • 8天Python从入门到精通【itheima】-35~37
  • 养成一个逐渐成长的强化学习ai
  • AI练习:折叠效果
  • magentic-ui和browser-use深度分析
  • 统一错误处理脚本实现