c语言上机实验（国外英文资料）.docVIP

c语言上机实验（国外英文资料） (1) print the following Yang hui triangle. 1 / * (0) 1, 1 over *, 1 over * 1, 2, 1 over * 1, 3, 3, 1 1, 4, 6, 4, 1 1, 5, 10, 10, 5, 1 1, 6, 15, 20, 15, 6, 1 1, 7, 21, 35, 35, 21, 7, 1 1, 8, 28, 56, 70, 56, 28, 8, 1 1, 9, 36, 84, 126, 126, 126, 84, 36, 9, 1 Each data value can be calculated by the combination (representing the value of the JTH column position of the ith row), and the calculation is as follows: (I = 0, 1, 2,...) (j = 0, 1, 2, 3,...) To print the pyramid effect, notice the number of Spaces. There are three Spaces between a single digit, two Spaces between the two digits, a single space between the three digits, and a distinction in the process of programming. (2) write a program to input short unsigned integer x, m, n (0 m or less 15 or less, 1 n - 16 m or less) or less, remove x since the first m bit to the left of the n bit number (m from right to left to 0 ~ 15), and make it to the left side (15) alignment. (3) the IP address is usually four small integers separated by a period, such as 32.55.1.102. These addresses are represented in the machine by unsigned long plastic surgery. . Write a program to read in the form of machine to store a 32-bit Internet IP address, the decoder, and then use common output in the form of splitting up of four parts. Track the debugging problem Calculate the n items and procedures for the fabonacci sequence: So, long sum is equal to 0. Declare p to be a long integer pointer and take the address of sum with sum to initialize p. * p means the variable referred to by p (* p is sum). Void main (void) { Int I, k; Long sum is equal to 0. Scanf ( % d , k); For (I = 1; I = k; I + +) { The sum + = fabonacci (I); Printf ( I = % d \ tthe sum is % ld \ n , I, * p); } } Long fabonacci (int n) { If n = 1, |, | n = = 2. Return 1; The else Return fabonacci (n - 1) + fabonacci (n - 2); } Step by step, observe p, I, sum, n. (1) after the execution of scanf ( % d , k); Statement, p, what is the I value? (2) what stateme