#include #include // rand() srand() system() #include #include // time() #include #include // toupper()和tolower() #include // 包含各数据类型能储存的极大极小值 FILE *fp; void delay(int t) { clock_t start_time = clock(); while (clock() < start_time + t*1000); } int main() { return 0; } /* node *head = NULL; int m, score; scanf("%d", &m); for (int i = 0; i < m; i++) { scanf("%d", &score); append(&head, score); } showAll(head); int a[10]; for (int i = 0; i < 10; i++) a[i] = i+1; leftRotate2(a, 3, 10); for (int i = 0; i < 10; i++) printf("%d\n", a[i]); typedef struct { int id; char name[20]; int score; } DATA; typedef struct Node { DATA data; struct Node *next; } node; node *init(int n) { if (n == 0) return NULL; node *head; node *temp = (node*)malloc(sizeof(node)); if (temp == NULL) { printf("init failed"); return NULL; } head = temp; temp->data.id = 0; temp->next = NULL; for (int i = 1; i < n; i++) { node *newNode = (node*)malloc(sizeof(node)); if (newNode == NULL) { printf("init failed"); return NULL; } newNode->data.id = i; newNode->next = NULL; temp->next = newNode; temp = newNode; } return head; } void showAll(node *head) { if (head == NULL) { printf("the list is empt. \n"); return; } node *temp = head; while (temp != NULL) { printf("%d ", temp->data.score); temp = temp->next; } puts("\n"); } void append(node **head, int score) { node *new = (node*)malloc(sizeof(node)); new->data.score = score; new->next = NULL; if (*head == NULL) { *head = new; return; } node *temp = *head; while (temp->next) { temp = temp->next; } temp->next = new; return; } void leftRotate(int a[], int d, int n) { int temp[d]; int i, j; for (i = 0; i < d; i++) temp[i] = a[i]; for (i = 0; i < n-d; i++) a[i] = a[i+d]; for (i = n-d, j = 0; i < n; i++, j++) { a[i] = temp[j]; } } void leftRotateByone (int a[], int n) { int temp, i; temp = a[0]; for (i = 0; i < n-1; i++) a[i] = a[i+1]; a[i] = temp; } void leftRotate2(int a[], int d, int n) { for (int i = 0; i < d; i++) { leftRotateByone(a, n); } } char word[][sizeof("爱")] = { {"我"}, {"爱"}, {"你"}, {"，"}, {"你"}, {"爱"}, {"我"}, {"吗"}, {"？"} }; for (int i = 0; i < (sizeof(word) / sizeof("爱") ); i++) { delay(520*2); printf("%s", word[i]); } char x[] = "abc"; char a[] = "秀"; char b[] = "天秀"; char c[] = "陈独秀"; char d[] = "蒂花之秀"; char e[] = "造化钟神秀"; printf("%d\n", sizeof(a)); // 4 printf("%d\n", sizeof(b)); // 7 printf("%d\n", sizeof(c)); // 10 printf("%d\n", sizeof(d)); // 13 printf("%d\n", sizeof(e)); // 16 printf("%c\n", x[2]); printf("%c", e[5]); putchar(b[4]); puts(b); puts("\n"); if(EOF) printf("yes\n"); fp = fopen("data.txt", "w"); fprintf(fp, "My name is Randy Patterson, and I’m currently looking for a job in youth services. I have 10 years of experience working with youth agencies. I have a bachelor’s degree in outdoor education. I raise money, train leaders, and organize units. I have raised over $100,000 each of the last six years. I consider myself a good public speaker, and I have a good sense of humor. “Who do you know who works with youth?"); fclose(fp); time_t t; srand(time(&t)); int rn; fp = fopen("data.txt", "r+"); //fseek(fp, 0, SEEK_SET); while (!feof(fp)) { fflush(stdout); printf("%c", fgetc(fp)); rn = rand() % 5 + 1; delay(70); } fclose(fp); for (int i = 0; i < 10; i++) { delay(1000); printf("%ld\n", clock()); } printf("\e[1;1H\e[2J"); system("color f3"); printf("hi"); getchar(); printf("\e[1;1H\e[2J"); system("cls"); printf("jack"); FILE *fp; typedef struct { char name[20]; int id; } student; fp = fopen("C:\\Users\\dell\\Desktop\\C\\test\\data.txt", "w"); if (fp == 0) { puts("error, file could not be open"); exit(1); } student class1[3]; for (int i = 0; i < 3; i++) { printf("input the name of the student\n"); gets(class1[i].name); printf("input the id of the student\n"); scanf("%d", &class1[i].id); getchar(); } for (int i = 0; i < 3; i++) { fprintf(fp, "%-5d %s\n", class1[i].id, class1[i].name); } fclose(fp); fp = fopen("C:\\Users\\dell\\Desktop\\C\\test\\data.txt", "a"); fprintf(fp, "666"); fclose(fp); char fline[50]; fp = fopen("C:\\Users\\dell\\Desktop\\C\\test\\data.txt", "r"); if (fp != 0) { while (!feof(fp)) { fgets(fline, 50, fp); if (!feof(fp)) { puts(fline); } } } else { puts("error openng file"); } fclose(fp); fp = fopen("C:\\Users\\dell\\Desktop\\C\\test\\data.txt", "w"); if (fp == 0) { ("error, file could not be open"); exit(1); } else { fprintf(fp, "123456789"); } fclose(fp); fp = fopen("C:\\Users\\dell\\Desktop\\C\\test\\data.txt", "r+"); fseek(fp, -1, SEEK_END); for (int i = 0; i < 9; i++) { printf("%c\n", fgetc(fp)); fseek(fp, -2, SEEK_CUR); } fclose(fp); char a[] = "abcdefg"; char b[6] = "12345"; printf("%c", a[1]); for(int i = 0; i < 5; i++) printf("%p ", a[i]); void sortedInsert(node **head, node *newNode) { if (*head == NULL) { *head = newNode; } else if (newNode->data.score < (*head)->data.score){ newNode->next = *head; *head = newNode; } else { node *p = *head; while (p->next) { if (p->data.score <= newNode->data.score && p->next->data.score <= newNode->data.score) { p = p->next; } else break; } if (p->next == NULL) { p->next = newNode; } else { newNode->next = p->next; p->next = newNode; } } } int newScore; scanf("%d", &newScore); node *newNode = (node*)malloc(sizeof(node)); newNode->data.score = newScore; newNode->next = NULL; showAll(head); sortedInsert(&head, newNode); node *sortedMerge(node *head1, node *head2) { if (head1 == NULL || head2 == NULL) { if (head1 == NULL && head2 == NULL)return NULL; if (head1 == NULL && head2 != NULL)return head2; else return head1; } node *newHead = (node*)malloc(sizeof(node)); node *p1 = head1; node *p2 = head2; node *p3 = newHead; while (p1 != NULL && p2 != NULL) { if (p1->data.score < p2->data.score) { p3->next = p1; p1 = p1->next; p3 = p3->next; } else if (p1->data.score > p2->data.score) { p3->next = p2; p2 = p2->next; p3 = p3->next; } else { p3->next = p1; p1 = p1->next; p3 = p3->next; p3->next = p2; p2 = p2->next; p3 = p3->next; } } if (p1 == NULL) { p3->next = p2; } else { p3->next = p1; } return newHead->next; } node *sortedMerge2(node *head1, node *head2) { if (head1 == NULL && head2 == NULL) { return NULL; } node *newHead = (node*)malloc(sizeof(node)); node *p3 = newHead; node *p1 = head1; node *p2 = head2; while (p1 && p2) { node *newNode = (node*)malloc(sizeof(node)); if (p1->data.score < p2->data.score) { newNode->data.score = p1->data.score; newNode->next = NULL; p1 = p1->next; p3->next = newNode; p3 = p3->next; } else if (p1->data.score > p2->data.score) { newNode->data.score = p2->data.score; newNode->next = NULL; p2 = p2->next; p3->next = newNode; p3 = p3->next; } else { node *newNode2 =(node*)malloc(sizeof(node)); newNode->data.score = p1->data.score; newNode->next = NULL; newNode2->data.score = p2->data.score; newNode2->next = NULL; p1 = p1->next; p2 = p2->next; p3->next = newNode; newNode->next = newNode2; newNode2->next = NULL; p3 = p3->next; } } if (p1 == NULL && p2 == NULL) { return newHead->next; } else if (p1 == NULL) { while (p2) { node *newNode = (node*)malloc(sizeof(node)); newNode->data.score = p2->data.score; newNode->next = NULL; p2 = p2->next; p3->next = newNode; p3 = p3->next; } } else { while (p1) { node *newNode = (node*)malloc(sizeof(node)); newNode->data.score = p1->data.score; newNode->next = NULL; p1 = p1->next; p3->next = newNode; p3 = p3->next; } } return newHead->next; } for (int j = 0; j < n; j++) { scanf("%d", &score); append(&head2, score); } node *head1 = NULL; node *head2 = NULL; node *newHead = NULL; newHead = sortedMerge2(head1, head2); showAll(head1); showAll(head2); showAll(newHead); while ( scanf("%d", &score) != EOF ) { append(&head1, score); } printf("%d", exponentialSearch(a, 100, 10) ); int min(int x, int y) { return x < y ? x : y; } int binarySearch(int *a, int left, int len, int x) { int right = len - 1; int mid; while (left <= right) { mid = (left + right) / 2; if (a[mid] < x) { left = mid + 1; } else if (a[mid] > x) { right = mid - 1; } else { return mid; } } return -1; } int exponentialSearch(int *a, int len, int x) { if (a[0] == x ) return 0; int i = 1; while (i < len && a[i] < x) { i *= 2; } return binarySearch(a, i/2, min(i, len), x); } int interpolationSearch(int *a, int len, int x) { int low = 0; int high = len - 1; while (low <= high && x >= a[low] && x <= a[high]) { if (low == high) { if (a[low] == x)return low; return -1; } int pos = low + (((double)(high-low) / (a[high]-a[low]))*(x - a[low])); if (a[pos] == x) { return pos; } else if (a[pos] < x) { low = pos + 1; } else { high = pos - 1; } } return -1; } int jumpSearch(int *a, int n, int x) { int step = sqrt(n); int prev = 0; while ( a[min(step, n) - 1] < x ) { prev = step; step += sqrt(n); if (prev >= n) return -1; } while (a[prev] < x) { prev++; if ( prev == min(step, n) ) return -1; } if (a[prev] == x) return prev; else return -1; } int binarySearch(int a[], int len, int x) { int low = 0; int high = len - 1; int mid; while (low <= high) { mid = (high + low) / 2; if (a[mid] < x) { low = mid + 1; } else if (a[mid] > x) { high = mid - 1; } else { return mid; } } return -1; } int binarySearch2(int *a, int left, int right, int x) { if (left <= right) { int mid = (left + right) / 2; if (a[mid] == x) { return mid; } else if (a[mid] > x) { return binarySearch2(a, left, mid - 1, x); } else { return binarySearch2(a, mid + 1, right, x); } } return -1; } int m, n, g = 0; long long s = 0; scanf("%d %d", &m, &n); for(int i = (int)pow(10, n-1); i < pow(10, n); i++) { for (int j = n - 1; j > 0; j--) { if (i / (int)pow(10, j) % 10 == m && i % m != 0) { g++; s += i; } } } printf("%d %lld", g, s); double i = 0; int iMax, y, A; do { scanf("%d %d", &iMax, &A); for (i = 0; i < iMax; i += 0.15) { y = sin(i) > 0? (int)(A*sin(i)): -(int)(A*sin(i)); printf("%*c \n", y, '>'); } } while (1); void *p = NULL; int i = 0; do { p = malloc(sizeof(1000000000)); i++; printf("%d\n", i); } while (p); printf("%d KB", i); void deleList(node **head) { if (*head == NULL) return; node *p1 = *head; node *p2 = p1->next; *head = NULL; int count = 1; while ( p1 != NULL && p2 != NULL ) { if (count++ % 2 != 0) { free(p1); p1 = p2->next; } else { free(p2); p2 = p1->next; } } free(p1); free(p2); } deleList(&head); int listLen(node *head) { int len = 0; while(head) { head = head->next; len++; } return len; } void printNthFromLast(node *head, int n) { node *temp = head; for (int i = 0; i < listLen(head) - n; i++) temp = temp->next; printf("%d ", temp->data.id); } void printNthFromLast2(node *head, int n) { node *temp1 = head; node *temp2 = head; if (n > listLen(head)) { printf("n wrong"); return; } while (n--) temp1 = temp1->next; while(temp1) { temp2 = temp2->next; temp1 = temp1->next; } printf("%d", temp2->data.id); } printf("%d\n", listLen(head)); printNthFromLast2(head, 99); int factorial(int n) { int fac = 1; for (int i = 2; i <= n; i++) { fac *= i; } return fac; } double compuC(int m, int n) { int up, down; if (n == 0) { return 1.0; } else { up = factorial(m); down = factorial(m-n) * factorial(n); } return (double)up / (double)down; } double sum = 0; for (int i = 0; i <= 3; i++) { sum += compuC(9, 3) * compuC(6, 3) / compuC(9, i) / compuC(3, 3-i) / compuC(9-i, 3); } printf("%.3f", sum); int index; do { scanf("%d", &index); node *head = init(10); printf("%d", getId(head, index)); } while(1); int getId(node *head, int index) { if (index < 0) { printf("index wrong\n"); return -1; } else { int i; node *temp = head; for (i = 0; i < index; i++) { if (temp == NULL) { break; } temp = temp->next; } if (i < index && temp == NULL) { printf("index wrong\n"); return -1; } return i; } } int x, y; do { scanf("%d %d", &x, &y); swapNode(&head, x, y); showAll(head); } while (x == -1); void swapNode(node **head, int x, int y) { node *preX = NULL; node *preY = NULL; node *tempX = *head; node *tempY = *head; node *aftY = NULL; while (tempX && tempX->data.id != x) { preX = tempX; tempX = tempX->next; } while (tempY && tempY->data.id != y) { preY = tempY; tempY = tempY->next; } if (tempX == NULL || tempY == NULL) { printf("no x or y in th list"); return; } else { if (preX) { preX->next = tempY; } else { *head = tempY; } if (preY) { preY->next = tempX; } else { *head = tempX; } aftY = tempY->next; tempY->next = tempX->next; tempX->next = aftY; } } int sum = 0; for (int i = 1; i <= 15; i++) { if (i < 10) { sum += i*10 + i; printf("%d+ ", i*10 + i); } else { sum += i*100 + i; printf("%d+ ", i*100 + i); } }u void deleteById(node **head, int item) { node *temp = *head; node *back = NULL; while (temp != NULL) { if ( temp->data.id == item ) { node *freeNode = temp; temp = temp->next; if (freeNode == *head) { (*head) = (*head)->next; } if (back) { back->next = temp; } free(freeNode); } else { back = temp; temp = temp->next; } } } void deleteByPosition(node **head, int position) { if (position < 0) { printf("position wrong "); } else if (position == 0) { node *temp = *head; *head = (*head)->next; free(temp); } else { node *temp = *head; for (int i = 1; i < position - 1; i++) { temp = temp->next; if (temp->next == NULL) { printf("position wrong "); return; } } node *freeNode = temp->next; temp->next = temp->next->next; free(freeNode); } } void push(node **head, int newId) { node *newNode = (node*)malloc(sizeof(node)); newNode->next = *head; newNode->data.id = newId; *head = newNode; } void append(node **head, int newId) { node *newNode = (node*)malloc(sizeof(node)); newNode->next = NULL; newNode->data.id = newId; if ( (*head)->next == NULL ) { (*head)->next = newNode; } else { node *temp = *head; while (temp->next != NULL) { temp = temp->next; } temp->next = newNode; } } int getCount(node *head) { int count = 0; node *temp = head; while (temp) { temp = temp->next; count ++; } return count; } int search(node *head, int x) { node *temp = head; while (temp) { if (temp->data.id == x) { return 1; } temp = temp->next; } return 0; } void swapNode(node **head, int x, int y) { node *tempX = *head; node *tempY = *head; node *preX = NULL; node *preY = NULL; node *aftY = NULL; node *aftX = NULL; while (tempX) { if (tempX->data.id == x) { break; } preX = tempX; tempX = tempX->next; } while (tempY) { if (tempY->data.id == y) { break; } preY = tempY; tempY = tempY->next; } if (tempX == NULL || tempY == NULL) { printf("no x or y in the linked list\n"); return; } aftY = tempY->next; aftX = tempX->next; if ( preX && preY ) { if (preY != tempX && preX != tempY) { preY->next = tempX; tempY->next = tempX->next; preX->next = tempY; tempX->next = aftY; } else if (preY == tempX) { tempX->next = aftY; tempY->next = tempX; preX->next = tempY; } else { preY->next = tempX; tempY->next = tempX->next; tempX->next = tempY; } } else if (tempX == *head) { if (preY == tempX) { tempX->next = tempY->next; tempY->next = tempX; *head = tempY; } else { tempY->next = tempX->next; tempX->next = aftY; preY->next = tempX; *head = tempY; } } else { if (preX == tempY) { tempY->next = tempX->next; tempX->next = tempY; *head = tempX; } else { tempX->next = tempY->next; tempY->next = aftX; preX->next = tempY; *head = tempX; } } } //deleteById(&head, 0); //push(&head, -1); //append(&head, 10); //deleteByPosition(&head, 12); //printf("%d \n", getCount(head)); //int a = search(head, 0); //printf("%d\n", a); int x, y; do { scanf("%d %d", &x, &y); node *head = init(10); swapNode(&head, x, y); showAll(head); } while (x == -1); int a = -1; for (int i = 0; i < 5; i++) printf("%d", a); void test1(int x) { int a = 1; if (x > 0) { int a = 0; } printf("%d ", a); } test(1); printf("%d ", i); node *temp = *head; if ((*head)->data.id == item) { *head = (*head)->next; free(temp); } else { while (temp->next != NULL) { if (temp->next->data.id == item) { node *temp2 = temp->next; temp->next = temp->next->next; free(temp2); break; } temp = temp->next; } } int number = 3; int *p1 = &number; int **p2 = &p1; printf("%d", *(*p2)); #define MAXSIZE 20 typedef struct { DATA student[MAXSIZE + 1]; int len; } seqList; void seqListInit(seqList *p) { p->len = 0; } int seqListLen(seqList *p) { return p->len; } int seqListAdd(seqList *p, DATA data) { if (p->len >= MAXSIZE) { printf("the list is fulled, can not add data"); return 0; } else { p->student[ ++(p->len) ] = data; return 1; } } void seqListInsert(seqList *p, DATA data, int n) { if (p->len >= MAXSIZE) { printf("the list is fulled, can not add data"); } else if (n < 1 || n > p->len) { printf("n is wrong"); } else { for (int i = (p->len) + 1; i > n; i--) { p->student[i] = p->student[i - 1]; } p->student[n] = data; (p->len)++; } } void seqListDelete(seqList *p, int n) { if (n < 1 || n > p->len) { printf("n is wrong"); } else { for (int i = n; i < p->len; i++) { p->student[i] = p->student[i + 1]; } (p->len)--; } } DATA *seqListFindByN(seqList *p, int n) { if (n < 1 || n > p->len) { return NULL; } else { return &(p->student[n]); } } int seqListFindById(seqList *p, int id) { for (int i = 1; i < p->len; i++) { if (p->student[i].id == id) { return i; } } return 0; } void seqListAll(seqList *p) { for (int i = 1; i <= p->len; i++) { printf("\n\n\n %-3d %-8s %d \n", p->student[i].id, p->student[i].name, p->student[i].score); } } seqList class_1; DATA data; seqListInit(&class_1); do { scanf("%d %s %d", &data.id, &data.name, &data.score); if (data.id) { if (!seqListAdd(&class_1, data)) { break; } } else { break; } } while (1); DATA *p = seqListFindByN(&class_1, 2); printf("%s", p->name); printf(" %d", seqListFindById(&class_1, 2) ); seqListAll(&class_1); scanf("%d %s %d", &data.id, &data.name, &data.score); seqListInsert(&class_1, data, 2); seqListAll(&class_1); seqListDelete(&class_1, 2); seqListAll(&class_1); typedef struct { int num; } node; node a; a.num = 0; node *p = &a; printf("%d ", a.num); printf("%d ", ++p->num); int isPrime(int n) { if (n <= 1) { return 0; } else { for (int i = 2; i < n; i++) { if (n % i == 0) { return 0; } } return n; } } void f(int n) { int i, j, flag = 0; for (i = 2; i < n; i++) { for (j = 2; j < n; j++) { if (i * j == n) { flag = 1; break; } } if (flag == 1) { break; } } if ( isPrime(i) ) { printf("%d ", i); } else { f(i); } if ( isPrime(j) ) { printf("%d ", j); } else { f(j); } } f(98); for (int i = 7; ; i += 7) { if (i % 2 == 1 && i % 3 == 2 && i % 5 == 4 && i % 6 == 5) { printf("%d", i); break; } } int primeSum(int m) { int sum = 0; for (int i = 1; i < m; i++) { sum += isPrime(i); printf("%d\n", isPrime(i) ); } return sum; } printf("%d", primeSum(20) ); for (int i = 1; i < 30; i++) { printf("%d \n", isPrime(i) ); } printf("%d %d %d", 1 % 1, 1 % 2, 1 % 3); int toBinary(int n) { if (n == 0) { return 0; } else { toBinary(n / 2); printf("%d %d \n", n % 2, n); } } int n; scanf("%d", &n); toBinary(n); int i = 1; int a = i / 0; printf("%d", a); printf("%d", i); void swap(int *a, int *b) { int t = *a; *a = *b; *b = t; } void ssort(int a[], int len) { int i, j, minIndex; for (i = 0; i < len - 1; i++) { minIndex = i; for (j = i + 1; j < len; j++) { if (a[j] < a[minIndex]) { minIndex = j; } } if (i != minIndex) { swap(&a[i], &a[minIndex]); } } } int i, a[10]; for (i = 0; i < 10; i++) { scanf("%d", &a[i]); } ssort(a, 10); for (i = 0; i < 10; i++) { printf("%d ", a[i]); } int binary_search(int a[], int len, int item) { int low, mid, high; low = 0; high = len -1; while (low <= high) { mid = (low + high) / 2; if (a[mid] == item) { return mid; } else if (a[mid] > item) { high = mid - 1; } else { low = mid + 1; } } return -1; } int item, a[1024] = {0}; for (int i = 0; i < 1024; i++) { a[i] = i; } scanf("%d", &item); printf("%d ", binary_search(a, 1024, item) ); void swap(int *x, int *y) { int t = *x; *x = *y; *y = t; } void ssort(int a[], int len) { int i, j, minIndex; for (i = 0; i < len - 1; i++) { minIndex = i; for (j = i + 1; j < len; j++) { if (a[j] < a[minIndex]) { minIndex = j; } swap(&a[minIndex], &a[i]); } } } int a[10]; for (int i = 0; i < 10; i++) { scanf("%d", &a[i]); } ssort(a, 10); for (int i = 0; i < 10; i++) { printf("%d", a[i]); } int binarySearch(int a[], int len, int x) { int low, mid, high; low = 0; high = len - 1; while (low <= high) { mid = (low + high) / 2; if (a[mid] == x) { return mid; } else if (a[mid] < x) { low = mid + 1; } else if (a[mid] > x) { high = mid - 1; } } return -1; } int i, x, a[1024]; for (i = 0; i < 1024; i++) { a[i] = i; } scanf("%d", &x); printf("%d", binarySearch(a, 1024, x)); int a, b; printf("a: %d \nb: %d\n", &a, &b); a = (double)a; printf("a: %d \nb: %d\n", &a, &b); int f (long a, long b, int n) { long c; printf("%d\n%d\n", a, b); while (n-- > 2) { c = a + b; printf("%d %f\n", c, (float)a / (float)b); a = b; b = c; } } long a, b; int n; scanf("%d %d %d", &a, &b, &n); f (a, b, n); int f (int n) { printf("%d \n", n); if (n == 1) { return 1; } return n * f(n - 1); } int n; scanf("%d", &n); printf("%d", f(n)); typedef node { int number; struct Node *next; } node; node *create(int n) { node *head; node *temp = (node*)malloc(sizeof(node)); if ( !temp ) { printf("memory is not enough"); exit(0); } head = temp; temp->number = 0; temp->next = NULL; for (int i = 1; i < n; i++) { node *a = (node*)malloc(sizeof(node)); if ( !a ) { printf("memory is not enough"); exit(0); } a->number = i; a->next = NULL; temp->next = a; temp = a; } return head; } void display(node *head) { node *temp = (node*)malloc(sizeof(node)); temp = head; do { printf("%d ", temp->number); temp = temp->next; } while (temp != NULL); } node *insert(node *head, int number, int index) { int i = 0; node *temp = head; node *new = (node*)malloc(sizeof(node)); new->number = number; if (index == -1) { new->next = head; head = new; return head; } else { while (i++ < index) { temp = temp->next; if (temp == NULL) { printf("index error"); exit(0); } } new->next = temp->next; temp->next = new; } return head; } node *del(node *head, int index) { int i = 0; node *temp = head; node *deleted = NULL; if (index == -1) { head = head->next; free(temp); return head; } while (i++ < index) { temp = temp->next; if (temp == NULL) { printf("index error"); exit(0); } } deleted = temp->next; if (deleted == NULL) { printf("index error"); exit(0); } else { temp->next = deleted->next; free(deleted); } return head; } int search(node *head, int x) { int index = 0; node *temp = head; while (temp != NULL) { if (temp->number == x) { return index; } else { temp = temp->next; index++; } } return -1; } node *update(node *head, int index, int value) { int i= 0; if (index < 0) { printf("update failed, wrong index or the number is not int the list \n"); return head; } node *temp = head; while (i++ < index) { temp = temp->next; if (temp == NULL) { printf("index error"); exit(0); } } temp->number = value; return head; } node *head = create(10); head = update(head, search(head, 0), 666); head = update(head, 16, 666); printf("%d ", search(head, 5) ); head = del(head, 9); head = insert(head, 666, 19); display(head); int i, j, x, a[10]; for (i = 0; i < 10; i++) { scanf("%d", &a[i]); } scanf("%d", &x); for (i = 0; i < 10; i++) { if (a[i] == x) { if (i == 9) { a[9] = 0; break; } else { for ( j = i; j < 9; j++) { a[j] = a[j+1]; } a[j] = 0; } break; } } if (i == 10) { printf("none"); } else { for (j = 0; j < 9; j++) { printf("%d ", a[j]); } } #define N 10 typedef struct { int *head; int len; int size; } table; table createTable() { table t; t.head = (int*)malloc(N*sizeof(int)); if ( !t.head ) { printf("malloc failed"); exit(0); } t.len = 0; t.size = N; return t; } void displayTable(table t) { for (int i = 0; i < t.len; i++) { printf("%d ", t.head[i]); } } int search(table t, int x) { int ret = -1; for (int i = 0; i < t.len; i++) { if (t.head[i] == x) { ret = i; } } return ret; } table change(table t, int x, int y) { int index = search(t, x); t.head[index] = y; return t; } table insert(table t, int x, int index) { if (t.len <= index || index < 0) { printf("index error"); return t; } if (t.len == t.size) { t.head = (int*)realloc( t.head, (t.size+1)*sizeof(int) ); if ( !t.head ) { printf("realloc failed"); return t; } t.size++; } for (int i = t.len; i > index; i--) { t.head[i] = t.head[i-1]; } t.head[index] = x; t.len++; return t; } table del(table t, int index) { if (t.len-1 < index || index < 0) { printf("index error"); return t; } for (int i = index; i < t.len-1; i++) { t.head[i] = t.head[i+1]; } t.len--; return t; } table t = createTable(); for(int i = 0; i < 6; i++) { t.head[i] = i; t.len++; } table t1, t2, t3; t1 = insert(t, 666, 0); displayTable(t1); printf("\n"); t2 = del(t1, 2); displayTable(t2); printf("\n"); printf("%d %d \n",search(t2, 666), search(t2, 9) ); t3 = change(t2, 4, 555); displayTable(t3); #define Size 5 typedef struct { int *head; int length; int size; } table; table iniTable() { table t; t.head = (int*)malloc(Size*sizeof(int)); if (!t.head) { printf("malloc error"); exit(0); } t.length = 0; t.size = 0; return t; } void displayTable(table t) { for (int i = 0; i < t.length; i++) { printf("%d ", t.head[i]); } } table t = iniTable(); for (int i = 0; i < Size; i++) { t.head[i] = i + 1; t.length++; } displayTable(t); int i, n; scanf("%d", &n); int a[n]; for (i = 0; i < n; i++) { a[i] = 0; } void bbs1(int a[], int n) { int i, j, t; for (i = 0; i < n - 1; i++) { for (j = 0; j < n - i - 1; j++) { if (a[j] > a[j+1]) { t = a[j]; a[j] = a[j+1]; a[j+1] = t; } } } } for (i = 0; i < n; i++) { scanf("%d", &a[i]); } bbs1(a, n); for (i = 0; i < n; i++) { printf("%d ", a[i]); } int i, j, t, a[6] = {0}; for(i = 1; i <= 5; i++){ scanf("%d", &t); a[t]++; } for(i = 1; i <= 5; i++){ for(j = 1; j <= a[i]; j++){ printf("%d", i); } } #define sqr_(x) ( (x) * (x) ) // 计算x平方的函数式宏 #define swap(type, a, b) (type t = a; type a = b; type b = a;) #define loop1 for(int i = 0; i < x ; i++) #define loop2 for(int j = 0; j < y ; j++) enum animal { Dog, Cat, Monket, Invalid }; // Dog = 0, Cat = 1 ... enum week { Monday = 1, Tuesday, Wedesday, Thursday, Friday, Saturday, Sunday, Invalid }; //表示学生的结构体 typedef struct student { char name[20]; int height; int weight; } Student; printf("Hello World"); printf("%d\n", 15 + 37); printf("%d\n", 15 - 37); printf("15+37=%d \n", 15 + 37); printf("15-37=%d \n", 15 - 37); int x; printf("%d", x); int n; printf("Input a number\n"); scanf("%d", &n); printf("The number is %d\n", n); puts("string"); puts("next string"); int x = 10, y = 5; printf("%d %% %d = %d", x, y, x % y); int x, y; scanf("%d%d", &x, &y); printf("%d*%d=%d", x, y, x * y); double x; scanf("%lf", &x); printf("%f", x); int a, b, c, d, e; scanf("%d%d%d%d%d", &a, &b, &c, &d, &e); printf("%f", ( a + b + c + d + e) / 5.0); int a = 1; printf("%d \n", sizeof(a)); // 4 printf("%d \n", sizeof( (double)(a) )); // 8 puts("12345"); // 12345 printf("%5d \n", a); // ____1 printf("%05d \n", a); // 00001 printf("%.5d \n", a); // 00001 printf("%.2f \n", (double)a ); // 1.00 printf("%5.2f \n",(double)a ); // _1.00 printf("%2.2f \n",(double)a ); // 1.00 printf("%-2d%d \n", a, a); // 1_1 int a, b, c; char jay[] = "Jay"; char lily[] = "Lily"; char nancy[] = "Nancy"; scanf("%d %d %d\n", &a, &b, &c); puts("Score\n"); printf("%-5s:%d\n",jay, a); printf("%-5s:%d\n",lily, b); printf("%-5s:%d\n",nancy, c); int n; printf("Input a interger: \n"); scanf("%d", &n); if(n % 2) { puts("It's odd"); }else{ puts("It's even"); } int a, b, c; scanf("%d %d %d", &a, &b, &c); if ( a >= b && a >= c) { printf("Max: %d", a); } else if ( b >= c) { printf("Max: %d", b); } else { printf("Max: %d", c); } int a, b, sum = 0; scanf("%d %d", &a, &b); do { sum += a; a++; } while ( a <= b ); printf("%d", sum); int i, j, n = 1; for (i = 0; i<10; i++) { for (j = 0; j < 10; j++, n++) { printf("%-3d", n); } printf("\n"); } int i, j; for (i = 0; i < 5; i++) { for (j = 0; j <= i; j++) { printf("*"); } printf("\n"); } int i, j, len; scanf("%d", &len); for (i = 0; i < len; i++) { for (j = 0; j < (len - i - 1); j++ ) { putchar(' '); } for (j = 0; j <= i; j++) { putchar('*'); } putchar('\n'); } int xtable() { int i, j; printf(" |"); for (i = 1; i <= 9; i++) { printf("%3d", i); } putchar('\n'); for (i = 1; i <= 10; i++) { printf("---"); } putchar('\n'); for (i = 1; i <= 9; i++) { for (j = 0; j <= 9; j++) { if (j == 0) { printf("%d |", i); } else { printf("%3d", i * j); } } printf("\n"); } } xtable(); xtable(); int i, j, len; len = 5; for (i = 0; i < len; i++) { for (j = 0; j < i; j++) { putchar(' '); } for (j = 0; j < len - i; j++) { putchar('*'); } putchar('\n'); } int i, j, len = 5; for (i = 0; i < len; i++) { for (j = 0; j < len - i - 1; j++) { putchar(' '); } for (j = 0; j < i + 1; j++) { putchar('*'); } putchar('\n'); } int i, j, len = 7; for (i = 1; i <= len; i++) { for (j = 0; j < len-i; j++) { putchar(' '); } for (j = 1; j <= (i-1)*2+1; j++) { putchar('*'); } putchar('\n'); } for (i = 1; i <= len; i++) { for (j = 1; j < i; j++) { putchar(' '); } for (j = 1; j <= 1+(len-i)*2; j++) { printf("%d", len-i+1); } putchar('\n'); } int a[100], b[100]; for (i = 0; i < 100; i++) { a[i] = i + 1; } for (i = 0; i <100; i++) { b[i] = a[i]; } puts(" a b "); puts("--------"); for (i = 0; i < 100; i++) { printf("%4d%4d \n", a[i], b[i]); } int i, a[7]; for (i = 0; i < 7; i++) { scanf("%d", &a[i]); } for (i = 0; i < 3; i++) { int temp = a[i]; a[i] = a[6 - i]; a[6 - i] = temp; } for (i = 0; i < 7; i++) { printf("%d \n", a[i]); } int i, a[5], max = 0; for (i = 0; i < 5; i++) { scanf("%d", &a[i]); } for (i = 0; i < 5; i++) { if ( a[i] >= max ) { max = a[i]; } } printf("%d", max); int i, a[2][3] = { {66, 67, 68}, {77, 78, 79} }; double sum1 = 0, sum2 = 0; for (i = 0; i <3; i++) { sum1 += a[0][i]; } for (i = 0; i < 3; i++) { sum2 += a[1][i]; } printf("%.2f\n%.2f\n", sum1 / 3, sum2 / 3 ); //求矩阵a和矩阵b的乘积c,设矩阵a为m乘n矩阵,矩阵b为x乘y矩阵 int i, j, k, m, n, x, y; //输入矩阵a和矩阵b的行数和列数 scanf("%d %d %d %d", &m, &n, &x, &y); int a[m][n]; int b[x][y]; int c[m][y]; //输入矩阵a的数值 for (i = 0; i < m; i++) { for (j = 0; j < n; j++) { scanf("%d", &a[i][j]); } } //输入矩阵b的数值 for (i = 0; i < x; i++) { for (j = 0; j < y; j++) { scanf("%d ", &b[i][j]); } } //初始化c矩阵数值为0 for (i = 0; i < m; i++) { for (j = 0; j < y; j++) { c[i][j] = 0; } } //计算a,b矩阵的积 for (i = 0; i < m; i++) { for(j = 0; j < y; j++) { for (k = 0; k < n; k++) { c[i][j] += a[i][k] * b[k][j]; } } } //打印出结果 for (i = 0; i < m; i++) { for (j = 0; j < y; j++) { printf("%3d ", c[i][j]); } putchar('\n'); } int i, j, m = 0, n = 0, x[6] = {0}, score[6][2]; for (i = 0; i < 6; i++) { for (j = 0; j < 2; j++) { scanf("%d", &score[i][j]); x[i] += score[i][j]; } m += score[i][0]; n += score[i][1]; } for (i = 0; i < 6; i++) { printf("x%d:%d \n", i, x[i]); } printf("m: %d \n", m); printf("n: %d \n", n); int min(int a, int b, int c) { int min = a; if (b < min) min = b; if (c < min) min = c; return min; } int x, y, z; scanf("%d %d %d", &x, &y, &z); printf("%d", min(x, y, z)); int sqr(int x) { return x * x; } int diff(int a, int b) { return a > b ? a - b : b - a; } int m, n; scanf("%d%d", &m, &n); printf("%d \n", diff( sqr(m), sqr(n)) ); double power(double x, int a) { double temp = 1; for (int i = 0; i < a; i++) { temp *= x; } return temp; } double m; int n; scanf("%lf %d", &m, &n); printf("%.2f", power(m, n) ); int sum(int a[], int n) { int temp = 0; while (n-- > 0) { temp += a[n]; } return temp; } int x, k; scanf("%d", &x); k = x; int array[x]; while (x-- > 0) { scanf("%d", &array[x]); } printf("%d \n", sum(array, k) ); //输出 array[x]的所有元素 for (int i = 0; i < 3; i++) { printf("%d \n", array[i]); } //定义逆序数组元素的函数 void invert(int a[], int n) { int i, temp; if (n % 2 == 1) { for (i = 0; i < (n-1)/2; i++) { temp = a[i]; a[i] = a[n-i-1]; a[n-i-1] = temp; } } else { for (i = 0; i < n/2; i++) { temp = a[i]; a[i] = a[n-i-1]; a[n-i-1] = temp; } } } int i,x; scanf("%d", &x); int array[x]; for (i = 0; i < x; i++) { scanf("%d", &array[i]); } invert(array, x); for (i = 0; i < x; i++) { printf("%d \n", array[i]); } //定义查找数组array[x]中有无关键数字k的函数 void find(const int a[], int n, int k) { int i, flag = 0; for (i = 0; i < n; i++) { if (a[i] == k) { flag = 1; } } if (flag) { printf("found"); } else { printf("none"); } } int i, x, k; scanf("%d %d", &x, &k); int array[x]; for (i = 0; i < x; i++) { scanf("%d", &array[i]); } find(array, x, k); int find(int a[], int n, int k) { int i; a[n] = k; for (i = 0; a[i]!= k; i++){ ; } return i < n ? i : -1; } int i, n, k; if ( find(array, n, k) == -1 ) { puts("none"); } else { printf("a[%d]=%d", find(array, n, k), k); } scanf("%d %d", &n, &k); int array[n]; for (i = 0; i < n; i++) { scanf("%d", &array[i]); } //将n行3列的二维数组的值赋值为x void fill(int a[][3], int n, int x) { int i, j; for (i = 0; i < n; i++) { for (j = 0; j < 3; j++) { a[i][j] = x; } } } int i, j, n, x; scanf("%d %d", &n, &x); int a[n][3]; for (i = 0; i < n; i++) { for (j = 0; j < 3; j++) { a[i][j] = 0; } } fill(a, n, x); for (i = 0; i < n; i++) { for (j = 0; j < 3; j++) { printf("%d ", a[i][j]); } putchar('\n'); } void test() { static int i; // i被赋予了静态储存期，i自动初始化为0，寿命长 int j = 0; // j被赋予了动态储存期，寿命短 printf("%d %d\n", i++, j++); } test(); test(); test(); void test() { static int i; static double a[10]; printf("%.2f \n", a[i]); i++; } static i; for (; i <10; i++) { test(); } printf("%d \n", INT_MAX); // 2147483647 printf("%d \n", CHAR_MIN); // -128 printf("%d \n", CHAR_BIT); // 8 printf("%d %f \n", sqr_(2), sqr_(2.0) ); // sqr_(2)被替换成了( (2) * (2) ) int a; a = 1, 2, 3; printf("%d \n", a); // 1 a = (1, 2, 3); printf("%d \n", a); // 3 void bsort(int a[], int n) { int i, j, temp; for(i = 0; i < n - 1; i++) { for (j = n - 1; j > i; j--) { if (a[j - 1] > a[j]) { temp = a[j - 1]; a[j - 1] = a[j]; a[j] = temp; } } } } int i, n; scanf("%d", &n); int a[n]; for (i = 0; i < n; i++) { scanf("%d", &a[i]); } bsort(a, n); for (i = 0; i < n; i++) { printf("%d \n", a[i]); } enum animal select() { int temp; printf("0 dog \n1 cat\n2 monkey\n3 stop"); scanf("%d", &temp); return temp; } void dog() { puts("bark"); } void cat() { puts("meow"); } void monkey() { puts("awuuu"); } enum animal selected; do { switch( selected = select() ) { case Dog: dog(); break; case Cat: cat(); break; case Monkey: monkey(); break; default: puts("wrong"); } } while (selected != Invalid); int i, j, n, temp, a[] = {5, 4, 3, 2, 1}; n = sizeof(a) / sizeof(int); for (i = 0; i < n - 1; i++) { for (j = 0; j < n - 1 - i; j++) { if (a[j] > a[j + 1]) { temp = a[j]; a[j] = a[j + 1]; a[j + 1] = temp; } } } void bsort(int a[], int n) { int i, j, temp; for (i = 0; i < n - 1; i++) { for (j = 0; j < n - 1 - i; j++) { if ( a[j] > a[j + 1] ) { temp = a[j]; a[j] = a[j + 1]; a[j + 1] = temp; } } } } int i, x; scanf("%d", &x); int a[x]; for (i = 0; i < x; i++) { scanf("%d", &a[i]); } bsort(a, x); for (i = 0; i < x; i++) { printf("%d \n", a[i]); } void mon() { puts("Happy Monday! \n"); } void tue() { puts("Happy Tuesday! \n"); } void wed() { puts("Happy Wedesday! \n"); } void thu() { puts("Happy Thursday! \n"); } void fri() { puts("Happy Friday! \n"); } void sat() { puts("Happy Saturday! \n"); } void sun() { puts("Happy Sunday! \n"); } enum week selected; int select() { int day; printf("Input a number: \n1.Monday \n2.Tuesday \n3.Wedesday \n4.Thursday \n5.Friday \n6.Saturday \n7.Sunday \n8.Finish \n"); scanf("%d", &day); return day; } do { switch (selected = select()) { case 1: mon(); break; case 2: tue(); break; case 3: wed(); break; case 4: thu(); break; case 5: fri(); break; case 6: sat(); break; case 7: sun(); break; } } while (selected != Invalid); int a = 1, b = 2; swap(int, a, b) printf("%d %d \n", a, b); //计算收到的无符号整数中有多少个值为1的二进制位 int count_bits(unsigned x) { int bits = 0; while (x) { if (x & 1U) { // 1U为unsigned型的1 bits++; } x >>= 1; } printf("%d", bits); } unsigned n; scanf("%d", &n); count_bits(n); printf("%x \n", 15); // f printf("%d \n", sizeof(float)); printf("%d \n", sizeof(double)); printf("%d \n", sizeof(long double)); printf("%lf \n", pow(2, sizeof( long double) * 8 ) ); float x; for (x= 0; x <= 1.0; x += 0.01) printf("%f \n", x); for (int i = 0; i <= 100; i++) { x = i / 100.0; printf("%f \n", x); } int factorial(x) { int sum = 1; for (; 0 < x; x--) { sum *= x; } return sum; } int x; scanf("%d", &x); printf("%d \n", factorial(x)); //辗转相除法求两个数的最大公约数 int gcd(int x, int y) { int r = 1, temp; if ( x < y) { temp = x; x = y; y = temp; } while (r != 0) { r = x % y; x = y; y = x; } return x; } int a, b; scanf("%d %d", &a, &b); printf("%d", gcd(a, b)); int i, ch, num[10] = {0}; while ( ( ch = getchar() ) != EOF) { switch (ch) { case '0': num[0]++; break; case '1': num[1]++; break; case '2': num[2]++; break; case '3': num[3]++; break; case '4': num[4]++; break; case '5': num[5]++; break; case '6': num[6]++; break; case '7': num[7]++; break; case '8': num[8]++; break; case '9': num[9]++; break; } } for (i = 0; i < 10; i++) { printf("%d: %d \n", i, num[i]); } char str1[] = "abc\0def"; char str2[] = "jay chou"; printf("%s %s \n", str1, str2); // abc jay chou char name[3][20] = {"jack chen", "jony lulu", "pika bula"}; for(int i = 0; i < 3; i++) printf("%s \n", name[i]); int a[3][3]; for (int i =0; i < 3; i++) { for (int j = 0; j < 3; j++) { scanf("%d", &a[i][j]); } } for(int i = 0; i < 3; i++) printf("%s \n", a[i]); // wrong int str_len(const char str[]) { int len = 0; while ( str[len] ) { len++; } return len; } char str[] = "abc"; printf("%d \n", str_len(str) ); // 3 printf("%c \n", str[0]); // a printf("%c%c", str[3], str[0]); // a printf("%d \n", str[3]); // 0 //返回字符串s中某字符的下标 int return_index_of_x(const char s[], char x) { int i = 0; while (s[i]) { if (s[i] == x) { return i; } i++; } if (i >= str_len(s)) return -1; } char str[] = "abcd"; printf("%d \n", return_index_of_x(str, 'a') ); // 1 void rev_str(const char s[]) { int i = str_len(s); for (; i >= 0; i--) { putchar(s[i]); } } char str[] = "12345"; rev_str(str); int array[3][3] = { {1, 2, 3}, {4 , 5, 6}, {7, 8, 9} }; int x = 3; int y = 3; loop1 { loop2 { printf("%d ", array[i][j]); } putchar('\n'); } void str_upper(char s[]) { int i = 0; while (s[i]) { s[i] = toupper(s[i]); i++; } } void str_lower(char s[]) { int i = 0; while (s[i]) { s[i] = tolower(s[i]); i++; } } char str[20]; scanf("%s", str); str_upper(str); printf("%s \n", str); str_lower(str); printf("%s \n", str); //删除字符串S中的全部数字 void del_digit(char s[]) { int i = 0, j = 0; char temp[100]; while (s[i]) { if (s[i] < '0' || s[i] > '9') { temp[j++] = s[i]; } i++; } for (i = 0; i < j; i++) { s[i] = temp[i]; } s[j] = '\0'; } char s[] = "abc123d4ef66g"; del_digit(s); printf("%s \n", s); char a[3] = {'a', 'b', 'c'}; char b[4] = {'a', 'b', 'c'}; printf("%s \n", a); // abc`[ printf("%s \n", b); // abc puts(a); // abc`[ puts(b); // abc int x, y, a[3] = {1, 2, 3}, *p; printf("%d %d %d %d %d \n", &x, &y, &a[0], &a[1], &a[2]); p = &a[0]; *p = 666; *(p + 1) = 555; printf("%d %d \n", a[0], a[1]); // 666 555 printf("%d \n", p + 1); // 这里p+1实际为p+sizeof(int) void test(double r, double *s, double *l) { *s = r * r * 3.1415; *l = 2 * r * 3.1415; } double r, s, l; scanf("%lf", &r); test(r, &s, &l); printf("s=%.2f \nl=%.2f \n", s, l); void sort3(int *a, int *b, int *c) { int temp; if (*a > *b) { temp = *a; *a = *b; *b = temp; } if (*b > *c) { temp = *b; *b = *c; *c = temp; } if (*a > *b) { temp = *a; *a = *b; *b = temp; } } int a, b, c; scanf("%d %d %d", &a, &b, &c); sort3(&a, &b, &c); printf("%d %d %d \n", a, b, c); int a[3] = {1, 2, 3,}; printf("%d %d %d", *a, *(a+1), *(a+2)); // 1 2 3 void set_idx(int *p, int n) { for(; n >= 0; n--) { *(p + n - 1) = n - 1; } } int a[6]; set_idx(a, 6); for(int i = 0; i < 6; i++) { printf("%d \n", a[i]); } char *p = "123"; printf("%d \n", p); // 4210688 printf("%s \n", p); // 123 p = "456"; printf("%d \n", p); // 4210702 printf("%s \n", 4210688); //123 // "123"仍占着内存 p = "456"; printf("%d \n", p); // 4210702 p = "456" + 1; printf("%d \n", p); // 4210703 printf("%s \n", p); // 56 printf("%d \n", sizeof(char)); // 1 int str_len(char *s) { int len = 0; while (*s) { s++; len++; } return len; } char s[100]; scanf("%s", s); printf("%d \n", str_len(s)); //复制字符串的返回指针的函数 char *str_copy(char *a, char *b) { char *temp = a; while (*a++ = *b++); return temp; } char b[10] = "abcde"; char a[10]; printf("%s \n", str_copy(a, b)); printf("%d \n", sizeof(a)); void put_str(const char *s) { while (*s) { putchar(*s++); } } char s[] = "12345"; put_str(s); // 返回字符串S中某字符出现的次数 int test(const char *s, char x) { int count = 0; while (*s) { if (*s++ == x) count++; } return count; } int s = "3.1415926535"; printf("%d \n", test(s, '5')); // 3 // 若字符串s中有字符x（以先出现的为准），则返回指向该字符的指针 char *test(const char *s, char x) { char *temp = NULL; while (*s) { if (*s == x) { temp = s; break; } s++; } return temp; } char s[] = "3.1415926535"; printf("%s \n", (s + 3)); // 415926535 printf("%s \n", test(s, '4')); // 415926535 printf("%d \n", test(s, '4')); // 2358846 printf("%s \n", 2358846); // 415926535 // 删除字符串中的数字 void del_digits(char s[]) { int i = 0, j = 0; while(s[i]) { if ( s[i] >= '0' && s[i] <= '9') { i++; } else { s[j++] = s[i++]; } } s[j] = '\0'; } char s[] = "Python3Java12"; del_digits(s); printf("%s \n", s); char a[] = "I love "; char b[] = "You."; printf("%s \n", strcat(a, b)); struct people { char name[20]; int height; float weight; }; struct people chopin = { "Chopin", 175, 60.0 }; printf("%s \n", chopin.name); printf("%d \n", chopin.height); printf("%f \n", chopin.weight); typedef struct student{ // struct student是类型名 char name[20]; int height; float weight; } Student; // 这里的Student可用作类型名，这么用时上方的student可省略 Student lucy = { "Lucy", 166, 50 }; printf("%d \n", lucy.height); // 交换两个结构体的值 void swap_student(Student *a, Student *b) { Student temp = *a; *a = *b; *b = temp; } // 按身高排列结构体 void sort_by_height(Student a[]) { int i, j; for(i=0; i < 4; i++) { for (j = 0; j < 5 - i - 1; j++) { if ( a[j].height > a[j+1].height ) { swap_student( &a[j], &a[j+1] ); } } } } // 按名字排序排列结构体 void sort_by_name(Student a[]) { int i, j; for(i=0; i < 4; i++) { for (j = 0; j < 5 - i - 1; j++) { if ( strcmp( a[j].name, a[j+1].name ) > 0 ) { swap_student( &a[j], &a[j+1] ); } } } } // 给五个结构体赋值 Student std[] = { { "Jack", 177, 66 }, { "Nancy", 170, 55 }, { "Miya", 165, 54 }, { "Quincy", 173, 70 }, { "Lisa", 167, 50 }, }; int i; // 打印出原来的5个结构体 for(i = 0; i < 5; i++) { printf("%-7s %d %d \n", std[i].name, std[i].height, std[i].weight ); } putchar('\n'); sort_by_height( std ); // 打印按身高排序后的五个结构体 for(i = 0; i < 5; i++) { printf("%-7s %d %d \n", std[i].name, std[i].height, std[i].weight ); } putchar('\n'); sort_by_name( std ); // 打印按名字排序后的五个结构体 for(i = 0; i < 5; i++) { printf("%-7s %d %d \n", std[i].name, std[i].height, std[i].weight ); } double avg = 0; for(int i = 0; i < 100000; i ++) { avg += rand(); } printf("%.0f \n", (avg / 100000) * 2); printf("%d \n", RAND_MAX); int ran, input, loop; do { int remain = 4; srand( time(NULL) ); ran = rand() % 11; puts("猜一个0到10间的数字,你总共有4次猜的机会"); scanf("%d", &input); if (input < 0 || input > 10) { do { puts("你输入的不是0~10的数字哦，再输一次吧"); scanf("%d", &input); } while ( input >= 0 && input <= 10 ); } do { if (remain-- == 0) { printf("没机会了哦,正确答案是%d \n", ran); break; } if (input > ran) { printf("大了，再猜一次，你还剩%d次机会\n", remain); scanf("%d", &input); } else if (input < ran) { printf("大了，再猜一次，你还剩%d次机会\n", remain); scanf("%d", &input); } } while (input != ran); if (input == ran) puts("猜对啦！"); puts("还想再玩一次吗？想的话输入1 不想的话输入其他数字"); scanf("%d", &loop); } while (loop == 1); puts("结束"); printf("hello"); printf("\b\b "); printf("%d \n", CLOCKS_PER_SEC); // 1000 printf("%.2f", (double)clock() / CLOCKS_PER_SEC ); printf("%d \n", (1 == 0) ); // 0 printf("%d \n", (clock_t)(-1) ); // -1 for (int i = 5; i > 0; i++ ) { printf("%d \n", i); sleep(1000); } putchar('\a'); int sleep(unsigned long x) { clock_t c1 = clock(), c2; do { c2 = clock(); } while ( (c2 - c1) < x ); } for (int i = 0; ; i++) { printf("%d \n", i); sleep(100); } system("color 2"); srand(time(NULL)); while(1) { for (int i = 0; ; i++) { for (int j = 0; j < 60; j++) { printf("%d ", rand() % 10); } putchar('\n'); } } for(int i = 1; i < 100; i++) { printf("%*d \n", i, i % 10); } int n = 20; int j = n; for(int i = 1; i < n; i++, j--) { printf("%c%*c%*c\n", 'N', i, 'N', j, 'N'); } double balance = 1000; int id = 123456, password = 123456, i, j; void check_account() { printf("您的余额还剩%.2f\n\n", balance); } void draw_money() { double x = 0; int t = 0; do { printf("请您输入您想要取的金额\n"); scanf("%lf", &x); if (x > balance) { printf("抱歉，您的余额不足%.2lf,您目前的余额为%.2lf\n是否重新输入？\n1.是 2.否\n", x, balance); scanf("%d", &t); if (t == 2) break; } else { balance -= x; printf("您已领取%.2f元，您的余额还剩%.2f元\n\n", x, balance); } } while ( t == 1); } void change_password() { int password1, password2, t = 1; do{ puts("请输入您的新密码（六位数）"); scanf("%d",&password1); puts("请再次输入新密码加以确认"); scanf("%d", &password2); if (password1 == password2) { password = password1; puts("您的密码已修改成功！"); t = 0; } else { printf("第一次输入的与第二次输入的不一致，请重新输入"); t = 0; } } while (t == 0); } void deposit() { double money = 0; puts("请输入您想要存入的金额"); scanf("%lf", &money); balance += money; printf("您已成功存入%.2f元，您现在的余额为%.2f元\n", money, balance); } int loop = 1, flag = 0; puts("欢迎使用本自动柜员机\n\n"); do { do { puts("请输入您的账号"); scanf("%d", &i); puts("请输入您的密码"); scanf("%d", &j); if (i == id && j == password) { flag = 1; } else { puts("您输入的账号或密码错误，请重新输入"); flag = 0; } } while (flag == 0); printf("\n请选择您需要的服务项目：\n1.查询余额\n2.取款\n3.修改密码\n4.存款\n"); int choice; scanf("%d", &choice); switch(choice) { case 1: check_account(); break; case 2: draw_money(); break; case 3: change_password(); break; case 4: deposit(); break; } printf("是否继续使用？\n1.是\n2.否\n"); scanf("%d", &loop); } while (loop == 1); puts("感谢您本次的使用，祝您生活愉快！"); int year; scanf("%d", &year); if (year % 4 == 0 && year % 100 != 0 || year % 400 == 0 ) { puts("yes"); } else { puts("no"); } int i, n = 1; for (i = 0; i < 10; i++) { n = (n + 1) * 2; } printf("%d \n", n); int i, j, a[3][4]; for (i = 0; i < 3; i++) { for (j = 0; j < 4; j++) { scanf("%d", &a[i][j]); } } int min = a[0][0]; int max = a[0][0]; for (i = 0; i < 3; i++) { for (j = 0; j < 4; j++) { if (a[i][j] < min) min = a[i][j]; if (a[i][j] > max) max = a[i][j]; printf("%-4d", a[i][j]); } putchar('\n'); } printf("max = %d \nmin = %d \n", max, min); int i, x; scanf("%d", &x); int a[x]; for (i = 0; i < x; i++) { scanf("%d", &a[i]); } void rev() { int len = sizeof(a) / sizeof(int); int temp, j = len - 1; for (i = 0; i < len / 2; i++, j--) { temp = a[i]; a[i] = a[j]; a[j] = temp; } } rev(); for (i = 0; i < x; i++) { printf("%d", a[i]); } printf("%o \n", 8); // 10 printf("%#o \n", 8); // 010 int a[5]; for (int i = 0; i < 5; i++) { printf("%p \n", &a[i]); } void minmax(int a[], int len, int *min, int *max) { *min = a[0]; *max = a[0]; for (int i = 1; i < len; i++) { if (*min > a[i]) { *min = a[i]; } if (*max < a[i]) { *max = a[i]; } } } int len, min, max, a[] = {5, 6, 88, 12, 26, 3, 188, 44, 55}; len = sizeof(a) / sizeof(a[0]); minmax(a, len, &min, &max); printf("%d %d \n", min, max); int divide(int a, int b, int *result) { int ret = 1; if (b == 0) { ret = 0; } else { *result = a / b; } return ret; } int a = 3, b = 0, result; if ( divide(a, b, &result) ) { printf("%d/%d=%d", a, b, result); } else { puts("b can't be 0"); } int a = 1; const int *p = &a; *p = 0; // error int i, x, *a; scanf("%d", &x); a = (int*)malloc(x * sizeof(int)); for (i = 0; i < x; i++) { scanf("%d", &a[i]); } for (i = 0; i < x; i++) { printf("%d ", a[i]); } free(a); int p = 1, i = 0; while( p = malloc(100 * 1024 * 1024) ) { i++; } printf("本次最大分配内存为%d00MB", i); char a[][20] = {"hello", "world", "I", "Love", "Programming"}; printf("%d \n", sizeof(a)); // 100 for (int i = 0; i < sizeof(a) / 20; i++) { printf("%s \n", a[i]); } char *p[] = {"man"}; printf("%d \n", sizeof(p)); // 8 printf("%d \n", sizeof(*p)); // 8 printf("%d \n", sizeof(char)); // 1 char *p[] = {"I", "love", "coding"}; printf("%s %s %s\n", p[0], p[1], p[2]); struct time { int year; int month; int day; } t1, t2; t1 = (struct time){1999, 10, 31}; printf("%d \n", t1.year); void change_year(struct time *p) { scanf("%d", & p -> year); } struct time oneYearYounger(struct time x) { (x.year)++; return x; } t2 = oneYearYounger(t1); change_year(&t1); printf("%d \n", t1.year); printf("%d \n", t2.year); typedef struct { int *array; int size; } Array; Array array_create(int init_size) { Array a; a.size = init_size; a.array = (int*)malloc(sizeof(int)*a.size); return a; } void array_free(Array *a) { free(a->array); a->array = NULL; a->size = 0; } //获取数组的size (封装手法) int array_size(Array *a) { return a->size; } int* array_at(Array *a, int index) { return &(a->arrary[index]); } void array_inflate(Array *a, int more_size) { int *p = (int*)malloc( sizeof(int)*(a->size + more_size) ); int i; for (i = 0; i < a->size; i++) { p[i] = a->array[i]; } free(a->array); a->array = p; a->size += more_size; } int *p = NULL; printf("%p \n", p); //0000000000000000 for (int i = 0; i < 10; i++) { printf("%d ", temp->number); printf("%d \n", temp); temp = temp->next; } printf("sizeof(Node)=%d \n",sizeof(Node)); Node *createLinkedList(int n) { Node *head = (Node*)malloc(sizeof(Node)); Node *temp = head; for (int i = 0; i < n; i++) { Node *p = (Node*)malloc(sizeof(Node)); p->number = i; p->next = NULL; temp->next = p; temp = p; } return head; } Node *head = createLinkedList(10); int isFound(Node *head, int n) { int found = 0; Node *temp = head->next; do { if (temp->number == n) { found = 1; } temp=temp->next; } while (temp != NULL); return found; } printf("%d \n", isFound(head, 10)); double avg() { int count = 0; double sum = 0; Node *head = createLinkedList(); Node *temp = head->next; do { sum += temp->number; printf("%.2f \n", sum); temp = temp->next; count++; } while (temp != NULL); return sum / count; } printf("%.2f \n", avg()); typedef struct node { int number; struct node *next; } Node; // 创建单向链表，当输入为-1时创建结束 Node *createLinkedList() { Node *head = (Node*)malloc(sizeof(Node)); Node *temp = head; int i = 0; do { scanf("%d", &i); if (i == -1) { break; } Node *p = (Node*)malloc(sizeof(Node)); p->number = i; p->next = NULL; temp->next = p; temp = p; } while (1); return head; } // 合并有序数组a和有序数组b中的元素到数组c，去重复元素并保持c有序 void merge(int *a, int *b, int *c, int na, int nb, int *count) { int i = 0, j = 0, k = 0; while (i < na && j < nb) { if (a[i] < b[j]) { c[k++] = a[i]; i++; (*count)++; } else if (a[i] == b[j]) { c[k++] = a[i]; i++; j++; (*count)++; } else { c[k++] = b[j]; j++; (*count)++; } } if (i == na) { for ( ; j < nb; j++) { c[k++] = b[j]; (*count)++; } } else { for ( ; i < na; i++) { c[k++] = a[i]; (*count)++; } } } int na, nb, i, count = 0; scanf("%d %d", &na, &nb); int *a = (int*)malloc(sizeof(int) * na); int *b = (int*)malloc(sizeof(int) * nb); int *c = (int*)malloc(sizeof(int) * (na + nb)); for (i = 0; i < na; i++) { scanf("%d", &a[i]); } for (i = 0; i < nb; i++) { scanf("%d", &b[i]); } merge(a, b, c, na, nb, &count); for (i = 0; i < count; i++) { printf("%d ", c[i]); } free(a); free(b); free(c); a = NULL; b = NULL; c = NULL; */

My Coding Record In C (unfinished)