Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Maximum points of intersection n circles in C++
In this tutorial, we will be discussing a program to find maximum points of intersection n circles
For this we will be provided with the number of circles. Our task is to find the maximum number of intersections the given number of circles meet.
Example
#include <bits/stdc++.h>
using namespace std;
//returning maximum intersections
int intersection(int n) {
return n * (n - 1);
}
int main() {
cout << intersection(3) << endl;
return 0;
}Output
6
Updated on: 09-Sep-2020
95 Views
Advertisements