repo stringlengths 4 140 | commit_id stringlengths 7 7 | rel_path stringlengths 1 3.5k | language stringclasses 37
values | url stringlengths 37 3.56k | raw_url stringlengths 54 3.58k | key stringlengths 20 3.54k | ok bool 1
class | status int64 200 200 | bytes int64 48 425k | content stringlengths 40 425k | worker_id int64 0 7 |
|---|---|---|---|---|---|---|---|---|---|---|---|
driyanti/3DNear | c359534 | bounds1.h | C | www.github.com/driyanti/3DNear/tree/main/bounds1.h | https://raw.githubusercontent.com/driyanti/3DNear/c359534/bounds1.h | driyanti/3DNear c359534 bounds1.h | true | 200 | 1,676 |
integer ndim,mlog,ns,slog,ypos,xpos,nf
double precision h,r1,r2,c01,c11,t,xs,ys,zs,z,zps,delta,cdm
double precision zps1,drx
parameter (ndim=256,mlog=8,ns=256,slog=8,r1=2500d0,drx=1d0)
parameter (r2=2500d0,c01=400d0,c11=600d0,t=6.28d0,h=5d0)
parameter (xs... | 7 |
SmoothSwoosh/op_sys_prac | 9c67fed | Contest_2/2_6.c | C | www.github.com/SmoothSwoosh/op_sys_prac/tree/main/Contest_2/2_6.c | https://raw.githubusercontent.com/SmoothSwoosh/op_sys_prac/9c67fed/Contest_2/2_6.c | SmoothSwoosh/op_sys_prac 9c67fed Contest_2/2_6.c | true | 200 | 1,738 | ANSWERS
***Answer 29:
1. Возвращаемое значение функции main не int
2. с == a + b - выражение без "эффекта"
3. Нет #include <stdio.h>, поэтому получаются неявные объявления scanf и printf
4. Формат %d в scanf требует аргумент типа int *, но аргумент 2 имеет тип int
5. Переменные a и c неинициализированы в scanf и ... | 4 |
Emerson-Vitor/VERSIONADOR_C | 648867a | src/versionador.c | C | www.github.com/Emerson-Vitor/VERSIONADOR_C/tree/main/src/versionador.c | https://raw.githubusercontent.com/Emerson-Vitor/VERSIONADOR_C/648867a/src/versionador.c | Emerson-Vitor/VERSIONADOR_C 648867a src/versionador.c | true | 200 | 5,749 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include "commands/commands.h"
#include "utils/utils.h"
#include "database/database.h"
#include "utils/lista.h"
// Protótipos das funções
void iniciar();
void adiciona(int argc, char *argv[]);
void registra(char *texto);
void exibirlog();
voi... | 6 |
Atusiimire/alx-low_level_programming | f7f1142 | 0x13-more_singly_linked_lists/7-get_nodeint.c | C | www.github.com/Atusiimire/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/7-get_nodeint.c | https://raw.githubusercontent.com/Atusiimire/alx-low_level_programming/f7f1142/0x13-more_singly_linked_lists/7-get_nodeint.c | Atusiimire/alx-low_level_programming f7f1142 0x13-more_singly_linked_lists/7-get_nodeint.c | true | 200 | 453 | #include "lists.h"
/**
* * get_nodeint_at_index - returns the nth node of a listint_t linked list.
* @head: pointer to the first node in the list
* @index: index of the node to return
* Return: pointer to the indexed node
*/
listint_t *get_nodeint_at_index(listint_t *head, unsigned int index)
{
unsigned int i;
i... | 2 |
kpatsakis/primevul5 | 87b7605 | 26114.c | C | www.github.com/kpatsakis/primevul5/tree/main/26114.c | https://raw.githubusercontent.com/kpatsakis/primevul5/87b7605/26114.c | kpatsakis/primevul5 87b7605 26114.c | true | 200 | 23,284 | static int MOD_EXP_CTIME_COPY_TO_PREBUF(const BIGNUM *b, int top,
unsigned char *buf, int idx,
int width)
{
size_t i, j;
if (top > b->top)
top = b->top; /* this works because 'buf' is explicitly
... | 7 |
calmsacibis995/cde-src | 1baf4b1 | cde/lib1/DtSvc/DtUtil2/DtP.h | C | www.github.com/calmsacibis995/cde-src/tree/main/cde/lib1/DtSvc/DtUtil2/DtP.h | https://raw.githubusercontent.com/calmsacibis995/cde-src/1baf4b1/cde/lib1/DtSvc/DtUtil2/DtP.h | calmsacibis995/cde-src 1baf4b1 cde/lib1/DtSvc/DtUtil2/DtP.h | true | 200 | 6,767 | /*
* File: DtP.h $XConsortium: DtP.h /main/cde1_maint/1 1995/07/14 20:32:23 drk $
* Language: C
*
* (c) Copyright 1990, Hewlett-Packard Company, all rights reserved.
*
* (c) Copyright 1993, 1994 Hewlett-Packard Company *
* (c) Copyright 1993, 1994 International Business Machines Corp. *
* (c) Copy... | 6 |
daffafairuz/AlproA2_24060122140044 | ea4a292 | Praktikum4/SimetriTabel.c | C | www.github.com/daffafairuz/AlproA2_24060122140044/tree/main/Praktikum4/SimetriTabel.c | https://raw.githubusercontent.com/daffafairuz/AlproA2_24060122140044/ea4a292/Praktikum4/SimetriTabel.c | daffafairuz/AlproA2_24060122140044 ea4a292 Praktikum4/SimetriTabel.c | true | 200 | 1,178 | //nama file : SimetriTabel
// Deskrpsi : menentukan apakah dua tabel simetri atau tidak
// nama : Daffa Faruz Annizari
// NIM : 24060122140044
// tanggal : 13 maret 2023
#include <stdio.h>
#include <stdlib.h>
int SimetriTabel(){
// kamus lokal
int *T1 ;
int *T2 ;
int N1 ;
int... | 4 |
300n/Realistic-water-simulation | 8ffdf06 | TIPE.c | C | www.github.com/300n/Realistic-water-simulation/tree/main/TIPE.c | https://raw.githubusercontent.com/300n/Realistic-water-simulation/8ffdf06/TIPE.c | 300n/Realistic-water-simulation 8ffdf06 TIPE.c | true | 200 | 48,116 | #include "Get_stat.h"
char texte[100];
double dt;
double mu_eau = 0.0001;
double p0 = 0.5; // base density
Uint32 last_time;
Uint32 current_time;
double fq;
double fqq;
bool isPaused = false;
bool Processing = false;
bool inputing = false;
bool full_screen = false;
bool help = false;
bool drawing_obstacles = false;
... | 2 |
theinfinull/Ds-repository | 1eb10bc | 11a_max_heap.c | C | www.github.com/theinfinull/Ds-repository/tree/main/11a_max_heap.c | https://raw.githubusercontent.com/theinfinull/Ds-repository/1eb10bc/11a_max_heap.c | theinfinull/Ds-repository 1eb10bc 11a_max_heap.c | true | 200 | 2,005 | #include <stdio.h>
#include <stdlib.h>
int heap[20], i, val, parent, child, size = 0;
void display()
{
printf("TREE >> ");
if (size == 0)
{
printf(" EMPTY ");
}
else
{
for (i = 1; i <= size; i++)
{
printf("-> %d", heap[i]);
}
}
}
void swap(int a, i... | 7 |
wyfroom/BLDC_LiuBu_KaiHuan_hall | df2e3cb | CSDN_BLDC_LBHX/Core/Inc/main.h | C | www.github.com/wyfroom/BLDC_LiuBu_KaiHuan_hall/tree/main/CSDN_BLDC_LBHX/Core/Inc/main.h | https://raw.githubusercontent.com/wyfroom/BLDC_LiuBu_KaiHuan_hall/df2e3cb/CSDN_BLDC_LBHX/Core/Inc/main.h | wyfroom/BLDC_LiuBu_KaiHuan_hall df2e3cb CSDN_BLDC_LBHX/Core/Inc/main.h | true | 200 | 2,462 | /* USER CODE BEGIN Header */
/**
******************************************************************************
* @file : main.h
* @brief : Header for main.c file.
* This file contains the common defines of the application.
*************************************************... | 6 |
uberphoebus/hundred-c | 4873b69 | a070_PasswordChecker.c | C | www.github.com/uberphoebus/hundred-c/tree/main/a070_PasswordChecker.c | https://raw.githubusercontent.com/uberphoebus/hundred-c/4873b69/a070_PasswordChecker.c | uberphoebus/hundred-c 4873b69 a070_PasswordChecker.c | true | 200 | 1,329 | #define _CRT_SECURE_NO_WARNINGS
#include <ctype.h>
#include <stdio.h>
#include <string.h>
int passwordChecker(char password[]);
int main() {
char password[30];
while (1) {
printf("Enter a password: ");
scanf("%s", password);
switch (passwordChecker(password)) {
case 1:
printf("8 characters... | 4 |
nir-g0/cs149 | e112d13 | WS6/test1.c | C | www.github.com/nir-g0/cs149/tree/main/WS6/test1.c | https://raw.githubusercontent.com/nir-g0/cs149/e112d13/WS6/test1.c | nir-g0/cs149 e112d13 WS6/test1.c | true | 200 | 1,052 | #include "apue.h"
int
main(void)
{
pid_t pid;
if ((pid = fork()) < 0)
err_sys("fork error");
else if (pid != 0) { /* parent */
printf("parent pid: %d\n", getpid());
sleep(2);
exit(2); /* terminate with exit status 2 */
}
if ((pid = fork()) < 0)
err_sys("fork error");
else if (pid != 0) { /* firs... | 2 |
confucianzuoyuan/zyos | 8b9945e | kernel/mem/pmap.c | C | www.github.com/confucianzuoyuan/zyos/tree/main/kernel/mem/pmap.c | https://raw.githubusercontent.com/confucianzuoyuan/zyos/8b9945e/kernel/mem/pmap.c | confucianzuoyuan/zyos 8b9945e kernel/mem/pmap.c | true | 200 | 11,717 | //============================================================================
/// @file pmap.c
/// @brief 物理内存映射：描述可用和保留的物理内存区域(pmap: physical memory map)
/// @details 在这个文件的代码执行之前，boot代码已经填充了大部分的内存映射，填充的内存区域
/// 由BIOS提供
//======================================================================... | 7 |
sahraeeali/Specognitor | 1fd0954 | tests/Spectre-v1/BTB/v06/test.c | C | www.github.com/sahraeeali/Specognitor/tree/main/tests/Spectre-v1/BTB/v06/test.c | https://raw.githubusercontent.com/sahraeeali/Specognitor/1fd0954/tests/Spectre-v1/BTB/v06/test.c | sahraeeali/Specognitor 1fd0954 tests/Spectre-v1/BTB/v06/test.c | true | 200 | 753 | /*
test06 (Kocher05)
Use x as the initial value in a for() loop.
No BTB restrictions.
compile "clang-6.0 -g -c -emit-llvm test.c -o test.bc"
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include "../../../../klee/include/klee/klee.h"
unsigned int array1_size = 4;
uint8_t array1[16];
uint8_t array2[256... | 6 |
kareema88/alx-low_level_programming | eb8b055 | 0x13-more_singly_linked_lists/3-add_nodeint_end.c | C | www.github.com/kareema88/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/3-add_nodeint_end.c | https://raw.githubusercontent.com/kareema88/alx-low_level_programming/eb8b055/0x13-more_singly_linked_lists/3-add_nodeint_end.c | kareema88/alx-low_level_programming eb8b055 0x13-more_singly_linked_lists/3-add_nodeint_end.c | true | 200 | 603 | #include "lists.h"
/**
* add_nodeint_end - add a new node at the end of a listint_t list
* @head: the head of the list
* @n: n of elements
* Return: the address of the new element, or NULL
*/
listint_t *add_nodeint_end(listint_t **head, const int n)
{
listint_t *knode;
listint_t *pres;
if (head == NULL)
ret... | 4 |
Benjoplacop/Minishell | 9305069 | builtin/unset.c | C | www.github.com/Benjoplacop/Minishell/tree/main/builtin/unset.c | https://raw.githubusercontent.com/Benjoplacop/Minishell/9305069/builtin/unset.c | Benjoplacop/Minishell 9305069 builtin/unset.c | true | 200 | 2,000 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* unset.c :+: :+: :+: ... | 7 |
Marcjazz/CPlayground | a9ca245 | Equation/equation(1).c | C | www.github.com/Marcjazz/CPlayground/tree/main/Equation/equation(1).c | https://raw.githubusercontent.com/Marcjazz/CPlayground/a9ca245/Equation/equation%281%29.c | Marcjazz/CPlayground a9ca245 Equation/equation(1).c | true | 200 | 1,235 | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#define Pi 3.14
typedef enum Booleen{ vrai, faux }Booleen;
typedef struct Point{
double x;
double y;
}Point;
typedef struct Cercle{
Point O;
double r;
}Cercle;
double SurfaceCercle( double r){
return r*r*Pi;
}
Booleen... | 6 |
FayrosSky/IFPI-ADS | ca93744 | ADS 2024.1/EDI/aprendendoC/estudonauta/ex03.c | C | www.github.com/FayrosSky/IFPI-ADS/tree/main/ADS 2024.1/EDI/aprendendoC/estudonauta/ex03.c | https://raw.githubusercontent.com/FayrosSky/IFPI-ADS/ca93744/ADS%202024.1/EDI/aprendendoC/estudonauta/ex03.c | FayrosSky/IFPI-ADS ca93744 ADS 2024.1/EDI/aprendendoC/estudonauta/ex03.c | true | 200 | 222 | #include <stdio.h>
#include <locale.h>
void main(){
setlocale(LC_ALL, "Portuguese");
float n;
printf("Digite um númro real: ");
scanf("%f", &n);
printf("Você digitou o número %.1f\n", n);
} | 2 |
Stanjae/alx-low_level_programming | d27fce6 | 0x02-functions_nested_loops/3-islower.c | C | www.github.com/Stanjae/alx-low_level_programming/tree/main/0x02-functions_nested_loops/3-islower.c | https://raw.githubusercontent.com/Stanjae/alx-low_level_programming/d27fce6/0x02-functions_nested_loops/3-islower.c | Stanjae/alx-low_level_programming d27fce6 0x02-functions_nested_loops/3-islower.c | true | 200 | 219 | #include "main.h"
/**
* _islower - it finds all lowercase letters
* @c: the character of the static function
* Return: alway 0
*/
int _islower(int c)
{
if (c >= 'a' && c <= 'z')
return (1);
else
return (0);
}
| 4 |
CyrineZekri/holbertonschool-low_level_programming | e74d7c7 | doubly_linked_lists/3-add_dnodeint_end.c | C | www.github.com/CyrineZekri/holbertonschool-low_level_programming/tree/main/doubly_linked_lists/3-add_dnodeint_end.c | https://raw.githubusercontent.com/CyrineZekri/holbertonschool-low_level_programming/e74d7c7/doubly_linked_lists/3-add_dnodeint_end.c | CyrineZekri/holbertonschool-low_level_programming e74d7c7 doubly_linked_lists/3-add_dnodeint_end.c | true | 200 | 571 | #include "lists.h"
/**
*add_dnodeint_end-adds node at beginning.
*@head: head of the list.
*@n:int.
* Return:address of the new element.
*/
dlistint_t *add_dnodeint_end(dlistint_t **head, const int n)
{
dlistint_t *newnode, *ptr;
newnode = malloc(sizeof(dlistint_t));
if (newnode == NULL)
{
return (NULL);
... | 7 |
mikeaddi/alx-low_level_programming | c6a6d2d | 0x01-variables_if_else_while/102-print_comb5.c | C | www.github.com/mikeaddi/alx-low_level_programming/tree/main/0x01-variables_if_else_while/102-print_comb5.c | https://raw.githubusercontent.com/mikeaddi/alx-low_level_programming/c6a6d2d/0x01-variables_if_else_while/102-print_comb5.c | mikeaddi/alx-low_level_programming c6a6d2d 0x01-variables_if_else_while/102-print_comb5.c | true | 200 | 466 | #include <stdio.h>
/**
* main - main functin
* Description: "print to digit numbers"
* Return: 0
*/
int main(void)
{
int a, b;
for (a = 0; a <= 99; a++)
{
for (b = 0; b <= 99; b++)
{
if (a < b)
{
putchar((a / 10) + 48);
putchar((a % 10) + 48);
putchar(' ');
putchar((b / 10) + 48);
... | 2 |
benacodes/alx-low_level_programming | df41bb3 | 0x0B-malloc_free/2-str_concat.c | C | www.github.com/benacodes/alx-low_level_programming/tree/main/0x0B-malloc_free/2-str_concat.c | https://raw.githubusercontent.com/benacodes/alx-low_level_programming/df41bb3/0x0B-malloc_free/2-str_concat.c | benacodes/alx-low_level_programming df41bb3 0x0B-malloc_free/2-str_concat.c | true | 200 | 515 | #include <stdlib.h>
#include "main.h"
/**
* str_concat - concatenate two strings
* @s1: string 1
* @s2: string 2
* Return: pointer to s1 or NULL
*/
char *str_concat(char *s1, char *s2)
{
int i, k = 0, len = 0;
char *ar;
if (s1 == NULL)
s1 = "";
if (s2 == NULL)
s2 = "";
for (i = 0; s1[i] || s2[i]; i++)
... | 6 |
ha1tch/ual | e7f0f69 | iual/iual/stacks/stack_int.c | C | www.github.com/ha1tch/ual/tree/main/iual/iual/stacks/stack_int.c | https://raw.githubusercontent.com/ha1tch/ual/e7f0f69/iual/iual/stacks/stack_int.c | ha1tch/ual e7f0f69 iual/iual/stacks/stack_int.c | true | 200 | 10,349 | #include "stacks.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* ---------- IntStack Implementation ---------- */
IntStack *newIntStack(void) {
IntStack *s = malloc(sizeof(IntStack));
if (!s) {
perror("malloc newIntStack");
exit(EXIT_FAILURE);
}
s->capacity = 16;
... | 4 |
ayindeHassan/alx-low_level_programming | 7899ec7 | 0x00-hello_world/101-quote.c | C | www.github.com/ayindeHassan/alx-low_level_programming/tree/main/0x00-hello_world/101-quote.c | https://raw.githubusercontent.com/ayindeHassan/alx-low_level_programming/7899ec7/0x00-hello_world/101-quote.c | ayindeHassan/alx-low_level_programming 7899ec7 0x00-hello_world/101-quote.c | true | 200 | 206 | #include <unistd.h>
/**
* main-Entry point
*
* Return: Always 0 (Success)
*/
int main(void)
{
write(2,
"and that piece of art is useful\" - Dora Korpar, 2015-10-19\n",
59);
return (1);
}
| 7 |
DeviousCardi/BTP | 720b738 | deepfix_data/prob309/correct/prog32000-user307.c | C | www.github.com/DeviousCardi/BTP/tree/main/deepfix_data/prob309/correct/prog32000-user307.c | https://raw.githubusercontent.com/DeviousCardi/BTP/720b738/deepfix_data/prob309/correct/prog32000-user307.c | DeviousCardi/BTP 720b738 deepfix_data/prob309/correct/prog32000-user307.c | true | 200 | 365 | #include <stdio.h>
int main() {
int i,n;
int A[20];int B[20];
int count=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d",&A[i]);}
int j=0;
for(i=0;i<n;i++)
{for(j=0;j<n;j++)
if(A[i]==A[j]) {
count=count+1;
B[i]=count; }
else
{continue;}}
if(B[i]==A[i]){
printf("yes"... | 4 |
pojiro/tdd_for_embedded_c | 61adbf4 | src/util/CircularBuffer.c | C | www.github.com/pojiro/tdd_for_embedded_c/tree/main/src/util/CircularBuffer.c | https://raw.githubusercontent.com/pojiro/tdd_for_embedded_c/61adbf4/src/util/CircularBuffer.c | pojiro/tdd_for_embedded_c 61adbf4 src/util/CircularBuffer.c | true | 200 | 1,424 | #include "CircularBuffer.h"
#include "Utils.h"
#include <stdlib.h>
typedef struct CircularBufferStruct {
int *values;
int in_index;
int out_index;
int count;
int capacity;
} CircularBufferStruct;
CircularBuffer CircularBuffer_Create(int size) {
CircularBuffer buffer = (CircularBuffer)malloc(sizeof(Circula... | 6 |
jiganomegsdfdf/edk2-veux | eeba187 | GPLDrivers/Library/SimpleInit/libs/util-linux/libblkid/superblocks/gfs.c | C | www.github.com/jiganomegsdfdf/edk2-veux/tree/main/GPLDrivers/Library/SimpleInit/libs/util-linux/libblkid/superblocks/gfs.c | https://raw.githubusercontent.com/jiganomegsdfdf/edk2-veux/eeba187/GPLDrivers/Library/SimpleInit/libs/util-linux/libblkid/superblocks/gfs.c | jiganomegsdfdf/edk2-veux eeba187 GPLDrivers/Library/SimpleInit/libs/util-linux/libblkid/superblocks/gfs.c | true | 200 | 3,309 | /*
* Copyright (C) 2008 Karel Zak <kzak@redhat.com>
*
* This file may be redistributed under the terms of the
* GNU Lesser General Public License.
*/
#include <stdlib.h>
#include <string.h>
#include <stdint.h>
#include "superblocks.h"
/* Common gfs/gfs2 constants: */
#define GFS_LOCKNAME_LEN 64
/* gfs1 ... | 2 |
Android-Boot-Manager/droidboot_device_volla_yggdrasil | 72e8553 | app/mt_boot/dl_commands.c | C | www.github.com/Android-Boot-Manager/droidboot_device_volla_yggdrasil/tree/main/app/mt_boot/dl_commands.c | https://raw.githubusercontent.com/Android-Boot-Manager/droidboot_device_volla_yggdrasil/72e8553/app/mt_boot/dl_commands.c | Android-Boot-Manager/droidboot_device_volla_yggdrasil 72e8553 app/mt_boot/dl_commands.c | true | 200 | 50,124 | /* Copyright Statement:
*
* This software/firmware and related documentation ("MediaTek Software") are
* protected under relevant copyright laws. The information contained herein
* is confidential and proprietary to MediaTek Inc. and/or its licensors.
* Without the prior written permission of MediaTek inc. and/or its l... | 7 |
SaneleSiso/alx-low_level_programming | 01ba74e | 0x04-more_functions_nested_loops/100-prime_factor.c | C | www.github.com/SaneleSiso/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/100-prime_factor.c | https://raw.githubusercontent.com/SaneleSiso/alx-low_level_programming/01ba74e/0x04-more_functions_nested_loops/100-prime_factor.c | SaneleSiso/alx-low_level_programming 01ba74e 0x04-more_functions_nested_loops/100-prime_factor.c | true | 200 | 411 | #include <stdio.h>
/**
* main - Finds and prints the largest prime
* factor of the number 612852475143.
* Return: Always 0.
*/
int main(void)
{
long prime = 612852475143, i;
while (i < (prime / 2))
{
if ((prime % 2) == 0)
{
prime /= 2;
continue;
}
for (i = 3; i < (prime / 2); i += 2)
{... | 4 |
maria-9876/hello | 2e3658b | fcfs disk.c | C | www.github.com/maria-9876/hello/tree/main/fcfs disk.c | https://raw.githubusercontent.com/maria-9876/hello/2e3658b/fcfs%20disk.c | maria-9876/hello 2e3658b fcfs disk.c | true | 200 | 519 | #include<stdio.h>
#include<stdlib.h>
void main()
{
int n,RQ[20],initial,i;
printf("Enter the no of requests:");
scanf("%d",&n);
printf("Enter the request sequence:");
for(i=0;i<n;i++)
{
scanf("%d",&RQ[i]);
}
printf("enter the initial head position:");
scanf("%d",&initial);
... | 6 |
E2-80338-MayuriShivade/DSA-Assignments | e41dc5e | practice/DoublyLLL.c | C | www.github.com/E2-80338-MayuriShivade/DSA-Assignments/tree/main/practice/DoublyLLL.c | https://raw.githubusercontent.com/E2-80338-MayuriShivade/DSA-Assignments/e41dc5e/practice/DoublyLLL.c | E2-80338-MayuriShivade/DSA-Assignments e41dc5e practice/DoublyLLL.c | true | 200 | 2,144 | #include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *next;
struct node *prev;
};
struct node *head=NULL;
struct node *tail=NULL;
struct node *create_node(int data);
void forward_display();
void backward_display();
void add_first(int data);
void delete_last();
void delete_first();
voi... | 3 |
tidhar8778/Chess-Deep-Pruning | 13508c2 | src/search_main.c | C | www.github.com/tidhar8778/Chess-Deep-Pruning/tree/main/src/search_main.c | https://raw.githubusercontent.com/tidhar8778/Chess-Deep-Pruning/13508c2/src/search_main.c | tidhar8778/Chess-Deep-Pruning 13508c2 src/search_main.c | true | 200 | 9,532 | /*-------------------------------------------------------------------------------
tucano is a chess playing engine developed by Alcides Schulz.
Copyright (C) 2011-present - Alcides Schulz
tucano is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as... | 5 |
parkj12b/42seoul | f7027a8 | 42_code/test/ex00/main.c | C | www.github.com/parkj12b/42seoul/tree/main/42_code/test/ex00/main.c | https://raw.githubusercontent.com/parkj12b/42seoul/f7027a8/42_code/test/ex00/main.c | parkj12b/42seoul f7027a8 42_code/test/ex00/main.c | true | 200 | 3,216 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* main.c :+: :+: :+: ... | 2 |
Rahmetullahgonul/c_programla_calismalarim | 0b788be | 1.ilerleme/fonksiyon_egzersizleri_22/main.c | C | www.github.com/Rahmetullahgonul/c_programla_calismalarim/tree/main/1.ilerleme/fonksiyon_egzersizleri_22/main.c | https://raw.githubusercontent.com/Rahmetullahgonul/c_programla_calismalarim/0b788be/1.ilerleme/fonksiyon_egzersizleri_22/main.c | Rahmetullahgonul/c_programla_calismalarim 0b788be 1.ilerleme/fonksiyon_egzersizleri_22/main.c | true | 200 | 818 | #include <stdio.h>
#include <stdlib.h>
float karekok(float girilen_sayi)
{
int i;
float kare;
if(girilen_sayi>0)
{
kare=girilen_sayi/2;
for(i=1; i<=50; i++)
{
kare = ((kare*kare)+girilen_sayi/(2*kare));
}
return kare;
}
else if(girilen_sayi=... | 7 |
MohamedSaadAm/Door-Locker-Security-System-AVR-Atmega32 | 92dc430 | Final project/final_project_Eclipse_SW/HMI_ECU/MC1.c | C | www.github.com/MohamedSaadAm/Door-Locker-Security-System-AVR-Atmega32/tree/main/Final project/final_project_Eclipse_SW/HMI_ECU/MC1.c | https://raw.githubusercontent.com/MohamedSaadAm/Door-Locker-Security-System-AVR-Atmega32/92dc430/Final%20project/final_project_Eclipse_SW/HMI_ECU/MC1.c | MohamedSaadAm/Door-Locker-Security-System-AVR-Atmega32 92dc430 Final project/final_project_Eclipse_SW/HMI_ECU/MC1.c | true | 200 | 5,734 | /******************************************************************************
*
*
* File Name: MC1.c
*
* Description: source file for the main of mc1
*
* Author: Mohamed Saad
*
*******************************************************************************/
#include "Keypad.h"
#include "lcd.h"
#i... | 1 |
mahmud-faisal-fahad/C-practice | a49b18f | C Programming/Mahabub Sir Ansi C/Chapter -1/Exercise Problem/ex-2.c | C | www.github.com/mahmud-faisal-fahad/C-practice/tree/main/C Programming/Mahabub Sir Ansi C/Chapter -1/Exercise Problem/ex-2.c | https://raw.githubusercontent.com/mahmud-faisal-fahad/C-practice/a49b18f/C%20Programming/Mahabub%20Sir%20Ansi%20C/Chapter%20-1/Exercise%20Problem/ex-2.c | mahmud-faisal-fahad/C-practice a49b18f C Programming/Mahabub Sir Ansi C/Chapter -1/Exercise Problem/ex-2.c | true | 200 | 278 | #include<stdio.h>
int main()
{
/*
Develop an algorithm to divide one number by another and find the quotient
*/
int a,b,Q;
printf("Enter a");
scanf("%d",&a);
printf("Enter b");
scanf("%d",&b);
if (b!=0)
{
Q=a/b;
printf("Q is : %d",Q);
}
else
{
printf("The End");
}
} | 4 |
Nisien/minishell | dded8e5 | builtins/ft_lst_to_char.c | C | www.github.com/Nisien/minishell/tree/main/builtins/ft_lst_to_char.c | https://raw.githubusercontent.com/Nisien/minishell/dded8e5/builtins/ft_lst_to_char.c | Nisien/minishell dded8e5 builtins/ft_lst_to_char.c | true | 200 | 1,704 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_lst_to_char.c :+: :+: :+: ... | 0 |
Ashwini-Khairnar/Applications | 377ebdb | rec19.c | C | www.github.com/Ashwini-Khairnar/Applications/tree/main/rec19.c | https://raw.githubusercontent.com/Ashwini-Khairnar/Applications/377ebdb/rec19.c | Ashwini-Khairnar/Applications 377ebdb rec19.c | true | 200 | 348 | #include<stdio.h>
void Display(char *str)
{
if(*str != '\0')
{
Display(str + 1); //Head recursion
printf("%c\n",*str);
// Display(++str); //Tail recursion
}
}
int main()
{
char Arr[20];
printf("Enter string\n");
scanf("%[^'\n']s",Arr);
Displ... | 3 |
qzx297/GD32DP-BESI-1KW-G553 | 4f55a64 | BESI_G553/INV_G553/Utilities/gd32g553q_eval.h | C | www.github.com/qzx297/GD32DP-BESI-1KW-G553/tree/main/BESI_G553/INV_G553/Utilities/gd32g553q_eval.h | https://raw.githubusercontent.com/qzx297/GD32DP-BESI-1KW-G553/4f55a64/BESI_G553/INV_G553/Utilities/gd32g553q_eval.h | qzx297/GD32DP-BESI-1KW-G553 4f55a64 BESI_G553/INV_G553/Utilities/gd32g553q_eval.h | true | 200 | 5,985 | /*!
\file gd32g553q_eval.h
\brief definitions for leds, keys and COM ports hardware resources
\version 2024-03-10, V1.0.0, firmware for GD32G5x3
*/
/*
Copyright (c) 2024, GigaDevice Semiconductor Inc.
Redistribution and use in source and binary forms, with or without modification,
are permi... | 6 |
Rafi1999/C-codes | 3bea864 | f.c | C | www.github.com/Rafi1999/C-codes/tree/main/f.c | https://raw.githubusercontent.com/Rafi1999/C-codes/3bea864/f.c | Rafi1999/C-codes 3bea864 f.c | true | 200 | 208 | #include<stdio.h>
#include<stdlib.h>
int getsum()
{
int x,y,sum=0;
scanf("%d %d",&x,&y);
sum = x + y;
return sum;
}
int main()
{
int a,b,sum;
sum = getsum();
printf("%d\n",sum);
}
| 5 |
anishpranav/BUS-RESERVATION-SYSTEM-DSA | 7bc3082 | bus_sytem.c | C | www.github.com/anishpranav/BUS-RESERVATION-SYSTEM-DSA/tree/main/bus_sytem.c | https://raw.githubusercontent.com/anishpranav/BUS-RESERVATION-SYSTEM-DSA/7bc3082/bus_sytem.c | anishpranav/BUS-RESERVATION-SYSTEM-DSA 7bc3082 bus_sytem.c | true | 200 | 13,647 | #include <stdio.h>
#include <stdlib.h>
#include <conio.h>
#include <string.h>
#include <time.h>
typedef struct BinarySearchTree BST;
// if bst is empty then we have to handle the error
struct BinarySearchTree {
int PassnNo; // busNo0SeatNo.
char name[10];
struct BinarySearchTree *left;
struct BinarySe... | 2 |
rewls/microprocessor-term-project | 7864c5b | clocks_and_modes.c | C | www.github.com/rewls/microprocessor-term-project/tree/main/clocks_and_modes.c | https://raw.githubusercontent.com/rewls/microprocessor-term-project/7864c5b/clocks_and_modes.c | rewls/microprocessor-term-project 7864c5b clocks_and_modes.c | true | 200 | 2,671 | /*
* clocks_and_modes.c Copyright NXP 2016
* Description: Example clock and mode functions
* 2015 Feb 22 S Mihalik/ O Romero - initial version
* 2016 Oct 15 S.M. / O.R. - Updated PLL per S32K1XX data sheet rev 1
* 2016 Dec 06 S.M. et al - NormalRUNmode_80MHz changed "if" to "while"
* 2016 Jan 05 S.M.... | 1 |
yemreel/alx-low_level_programming | 948cea5 | 0x0B-malloc_free/4-free_grid.c | C | www.github.com/yemreel/alx-low_level_programming/tree/main/0x0B-malloc_free/4-free_grid.c | https://raw.githubusercontent.com/yemreel/alx-low_level_programming/948cea5/0x0B-malloc_free/4-free_grid.c | yemreel/alx-low_level_programming 948cea5 0x0B-malloc_free/4-free_grid.c | true | 200 | 316 | #include "main.h"
#include <stdlib.h>
/**
* free_grid - function that frees a 2 dimensional grid previously created
* by alloc_grid function
*
* @grid: double pointer to 2D array
*
* @height: array height
*/
void free_grid(int **grid, int height)
{
int i;
for (i = 0; i < height; i++)
free(grid[i]);
free(grid);
}
| 7 |
JimmyNH3/Coding | b3f6ba7 | NCHU_Programming/11301/Donshiaopin_Exam/hw/array_mani.c | C | www.github.com/JimmyNH3/Coding/tree/main/NCHU_Programming/11301/Donshiaopin_Exam/hw/array_mani.c | https://raw.githubusercontent.com/JimmyNH3/Coding/b3f6ba7/NCHU_Programming/11301/Donshiaopin_Exam/hw/array_mani.c | JimmyNH3/Coding b3f6ba7 NCHU_Programming/11301/Donshiaopin_Exam/hw/array_mani.c | true | 200 | 609 | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define lli long long int
int main() {
int n, i;
scanf("%d", &n);
lli a[n], min = pow(2, 32) - 1, max = 0, sum = 0;
lli max2 = 0, min2 = pow(2, 32) - 1;
for(i = 0; i < n; i++) {
scanf("%lli", &a[i]);
if(a[i] >= max) max = a[i... | 4 |
satyamsiuu/Section_F_G2_Sem_2_C_Lab | cdc6b33 | 14_02_2024/p2.c | C | www.github.com/satyamsiuu/Section_F_G2_Sem_2_C_Lab/tree/main/14_02_2024/p2.c | https://raw.githubusercontent.com/satyamsiuu/Section_F_G2_Sem_2_C_Lab/cdc6b33/14_02_2024/p2.c | satyamsiuu/Section_F_G2_Sem_2_C_Lab cdc6b33 14_02_2024/p2.c | true | 200 | 485 | #include<stdio.h>
#include<string.h>
int pallindrome(char[]);
int main()
{
char c[40];
printf("Enter a string: ");
fgets(c,40,stdin);
if(pallindrome(c))
printf("String is not pallindrome\n");
else
printf("String is pallindrome\n");
return 0;
}
int pallindrome(char c[])
{
char copy[40];
int l=0,i=0;
while(c[l]!='\0'&&c[... | 0 |
Avi2705/C-Programs | d88fe51 | PATTERNS/PYRAMIDL.C | C | www.github.com/Avi2705/C-Programs/tree/main/PATTERNS/PYRAMIDL.C | https://raw.githubusercontent.com/Avi2705/C-Programs/d88fe51/PATTERNS/PYRAMIDL.C | Avi2705/C-Programs d88fe51 PATTERNS/PYRAMIDL.C | true | 200 | 229 | #include<stdio.h>
int main()
{
int i,j,k,n,n1;
printf("Enter the Limit:");
scanf("%d", &n);
n1 = n;
for(i=1;i<=n*2;i=i+2)
{
for(k=n1;k>=0;k--)
{
printf(" ");
}
for(j=1;j<=i;j++)
{
printf("* ");
}
printf("\n");
n1--;
}
return 0;
} | 3 |
MarcelliSarti/Exercicios-em-C | a374f17 | Tarefa06/TRABALHO/Trab.C | C | www.github.com/MarcelliSarti/Exercicios-em-C/tree/main/Tarefa06/TRABALHO/Trab.C | https://raw.githubusercontent.com/MarcelliSarti/Exercicios-em-C/a374f17/Tarefa06/TRABALHO/Trab.C | MarcelliSarti/Exercicios-em-C a374f17 Tarefa06/TRABALHO/Trab.C | true | 200 | 1,456 | #include <stdio.h>
#include <math.h>
#define l 10
int main () {
int N, X, matriz[l][l], correcao[l][l], corrigida[l][l];
float soma, media, desvio, dif = 0, desvioF;
scanf("%d/n", &N);
scanf("%d/n", &X);
for (int i = 0; i < N; ++i) {
for (int w = 0; w < N; ++w) {
scanf("%d", &matriz[i][w]);
}
}
for (i... | 6 |
tathagata125/software-system | b6117d4 | 1b.c | C | www.github.com/tathagata125/software-system/tree/main/1b.c | https://raw.githubusercontent.com/tathagata125/software-system/b6117d4/1b.c | tathagata125/software-system b6117d4 1b.c | true | 200 | 361 | //Create the following types of a files using (i) shell command (ii) system call
//a.soft link(symlink system call)
//Tathagata Das
//MT2024161
#include <unistd.h>
#include <stdio.h>
int main() {
unlink("softlink.txt");
if (symlink("file1.txt","softlink.txt") == 0){
printf("symbolic link created successfully.\n... | 5 |
tcbnunes/Exerc-cios-resolvidos | 784b385 | Exercício15/15.c | C | www.github.com/tcbnunes/Exerc-cios-resolvidos/tree/main/Exercício15/15.c | https://raw.githubusercontent.com/tcbnunes/Exerc-cios-resolvidos/784b385/Exerc%C3%ADcio15/15.c | tcbnunes/Exerc-cios-resolvidos 784b385 Exercício15/15.c | true | 200 | 812 | /*
Num dia de sol, você deseja medir a altura de um prédio, porém, a trena não é
suficientemente longa. Assumindo que seja possível medir sua sombra e a do prédio no
chão, e que você lembre da sua altura, faça um programa para ler os dados necessários e
calcular a altura do prédio
*/
#include <stdio.h>
#include <std... | 2 |
Phalatena/alx-low_level_programming | 739b895 | 0x01-variables_if_else_while/7-print_tebahpla.c | C | www.github.com/Phalatena/alx-low_level_programming/tree/main/0x01-variables_if_else_while/7-print_tebahpla.c | https://raw.githubusercontent.com/Phalatena/alx-low_level_programming/739b895/0x01-variables_if_else_while/7-print_tebahpla.c | Phalatena/alx-low_level_programming 739b895 0x01-variables_if_else_while/7-print_tebahpla.c | true | 200 | 236 | #include <stdio.h>
/**
*main - Entry point program that prints the lowercase alphabet in reverse
*Return: 0 (success)
*/
int main(void)
{
char ch;
for (ch = 'z'; ch >= 'a'; ch--)
{
putchar(ch);
}
putchar('\n');
return (0);
}
| 1 |
adjerry/alx-low_level_programming | 1d82306 | 0x05-pointers_arrays_strings/7-puts_half.c | C | www.github.com/adjerry/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/7-puts_half.c | https://raw.githubusercontent.com/adjerry/alx-low_level_programming/1d82306/0x05-pointers_arrays_strings/7-puts_half.c | adjerry/alx-low_level_programming 1d82306 0x05-pointers_arrays_strings/7-puts_half.c | true | 200 | 296 | #include <stdio.h>
#include "main.h"
/**
*puts_half - function that prints half of a string
*@str:input
*Return:half the input
*/
void puts_half(char *str)
{
int len = 0;
while (*str != '\0')
{
len++;
str++;
}
str -= (len / 2);
while (*str != '\0')
{
putchar(*str);
str++;
}
putchar('\n');
}
| 0 |
dideey/simple_shell | 3a73fe5 | v.c | C | www.github.com/dideey/simple_shell/tree/main/v.c | https://raw.githubusercontent.com/dideey/simple_shell/3a73fe5/v.c | dideey/simple_shell 3a73fe5 v.c | true | 200 | 4,154 | #include "main.h"
/**
* *run_or_logical - functionthat handles the
* * execution of the "||" command
* *@newstr: user command to be handled
* *@type: used to identify the type of command
* * to be executed
* *@e_ex: program executable for error handling
* *@sc: session count for erro... | 7 |
cjilbert504/C-is-for-Collin | 6c6ddbd | ch14/example-program-c-versions/ex1.c | C | www.github.com/cjilbert504/C-is-for-Collin/tree/main/ch14/example-program-c-versions/ex1.c | https://raw.githubusercontent.com/cjilbert504/C-is-for-Collin/6c6ddbd/ch14/example-program-c-versions/ex1.c | cjilbert504/C-is-for-Collin 6c6ddbd ch14/example-program-c-versions/ex1.c | true | 200 | 495 | // Example program #1 from Chapter 14 of Absolute Beginner's Guide
// to C, 3rd Edition
// File Chapter14ex1.c
/* This program increases a counter from 1 to 5, printing updates
and then counts it back down to 1. However, it uses while loops and
the increment and decrement operators */
#include <stdio.h>
int ma... | 3 |
KellsCodes/alx-low_level_programming | 998a185 | 0x05-pointers_arrays_strings/8-print_array.c | C | www.github.com/KellsCodes/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/8-print_array.c | https://raw.githubusercontent.com/KellsCodes/alx-low_level_programming/998a185/0x05-pointers_arrays_strings/8-print_array.c | KellsCodes/alx-low_level_programming 998a185 0x05-pointers_arrays_strings/8-print_array.c | true | 200 | 308 | #include "main.h"
#include <stdio.h>
/**
* print_array - prints n eles of an array of integers
*
* @a: array pointer
* @n: length of array to be printed
*/
void print_array(int *a, int n)
{
int i = 0;
for (; i < n; ++i)
{
printf("%d", a[i]);
if (i < n - 1)
printf(", ");
}
printf("\n");
}
| 6 |
bedirhanKC/C | ab7c1a6 | ornek_cozumleri/banka_sistemi_v1.c | C | www.github.com/bedirhanKC/C/tree/main/ornek_cozumleri/banka_sistemi_v1.c | https://raw.githubusercontent.com/bedirhanKC/C/ab7c1a6/ornek_cozumleri/banka_sistemi_v1.c | bedirhanKC/C ab7c1a6 ornek_cozumleri/banka_sistemi_v1.c | true | 200 | 1,524 | /*
Bedirhan K�m�rc�
26.05.2022
19.24
*/
#include<stdio.h>
#include<stdlib.h>
struct musteri{
int HesapNo;
char isim[30];
char soyisim[30];
double bakiye;
};
typedef struct musteri musteri;
void YeniListe(){
FILE *myptr;
musteri temp={0,"","",0.0};
int i;
myptr=fopen("Ban... | 5 |
Norhan296/alx-low_level_programming | 726a4d2 | 0x05-pointers_arrays_strings/8-print_array.c | C | www.github.com/Norhan296/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/8-print_array.c | https://raw.githubusercontent.com/Norhan296/alx-low_level_programming/726a4d2/0x05-pointers_arrays_strings/8-print_array.c | Norhan296/alx-low_level_programming 726a4d2 0x05-pointers_arrays_strings/8-print_array.c | true | 200 | 329 | #include "main.h"
/**
* print_array - prints n elements of an array of integers
* @a: array of numbers
* @n: number of elements
* we can use printf
*/
void print_array(int *a, int n)
{
int i;
for (i = 0; i < n; i++)
{
if (i == n - 1)
{
printf("%d", a[i]);
}
else
printf("%d, ", a[i]);
}
printf(... | 4 |
mohsinehour/sorting_algorithms | 9b46421 | 0-bubble_sort.c | C | www.github.com/mohsinehour/sorting_algorithms/tree/main/0-bubble_sort.c | https://raw.githubusercontent.com/mohsinehour/sorting_algorithms/9b46421/0-bubble_sort.c | mohsinehour/sorting_algorithms 9b46421 0-bubble_sort.c | true | 200 | 612 | #include "sort.h"
/**
* bubble_sort - sorts an array of integers in ascending order using the
* Bubble sort algorithm
* @array: The array to be sorted
* @size: The size of the array
*
* Return: void
*/
void bubble_sort(int *array, size_t size)
{
size_t i, m, new_m;
int switch_int;
if (array == NULL || size ... | 1 |
jiraphat3411/compro1 | 1dbbe4b | test 4/AnagramNumber.c | C | www.github.com/jiraphat3411/compro1/tree/main/test 4/AnagramNumber.c | https://raw.githubusercontent.com/jiraphat3411/compro1/1dbbe4b/test%204/AnagramNumber.c | jiraphat3411/compro1 1dbbe4b test 4/AnagramNumber.c | true | 200 | 1,376 | #include<stdio.h>
void main(){
int x[100],y[100];
for(int i=0;i<=100;i++){
x[i]=0;
y[i]=0;
}
//int countx=0,county=0;
while(1){
int n;
scanf("%d",&n);
if(n<0||n>99){
break;
}
//countx++;
x[n]++;
//pri... | 7 |
CodeEnchantress/30-days-sprint | 20b2313 | string6.c | C | www.github.com/CodeEnchantress/30-days-sprint/tree/main/string6.c | https://raw.githubusercontent.com/CodeEnchantress/30-days-sprint/20b2313/string6.c | CodeEnchantress/30-days-sprint 20b2313 string6.c | true | 200 | 358 | #include<stdio.h>
#include<string.h>
int main (){
char str1[50],str2[50];
printf("enter the string: ");
gets(str1);
strcpy(str2, str1);
strrev(str2);
if (strcmpi(str1, str2)==0){
printf("\n it is a palindrom ");
}
else {
printf("\n it is ... | 0 |
FrancescoRisso/ASE-extrapoint-2 | 6bd6b21 | CAN/lib_CAN.c | C | www.github.com/FrancescoRisso/ASE-extrapoint-2/tree/main/CAN/lib_CAN.c | https://raw.githubusercontent.com/FrancescoRisso/ASE-extrapoint-2/6bd6b21/CAN/lib_CAN.c | FrancescoRisso/ASE-extrapoint-2 6bd6b21 CAN/lib_CAN.c | true | 200 | 10,942 | /*----------------------------------------------------------------------------
* Name: Can.c
* Purpose: CAN interface for for LPC17xx with MCB1700
* Note(s): see also http://www.port.de/engl/canprod/sv_req_form.html
*----------------------------------------------------------------------------
* This file is par... | 3 |
PacktPublishing/Bare-Metal-Embedded-C-Programming | f1fa7cb | Chapter18-StandByModeWithWakeupPin/Src/uart.c | C | www.github.com/PacktPublishing/Bare-Metal-Embedded-C-Programming/tree/main/Chapter18-StandByModeWithWakeupPin/Src/uart.c | https://raw.githubusercontent.com/PacktPublishing/Bare-Metal-Embedded-C-Programming/f1fa7cb/Chapter18-StandByModeWithWakeupPin/Src/uart.c | PacktPublishing/Bare-Metal-Embedded-C-Programming f1fa7cb Chapter18-StandByModeWithWakeupPin/Src/uart.c | true | 200 | 1,540 | #include <stdint.h>
#include "uart.h"
#define GPIOAEN (1U<<0)
#define UART2EN (1U<<17)
#define DBG_UART_BAUDRATE 115200
#define SYS_FREQ 16000000
#define APB1_CLK SYS_FREQ
#define CR1_TE (1U<<3)
#define CR1_UE (1U<<13)
#define SR_TXE (1U<<7)
static void uart_set_baudrate(uint32_t ... | 6 |
Jyoti525/C-PROGRAMMING | 779764c | 70.string12.c | C | www.github.com/Jyoti525/C-PROGRAMMING/tree/main/70.string12.c | https://raw.githubusercontent.com/Jyoti525/C-PROGRAMMING/779764c/70.string12.c | Jyoti525/C-PROGRAMMING 779764c 70.string12.c | true | 200 | 311 | // C Program to Remove Leading Zeros
#include <stdio.h>
char* removeLeadingZeros(char str[]) {
int i = 0;
while (str[i] == '0') i++;
return str + i;
}
int main() {
char str[] = "0001234";
printf("After removing leading zeros: %s\n", removeLeadingZeros(str));
return 0;
}
| 4 |
asad-ullah-al-galib/Codeforces | 87ff153 | p11.c | C | www.github.com/asad-ullah-al-galib/Codeforces/tree/main/p11.c | https://raw.githubusercontent.com/asad-ullah-al-galib/Codeforces/87ff153/p11.c | asad-ullah-al-galib/Codeforces 87ff153 p11.c | true | 200 | 247 | //write a program in C to input a string and print it.
#include <stdio.h>
int main() {
char str[100];
printf("Enter a string: ");
fgets(str, sizeof(str), stdin); // read string
printf("You entered: %s", str);
return 0;
}
| 5 |
Siphumezo91/alx-low_level_programming | beff89b | 0x13-more_singly_linked_lists/0-print_listint.c | C | www.github.com/Siphumezo91/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/0-print_listint.c | https://raw.githubusercontent.com/Siphumezo91/alx-low_level_programming/beff89b/0x13-more_singly_linked_lists/0-print_listint.c | Siphumezo91/alx-low_level_programming beff89b 0x13-more_singly_linked_lists/0-print_listint.c | true | 200 | 284 | #include <stdio.h>
#include "lists.h"
/**
* size_t - print all the elements of a linked list
* @h: pointer to the list
*
* Return: number of nodes
*/
size_t print_listint(const listint_t *h)
{
size_t s = 0;
while (h != 0)
{
printf("%d/n", h->n);
h++;
}
return (s);
}
| 2 |
aseptimu/Philosophers | 563cfdf | philo/philo.c | C | www.github.com/aseptimu/Philosophers/tree/main/philo/philo.c | https://raw.githubusercontent.com/aseptimu/Philosophers/563cfdf/philo/philo.c | aseptimu/Philosophers 563cfdf philo/philo.c | true | 200 | 3,542 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* philo.c :+: :+: :+: ... | 1 |
Praveenadapa425/codemind-c | 5faf4e4 | Sum_of__First_and_Last_digits_.c | C | www.github.com/Praveenadapa425/codemind-c/tree/main/Sum_of__First_and_Last_digits_.c | https://raw.githubusercontent.com/Praveenadapa425/codemind-c/5faf4e4/Sum_of__First_and_Last_digits_.c | Praveenadapa425/codemind-c 5faf4e4 Sum_of__First_and_Last_digits_.c | true | 200 | 239 | #include<stdio.h>
int main()
{
int x,xx,r;
scanf("%d",&x);
xx=x%10;
while(x!=0)
{
r=x%10;
if(x<10)
{
xx=xx+r;
break;
}
x=x/10;
}
printf("%d",xx);
} | 7 |
Darshan-Kania/SEM-1-C-MATERIAL | 6110ab8 | ANSI C POINTERS/12_10_PE.c | C | www.github.com/Darshan-Kania/SEM-1-C-MATERIAL/tree/main/ANSI C POINTERS/12_10_PE.c | https://raw.githubusercontent.com/Darshan-Kania/SEM-1-C-MATERIAL/6110ab8/ANSI%20C%20POINTERS/12_10_PE.c | Darshan-Kania/SEM-1-C-MATERIAL 6110ab8 ANSI C POINTERS/12_10_PE.c | true | 200 | 1,058 | #include <stdio.h>
int Array_Comp(int *p, int *q, int size);
int main()
{
/*Darshan Kania*/
int arr1[1000], arr2[1000], size1, size2, *p1 = arr1, *p2 = arr2;
printf("How many Elements you want to enter in array 1: ");
scanf("%d", &size1);
printf("How many Elements you want to enter in array 2: ");
... | 0 |
isamch/complete-challenge-sas | 4fd2f63 | Day03/String/challenge (5)/challenge_5.c | C | www.github.com/isamch/complete-challenge-sas/tree/main/Day03/String/challenge (5)/challenge_5.c | https://raw.githubusercontent.com/isamch/complete-challenge-sas/4fd2f63/Day03/String/challenge%20%285%29/challenge_5.c | isamch/complete-challenge-sas 4fd2f63 Day03/String/challenge (5)/challenge_5.c | true | 200 | 623 | #include <stdio.h>
#include <string.h>
#define MAX 50
// Challenge 5 : Inversion de Chaîne
int main(){
char text_1[MAX],temp;
int i, length_1= 0;
printf("Entrez : ");
scanf("%[^\n]", text_1);
getchar();
// lenght text 1:
while (text_1[length_1] != '\0')
{
length_1++; ... | 6 |
monicahwamuhu/alx-low_level_programming | d8422ff | 0x04-more_functions_nested_loops/1-isdigit.c | C | www.github.com/monicahwamuhu/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/1-isdigit.c | https://raw.githubusercontent.com/monicahwamuhu/alx-low_level_programming/d8422ff/0x04-more_functions_nested_loops/1-isdigit.c | monicahwamuhu/alx-low_level_programming d8422ff 0x04-more_functions_nested_loops/1-isdigit.c | true | 200 | 257 | #include "main.h"
/**
*_isdigit - function that verifies if a character is a digit or not
*@c: tested character
*Return: return 1 if it is uppercase, 0 if not
*/
int _isdigit(int c)
{
if ((c >= 48) && (c <= 57))
return (1);
return (0);
}
| 3 |
Cdawn99/AoC2024 | fc362c7 | Day14/day14.h | C | www.github.com/Cdawn99/AoC2024/tree/main/Day14/day14.h | https://raw.githubusercontent.com/Cdawn99/AoC2024/fc362c7/Day14/day14.h | Cdawn99/AoC2024 fc362c7 Day14/day14.h | true | 200 | 540 | #ifndef DAY14_H_
#define DAY14_H_
#include "../dawn_utils.h"
#include <stddef.h>
#include <stdint.h>
typedef struct {
int64_t width;
int64_t height;
} RoomSize;
RoomSize room_size_init(char *info);
typedef struct {
int64_t px;
int64_t py;
int64_t vx;
int64_t vy;
} Robot;
void robot_move(Ro... | 5 |
Aquiles-b/beale-ciphers | fe19e8b | decodifica_lib.c | C | www.github.com/Aquiles-b/beale-ciphers/tree/main/decodifica_lib.c | https://raw.githubusercontent.com/Aquiles-b/beale-ciphers/fe19e8b/decodifica_lib.c | Aquiles-b/beale-ciphers fe19e8b decodifica_lib.c | true | 200 | 1,293 | #include <stdio.h>
#include "decodifica_lib.h"
/* Decodifica para @txtOut o texto em @txtCod com base no sistema passado em
* @cb */
void decodifica(struct cifrasBeale *cb, FILE *txtCod, FILE *txtOut)
{
wchar_t chave;
int num;
while (fscanf(txtCod, "%d", &num) != -1){
if (num == -1) {
... | 4 |
Dblay112/sorting_algorithms | a322ad8 | 2-selection_sort.c | C | www.github.com/Dblay112/sorting_algorithms/tree/main/2-selection_sort.c | https://raw.githubusercontent.com/Dblay112/sorting_algorithms/a322ad8/2-selection_sort.c | Dblay112/sorting_algorithms a322ad8 2-selection_sort.c | true | 200 | 733 | #include "sort.h"
/**
* exchange_ints - interchanges two integers in an array.
* @a: first of the integers to swap
* @b: second of the integers to swap.
*/
void exchange_ints(int *a, int *b)
{
int ex;
ex = *a;
*a = *b;
*b = ex;
}
/**
* selection_sort - selection sort array used to sort array of integers.
*... | 2 |
danielle427/EP-353-ProblemSets | 9b81360 | ProblemSet2/Problem2.4.c | C | www.github.com/danielle427/EP-353-ProblemSets/tree/main/ProblemSet2/Problem2.4.c | https://raw.githubusercontent.com/danielle427/EP-353-ProblemSets/9b81360/ProblemSet2/Problem2.4.c | danielle427/EP-353-ProblemSets 9b81360 ProblemSet2/Problem2.4.c | true | 200 | 1,014 | #include <stdio.h>
int main(){
int MIDIpitch;
int pitch;
printf("Enter the MIDIpitch.\n");
scanf("En%i",&MIDIpitch);
int octave = MIDIpitch / 12 - 1;
int note = MIDIpitch % 12;
char MIDInote;
switch (note) {
case 1: MIDInote ='C'; break;
case 2: printf("C#... | 1 |
yanis59100/holbertonschool-low_level_programming | ac02d55 | 0x02-functions_nested_loops/102-fibonacci.c | C | www.github.com/yanis59100/holbertonschool-low_level_programming/tree/main/0x02-functions_nested_loops/102-fibonacci.c | https://raw.githubusercontent.com/yanis59100/holbertonschool-low_level_programming/ac02d55/0x02-functions_nested_loops/102-fibonacci.c | yanis59100/holbertonschool-low_level_programming ac02d55 0x02-functions_nested_loops/102-fibonacci.c | true | 200 | 431 | #include <stdio.h>
/**
* main - main block
* Description: Print the first 50 fibonacci numbers, starting with 1 and 2.
* Numbers must be coma and space separated.
* Return: 0
*/
int main(void)
{
int x = 2;
long int y = 1, z = 2;
long int a;
printf("%lu, ", y);
while (x <= 50)
{
if (x == 50)
{
printf... | 7 |
s4nat/bytebass | da37205 | main.c | C | www.github.com/s4nat/bytebass/tree/main/main.c | https://raw.githubusercontent.com/s4nat/bytebass/da37205/main.c | s4nat/bytebass da37205 main.c | true | 200 | 3,988 | #include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <math.h>
#include <complex.h>
#include "FFT/fft.h"
#include "fsm/fsm.h"
#include "noteSegmentation/note_segmentation.h"
#define MAX_SEGMENTS 100
typedef struct
{
char chunk_id[4];
uint32_t chunk_size;
char format[4];
c... | 0 |
paulasopena/test-structure | 2d47a9f | lib/arch/Core/Inc/FreeRTOSConfig.h | C | www.github.com/paulasopena/test-structure/tree/main/lib/arch/Core/Inc/FreeRTOSConfig.h | https://raw.githubusercontent.com/paulasopena/test-structure/2d47a9f/lib/arch/Core/Inc/FreeRTOSConfig.h | paulasopena/test-structure 2d47a9f lib/arch/Core/Inc/FreeRTOSConfig.h | true | 200 | 8,403 | /*
* FreeRTOS Kernel V10.2.1
* Copyright (C) 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy of
* this software and associated documentation files (the "Software"), to deal in
* the Software without restriction, includ... | 6 |
bimmerboyy/Cpp | bbaf86b | dunp/drugi_cas_2_januar.c | C | www.github.com/bimmerboyy/Cpp/tree/main/dunp/drugi_cas_2_januar.c | https://raw.githubusercontent.com/bimmerboyy/Cpp/bbaf86b/dunp/drugi_cas_2_januar.c | bimmerboyy/Cpp bbaf86b dunp/drugi_cas_2_januar.c | true | 200 | 1,105 | #include <iostream>
#include <string.h>
#define max 100
void sortiranje(char rec[]){
char pom;
int i, j;
int n = strlen(rec);
for(i = 0; i<n-1; i++){
for(j = 1;j<n; j++ ){
if(rec[i] > rec[j]){
pom = rec[i];
rec[i] = rec[j];
rec[j] = ... | 3 |
TP-ACH/esp32 | f16ca01 | main/constants.h | C | www.github.com/TP-ACH/esp32/tree/main/main/constants.h | https://raw.githubusercontent.com/TP-ACH/esp32/f16ca01/main/constants.h | TP-ACH/esp32 f16ca01 main/constants.h | true | 200 | 896 | #ifndef CONSTANTS_H
#define CONSTANTS_H
#include <Arduino.h>
#define USE_SERIAL Serial
const char* topics_to_sub[] = {
"actuators/light_on",
"actuators/light_off",
"actuators/pumps/ph_down",
"actuators/pumps/ph_up",
"actuators/pumps/water",
"actuators/pumps/nutrient",
"sensors/enable",
"sensors/disabl... | 5 |
huyns1998/rosserial_stm32f407 | 802bbe7 | Drivers/Src/stm32f4xx_hal_msp.c | C | www.github.com/huyns1998/rosserial_stm32f407/tree/main/Drivers/Src/stm32f4xx_hal_msp.c | https://raw.githubusercontent.com/huyns1998/rosserial_stm32f407/802bbe7/Drivers/Src/stm32f4xx_hal_msp.c | huyns1998/rosserial_stm32f407 802bbe7 Drivers/Src/stm32f4xx_hal_msp.c | true | 200 | 13,088 | /* USER CODE BEGIN Header */
/**
******************************************************************************
* @file stm32f4xx_hal_msp.c
* @brief This file provides code for the MSP Initialization
* and de-Initialization codes.
**************************************************... | 2 |
yugd1211/miniRT | 326a2fd | bonus/get_hit_point/hit_cone_bonus.c | C | www.github.com/yugd1211/miniRT/tree/main/bonus/get_hit_point/hit_cone_bonus.c | https://raw.githubusercontent.com/yugd1211/miniRT/326a2fd/bonus/get_hit_point/hit_cone_bonus.c | yugd1211/miniRT 326a2fd bonus/get_hit_point/hit_cone_bonus.c | true | 200 | 4,039 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* hit_cone_bonus.c :+: :+: :+: ... | 4 |
EddysonSinclair/printf | fcc758c | print_ptr.c | C | www.github.com/EddysonSinclair/printf/tree/main/print_ptr.c | https://raw.githubusercontent.com/EddysonSinclair/printf/fcc758c/print_ptr.c | EddysonSinclair/printf fcc758c print_ptr.c | true | 200 | 402 | #include "main.h"
/**
* print_ptr - prints address.
* @ap: variables
* Return: int.
*/
int print_ptr(va_list ap)
{
void *p;
char *a = "(nil)";
long int b;
int i, c;
p = va_arg(ap, void *);
if (p == NULL)
{
for (i = 0; a[i] != '\0'; i++)
{
_putchar(a[i]);
}
return (i);
}
b = (unsigned long i... | 1 |
Gnalynn/alx-low_level_programming | 1a77f4c | 0x09-static_libraries/0-strcat.c | C | www.github.com/Gnalynn/alx-low_level_programming/tree/main/0x09-static_libraries/0-strcat.c | https://raw.githubusercontent.com/Gnalynn/alx-low_level_programming/1a77f4c/0x09-static_libraries/0-strcat.c | Gnalynn/alx-low_level_programming 1a77f4c 0x09-static_libraries/0-strcat.c | true | 200 | 366 | #include "main.h"
/**
* *_strcat - write a function that concatenates two strings
* @dest: pointer destination
* @src: pointer source
* Return: void
*/
char *_strcat(char *dest, char *src)
{
int a;
int b;
a = 0;
while (dest[a] != '\0')
{
a++;
}
b = 0;
while (src[b] != '\0')
{
dest[a] = src[b];
a++;... | 7 |
ewelser/tms9900_libc | 4fe9aa6 | internal/get_handle.c | C | www.github.com/ewelser/tms9900_libc/tree/main/internal/get_handle.c | https://raw.githubusercontent.com/ewelser/tms9900_libc/4fe9aa6/internal/get_handle.c | ewelser/tms9900_libc 4fe9aa6 internal/get_handle.c | true | 200 | 814 | #include <stdio.h>
#include <string.h>
#define MAX_HANDLES 16
FILE handles[MAX_HANDLES];
FILE* __libc_get_handle(const char *mode)
{
struct flagmap
{
int chr;
int flg;
};
static const struct flagmap map[]=
{
{'r', (FFLAG_OPEN | FFLAG_READ)},
{'w', (FFLAG_OPEN | FFLAG_WRITE)},
{'+', (FF... | 0 |
simongiec/rkwifibt | daaf762 | drivers/rtl8822cs/core/rtw_regdb_rtk.c | C | www.github.com/simongiec/rkwifibt/tree/main/drivers/rtl8822cs/core/rtw_regdb_rtk.c | https://raw.githubusercontent.com/simongiec/rkwifibt/daaf762/drivers/rtl8822cs/core/rtw_regdb_rtk.c | simongiec/rkwifibt daaf762 drivers/rtl8822cs/core/rtw_regdb_rtk.c | true | 200 | 48,623 | /******************************************************************************
*
* Copyright(c) 2007 - 2022 Realtek Corporation.
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of version 2 of the GNU General Public License as
* published by the Free Software F... | 6 |
sammykariuki/alx-low_level_programming | a04be2b | 0x05-pointers_arrays_strings/4-print_rev.c | C | www.github.com/sammykariuki/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/4-print_rev.c | https://raw.githubusercontent.com/sammykariuki/alx-low_level_programming/a04be2b/0x05-pointers_arrays_strings/4-print_rev.c | sammykariuki/alx-low_level_programming a04be2b 0x05-pointers_arrays_strings/4-print_rev.c | true | 200 | 336 | #include "main.h"
/**
* print_rev - prints a string in reverse
* @s: input of first pointer of string
* Return: none because it's void
*/
void print_rev(char *s)
{
int counter, i;
counter = 0;
while (*s != '\0')
{
counter++;
s++;
}
s -= 1;
for (i = 0; i < counter; i++)
{
_putchar(*s);
s--;
}
_p... | 3 |
arribas7/Operating_system_project | 76e231c | cpu/src/main.c | C | www.github.com/arribas7/Operating_system_project/tree/main/cpu/src/main.c | https://raw.githubusercontent.com/arribas7/Operating_system_project/76e231c/cpu/src/main.c | arribas7/Operating_system_project 76e231c cpu/src/main.c | true | 200 | 8,115 | #include <stdlib.h>
#include <stdio.h>
#include <utils/client.h>
#include <commons/log.h>
#include <commons/config.h>
//#include <utils/server.h>
//#include <utils/kernel.h>
#include <pthread.h>
//#include <utils/cpu.h>
//#include <math.h>
#include <commons/collections/queue.h>
#include "connections.h"
#include "instru... | 5 |
Debargha2001/1-D-Array-Assignment-1 | ec67208 | adrika mukherjee/sortingandmerging.c | C | www.github.com/Debargha2001/1-D-Array-Assignment-1/tree/main/adrika mukherjee/sortingandmerging.c | https://raw.githubusercontent.com/Debargha2001/1-D-Array-Assignment-1/ec67208/adrika%20mukherjee/sortingandmerging.c | Debargha2001/1-D-Array-Assignment-1 ec67208 adrika mukherjee/sortingandmerging.c | true | 200 | 563 | #include <stdio.h>
void left(int array[], int size) {
int copy = array[0];
for (int i = 0; i < size - 1; i++)
{
array[i] = array[i + 1];
}
array[size - 1] = copy;
}
int main() {
int array[] = {1, 2, 3, 4, 5};
int size = sizeof(array) / sizeof(array[0]);
printf("Origin... | 2 |
Yamboy1/lim | 35855d4 | moudle_3/q17.c | C | www.github.com/Yamboy1/lim/tree/main/moudle_3/q17.c | https://raw.githubusercontent.com/Yamboy1/lim/35855d4/moudle_3/q17.c | Yamboy1/lim 35855d4 moudle_3/q17.c | true | 200 | 286 | #include <stdio.h>
#include <stdint.h>
void printArray(int32_t* const array, size_t n)
{
size_t i=0;
while(i<n) {
int32_t* fun=array + i;
printf("%d", *fun);
i+=1;
}
}
int main(void)
{
int32_t array[3] = {1, 2, 3};
printArray(array, 3);
} | 4 |
updatedabhi/C-programming | f323c40 | function-callByValue.c | C | www.github.com/updatedabhi/C-programming/tree/main/function-callByValue.c | https://raw.githubusercontent.com/updatedabhi/C-programming/f323c40/function-callByValue.c | updatedabhi/C-programming f323c40 function-callByValue.c | true | 200 | 424 | #include<stdio.h>
void swipe(int a, int b);
int main(){
int n1, n2;
printf("Enter any two number: \n");
scanf("%d%d", &n1, &n2);
printf("Number before swipe %d and %d\n", n1, n2);
swipe(n1, n2);
// it won't change
printf("\nThe number after swipe %d and %d", n1, n2);
return 0;
}
void s... | 1 |
dvidos/mini-c-compiler | c22eb61 | src/utils/data_structs/stack.c | C | www.github.com/dvidos/mini-c-compiler/tree/main/src/utils/data_structs/stack.c | https://raw.githubusercontent.com/dvidos/mini-c-compiler/c22eb61/src/utils/data_structs/stack.c | dvidos/mini-c-compiler c22eb61 src/utils/data_structs/stack.c | true | 200 | 2,193 | #include <string.h>
#include <stdlib.h>
#include <stdarg.h>
#include "stack.h"
typedef struct stack_node {
void *item;
struct stack_node *next;
} stack_node;
struct stack {
int items_count;
stack_node *top; // where we push and pop
mempool *mempool;
};
stack *new_stack(mempool *mp) {
stack *... | 7 |
dangeunii/OS_2024 | 54f7957 | project02/sysproc.c | C | www.github.com/dangeunii/OS_2024/tree/main/project02/sysproc.c | https://raw.githubusercontent.com/dangeunii/OS_2024/54f7957/project02/sysproc.c | dangeunii/OS_2024 54f7957 project02/sysproc.c | true | 200 | 1,925 | #include "types.h"
#include "x86.h"
#include "defs.h"
#include "date.h"
#include "param.h"
#include "memlayout.h"
#include "mmu.h"
#include "proc.h"
int
sys_fork(void)
{
return fork();
}
int
sys_exit(void)
{
exit();
return 0; // not reached
}
int
sys_wait(void)
{
return wait();
}
int
sys_kill(void)
{
int... | 0 |
codewithLevis/alx-low_level_programming | 2b82fef | 0x14-bit_manipulation/0-binary_to_uint.c | C | www.github.com/codewithLevis/alx-low_level_programming/tree/main/0x14-bit_manipulation/0-binary_to_uint.c | https://raw.githubusercontent.com/codewithLevis/alx-low_level_programming/2b82fef/0x14-bit_manipulation/0-binary_to_uint.c | codewithLevis/alx-low_level_programming 2b82fef 0x14-bit_manipulation/0-binary_to_uint.c | true | 200 | 611 | #include "main.h"
/**
*binary_to_uint - converts a binary number to an unsigned int
*@b: is pointing to a string of 0 and 1 chars
*Return: the converted number, or 0 if
*there is one or more chars in the string b that is not 0 or 1
*b is NULL
*/
unsigned int binary_to_uint(const char *b)
{
unsigned int num = 0;
uns... | 6 |
felchion/sjever-ts | 3b2f643 | d/group/entry/fzwroad5.c | C | www.github.com/felchion/sjever-ts/tree/main/d/group/entry/fzwroad5.c | https://raw.githubusercontent.com/felchion/sjever-ts/3b2f643/d/group/entry/fzwroad5.c | felchion/sjever-ts 3b2f643 d/group/entry/fzwroad5.c | true | 200 | 543 | // Room: /d/fuzhou/wroad5.c
// Lklv 2001.9.10
inherit ROOM;
void create()
{
set("short", "山路");
set("long", @LONG
这是武夷山脉的一条山路。时值春日，路旁的山坡上到处开满了金黄色的
油菜花。一阵阵山风吹来，空气里弥漫着油菜花的香味。由此向西南方向可进
入两广，往东北可到福州。
LONG
);
set("exits", ([
"southwest" : "/d/fuzhou/wroad6",
"east" : "/d/fuzhou/wroad4",
]));
s... | 3 |
FridaMartinezLorenzo/ProgramacionEstructurada | 0da9631 | problema10.c | C | www.github.com/FridaMartinezLorenzo/ProgramacionEstructurada/tree/main/problema10.c | https://raw.githubusercontent.com/FridaMartinezLorenzo/ProgramacionEstructurada/0da9631/problema10.c | FridaMartinezLorenzo/ProgramacionEstructurada 0da9631 problema10.c | true | 200 | 1,528 | /*
Autor: Frida Ximena Martínez Lorenzo 102-C
Función: Programa que dados numeros enteros en decimal
calcula la suma, resta, multiplicacion y la imprime en
binario octal y hexadecimal
Nombre:problema10.c
Forma de compilar: gcc -Wall problema10.c -lm -o problema10
*/
#include <stdio.h>
#include <s... | 5 |
rsaumya/Practice | 138a648 | Sum.c | C | www.github.com/rsaumya/Practice/tree/main/Sum.c | https://raw.githubusercontent.com/rsaumya/Practice/138a648/Sum.c | rsaumya/Practice 138a648 Sum.c | true | 200 | 179 | #include<iostream>
using namespce std;
int main()
{
int x,y;
int sum;
cout<<"Enter number a & b:";
cin>>x>>y;
sum=x+y;
Cout<<endl<<"Sum of numbers:"<<sum;
return 0;
}
| 2 |
JakeG2004/CYB220 | 99a202f | pres2/lab/memLeak.c | C | www.github.com/JakeG2004/CYB220/tree/main/pres2/lab/memLeak.c | https://raw.githubusercontent.com/JakeG2004/CYB220/99a202f/pres2/lab/memLeak.c | JakeG2004/CYB220 99a202f pres2/lab/memLeak.c | true | 200 | 289 | #include <stdlib.h>
#include <stdio.h>
void AllocateAndReassign()
{
int* ptr = (int*)malloc(10 * sizeof(int));
if (!ptr) return;
ptr = (int*)malloc(20 * sizeof(int)); // Original allocation is lost
free(ptr);
}
int main()
{
AllocateAndReassign();
return 0;
}
| 4 |
Seungmimn/System-programming | 3f3576d | linux_c/file_system/RW.c | C | www.github.com/Seungmimn/System-programming/tree/main/linux_c/file_system/RW.c | https://raw.githubusercontent.com/Seungmimn/System-programming/3f3576d/linux_c/file_system/RW.c | Seungmimn/System-programming 3f3576d linux_c/file_system/RW.c | true | 200 | 501 | #include <fcntl.h>
#include <unistd.h>
#include <stdlib.h>
#include <stdio.h>
int main(void){
int rfd, wfd, n;
char buf[10];
rfd = open("hello.txt", O_RDONLY);
if(rfd == -1){
perror("Open hello.txt");
exit(1);
}
wfd = open("hello.bak", O_CREAT | O_WRONLY | O_TRUNC, 0644);
if(wfd == -1){
perror("Open hel... | 1 |
LinJ0866/calendar-stm32 | 91ee42b | User/layer/clock.c | C | www.github.com/LinJ0866/calendar-stm32/tree/main/User/layer/clock.c | https://raw.githubusercontent.com/LinJ0866/calendar-stm32/91ee42b/User/layer/clock.c | LinJ0866/calendar-stm32 91ee42b User/layer/clock.c | true | 200 | 8,995 | #include "./layer/clock.h"
#include "string.h"
/* ���жϱ�־���������ж�ʱ��1����ʱ�䱻ˢ��֮����0 */
__IO uint32_t TimeDisplay = 0;
#define BUTTON_NUM 5
static uint8_t month[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
/*��ť�ṹ������*/
static Touch_Button button[BUTTON_NUM];
static uint8_t max_dis_count = 2;
stat... | 7 |
harshsrivastava05/dsa-codes | 01b433c | queue/Priority-Queue /Priority-Queue-using-Array.c | C | www.github.com/harshsrivastava05/dsa-codes/tree/main/queue/Priority-Queue /Priority-Queue-using-Array.c | https://raw.githubusercontent.com/harshsrivastava05/dsa-codes/01b433c/queue/Priority-Queue%20/Priority-Queue-using-Array.c | harshsrivastava05/dsa-codes 01b433c queue/Priority-Queue /Priority-Queue-using-Array.c | true | 200 | 1,463 | #include<stdio.h>
#include<limits.h>
#define MAX 100
int idx = -1;
int pqVal[MAX];
int pqPriority[MAX];
int isEmpty(){
return idx == -1;
}
int isFull(){
return idx == MAX - 1;
}
void enqueue(int data, int priority)
{
if(!isFull()){
idx++;
pqVal[idx] = data;
pqPriori... | 0 |
duskygloom/BSc-Sem-III | d6296c5 | data_structures/hash_table/coalesced_hash_table/linked_list.c | C | www.github.com/duskygloom/BSc-Sem-III/tree/main/data_structures/hash_table/coalesced_hash_table/linked_list.c | https://raw.githubusercontent.com/duskygloom/BSc-Sem-III/d6296c5/data_structures/hash_table/coalesced_hash_table/linked_list.c | duskygloom/BSc-Sem-III d6296c5 data_structures/hash_table/coalesced_hash_table/linked_list.c | true | 200 | 651 | #include "linked_list.h"
#include "hash_table.h"
Node *create_node(Movie *movie)
{
Node *node = malloc(sizeof(Node));
node->movie = movie;
node->next = NULL;
return node;
}
bool insert_node(Node *head, Node *node)
{
while (head->next != NULL) {
if (node->movie->name == head->movie->name)
... | 3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.