0 like 0 dislike
5.8k views

Write a program that reads integers and stores them in an array. Then, the program should rotate the elements one place to the right. For example, if the array were 1, -9, 5, 3, the rotated array would be 3, 1, -9, 5.

寫一個程式 輸入整數放在陣列裡。將陣列裡面的元素向右旋轉一次

Example input 1: First number is the element of array to input, then the list of numbers

4
1 -9 5 3

Example output 1:

3 1 -9 5

 

Example input 2:

5
2 7 9 3 12

Example output 2:

12 2 7 9 3

Please remember, you may correct the cases, but your code always be revised!

[Exercise] Coding (C) - asked in Chapter 8: Arrays by (5.2k points)
ID: 34913 - Available when: 2017-11-30 18:00 - Due to: Unlimited

edited by | 5.8k views

56 Answers

0 like 0 dislike
Hidden content!
#include<stdio.h>
int main()
{
** ** * **** * ** * num,i,arrnum[100],a;
** ** ** ** * * * * * * a number of array
********* ***** * * * ** * ** *** ** *** * ** * * *

* ** ** *** **** *** ** * input numbers of array
*** ****** * * * * *** ****** ***
* * ***** *** ** ***
**** *** * * ***** * ** ** ** ** * * * *** ** * * * **** * * *
* ** ** **** * *
*** *** ** * * * * * * * array numbers
* * ** * * *** *** ** ** ** *** ***
    {
**** * * * *** * * ****** * ** * ** * * *
    }
** ** * **** Last number is going to be first
*** * * ** ** * ** ** * *** * ** *
* ** * * **** *** **** * * *
    {
** ** ** *** * **** ** *** * ***** * * ***
** * ** * * ** ** ** ** **** * *******
*** *** * ** ****** *** * ** ** ** * * * * * ******* ***** * *
** * * ** *** * * * ** ******* ** **
* ***** * * * *** ** ** ***** * * * *** * * *** * *
* **** * ** * ** ** * * **** **
* *** ** * * * ** *** ** ** *** ** * ** *** * * * * * ** ** ** * *** * %d",arrnum[a]);
** * * * * * * ** * * ** ** ** *** ***
    }

*** *** ** * * ** *** ***** 0;
}
answered by (-323 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
#include<stdio.h>
int main()
{
    int i,N,temp,a;
** * * ** *** ** * ** * * *** * **** * * *** *

    int c[N];
* * * * * ** * * *********** ** *
* ** ** * * * * *** ** *** ** * ***** * * ** * * * *
    }
** * * * * * * * * ** * ** ** ***
***** * * * * * * * *** * * ** ** * *
***** ** ****** * * * *** * ** ***** * * * * * * *
****** * * *** * ***** ** ****** * ** * *** ******
    }
* ** * **** * ***** ** * ** ** * *
* *** *** ** ** ** *** * * * **** **** * ** **
** **** * **** ** * ****** ** * * * * * **** ** ** * * ** * * * ** * ** *** * * **
* ** ** ** **** ***** ********* *
** * *** ** * ** * *** * * *** ** * * *
** *** * *** * ** *** *** *** **** ** ****** ***** * * * * * * ** * * * %d",c[a]);
* * *** * **** * **** **** *** ** * *** ** *****
    }
* * **** * ** *** 0;
}
answered by (54 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
#include <stdio.h>
int main()
{
* ** ** * *** *** * * * n,i;
**** * * * * * ** ** * * ***
* *** * **** **** * ** * a[n];
*** *** * * *** * * ** * **
**** ** ** ** *** *
* * *** ** * ** ** * * ** ** * ** ** ***** *** **** ****** ** **
    }
* ** ** * * ** * ** ** ** *** *****
* * * *** * * ** * ** * **** *
    {
* **** * * **** * ** * ** ** * * ***** **** *** * * ** %d",a[i]);
* ** **** **** * ***
* * * ***** ** * * * 0;
}
answered by (-196 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
#include <stdio.h>

int main()
{
* ** * ** ** *** * * *** c,b,e=0;
** ** * * * * * * * * ** ****** ** * **** ** **
** * **** ** ** ** * a[c];
* * * ** ** * * * ** ** * * * *
    {
* * * * * * * ** * * *** * * * * ** *** ***** * ****** * * ** * *
    }
* * * ***** * * *** * *** ** ***
    {
* * ** ** * ** ** * *** * * * *** *** * *
*** * *** *** ** **** ** * * * *
* *** * ** *** ** **** *** ** * ******* * **** ** * ** * ** * * ** * *** *
**** *** ** * * ** *** * ** ** ** * * * *** ** * * * *** * **
* ** * * **** ** * * * * ** ** ** **
* ** * * *** *** * * * * * * ***** * * ** **
* *** * ** *** ** * ****** ** ** ** ** ** * ** * ** ** **** *** ******* * ** **** %d",a[b]);
    }
* *********** * ** * ** 0;
}
answered by (-498 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
0 like 0 dislike
Hidden content!
#include<stdio.h>

int main(){
* *** * ** ** * ***** n, i;
* *** ** * ** ***** ** **
** * * * * * * * ** ** arr[n];
* * * *** * *** * * ** * **** ** * * *
** ** *** * ** *** ** * ** * *** * *** ** **** * * *** *
    }
* ** **** ** * * **** * * *** * * ",arr[n-1]);
* **** ** ******* ** * * * * *** *** * *
* * *** * * ** **** **** * ** * ** * * * **
***** ** **** *** ** **** ** * ****** *** * * * * * ** * ** * * ** * ** *** * ** * * *******
* *** ***** * ** ***** **** * * ** * *
**** ** * *********** ** *** **** * * * ** * *** * *** * * ",arr[i]);
    }

* *** * * ** * ** 0;
}
answered by (-116 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
#include <stdio.h>

int fib(int n);

int main(){

******** **** ** ** * * ** ****** ** **
* * *** * *** * * * ** **** * n;
** ** ** * * * * * * * ** * * * * * *
* * * * * * ** * *** * a[n];
** * * *** * * ****** * ** (int i=0;i<n;i++){
* ** * * * ******** ** ******* ****** * * * * * ** ** ** ** ***
**** * ** ** * * * *
* * ** * * **** *** ***** * ** **** * ** *
******* * * ** * **** * (int i=0;i<(n-1);i++){
** * * *** *** * * **** * ** * ** * * * ** ** ** * * %d",a[i]);
** * * * * **
}
answered by (52 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.69.58.154
©2016-2025

Related questions

0 like 0 dislike
55 answers
[Exercise] Coding (C) - asked Nov 29, 2017 in Chapter 8: Arrays by semicolon (5.2k points)
ID: 34968 - Available when: 2017-11-30 18:00 - Due to: Unlimited
| 6.4k views
0 like 0 dislike
46 answers
[Exercise] Coding (C) - asked Nov 29, 2017 in Chapter 9: Functions by semicolon (5.2k points)
ID: 34912 - Available when: 2017-12-14 18:00 - Due to: Unlimited
| 5k views
0 like 0 dislike
31 answers
[Exercise] Coding (C) - asked Dec 28, 2017 in Chapter 8: Arrays by semicolon (5.2k points)
ID: 39985 - Available when: Unlimited - Due to: Unlimited
| 4.9k views
0 like 0 dislike
102 answers
[Exercise] Coding (C) - asked Dec 28, 2017 in Chapter 8: Arrays by semicolon (5.2k points)
ID: 39984 - Available when: Unlimited - Due to: Unlimited
| 10.2k views
12,783 questions
183,443 answers
172,219 comments
4,824 users