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

56 Answers

0 like 0 dislike
Hidden content!
#include<stdio.h>

int main()
{
*** *** * ** * number;
** ***** *** * ** array[10];
* * ** ** ** i;
*** * **** ** * *** ** j;

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

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

* ** **** * **** **** * ***** * ",array[number-1]);

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

*** * ****** * * * ** ** **** * ***** ** *** != array[number-2])
* *** *** ** **** * ** *** *** *
** ***** * * * **** * * **** * * ***** ** **** * ***** * ***** * * * * ");
**** ** ** ** * * * ** * ** ** ** * * * * *** *
    }

*** * * ** *** ** * * * * * 0;
}
answered by (-140 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()
{
*** ** * ** ********** b,c,d;
** * *** **** * * **** * ** * * * * * ** *
** * ** * * ** **** ** a[100];
* *** * * * *** * ** (b=0;b<c;b++)
* * ** * * ** ** * ** *
* * *** * * * ****** * *** ** *** * * ** * ** *** *** * * * ***
** * *** **** * * * *
* * ** ** * * ** ** * ** ** **** ** *
**** ********* * * (b=0;b<(c-1);b++)
******* ** * * *** ***

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




}
answered by (-66 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!
*** ** ** * * *
using namespace std;
 
int main()
{
******* ** * *** *** ***** A;
** * * * * * * ** * B[100];
* ** * *** ** ******* * C;

* ** ** * * * ** * >> A ;

* ****** ** * * = 0;
***** ** * * ** *** *** C < A)
** ********* * * **** * ******
*** **** * * * * *** ** ** ** * >> B[C];
* ******* * **** ** ** * * *** * * ** * = C+1;
* ** *** ** * * * * * *

* ** ***** ** * * * ** = A-1;
* ** ** ** * ** * ** ** C >= 0 )
** * * ** * * * ** ***
* **** ** ******** ** ** * *** * * ***** * ** * * * << B[C] ** * ** *** * ";
* * * *** ***** ** * *** *** ****** * * * * = C-1;
* * * **** *** *


** * **** ** *** ** * 0;
}
answered by (-66 points)
0 0
prog.c:1:19: fatal error: iostream: No such file or directory
 #include<iostream>
                   ^
compilation terminated.
0 like 0 dislike
Hidden content!
** ** * * * ** **
using namespace std;
 
int main()
{
*** * * * * * * * ** ** A;
***** * ***** * **** ** * B[100];
* **** * *** *** * * C;

* * * ** * * **** >> A ;

*** *** * ****** = 0;
* *** * **** **** C < A)
** * * **** * *
*** * *** **** * ** * ******** * ********** * ** ** >> B[C];
* * **** * * *** * * ** * * ** * **** = C+1;
* * * ** * * * ** **

* ** * ** *** * * ***** * * = A-1;
* * * ** * ** * ** * * C >= 0 )
* *** ***** ****
*** * * **** *** *** * ** ** * * * * * * * << B[C] ** * * * * ";
* *** *** ** * **** * * * * * ** * *** * = C-1;
** *** * * ***


***** * *** ** * ** *** **** ** 0;
}
answered by (-66 points)
0 0
prog.c:1:19: fatal error: iostream: No such file or directory
 #include<iostream>
                   ^
compilation terminated.
0 like 0 dislike
Hidden content!
*** * **
using namespace std;

int main()
{
* ** *** ** ** * * *** * * A;
* * *** ** * * * B[1];
** * ***** ** **** * * * C;

**** *** *** * *** * * >> A ;

***** * *** ** **** *** * = 0;
* ** * * ** ** ***** ** ** * C < A)
* *** **** * ** * * *
* ** **** *** * **** * *** * * ** * ** >> B[C];
* ** ****** * * ** ** ***** **** ** * ****** = C+1;
** ** * * ** ** **

**** ** * *** **** ** * = A-1;
*** * * *** * *** * * C >= 0 )
*** * * * ** * **** * *
*** * ** *** * ****** * * * * * ** * *** * << B[C] * ** * * * ";
* ** ** ****** ** ** * ***** * * * ***** ** = C-1;
* * ** ** * *** ****


* ** * *** *** *** * 0;
}
answered by (-66 points)
0 1
prog.c:1:19: fatal error: iostream: No such file or directory
 #include<iostream>
                   ^
compilation terminated.
0 like 0 dislike
Hidden content!
** * ** ** *** * *
int main (){
int a[10];
int * * *
** *** ** ** series of number: ** * ***
***** * * * *** * ***
** * ** * * * * your * * **
** *** *
* * *** * * * * * *
*** * *
* * *** ***
*** * *
* *
*** *** **** * *
** * ****** ** * *** **
return 0;
}
answered by (16 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 * * * **

void printArray(int arr[]);
void * ** *** arr[]);
int SIZE;

int main()
{
** *** * * * ******* * * i, N =1;

* * * ** * * ** ***** ***** * * * *
* * * *** ** ** ** *** * arr[SIZE];

* ** **** * * * *** ** * ** * i<SIZE; i++)
* * * * * * ** ** *
* ***** ***** ** ** *** * * ** * * ** * * ** * *** * * * ** * *
** * * *** ** ** * * *

***** **** * *** * * * = N % SIZE;

* * ** *** *** * * i<=N; i++)
*** * **** * * * *
** * * ** * ** ** ** ** * *** * **** ** ***
* * * * * ** ***** *
* ** *** ** * *** * * ** *

*** ** * *** * ** * * ** 0;
}

void * * arr[])
{
* ****** * * ** * i, last;

** **** ******* = arr[SIZE - 1];

** **** * ** * * ** * * ** ** * ** i>0; i--)
* ** * *** ******* *

* * * ***** ******* **** * * *** ******** = arr[i - 1];
* * * * ** * * * * * *****
* ** * * * ** **** * * = last;
}

void printArray(int arr[])
{
* *** ** ** ** *** * i;

** * * ** *** * * ***** * i<SIZE; i++)
* ** ** ** ** *** *** * ** *
*** * **** ** * * * * * * ** * ***** ** * *** * * * ", arr[i]);
*** ** ** * * *** ***
}
answered by (-168 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 ** ** *** *

void printArray(int arr[]);
void rotateByOne(int arr[]);
int SIZE;

int main()
{
* * * *** ** ** *** * i, N =1;

* * *** ** **** * * * ** ***** *** *** * * * **
* * *** ** *** arr[SIZE];

* ** *** ** *** * * * ** *** i<SIZE; i++)
** * * * ******* ***
** * * ** * * *** * **** * * ** ***** ** *** *** *** * * *
** ** * * *** *****

* * ** *** ***** * * **** = N % SIZE;

*** * ** * * **** * i<=N; i++)
* * ****** ** ** * *** * *
****** *** * * * *** ** ***** * *** ***
** ** ***** * **

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

**** *** * * *** ** * 0;
}

void ** * * arr[])
{
* *** ** * **** * * * i, last;

* * * ** *** * * = arr[SIZE - 1];

** * **** * * **** * * * i>0; i--)
*** *** ** **** *

* ******* *** * * ** * * * * * * ** = arr[i - 1];
*** * *** * ** * **
** * *** ** * * ** * = last;
}

void printArray(int arr[])
{
** * * **** * * * * * * i;

** * ******* * * ** * ** i<SIZE; i++)
** * * ** ** *****
* ** ** *** * * * * ** * **** * *** * ** * * ** * * ", arr[i]);
** * ****** * * * *
}
answered by (-168 points)
0 0
prog.c: In function 'main':
prog.c:26:12: warning: zero-length gnu_printf format string [-Wformat-zero-length]
     printf("");
            ^~
0 like 0 dislike
Hidden content!
#include<stdio.h>

int main()
{
*** * ** * *** * * * * number;
****** *** * * * * * * *** array[10];
******* ** * ** ** * i;
* ** ** ** * ** * * j;
** *** *****
** ** ** ** *** ***** *** **** * * * * * * *
    
** * * ** * *** * * * * * ** *
** **** **** ** * * * **
* **** * *** ***** * ** *** ** * * * * * ***** * * * ***
* **** * *** * ***
    
* * * * ** * *** ** *** ** ",array[number-1]);
    
* * * * * ** * **** * *** * * ** ** * *****
* **** * * **** * * **
* *** * *** **** * ** * * * * **** *** * * ** ** * * **
*** ** * **** ** ** * * ** * ** * ** ** *
* *** * *** * * * ** * ********* * * * * ** != array[number-2])
* **** * * * * * ** * *** * * * * * * *******
*** * * * * * * *** * * *** ** * * * ******* ** * * ** *** * * * * ** ");
**** ** ** * *** * * ** * *** * * ** * **
** * ** ****** **
    
** * * * ** **** * * 0;
}
answered by (-193 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()
{
** * * ** * ** * number;
* ** *** * ** * ***** array[10];
* *** * **** * * * * i;
* **** * ***** * * * ** j;
    
** * ** * * * * **** ** * ** * ****** * * *
    
* ** *** *** ** * * *** * ** * * * * *
* ** * *** * * * *
* ** * * ** ****** * *** * ** * ** * * * ****** ** * *** ** ** **
* ** ** *** ** * *
    
** ** ** * * **** * * * ******
** ** * *** * * *
*** ***** * * *** *** ** *** * * * * **** *** ** * * ****
** * * ** ***** ** * *** ** * * ***** * ** *
* ******** *** * ** *** * ***** ***** * != array[0])
* * ****** * * * ** * * * ** *** **
* * * *** * * * *** *** * * * *** ** * ******* * ** * * * ** * * ****** * ");
* * * ****** * *** * ** * * *** *
* *** * * ** * ** **
    
*** ** * ** * *** * ** 0;
}
answered by (-193 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:108.162.216.251
©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
| 10.5k 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
| 8.9k 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
| 8.4k 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
| 19.1k views
12,783 questions
183,442 answers
172,219 comments
4,824 users