[编程题]Zero-complexity Transposition
- 热度指数：12805 时间限制：C/C++ 1秒，其他语言2秒 空间限制：C/C++ 64M，其他语言128M
- 算法知识视频讲解
You are given a sequence of integer numbers. Zero-complexity transposition of the sequence is the reverse of this sequence. Your task is to write a program that prints zero-complexity transposition of the given sequence.
输入描述:
For each case, the first line of the input file contains one integer n-length of the sequence (0 ＜ n ≤ 10 000). The second line contains n integers numbers-a1, a2, …, an (-1 000 000 000 000 000 ≤ ai ≤ 1 000 000 000 000 000).
输出描述:
For each case, on the first line of the output file print the sequence in the reverse order.
示例1
输入
5 -3 4 6 -8 9
输出
9 -8 6 4 -3
#include<iostream>
#include<cstdio>
#include<stack>
using namespace std;
int main()
{
int n;
stack<long long> seque
展开全文
n = input()
print(' '.join(input().split()[::-1]))
import java.util.Scanner;
import java.util.Stack;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(Sy
展开全文
#include<iostream>
const int MAX_SIZE = 10000;
class Stack
{
private:
long long int data[MAX_SIZE];
int top=-1;
public:
展开全文
#include <iostream>
using namespace std;
int main() {
int num,i;
cin >> num;
int* stack = new int[num];
for(i = 0;i <
展开全文
#借用栈的思想，但要注意题目要求用long long类型，不过这道题用int也能对#include "stdio.h"#include "stack"usingnamespacestd;intmain(){intn;longlongtemp;stack<longlong&g
展开全文
#include <iostream>
#include <stack>
#include <cstdio>
using namespace std;
//大数要用lld
int main() {
int n;
stack<long lon
展开全文
#include <iostream>
#include <cstdio>
#include <stack>
using namespace std;
stack<long long> Num;
int main(){
int n;
展开全文
while True:
try:
n = int(input())
s = list(map(int,input().split()))
for i in s[::-1]:
print(i,end=' ')
ex
展开全文
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
vector<long long> l;
int main() {
int counte
展开全文
问题信息
难度：
55条回答
40收藏
4944浏览
通过挑战的用户
查看代码-
2023-03-14 18:15:15
-
2023-03-14 16:17:14 -
2023-03-14 13:20:50 -
2023-03-13 11:38:20
-
2023-03-12 12:04:54
相关试题
-
扫描二维码，关注牛客网
- 意见反馈
-
下载牛客APP，随时随地刷题
扫一扫，把题目装进口袋
- 求职之前，先上牛客
-
扫描二维码，进入QQ群
扫描二维码，关注牛客公众号
- 公司地址：北京市朝阳区北苑路北美国际商务中心K1座一层-北京牛客科技有限公司
- 联系方式：010-60728802 投诉举报电话：010-57596212（朝阳人力社保局）
- 牛客科技© All rights reserved admin@nowcoder.com
- 京ICP备14055008号-4 增值电信业务经营许可证 营业执照 人力资源服务许可证
-
京公网安备
11010502036488号
