factorial

问题 I'm working on a scorecard at work which has columns representing 4 possible outcomes, for example: Successful, unsuccessful, Exceptional, Other Each staff member is assessed 5 times in the month against those ratings. So 1 person might have 3 successful , 2 exceptional , 0 unsuccessful , 0 other . So the max instances of each outcome is 5 but the total sum of instances can't be more than 5. I could try to type out all the combinations (and get them wrong) - is there any function/formula/VBA

问题 private void button1_Click(object sender, EventArgs e) { String UserNumber = this.textBox1.Text; int NewUserNumber = Convert.ToInt32(UserNumber); int result = 0; int second = 0; while (NewUserNumber >= 1) { result = NewUserNumber * (NewUserNumber - 1); NewUserNumber--; } String i = Convert.ToString(result); this.textBox2.Text = i; } } While I understand this is homework for me, I am stuck. I really really don't want this solved, I want to do it myself. I don't understand why it's not working.

问题 I have permutation methods public void permute(String str) { permute(str.toCharArray(), 0, str.length() - 1); } private void permute(char[] str, int low, int high) { if (low == high) { writeIntoSet(new String(str, 0, length)); } else { for (int i = low; i <= high; i++) { char[] x = charArrayWithSwappedChars(str, low, i); permute(x, low + 1, high); } } } private char[] charArrayWithSwappedChars(char[] str, int a, int b) { char[] array = str.clone(); char c = array[a]; array[a] = array[b];

问题 Can someone please explain it to me? I wrote a function to calculate the factorial of a number like this in C#: public int factorial(int input) { if (input == 0 || input == 1) return 1; else { int temp = 1; for (int i = 1; i <= input; i++) temp = temp * i; return temp; } } But I found some C++ code (I don't really know any C++ btw) which finds a factorial using a recursive loop: int factorial(int number) { int temp; if(number <= 1) return 1; temp = number * factorial(number - 1); return temp;

问题 I am learning Java from a book, and come across a chapter regarding recursion using a factorial example. //A simple example of recursion package tutorials; class Factorial { // this is a recursive method int fact (int n) { int result; if(n==1) return 1; result = fact(n - 1) * n; return result; } } class Recursion { public static void main(String args[]) { Factorial f = new Factorial(); System.out.println("Factorial of 3 is " + f.fact(3)); System.out.println("Factorial of 4 is " + f.fact(4));

问题 I'm trying to write an algorithm to calculate the factorial of a number using recursive function. This is my code : #include <stdio.h> #include <conio.h> #include <iostream> using namespace std; int factorial(int n) { cin >> n; if (n == 1) return 1; return n*factorial(n - 1); } int main() { int n = 0; cout<<"Enter a number:"; cout << factorial(n); return 0; } It does nothing and I don't know why, it only lets me to give the number, but it's not calculating. 回答1: Inside the factorial function

问题 I would like to compute sums with factorials using symbolic algebra in python. The simplest version of the problem I can generate is the following one: from sympy.abc import j from math import factorial from sympy import summation summation(factorial(j), (j, 1, 4)) And I get the following error: Traceback (most recent call last): File "<stdin>", line 1, in <module> File "sympy/core/expr.py", line 194, in __int__ r = self.round(2) File "sympy/core/expr.py", line 3042, in round raise TypeError(

问题 I have been for some time writing a function which relies on many other to return an answer. When I finished it, it stated I had wrongly used the "*" somewhere. I went through everything and could not see a problem. I finally found that it was because of a simple factorial function earlier defined, as shown below: if n == 0: return 1 elif n < 0 or (type(float)): print "%s is an invalid input; Positive integer value is required" % (n) else: return (n)*fact(n-1) However if I enter n = 6, it

问题 say there is a function to calculate factorial(n) Does factorial(7) creates 7 function object for each of n from 1 to 7 and use those values when ever necessary (for factorial(8) as like factorial(7)*8) 回答1: It depends on the language and the language implementation. In many functional languages (e.g. Haskell), a function is guaranteed to change nothing; only to return a value. This lack of side effects allows the language to remember/cache, or "memoize", the results of function calls. In a

问题 I have used many recursive functions now but still have trouble getting my head around how such a function exactly works (i'm familiar with the second line (i.e. | n==0 = 1 ) but am not so familiar with the final line (i.e. | n>0 = fac (n-1) * n )). fac :: Int -> Int fac n | n==0 = 1 | n>0 = fac (n-1) * n 回答1: Recursive algorithms are very closely linked to mathematical induction. Perhaps studying one will help you better understand the other. You need to keep two key principles in mind when