Advertisement
Guest User

Borce

a guest
Nov 26th, 2014
153
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.03 KB | None | 0 0
  1. 1.
  2. #include <stdio.h>
  3. int double_fact(int n) {
  4. if (n == 0)
  5. return 1;
  6. else if (n == 1)
  7. return 1;
  8. else
  9. return(n*double_fact(n-2));
  10. }
  11. int main(){
  12. int n;
  13. scanf("%d", &n);
  14. printf("%d", double_fact(n));
  15. return 0;
  16. }
  17.  
  18. 2.
  19. #include <stdio.h>
  20. int getProizvod(int num, int step)
  21. {
  22. int sum = 1;
  23. if (step >= num)
  24. return sum;
  25. else
  26. {
  27. sum *= (num/step)%10;
  28. return sum * getProizvod(num, step*=10);
  29. }
  30. }
  31. int main()
  32. {
  33. int n;
  34. scanf("%d", &n);
  35. int proizvod = getProizvod(n, 1);
  36. printf("%.2f", (double)proizvod/(double)n);
  37. return 0;
  38. }
  39.  
  40. 3.
  41. #include <stdio.h>
  42. int getSuma(int num, int step)
  43. {
  44. int sum = num/step;
  45. if (sum < 100)
  46. return sum;
  47. else
  48. {
  49. sum %= 100;
  50. return sum+getSuma(num, step*=10);
  51. }
  52. }
  53. int main()
  54. {
  55. int n; scanf("%d", &n);
  56. printf("%d", getSuma(n, 1));
  57. return 0;
  58. }
  59.  
  60. 4.
  61. #include <stdio.h>
  62. void izmini_rek(int a[], int n){
  63. if (n!=0)
  64. {
  65. printf("%d ", a[--n]);
  66. izmini_rek(a, n);
  67. }
  68. }
  69. int main() {
  70. int a[100], i, n;
  71. scanf("%d",&n);
  72. for (i=0;i<n;i++){
  73. scanf("%d",&a[i]);
  74. }
  75. izmini_rek(a,n);
  76. return 0;
  77. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement