PTA
Nepenthe€
这个作者很懒,什么都没留下…
展开
-
2021-05-29 1002 A+B for Polynomials (25 分)
PAT_Advanced Level_10021002 A+B for Polynomials (25 分)#include<stdio.h>int main(void){ //hash int n, N; double a; int i = 0, j = 0, temp = 0, sum_n = 0; double N_i[1010] = {}; for(i = 0; i < 2; i++){ scanf("%d", &n); //n == k原创 2021-05-29 11:23:38 · 102 阅读 · 0 评论 -
PTA-链表学习-----奇数值结点链表
奇数值结点链表解法一struct ListNode *readlist(){ struct ListNode *head = NULL, *p; int data=0; while(scanf("%d", &data)&&data != -1) { struct ListNode *q = (struct ListNode *)malloc(sizeof(struct ListNode));//为节点分配存储空间 if(q!=NULL) { q原创 2020-12-03 15:48:25 · 1470 阅读 · 0 评论 -
PTA习题9.5-通讯录排序-------结构体传值,字符串和数字混合输入概念加深
PTA习题9.5-通讯录排序//6223/*3zhang 19850403 13912345678wang 19821020 +86-0571-88018448qian 19840619 13609876543*/#include<stdio.h> #include<stdlib.h>#include<string.h>struct tel_d {//telephone directory电话簿 char name[20]; long int原创 2020-11-19 18:26:01 · 578 阅读 · 0 评论 -
2020-12-22-PTA-弹球距离-递归
弹球距离解法一double dist(double h, double p) { double sum=h, rh, temp=0; rh = p * h; while(rh>TOL) { temp = 2 * rh; sum += temp; h = rh; rh = p * h; } return sum;}解法二double dist(double h, double p) { double rh = p * h; if(rh<TOL) {原创 2020-12-22 08:58:49 · 1170 阅读 · 0 评论