C语言编写DES算法遇到的问题，求各位指点一下

在使用C语言编写DES算法中，为什么只有第一轮输出了正确数据，其余15轮数据都是错误的，写的函数没有问题呀，崩溃，希望各位大佬给看看！以下为代码：

#include<stdio.h>


///十进制转二进制
void shizhuaner(int *k, int n, int i,int large)
// k是存放二进制的数组，n是需要进行转换的十进制数，i是第i个十进制数，large是数组大小
{
    int j;
    large = large / 8;
    j = large - 1;
    do
    {
        k[i * large + j] = n % 2;
        n = n / 2;
        j--;
    } while (n != 0);
    while (j >= 0)
    {
        k[i * large + j] = 0;
        j--;
    }
    return ;
}


///异或运算
void yihuo(int *r_b, int *k3,int large)
{
    int i;
    for (i = 0; i < large; i++)
    {
        if (r_b[i] != k3[i])  //相同取0,不同取1
            r_b[i] = 1;
        else
            r_b[i] = 0;
    }
}


///S盒操作
void Sbox(int r_t[32],int r_b[48])
{
    int i,row,col,answer;  ///answer为查询出的结果
    int s1[4][16] = { { 14, 4, 13, 1, 2, 15, 11, 8, 3, 10, 6, 12, 5, 9, 0, 7 },
                      { 0, 15, 7, 4, 14, 2, 13, 1, 10, 6, 12, 11, 9, 5, 3, 8 },
                      { 4, 1, 14, 8, 13, 6, 2, 11, 15, 12, 9, 7, 3, 10, 5, 0 },
                      { 15, 12, 8, 2, 4, 9, 1, 7, 5, 11, 3, 14, 10, 0, 6, 13 } },
        s2[4][16] = { { 15, 1, 8, 14, 6, 11, 3, 4, 9, 7, 2, 13, 12, 0, 5, 10 },
                      { 3, 13, 4, 7, 15, 2, 8, 14, 12, 0, 1, 10, 6, 9, 11, 5 },
                      { 0, 14, 7, 11, 10, 4, 13, 1, 5, 8, 12, 6, 9, 3, 2, 15 },
                      { 13, 8, 10, 1, 3, 15, 4, 2, 11, 6, 7, 12, 0, 5, 14, 9 } },
        s3[4][16] = { { 10, 0, 9, 14, 6, 3, 15, 5, 1, 13, 12, 7, 11, 4, 2, 8 },
                      { 13, 7, 0, 9, 3, 4, 6, 10, 2, 8, 5, 14, 12, 11, 15, 1 },
                      { 13, 6, 4, 9, 8, 15, 3, 0, 11, 1, 2, 12, 5, 10, 14, 7 },
                      { 1, 10, 13, 0, 6, 9, 8, 7, 4, 15, 14, 3, 11, 5, 2, 12 } },
        s4[4][16] = { { 7, 13, 14, 3, 0, 6, 9, 10, 1, 2, 8, 5, 11, 12, 4, 15 },
                      { 13, 8, 11, 5, 6, 15, 0, 3, 4, 7, 2, 12, 1, 10, 14, 9 },
                      { 10, 6, 9, 0, 12, 11, 7, 13, 15, 1, 3, 14, 5, 2, 8, 3 },
                      { 3, 15, 0, 6, 10, 1, 13, 8, 9, 4, 5, 11, 12, 7, 2, 14 } },
        s5[4][16] = { { 2, 12, 4, 1, 7, 10, 11, 6, 8, 5, 3, 15, 13, 0, 14, 9 },
                      { 14, 11, 2, 12, 4, 7, 13, 1, 5, 0, 15, 10, 3, 9, 8, 6 },
                      { 4, 2, 1, 11, 10, 13, 7, 8, 15, 9, 12, 5, 6, 3, 0, 14 },
                      { 11, 8, 12, 7, 1, 14, 2, 13, 6, 15, 0, 9, 10, 4, 5, 3 } },
        s6[4][16] = { { 12, 1, 10, 15, 9, 2, 6, 8, 0, 13, 3, 4, 14, 7, 5, 11 },
                      { 10, 15, 4, 2, 7, 12, 9, 5, 6, 1, 13, 14, 0, 11, 3, 8 },
                      { 9, 14, 15, 5, 2, 8, 12, 3, 7, 0, 4, 10, 1, 13, 11, 6 },
                      { 4, 3, 2, 12, 9, 5, 15, 10, 11, 14, 1, 7, 6, 0, 8, 13 } },
        s7[4][16] = { { 4, 11, 2, 14, 15, 0, 8, 13, 3, 12, 9, 7, 5, 10, 6, 1 },
                      { 13, 0, 11, 7, 4, 9, 1, 10, 14, 3, 5, 12, 2, 15, 8, 6 },
                      { 1, 4, 11, 13, 12, 3, 7, 14, 10, 15, 6, 8, 0, 5, 9, 2 },
                      { 6, 11, 13, 8, 1, 4, 10, 7, 9, 5, 0, 15, 14, 2, 3, 12 } },
        s8[4][16] = { { 13, 2, 8, 4, 6, 15, 11, 1, 10, 9, 3, 14, 5, 0, 12, 7 },
                      { 1, 15, 13, 8, 10, 3, 7, 4, 12, 5, 6, 11, 0, 14, 9, 2 },
                      { 7, 11, 4, 1, 9, 12, 14, 2, 0, 6, 10, 13, 15, 3, 5, 8 },
                      { 2, 1, 14, 7, 4, 10, 8, 13, 15, 12, 9, 0, 3, 5, 6, 11 } };
    for (i = 0; i < 8; i++)
    {
        row = r_b[i * 6] * 2 + r_b[i * 6 + 5];  ///第0位与第5位决定行
        col = r_b[i * 6 + 1] * 8 + r_b[i * 6 + 2] * 4 + r_b[i * 6 + 3] * 2 + r_b[i * 6 + 4];  ///中间4位决定列
        switch (i)
        {
        case 0:answer = s1[row][col]; break;
        case 1:answer = s2[row][col]; break;
        case 2:answer = s3[row][col]; break;
        case 3:answer = s4[row][col]; break;
        case 4:answer = s5[row][col]; break;
        case 5:answer = s6[row][col]; break;
        case 6:answer = s7[row][col]; break;
        case 7:answer = s8[row][col]; break;
        }
        shizhuaner(r_t, answer, i,32);  ///将S盒的十进制数字转换回二进制进行存放
    }
}




///密钥左移函数
void key_move(int kz1[56], int n)
{
    int i, one, two, twentyeight, twentynight;  //one、two、twentyeight、twentynight用于存放第1、2、28、29个数
    one = kz1[0];  //先记录第1、2、28、29个数
    two = kz1[1];
    twentyeight = kz1[28];
    twentynight = kz1[29];
    for (i = 0; i < (28 - n); i++)  //循环赋值
    {
        kz1[i] = kz1[i + n];
        kz1[i + 28] = kz1[i + n + 28];
    }
    if (n == 1)  //左移1位时，特殊端点值（第27、55）赋值
    {
        kz1[27] = one;
        kz1[55] = twentyeight;
    }
    else  //左移2位时，特殊端点值（第27、28、54、55）赋值
    {
        kz1[26] = one;
        kz1[27] = two;
        kz1[54] = twentyeight;
        kz1[55] = twentynight;
    }
}


///置换函数
void exchange(int *k1, int *k2, int *rule,int n)
{
    int i, j;
    for (i = 0; i < n; i++)
    {
        j = rule[i];    //赋值
        k2[i] = k1[j-1];
    }
    return;
}




///循环函数
void round(int r, int kz1[56], int kz2[48], int r32[32], int re48[48], int L[32], int k_c_two[48], int m_c_two[32], int e[48], char cr[32], char cl[32])
{
    //r是轮数
    // kz1是密钥经过置换1置换完的数组，kz2是密钥经过置换2置换完的数组
    // r32是明文处理中R的32大小时的数组，re48是明文处理中R的48大小时的数组，L是明文处理中L的数组
    // k_c_two是密钥处理中置换2的置换规则数组，m_c_two是明文处理中置换2的置换规则数组，e是明文处理中e盒的置换规则数组
    // cr是各轮密文的右半部分,cl是各轮密文的左半部分
    int i,n, r_t[32],r_c[32]; //n为该轮左移的位数，r_t,r_c存放中间处理数值的32大小的数组
    printf("这是第%d轮DES盒输出：\n", r);
    n = move_num(r); //获取第r轮密钥左移的位数
    key_move(kz1, n); //调用密钥左移函数
    exchange(kz1, kz2, k_c_two, 48);  //密钥进行置换2运算
    ///进行轮函数f的操作
    exchange(r32, re48,e,48);  //明文进行e盒扩展置换运算，扩展运算e对32位的R(i-1)的各位就行选择排列，产生一个48位的输出;
    yihuo(re48, kz2,48);  //经过密钥置换2运算后的子密钥与从e盒出来的子明文异或
    Sbox(r_t,re48);  //调用明文处理中的s盒运算函数
    for (i = 0; i < 32; i++)
        printf("%d",r_t[i]);
    exchange(r_t, r_c, m_c_two, 32);  //明文进行置换2运算(也成为置换P操作),此时输出的是f(Ri-1,Ki)
    ///结束轮函数f的操作
    for (i = 0; i < 32; i++)
        r_t[i] = r_c[i];
    yihuo(r_t, L, 32);    //经过处理后的R与L异或
    for (i = 0; i < 32; i++)
    {
         L[i] = r32[i];  //准备下次循环的L
    }
    for (i = 0; i < 32; i++)
    {
        r32[i] = r_t[i];  //准备下次循环的R
    }
    printf("\n");
    printf("\n");
    return;
}




///获取第r轮左移的位数
int move_num(int r)
{
    int i;  ///移动的位数
    switch (r)
    {
    case 1:i = 1; break;
    case 2:i = 1; break;
    case 3:i = 2; break;
    case 4:i = 2; break;
    case 5:i = 2; break;
    case 6:i = 2; break;
    case 7:i = 2; break;
    case 8:i = 2; break;
    case 9:i = 1; break;
    case 10:i = 2; break;
    case 11:i = 2; break;
    case 12:i = 2; break;
    case 13:i = 2; break;
    case 14:i = 2; break;
    case 15:i = 2; break;
    case 16:i = 1; break;
    }
    return i;
}




///主函数
int main()
{
    char c[64],cr[32],cl[32];
      /*c是最终密文，cr是密文的右半部分，cl是密文的左半部分*/
    int i, j, r, n, k1[64], kz1[56], kz2[48], m1[64], m2[64],r32[32],r48[48],L[32];
    /* r是轮数；n接收类型转换后的结果；k1，kz1，kz2是密钥处理中不同大小的数组；m1，m2是明文处理中的数组，r32是R为32大小时的数组，r48是R为48大小时的数组*/
    int k_c_one[56] = { 57, 49, 41, 33, 25, 17, 9,/*密钥处理的置换1*/
                        1, 58, 50, 42, 34, 26, 18,
                        10, 2, 59, 51, 43, 35, 27,
                        19, 11, 3, 60, 52, 44, 36,
                        63, 55, 47, 39, 31, 23, 15,
                        7, 62, 54, 46, 38, 30, 22,
                        14, 6, 61, 53, 45, 37, 29,
                        21, 13, 5, 28, 20, 12, 4 },
        k_c_two[48] = { 14, 17, 11, 24, 1, 5,/*密钥处理的置换2*/
                        3, 28, 15, 6, 21, 10,
                        23, 19, 12, 4, 26, 8,
                        16, 7, 27, 20, 13, 2,
                        41, 52, 31, 37, 47, 55,
                        30, 40, 51, 45, 33, 48,
                        44, 49, 39, 56, 34, 53,
                        46, 42, 50, 36, 29, 32 },
        m_c_one[64] = { 58, 50, 42, 34, 26, 18, 10, 2,/*明文处理的置换1*/
                        60, 52, 44, 36, 28, 20, 12, 4,
                        62, 54, 46, 38, 30, 22, 14, 6,
                        64, 56, 48, 40, 32, 24, 16, 8,
                        57, 49, 41, 33, 25, 17, 9, 1,
                        59, 51, 43, 35, 27, 19, 11, 3,
                        61, 53, 45, 37, 29, 21, 13, 5,
                        63, 55, 47, 39, 31, 23, 15, 7 },
        e[48] = { 32, 1, 2, 3, 4, 5,/*明文处理的扩展置换e盒*/
                  4, 5, 6, 7, 8, 9,
                  8, 9, 10, 11, 12, 13,
                  12, 13, 14, 15, 16, 17,
                  16, 17, 18, 19, 20, 21,
                  20, 21, 22, 23, 24, 25,
                  24, 25, 26, 27, 28, 29,
                  28, 29, 30, 31, 32, 1 },
        m_c_two[32] = { 16, 7, 20, 21,/*明文处理的置换P*/
                        29, 12, 28, 17,
                        1, 15, 23, 26,
                        5, 18, 31, 10,
                        2, 8, 24, 14,
                        32, 27, 3, 9,
                        19, 13, 30, 6,
                        22, 11, 4, 25 },
      m_c_three[64] = { 40, 8, 48, 16, 56, 24, 64, 32,/*明文处理的IP(-1)置换*/
                        39, 7, 47, 15, 55, 23, 63, 31,
                        38, 6, 46, 14, 54, 22, 62, 30,
                        37, 5, 45, 13, 53, 21, 61, 29,
                        36, 4, 44, 12, 52, 20, 60, 28,
                        35, 3, 43, 11, 51, 19, 59, 27,
                        34, 2, 42, 10, 50, 18, 58, 26,
                        33, 1, 41, 9, 49, 17, 57, 25 };


    printf("**DES加密**\n");
    printf("\n");


    char Ming[64] ="0000000100100011010001010110011110001001101010111100110111101111";
    char   Mi[64] ="0001001100110100010101110111100110011011101111001101111111110001";


    printf("明文为:");
    for(i=0;i<64;i++)
    {
        printf("%c",Ming[i]);
        m1[i]=Ming[i];
    }
    printf("\n");


    printf("密钥为:");
    for(i=0;i<64;i++)
    {
       printf("%c",Mi[i]);
       k1[i]=Mi[i];
    }
    printf("\n");


    exchange(k1, kz1, k_c_one, 56);  //密钥进行选择置换选择1
    exchange(m1, m2, m_c_one, 64);  //明文进行IP置换
    for (i = 0; i < 32; i++)
        L[i] = m2[i];  //得到明文的L部分
    j = 0;
    for (i = 32; i < 64; i++)
    {
        r32[j] = m2[i];  //得到明文的R部分
        j++;
    }
    for (r = 1; r <= 16; r++)  //进行16轮的循环处理
        round(r,kz1, kz2, r32, r48, L, k_c_two, m_c_two, e, cr, cl);
    for (i = 0; i < 64; i++)  //将密文R的部分与密文L的部分合一起
    {
        m1[i] = r32[i];
        if (i >= 32)
            m1[i] = L[i - 32];
    }
    exchange(m1, m2, m_c_three, 64);  //进行明文处理的IP(-1)置换
    printf("这是最终密文:\n");
    for (i = 0; i < 64; i++)
        printf("%d", m2[i]);
    printf("\n");
    return 0;
}