Flickrs的专栏

1.逆序的三位数 #include <stdio.h> void vert(int a);int main(){ int n; scanf("%d", &n); vert(n); return 0; }void vert(int a){ int i, j; i = a % 10; j = a / 10; if(i != 0) printf("%d",

#include <stdio.h> #include <math.h>#define N 8int a[N]; void print(){}void isSafe(int n){ for (int i = 0; i < n; ++i) { if (a[i] == a[n] || abs(a[i] - a[n]) ==abs(i - N)) {

//addition + void Addition(char *num1, char *num2){ int add[202] = {0}; int len1 = (int)strlen(num1) - 2, len2 = (int)strlen(num2) - 2; int i; for (i = 0; len1 >= 0 || len2 >= 0; ++i)

#include <stdio.h> #include <stdlib.h> #define LEN sizeof(struct Array) typedef struct Array { int num; struct Array *next; }Array; //定义 Array 为 Array 类型的结构体 //用作动态链表//function to create struct