
CPAMA学习记录
孑然夏石
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
CPAMA 利用结构函数更新时间输出(有地方没搞懂)
time updatetime(time now){ if (now.second == 59) { now.minute += 1; now.second = 0; if (now.minute == 60) { now.hour += 1; now.minute = 0; if (now.hour == 24) now.hour = 0; } } else now.second += 1; return now;}定义的返回time.原创 2021-09-03 21:53:36 · 84 阅读 · 0 评论 -
CPAMA 指针与多维数组的一点思考
#include <stdio.h>int main(void){ int b[2][3] = {{ 1,2,3 }, { 7, 5, 6 }}; int(*p)[3] = b;//这里b指向一个长度为3的一维数组; //b=&b[0][0]=*b;b+1=*(b+1)=&b[1][0]; printf("%d\n", b);//所以当b指向一个一维数组,b代表了首元素; printf("%d\n", &b[0][0]); printf("%d\n", .原创 2021-09-02 17:54:02 · 90 阅读 · 0 评论 -
CPAMA 编程题11.3 找出最大公约数化简分数
#include <stdio.h>void reduce(int fenzi, int fenmu, int* _fenzi, int* _fenmu);int fractor(big, small){ int t = small; while ((big % t) != 0||(small % t)!=0) { t--; } return t;}int main(void){ int fenzi, fenmu; scanf("%d/%d", &fe.原创 2021-08-30 12:07:58 · 90 阅读 · 0 评论 -
CPAMA 编程题11.1 用指针计算不同面值的纸币应该使用几张
有20、10、5、1元,编写函数,使得函数形式如下:void qian(int dollars, int* twenties, int* tens, int* fives, int* ones);#include <stdio.h>void qian(int dollars, int* twenties, int* tens, int* fives, int* ones);int main(void){ int dollars; printf("enter the numb原创 2021-08-30 10:45:53 · 107 阅读 · 0 评论 -
CPAMA 指针在字符组长度未知情况下的应用
#include <stdio.h>void print(char* c){ int i = 0; while (c[i] != '\0') { printf("%c", c[i]); i++; } printf("\n");}int main(void){ char x[20] = "hello"; print(x); return 0;}实际上,c[i]是*(c+i)='xxxxx',c被赋予了传进的字符串第一个的地址。只要*(c+i)里的.原创 2021-08-29 16:41:20 · 85 阅读 · 0 评论 -
CPAMA 关于指针的一点注意
#include <stdio.h>int sumofit(int a[],int size){ int i, sum = 0; for (i = 0; i < size; i++) { sum += a[i]; } return sum;}int main(void){ int a[] = { 1,2,3,4,5 }; int size = sizeof(a) / sizeof(a[0]); int total = sumofit(a, size);.原创 2021-08-29 15:27:56 · 76 阅读 · 0 评论 -
CPAMA 指针的数组索引
#include <stdio.h>int main(void){ int a[] = { 1,2,3,4,5,6,7,8,9,10 }; int* p = a; printf("指针索引\naddress value\n"); for (int i = 0; i < 10; i++) { printf("%d %d\n", a + i,*(a+i)); } printf("数组索引\naddress value.原创 2021-08-29 14:28:39 · 107 阅读 · 0 评论 -
CPAMA随手练习 关于指针的几点说明
#include <stdio.h>int main(void){ int a = 9; int* p; p = &a; printf("value of a = %d\n", a); printf("address of a = %d\n", &a); printf("p是啥 = %d\n", p); printf("&p = %d\n", &p); printf("value of p = %d\n", *p); *p = 12; p.原创 2021-08-21 21:29:03 · 71 阅读 · 0 评论 -
CPAMA练习题 猜随机数
/*Ask user to guess a hidden number*/#include <stdio.h>#include <stdlib.h>#include <time.h>#define max_number 20/*external variable*/int secret_number;/*prototypes*/void initialize_number_generator(void);void choose_new_secre.原创 2021-08-20 11:35:02 · 75 阅读 · 0 评论 -
CPAMA编程题9.1 排序算法(基于右置最大值方法)
#include <stdio.h>#define n 10int split(int a[], int last);int selection_sort(int a[], int last);int main(void){ int a[n]; printf("enter %d numbers: ", n); for (int i = 0; i < n; i++) scanf("%d", &a[i]); selection_sort(a, n); .原创 2021-08-19 16:53:36 · 110 阅读 · 0 评论 -
CPAMA 练习题 快速排序法
#include <stdio.h>#define n 10void quicksort(int a[], int low, int high);int split(int a[], int low, int high);int main(void){ int a[n], i; printf("enter %d numbers to be sorted: ", n); for (int i = 0; i < n; i++) scanf("%d", &a[.原创 2021-08-19 16:51:17 · 76 阅读 · 0 评论 -
CPAMA练习题 斐波那契的递归实现(不建议)
#include <stdio.h>int fiber(n){ if (n <= 2) return 1; else return fiber(n - 1)+fiber(n-2);}int main(void){ for (int i = 1; i < 20; i++) printf("%d\n", fiber(i)); return 0;}原创 2021-08-16 20:11:40 · 53 阅读 · 0 评论 -
CPAMA练习题 判定整数是否为素数
#include <stdio.h>#include <stdbool.h>bool bool_check(int a) { for (int i = 2; i * i <= a; i++) { int k = a % i; if (k == 0) { return true; break; } } return false;}int main(void){ int h; printf("enter:"); scanf(.原创 2021-08-16 16:17:52 · 123 阅读 · 0 评论 -
CPAMA编程题8.7 读取一个5x5的整数数组,然后显示每行于每列的和
#include <stdio.h>int main(void){ int a[5][5]; int row_sum[5], col_sum[5]; for (int i = 0; i < 5; i++) { printf("enter row %d:", i+1); for (int j = 0; j < 5; j++) { scanf("%d", &a[i][j]); } printf("\n"); } for (int i .原创 2021-08-15 19:16:36 · 752 阅读 · 0 评论 -
CPAMA编程题8.1 输入一个数字显示有哪些重复
示例:enter a number:939577repeated numbers: 7 9#include <stdio.h>#include <stdbool.h>int main(void){ long n; printf("enter the number:"); scanf("%ld", &n); int a[10] = {0}; bool ck[10] = { false }; int digit; while (n >..原创 2021-08-15 17:44:09 · 87 阅读 · 0 评论