We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Mathematics
  3. Fundamentals
  4. Handshake
  5. Discussions

Handshake

Sort by

recency

|

333 Discussions

|

  • mohamedhari317
     + 0 comments
    def handshake(n):
    return int(n*(n-1)/2)

  • SVVBathini_w
     + 0 comments

    For Python3 Platform

    Mathematics Logic - Using combinations. Here it is nc2 = n*(n-1)/2

    I wrote the code from scratch just to get more practice 
    def handshakes(n):
    return (n*(n-1))//2

t = int(input())
for i in range(t):
    n = int(input())
    
    result = handshakes(n)
    
    print(result)

  • polovnikov_k_v
     + 1 comment

    Code belove or above most likly will give an error.

    Coz Test Case will force you to cast answer to int before return

  • ali313xA
     + 0 comments

    BRO! Its just a simple Combination Formula for C(N, 2) = N! / 2( N - 2)! = N ( N -1 )/2

    int handshakes(int n) {
    return n * (n - 1) / 2;
}

    You nailed it, happy coding 😍

  • nugrahanggara016
     + 1 comment

    Java 15

        public static int handshake(int n) {
        if (n < 2) {
            return 0;
        }
        return (n * (n - 1)) / 2;
    }