11 solutions
- 1
Information
- ID
- 591
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 3
- Tags
- # Submissions
- 122
- Accepted
- 66
- Uploaded By
#include<bits/stdc++.h>
using namespace std;
bool a=true;
int main(){
if(a==true){
int x;
cin>>x;
a=false;
}
int a;
if(cin>>a){
main();
cout<<a<<" ";
}
return 0;
}
114514的作者
#include<bits/stdc++.h> using namespace std;
int a[105];
int main() { int n; cin >> n; for(int i = 1; i <= n; i++) cin >> a[i];
for(int i = n; i >= 1; i--)
cout << a[i] << " ";
cout << endl;
return 0;
}
#include<iostream>
using namespace std;
int a[100];
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
for(int i=n-1;i>=0;i--)cout<<a[i]<<" ";
}不能抄袭仅供本人使用
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv){
int n,a[105] = {0};
cin >> n;
for (int i = 0;i < n;i++){
cin >> a[i];
}
for (int i = n - 1;i >= 0;i--){
printf("%d ",a[i]);
}
return 0;
}
投机取巧的办法,但保证对,就是会被骂
#include<iostream>
using namespace std;
long n;
int main(){
cin>>n;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
for(int i=n-1;i>=0;i--) cout<<a[i]<<' ';
return 0;
}
这哪里投机取巧了?
这不是标准答案吗
#include<bits/stdc++.h>
using namespace std;
short n;
int l[105],num;
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>num;
l[i]=num;}
for(int i=n;i>=1;i--){
cout<<l[i]<<' ';}
return 0;
}
#include<iostream>
using namespace std;
const int MAXN=101;
int n,a[MAXN];
int main() {
cin>>n;
for(int i=0;i<n;++i)
{
cin>>a[i];
}
for(int j=n-1;j>=0;--j)
{
cout<<a[j]<<' ';
}
return 0;
}
#include<iostream>
using namespace std;
int n,a[101],m,s;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int j=n;j>=1;j--)
{
cout<<a[j]<<" ";
}
return 0;
}
#include<bits/stdc++.h> using namespace std;
int main(){ int a; cin>>a; int b[a]; for(int i=0;i<a;i++){ cin>>b[i]; } for(int i=a-1;i>=0;i--){ cout<<b[i]<<" "; } }
#include<bits/stdc++.h> using namespace std;
int main(){ int N; cin>>N; const int n=N; int a[n]; for(int i=0;i<n;i++){ cin>>a[i]; } for(int j=n-1;j>=0;j--){ cout<<a[j]<<" "; } return 0; }``
#include <iostream>
using namespace std;
int n,m,ans=0;
int main(){
cin>>n;
int a[n]={0};
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=n;i>=1;i--) cout<<a[i]<<" ";
return 0;
}
By signing up a ZXOJ universal account, you can submit code and join discussions in all online judging services provided by us.