1 solutions
-
0
C :
#include <stdio.h> void main(void) { int a[100], i, N; scanf("%d", &N); for (i = 0; i < N; i++) scanf("%d", &a[i]); for (i = 0; i < N; i++) { printf("%d", a[i]); if (i < N - 1) printf(" "); } printf("\n"); for (i = N; i > 0; i--) { printf("%d", a[i - 1]); if (i >1) printf(" "); } printf("\n"); }C++ :
#include<iostream> using namespace std; int main() { int a,b,c,d,e,f; a=1; b=2; c=3; d=4; e=5; f=6; cout<<a<<" "<<b<<" "<<c<<" "<<d<<" "<<e<<" "<<f<<endl; cout<<f<<" "<<e<<" "<<d<<" "<<c<<" "<<b<<" "<<a<<endl; }Pascal :
var a:array[1..100] of longint; n,i,j:integer; begin readln(n); for i:=1 to n do begin read(a[i]); if i=1 then write(a[i]) else write(a[i]:2); end; writeln; for j:=n downto 1 do if j=n then write(a[j]) else write(a[j]:2); end.
- 1
Information
- ID
- 16371
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By