HackerEarth Number of cycles problem solution

In this HackerEarth Number of cycles problem solution, you are given an N-sided regular polygon. You have connected the center of the polygon with all the vertices, thus dividing the polygon into N equal parts. your task is to find the count of simple cycles that exist in the modified structure of the polygon.

HackerEarth Number of cycles problem solution.

#include<bits/stdc++.h>
#define ll long long int
using namespace std;

int main(){
    int q;
    cin>>q;

    while(q)
    {
        ll n;
        cin>>n;
        n++;
        ll ans = n*n - 3*n + 3;
        cout<<ans<<endl;
    }
}

 

second solution

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int maxn = 1e5 + 14;

int t;
int main(){
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> t;
    while(t--){
        int n;
        cin >> n;
        cout << (ll) n * (n - 1) + 1 << '\n';
    }
}