add 基础编程题目集

Author: tiny656

READMEBuild.py

@@ -22,6 +22,11 @@
         'name': u'中国大学MOOC-陈越、何钦铭-数据结构-起步能力自测题',
         'folderName': u'中国大学MOOC-陈越、何钦铭-数据结构-起步能力自测题',
         'url': '',
+    },
+    {
+        'name': u'基础编程题目集',
+        'folderName': u'基础编程题目集',
+        'url': '',
     }
 ]
 
@@ -48,6 +53,7 @@ class CodeType:
     CPLUSPLUS = 1
     PYTHON = 2
     JAVA = 4
+    C = 5
 
     @staticmethod
     def getCodeType(ext):
@@ -57,6 +63,8 @@ def getCodeType(ext):
             return CodeType.PYTHON
         elif ext == '.java':
             return CodeType.JAVA
+        elif ext == '.c':
+            return CodeType.C
 
 class Table(object):
     def __init__(self, folderName, name, url):
@@ -98,6 +106,8 @@ def __str__(self):
             codeUrl += '[`Python`](%s/%s_%s.py)' % (githubUrl, self.id, self.name.replace(' ', '%20'))
         if self.code & CodeType.JAVA:
             codeUrl += '[`Java`](%s/%s_%s.java)' % (githubUrl, self.id, self.name.replace(' ', '%20'))
+        if self.code & CodeType.C:
+            codeUrl += '[`C`](%s/%s_%s.c)' % (githubUrl, self.id, self.name.replace(' ', '%20'))
         ret = u'| %s | %s | %s |' % (self.id, self.name, codeUrl)
         return ret
 

基础编程题目集/6-10_阶乘计算升级版 (20).c

@@ -0,0 +1,29 @@
+void Print_Factorial ( const int N )
+{
+    if (N < 0) 
+    {
+        printf("Invalid input");
+        return;
+    }
+    int c[20001];
+    c[0] = 1;
+    int digit = 1;
+    for (int i = 2; i <= N; i++) 
+    {
+        int num = 0;
+        for (int d = 0; d < digit; d++) 
+        {
+            num = c[d] * i + num;
+            c[d] = num % 10;
+            num /= 10;
+        }
+        while (num) 
+        {
+            c[digit] = num % 10;
+            num /= 10;
+            digit++;
+        }
+    }
+    for (int i = digit-1; i >= 0; i--)
+        printf("%d", c[i]);
+}

基础编程题目集/6-11_求自定类型元素序列的中位数 (25).c

@@ -0,0 +1,25 @@
+ElementType Median(ElementType A[], int N) 
+{
+    ElementType aux[MAXN];
+    for (int i = 0; i < N; i++) aux[i] = A[i];
+    merge_help_sort(aux, A, 0, N - 1);
+    return A[N/2];
+}
+
+void merge_help_sort(ElementType src[], ElementType dst[], int lo, int hi) {
+    if (hi <= lo) return;
+    int mid = lo + ((hi - lo) >> 1);
+    merge_help_sort(dst, src, lo, mid);
+    merge_help_sort(dst, src, mid + 1, hi);
+    merge(src, dst, lo, mid, hi);
+}
+
+void merge(ElementType src[], ElementType dst[], int lo, int mid, int hi) {
+    int i = lo, j = mid + 1;
+    for (int k = lo; k <= hi; k++) {
+        if      (i > mid)           dst[k] = src[j++];
+        else if (j > hi)            dst[k] = src[i++];
+        else if (src[i] < src[j])   dst[k] = src[i++];
+        else                        dst[k] = src[j++];
+    }
+}

基础编程题目集/6-12_判断奇偶性 (10).c

@@ -0,0 +1,4 @@
+int even( int n ) 
+{
+    return n % 2 == 0;
+}

基础编程题目集/6-13_折半查找 (15).c

@@ -0,0 +1,12 @@
+int  Search_Bin(SSTable T, KeyType k) 
+{
+    int lo = 1, hi = T.length;
+    while (lo < hi) 
+    {
+        int mid = lo + (hi-lo) / 2;
+        if (T.R[mid].key == k) return mid;
+        else if (T.R[mid].key < k) lo = mid+1;
+        else hi = mid-1;
+    }
+    return 0;
+}

基础编程题目集/6-1_简单输出整数 (10).c

@@ -0,0 +1,7 @@
+void PrintN(int n) 
+{
+    for (int i = 1; i <= n; i++) 
+    {
+        printf("%d\n", i);
+    }
+}

基础编程题目集/6-2_多项式求值 (20).c

@@ -0,0 +1,10 @@
+double f(int n, double a[], double x) 
+{
+    double sum = 0;
+    double base = 1;
+    for (int i = 0; i <= n; i++) {
+        sum += a[i] * base;
+        base *= x;
+    }
+    return sum;
+}

基础编程题目集/6-3_简单求和 (10).c

@@ -0,0 +1,9 @@
+int Sum (int List[], int N)
+{
+    int sum = 0;
+    for (int i = 0; i < N; i++)
+    {
+        sum += List[i];
+    }
+    return sum;
+}

基础编程题目集/6-4_求自定类型元素的平均 (10).c

@@ -0,0 +1,9 @@
+ElementType Average(ElementType S[], int N) 
+{
+    ElementType sum = 0;
+    for (int i = 0; i < N; i++) 
+    {
+        sum += S[i];
+    }
+    return sum / N;
+}

基础编程题目集/6-5_求自定类型元素的最大值 (10).c

@@ -0,0 +1,9 @@
+ElementType Max(ElementType S[],int N) 
+{
+    ElementType result = S[0];
+    for (int i = 1; i < N; i++) 
+    {
+        result = S[i] > result ? S[i] : result;
+    }
+    return result;
+}

基础编程题目集/6-6_求单链表结点的阶乘和 (15).c

@@ -0,0 +1,15 @@
+int FactorialSum( List L ) 
+{
+    int sum = 0;
+    while (L != NULL) 
+    {
+        int fac = 1;
+        for (int i = L->Data; i >= 2; i--) 
+        {
+            fac *= i;
+        }
+        sum += fac;
+        L = L->Next;
+    }   
+    return sum; 
+}

基础编程题目集/6-7_统计某类完全平方数 (20).c

@@ -0,0 +1,18 @@
+int IsTheNumber (const int N)
+{
+    int n = N;
+    int b = (int)sqrt(n);
+    int sq = b*b == n;
+    int same = 0;
+    int bit[10] = {0, 0, 0, 0, 0, 0, 0, 0, 0};
+    do {
+        if (bit[n % 10] == 1) {
+            same = 1;
+            break;
+        }
+        bit[n % 10] = 1; 
+        n /= 10;
+    } while (n != 0);
+    return sq && same;
+
+}

基础编程题目集/6-8_简单阶乘计算 (10).c

@@ -0,0 +1,9 @@
+int Factorial( const int N ) 
+{
+    int result = 1;
+    for (int i = 2; i <= N; i++) 
+    {
+        result *= i;
+    }
+    return N >= 0 ? result : 0;
+}

基础编程题目集/6-9_统计个位数字 (15).c

@@ -0,0 +1,11 @@
+int Count_Digit ( const int N, const int D )
+{
+    int n = abs(N);
+    int countD = 0;
+    do 
+    {
+        if (n % 10 == D) countD++;
+        n /= 10;
+    } while (n != 0);
+    return countD;
+}