1 条题解

  • 0
    @ 2025-2-9 11:45:38

    1

    #include <bits/stdc++.h>
    using namespace std;
    int n;
    int a[105];
    int main()
    {
        cin >> n;
        for (int i = 1; i <= n; i++)
            cin >> a[i];
    
        for (int i = n; i >= 1; i--)
            cout << a[i] << " ";
        return 0;
    }
    

    2

    #include <bits/stdc++.h>
    using namespace std;
    int n;
    int a[105];
    int main()
    {
        cin >> n;
        for (int i = 1; i <= n; i++)
            cin >> a[i];
    
        // 对应元素下标之和为 n+1
        for (int i = 1; i <= n / 2; i++)
            swap(a[i], a[n + 1 - i]);
    
        for (int i = 1; i <= n; i++)
            cout << a[i] << " ";
        return 0;
    }
    

    3

    #include <bits/stdc++.h>
    using namespace std;
    int n;
    int a[105];
    int main()
    {
        cin >> n;
        for (int i = 1; i <= n; i++)
            cin >> a[i];
    
        int i = 1, j = n;
        while (i < j)
        {
            swap(a[i], a[j]);
            i++;
            j--;
        }
        // for (int i = 1, j = n; i < j; i++, j--)
        //     swap(a[i], a[j]);
    
        for (int i = 1; i <= n; i++)
            cout << a[i] << " ";
        return 0;
    }
    

    4

    #include <bits/stdc++.h>
    using namespace std;
    int n;
    int a[105];
    int b[105];
    int main()
    {
        cin >> n;
        for (int i = 1; i <= n; i++)
            cin >> a[i];
    
        for (int i = 1; i <= n; i++)
            b[i] = a[n + 1 - i];
        for (int i = 1; i <= n; i++)
            a[i] = b[i];
    
        for (int i = 1; i <= n; i++)
            cout << a[i] << " ";
        return 0;
    }
    
    • 1

    信息

    ID
    325
    时间
    1000ms
    内存
    128MiB
    难度
    2
    标签
    (无)
    递交数
    152
    已通过
    99
    上传者