0 like 0 dislike
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 | 8k views

56 Answers

0 like 0 dislike
Hidden content!
#include <stdio.h>
int main()
{
* * ** ********** ** ** b,c,d;
* * ** * * * *** ** * **** * ** **
****** * ***** * ** * *** a[100];
* * ** ** **** (b=0;b<c;b++)
* ** * * * * ****** *
**** * ** ***** * ** *** * ** *** * ** *** **** *** * * ** * ***
** * ***** *** *
*** * * **** ** ****** * *** ** * * * *****
** * *** * ** * ***** (b=0;b<(c-1);b++)
* * *** * **** * ***

* * * ** ** * * **** ** * *** ** * ** * * * * %d",a[b]);
*** * ** ***




}
answered by (-229 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=0;
**** * ***** **** * * *** i=0,l=0;
** ** * * ** ***** **** * * a[100];//先設一個陣列
* * * * * * * * * * ** * * * * ** * ******
** * * ** * *** ******* ** * ***
** ** * *** * ** ** * * * * ******* * * ** * * * * * ** ** * ** ** scanf i 會形成無限輸入,是i不是n
** * ** **** * *** ******
** * ***** *** *** * **** *
****** ** ** ** *** * * * * * **
* * ** * ****** **** * *** ** *
***** * * ** * ***** * * **** * *** * * * * *** ** ** %d",a[i]);
* ** * ** * ** ***** * *** *
}
answered by (-329 points)
edited by
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
** ** * * * *
int a[100];
int b[100];
int x,i,f,p,q;
int main(){
* *** * * ** * * * * **

** *** **
{
* * **** * * ** ***** * * **** * ** * ***** * *
** * ****** * * *

** *** *** *
{


* * * * *** * * * ***
**** ** * * * *
}
b[0]=a[x-1];

* * **** ** ****** * *
for ** ** * *
** * * ******

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

int size,i;
int temp;

int main(){
** ** * ** ** ** * ** * ** * ** ** * * ** *

** * * * * * * * ** input[size];

* * * ** ******* *** * **** * * ** *
* * ** * * *** * ** * *** * ** * ** **** *** * ** ** **
    }

* * *** * ** *** ** ** **
** * * ** ** * *** * * * * * * ** *** ****
* * *** ** * * * ** ** ***** ** ****** * ** * *
    }
** * * * *** * * * **** * **
* *** ** * * * ** * * **** ** * * * ******** *** * *
****** ** ** ** * ***** * ** * *** * * * * * ***** * ** * ** * ***** * * * ** * **
***** *** ** * * * **** * * * * * * * * * * **** * ** * * **** ** * * * ");}
* * **** ********** * *** * * **** * * * *** *

* * ** ** * * ** * * 0;
}
answered by (-286 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()
{
*** *** ** **** ***** a[999],n, i=3;
*** * * **** *** ** * *********** * &n);
* ***** **** * * **
* * ** ** ** * *** ** **
****** ** * ***** *** ** ** ** * ** ** ****** * %d * * ** ** **** ** * *
*** * ** ** *** * ** * ** * * * * * * ** ** *** * * %d %d",a[2],a[0],a[1]);
* * * ** **** * * **
** * ** ** * ** * *
* *** * * **** *
** * ** ** * ***** * ***** ***** * * ** * ** * %d %d * *** *** ** *** ** * * * * * **
* * * ** ** * ** ***** * * ** * * ** ** * * %d %d %d",a[3],a[0],a[1],a[2]);
******* * * * * *
** *** ****** ** **** * *
    {
* ** **** *** ******* *** *** * * * ** ** * * ** %d %d %d ** *** ** * ******* * *** ********* ** ** * *
* ** ** * **** * ** * * ** ** *** *** * * * %d %d %d %d",a[4],a[0],a[1],a[2],a[3]);
* ** ** ** * * * *
}
answered by (-255 points)
edited by
0 0
Case 0: Correct output
Case 1: Wrong output
Case 2: Correct output
Case 3: Correct output
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
** * * *** * *
int a[100];
int b[100];
int x,i,f,p,q;
int main(){
** ***** * * *** *

**** ***** ***
{
* *** * ** * * ** * * * * ** * * * * ** *
** ******* **** ***** ****

* ***** *
{


* * ** * *** * * ******
* * *** ** * * ** ** ***
}
b[x]=a[0];


for * *** ***
* ** *** *** * **
*** **** * * ** *
}
answered by (-336 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;
** * ** *** ****** * * **** * ** * *****
* * * * ** * * a[n];
* * * * * * ** *
****** * ******* ** *** ( i=0;i<n;i++)
* * * ** * ** * * ** ** **** * **** * ** *** ** * * **** *
**** * * * * ***** * * *** ** *** ** ** * ** ** ** * *

* ** ** *** ** ** * ( i=0;i<(n-1);i++)
**** ** * * **** * *** * * * *** * * ***** **** %d",a[i]);
*** * * * **** * ** ** * * * ** * ** ** * *** 0;
}
answered by (-304 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>
#include <stdlib.h>

int size,i;
int temp;

int main(){
****** * * *** ** ** ** ** **** *** *** ** *** ** * *

** ** ** *** * ****** input[size];

* * *** ** ** *** *** * ** ** ** *
** ** ** *** * * ** ****** ** ** **** *** * * ** ** * * *
    }
*** *** * * * *** ** * * * ** *** * * **
** * * **** * ** * * ** ** * ** ** ****** * *
***** * *** * * * ***** ** * *** * ** *
* *** **** ** * * * * * *** *** **** * * **** ***** **

*** * ** * ** ******** **** * ** ** ** ** ******* * %d)\n",input[i],input[size-i-1]);
    }

*** ** * * ** * * * *** *** **** ** ** ***** * ** * *
* ** *** * * ** * * * *** * ** * * ** * * **** *** * * *** * ** * * *** * *
*** ** ** * ** ** *** ** * *** * ** * ** * **** ** ** * * * * ** ***** * ** * * * ");}
* **** * *** *** * *** * ** ** * * **** *****

**** ** * ********** * ** * 0;
}
answered by (-286 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>
#include <stdlib.h>

int size,i;
int temp;

int main(){
* * * *** **** * * * * *** ** * * ** *** * ** * *

    int input[size];

*** * * **** * *** ** * * ** **
***** * * * ** * *** * * * **** * * * * *** **** *** * *** * ****** ** *
    }
* * *** * ** * ** *** ** * **
*** *** * ** * ** * * * * * * ** * * * **** ** **
* *** * * * *** ** *** *** ** * * *** ** *****
* * * * * ** * ** * ** * * *** **** ****** ****

* * ** * * ** *** * * * * * *** * * * ** **** **** * %d)\n",input[i],input[size-i-1]);
    }

** * ** ** * * **** *** ** ** *** ** * * *** * *
* ** * *** * * *** ** ***** * *** * *** ** * * ** **** * * ** * ** ** ** *
* ** *** *** * ** *** * * * *** ** * * * ***** * * * *** * *** ** ** *** ** * * ***
* * * * *** * * * ****** * * * **** ** **

** ** *** * **** ** 0;
}
answered by (-286 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 **** * ** **
#include * * * ****
#include **** * * *

int main()
{
** * * * ** * ** x;
**** ** ** ** * ** ** * ** * **
** * ** ** ** a[x],i;
** * **** ** * ** ** * = 0 ; i < x ; i++)
** ** ** ** ** * **** *** * *** *** * * ** * * * ** * * * * **

*** ** * * ** * ** * ** ** * * * **
* * *** ** **** * * = 0 ; i < x-1 ; i++)
* ** ** ** ** ** ** * ** * * *** * ** ** * *** *** * * *

* * * ** * * *** * * 0;
}
answered by (-255 points)
edited by
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
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.59.21
©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
| 8.6k 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
| 7.1k 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
| 6.7k 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
| 15k views
12,783 questions
183,442 answers
172,219 comments
4,824 users