https://blog.youkuaiyun.com/sevancozh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/sevanco/article/details/70832690https://blog.youkuaiyun.com/sevanco/article/details/70832690sevancoWed, 26 Apr 2017 21:17:57 +0800 #include #include #include #include #include #include /** 请完成下面这个函数，实现题目要求的功能 **/ /** 当然，你也可以不按照这个模板来作答，完全按照自己的想法来 ^-]]>https://blog.youkuaiyun.com/sevanco/article/details/70832682https://blog.youkuaiyun.com/sevanco/article/details/70832682sevancoWed, 26 Apr 2017 21:17:14 +0800 #include #include #include #include using namespace std;/** 请完成下面这个函数，实现题目要求的功能 **/ /** 当然，你也可以不按照这个模板来作答，完全按照自己的想法来 ^-^ **/int prime(int num_]]>https://blog.youkuaiyun.com/sevanco/article/details/68940645https://blog.youkuaiyun.com/sevanco/article/details/68940645sevancoSat, 01 Apr 2017 08:14:36 +0800 #include #define M 20 struct num { int a; struct num *next; }; struct num *reverse(struct num *head) { struct num *p; p = head; if (p->next == NULL)]]>https://blog.youkuaiyun.com/sevanco/article/details/68923987https://blog.youkuaiyun.com/sevanco/article/details/68923987sevancoFri, 31 Mar 2017 13:15:37 +0800 #include #include #include #define M 2 struct student { char name[M]; double score; struct student *next; }; struct s]]>https://blog.youkuaiyun.com/sevanco/article/details/68921148https://blog.youkuaiyun.com/sevanco/article/details/68921148sevancoFri, 31 Mar 2017 08:30:10 +0800https://blog.youkuaiyun.com/sevanco/article/details/67644313https://blog.youkuaiyun.com/sevanco/article/details/67644313sevancoTue, 28 Mar 2017 20:34:43 +0800 #include #define M 500void fun(char *a, void (*p)(char *, void (*q)(char *, char *)), void (*q)(char *, char *)) { char *t; for (t = a + 1; *t != '\0'; ++t) {]]>https://blog.youkuaiyun.com/sevanco/article/details/66971615https://blog.youkuaiyun.com/sevanco/article/details/66971615sevancoMon, 27 Mar 2017 14:49:22 +0800 #include #include #define M 2 #define N 2 void fun(int b, double a[][N], double t) { for (int i = 0; i < N; ++i) { // printf("asdas\n"); /]]>https://blog.youkuaiyun.com/sevanco/article/details/66970587https://blog.youkuaiyun.com/sevanco/article/details/66970587sevancoMon, 27 Mar 2017 13:14:10 +0800 #include #define M 5 const char *com(const char **a) { int t = 0; for (int i = 0; i < M - 1; ++i) { if (strlen(*(a + t)) < strlen(*(a + i + 1)))]]>https://blog.youkuaiyun.com/sevanco/article/details/66970338https://blog.youkuaiyun.com/sevanco/article/details/66970338sevancoMon, 27 Mar 2017 12:24:04 +0800 #include #define M 5 void exc(int *a,int *(*p)(int *), int *(*q)(int *)) { int c, *m, *n; m = p(a); n = q(a); c = *m; *m = *n; *n = c; } int *max(]]>https://blog.youkuaiyun.com/sevanco/article/details/66967806https://blog.youkuaiyun.com/sevanco/article/details/66967806sevancoMon, 27 Mar 2017 08:56:39 +0800 #include #define M 200 int main(int argc, char const *argv[]) { char str[M] = "asdasd"; static char *name[]]>https://blog.youkuaiyun.com/sevanco/article/details/66476555https://blog.youkuaiyun.com/sevanco/article/details/66476555sevancoSun, 26 Mar 2017 16:29:11 +0800 #include #define M 2 #define N 2]]>https://blog.youkuaiyun.com/sevanco/article/details/66472618https://blog.youkuaiyun.com/sevanco/article/details/66472618sevancoSun, 26 Mar 2017 10:50:04 +0800https://blog.youkuaiyun.com/sevanco/article/details/65935249https://blog.youkuaiyun.com/sevanco/article/details/65935249sevancoSat, 25 Mar 2017 10:57:56 +0800https://blog.youkuaiyun.com/sevanco/article/details/65627517https://blog.youkuaiyun.com/sevanco/article/details/65627517sevancoFri, 24 Mar 2017 10:20:53 +0800https://blog.youkuaiyun.com/sevanco/article/details/64907398https://blog.youkuaiyun.com/sevanco/article/details/64907398sevancoWed, 22 Mar 2017 12:50:26 +0800https://blog.youkuaiyun.com/sevanco/article/details/63252673https://blog.youkuaiyun.com/sevanco/article/details/63252673sevancoSat, 18 Mar 2017 12:03:46 +0800https://blog.youkuaiyun.com/sevanco/article/details/62230133https://blog.youkuaiyun.com/sevanco/article/details/62230133sevancoWed, 15 Mar 2017 16:52:37 +0800 %c\n", a, b); } void hanoit(int n, char a, char b, char c) { if (n == 1) { move(a, c); } else { hanoit(n - 1, a, c, b); move(a, c); ]]>https://blog.youkuaiyun.com/sevanco/article/details/61917355https://blog.youkuaiyun.com/sevanco/article/details/61917355sevancoMon, 13 Mar 2017 14:40:11 +0800https://blog.youkuaiyun.com/sevanco/article/details/61916161https://blog.youkuaiyun.com/sevanco/article/details/61916161sevancoMon, 13 Mar 2017 13:24:49 +0800https://blog.youkuaiyun.com/sevanco/article/details/61915398https://blog.youkuaiyun.com/sevanco/article/details/61915398sevancoMon, 13 Mar 2017 11:48:04 +0800