We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. C++
  3. Introduction
  4. Arrays Introduction
  5. Discussions

Arrays Introduction

Sort by

recency

|

1355 Discussions

|

  • caohongphuc912
     + 0 comments
    #include<bits/stdc++.h>
using namespace std;

int main()
{
    int n=0;
    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;
}

  • chinmaybhagatb
     + 0 comments
    #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    int n;
    cin>>n;
    vector <int> v(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i];                // input elements
    }
    
    reverse(v.begin(),v.end());
    for (int i = 0; i < n; i++) {
        cout << v[i] << " ";
    }
    return 0;
}

  • Veratris
     + 0 comments

    Here is my solution to this without using pointers:

    int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */ 
    int size;
    cin >> size;
    int nums[size];
    for (int i = size - 1; i >= 0; i--) {
        cin >> nums[i];
    }
    for (int j = 0; j < size; j++){
        cout << nums[j] << " ";
    }
    
     
    return 0;
}

  • www_abishekmann1
     + 0 comments

    include iostream

    int main() { int n; std::cin>>n; const int SIZE = n; int numbers[SIZE]; 

    for (int i = 0; i < n; ++i) {
    std::cin >> numbers[i]; 
}
for (int i=0; i<n/2 ; ++i){
    int temp =numbers[i];
    numbers[i]=numbers[n-1-i];
    numbers[n-1-i]=temp;
}
for(int i= 0; i< n; ++i){
    std::cout<<numbers[i]<<" ";
}


return 0;

    }

  • nayem_099
     + 0 comments

    include

    include

    include

    include

    include

    using namespace std;

    int main() { /* Enter your code here. Read input from STDIN. Print output to STDOUT */ 

      int n;

cin >> n;

int integers[n];

for (int i = 0; i < n; i++) {
    cin >> integers[i];
}
// For Reverse Interger..
for (int i = n-1; i >= 0; i--) {
    printf("%d ", integers[i]);
}

return 0;

    }