Before seeing the solution make sure that you tried enough. Don’t paste the whole code, just find out the logic. If you stuck in trouble, just inform me on comment.
/**Bismillahir Rahmanir Rahim.**/ #include <stdio.h> int main() { long long int a,n; scanf("%lld", &n); a=(n*(n-3))/2; printf("%lld\n",a); return 0; }
how do you get this relation??
ReplyDeletehttps://en.wikipedia.org/wiki/Complete_graph
Deletefor determining the edge in a complete bipartile graph is (n*(n-1))/2 with bordrer edge; for kites the solution will be without border edge ((n*(n-1))/2)-n here n is the number of vertices...
lodu aadmi
ReplyDelete