当前位置:网站首页>Exercise 7-7 string replacement (15 points)
Exercise 7-7 string replacement (15 points)
2022-06-13 09:25:00 【Hezeze】

#include <stdio.h>
int main () {
int i;
char a[81];
gets (a);
for (i=0;a[i]!='\0';i++) {
if (a[i]>='A'&&a[i]<='Z') {
a[i]=a[i]+('Z'+'A'-2*a[i]);
}
}
puts (a);
return 0;
}
边栏推荐
- C language 7-13 day K candle chart (15 points)
- 攻防世界PWN play 条件竞争漏洞的利用
- 静态变量与一个类相关联,只要该类在内存中(只要您的应用程序终止,该变量就不存在)就可以使用。(堆本体,栈引用)
- Solov2 nanny level tutorial (including environment configuration, training your own data set, code logic analysis, etc...) Updating ing
- LeetCode 343. integer partition
- JUC atomic integer
- C language: timer principle
- JUC Unsafe
- C language: recursive function to realize Hanoi Tower
- LeetCode 322. Change
猜你喜欢

线上调试工具Arthas高级

C language: Simulated Implementation of library function strcpy

Solov2 source code analysis

JUC atomic reference and ABA problem

Jenkins access openldap user authentication

Class loading overview

Final principle

Longadder of the source code of JUC atomic accumulator

Online debugging tool Arthas advanced

C language: recursive function to realize Hanoi Tower
随机推荐
Collection of articles on virtualization and cloud computing
LeetCode 5259. Calculate the total tax payable
C language: summary of question brushing (1)
Final principle
LeetCode 5259. 计算应缴税款总额
(dp+ memory) acwing 901 skiing
JUC Unsafe
LeetCode 6095. Strong password checker II
20211108 observable, controllable, stable and measurable
(Dijkstra + shortest circuit + by point n^2) acwing 849 Dijkstra finding the shortest path I
LeetCode 1143. 最长公共子序列
Simulink variant model and variant subsystem usage
LeetCode 202. Happy number
Alibaba senior experts analyze the standard design of protocol
(bfs) acwing 844. Labyrinth
LeetCode 5289. 公平分发饼干(DFS)
静态变量与一个类相关联,只要该类在内存中(只要您的应用程序终止,该变量就不存在)就可以使用。(堆本体,栈引用)
Figure introduction to database neo4j
JUC field Updater
Routing - static routing