Решения на задачите за домашна от лекцията за Цикли

Ето решенията ми на задачите от оследната лекция от Част 1 за програмиране на C# – Цикли.

Условията:
1. Write a program that prints all the numbers from 1 to N.
2. Write a program that prints all the numbers from 1 to N, that are not divisible by 3 and 7 at the same time.
3. Write a program that reads from the console a sequence of N integer numbers and returns the minimal and maximal of them.
4. Write a program that calculates N!/K! for given N and K (1<N<K).
5. Write a program that calculates N!*K! / (K-N)! for given N and K (1<N<K).
6. Write a program that, for a given two integer numbers N and X, calculates the sum S = 1 + 1!/X + 2!/X2 + … + N!/XN
7. Write a program that reads a number N and calculates the sum of the first N members of the sequence of Fibonacci: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, …
Each member of the Fibonacci sequence (except the first two) is a sum of the previous two members.
8. Write a program that calculates the greatest common divisor (GCD) of given two numbers. Use the Euclidean algorithm (find it in Internet).
9. In the combinatorial mathematics, the Catalan numbers are calculated by the following formula:

Write a program to calculate the Nth Catalan number by given N.
10. Write a program that prints all possible cards from a standard deck of 52 cards (without jokers). The cards should be printed with their English names. Use nested for loops and switch-case.
11. Write a program that reads from the console a positive integer number N (N < 20) and outputs a matrix like the following:
N = 3 | N = 4
1 2 3 | 1 2 3 4
2 3 4 | 2 3 4 5
3 4 5 | 3 4 5 6
| 4 5 6 7
12. * Write a program1 that calculates for given N how many trailing zeros present at the end of the number N!. Examples:
N = 10  N! = 3628800  2
N = 20  N! = 2432902008176640000  4
Does your program work for N = 50 000?
Hint: The trailing zeros in N! are equal to the number of its prime divisors of value 5. Think why!
13. * Write a program that reads a positive integer number N (N < 20) from console and outputs in the console the numbers 1 … N numbers arranged as a spiral.
Example for N = 4
1 2 3 4
12 13 14 5
11 16 15 6
10 9 8 7

Ето линк към решенията:


П.С. Задачите с факториел стават доста лесни ако изнесете логиката в метод 🙂

Advertisements

3 thoughts on “Решения на задачите за домашна от лекцията за Цикли

  1. Здравей,

    Интересно ми е за задача 4 и 5 от темата цикли как си я направил с методи, ако може да обесниш логиката?
    Благодяря!
    Поздрави,
    Румен

    • Просто си правиш метод, който изчислява факториел и връща сумата му и в Main() Метода просто си го извикваш с параметрите n и k.

      Примерно:

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s