{"id":17359692,"url":"https://github.com/robbypambudi/general_programming_in_c","last_synced_at":"2025-03-27T15:32:48.169Z","repository":{"id":134655645,"uuid":"419060815","full_name":"robbypambudi/General_Programming_In_C","owner":"robbypambudi","description":"This is my programing project with C Language to solve any problem  on internet","archived":false,"fork":false,"pushed_at":"2021-10-20T06:18:54.000Z","size":11,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-01T19:22:58.675Z","etag":null,"topics":["c","project"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/robbypambudi.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2021-10-19T19:14:34.000Z","updated_at":"2021-10-20T06:18:57.000Z","dependencies_parsed_at":null,"dependency_job_id":"efc51221-b8d0-4add-a23d-aef814a0f335","html_url":"https://github.com/robbypambudi/General_Programming_In_C","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/robbypambudi%2FGeneral_Programming_In_C","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/robbypambudi%2FGeneral_Programming_In_C/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/robbypambudi%2FGeneral_Programming_In_C/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/robbypambudi%2FGeneral_Programming_In_C/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/robbypambudi","download_url":"https://codeload.github.com/robbypambudi/General_Programming_In_C/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245872139,"owners_count":20686325,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["c","project"],"created_at":"2024-10-15T19:10:55.797Z","updated_at":"2025-03-27T15:32:48.119Z","avatar_url":"https://github.com/robbypambudi.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"Catatan Istimewa\n\n## Modulo\n\nSifat-sifat tersebut dapat dimanfaatkan untuk mempermudah perhitungan modulo. Sebagai contoh, Anda diberikan bilangan n dan k, lalu diminta menghitung hasil n! mod k. Pada contoh ini, n! Seandainya kita menghitung n! terlebih dahulu, kemudian baru dimodulo k, kemungkinan besar kita akan mendapatkan integer overflow. Ingat bahwa n! dapat bernilai sangat besar dan tidak dapat direpresentasikan dengan tipe data primitif integer.\n\n- (a + b) mod m = ((a mod m) + (b mod m)) mod m\n- (a - b) mod m = ((a mod m) - (b mod m)) mod m\n- (a * b) mod m = ((a mod m) * (b mod m)) mod m\n- a^b mod m     = (a mod m)^b mod m\n- (-a) mod m    = (-(a mod m) + m) mod m \n\n### 1. Menentukan Ganjil Genap\n- Dengan di modulo 2 akan menghasilkan 0 jika genap\n- 1 jika ganjil\n- \n---\n### 2. Menentukan Faktorisasi Prima\n\n---\n### 3. Membuat Bilangan Prima dengan mengimplementasikan Algoritma Sieve Of Eratost\n\u003cimg align=\"center\" width=600px height=600px alt=\"side_sticker\" src=\"https://upload.wikimedia.org/wikipedia/commons/b/b9/Sieve_of_Eratosthenes_animation.gif\"/\u003e\n\nSumber : \n- https://id.wikipedia.org/wiki/Tapis_Eratosthenes\n---\n\n### 4. Menentukan FPB dengan Algoritma Euclid \n\nSumber :\n- https://id.wikipedia.org/wiki/Algoritme_Euklides\n---\n\n### 5. Fibonaci Series\n\n\u003c\u003c\u003c\u003c\u003c\u003c\u003c HEAD\n- With recursive\n```\nFunction (int N)\n{\n    static int N1 = 0, N2 = 1, N3;\n\n    if (N \u003e 0)\n    {\n        N3 = N1 + N2;\n        N1 = N2;\n        N2 = N3;\n        printf(\"%d \", N3);\n        fibonaci(N - 1);\n    }\n}\n```\n- Without recursive\n```\nfor (int i = 2; i \u003c N; ++i)\n    {\n        N3 = N1 + N2;\n        printf(\"%d \", N3);\n        N1 = N2;\n        N2 = N3;\n    }\n```\n**What is Static Int ?** \u003cbr\u003e\nhttps://www.geeksforgeeks.org/static-variables-in-c/\n\n### Factorial \n- Factorial Using Loop\n```\nfor (int i = N; i \u003e 0; i--)\n    {\n        Fact *= i;\n    }\n```\nOutput\n```\nEnter Number : 5 \n5 4 3 2 1 \nFactorial is : 120\n``` \n\n- Factorial Using Recursive\n```\nFunction factorial(int number)\n{\n    if (number == 1)\n        return 1;\n    else\n    {\n        return (number * (factorial(number - 1)));\n    }\n}\n```\nOuput\n```\nnter The Number : 6\nResault Is : 720\n```\n---\n### Amstrong Number\nWhat is Amstrong Number ?\n```\n153 = (1*1*1) + (5*5*5) + (1*1*1)\n153 = 153\n\nIs Amstrong Number\n```\n---\n### Number Triangel\n```\nEnter The Range : 5\n    1\n   121\n  12321\n 1234321\n123454321\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frobbypambudi%2Fgeneral_programming_in_c","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frobbypambudi%2Fgeneral_programming_in_c","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frobbypambudi%2Fgeneral_programming_in_c/lists"}