Advertisement
Guest User

Untitled

a guest
Nov 20th, 2019
118
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 3.75 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <string.h>
  3. #include <ctype.h>
  4.  
  5. int count_whites(const char string[]);
  6. void string_to_upper(char string[]);
  7. int div_by_3(const int num);
  8. int same_case(const char a, const char b);
  9. int leap_year(const int year);
  10. int is_white(const char c);
  11. int guess_eval(const int guess, const int my_number);
  12. void change_whites(char string[]);
  13. int is_in_array(const int num, const int size, const int array[]);
  14. int is_prime(const int num);
  15. int karel_fok(const int num);
  16.  
  17. int main() {
  18.  
  19. //printf("%d\n", count_whites("HELLO APA\n"));
  20. // 3
  21. //char string[] = "Hello, syopon a anyadpicsajat";
  22. //string_to_upper(string);
  23. //printf("%s\n", string);
  24.  
  25. //printf("%d\n", div_by_3(4));
  26.  
  27. //printf("%d\n", same_case('A','f'));
  28.  
  29. //printf("%d\n", is_white('\t'));
  30.  
  31. //printf("%d\n", leap_year(3004));
  32. //printf("%d\n", guess_eval(22,22));
  33. /*char str[] = "Hello anyad picsaja.";
  34. change_whites(str);
  35. printf("%s\n", str);*/
  36.  
  37. /*int array[3] = {400,300,304};
  38. printf("%d %d\n", is_in_array(200,3,array), is_in_array(304,3,array));*/
  39.  
  40. //printf("%d %d", is_prime(31), is_prime(33));
  41.  
  42. printf("%d\n", karel_fok(2430));
  43.  
  44. return 0;
  45. }
  46.  
  47. int is_white(const char c) {
  48. if (c ==' ' || c =='\n' || c =='\t') {
  49. return 1;
  50. }
  51. return 0;
  52. }
  53.  
  54. int same_case(const char a, const char b) {
  55. if (isupper(a) && isupper(b)) {
  56. return 1;
  57. }
  58.  
  59. if (islower(a) && islower(b)) {
  60. return 1;
  61. }
  62.  
  63. if (isalpha(a) == 0 || isalpha(b) == 0) {
  64. return -1;
  65. }
  66. return 0;
  67. }
  68.  
  69. int div_by_3(const int num) {
  70. if ( num % 3 == 0) {
  71. return 1;
  72. } else {
  73. return 0;
  74. }
  75. }
  76.  
  77. void string_to_upper(char string[]) {
  78.  
  79.  
  80. if (string == NULL) {
  81. return;
  82. }
  83.  
  84. for (int i = 0; i < strlen(string); i++) {
  85. string[i] = toupper(string[i]);
  86. }
  87. }
  88.  
  89.  
  90.  
  91.  
  92. int count_whites(const char string[]) {
  93. if (string == NULL) {
  94. return -1;
  95. }
  96. int k = 0;
  97.  
  98. int hossz = strlen(string);
  99.  
  100. for (int i = 0; i < hossz; i++) {
  101. if (string[i] ==' ' || string[i] =='\n' || string[i] =='\t') {
  102. k++;
  103. }
  104. }
  105. return k;
  106. }
  107.  
  108. int leap_year(const int year) {
  109. if (year % 4 == 0 && year % 100 != 0 && year % 400 != 0) {
  110. return 1;
  111. }
  112. if (year % 4 == 0 && year % 100 == 0 && year % 400 != 0) {
  113. return 0;
  114. }
  115. if (year % 4 == 0 && year % 100 == 0 && year % 400 == 0) {
  116. return 1;
  117. }
  118. return 0;
  119. }
  120.  
  121. int guess_eval(const int guess, const int my_number) {
  122. if (guess == my_number) {
  123. return 1;
  124. }
  125.  
  126. if (guess > my_number) {
  127. return 0;
  128. }
  129.  
  130. if (guess < my_number) {
  131. return 2;
  132. }
  133. return 0;
  134. }
  135.  
  136. void change_whites(char string[]) {
  137. for (int i = 0; i < strlen(string); i++) {
  138. if (string[i] ==' ' || string[i] =='\n' || string[i] =='\t') {
  139. string[i] = '.';
  140. }
  141. }
  142.  
  143. }
  144.  
  145. int is_in_array(const int num, const int size, const int array[]) {
  146. int found = 0;
  147.  
  148. if (array == NULL) {
  149. return -1;
  150. }
  151.  
  152. for (int i = 0; i < size; i++) {
  153. if (array[i] == num ) {
  154. found = 1;
  155. }
  156.  
  157. }
  158. return found;
  159. }
  160.  
  161. int is_prime(const int num) {
  162.  
  163. int j = 0;
  164.  
  165. for (int i = 1; i < num + 1; i++) {
  166. if ( num % i == 0) {
  167. j++;
  168. }
  169.  
  170. }
  171. //printf("%d", j);
  172.  
  173. int k = 0;
  174.  
  175. if ( j == 2) {
  176. k = 1;
  177. }
  178.  
  179. return k;
  180. }
  181.  
  182. int karel_fok(const int num) {
  183. int fok = num;
  184. if (fok % 90 != 0 || fok < 0) {
  185. return -1;
  186. }
  187.  
  188. while (fok >= 360) {
  189. fok -= 360;
  190. }
  191.  
  192.  
  193. return fok;
  194.  
  195. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement