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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
pablosalina25/holbertonschool-low_level_programming | 7709860 | more_malloc_free/2-calloc.c | C | www.github.com/pablosalina25/holbertonschool-low_level_programming/tree/main/more_malloc_free/2-calloc.c | https://raw.githubusercontent.com/pablosalina25/holbertonschool-low_level_programming/7709860/more_malloc_free/2-calloc.c | pablosalina25/holbertonschool-low_level_programming 7709860 more_malloc_free/2-calloc.c | true | 200 | 525 | #include "main.h"
#include <stdlib.h>
/**
* _calloc - a function that allocates memory
* for an array, using malloc.
* @nmemb: Number of elements.
* @size: Size of each element.
* Return: A pointer to the allocated memory, or NULL on failure.
*/
void *_calloc(unsigned int nmemb, unsigned int size)
{
char *punter... | 4 |
SOURAVcse9/c-basic-code | be7e6a3 | 3_4_23..............................c | C | www.github.com/SOURAVcse9/c-basic-code/tree/main/3_4_23..............................c | https://raw.githubusercontent.com/SOURAVcse9/c-basic-code/be7e6a3/3_4_23..............................c | SOURAVcse9/c-basic-code be7e6a3 3_4_23..............................c | true | 200 | 178 | #include<stdio.h>
int main()
{
char arr[10]="bangladesh";
int i,count=o;
for(i=0;i<10;i++)
{
if(arr[1]='b','a','n','g','l','a','d','e','s','h'}
for()
}
| 7 |
akash0214/C-Programs | ad15f2a | chapter16/e16.c | C | www.github.com/akash0214/C-Programs/tree/main/chapter16/e16.c | https://raw.githubusercontent.com/akash0214/C-Programs/ad15f2a/chapter16/e16.c | akash0214/C-Programs ad15f2a chapter16/e16.c | true | 200 | 707 | #include <stdio.h>
#include <string.h>
#include <ctype.h>
int isVowel(char c)
{
c = tolower(c);
return (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u');
}
int countSuccessiveVowels(char *text)
{
int count = 0;
int length = strlen(text);
for (int i = 0; i < length - 1; i++)
{
... | 2 |
Linkavych/programming | aff4c68 | c/apue/3_file_IO/exercise_6.c | C | www.github.com/Linkavych/programming/tree/main/c/apue/3_file_IO/exercise_6.c | https://raw.githubusercontent.com/Linkavych/programming/aff4c68/c/apue/3_file_IO/exercise_6.c | Linkavych/programming aff4c68 c/apue/3_file_IO/exercise_6.c | true | 200 | 1,235 | /*
* test and prov if you can replace data in an existing file opened
* read-write with the append flag set.
*/
#include "apue.h"
#include <fcntl.h>
int main(void)
{
int fd;
char buf[BUFSIZ];
int n;
int offset;
if ((fd = open("test.file", O_APPEND | O_CREAT | O_RDWR, FILE_MODE)) < 0)
er... | 6 |
oladelewonder/alx-low_level_programming | 1b236b9 | 0x06-pointers_arrays_strings/103-infinite_add.c | C | www.github.com/oladelewonder/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/103-infinite_add.c | https://raw.githubusercontent.com/oladelewonder/alx-low_level_programming/1b236b9/0x06-pointers_arrays_strings/103-infinite_add.c | oladelewonder/alx-low_level_programming 1b236b9 0x06-pointers_arrays_strings/103-infinite_add.c | true | 200 | 1,766 | #include "main.h"
char *add_strings(char *n1, char *n2, char *r, int r_index);
char *infinite_add(char *n1, char *n2, char *r, int size_r);
/**
* add_strings - adds the two numbers stored in two strings
* @n1: the string containing the first number to be added
* @n2: the string containing the second number to be a... | 3 |
Hearthwell/GOL | b7bdbe9 | lib/src/gol.c | C | www.github.com/Hearthwell/GOL/tree/main/lib/src/gol.c | https://raw.githubusercontent.com/Hearthwell/GOL/b7bdbe9/lib/src/gol.c | Hearthwell/GOL b7bdbe9 lib/src/gol.c | true | 200 | 1,580 | #include <stdlib.h>
#include <string.h>
#include <assert.h>
#include "gol.h"
#define GOL_UNDER_POPULATION_TRESH 2
#define GOL_OVER_POPULATION_TRESH 3
static enum GOL_STATE gol_compute_local_state(const struct GOL *gol, unsigned int x, unsigned int y){
const GOL_STATE_t *matrix = (const GOL_STATE_t*)((gol->index... | 5 |
Cubicroots-Playground/golang-eBPF | 3053dbe | packetcounter/counter.c | C | www.github.com/Cubicroots-Playground/golang-eBPF/tree/main/packetcounter/counter.c | https://raw.githubusercontent.com/Cubicroots-Playground/golang-eBPF/3053dbe/packetcounter/counter.c | Cubicroots-Playground/golang-eBPF 3053dbe packetcounter/counter.c | true | 200 | 557 | //go:build ignore
#include <linux/bpf.h>
#include <bpf/bpf_helpers.h>
struct
{
__uint(type, BPF_MAP_TYPE_ARRAY);
__type(key, __u32);
__type(value, __u64);
__uint(max_entries, 1);
} pkt_count SEC(".maps");
// count_packets atomically increases a packet counter on every invocation.
SEC("xdp")
int co... | 4 |
adityasgit25/cnlab | 1d6e093 | leaky.c | C | www.github.com/adityasgit25/cnlab/tree/main/leaky.c | https://raw.githubusercontent.com/adityasgit25/cnlab/1d6e093/leaky.c | adityasgit25/cnlab 1d6e093 leaky.c | true | 200 | 2,039 | #include <stdio.h>
#define MIN(x, y) ((x) < (y) ? (x) : (y)) // Returns the smaller of two values
int main() {
int bucket_size, output_rate, current_count = 0, dropped_packets = 0;
int incoming_packets[100], nsec, i = 0;
// Input the bucket size and output rate
printf("Enter bucket size: ");
sca... | 1 |
reduf/OpenTyria | 6b0739a | code/errors.h | C | www.github.com/reduf/OpenTyria/tree/main/code/errors.h | https://raw.githubusercontent.com/reduf/OpenTyria/6b0739a/code/errors.h | reduf/OpenTyria 6b0739a code/errors.h | true | 200 | 233 | #pragma once
enum
{
ERR_OK = 0,
ERR_UNSUCCESSFUL = 1,
ERR_OUT_OF_MEMORY,
ERR_SERVER_ERROR,
ERR_WOULDBLOCK,
ERR_TIMEOUT,
ERR_BAD_USER_DATA,
ERR_NOT_ENOUGH_DATA,
ERR_BUFFER_TOO_SMALL,
};
| 0 |
Oluwadaracodes/alx-low_level_programming | 004bc21 | 0x01-variables_if_else_while/4-print_alphabt.c | C | www.github.com/Oluwadaracodes/alx-low_level_programming/tree/main/0x01-variables_if_else_while/4-print_alphabt.c | https://raw.githubusercontent.com/Oluwadaracodes/alx-low_level_programming/004bc21/0x01-variables_if_else_while/4-print_alphabt.c | Oluwadaracodes/alx-low_level_programming 004bc21 0x01-variables_if_else_while/4-print_alphabt.c | true | 200 | 267 | #include <stdio.h>
/**
* main - 'print lowercase alphabets except q and e'
*
* Return: 0 always
*/
int main(void)
{
int a = 97;
while (a <= 122)
{
if (a == 101 || a == 113)
{
a++;
continue;
}
putchar(a);
a++;
}
putchar('\n');
return (0);
}
| 2 |
aidancoleman/Parallel-Communication-Avoiding-QR-Factorization-for--Tall--Skinny--Matrices | 1599d93 | tsqr_scale.c | C | www.github.com/aidancoleman/Parallel-Communication-Avoiding-QR-Factorization-for--Tall--Skinny--Matrices/tree/main/tsqr_scale.c | https://raw.githubusercontent.com/aidancoleman/Parallel-Communication-Avoiding-QR-Factorization-for--Tall--Skinny--Matrices/1599d93/tsqr_scale.c | aidancoleman/Parallel-Communication-Avoiding-QR-Factorization-for--Tall--Skinny--Matrices 1599d93 tsqr_scale.c | true | 200 | 20,185 | #include <math.h>
#include <time.h>
#include <stdio.h>
#include <stdlib.h>
#include <omp.h>
#include <lapacke.h>
#include <cblas.h>
#include <string.h>
// Prototype for merging the Q matrices update function.
// blockRows is the number of rows in the Q block (local Q),
// and ncol is the number of columns (== dimy).
v... | 6 |
FranckCoding/holbertonschool-low_level_programming | 400dfb3 | 0x08-recursion/5-sqrt_recursion.c | C | www.github.com/FranckCoding/holbertonschool-low_level_programming/tree/main/0x08-recursion/5-sqrt_recursion.c | https://raw.githubusercontent.com/FranckCoding/holbertonschool-low_level_programming/400dfb3/0x08-recursion/5-sqrt_recursion.c | FranckCoding/holbertonschool-low_level_programming 400dfb3 0x08-recursion/5-sqrt_recursion.c | true | 200 | 666 | #include "main.h"
/**
* _sqrt_recursion - Return the natural square root of a number
*
* @n: The number we want to square
*
* Return: -1 if n not have natural square root else the square
*/
int _sqrt_recursion(int n)
{
int i = 2;
if (n <= 0)
{
return (-1);
}
else if (n == 1)
{
return (n);
}
else
{
... | 7 |
kristoji/arduino-oscilloscope | c06a709 | src/client/plot.c | C | www.github.com/kristoji/arduino-oscilloscope/tree/main/src/client/plot.c | https://raw.githubusercontent.com/kristoji/arduino-oscilloscope/c06a709/src/client/plot.c | kristoji/arduino-oscilloscope c06a709 src/client/plot.c | true | 200 | 2,538 | /**************************************************\
* @file plot.c
*
* @brief Implementation of the functions to plot data
\**************************************************/
#include "plot.h"
FILE *gnuplotPipe = NULL;
void init_gnuplot() {
gnuplotPipe = popen("gnuplot -persistent"... | 1 |
Matteo-Locatelli/master_thesis | 847c30b | bpf_windows/examples_from_linux/lin_helloworld/lin_helloworld.c | C | www.github.com/Matteo-Locatelli/master_thesis/tree/main/bpf_windows/examples_from_linux/lin_helloworld/lin_helloworld.c | https://raw.githubusercontent.com/Matteo-Locatelli/master_thesis/847c30b/bpf_windows/examples_from_linux/lin_helloworld/lin_helloworld.c | Matteo-Locatelli/master_thesis 847c30b bpf_windows/examples_from_linux/lin_helloworld/lin_helloworld.c | true | 200 | 382 | // lin_helloworld.c -> example_helloworld.bpf.c from Linux examples
#include "bpf_helpers.h"
#include "bpf_helper_defs.h"
// tracepoint/syscalls/_execve
SEC("xdp")
int bpf_prog(void *ctx)
{
char msg[] = "Hello, World!";
// bpf_printk only prints numeric arguments -> minimum 0 & maximum 3 -> varargs
b... | 5 |
AdamLBS/my-rpg | f1c119a | lib/my/my_str_to_array.c | C | www.github.com/AdamLBS/my-rpg/tree/main/lib/my/my_str_to_array.c | https://raw.githubusercontent.com/AdamLBS/my-rpg/f1c119a/lib/my/my_str_to_array.c | AdamLBS/my-rpg f1c119a lib/my/my_str_to_array.c | true | 200 | 1,117 | /*
** EPITECH PROJECT, 2021
** my_str_to_array.c
** File description:
** str to array of str
*/
#include "my.h"
#include <stdlib.h>
void str_to_array_next (char ** map, char *str, int *i, int *i_map)
{
int sz;
for (sz = 0; str[(*i) + sz] != '\0' && str[(*i) + sz] != ' '
&& str[(*i) + sz] != '\t' && str[(*... | 4 |
GereonV/fileprocessor | 308f88e | src/main.c | C | www.github.com/GereonV/fileprocessor/tree/main/src/main.c | https://raw.githubusercontent.com/GereonV/fileprocessor/308f88e/src/main.c | GereonV/fileprocessor 308f88e src/main.c | true | 200 | 5,869 | #include <stdlib.h>
#include <stdio.h>
#include <string.h>
#define ERR(...) fprintf(stderr, __VA_ARGS__)
#define PATH_LENGTH 256
typedef struct {
size_t length; // with null-termination
char string[PATH_LENGTH];
} PATH;
typedef enum {
ARGUMENT_VALID,
ARGUMENT_TOO_LONG,
ARGUMENT_OUTPUT_REDEFINED,... | 0 |
zet23t/planecade-test | 5dee0f7 | src/game/components/text_component.c | C | www.github.com/zet23t/planecade-test/tree/main/src/game/components/text_component.c | https://raw.githubusercontent.com/zet23t/planecade-test/5dee0f7/src/game/components/text_component.c | zet23t/planecade-test 5dee0f7 src/game/components/text_component.c | true | 200 | 10,630 | #include "../game_g.h"
#include <rlgl.h>
#include <string.h>
static void DrawTextCodepoint3D(Font font, int codepoint, Matrix m, float fontSize, bool backface, Color tint)
{
// Character index position in sprite font
// NOTE: In case a codepoint is not available in the font, index returned points to '?'... | 3 |
Risperwangui/alx-low_level_programming | 35552f7 | 0x02-functions_nested_loops/1-alphabet.c | C | www.github.com/Risperwangui/alx-low_level_programming/tree/main/0x02-functions_nested_loops/1-alphabet.c | https://raw.githubusercontent.com/Risperwangui/alx-low_level_programming/35552f7/0x02-functions_nested_loops/1-alphabet.c | Risperwangui/alx-low_level_programming 35552f7 0x02-functions_nested_loops/1-alphabet.c | true | 200 | 265 | #include "main.h"
/**
* main - prints alphabets
* Return: Always 0
*
* print_alphabet - prints alphabets in lowercase
*/
void print_alphabet(void)
{
char alphabet;
for (alphabet = 'a'; alphabet <= 'z'; alphabet++)
_putchar(alphabet);
_putchar('\n');
}
| 2 |
bassem-krayem/holbertonschool-low_level_programming | be0f390 | variadic_functions/3-print_all.c | C | www.github.com/bassem-krayem/holbertonschool-low_level_programming/tree/main/variadic_functions/3-print_all.c | https://raw.githubusercontent.com/bassem-krayem/holbertonschool-low_level_programming/be0f390/variadic_functions/3-print_all.c | bassem-krayem/holbertonschool-low_level_programming be0f390 variadic_functions/3-print_all.c | true | 200 | 921 | #include "variadic_functions.h"
#include <stdio.h>
#include <stdarg.h>
/**
* print_all - Prints anything
* @format: Format string indicating the types of arguments passed
*/
void print_all(const char *const format, ...)
{
va_list args;
char *str;
unsigned int i = 0;
char current_format;
va_start(args, format)... | 6 |
byanofsky/simple-compiler | ee35a2d | parser-v1.h | C | www.github.com/byanofsky/simple-compiler/tree/main/parser-v1.h | https://raw.githubusercontent.com/byanofsky/simple-compiler/ee35a2d/parser-v1.h | byanofsky/simple-compiler ee35a2d parser-v1.h | true | 200 | 733 | typedef struct ASTNode ASTNode;
typedef struct StatementList StatementList;
enum NodeType
{
NODE_PROGRAM,
NODE_STATEMENT_LIST,
NODE_STATEMENT,
NODE_PRINT_STATEMENT,
NODE_ASSIGNMENT_STATEMENT,
NODE_EXPRESSION,
NODE_TERM,
NODE_INTEGER,
NODE_VARIABLE,
NODE_OP
};
enum OpType
{
OP_ADD,
OP_MINUS,
};... | 7 |
OGvital/alx-low_level_programming | ad0335c | 0x14-bit_manipulation/2-get_bit.c | C | www.github.com/OGvital/alx-low_level_programming/tree/main/0x14-bit_manipulation/2-get_bit.c | https://raw.githubusercontent.com/OGvital/alx-low_level_programming/ad0335c/0x14-bit_manipulation/2-get_bit.c | OGvital/alx-low_level_programming ad0335c 0x14-bit_manipulation/2-get_bit.c | true | 200 | 421 | #include "main.h"
/**
* get_bit - Gets the value of a bit at a given index
* @n: Thebit.
* @index: The index to get the value at - indicies start at 0
*
* Return: If an error occurs - -1
* Otherwise - The value of bit at index.
*/
int get_bit(unsigned long int n, unsigned int index)
{
if (indx >= (sizeof(... | 5 |
shreya3456/C-fundamental-program | 82aa5c7 | reverse-3var.c | C | www.github.com/shreya3456/C-fundamental-program/tree/main/reverse-3var.c | https://raw.githubusercontent.com/shreya3456/C-fundamental-program/82aa5c7/reverse-3var.c | shreya3456/C-fundamental-program 82aa5c7 reverse-3var.c | true | 200 | 224 | #include<stdio.h>
#include<conio.h>
int main()
{
int m,r=0,n;
printf("Enter a no.");
scanf("%d",&n);
do{
m=n%10;
r=r*10+m;
n=n/10;
}
while(n!=0);
printf("%d is the reversed no.",r);
return 0;
}
| 1 |
griffin-lora/vulkan_basic_demo | a6f8918 | src/vk/core.h | C | www.github.com/griffin-lora/vulkan_basic_demo/tree/main/src/vk/core.h | https://raw.githubusercontent.com/griffin-lora/vulkan_basic_demo/a6f8918/src/vk/core.h | griffin-lora/vulkan_basic_demo a6f8918 src/vk/core.h | true | 200 | 1,249 | #pragma once
#include "vk.h"
#include <stdbool.h>
#include <vk_mem_alloc.h>
#define NUM_FRAMES_IN_FLIGHT 2
typedef union {
uint32_t data[2];
struct {
uint32_t graphics;
uint32_t presentation;
};
} queue_family_indices_t;
extern GLFWwindow* window;
extern VkDevice device;
extern VkPhysical... | 4 |
Class-17/PAT | 15bfe48 | PTA.BasicProgramming/Code-Completion/6-02. 多项式求值.c | C | www.github.com/Class-17/PAT/tree/main/PTA.BasicProgramming/Code-Completion/6-02. 多项式求值.c | https://raw.githubusercontent.com/Class-17/PAT/15bfe48/PTA.BasicProgramming/Code-Completion/6-02.%20%E5%A4%9A%E9%A1%B9%E5%BC%8F%E6%B1%82%E5%80%BC.c | Class-17/PAT 15bfe48 PTA.BasicProgramming/Code-Completion/6-02. 多项式求值.c | true | 200 | 288 | double f(int n, double a[], double x )
{
double sum = a[0];
for(int i = 1; i <= n; i++) {
a[i] *= x; // 从 1次幂开始， 依次求得各个项的结果
sum += a[i];
x *= x; // 求得下一项数的变量值
}
return sum;
} | 0 |
MikeRock51/alx-low_level_programming | 54a1381 | 0x06-pointers_arrays_strings/5-string_toupper.c | C | www.github.com/MikeRock51/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/5-string_toupper.c | https://raw.githubusercontent.com/MikeRock51/alx-low_level_programming/54a1381/0x06-pointers_arrays_strings/5-string_toupper.c | MikeRock51/alx-low_level_programming 54a1381 0x06-pointers_arrays_strings/5-string_toupper.c | true | 200 | 325 | #include "main.h"
/**
* *string_toupper - Changes all lowercase characters in a string
* to uppetcase
* @n: String to convet
*
* Return: Uppercase equivalent of input
*/
char *string_toupper(char *n)
{
int j;
for (j = 0; n[j] != '\0'; j++)
{
if (n[j] > 96 && n[j] < 123)
{
n[j] -= 32;
}
}
return (n... | 3 |
FaishalAnis/MCA | 99d6650 | DSA/Call_By_Reference.c | C | www.github.com/FaishalAnis/MCA/tree/main/DSA/Call_By_Reference.c | https://raw.githubusercontent.com/FaishalAnis/MCA/99d6650/DSA/Call_By_Reference.c | FaishalAnis/MCA 99d6650 DSA/Call_By_Reference.c | true | 200 | 717 | #include <stdio.h>
void updateArray(int *arr, int size) {
for (int i = 0; i < size; i++) {
arr[i] = arr[i] + 5; // Update array elements
}
printf("\nArray inside function (after update): ");
for (int i = 0; i < size; i++) {
printf("%d ", arr[i]);
}
}
int main() {
... | 6 |
huyvawn/learnc | 54a0d99 | session15/reverseArray.c | C | www.github.com/huyvawn/learnc/tree/main/session15/reverseArray.c | https://raw.githubusercontent.com/huyvawn/learnc/54a0d99/session15/reverseArray.c | huyvawn/learnc 54a0d99 session15/reverseArray.c | true | 200 | 898 | #include "stdio.h"
void printArray(float arr1[],int size);
void reverseArray(float arr[],int size);
int reverseArrayexcercise(){
// int main(){
float arr[5];
int size = 5;
for (int i = 0; i < size; ++i) {
printf("\nEnter number %d:", i+1);
scanf("%f", &arr[i]);
}
printArray(arr,... | 2 |
ChimPansky/42_minishell | 99d519d | src/structures/list_var_minishell.c | C | www.github.com/ChimPansky/42_minishell/tree/main/src/structures/list_var_minishell.c | https://raw.githubusercontent.com/ChimPansky/42_minishell/99d519d/src/structures/list_var_minishell.c | ChimPansky/42_minishell 99d519d src/structures/list_var_minishell.c | true | 200 | 2,331 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* list_var_minishell.c :+: :+: :+: ... | 1 |
anternath/Programming-C | 0cd2245 | I_Palindrome.c | C | www.github.com/anternath/Programming-C/tree/main/I_Palindrome.c | https://raw.githubusercontent.com/anternath/Programming-C/0cd2245/I_Palindrome.c | anternath/Programming-C 0cd2245 I_Palindrome.c | true | 200 | 411 | #include<stdio.h>
#include<string.h>
int main(){
char ch[1001];
scanf("%s",&ch);
int pali=0;
int a = strlen(ch)-1;
for(int i=0; i<a; i++){
if(ch[i]==ch[a]){
pali =0;
}
else{
pali = 1;
break;
}
a--;
}
if(pali==0){
... | 7 |
072san/alx-low_level_programming | 60ddff1 | 0x13-more_singly_linked_lists/7-get_nodeint.c | C | www.github.com/072san/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/7-get_nodeint.c | https://raw.githubusercontent.com/072san/alx-low_level_programming/60ddff1/0x13-more_singly_linked_lists/7-get_nodeint.c | 072san/alx-low_level_programming 60ddff1 0x13-more_singly_linked_lists/7-get_nodeint.c | true | 200 | 443 | #include "lists.h"
/**
* get_nodeint_at_index - returns the node at a certain index in a listint_t
* @head: first node in the listint_t
* @index: index of the node to return
* Return: pointer to the node we're looking for, or NULL
*/
listint_t *get_nodeint_at_index(listint_t *head, unsigned int index)
{
unsigned... | 0 |
Fmkwebu/alx-low_level_programming | 60bc115 | 0x14-bit_manipulation/2-get_bit.c | C | www.github.com/Fmkwebu/alx-low_level_programming/tree/main/0x14-bit_manipulation/2-get_bit.c | https://raw.githubusercontent.com/Fmkwebu/alx-low_level_programming/60bc115/0x14-bit_manipulation/2-get_bit.c | Fmkwebu/alx-low_level_programming 60bc115 0x14-bit_manipulation/2-get_bit.c | true | 200 | 404 | #include"main.h"
/**
* get_bit - Returns the value of a bit
* @n: number to check bits
* @index: to check a bit
*
* Return: the value of a bit
*/
int get_bit(unsigned long int n, unsigned int index)
{
unsigned long int divisor, check;
if (index > (sizeof(unsigned long int) * 8 - 1))
return (-1);
divisor = 1... | 4 |
WilliamsNimi/alx-low_level_programming | 795b7ea | 0x12-singly_linked_lists/3-add_node_end.c | C | www.github.com/WilliamsNimi/alx-low_level_programming/tree/main/0x12-singly_linked_lists/3-add_node_end.c | https://raw.githubusercontent.com/WilliamsNimi/alx-low_level_programming/795b7ea/0x12-singly_linked_lists/3-add_node_end.c | WilliamsNimi/alx-low_level_programming 795b7ea 0x12-singly_linked_lists/3-add_node_end.c | true | 200 | 845 | #include "lists.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/**
* add_node_end- This is the add node end function
* Description: THis function adds a node to an existing list at the end
* @head: A pointer to a pointer which is the head of the list
* @str: A string that needs to be duplicated
* Re... | 5 |
chetanck03/DSA | 028e2ce | 02) Array/1)_Insert.c | C | www.github.com/chetanck03/DSA/tree/main/02) Array/1)_Insert.c | https://raw.githubusercontent.com/chetanck03/DSA/028e2ce/02%29%20Array/1%29_Insert.c | chetanck03/DSA 028e2ce 02) Array/1)_Insert.c | true | 200 | 949 | #include<stdio.h>
void display(int arr[], int n){
// Code For Traversal
for(int i=0;i<n;i++){
printf(" %d", arr[i]);
}
printf("\n");
}
int insert ( int arr[], int size, int element, int capacity,int index){
// Code For Insertion
if(size>=capacity){
printf("Insertion Failed...!!... | 2 |
kpatsakis/primevul3 | f35d800 | 7446.c | C | www.github.com/kpatsakis/primevul3/tree/main/7446.c | https://raw.githubusercontent.com/kpatsakis/primevul3/f35d800/7446.c | kpatsakis/primevul3 f35d800 7446.c | true | 200 | 508 | get_smb2_acl(struct cifs_sb_info *cifs_sb,
struct inode *inode, const char *path,
u32 *pacllen, u32 info)
{
struct cifs_ntsd *pntsd = NULL;
struct cifsFileInfo *open_file = NULL;
if (inode && !(info & SACL_SECINFO))
open_file = find_readable_file(CIFS_I(inode), true);
if (!open_file || (info & SACL_S... | 6 |
samyakshingi/Let_Us_C_Solved | 9403222 | 21_f.c | C | www.github.com/samyakshingi/Let_Us_C_Solved/tree/main/21_f.c | https://raw.githubusercontent.com/samyakshingi/Let_Us_C_Solved/9403222/21_f.c | samyakshingi/Let_Us_C_Solved 9403222 21_f.c | true | 200 | 853 | // Write a program to receive an 8-bit number into a variable and then
// exchange its higher 4 bits with lower 4 bits.
/* Program to exchange the contents of numbers two bytes */
# include <stdio.h>
void showbits ( unsigned char ) ;
int main( )
{
unsigned short int num ;
unsigned char a, leftnibble, rightnibble, ne... | 3 |
brainface/havenmud | ae9eab3 | lib/domains/valley/areas/jidoor_forest/npc/wandering_priest.c | C | www.github.com/brainface/havenmud/tree/main/lib/domains/valley/areas/jidoor_forest/npc/wandering_priest.c | https://raw.githubusercontent.com/brainface/havenmud/ae9eab3/lib/domains/valley/areas/jidoor_forest/npc/wandering_priest.c | brainface/havenmud ae9eab3 lib/domains/valley/areas/jidoor_forest/npc/wandering_priest.c | true | 200 | 2,150 | /* ----------------------------------------------------------------------- */
// Area Title: Jidoor Forest
// Filename: wandering_priest.c
// Author: Derek Noble
// Angel: dylanthalus@haven
// Creation Date: August 23rd, 1998
// Abstract: This is a wandering priest of the Magildans who shouts word
// of the ... | 4 |
Youneshallal/Projet-Arbre-de-couverture-minimum | 15ec239 | src/edge.c | C | www.github.com/Youneshallal/Projet-Arbre-de-couverture-minimum/tree/main/src/edge.c | https://raw.githubusercontent.com/Youneshallal/Projet-Arbre-de-couverture-minimum/15ec239/src/edge.c | Youneshallal/Projet-Arbre-de-couverture-minimum 15ec239 src/edge.c | true | 200 | 1,469 | #include <stdio.h>
#include <stdlib.h>
#include "edge.h"
edge_t edge_new(int id_departure, int id_arrival, double cost) {
edge_t e;
if(id_departure ==INCONNUE & cost==INFINIE & id_arrival>=0){
e.id_departure = id_departure ;
e.id_arrival = id_arrival ;
e.cost = cost ;
return e;
}
i... | 0 |
GAsNA/get_next_line | d60b72a | get_next_line_utils.c | C | www.github.com/GAsNA/get_next_line/tree/main/get_next_line_utils.c | https://raw.githubusercontent.com/GAsNA/get_next_line/d60b72a/get_next_line_utils.c | GAsNA/get_next_line d60b72a get_next_line_utils.c | true | 200 | 2,197 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* get_next_line_utils.c :+: :+: :+: ... | 7 |
ChunchoMetalero/CC4302-Sistemas-Operativos | dd6379f | T3/disk.c | C | www.github.com/ChunchoMetalero/CC4302-Sistemas-Operativos/tree/main/T3/disk.c | https://raw.githubusercontent.com/ChunchoMetalero/CC4302-Sistemas-Operativos/dd6379f/T3/disk.c | ChunchoMetalero/CC4302-Sistemas-Operativos dd6379f T3/disk.c | true | 200 | 1,715 | #include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <stdio.h>
#include <pthread.h>
#include "disk.h"
#include "pss.h"
/*****************************************************
* Agregue aca los tipos, variables globales u otras
* funciones que necesite
************************************************... | 5 |
Mehmood-Deshmukh/COEP-Data-Structures-and-Algorithms | 347546e | Fundamentals of Data Structures in C/Chapter 4 - LinkedLists/4.5 Additional List Operations/concatenate.c | C | www.github.com/Mehmood-Deshmukh/COEP-Data-Structures-and-Algorithms/tree/main/Fundamentals of Data Structures in C/Chapter 4 - LinkedLists/4.5 Additional List Operations/concatenate.c | https://raw.githubusercontent.com/Mehmood-Deshmukh/COEP-Data-Structures-and-Algorithms/347546e/Fundamentals%20of%20Data%20Structures%20in%20C/Chapter%204%20-%20LinkedLists/4.5%20Additional%20List%20Operations/concatenate.c | Mehmood-Deshmukh/COEP-Data-Structures-and-Algorithms 347546e Fundamentals of Data Structures in C/Chapter 4 - LinkedLists/4.5 Additional List Operations/concatenate.c | true | 200 | 766 | #include <stdio.h>
#include "..\..\..\Data Structures\Singly LinkedList\logic.c"
List concatenate(List head1, List head2);
int main() {
List list1, list2, List3;
init(&list1);
init(&list2);
append(&list1, 1);
append(&list1, 2);
append(&list1, 3);
printf("First ");
display(list1);
... | 6 |
Asarebea/alx-low_level_programming | 3ef2f17 | 0x0C-more_malloc_free/0-malloc_checked.c | C | www.github.com/Asarebea/alx-low_level_programming/tree/main/0x0C-more_malloc_free/0-malloc_checked.c | https://raw.githubusercontent.com/Asarebea/alx-low_level_programming/3ef2f17/0x0C-more_malloc_free/0-malloc_checked.c | Asarebea/alx-low_level_programming 3ef2f17 0x0C-more_malloc_free/0-malloc_checked.c | true | 200 | 312 | #include <stdlib.h>
#include "main.h"
/**
* *malloc_checked - Entry point
* Description: allocates memory using malloc
* @b: number of byte
* Return: pointer to memory
*/
void *malloc_checked(unsigned int b)
{
void *pointer;
pointer = malloc(b);
if (pointer == NULL)
exit(98);
return (pointer);
}
| 3 |
lfherreragaray/PDM_Practica5 | e7cfc9d | Drivers/API/Inc/API_uart.h | C | www.github.com/lfherreragaray/PDM_Practica5/tree/main/Drivers/API/Inc/API_uart.h | https://raw.githubusercontent.com/lfherreragaray/PDM_Practica5/e7cfc9d/Drivers/API/Inc/API_uart.h | lfherreragaray/PDM_Practica5 e7cfc9d Drivers/API/Inc/API_uart.h | true | 200 | 612 | /*
* API_uart.h
*
* Created on: Nov 20, 2023
* Author: ubuntu
*/
#ifndef API_INC_API_UART_H_
#define API_INC_API_UART_H_
#endif /* API_INC_API_UART_H_ */
#ifndef __STDINT_H
#include "stdint.h"
#endif
#ifndef __STDBOOL_H
#include "stdbool.h"
#endif
#ifndef __ASSERT_H
#include <assert.h>
#endif
#include "... | 2 |
ChimeHQ/marpa-xcframework | b6d205d | marpa.xcframework/ios-arm64/marpa.framework/Headers/marpa.h | C | www.github.com/ChimeHQ/marpa-xcframework/tree/main/marpa.xcframework/ios-arm64/marpa.framework/Headers/marpa.h | https://raw.githubusercontent.com/ChimeHQ/marpa-xcframework/b6d205d/marpa.xcframework/ios-arm64/marpa.framework/Headers/marpa.h | ChimeHQ/marpa-xcframework b6d205d marpa.xcframework/ios-arm64/marpa.framework/Headers/marpa.h | true | 200 | 26,356 | /*
* Copyright 2018 Jeffrey Kegler
* 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, including without limitation
* the rights to use, copy, modify, merge, publish, di... | 1 |
omarel1125/lab10 | 9a4a3e4 | lab10.c | C | www.github.com/omarel1125/lab10/tree/main/lab10.c | https://raw.githubusercontent.com/omarel1125/lab10/9a4a3e4/lab10.c | omarel1125/lab10 9a4a3e4 lab10.c | true | 200 | 2,851 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define ALPHABET_SIZE 26
// Trie node structure
struct TrieNode {
struct TrieNode *children[ALPHABET_SIZE];
int count; // To store the count of occurrences of the word
};
// Initializes a new Trie node
struct TrieNode *createTrieNode() {
struct ... | 7 |
hamza-essalhi/alx-low_level_programming | f0b2138 | 0x13-more_singly_linked_lists/7-get_nodeint.c | C | www.github.com/hamza-essalhi/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/7-get_nodeint.c | https://raw.githubusercontent.com/hamza-essalhi/alx-low_level_programming/f0b2138/0x13-more_singly_linked_lists/7-get_nodeint.c | hamza-essalhi/alx-low_level_programming f0b2138 0x13-more_singly_linked_lists/7-get_nodeint.c | true | 200 | 563 |
#include "lists.h"
/*Code by Hamza essalhi*/
/**
* get_nodeint_at_index - Returns the node at a given
* position in a linked list.
*
* @head: Pointer to the first element of the list.
* @index: Index of the node to return (starting from 0).
*
* Return: Pointer to the node at the given index, or NULL.
**/
li... | 4 |
GeorgeDelSims/Minishell | b379351 | srcs/exec_single_command.c | C | www.github.com/GeorgeDelSims/Minishell/tree/main/srcs/exec_single_command.c | https://raw.githubusercontent.com/GeorgeDelSims/Minishell/b379351/srcs/exec_single_command.c | GeorgeDelSims/Minishell b379351 srcs/exec_single_command.c | true | 200 | 2,418 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* exec_single_command.c :+: :+: :+: ... | 5 |
qin0619/51-project | d851d1b | 2.2 led闪烁/main.c | C | www.github.com/qin0619/51-project/tree/main/2.2 led闪烁/main.c | https://raw.githubusercontent.com/qin0619/51-project/d851d1b/2.2%20led%E9%97%AA%E7%83%81/main.c | qin0619/51-project d851d1b 2.2 led闪烁/main.c | true | 200 | 291 | #include <REGX52.H>
#include <INTRINS.H>
void Delay500ms() //@12.000MHz
{
unsigned char i, j, k;
_nop_();
i = 4;
j = 205;
k = 187;
do
{
do
{
while (--k);
} while (--j);
} while (--i);
}
void main(){
while(1){
P2 = 0xFE;
Delay500ms();
P2 = 0xFF;
Delay500ms();
}
} | 3 |
DhumalAkshata/Programming-Practice | 9c2d8c6 | LogicBuilding_C/program45.c | C | www.github.com/DhumalAkshata/Programming-Practice/tree/main/LogicBuilding_C/program45.c | https://raw.githubusercontent.com/DhumalAkshata/Programming-Practice/9c2d8c6/LogicBuilding_C/program45.c | DhumalAkshata/Programming-Practice 9c2d8c6 LogicBuilding_C/program45.c | true | 200 | 629 | //take one number from user and check wether it is completely divisible by 3 or not
#include<stdio.h>
#include<stdbool.h>
bool CheckDivisible(int iNo)
{
if(iNo % 3 == 0)
{
return true;
}
else
{
return false;
}
}
int main()
{
int iValue = 0;
bool bRe... | 1 |
mynameisjul/minishell | c21f54a | srcs/jularsing/extract_utils.c | C | www.github.com/mynameisjul/minishell/tree/main/srcs/jularsing/extract_utils.c | https://raw.githubusercontent.com/mynameisjul/minishell/c21f54a/srcs/jularsing/extract_utils.c | mynameisjul/minishell c21f54a srcs/jularsing/extract_utils.c | true | 200 | 2,358 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* extract_utils.c :+: :+: :+: ... | 0 |
mouadhgit/TCPServerClient | 7fd4b9e | Src/Server.c | C | www.github.com/mouadhgit/TCPServerClient/tree/main/Src/Server.c | https://raw.githubusercontent.com/mouadhgit/TCPServerClient/7fd4b9e/Src/Server.c | mouadhgit/TCPServerClient 7fd4b9e Src/Server.c | true | 200 | 6,782 | /**
* Copyright (C) 2022
*
* \file Server.c
* \brief Multiclients TCP server listens to address 127.0.0.1 on port 3456 support 10 Clients
* \author Mouadh Dahech
* \platform x86 linux machine
*
* \addtogroup
* \{
*/
/***************************************************************************... | 6 |
Omaar612/alx-low_level_programming | 61e4f1f | 0x13-more_singly_linked_lists/3-add_nodeint_end.c | C | www.github.com/Omaar612/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/3-add_nodeint_end.c | https://raw.githubusercontent.com/Omaar612/alx-low_level_programming/61e4f1f/0x13-more_singly_linked_lists/3-add_nodeint_end.c | Omaar612/alx-low_level_programming 61e4f1f 0x13-more_singly_linked_lists/3-add_nodeint_end.c | true | 200 | 533 | #include "lists.h"
/**
* add_nodeint_end - adds a node at the end of a linked list
* @head: pointer to the first element in the list
* @n: data to insert in the new element
*
* Return: pointer to the new node, or NULL if it fails
*/
listint_t *add_nodeint_end(listint_t **head, const int n)
{
listint_t *p;
listin... | 2 |
GabrielChavesMendes/Faculdade | 2ccb488 | AEDS1/AEDS1_Maratona/OBI_EX2.c | C | www.github.com/GabrielChavesMendes/Faculdade/tree/main/AEDS1/AEDS1_Maratona/OBI_EX2.c | https://raw.githubusercontent.com/GabrielChavesMendes/Faculdade/2ccb488/AEDS1/AEDS1_Maratona/OBI_EX2.c | GabrielChavesMendes/Faculdade 2ccb488 AEDS1/AEDS1_Maratona/OBI_EX2.c | true | 200 | 602 | #include <stdio.h>
int main(){
int L, C;
printf("Escreva a largura: ");
scanf("%d", &L);
printf("Escreva o comprimento: ");
scanf("%d", &C);
int lajota3 = 1; //tanto no comprimento quanto na largura ele ocupa 1cm no total, pois � 0,5 em cada ponta
int largura2 = L - lajota3;
int compri2 = C... | 7 |
Nomthy31/alx-low_level_programming | d9fb730 | 0x13-more_singly_linked_lists/3-add_nodeint_end.c | C | www.github.com/Nomthy31/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/3-add_nodeint_end.c | https://raw.githubusercontent.com/Nomthy31/alx-low_level_programming/d9fb730/0x13-more_singly_linked_lists/3-add_nodeint_end.c | Nomthy31/alx-low_level_programming d9fb730 0x13-more_singly_linked_lists/3-add_nodeint_end.c | true | 200 | 549 | #include "lists.h"
/**
* add_nodeint_end - inserts a node at the end of a linked list
* @head: pointer to the first node in the list
* @n: data to put in the new node
* Return: pointer to the new node
*/
listint_t *add_nodeint_end(listint_t **head, const int n)
{
listint_t *new;
listint_t *temp = *head;
new ... | 4 |
Mdlalose4life/alx-low_level_programming | 90838a7 | 0x05-pointers_arrays_strings/0-reset_to_98.c | C | www.github.com/Mdlalose4life/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/0-reset_to_98.c | https://raw.githubusercontent.com/Mdlalose4life/alx-low_level_programming/90838a7/0x05-pointers_arrays_strings/0-reset_to_98.c | Mdlalose4life/alx-low_level_programming 90838a7 0x05-pointers_arrays_strings/0-reset_to_98.c | true | 200 | 203 | #include "main.h"
/**
* reset_to_98 - reassign the value of pointer form *n = 402 to 8n = 98.
* @n: Original value of *n.
* Return: Uptadeted value of *n.
*/
void reset_to_98(int *n)
{
*n = 98;
}
| 5 |
KoushikBinary1/codemind-c | 5228448 | Find_Numbers_with_Even_Number_of_Digits.c | C | www.github.com/KoushikBinary1/codemind-c/tree/main/Find_Numbers_with_Even_Number_of_Digits.c | https://raw.githubusercontent.com/KoushikBinary1/codemind-c/5228448/Find_Numbers_with_Even_Number_of_Digits.c | KoushikBinary1/codemind-c 5228448 Find_Numbers_with_Even_Number_of_Digits.c | true | 200 | 310 | #include <stdio.h>
int even(int a){
int rem,b=0;
while(a>0){
rem=a%10;
a=a/10;
b++;
}
return b;
}
int main(){
int a,i,b=0;
scanf("%d",&a);
int n[a];
for(i=0;i<a;i++){
scanf("%d",&n[i]);
if(even(n[i])%2==0) b++;
}
printf("%d",b);
} | 3 |
AndreVassoler/C | 0bf337f | Exercicio_02/lista.c | C | www.github.com/AndreVassoler/C/tree/main/Exercicio_02/lista.c | https://raw.githubusercontent.com/AndreVassoler/C/0bf337f/Exercicio_02/lista.c | AndreVassoler/C 0bf337f Exercicio_02/lista.c | true | 200 | 2,597 | #include "lista.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct TaskList* initializeTaskList() {
struct TaskList* newList = (struct TaskList*)malloc(sizeof(struct TaskList));
newList->head = NULL;
newList->tail = NULL;
return newList;
}
void insertOrdered(struct TaskList* list, ch... | 1 |
TM-PCM/366-B2207A-PC-LowVol-Ctrl | cb22309 | Core/Inc/main.h | C | www.github.com/TM-PCM/366-B2207A-PC-LowVol-Ctrl/tree/main/Core/Inc/main.h | https://raw.githubusercontent.com/TM-PCM/366-B2207A-PC-LowVol-Ctrl/cb22309/Core/Inc/main.h | TM-PCM/366-B2207A-PC-LowVol-Ctrl cb22309 Core/Inc/main.h | true | 200 | 3,194 | /* USER CODE BEGIN Header */
/**
******************************************************************************
* @file : main.h
* @brief : Header for main.c file.
* This file contains the common defines of the application.
*************************************************... | 6 |
drayne01/alx-low_level_programming | 2329580 | 0x04-more_functions_nested_loops/4-print_most_numbers.c | C | www.github.com/drayne01/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/4-print_most_numbers.c | https://raw.githubusercontent.com/drayne01/alx-low_level_programming/2329580/0x04-more_functions_nested_loops/4-print_most_numbers.c | drayne01/alx-low_level_programming 2329580 0x04-more_functions_nested_loops/4-print_most_numbers.c | true | 200 | 358 | #include "main.h"
/**
* print_most_numbers - checks for checks for a digit (0 through 9).
* Description: Prints the numbers excluding 2 and 4
* Return: The numbers sinc 0 up to 9
*/
void print_most_numbers(void)
{
int c = 0;
for (; c <= 9; c++)
{
if (c == 2 || c == 4)
{
continue;
} else
{
_putcha... | 3 |
TechOgede/alx-low_level_programming | ca876a8 | 0x0E-structures_typedef/5-free_dog.c | C | www.github.com/TechOgede/alx-low_level_programming/tree/main/0x0E-structures_typedef/5-free_dog.c | https://raw.githubusercontent.com/TechOgede/alx-low_level_programming/ca876a8/0x0E-structures_typedef/5-free_dog.c | TechOgede/alx-low_level_programming ca876a8 0x0E-structures_typedef/5-free_dog.c | true | 200 | 302 | #include "dog.h"
/**
* free_dog - frees data blocks allocated in creating dog_t
* @d: pointer to the struct dog_t
*
* Description: uses free() to free prev allocated memory
* Return: no return value
*/
void free_dog(dog_t *d)
{
if (d == NULL)
return;
free(d->name);
free(d->owner);
free(d);
}
| 0 |
Ahmedshaaban1114/alx-low_level_programming | 59efa52 | 0x17-doubly_linked_lists/2-add_dnodeint.c | C | www.github.com/Ahmedshaaban1114/alx-low_level_programming/tree/main/0x17-doubly_linked_lists/2-add_dnodeint.c | https://raw.githubusercontent.com/Ahmedshaaban1114/alx-low_level_programming/59efa52/0x17-doubly_linked_lists/2-add_dnodeint.c | Ahmedshaaban1114/alx-low_level_programming 59efa52 0x17-doubly_linked_lists/2-add_dnodeint.c | true | 200 | 548 | #include "lists.h"
/**
* add_dnodeint - add new head node to dlist
*
* @head: address of pointer to current head node
*
* @n: int field of new node
*
* Return: address of new node or NULL
*/
dlistint_t *add_dnodeint(dlistint_t **head, const int n)
{
dlistint_t *new = malloc(sizeof(dlistint_t));
if (!head ||... | 1 |
Rash499/Data-Structures-and-Algorithms | 9c58a46 | C/Queues/Q1.c | C | www.github.com/Rash499/Data-Structures-and-Algorithms/tree/main/C/Queues/Q1.c | https://raw.githubusercontent.com/Rash499/Data-Structures-and-Algorithms/9c58a46/C/Queues/Q1.c | Rash499/Data-Structures-and-Algorithms 9c58a46 C/Queues/Q1.c | true | 200 | 1,023 | #include<stdio.h>
#include<stdbool.h>
#include<stdlib.h>
#define MAX 3
char* arr[MAX];
int front = -1;
int rear = -1;
bool isFull(){
if(rear >= MAX -1){
return true;
}
else{
return false;
}
}
bool isEmpty(){
if(front == -1 && rear == -1){
return true;
}
... | 6 |
Aakasharvind/Restaurant-mgmt-system | 8b9d78e | Restaurant-mgmt/2020506001_projectcode.c | C | www.github.com/Aakasharvind/Restaurant-mgmt-system/tree/main/Restaurant-mgmt/2020506001_projectcode.c | https://raw.githubusercontent.com/Aakasharvind/Restaurant-mgmt-system/8b9d78e/Restaurant-mgmt/2020506001_projectcode.c | Aakasharvind/Restaurant-mgmt-system 8b9d78e Restaurant-mgmt/2020506001_projectcode.c | true | 200 | 14,606 | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<ctype.h>
int sum=0;
struct node
{
char foodname[50];
int quantity;
float price;
int data;
char type[30];
struct node *prev;
struct node *next;
};
struct node *adc = NULL,*t,*cust = NULL;
struct node *ads = NUL... | 0 |
Paranoid-Pufferfish/Echo_Server_C | 5a10c7c | main-client.c | C | www.github.com/Paranoid-Pufferfish/Echo_Server_C/tree/main/main-client.c | https://raw.githubusercontent.com/Paranoid-Pufferfish/Echo_Server_C/5a10c7c/main-client.c | Paranoid-Pufferfish/Echo_Server_C 5a10c7c main-client.c | true | 200 | 967 | #include <math.h>
#include <stdio.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netdb.h>
#include <stdlib.h>
#include <string.h>
#include <arpa/inet.h>
#include <sys/types.h>
#include <sys/socket.h>
int main(void) {
struct addrinfo hints = {0}, *res;
hints.ai_family = AF_UNSPEC;
hints.ai_sock... | 3 |
Solomon-Kebede/binary_trees | 5da25df | 13-binary_tree_nodes.c | C | www.github.com/Solomon-Kebede/binary_trees/tree/main/13-binary_tree_nodes.c | https://raw.githubusercontent.com/Solomon-Kebede/binary_trees/5da25df/13-binary_tree_nodes.c | Solomon-Kebede/binary_trees 5da25df 13-binary_tree_nodes.c | true | 200 | 776 | #include "binary_trees.h"
/**
* binary_tree_is_leaf - check node leaf or not
* @node: node to check
* Return: 1 if node if leaf 0 if not
*/
int binary_tree_is_leaf(const binary_tree_t *node)
{
if (node == NULL)
return (0);
else if (node->left == NULL && node->right == NULL)
return (1);
return (0);
}
/**
* b... | 1 |
rodrigomk7/EjerciciosProg1 | e17fe81 | Practico Nº 4/p4ejercicio17.c | C | www.github.com/rodrigomk7/EjerciciosProg1/tree/main/Practico Nº 4/p4ejercicio17.c | https://raw.githubusercontent.com/rodrigomk7/EjerciciosProg1/e17fe81/Practico%20N%C2%BA%204/p4ejercicio17.c | rodrigomk7/EjerciciosProg1 e17fe81 Practico Nº 4/p4ejercicio17.c | true | 200 | 1,059 | #include <stdio.h>
#include <cym_matriz.h>
#include <cym_vector.h>
void insertar_vector_fila(int ,int , int *,int m1[][50], int m2[][50]);
int main(int argc, char *argv[])
{
int m,n,M1[50][50],M2[50][50],V[30]={};
do
{
printf("Ingrese numero de filas:");
scanf("%d",&m);
}while(m<=0||(m%2!=0));
do
{... | 6 |
Jigchu/CS50x | 35f64e5 | wk_4/pset-4/reverse/reverse.c | C | www.github.com/Jigchu/CS50x/tree/main/wk_4/pset-4/reverse/reverse.c | https://raw.githubusercontent.com/Jigchu/CS50x/35f64e5/wk_4/pset-4/reverse/reverse.c | Jigchu/CS50x 35f64e5 wk_4/pset-4/reverse/reverse.c | true | 200 | 2,296 | #include <math.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "wav.h"
int check_format(WAVHEADER header);
int get_block_size(WAVHEADER header);
int main(int argc, char *argv[])
{
// Ensure proper usage
if (argc != 3)
{
printf("Usage: ./reverse input.wav... | 0 |
ammaralmorsi/real-time-os-scheduler | 53638bf | inc/pcb.h | C | www.github.com/ammaralmorsi/real-time-os-scheduler/tree/main/inc/pcb.h | https://raw.githubusercontent.com/ammaralmorsi/real-time-os-scheduler/53638bf/inc/pcb.h | ammaralmorsi/real-time-os-scheduler 53638bf inc/pcb.h | true | 200 | 478 | #ifndef PCB_H
#define PCB_H
#include "process-input-information.h"
typedef enum process_state
{
NONE_PS = 0,
STARTED,
RESUMED,
STOPPED,
FINISHED
} process_state;
typedef struct process_control_block
{
process_state curr_state;
piinfo given_info; /*given from the generator*/
int sys_id... | 3 |
aroussel-data/linux_kernel_dev | 9ca0ba8 | sysrq_debugfs/debugfs.c | C | www.github.com/aroussel-data/linux_kernel_dev/tree/main/sysrq_debugfs/debugfs.c | https://raw.githubusercontent.com/aroussel-data/linux_kernel_dev/9ca0ba8/sysrq_debugfs/debugfs.c | aroussel-data/linux_kernel_dev 9ca0ba8 sysrq_debugfs/debugfs.c | true | 200 | 1,591 | #include <linux/module.h>
#include <linux/init.h>
#include <linux/fs.h>
#include <linux/debugfs.h>
#include <linux/uaccess.h>
#include <linux/slab.h>
static struct dentry *parent, *filen;
static u32 val = (u32) 888;
static u32 val32 = (u32) 777;
#define MAXSTRING 32
static ssize_t
my_read(struct file *file, char __us... | 1 |
dani198/alx-low_level_programming | 008d749 | 0x0C-more_malloc_free/1-string_nconcat.c | C | www.github.com/dani198/alx-low_level_programming/tree/main/0x0C-more_malloc_free/1-string_nconcat.c | https://raw.githubusercontent.com/dani198/alx-low_level_programming/008d749/0x0C-more_malloc_free/1-string_nconcat.c | dani198/alx-low_level_programming 008d749 0x0C-more_malloc_free/1-string_nconcat.c | true | 200 | 833 | #include "main.h"
#include <stdlib.h>
/**
* string_nconcat - Concatenates two strings using at
*
* most an inputted number of bytes.
*
* @s1: The first string.
* @s2: The second string.
*
* @n: The maximum number of bytes of s2 to concatenate to s1.
* Return: If the function fails - NULL.
* Otherwise ... | 6 |
liang0716/C_language_teach_book | e92e0c3 | chapter11/11-4.c | C | www.github.com/liang0716/C_language_teach_book/tree/main/chapter11/11-4.c | https://raw.githubusercontent.com/liang0716/C_language_teach_book/e92e0c3/chapter11/11-4.c | liang0716/C_language_teach_book e92e0c3 chapter11/11-4.c | true | 200 | 809 | //11-4 11-5
#include <stdio.h>
#include <stdlib.h>
struct time
{
int hour;
int min;
double sec;
};
int main(void)
{
struct time start ={12, 32, 25.49}, end = {15, 12, 17.53}, elapse;
printf("%02d\\%02d\\%04.2f\n", start.hour, start.min, start.sec);
printf("%02d\\%02d\\%04.2f\n", end.hour, end.min, end.sec)... | 0 |
georgekwm1/binary_trees | 28a14fa | 4-binary_tree_is_leaf.c | C | www.github.com/georgekwm1/binary_trees/tree/main/4-binary_tree_is_leaf.c | https://raw.githubusercontent.com/georgekwm1/binary_trees/28a14fa/4-binary_tree_is_leaf.c | georgekwm1/binary_trees 28a14fa 4-binary_tree_is_leaf.c | true | 200 | 372 | #include <stdlib.h>
#include <stdio.h>
#include "binary_trees.h"
/**
* binary_tree_is_leaf - function that checks if a node is a leaf
* @node: Node to check
* Return: 0 if not leaf or 1 if leaf
*/
int binary_tree_is_leaf(const binary_tree_t *node)
{
if (node == NULL)
return (0);
if (node->left == NULL && node-... | 3 |
abdelhafid-mahmoudi-env/RSA-Factoring-Challenge | 7c1609e | rsa.c | C | www.github.com/abdelhafid-mahmoudi-env/RSA-Factoring-Challenge/tree/main/rsa.c | https://raw.githubusercontent.com/abdelhafid-mahmoudi-env/RSA-Factoring-Challenge/7c1609e/rsa.c | abdelhafid-mahmoudi-env/RSA-Factoring-Challenge 7c1609e rsa.c | true | 200 | 659 | #include "factor.h"
/**
* main - Entry point, RSA factorizes numbers from a file.
* @argc: Argument count.
* @argv: Argument vector.
* Return: Exit status.
*/
int main(int argc, char *argv[])
{
FILE *file;
long long n, prime1, prime2;
if (argc != 2)
{
printf("Usage: %s <file>\n", argv[0])... | 6 |
OssamaTammam/EEC346-EmbeddedSystems | be3d233 | lab_6/lab_6.c | C | www.github.com/OssamaTammam/EEC346-EmbeddedSystems/tree/main/lab_6/lab_6.c | https://raw.githubusercontent.com/OssamaTammam/EEC346-EmbeddedSystems/be3d233/lab_6/lab_6.c | OssamaTammam/EEC346-EmbeddedSystems be3d233 lab_6/lab_6.c | true | 200 | 4,537 | /*******************************************************
This program was created by the
CodeWizardAVR V3.14 Advanced
Automatic Program Generator
� Copyright 1998-2014 Pavel Haiduc, HP InfoTech s.r.l.
http://www.hpinfotech.com
Project :
Version :
Date : 25-Mar-2024
Author :
Company :
Comments:
... | 1 |
Lalou22/holbertonschool-low_level_programming | c3def0e | 0x15-file_io/2-append_text_to_file.c | C | www.github.com/Lalou22/holbertonschool-low_level_programming/tree/main/0x15-file_io/2-append_text_to_file.c | https://raw.githubusercontent.com/Lalou22/holbertonschool-low_level_programming/c3def0e/0x15-file_io/2-append_text_to_file.c | Lalou22/holbertonschool-low_level_programming c3def0e 0x15-file_io/2-append_text_to_file.c | true | 200 | 1,197 | /*
* File: 2-append_text_to_file.c
* Auth: Lalo Rdz
*/
#include "main.h"
/**
* append_text_to_file - Function that appends text at the end of a file.
* @filename: Name of the file to create.
* @text_content: String to write to the file.
*
* Description: Function that appends text at the end of a file.
* If te... | 0 |
mdafonso/Exercicios---Linguagem-C | 30863f7 | Exercicios/Exercicio 35.c | C | www.github.com/mdafonso/Exercicios---Linguagem-C/tree/main/Exercicios/Exercicio 35.c | https://raw.githubusercontent.com/mdafonso/Exercicios---Linguagem-C/30863f7/Exercicios/Exercicio%2035.c | mdafonso/Exercicios---Linguagem-C 30863f7 Exercicios/Exercicio 35.c | true | 200 | 1,638 | //Uma empresa de aluguel de carros precisa cobrar pelos seus serviços. O aluguel de um carro custa R$90 por dia para carro popular e R$150 por dia para carro de luxo. Além disso, o cliente paga por Km percorrido. Faça um programa que leia o tipo de carro alugado (popular ou luxo), quantos dias de aluguel e quantos Km f... | 6 |
mucahitcakmak/42-push_swap | effef8d | arguman_check.c | C | www.github.com/mucahitcakmak/42-push_swap/tree/main/arguman_check.c | https://raw.githubusercontent.com/mucahitcakmak/42-push_swap/effef8d/arguman_check.c | mucahitcakmak/42-push_swap effef8d arguman_check.c | true | 200 | 2,471 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* arguman_check.c :+: :+: :+: ... | 1 |
Famalan/mat_prak_lab | 502ad0f | lab1.2/lab02.c | C | www.github.com/Famalan/mat_prak_lab/tree/main/lab1.2/lab02.c | https://raw.githubusercontent.com/Famalan/mat_prak_lab/502ad0f/lab1.2/lab02.c | Famalan/mat_prak_lab 502ad0f lab1.2/lab02.c | true | 200 | 8,023 | #include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <stdbool.h>
enum status_code
{
ok,
alloc_error,
};
double exp_by_lim(double eps)
{
int n = 1;
double cur_value = 2, prev_value;
do
{
++n;
prev_value = cur_value;
cur_value = pow(1 + 1.0 / n, n);
} whi... | 3 |
GunDalf101/cub3d | c988c99 | bonus/initialize_game/sprite_loader.c | C | www.github.com/GunDalf101/cub3d/tree/main/bonus/initialize_game/sprite_loader.c | https://raw.githubusercontent.com/GunDalf101/cub3d/c988c99/bonus/initialize_game/sprite_loader.c | GunDalf101/cub3d c988c99 bonus/initialize_game/sprite_loader.c | true | 200 | 4,941 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* sprite_loader.c :+: :+: :+: ... | 0 |
Thimmy962/systems-programming | e2bf8a3 | process/1_wait.c | C | www.github.com/Thimmy962/systems-programming/tree/main/process/1_wait.c | https://raw.githubusercontent.com/Thimmy962/systems-programming/e2bf8a3/process/1_wait.c | Thimmy962/systems-programming e2bf8a3 process/1_wait.c | true | 200 | 560 | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/wait.h>
int main()
{
pid_t id = fork(); // Create a child process
int n;
if (id == 0)
n = 1; // Child process
else
n = 6; // Parent process
if (id != 0) {
int status;
wait(&status); // Wait ... | 1 |
Weistr/Emcu_firmware | 4b80520 | Drivers/Mcu/c2000ware/libraries/math/FPUfastRTS/c28/reference/C/source/FastRTS_atan2.c | C | www.github.com/Weistr/Emcu_firmware/tree/main/Drivers/Mcu/c2000ware/libraries/math/FPUfastRTS/c28/reference/C/source/FastRTS_atan2.c | https://raw.githubusercontent.com/Weistr/Emcu_firmware/4b80520/Drivers/Mcu/c2000ware/libraries/math/FPUfastRTS/c28/reference/C/source/FastRTS_atan2.c | Weistr/Emcu_firmware 4b80520 Drivers/Mcu/c2000ware/libraries/math/FPUfastRTS/c28/reference/C/source/FastRTS_atan2.c | true | 200 | 4,981 | //#############################################################################
//! \file reference/C/source/$FILENAME$
//! \brief Arctangent(y,x)
//! \author Vishal Coelho
//! \date 26-Aug-2015
//!
//
// Group: C2000
// Target Family: $DEVICE$
//
//###############################################... | 6 |
GauravSSolanki/mycode | 4b13bba | C++Program/gauravstrutexample.c | C | www.github.com/GauravSSolanki/mycode/tree/main/C++Program/gauravstrutexample.c | https://raw.githubusercontent.com/GauravSSolanki/mycode/4b13bba/C%2B%2BProgram/gauravstrutexample.c | GauravSSolanki/mycode 4b13bba C++Program/gauravstrutexample.c | true | 200 | 366 | #include<stdio.h>
#include<conio.h>
#include<math.h>
struct bio
{ char name[50] ;
int salary ;
float price ;
}bio[4] ;
int main()
{ struct bio b ;
int i=1;
{ for(i=1;i<4;i++)
printf("enter all citizen bio");
scanf("%d%c%%f",&.salary,&b[i].name,&b[i].price); }
{
for(i=0;i<=4;i++)
printf("%d%... | 3 |
alexandre-hallaine/ft_nmap | 8b19e43 | src/send/thread.c | C | www.github.com/alexandre-hallaine/ft_nmap/tree/main/src/send/thread.c | https://raw.githubusercontent.com/alexandre-hallaine/ft_nmap/8b19e43/src/send/thread.c | alexandre-hallaine/ft_nmap 8b19e43 src/send/thread.c | true | 200 | 4,687 | #include "functions.h"
#include <errno.h>
#include <stdio.h>
#include <unistd.h>
#include <pthread.h>
#include <stdlib.h>
#include <string.h>
void *routine(void *arg)
{
t_options *options = arg;
t_technique technique;
for (technique = 0; technique < TECHNIQUE_COUNT; technique++)
if (options->techn... | 0 |
AdrienBrFa/Libft | 329d661 | ft_lstmap.c | C | www.github.com/AdrienBrFa/Libft/tree/main/ft_lstmap.c | https://raw.githubusercontent.com/AdrienBrFa/Libft/329d661/ft_lstmap.c | AdrienBrFa/Libft 329d661 ft_lstmap.c | true | 200 | 3,303 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_lstmap.c :+: :+: :+: ... | 1 |
betarixm/CSED423 | e66c0ea | PA/PA5/src/coolrt.c | C | www.github.com/betarixm/CSED423/tree/main/PA/PA5/src/coolrt.c | https://raw.githubusercontent.com/betarixm/CSED423/e66c0ea/PA/PA5/src/coolrt.c | betarixm/CSED423 e66c0ea PA/PA5/src/coolrt.c | true | 200 | 7,198 | #include "coolrt.h"
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <assert.h>
#include <sys/types.h>
/* This file provides the runtime library for cool. It implements
the functions of the cool classes in C
*/
/* Class name strings */
const char Object_string[] = "Object";
const char String_... | 6 |
joyrider3774/crisp-game-lib-portable-funkey | 76c9339 | src/gamePakuPaku.c | C | www.github.com/joyrider3774/crisp-game-lib-portable-funkey/tree/main/src/gamePakuPaku.c | https://raw.githubusercontent.com/joyrider3774/crisp-game-lib-portable-funkey/76c9339/src/gamePakuPaku.c | joyrider3774/crisp-game-lib-portable-funkey 76c9339 src/gamePakuPaku.c | true | 200 | 5,255 | #include "cglp.h"
static char *title = "PAKU PAKU";
static char *description = "[Tap] Turn\n[Arrow] Move";
#define CS static char characters[][CHARACTER_HEIGHT][CHARACTER_WIDTH + 1]
CS = {
{
" llll",
" lll ",
"lll ",
"lll ",
" lll ",
" llll",
},
{
... | 3 |
Jenesha-J/C-Programs | 8cd10a4 | Power(recursion).c | C | www.github.com/Jenesha-J/C-Programs/tree/main/Power(recursion).c | https://raw.githubusercontent.com/Jenesha-J/C-Programs/8cd10a4/Power%28recursion%29.c | Jenesha-J/C-Programs 8cd10a4 Power(recursion).c | true | 200 | 413 | //power using recursion
#include<stdio.h>
double power(double base,double exp)
{
if(exp<0)
{
return(power(base,exp+1)/base);
}
else if(exp>0)
{
return(power(base,exp-1)*base);
}
else
{
return 1;
}
}
int main()
{
double base,exp,res;
printf("Enter value of base and exponent");
scan... | 1 |
Josephjbassey/alx-low_level_programming | 26fc99e | 0x04-more_functions_nested_loops/10-print_triangle.c | C | www.github.com/Josephjbassey/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/10-print_triangle.c | https://raw.githubusercontent.com/Josephjbassey/alx-low_level_programming/26fc99e/0x04-more_functions_nested_loops/10-print_triangle.c | Josephjbassey/alx-low_level_programming 26fc99e 0x04-more_functions_nested_loops/10-print_triangle.c | true | 200 | 438 | #include "main.h"
/**
* print_triangle - prints a triangle of a given size
*
* @size: size of the triangle
*/
void print_triangle(int size)
{
int row, column;
if (size > 0)
{
for (row = 1; row <= size; row++)
{
for (column = 1; column <= size - row; column++)
_putchar(' ');
for (column = 1; colum... | 0 |
Sunldon/nginx-http-upstream-dynamic-servers | 712a03d | ngx_http_upstream_dynamic_servers.c | C | www.github.com/Sunldon/nginx-http-upstream-dynamic-servers/tree/main/ngx_http_upstream_dynamic_servers.c | https://raw.githubusercontent.com/Sunldon/nginx-http-upstream-dynamic-servers/712a03d/ngx_http_upstream_dynamic_servers.c | Sunldon/nginx-http-upstream-dynamic-servers 712a03d ngx_http_upstream_dynamic_servers.c | true | 200 | 29,538 | #include <nginx.h>
#include <ngx_config.h>
#include <ngx_core.h>
#include <ngx_http.h>
typedef struct {
ngx_resolver_t *resolver;
ngx_msec_t resolver_timeout;
ngx_array_t dynamic_servers;
ngx_http_conf_ctx_t *conf_ctx;
ngx_rbtree_t rbtree;
ngx_rbtree_node_t se... | 3 |
Lubwama-Emmanuel/alx-low_level_programming | 4b3a00f | 0x0F-function_pointers/0-print_name.c | C | www.github.com/Lubwama-Emmanuel/alx-low_level_programming/tree/main/0x0F-function_pointers/0-print_name.c | https://raw.githubusercontent.com/Lubwama-Emmanuel/alx-low_level_programming/4b3a00f/0x0F-function_pointers/0-print_name.c | Lubwama-Emmanuel/alx-low_level_programming 4b3a00f 0x0F-function_pointers/0-print_name.c | true | 200 | 271 | #include "function_pointers.h"
/**
* print_name - function to print a name
*
* @name: name to print
* @f: function to pointer that doesn't return anything
*
* Return: Always 0 sucess
*/
void print_name(char *name, void (*f)(char *))
{
if (name && f)
f(name);
}
| 6 |
chetan9008/DSA- | 6b750ec | Deletion_of_Duplicate.c | C | www.github.com/chetan9008/DSA-/tree/main/Deletion_of_Duplicate.c | https://raw.githubusercontent.com/chetan9008/DSA-/6b750ec/Deletion_of_Duplicate.c | chetan9008/DSA- 6b750ec Deletion_of_Duplicate.c | true | 200 | 534 | #include<stdio.h>
int max=10;
void deletion(int *arr)
{
for(int i=0;i<max;i++)
{
for(int j=i+1;j<max;j++)
{
if(arr[i]==arr[j])
{
for(int k=j;k<max;k++)
arr[k]=arr[k+1];
max--;
j--;
}
}
... | 7 |
kpatsakis/primevul7 | 8dd2061 | 136483.c | C | www.github.com/kpatsakis/primevul7/tree/main/136483.c | https://raw.githubusercontent.com/kpatsakis/primevul7/8dd2061/136483.c | kpatsakis/primevul7 8dd2061 136483.c | true | 200 | 325 | ssize_t lxc_read_nointr_expect(int fd, void* buf, size_t count, const void* expected_buf)
{
ssize_t ret;
ret = lxc_read_nointr(fd, buf, count);
if (ret <= 0)
return ret;
if ((size_t)ret != count)
return -1;
if (expected_buf && memcmp(buf, expected_buf, count) != 0) {
errno = EINVAL;
return -1;
}
return r... | 2 |
Micgray/alx-low_level_programming | 0d1f5b2 | 0x04-more_functions_nested_loops/1-isdigit.c | C | www.github.com/Micgray/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/1-isdigit.c | https://raw.githubusercontent.com/Micgray/alx-low_level_programming/0d1f5b2/0x04-more_functions_nested_loops/1-isdigit.c | Micgray/alx-low_level_programming 0d1f5b2 0x04-more_functions_nested_loops/1-isdigit.c | true | 200 | 218 | #include "main.h"
/**
* _isdigit-> check if a value is a digit between 9 and 0
* @c: the integer to be checked
* Return: return 1 if true and 0 otherwise
*/
int _isdigit(int c)
{
return (c >= '0' && c <= '9');
}
| 4 |
paulobeckhauser/minishell | 4f219ef | src/execution/get_number_commands.c | C | www.github.com/paulobeckhauser/minishell/tree/main/src/execution/get_number_commands.c | https://raw.githubusercontent.com/paulobeckhauser/minishell/4f219ef/src/execution/get_number_commands.c | paulobeckhauser/minishell 4f219ef src/execution/get_number_commands.c | true | 200 | 1,713 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* get_number_commands.c :+: :+: :+: ... | 5 |
0xCitaDel/AlgoCult | 93aaa5b | data_structures/list/linked_list.c | C | www.github.com/0xCitaDel/AlgoCult/tree/main/data_structures/list/linked_list.c | https://raw.githubusercontent.com/0xCitaDel/AlgoCult/93aaa5b/data_structures/list/linked_list.c | 0xCitaDel/AlgoCult 93aaa5b data_structures/list/linked_list.c | true | 200 | 1,254 | #include <stdio.h>
#include <stdlib.h>
typedef int Data;
typedef struct Node Node;
struct Node {
Data data;
Node *next;
};
void printList(Node *list);
int is_emptyList(Node *list);
void pushList(Node **plist, Data d);
Data popList(Node **plist);
void printList(Node *list) {
for (Node *p = list; p != NU... | 1 |
MythicalMAxX/DataStructures | 0974c2e | Tree/CountLeaf.c | C | www.github.com/MythicalMAxX/DataStructures/tree/main/Tree/CountLeaf.c | https://raw.githubusercontent.com/MythicalMAxX/DataStructures/0974c2e/Tree/CountLeaf.c | MythicalMAxX/DataStructures 0974c2e Tree/CountLeaf.c | true | 200 | 924 | #include <stdio.h>
#include <stdlib.h>
#include<conio.h>
struct Node {
int data;
struct Node* left;
struct Node* right;
};
struct Node* createNode(int data) {
struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
newNode->data = data;
newNode->left = NULL;
newNode->right = NULL... | 0 |
John16Mark/Computer-Graphics | 8c605ee | Práctica 5/src/structs/triangle.c | C | www.github.com/John16Mark/Computer-Graphics/tree/main/Práctica 5/src/structs/triangle.c | https://raw.githubusercontent.com/John16Mark/Computer-Graphics/8c605ee/Pr%C3%A1ctica%205/src/structs/triangle.c | John16Mark/Computer-Graphics 8c605ee Práctica 5/src/structs/triangle.c | true | 200 | 3,595 | #include "display.h"
#include "triangle.h"
// Draw a triangle using three raw line calls
void draw_triangle(int x0, int y0, int x1, int y1, int x2, int y2, color_t color, algoritmo_lineas funcion) {
draw_line(x0, y0, x1, y1, color, funcion);
draw_line(x1, y1, x2, y2, color, funcion);
draw_line(x2, y2, x0, ... | 3 |
professor-YasirSultan/YSGL | 34675de | codes/codes old/1 YSGL basic project/simulation.h | C | www.github.com/professor-YasirSultan/YSGL/tree/main/codes/codes old/1 YSGL basic project/simulation.h | https://raw.githubusercontent.com/professor-YasirSultan/YSGL/34675de/codes/codes%20old/1%20YSGL%20basic%20project/simulation.h | professor-YasirSultan/YSGL 34675de codes/codes old/1 YSGL basic project/simulation.h | true | 200 | 604 | #ifndef YSGL_sim
#define YSGL_sim
#include <YSGLall.h>
YSCamera myCam;
void YSGL_init()
{
ysgl_about_mb();
glClearColor(0.0f, 0.0f, 0.0f, 0.0f);
myCam.Position.z = 2.5;
}
void YSGL_mainGL()
{
static float theta = 0.0f;
glPushMatrix();
{
glRotatef(theta, 0.0f, 0.0f, 1.0f);
glBegin(GL_TRIA... | 2 |
IsaenkovDanil/C_program | 9646fad | 1cat.c | C | www.github.com/IsaenkovDanil/C_program/tree/main/1cat.c | https://raw.githubusercontent.com/IsaenkovDanil/C_program/9646fad/1cat.c | IsaenkovDanil/C_program 9646fad 1cat.c | true | 200 | 1,825 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/ipc.h>
#include <sys/sem.h>
#include <sys/shm.h>
#include <sys/types.h>
#include <unistd.h>
union semun {
int val;
struct semid_ds *buf;
unsigned short *array;
};
void P(int sem_id, int sem_num) {
struct sembuf op = {sem_num, -1,... | 7 |
foxide123/BioPulse | 1358a20 | esp32_devices/temperature_sensor/main/temperature_sensor.c | C | www.github.com/foxide123/BioPulse/tree/main/esp32_devices/temperature_sensor/main/temperature_sensor.c | https://raw.githubusercontent.com/foxide123/BioPulse/1358a20/esp32_devices/temperature_sensor/main/temperature_sensor.c | foxide123/BioPulse 1358a20 esp32_devices/temperature_sensor/main/temperature_sensor.c | true | 200 | 870 | #include "freertos/FreeRTOS.h"
#include "freertos/task.h"
#include "driver/gpio.h"
#include "esp_log.h"
#include "ds18b20.h"
void app_main(void)
{
gpio_set_pull_mode(ONE_WIRE_PIN, GPIO_PULLUP_ONLY);
while (1)
{
if (one_wire_reset())
{
ESP_LOGI("1-Wire", "Device found");
... | 5 |
elishaajayi/alx-low_level_programming | 93597b3 | 0x10-variadic_functions/2-print_strings.c | C | www.github.com/elishaajayi/alx-low_level_programming/tree/main/0x10-variadic_functions/2-print_strings.c | https://raw.githubusercontent.com/elishaajayi/alx-low_level_programming/93597b3/0x10-variadic_functions/2-print_strings.c | elishaajayi/alx-low_level_programming 93597b3 0x10-variadic_functions/2-print_strings.c | true | 200 | 591 | #include "variadic_functions.h"
/**
* print_strings - function to print the strings entered
* @separator: string to print in between strings
* @n: number of strings passed in to function
* Return: void as in none
*/
void print_strings(const char *separator, const unsigned int n, ...)
{
unsigned int i;
char *val... | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.