Find a dilemma and it took me an afternoon.

alzly1983

maybe:
#define N 30
#include "stdio.h"
#include <math.h>
#include "conio.h"
#include <stdlib.h>

int main ()
{
   int lucky [N] [N], row [N], col [N];
   int n, lucky_n, k, sum = 0, i, j;
   printf ("Please enter the square matrix order"); scanf ("% d",&n);
   printf ("Please enter the lucky number"); scanf ("% d",&lucky_n);
   k = lucky_n / n;
   if (k == 0)
   printf ("The input value is too small");
   for (i = 0; i <n; i ++)
   {
      row [i] = rand ()% k;
      col [i] = rand ()% k;
      sum + = row [i] + col [i];
    }
    col [n-1] + = lucky_n-sum;
    for (i = 0; i <n; i ++)
       for (j = 0; j <n; j ++)
          lucky [i] [j] = row [i] + col [j];
    for (i = 0; i <n; i ++)
    {
       for (j = 0; j <n; j ++)
           printf ("% d\f", lucky [i] [j]);
     }
   getch ();
}

squall_wl

Come on

暗夜刺炎

(1) The subprogram sort () directly selects and sorts the linked list. The linked list for sorting does not have a marked node, and the first pointer is provided by the parameter. For convenience of sorting, this function adds an auxiliary header mark node to the linked list before sorting, and deletes this node after sorting is completed.
typedef struct node
{
   int value;
   struct node * next;
} node;

void sort (_______ (1) _______ h) struct node **
{
    struct node * p, * q, * r, * s, * h1;
    h1 = p = (node ​​*) malloc (sizeof (node));
    p-> next = * h;
    while (p-> next)
    {
       q = p-> next;
       r = p;
       while (q-> next)
       {
           if (q-> next-> value <_______ (2) _______) r-> next-> value
              r = q;
           q = q-> next;
        }
        if (r! = q) should be changed to if (r! = p)
        {
            s = _______ (3) _______; h1-> next = r-> next
            _______ (4) _______ = s-> next; r-> next
            s-> next = _______ (5) _______; p-> next
         }
        p = p-> next;
    }
    * h = _______ (7) _______; h1-> next
    free (h1);
}

暗夜刺炎

The above is wrong, wrong

q8399816

Brothers:
        Help me, my brother has a question about the SPI interception network packet technology. I have intercepted the data packet and put it in the file, but I don't know how to filter the data packet. I wrote it in C++! Experts please give pointers! ! ! thank you very much! ! It’s good to leave a contact, qq or something?

oliver123

This program is available in the soft test materials. There is no problem in the title. You can check it and you will know. It is a self-finding on the programmer test paper. I have done it. You have analyzed it yourself.

yueyutao

Is it elevation or programmer?

yueyutao

暗夜刺炎:

if(q->next->value <_______(2)_______) r->next->value
If this is the answer, r=q is wrong. r should be equal to the smallest value

fenghui123

The second question seems not to understand too much!

alzly1983

I made the second answer in three rows and three columns, but I would like to ask a master. Can you directly output an array of three rows and three columns when outputting the answer. Using pass by reference as array, it seems that it does not work.