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. Security
  3. Terminology and Concepts
  4. Security Encryption Scheme
  5. Discussions

Security Encryption Scheme

Sort by

recency

|

16 Discussions

|

  • folio9
     + 0 comments

    To solve this, count the total bijections from set M to C, which is simply n! (factorial of n). For more updates or help with social services, visit SRD SASSA Check Status to stay informed and supported.

  • cafelatte
     + 0 comments

    (inventing the weel?)
    Python: 

    print(__import__('math').factorial(int(input())) )

  • petes40
     + 0 comments

    Non-recursive python solution...

    n = int(input())

fact = 1
while n > 1:
    fact *= n
    n -= 1

print(fact)

  • d3lvx
     + 0 comments
    def factorial(x):
    if x == 1:
        return 1
    else:
        return x * factorial(x-1)
        
print(factorial(int(input())))

  • tpgreene
     + 0 comments
    #include<iostream>

int factorial(int n){
    if(n==1){return n;}
    return factorial(n-1)*n;
}

int main(){
    int n;
    std::cin>>n;
    std::cout<<factorial(n);
    return 0;
}