Skip to content
Programmingoneonone
Programmingoneonone
  • Home
  • CS Subjects
    • Internet of Things (IoT)
    • Digital Communication
    • Human Values
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
  • HackerRank Solutions
    • HackerRank Algorithms Solutions
    • HackerRank C problems solutions
    • HackerRank C++ problems solutions
    • HackerRank Java problems solutions
    • HackerRank Python problems solutions
Programmingoneonone

HackerEarth Number of cycles problem solution

YASH PAL, 31 July 2024
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

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';
}
}
coding problems solutions

Post navigation

Previous post
Next post

Pages

  • About US
  • Contact US
  • Privacy Policy

Programing Practice

  • C Programs
  • java Programs

HackerRank Solutions

  • C
  • C++
  • Java
  • Python
  • Algorithm

Other

  • Leetcode Solutions
  • Interview Preparation

Programming Tutorials

  • DSA
  • C

CS Subjects

  • Digital Communication
  • Human Values
  • Internet Of Things
  • YouTube
  • LinkedIn
  • Facebook
  • Pinterest
  • Instagram
©2025 Programmingoneonone | WordPress Theme by SuperbThemes