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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
sarangsuresh-creator/SPI | 13e8eab | PIC 18f4580/MASTER.c | C | www.github.com/sarangsuresh-creator/SPI/tree/main/PIC 18f4580/MASTER.c | https://raw.githubusercontent.com/sarangsuresh-creator/SPI/13e8eab/PIC%2018f4580/MASTER.c | sarangsuresh-creator/SPI 13e8eab PIC 18f4580/MASTER.c | true | 200 | 1,382 | #include <xc.h>
#define _XTAL_FREQ 20000000
#define baud_rate 9600
void string(char *s);
void mychar(char d);
void uart_initiate(void);
void SPI_Master_Init(void);
void SPI_Master_Write(unsigned char data);
unsigned char receivedData;
int i;
void main(void)
{
SPI_Master_Init();
uart_initiate();
while(1... | 2 |
calmsacibis995/darbat-src | d537fa0 | darbat/bsd/hfs/hfs_notification.c | C | www.github.com/calmsacibis995/darbat-src/tree/main/darbat/bsd/hfs/hfs_notification.c | https://raw.githubusercontent.com/calmsacibis995/darbat-src/d537fa0/darbat/bsd/hfs/hfs_notification.c | calmsacibis995/darbat-src d537fa0 darbat/bsd/hfs/hfs_notification.c | true | 200 | 2,589 | /*
* @NICTA_MODIFICATIONS_START@
*
* This source code is licensed under Apple Public Source License Version 2.0.
* Portions copyright Apple Computer, Inc.
* Portions copyright National ICT Australia.
*
* All rights reserved.
*
* This code was modified 2006-06-20.
*
* @NICTA_MODIFICATIONS_END@
*/
/*
* Copy... | 6 |
PedroPotenza/mybc | 172ab3e | v1/start-project-PedroPotenza/parser.c | C | www.github.com/PedroPotenza/mybc/tree/main/v1/start-project-PedroPotenza/parser.c | https://raw.githubusercontent.com/PedroPotenza/mybc/172ab3e/v1/start-project-PedroPotenza/parser.c | PedroPotenza/mybc 172ab3e v1/start-project-PedroPotenza/parser.c | true | 200 | 1,223 | #include <stdio.h>
#include <stdlib.h>
#include <tokens.h>
#include <parser.h>
int lookahead;
/* LR(1) expression grammar:
* Initial symbol: E
*
* E -> E + T | E - T | T
* T -> T * F | T / F | F
* F -> ID | DEC | ( E )
*
* LL(1) grammar
*
* E -> T R
* R -> + T R | - T R | <epsilon>
* T -> F Q
* Q -> * F Q... | 1 |
aeiedamo/alx-low_level_programming | de55f1c | 0x05-pointers_arrays_strings/5-rev_string.c | C | www.github.com/aeiedamo/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/5-rev_string.c | https://raw.githubusercontent.com/aeiedamo/alx-low_level_programming/de55f1c/0x05-pointers_arrays_strings/5-rev_string.c | aeiedamo/alx-low_level_programming de55f1c 0x05-pointers_arrays_strings/5-rev_string.c | true | 200 | 565 | #include "main.h"
/**
* rev_string - reverser function.
* @s: pointer to char.
*
* Description: a function that
* that reverses a string.
*
* Return: None.
*/
void rev_string(char *s)
{
int counter, counter2;
char temp;
int length = 0;
while (length >= 0)
{
if (*(s + length) == '\0')
break;
lengt... | 7 |
owolabioromidayo/swiss_firm | 77c2664 | main/wifi.c | C | www.github.com/owolabioromidayo/swiss_firm/tree/main/main/wifi.c | https://raw.githubusercontent.com/owolabioromidayo/swiss_firm/77c2664/main/wifi.c | owolabioromidayo/swiss_firm 77c2664 main/wifi.c | true | 200 | 1,894 | #include "wifi.h"
#include "config.h"
#include "utils.h"
#include "publish.h"
#define MAX_RETRY 20
static const char *TAG = "wifi_service";
static esp_err_t handle_http_event(esp_http_client_event_t *);
wifi_err_t post_data(sensor_values_t v)
{
char post_data[300];
wifi_err_t sent = 0;
... | 0 |
imamantripathi/DSA-file | a58a99f | Program12.c | C | www.github.com/imamantripathi/DSA-file/tree/main/Program12.c | https://raw.githubusercontent.com/imamantripathi/DSA-file/a58a99f/Program12.c | imamantripathi/DSA-file a58a99f Program12.c | true | 200 | 641 | // Q 12. WAP to check weather number is palindrome.
#include <stdio.h>
int palindrome(int num)
{
int temp = 0;
int duplicate = num;
while (num > 0)
{
int d = num % 10;
temp = temp * 10 + d;
num = num / 10;
}
// printf("%d",temp);
if (duplicate == temp)
{
r... | 4 |
Janek003/programowanie_strukturalne | 4293fcd | lab_9/9_2.c | C | www.github.com/Janek003/programowanie_strukturalne/tree/main/lab_9/9_2.c | https://raw.githubusercontent.com/Janek003/programowanie_strukturalne/4293fcd/lab_9/9_2.c | Janek003/programowanie_strukturalne 4293fcd lab_9/9_2.c | true | 200 | 295 | #include <stdio.h>
#include <math.h>
void f(int* a, int* b){
int c;
c = *a;
*a = *b;
*b = c;
}
int main(void) {
int a, b;
printf("a: ");
scanf(" %d", &a);
printf("b: ");
scanf(" %d", &b);
f(&a, &b);
printf("a: %d, b: %d", a, b);
return 0;
}
| 2 |
jhcooper/monogram | cbb1b64 | jhcoop.c | C | www.github.com/jhcooper/monogram/tree/main/jhcoop.c | https://raw.githubusercontent.com/jhcooper/monogram/cbb1b64/jhcoop.c | jhcooper/monogram cbb1b64 jhcoop.c | true | 200 | 2,881 | #include <stdio.h>
#include <unistd.h>
#include <ncurses.h>
#define WHITE 1
#define BLACK 0
void draw_grid(uint16_t pixels[8][8]) {
for(int y=0; y<8; y++) {
move(y,0);
for(int x=0; x<8; x++) {
if(pixels[7-x][y]) {
attron(COLOR_PAIR(pixels[7-x][y]));
addc... | 6 |
jfdelnero/HxCFloppyEmulator | 8c039ee | libhxcfe/sources/loaders/stt_loader/stt_loader.c | C | www.github.com/jfdelnero/HxCFloppyEmulator/tree/main/libhxcfe/sources/loaders/stt_loader/stt_loader.c | https://raw.githubusercontent.com/jfdelnero/HxCFloppyEmulator/8c039ee/libhxcfe/sources/loaders/stt_loader/stt_loader.c | jfdelnero/HxCFloppyEmulator 8c039ee libhxcfe/sources/loaders/stt_loader/stt_loader.c | true | 200 | 10,154 | /*
//
// Copyright (C) 2006-2025 Jean-Fran�ois DEL NERO
//
// This file is part of the HxCFloppyEmulator library
//
// HxCFloppyEmulator may be used and distributed without restriction provided
// that this copyright statement is not removed from the file and that any
// derivative work contains the original co... | 5 |
MoFa-14/Operating-Systems | 68c363e | worksheet2.2/task1/drivers/keyboard.c | C | www.github.com/MoFa-14/Operating-Systems/tree/main/worksheet2.2/task1/drivers/keyboard.c | https://raw.githubusercontent.com/MoFa-14/Operating-Systems/68c363e/worksheet2.2/task1/drivers/keyboard.c | MoFa-14/Operating-Systems 68c363e worksheet2.2/task1/drivers/keyboard.c | true | 200 | 2,764 | #include "io.h"
#include "framebuffer.h"
#include "type.h"
#define KEYBOARD_DATA_PORT 0x60
/** read_scan_code:
* Reads a scan code from the keyboard
*
* @return The scan code (NOT an ASCII character!)
*/
u8int keyboard_read_scan_code(void)
{
return inb(KEYBOARD_DATA_PORT);
}
u8int keyboard_scan_code_to_ascii... | 1 |
vladgabriel24/C-and-C-plus-plus | b47d153 | Structuri de date/Single linked list/main.c | C | www.github.com/vladgabriel24/C-and-C-plus-plus/tree/main/Structuri de date/Single linked list/main.c | https://raw.githubusercontent.com/vladgabriel24/C-and-C-plus-plus/b47d153/Structuri%20de%20date/Single%20linked%20list/main.c | vladgabriel24/C-and-C-plus-plus b47d153 Structuri de date/Single linked list/main.c | true | 200 | 3,990 | #include <stdio.h>
#include <stdlib.h>
struct nod{
int x;
struct nod *next;
};
typedef struct nod node;
node *creare_nod(){
node *nod_nou=malloc(sizeof(node));
scanf("%d" , &nod_nou->x);
nod_nou->next=NULL;
return nod_nou;
}
node *populare_lista(node *head){
... | 7 |
chrismun/LLM4VV | 1fbede9 | gpt-4-turbo/one-shot/loop_construct_worker_clause.c | C | www.github.com/chrismun/LLM4VV/tree/main/gpt-4-turbo/one-shot/loop_construct_worker_clause.c | https://raw.githubusercontent.com/chrismun/LLM4VV/1fbede9/gpt-4-turbo/one-shot/loop_construct_worker_clause.c | chrismun/LLM4VV 1fbede9 gpt-4-turbo/one-shot/loop_construct_worker_clause.c | true | 200 | 1,232 | #include "acc_testsuite.h"
#ifndef T2
// T2:kernels,loop,worker,V:1.0-2.7
int test2() {
int err = 0;
const int workers = 4; // Assuming we target 4 workers for this test
srand(SEED);
real_t *a = (real_t *)malloc(n * sizeof(real_t));
real_t *b = (real_t *)malloc(n * sizeof(real_t));
for (int x =... | 4 |
ShieldQiQi/My-Leetcode-Note | f197323 | 41_560_subArray_sum_equal_k.c | C | www.github.com/ShieldQiQi/My-Leetcode-Note/tree/main/41_560_subArray_sum_equal_k.c | https://raw.githubusercontent.com/ShieldQiQi/My-Leetcode-Note/f197323/41_560_subArray_sum_equal_k.c | ShieldQiQi/My-Leetcode-Note f197323 41_560_subArray_sum_equal_k.c | true | 200 | 923 | #include <stdio.h>
#include <stdlib.h>
#include "hash.h"
int subarraySum(int* nums, int numsSize, int k)
{
int count = 0;
struct dataItem** hashTable = (struct dataItem**)malloc(sizeof(struct dataItem*)*numsSize);
for(int i=0; i<numsSize; i++)
hashTable[i] = NULL;
int sum = 0;
for(int ... | 0 |
vas3105/DS-LAB | b9ab92e | lab1/bubble_sort.c | C | www.github.com/vas3105/DS-LAB/tree/main/lab1/bubble_sort.c | https://raw.githubusercontent.com/vas3105/DS-LAB/b9ab92e/lab1/bubble_sort.c | vas3105/DS-LAB b9ab92e lab1/bubble_sort.c | true | 200 | 553 | #include<stdio.h>
int main()
{
int n,i,j,temp;
int ar[50];
printf("enter the number of elements");
scanf("%d",&n);
printf("enter the elements");
for(i=0;i<n;i++)
{
scanf("%d",&ar[i]);
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(ar[i]>ar[j])
... | 2 |
Djboundaw/alx-low_level_programming | fad00ce | 0x06-pointers_arrays_strings/2-strncpy.c | C | www.github.com/Djboundaw/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/2-strncpy.c | https://raw.githubusercontent.com/Djboundaw/alx-low_level_programming/fad00ce/0x06-pointers_arrays_strings/2-strncpy.c | Djboundaw/alx-low_level_programming fad00ce 0x06-pointers_arrays_strings/2-strncpy.c | true | 200 | 403 | #include "main.h"
/**
* _strncpy - function that copies a strings
* @dest: * before dest, the first string
* @src: * before src, the second string
* @n: number of bytes from src
*
* Return: return the result to dest
*/
char *_strncpy(char *dest, char *src, int n)
{
int i;
for (i = 0; i < n && src[i] != '\0';... | 3 |
terermike/alx-low_level_programming | e5c970b | 0x17-doubly_linked_lists/4-free_dlistint.c | C | www.github.com/terermike/alx-low_level_programming/tree/main/0x17-doubly_linked_lists/4-free_dlistint.c | https://raw.githubusercontent.com/terermike/alx-low_level_programming/e5c970b/0x17-doubly_linked_lists/4-free_dlistint.c | terermike/alx-low_level_programming e5c970b 0x17-doubly_linked_lists/4-free_dlistint.c | true | 200 | 310 | #include "lists.h"
/**
* free_dlistint - frees doubly linked list
* @head: head of the list.
* Return: nothing.
*/
void free_dlistint(dlistint_t *head)
{
dlistint_t *ptr = head;
if (!head)
return;
while (ptr->prev)
ptr = ptr->prev;
while (ptr)
{
head = ptr;
ptr = ptr->next;
free(head);
}
}
| 5 |
tizihoxha/holbertonschool-low_level_programming | 2a7f987 | variadic_functions/0-sum_them_all.c | C | www.github.com/tizihoxha/holbertonschool-low_level_programming/tree/main/variadic_functions/0-sum_them_all.c | https://raw.githubusercontent.com/tizihoxha/holbertonschool-low_level_programming/2a7f987/variadic_functions/0-sum_them_all.c | tizihoxha/holbertonschool-low_level_programming 2a7f987 variadic_functions/0-sum_them_all.c | true | 200 | 417 | #include "variadic_functions.h"
/**
* sum_them_all - function that returns the sum of all the given parameters
* @n: Number of parameters
* @...: variable number of parameters
* Return: 0 if n == 0
*/
int sum_them_all(const unsigned int n, ...)
{
va_list numbers;
unsigned int i, sum;
va_start(numbers, n);
sum... | 1 |
rosarioog3nio/alx-low_level_programming | 1dfc2b4 | 0x01-variables_if_else_while/2-print_alphabet.c | C | www.github.com/rosarioog3nio/alx-low_level_programming/tree/main/0x01-variables_if_else_while/2-print_alphabet.c | https://raw.githubusercontent.com/rosarioog3nio/alx-low_level_programming/1dfc2b4/0x01-variables_if_else_while/2-print_alphabet.c | rosarioog3nio/alx-low_level_programming 1dfc2b4 0x01-variables_if_else_while/2-print_alphabet.c | true | 200 | 256 | #include <stdio.h>
/**
* main - Alphabet game
*
*Description: A program that print the alphabet in lowercase
*
*Return: Always 0 (Success)_
*/
int main(void)
{
int ch = 'a';
while (ch <= 'z')
{
putchar(ch);
ch++;
}
putchar('\n');
return (0);
}
| 7 |
mael-lukas/Microshell_in_C | 85c7f15 | enseash_question2.c | C | www.github.com/mael-lukas/Microshell_in_C/tree/main/enseash_question2.c | https://raw.githubusercontent.com/mael-lukas/Microshell_in_C/85c7f15/enseash_question2.c | mael-lukas/Microshell_in_C 85c7f15 enseash_question2.c | true | 200 | 818 | #include "enseashUtils.h"
int main() {
int status;
ssize_t ret;
pid_t pid;
char input[MAXBUFSIZE];
write(STDOUT_FILENO,welcome_message,strlen(welcome_message));
write(STDOUT_FILENO,enseash_prompt,strlen(enseash_prompt));
while(1) {
ret = read(STDIN_FILENO,input,MAXBUFSIZE);
... | 4 |
BClabaugh/CPRE288 | fe88af8 | CPRE288/Lab 7/functions.c | C | www.github.com/BClabaugh/CPRE288/tree/main/CPRE288/Lab 7/functions.c | https://raw.githubusercontent.com/BClabaugh/CPRE288/fe88af8/CPRE288/Lab%207/functions.c | BClabaugh/CPRE288 fe88af8 CPRE288/Lab 7/functions.c | true | 200 | 12,116 | /*
* functions.c
*
* Created on: Feb 6, 2024
* Author: clab22
*/
#include "functions.h"
#include "open_interface.h"
#include "cyBot_Scan.h"
//#include "cyBot_uart.h"
#include "Timer.h"
#include "math.h"
#include "movement.h"
#include "uart-interrupt.h"
// sends strings and optionally values to PuTTY
void... | 6 |
c-ware/makegen | b131236 | src/libpath/join_path.c | C | www.github.com/c-ware/makegen/tree/main/src/libpath/join_path.c | https://raw.githubusercontent.com/c-ware/makegen/b131236/src/libpath/join_path.c | c-ware/makegen b131236 src/libpath/join_path.c | true | 200 | 1,021 | /*
* Join a variable number of paths.
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
#include "libpath.h"
size_t libpath_join_path(char *buffer, int length, ...) {
char *path = NULL;
size_t written = 0;
va_list paths = {0};
int buffer_cursor = 0;
__libpath_assert_nonnull("libpath... | 0 |
18safarr/Programme_C | c4e2095 | Algo pour trouver le plus petit element d'un tableau a N entiers.c | C | www.github.com/18safarr/Programme_C/tree/main/Algo pour trouver le plus petit element d'un tableau a N entiers.c | https://raw.githubusercontent.com/18safarr/Programme_C/c4e2095/Algo%20pour%20trouver%20le%20plus%20petit%20element%20d%27un%20tableau%20a%20N%20entiers.c | 18safarr/Programme_C c4e2095 Algo pour trouver le plus petit element d'un tableau a N entiers.c | true | 200 | 469 | #include<stdio.h>
#include<stdlib.h>
int main(void)
{
int n,i,min;
int *tab;
printf("Donner la taille du tableau \n");
scanf("%d",&n);
tab=malloc(sizeof(int)*n);
printf("Donner les elements du tableau \n");
for(i=0;i<n;i++)
{
scanf("%d",&tab[i]);
}
min=tab[0];
for(i=1;i<n;i++)
... | 3 |
DALAPI-AI/DL_module | 0c47c64 | src/process/comm.c | C | www.github.com/DALAPI-AI/DL_module/tree/main/src/process/comm.c | https://raw.githubusercontent.com/DALAPI-AI/DL_module/0c47c64/src/process/comm.c | DALAPI-AI/DL_module 0c47c64 src/process/comm.c | true | 200 | 1,098 | #ifdef __linux__
#include "process/comm.h"
#include <wiringPi.h>
#include <wiringSerial.h>
#include <stdio.h>
#include <errno.h>
#include <unistd.h>
#include <string.h>
int configureSerial(char* serialPort,int baud_Rate){
int serial_device;
if ((serial_device = serialOpen(serialPort, baud_Rate)) < 0) {
... | 2 |
fadyemad98/Embedded-System-Diploma | beab078 | Assignments/MCU ESSENTIAL PERIPHERALS/lesson2_section2_lab1/unit7_lesson2_section2_lab1/main.c | C | www.github.com/fadyemad98/Embedded-System-Diploma/tree/main/Assignments/MCU ESSENTIAL PERIPHERALS/lesson2_section2_lab1/unit7_lesson2_section2_lab1/main.c | https://raw.githubusercontent.com/fadyemad98/Embedded-System-Diploma/beab078/Assignments/MCU%20ESSENTIAL%20PERIPHERALS/lesson2_section2_lab1/unit7_lesson2_section2_lab1/main.c | fadyemad98/Embedded-System-Diploma beab078 Assignments/MCU ESSENTIAL PERIPHERALS/lesson2_section2_lab1/unit7_lesson2_section2_lab1/main.c | true | 200 | 627 | /*
* unit7_lesson2_section2_lab1.c
*
* Created: 4/21/2024 10:57:14 AM
* Author : fady emad
*/
#define F_CPU 1000000UL
#include "lcd.h"
#include "keypad.h"
#include <util/delay.h>
#include "memory_map.h"
#include "util.h"
int main(void)
{
LCD_init();
KEYPAD_INIT();
//LCD_WriteString(" Hello ");
... | 5 |
3158299835/learn-STM32-HAL-Lib | 40849d9 | 01 - Project/2024-08-26 -01- GPIO KEY IT/Hardware/Source/key.c | C | www.github.com/3158299835/learn-STM32-HAL-Lib/tree/main/01 - Project/2024-08-26 -01- GPIO KEY IT/Hardware/Source/key.c | https://raw.githubusercontent.com/3158299835/learn-STM32-HAL-Lib/40849d9/01%20-%20Project/2024-08-26%20-01-%20GPIO%20KEY%20IT/Hardware/Source/key.c | 3158299835/learn-STM32-HAL-Lib 40849d9 01 - Project/2024-08-26 -01- GPIO KEY IT/Hardware/Source/key.c | true | 200 | 2,532 | #include "stm32f1xx_hal.h"
#include "key.h"
//�жϷ�ʽ��ʼ��
//mode ģʽ��0Ϊ����ִ�У�1̧��ִ��
//����Ϊ�͵�ƽ��Ч
//������ִ�� ����½��ؽ����жϡ�̧��ִ�У���������ؽ����ж�
void KEY_Init_IT(uint8_t mode)
{
__HAL_RCC_GPIOB_CLK_ENABLE(); //����GPIOBʱ��
GPIO_InitTypeDef GPIO_InitStructure;
if(mode == 0) //�ж�ģʽ���Ƿ�... | 1 |
Dioggim/42cursus | 19aa7b4 | 42Done/push_swap/main.c | C | www.github.com/Dioggim/42cursus/tree/main/42Done/push_swap/main.c | https://raw.githubusercontent.com/Dioggim/42cursus/19aa7b4/42Done/push_swap/main.c | Dioggim/42cursus 19aa7b4 42Done/push_swap/main.c | true | 200 | 1,820 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* main.c :+: :+: :+: ... | 7 |
JoaoVS-Ferreira/SO-embarcado | 8af402b | SO-embarcado/SO-embarcado.c | C | www.github.com/JoaoVS-Ferreira/SO-embarcado/tree/main/SO-embarcado/SO-embarcado.c | https://raw.githubusercontent.com/JoaoVS-Ferreira/SO-embarcado/8af402b/SO-embarcado/SO-embarcado.c | JoaoVS-Ferreira/SO-embarcado 8af402b SO-embarcado/SO-embarcado.c | true | 200 | 6,891 | #include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#define MAX_BUFFER_SIZE 100
#define N_OF_PROCESSES 100
typedef struct
{
int id;
int arrival;
int duration;
int priority;
int enqueued;
} Process;
typedef struct
{
Process buffer[MAX_BUFFER_SIZE];
int front;
... | 4 |
DougMouraA/Linguagem-de-Progamacao1-UERJ | 7ececa8 | Lista-1/extra.c | C | www.github.com/DougMouraA/Linguagem-de-Progamacao1-UERJ/tree/main/Lista-1/extra.c | https://raw.githubusercontent.com/DougMouraA/Linguagem-de-Progamacao1-UERJ/7ececa8/Lista-1/extra.c | DougMouraA/Linguagem-de-Progamacao1-UERJ 7ececa8 Lista-1/extra.c | true | 200 | 2,464 | /*
Escrever um programa em C que leia um valor inteiro (limite na casa do milhar), e o imprima em forma
de caracteres, ou seja, por extenso. Ex. : 98 = noventa e oito.
*/
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int tamNUm(int n)
{
int num = n;
int casa = 0;
while (num >= 10)
{
... | 0 |
classroom-ufersa/GerenciamentoDeCheche | d7ff863 | responsavel.c | C | www.github.com/classroom-ufersa/GerenciamentoDeCheche/tree/main/responsavel.c | https://raw.githubusercontent.com/classroom-ufersa/GerenciamentoDeCheche/d7ff863/responsavel.c | classroom-ufersa/GerenciamentoDeCheche d7ff863 responsavel.c | true | 200 | 2,783 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "responsavel.h"
#include "crianca.h"
void adicionar_responsavel(char nome[80], int telefone, Responsavel **responsavel)
{
Responsavel *resp = (Responsavel*)malloc(sizeof(Responsavel));
strcpy(resp->nome, nome);
resp->telefone =... | 2 |
HyeontaeRyu/DataStructure_C | cce8c8b | 1_stack/day1/stack_2.c | C | www.github.com/HyeontaeRyu/DataStructure_C/tree/main/1_stack/day1/stack_2.c | https://raw.githubusercontent.com/HyeontaeRyu/DataStructure_C/cce8c8b/1_stack/day1/stack_2.c | HyeontaeRyu/DataStructure_C cce8c8b 1_stack/day1/stack_2.c | true | 200 | 1,180 | #include <stdio.h>
#include <stdlib.h>
typedef int element;
typedef struct {
element *data;
int capacity;
int top;
} Stack;
void stackInit(Stack *s) {
s->top = -1;
s->capacity = 1;
s->data = (element *)malloc(s->capacity * sizeof(element));
}
int isEmpty(Stack *s) {
return ((s->top) == -1... | 3 |
Kota0217/Num_Analysis_test | 827713a | NumProg_6.c | C | www.github.com/Kota0217/Num_Analysis_test/tree/main/NumProg_6.c | https://raw.githubusercontent.com/Kota0217/Num_Analysis_test/827713a/NumProg_6.c | Kota0217/Num_Analysis_test 827713a NumProg_6.c | true | 200 | 5,139 | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <sys/times.h>
#include <limits.h>
/*1910049 Ishizeki Kota*/
#ifndef SIZE
#define SIZE (1024)
#endif
#ifndef LIMIT
#define LIMIT (200)
#endif
double matA[SIZE][SIZE], vecB[SIZE], vecX[SIZE], ve... | 5 |
Ano-ly/alx-low_level_programming | e7e25e1 | 0x1A-hash_tables/0-hash_table_create.c | C | www.github.com/Ano-ly/alx-low_level_programming/tree/main/0x1A-hash_tables/0-hash_table_create.c | https://raw.githubusercontent.com/Ano-ly/alx-low_level_programming/e7e25e1/0x1A-hash_tables/0-hash_table_create.c | Ano-ly/alx-low_level_programming e7e25e1 0x1A-hash_tables/0-hash_table_create.c | true | 200 | 751 | #include <stdlib.h>
#include <limits.h>
#include "hash_tables.h"
/**
* hash_table_create - creates a new hash table
* @size: size of new hash table to be created
* Definition - creates a new hash table
* Return: pointer to new hash table
*/
hash_table_t *hash_table_create(unsigned long int size)
{
hash_table_t *... | 6 |
AdamLBS/my-rpg | f1c119a | lib/my/my_printf.c | C | www.github.com/AdamLBS/my-rpg/tree/main/lib/my/my_printf.c | https://raw.githubusercontent.com/AdamLBS/my-rpg/f1c119a/lib/my/my_printf.c | AdamLBS/my-rpg f1c119a lib/my/my_printf.c | true | 200 | 1,345 | /*
** EPITECH PROJECT, 2021
** my_printf.c
** File description:
** my_printf.c
*/
#include <stdarg.h>
#include "my.h"
int flag_s (va_list *list)
{
char *temp = va_arg(*list, char *);
if (!temp) {
my_putstr("(null)");
return 1;
}
my_putstr(temp);
return 0;
}
int flag_c (va_list *lis... | 7 |
VegetableBirdB/Gumbling_Game_In_C | 3bf1b6e | c212.c | C | www.github.com/VegetableBirdB/Gumbling_Game_In_C/tree/main/c212.c | https://raw.githubusercontent.com/VegetableBirdB/Gumbling_Game_In_C/3bf1b6e/c212.c | VegetableBirdB/Gumbling_Game_In_C 3bf1b6e c212.c | true | 200 | 3,808 | #include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
#include<assert.h>
enum UserChoice{odd, even, particular};
typedef struct player{
char* name;
int money;
}Player;
typedef struct enemy{
char* name;
int money;
}Enemy;
typedef enum UserChoice UserChoice;
int generateNum();
bool isWinOddAndEven(int systemNum, U... | 4 |
DevSaurabhGirme/Programs | f5d6ba9 | Logic/program46.c | C | www.github.com/DevSaurabhGirme/Programs/tree/main/Logic/program46.c | https://raw.githubusercontent.com/DevSaurabhGirme/Programs/f5d6ba9/Logic/program46.c | DevSaurabhGirme/Programs f5d6ba9 Logic/program46.c | true | 200 | 331 | #include<stdio.h>
void DisplayDigits(int iNo)
{
int iDigit = 0;
while(iNo != 0)
{
iDigit = iNo % 10;
printf("%d\n",iDigit);
iNo = iNo/10;
printf("%d\n",iNo);
}
}
int main()
{
int iValue = 0;
printf("Enter number :");
scanf("%d", &iValue);
DisplayDigits(iValue);
ret... | 5 |
AlexGudis/CMC_MSU_student | 7b10fcf | grade2/sem3/prac/contest11/1.c | C | www.github.com/AlexGudis/CMC_MSU_student/tree/main/grade2/sem3/prac/contest11/1.c | https://raw.githubusercontent.com/AlexGudis/CMC_MSU_student/7b10fcf/grade2/sem3/prac/contest11/1.c | AlexGudis/CMC_MSU_student 7b10fcf grade2/sem3/prac/contest11/1.c | true | 200 | 252 | #include <stdio.h>
#include <unistd.h>
int
proc(void)
{
int pid = fork();
if (!pid) {
// in father proc
write(1, "1\n", 2);
}
return pid;
}
int
main(void)
{
int summ_pid = proc() + proc() + proc();
return 0;
}
| 2 |
EWanjau/alx-low_level_programming | 2451fc9 | 0x10-variadic_functions/0-sum_them_all.c | C | www.github.com/EWanjau/alx-low_level_programming/tree/main/0x10-variadic_functions/0-sum_them_all.c | https://raw.githubusercontent.com/EWanjau/alx-low_level_programming/2451fc9/0x10-variadic_functions/0-sum_them_all.c | EWanjau/alx-low_level_programming 2451fc9 0x10-variadic_functions/0-sum_them_all.c | true | 200 | 394 | #include "variadic_functions.h"
/**
* sum_them_all - sums all arguments passed
* @n: all integers parsed to the function as inputs
* Return: returns the sum
*/
int sum_them_all(const unsigned int n, ...)
{
va_list ap;
unsigned int i;
int sum;
va_start(ap, n);
if (n == 0)
return (0);
sum = 0;
for (i = 0;... | 3 |
mrsteyk/simpler_kyber | 7aeae23 | pqclean/kyber768/aarch64/neon_polyvec.c | C | www.github.com/mrsteyk/simpler_kyber/tree/main/pqclean/kyber768/aarch64/neon_polyvec.c | https://raw.githubusercontent.com/mrsteyk/simpler_kyber/7aeae23/pqclean/kyber768/aarch64/neon_polyvec.c | mrsteyk/simpler_kyber 7aeae23 pqclean/kyber768/aarch64/neon_polyvec.c | true | 200 | 3,654 |
/*
* This file was originally licensed
* under Apache 2.0 (https://www.apache.org/licenses/LICENSE-2.0.html)
* at https://github.com/GMUCERG/PQC_NEON/blob/main/neon/kyber or
* public domain at https://github.com/cothan/kyber/blob/master/neon
*
* We offer
* CC0 1.0 Universal or the following MIT License ... | 6 |
KalinaRaycheva/Training | 965a1ed | C/09_Strings_And_Pointers/09_exercise.c | C | www.github.com/KalinaRaycheva/Training/tree/main/C/09_Strings_And_Pointers/09_exercise.c | https://raw.githubusercontent.com/KalinaRaycheva/Training/965a1ed/C/09_Strings_And_Pointers/09_exercise.c | KalinaRaycheva/Training 965a1ed C/09_Strings_And_Pointers/09_exercise.c | true | 200 | 895 | /*
9) Напишете C програма за броене на срещания на дума в даден низ с помощта на цикъл.
*/
#include <stdio.h>
#include <string.h>
void search(char word[], char str[]);
int main(){
char str[100], word[100];
printf("Enter a string: "); gets(str);
printf("Enter a word: "); gets(word);
sea... | 0 |
skst/Timekeeper | 82da355 | COMToys/src/StdAfx.h | C | www.github.com/skst/Timekeeper/tree/main/COMToys/src/StdAfx.h | https://raw.githubusercontent.com/skst/Timekeeper/82da355/COMToys/src/StdAfx.h | skst/Timekeeper 82da355 COMToys/src/StdAfx.h | true | 200 | 1,082 | /*
8.1 0x0603
8 0x0602
7 0x0601
Vista 0x0600
2003 0x0502
XP 0x0501
2K/Me 0x0500
98 0x0410
95 0x0400
*/
//#define _WIN32_WINDOWS 0x0600
//#define WINVER 0x0600
#define _WIN32_WINNT 0x0601
#ifndef VC_EXTRALEAN
#define VC_EXTRALEAN // Exclude rarely-used stuff from Windows he... | 1 |
JosueTorresN/proyecto1Lenguajes | 5b265ee | operativeMenu.h | C | www.github.com/JosueTorresN/proyecto1Lenguajes/tree/main/operativeMenu.h | https://raw.githubusercontent.com/JosueTorresN/proyecto1Lenguajes/5b265ee/operativeMenu.h | JosueTorresN/proyecto1Lenguajes 5b265ee operativeMenu.h | true | 200 | 10,056 | #ifndef OPERATIVEMENU_H
#define OPERATIVEMENU_H
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "./backend/mySQLconnector.h"
void estadisticas() {
// Top 3 meses con mas eventos
// Top 3 eventos con mas recaudacion
// Listado de sitios de eventos con cantidad de eventos y monto total re... | 4 |
Dnb0712750762/alx-low_level_programming | f30da6f | 0x07-pointers_arrays_strings/3-strspn.c | C | www.github.com/Dnb0712750762/alx-low_level_programming/tree/main/0x07-pointers_arrays_strings/3-strspn.c | https://raw.githubusercontent.com/Dnb0712750762/alx-low_level_programming/f30da6f/0x07-pointers_arrays_strings/3-strspn.c | Dnb0712750762/alx-low_level_programming f30da6f 0x07-pointers_arrays_strings/3-strspn.c | true | 200 | 357 | #include "main.h"
/**
*_strspn - search a string for a set of bytes
*@s: source string
*@accept: accepted string
*
*Return: number of bytes in the init segment
*/
unsigned int _strspn(char *s, char *accept)
{
unsigned int a = 0, b, t = o;
while (accept[a])
{
b = 0;
while (s[b] != 32)
{
if (accept[a] == s[b])
{... | 2 |
DeRhode/alx-low_level_programming | 7c50ef5 | 0x0E-structures_typedef/4-new_dog.c | C | www.github.com/DeRhode/alx-low_level_programming/tree/main/0x0E-structures_typedef/4-new_dog.c | https://raw.githubusercontent.com/DeRhode/alx-low_level_programming/7c50ef5/0x0E-structures_typedef/4-new_dog.c | DeRhode/alx-low_level_programming 7c50ef5 0x0E-structures_typedef/4-new_dog.c | true | 200 | 568 | #include <stdio.h>
#include "dog.h"
#include <stdlib.h>
#include <string.h>
/**
* new_dog - Function to create new dog
* @name: name
* @age: age
* @owner: owner
*/
dog_t *new_dog(char *name, float age, char *owner)
{
dog_t *Nd = malloc(sizeof(dog_t));
if (Nd == NULL)
return NULL;
Nd->name = malloc(strlen(name... | 5 |
Yll2104/Language | 64ae4e1 | A2-Yll.c | C | www.github.com/Yll2104/Language/tree/main/A2-Yll.c | https://raw.githubusercontent.com/Yll2104/Language/64ae4e1/A2-Yll.c | Yll2104/Language 64ae4e1 A2-Yll.c | true | 200 | 406 | #include <stdio.h>
int main(){
int Feld[20] = {0};
int n = 0;
do{
printf("Enter number of values per line [2 < number < 6]: ");
scanf("%d", &n);
} while(n < 2 && n > 6);
for(int i = 0; i < 20; i++){
Feld[i] = (i + 1) * 4;
if(i % n == 0){
... | 3 |
saadERRAOUI/get_next_line | b27ab16 | get_next_line_utils_bonus.c | C | www.github.com/saadERRAOUI/get_next_line/tree/main/get_next_line_utils_bonus.c | https://raw.githubusercontent.com/saadERRAOUI/get_next_line/b27ab16/get_next_line_utils_bonus.c | saadERRAOUI/get_next_line b27ab16 get_next_line_utils_bonus.c | true | 200 | 2,242 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* get_next_line_utils_bonus.c :+: :+: :+: ... | 7 |
harsharajnath/Emertxe | 5196294 | PIC16F877A_MPLABXProjects/Assignments/Grace/A1_LED_Train_Direction.X/main.c | C | www.github.com/harsharajnath/Emertxe/tree/main/PIC16F877A_MPLABXProjects/Assignments/Grace/A1_LED_Train_Direction.X/main.c | https://raw.githubusercontent.com/harsharajnath/Emertxe/5196294/PIC16F877A_MPLABXProjects/Assignments/Grace/A1_LED_Train_Direction.X/main.c | harsharajnath/Emertxe 5196294 PIC16F877A_MPLABXProjects/Assignments/Grace/A1_LED_Train_Direction.X/main.c | true | 200 | 3,287 | /*
* Name: Harsharaj Nath
* Date of Submission: 06-09-22
* Description: Implementation of pattern generator on LEDs controlled by switches
#########################################_Program_begins_from_here_######################################### */
#include <xc.h>
#include "main.h"
#include "digital_keypad.h"
... | 6 |
Dhruv-Poovayya/C-Code | a6fc955 | Assignment_PRG's/PRG_65_126/PRG_65_126.c | C | www.github.com/Dhruv-Poovayya/C-Code/tree/main/Assignment_PRG's/PRG_65_126/PRG_65_126.c | https://raw.githubusercontent.com/Dhruv-Poovayya/C-Code/a6fc955/Assignment_PRG%27s/PRG_65_126/PRG_65_126.c | Dhruv-Poovayya/C-Code a6fc955 Assignment_PRG's/PRG_65_126/PRG_65_126.c | true | 200 | 1,599 | /* BINARY ADDITION USING STRINGS */
#include<stdio.h>
#include<string.h>
int main()
{
char a[32];
char b[32];
char result[33];
int sum=0;
int carry=0;
printf("Enter the a Binary Number:");
fgets(a,32,stdin);
printf("Enter the a Binary Number:");
fgets(b,32,stdin);
int len_a= st... | 4 |
Benfati20/alx-low_level_programming | 80666e3 | 0x10-variadic_functions/2-print_strings.c | C | www.github.com/Benfati20/alx-low_level_programming/tree/main/0x10-variadic_functions/2-print_strings.c | https://raw.githubusercontent.com/Benfati20/alx-low_level_programming/80666e3/0x10-variadic_functions/2-print_strings.c | Benfati20/alx-low_level_programming 80666e3 0x10-variadic_functions/2-print_strings.c | true | 200 | 562 | #include "variadic_functions.h"
#include <stdio.h>
#include <stdarg.h>
/**
* print_strings - prints strings
* @separator: to be printed between the strings
* @n: number of strings
*/
void print_strings(const char *separator, const unsigned int n, ...)
{
va_list string;
char *str;
unsigned int i;
va_start(str... | 2 |
Wireless-XZ/alx-low_level_programming | c680d11 | 0x17-doubly_linked_lists/5-get_dnodeint.c | C | www.github.com/Wireless-XZ/alx-low_level_programming/tree/main/0x17-doubly_linked_lists/5-get_dnodeint.c | https://raw.githubusercontent.com/Wireless-XZ/alx-low_level_programming/c680d11/0x17-doubly_linked_lists/5-get_dnodeint.c | Wireless-XZ/alx-low_level_programming c680d11 0x17-doubly_linked_lists/5-get_dnodeint.c | true | 200 | 450 | #include "lists.h"
/**
* get_dnodeint_at_index - gets the node at a given index
* @head: head node
* @index: index position of the node
*
* Return: node at index index
*/
dlistint_t *get_dnodeint_at_index(dlistint_t *head, unsigned int index)
{
unsigned int x;
if (head == NULL)
return (NULL);
else if (inde... | 3 |
worabet1/Thesisstation | b78cf0d | ThesisStation/Core/Inc/hx711.h | C | www.github.com/worabet1/Thesisstation/tree/main/ThesisStation/Core/Inc/hx711.h | https://raw.githubusercontent.com/worabet1/Thesisstation/b78cf0d/ThesisStation/Core/Inc/hx711.h | worabet1/Thesisstation b78cf0d ThesisStation/Core/Inc/hx711.h | true | 200 | 1,837 | #ifndef HX711_H_
#define HX711_H_
/*
Author: Nima Askari
WebSite: http://www.github.com/NimaLTD
Instagram: http://instagram.com/github.NimaLTD
Youtube: https://www.youtube.com/channel/UCUhY7qY1klJm1d2kulr9ckw
Version: 1.1.1
Reversion History:
(1.1.1):
Add power down/up.
(... | 7 |
griselizr/holbertonschool-low_level_programming | 7fee602 | recursion/5-sqrt_recursion.c | C | www.github.com/griselizr/holbertonschool-low_level_programming/tree/main/recursion/5-sqrt_recursion.c | https://raw.githubusercontent.com/griselizr/holbertonschool-low_level_programming/7fee602/recursion/5-sqrt_recursion.c | griselizr/holbertonschool-low_level_programming 7fee602 recursion/5-sqrt_recursion.c | true | 200 | 451 | #include "main.h"
/**
* sq_verify - verify the square root of c
* @sr: of sq
* @v: verify square root
* Return: -1 or sq of c
*/
int sq_verify(int sr, int v)
{
if (sr * sr == v)
return (sr);
if (sr * sr > v)
return (-1);
return (sq_verify(sr + 1, v));
}
/**
* _sqrt_recursion - returns natural square ro... | 6 |
Cosmqs/alx-low_level_programming | 3f97ff7 | 0x09-static_libraries/5-strstr.c | C | www.github.com/Cosmqs/alx-low_level_programming/tree/main/0x09-static_libraries/5-strstr.c | https://raw.githubusercontent.com/Cosmqs/alx-low_level_programming/3f97ff7/0x09-static_libraries/5-strstr.c | Cosmqs/alx-low_level_programming 3f97ff7 0x09-static_libraries/5-strstr.c | true | 200 | 400 | #include "main.h"
/**
* _strstr - locates a substring
* @haystack: parameter one
* @needle: char two
*
* Return: Always 0.
*/
char *_strstr(char *haystack, char *needle)
{
for (; *haystack != '\0'; haystack++)
{
char *one = haystack;
char *two = needle;
while (*one == *two && *two != '\0')
{
one+... | 4 |
klaus139/alx-low_level_programming | e94fdd7 | 0x12-singly_linked_lists/1-list_len.c | C | www.github.com/klaus139/alx-low_level_programming/tree/main/0x12-singly_linked_lists/1-list_len.c | https://raw.githubusercontent.com/klaus139/alx-low_level_programming/e94fdd7/0x12-singly_linked_lists/1-list_len.c | klaus139/alx-low_level_programming e94fdd7 0x12-singly_linked_lists/1-list_len.c | true | 200 | 265 | #include "lists.h"
/**
* list_len - returns the number of elements in a linked list_l list
* @h: pointer to the list
* Return: number of nodes
*/
size_t list_len(const list_t *h)
{
size_t cont = 0;
while (h)
{
cont++;
h = h->next;
}
return (cont);
}
| 5 |
mbadr12/STM32F446RE_Drivers | 2e79057 | 1- MCAL/4- NVIC/SRC/NVIC_Program.c | C | www.github.com/mbadr12/STM32F446RE_Drivers/tree/main/1- MCAL/4- NVIC/SRC/NVIC_Program.c | https://raw.githubusercontent.com/mbadr12/STM32F446RE_Drivers/2e79057/1-%20MCAL/4-%20NVIC/SRC/NVIC_Program.c | mbadr12/STM32F446RE_Drivers 2e79057 1- MCAL/4- NVIC/SRC/NVIC_Program.c | true | 200 | 5,745 | /************************************************************************************/
/************************************************************************************/
/************************* Author: Mahmoud Badr *************************/
/************************* Layer: MCAL **********************... | 2 |
renzotassara/Microcontroladores | 6941780 | Proyecto_Final_Braille/Core/Src/Movimiento_Servo.c | C | www.github.com/renzotassara/Microcontroladores/tree/main/Proyecto_Final_Braille/Core/Src/Movimiento_Servo.c | https://raw.githubusercontent.com/renzotassara/Microcontroladores/6941780/Proyecto_Final_Braille/Core/Src/Movimiento_Servo.c | renzotassara/Microcontroladores 6941780 Proyecto_Final_Braille/Core/Src/Movimiento_Servo.c | true | 200 | 617 | #include "Movimiento_Servo.h"
#include "stm32f1xx_hal.h"
#include "main.h"
uint16_t pos_final = 750; //550 = 0º y 2450 = 180º
uint8_t vel_servo = 5; //Cuanto menor sea el numero, mas rapido será
uint16_t pos_inicial = 550; //Valor inicial (0º)
uint16_t pos_actual;
uint16_t t_reposo = 10;
void Movimiento_Servo(){
p... | 3 |
atsign-foundation/at_c | 288ea59 | packages/atclient/src/notify.c | C | www.github.com/atsign-foundation/at_c/tree/main/packages/atclient/src/notify.c | https://raw.githubusercontent.com/atsign-foundation/at_c/288ea59/packages/atclient/src/notify.c | atsign-foundation/at_c 288ea59 packages/atclient/src/notify.c | true | 200 | 15,834 | #include "atclient/notify.h"
#include "atclient/atclient.h"
#include "atclient/connection.h"
#include "atclient/encryption_key_helpers.h"
#include "atclient/metadata.h"
#include "atclient/notify_params.h"
#include "atclient/string_utils.h"
#include <atchops/aes.h>
#include <atchops/aes_ctr.h>
#include <atchops/base64.h... | 7 |
codingcoug/Coding-Quizes | 409483f | C/voulCount.c | C | www.github.com/codingcoug/Coding-Quizes/tree/main/C/voulCount.c | https://raw.githubusercontent.com/codingcoug/Coding-Quizes/409483f/C/voulCount.c | codingcoug/Coding-Quizes 409483f C/voulCount.c | true | 200 | 346 | #include <stddef.h>
#include <stdio.h>
#include <string.h>
size_t get_count(const char *s)
{
unsigned int count = 0;
int size = strlen(s);
for(int i = 0; i < size;i++ ){
if(s[i] == 'a'|| s[i] == 'e'|| s[i] == 'i'|| s[i] == 'o'|| s[i] == 'u'){count++;}
}
//printf("the size is %d\n\r",count);
return... | 6 |
camballe/collection-of-c-programs | 78b767a | area.c | C | www.github.com/camballe/collection-of-c-programs/tree/main/area.c | https://raw.githubusercontent.com/camballe/collection-of-c-programs/78b767a/area.c | camballe/collection-of-c-programs 78b767a area.c | true | 200 | 1,223 | #include <stdio.h>
void main()
{
float base, height, radius, length, width;
double area;
char shape;
printf("Choose a shape whose area you would like to calculate:\nT: Triangle\nC:Circle\nR:Rectangle\n");
scanf(" %c", &shape);
switch(shape)
{
case 'T':
printf("Enter the base length:\n");
scanf("%f", &b... | 4 |
Charles-Google/UESTC_Linux_filesystem | 619910f | filesystem/prompt.h | C | www.github.com/Charles-Google/UESTC_Linux_filesystem/tree/main/filesystem/prompt.h | https://raw.githubusercontent.com/Charles-Google/UESTC_Linux_filesystem/619910f/filesystem/prompt.h | Charles-Google/UESTC_Linux_filesystem 619910f filesystem/prompt.h | true | 200 | 3,537 |
#include "exec.h"
/* Constants */
#define MAXLINE 1024
#define MAXARGS 128
/* Global variables */
char theme[] = "Here to control file system";
/* Founction prototypes */
void eval(char *cmdline);
int parseline(const char *cmdline, char **argv);
/* Print file system version */
void print_version()
{
char load[... | 5 |
YaBear/CICD | 15cb862 | src/grep/s21_grep.c | C | www.github.com/YaBear/CICD/tree/main/src/grep/s21_grep.c | https://raw.githubusercontent.com/YaBear/CICD/15cb862/src/grep/s21_grep.c | YaBear/CICD 15cb862 src/grep/s21_grep.c | true | 200 | 14,754 | #include "s21_grep.h"
regex_t regeex;
regmatch_t match;
int main(int argc, char *argv[]) {
char e_pattern_template[128][128] = {0};
int e_pattern_count = 0;
char f_pattern_file[128] = {0};
const char *short_options = "e:ivclnhsf:o";
const struct option long_options[] = {
{"pattern", required_... | 2 |
Yassir0123/binary_trees | 0ca19bd | 2-binary_tree_insert_right.c | C | www.github.com/Yassir0123/binary_trees/tree/main/2-binary_tree_insert_right.c | https://raw.githubusercontent.com/Yassir0123/binary_trees/0ca19bd/2-binary_tree_insert_right.c | Yassir0123/binary_trees 0ca19bd 2-binary_tree_insert_right.c | true | 200 | 821 | #include "binary_trees.h"
/**
* binary_tree_insert_right - Insert a nd asright-child
* of a second bintree.
* @parent: ptr to the nd to insert the r-child.
* @value: val to store in nnode.
*
* Return: If parent is NULL or an error occurs - NULL.
* Otherwise - ptr tonnode.
*
... | 3 |
Sophiat06/alx-low_level_programming | 0d1830f | 0x13-more_singly_linked_lists/10-delete_nodeint.c | C | www.github.com/Sophiat06/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/10-delete_nodeint.c | https://raw.githubusercontent.com/Sophiat06/alx-low_level_programming/0d1830f/0x13-more_singly_linked_lists/10-delete_nodeint.c | Sophiat06/alx-low_level_programming 0d1830f 0x13-more_singly_linked_lists/10-delete_nodeint.c | true | 200 | 688 | #include "lists.h"
/**
* delete_nodeint_at_index - deletes a node in a listint_t linked
* list at a certain index
* @head: pointer to the first element in the list
* @index: index of the node to delete
*
* Return: 1 (Success), or -1 (Fail)
*/
int delete_nodeint_at_index(listint_t **head, unsigned int index)
{
listint_... | 7 |
kry01/alx-low_level_programming | daaecfa | 0x07-pointers_arrays_strings/2-strchr.c | C | www.github.com/kry01/alx-low_level_programming/tree/main/0x07-pointers_arrays_strings/2-strchr.c | https://raw.githubusercontent.com/kry01/alx-low_level_programming/daaecfa/0x07-pointers_arrays_strings/2-strchr.c | kry01/alx-low_level_programming daaecfa 0x07-pointers_arrays_strings/2-strchr.c | true | 200 | 320 | #include "main.h"
/**
* _strchr - function to locates a char in a string.
*
* @s: string.
* @c: char.
*
* Return: return the value.
*/
char *_strchr(char *s, char c)
{
int i = 0;
while (*(s + i) != '\0')
{
if (*(s + i) == c)
return (s + i);
i++;
}
if (*(s + i) == c)
return (s + i);
return (0);
}
| 4 |
preritpaliwal/networks_lab | b4f400b | so.c | C | www.github.com/preritpaliwal/networks_lab/tree/main/so.c | https://raw.githubusercontent.com/preritpaliwal/networks_lab/b4f400b/so.c | preritpaliwal/networks_lab b4f400b so.c | true | 200 | 6,206 | #include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netdb.h>
#include <netinet/in.h>
#include <netinet/in_systm.h>
#include <netinet/ip.h>
#include <netinet/ip_icmp.h>
#include <string.h>
#include <arpa/inet.h>
#include <sys/select.h>
#include <sys/time.h>
unsigned short cks... | 6 |
shreys02/Projects | 323bd25 | Pintos Operating System Integration/src/tests/userprog/bad-read.c | C | www.github.com/shreys02/Projects/tree/main/Pintos Operating System Integration/src/tests/userprog/bad-read.c | https://raw.githubusercontent.com/shreys02/Projects/323bd25/Pintos%20Operating%20System%20Integration/src/tests/userprog/bad-read.c | shreys02/Projects 323bd25 Pintos Operating System Integration/src/tests/userprog/bad-read.c | true | 200 | 359 | /* This program attempts to read memory at an address that is not mapped.
This should terminate the process with a -1 exit code. */
#include "tests/lib.h"
#include "tests/main.h"
void
test_main (void)
{
msg ("Congratulations - you have successfully dereferenced NULL: %d",
*(volatile int *) NULL);
... | 5 |
CauaPadovani/FPR-Fundamentos-de-Programacao | c58231d | Repositório FPR AV2/Exemplos de Arquivo/Unir ARQ.c | C | www.github.com/CauaPadovani/FPR-Fundamentos-de-Programacao/tree/main/Repositório FPR AV2/Exemplos de Arquivo/Unir ARQ.c | https://raw.githubusercontent.com/CauaPadovani/FPR-Fundamentos-de-Programacao/c58231d/Reposit%C3%B3rio%20FPR%20AV2/Exemplos%20de%20Arquivo/Unir%20ARQ.c | CauaPadovani/FPR-Fundamentos-de-Programacao c58231d Repositório FPR AV2/Exemplos de Arquivo/Unir ARQ.c | true | 200 | 4,119 |
Quest�o 06:
Desenvolver uma fun��o que, dados dois arquivos textos arqA e arqB, crie um novo
arquivo arqC, considerando que:
- arqA e arqB cont�m n�meros reais, um por linha, ordenados crescentemente e
sem repeti��o no arquivo;
- arqC deve conter todos os n�meros dos dois arquivos originais;
- Assi... | 2 |
thomcleary/learn-c | e641b52 | c-programming-a-modern-approach/17-advanced-uses-of-pointers/exercises/08.c | C | www.github.com/thomcleary/learn-c/tree/main/c-programming-a-modern-approach/17-advanced-uses-of-pointers/exercises/08.c | https://raw.githubusercontent.com/thomcleary/learn-c/e641b52/c-programming-a-modern-approach/17-advanced-uses-of-pointers/exercises/08.c | thomcleary/learn-c e641b52 c-programming-a-modern-approach/17-advanced-uses-of-pointers/exercises/08.c | true | 200 | 2,338 | /*
Section 15.2 describes a file, stack.c, that provides functions for storing integers in a stack.
In that section, the stack was implemented as an array.
Modify stack.c so that a stack is now stored as a linked list.
Replace the contents and top variables by a single variable that points to the first node in the list... | 7 |
VoxARTAudio/STM-SineWavDAC-I2S | 53ca5bd | Core/Inc/main.h | C | www.github.com/VoxARTAudio/STM-SineWavDAC-I2S/tree/main/Core/Inc/main.h | https://raw.githubusercontent.com/VoxARTAudio/STM-SineWavDAC-I2S/53ca5bd/Core/Inc/main.h | VoxARTAudio/STM-SineWavDAC-I2S 53ca5bd Core/Inc/main.h | true | 200 | 2,647 | /* USER CODE BEGIN Header */
/**
******************************************************************************
* @file : main.h
* @brief : Header for main.c file.
* This file contains the common defines of the application.
*************************************************... | 3 |
karlmueller/violetshift | 16f635a | node0_btReceiver/components/arduino/tools/sdk/esp32s2/include/esp-dsp/modules/dotprod/include/dsps_dotprod.h | C | www.github.com/karlmueller/violetshift/tree/main/node0_btReceiver/components/arduino/tools/sdk/esp32s2/include/esp-dsp/modules/dotprod/include/dsps_dotprod.h | https://raw.githubusercontent.com/karlmueller/violetshift/16f635a/node0_btReceiver/components/arduino/tools/sdk/esp32s2/include/esp-dsp/modules/dotprod/include/dsps_dotprod.h | karlmueller/violetshift 16f635a node0_btReceiver/components/arduino/tools/sdk/esp32s2/include/esp-dsp/modules/dotprod/include/dsps_dotprod.h | true | 200 | 4,418 | // Copyright 2018-2019 Espressif Systems (Shanghai) PTE LTD
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless requi... | 6 |
Alvald1/sem2 | a196492 | 2/lib/task.c | C | www.github.com/Alvald1/sem2/tree/main/2/lib/task.c | https://raw.githubusercontent.com/Alvald1/sem2/a196492/2/lib/task.c | Alvald1/sem2 a196492 2/lib/task.c | true | 200 | 4,253 | #include "task.h"
#include <limits.h>
#include <readline/readline.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "code_status.h"
#include "patient.h"
#include "read.h"
#include "sort.h"
int
task(Dequeue* dequeue) {
char* line = NULL;
char* save_line = NULL;
char* info = NULL;
Pa... | 4 |
NguyenDinhQuocHuy/LapTrinhCauTruc-Ccongcong | 358893d | Lab06_Mang2Chieu_MaTran/Lab06_HDTH_Bai01_Mang2Chieu/thuvien.h | C | www.github.com/NguyenDinhQuocHuy/LapTrinhCauTruc-Ccongcong/tree/main/Lab06_Mang2Chieu_MaTran/Lab06_HDTH_Bai01_Mang2Chieu/thuvien.h | https://raw.githubusercontent.com/NguyenDinhQuocHuy/LapTrinhCauTruc-Ccongcong/358893d/Lab06_Mang2Chieu_MaTran/Lab06_HDTH_Bai01_Mang2Chieu/thuvien.h | NguyenDinhQuocHuy/LapTrinhCauTruc-Ccongcong 358893d Lab06_Mang2Chieu_MaTran/Lab06_HDTH_Bai01_Mang2Chieu/thuvien.h | true | 200 | 946 | // Dinh nghia hang so va cac kieu du lieu moi
#define SIZE 50
#define MAX 1000
#define TAB '\t'
typedef int MaTran [SIZE][SIZE];
// Khai bao nguyen mau cac ham xu ly
void NhapMaTran (MaTran a, int m, int n);
void NhapTuDong (MaTran a, int m, int n);
void XuatMaTran(MaTran a, int m, int n);
// Dinh nghia ... | 5 |
DeviousCardi/BTP | 720b738 | deepfix_data/prob329/erroneous/prog50778-user519.c | C | www.github.com/DeviousCardi/BTP/tree/main/deepfix_data/prob329/erroneous/prog50778-user519.c | https://raw.githubusercontent.com/DeviousCardi/BTP/720b738/deepfix_data/prob329/erroneous/prog50778-user519.c | DeviousCardi/BTP 720b738 deepfix_data/prob329/erroneous/prog50778-user519.c | true | 200 | 293 | #include <stdio.h>
#include <stdlib.h>
int main() {
int a,b,c;
scanf("%d""%d""%d",&a,&b,&c);
if((b*b)==((c*c)+(a*a)))
printf("right triangle");
else if ((b*b)>((a*a)+(c*c)))||((b*b)<(a*a)+(c*c)))
printf("not a right triangle");
else
printf("cannot form a right triangle");
return 0; } | 2 |
snpsuen/XDP_Stateful_LB | 82a374c | xdp_state_lb_kern.h | C | www.github.com/snpsuen/XDP_Stateful_LB/tree/main/xdp_state_lb_kern.h | https://raw.githubusercontent.com/snpsuen/XDP_Stateful_LB/82a374c/xdp_state_lb_kern.h | snpsuen/XDP_Stateful_LB 82a374c xdp_state_lb_kern.h | true | 200 | 1,265 | #include <stddef.h>
#include <linux/bpf.h>
#include <linux/in.h>
#include <linux/if_ether.h>
#include <linux/if_packet.h>
#include <linux/ip.h>
#include <linux/tcp.h>
#include <linux/ipv6.h>
#include <linux/string.h>
#include <sys/socket.h>
#include <bpf/bpf_helpers.h>
#include <bpf/bpf_endian.h>
static __always_inlin... | 7 |
vrittisurani21/C | 1b38a65 | lab 13/13a3.c | C | www.github.com/vrittisurani21/C/tree/main/lab 13/13a3.c | https://raw.githubusercontent.com/vrittisurani21/C/1b38a65/lab%2013/13a3.c | vrittisurani21/C 1b38a65 lab 13/13a3.c | true | 200 | 185 | #include<stdio.h>
void main(){
int n=5,i,j,k;
for(i=1;i<=n;i++){
for(j=1;j<=n-i;j++){
printf(" ");
}
for(k=1;k<=i;k++){
printf("*");
}
printf("\n");
}
}
| 3 |
bhavyansh001/C-Programming-with-DSA | 7a40f63 | C_Rock_Paper_Scissors.c | C | www.github.com/bhavyansh001/C-Programming-with-DSA/tree/main/C_Rock_Paper_Scissors.c | https://raw.githubusercontent.com/bhavyansh001/C-Programming-with-DSA/7a40f63/C_Rock_Paper_Scissors.c | bhavyansh001/C-Programming-with-DSA 7a40f63 C_Rock_Paper_Scissors.c | true | 200 | 1,989 | #include<stdio.h>
#include<time.h>
#include<stdlib.h>
int rand_num(){
//Random number generator
int seed = time(NULL);
int rand_num;
srand(seed);
rand_num = rand() % 3 + 1;
return(rand_num);
}
void print_comp(int comp){
if(comp == 1){
printf("Computer: Rock\n");
}
else if(comp == 2){
printf("C... | 4 |
simorabit/philosopher | dff9457 | philo_bonus/string_utils.c | C | www.github.com/simorabit/philosopher/tree/main/philo_bonus/string_utils.c | https://raw.githubusercontent.com/simorabit/philosopher/dff9457/philo_bonus/string_utils.c | simorabit/philosopher dff9457 philo_bonus/string_utils.c | true | 200 | 2,112 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* string_utils.c :+: :+: :+: ... | 6 |
bittrip/alx-low_level_programming | 1b35407 | 0x01-variables_if_else_while/3-print_alphabets.c | C | www.github.com/bittrip/alx-low_level_programming/tree/main/0x01-variables_if_else_while/3-print_alphabets.c | https://raw.githubusercontent.com/bittrip/alx-low_level_programming/1b35407/0x01-variables_if_else_while/3-print_alphabets.c | bittrip/alx-low_level_programming 1b35407 0x01-variables_if_else_while/3-print_alphabets.c | true | 200 | 264 | #include <stdio.h>
/**
* main - prints alphabet in uppercase and lowercase
* Return: 0
*/
int main(void)
{
int i, j;
i = 97;
j = 65;
while (i < 123)
{
putchar(i);
i++;
}
while (j < 91)
{
putchar(j);
j++;
}
putchar(10);
return (0);
}
| 5 |
TantorLabs/meetups | 0a2b211 | 2024-09-17_Kazan/Artem Bugaenko - (SIMD)Enhancing Postgres performance with data array vector processing/AVX2/02_print_vec.c | C | www.github.com/TantorLabs/meetups/tree/main/2024-09-17_Kazan/Artem Bugaenko - (SIMD)Enhancing Postgres performance with data array vector processing/AVX2/02_print_vec.c | https://raw.githubusercontent.com/TantorLabs/meetups/0a2b211/2024-09-17_Kazan/Artem%20Bugaenko%20-%20%28SIMD%29Enhancing%20Postgres%20performance%20with%20data%20array%20vector%20processing/AVX2/02_print_vec.c | TantorLabs/meetups 0a2b211 2024-09-17_Kazan/Artem Bugaenko - (SIMD)Enhancing Postgres performance with data array vector processing/AVX2/02_print_vec.c | true | 200 | 971 | #pragma GCC target("avx2")
#include <immintrin.h>
#include <stdio.h>
// Функция для вывода содержимого AVX2 регистра (__m256i) в виде массива 32-разрядных целых чисел
void print_avx2_register(const char *pname, __m256i r) {
int vals[8] __attribute__((aligned(32)));
// Сохранение содержимого регистра в массив
... | 2 |
ToF-/AoC22C | a2edeb3 | day04/camp_cleanup.c | C | www.github.com/ToF-/AoC22C/tree/main/day04/camp_cleanup.c | https://raw.githubusercontent.com/ToF-/AoC22C/a2edeb3/day04/camp_cleanup.c | ToF-/AoC22C a2edeb3 day04/camp_cleanup.c | true | 200 | 993 | #include <stdio.h>
const int LINE_MAX = 20;
int within(int x, int a, int b) {
return (x >= a && x <= b);
}
int main(int argc, char *argv[]) {
char line[LINE_MAX];
FILE *puzzleFile;
puzzleFile = fopen(argv[1], "r");
if(puzzleFile == NULL) {
fprintf(stderr, "can't open file %s\n", argv[1]);... | 3 |
Wongoose/minishell-42KL | 993596e | src/tokenization/token_validate.c | C | www.github.com/Wongoose/minishell-42KL/tree/main/src/tokenization/token_validate.c | https://raw.githubusercontent.com/Wongoose/minishell-42KL/993596e/src/tokenization/token_validate.c | Wongoose/minishell-42KL 993596e src/tokenization/token_validate.c | true | 200 | 2,111 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* token_validate.c :+: :+: :+: ... | 4 |
AbiollaghJames/alx-low_level_programming | eafbc71 | 0x06-pointers_arrays_strings/4-rev_array.c | C | www.github.com/AbiollaghJames/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/4-rev_array.c | https://raw.githubusercontent.com/AbiollaghJames/alx-low_level_programming/eafbc71/0x06-pointers_arrays_strings/4-rev_array.c | AbiollaghJames/alx-low_level_programming eafbc71 0x06-pointers_arrays_strings/4-rev_array.c | true | 200 | 264 | #include "main.h"
/**
* reverse_array - reverses array
* @a: parameter 1
* @n: parameter 2
* Return: 0
*/
void reverse_array(int *a, int n)
{
int temp, i;
for (i = n - 1; i > n / 2; i--)
{
temp = a[n - 1 - i];
a[n - 1 - i] = a[i];
a[i] = temp;
}
}
| 5 |
mathh1337/Cwiczenia-z-jezyka-C | 1923cd5 | zad9/main.c | C | www.github.com/mathh1337/Cwiczenia-z-jezyka-C/tree/main/zad9/main.c | https://raw.githubusercontent.com/mathh1337/Cwiczenia-z-jezyka-C/1923cd5/zad9/main.c | mathh1337/Cwiczenia-z-jezyka-C 1923cd5 zad9/main.c | true | 200 | 2,084 | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
// Funkcja generująca liczby pseudolosowe
int random_number(int seed) {
return (75 * (seed + 1) % 65537) - 1; // Generuje liczbę pseudolosową na podstawie podanego "ziarna"
}
int main() {
double x,y,distance,pi;
double x1,y1,distance1,pi1;
int i... | 6 |
Sphesihle-Duma/sorting_algorithms | 9125315 | 0-bubble_sort.c | C | www.github.com/Sphesihle-Duma/sorting_algorithms/tree/main/0-bubble_sort.c | https://raw.githubusercontent.com/Sphesihle-Duma/sorting_algorithms/9125315/0-bubble_sort.c | Sphesihle-Duma/sorting_algorithms 9125315 0-bubble_sort.c | true | 200 | 483 | #include "sort.h"
/**
* bubble_sort - sorts array by a bubble sort algorithm
* @array: An array to be sorted
* @size: size of the array
*/
void bubble_sort(int *array, size_t size)
{
size_t i, temp, j;
if (array && size > 1)
{
for (i = 0; i < size - 1; i++)
{
for (j = 0; j < size - i - 1; j++)
{
i... | 7 |
OpdSteve/42_Proyects | 85dc68f | 42_Cursus/printf/ft_decimal.c | C | www.github.com/OpdSteve/42_Proyects/tree/main/42_Cursus/printf/ft_decimal.c | https://raw.githubusercontent.com/OpdSteve/42_Proyects/85dc68f/42_Cursus/printf/ft_decimal.c | OpdSteve/42_Proyects 85dc68f 42_Cursus/printf/ft_decimal.c | true | 200 | 1,785 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_decimal.c :+: :+: :+: ... | 2 |
nobleenia/alx-low_level_programming | c2e9cbc | 0x10-variadic_functions/1-print_numbers.c | C | www.github.com/nobleenia/alx-low_level_programming/tree/main/0x10-variadic_functions/1-print_numbers.c | https://raw.githubusercontent.com/nobleenia/alx-low_level_programming/c2e9cbc/0x10-variadic_functions/1-print_numbers.c | nobleenia/alx-low_level_programming c2e9cbc 0x10-variadic_functions/1-print_numbers.c | true | 200 | 553 | #include "variadic_functions.h"
#include <stdarg.h>
#include <stdio.h>
/**
* print_numbers - sum all the arguments in the variadic function
* @separator: string to be printed between numbers
* @n: number of integers passed to the function
*
* Return: void
*/
void print_numbers(const char *separator, const unsign... | 3 |
MikeBilbee/holbertonschool-low_level_programming | 3b8556a | 0x06-pointers_arrays_strings/2-strncpy.c | C | www.github.com/MikeBilbee/holbertonschool-low_level_programming/tree/main/0x06-pointers_arrays_strings/2-strncpy.c | https://raw.githubusercontent.com/MikeBilbee/holbertonschool-low_level_programming/3b8556a/0x06-pointers_arrays_strings/2-strncpy.c | MikeBilbee/holbertonschool-low_level_programming 3b8556a 0x06-pointers_arrays_strings/2-strncpy.c | true | 200 | 352 | #include "holberton.h"
/**
* _strncpy - Copy a string
* @dest: destination value
* @src: source value
* @n: copy limit
* Return: char value
*/
char *_strncpy(char *dest, char *src, int n)
{
int a = 0, b = 0;
while (src[b])
{
b++;
}
while (a < n && src[a])
{
dest[a] = src[a];
a++;
}
while (a < n)
{
dest[a] ... | 4 |
kpatsakis/primevul5 | 87b7605 | 22642.c | C | www.github.com/kpatsakis/primevul5/tree/main/22642.c | https://raw.githubusercontent.com/kpatsakis/primevul5/87b7605/22642.c | kpatsakis/primevul5 87b7605 22642.c | true | 200 | 433 | mbc_case_fold(OnigCaseFoldType flag,
const UChar** pp, const UChar* end ARG_UNUSED,
UChar* lower, OnigEncoding enc ARG_UNUSED)
{
const UChar* p = *pp;
if (*p == 0xdf && (flag & INTERNAL_ONIGENC_CASE_FOLD_MULTI_CHAR) != 0) {
*lower++ = 's';
*lower = 's';
(*pp)++;
return 2;
}
*lower ... | 6 |
kpatsakis/primevul8 | 48df1b0 | 155067.c | C | www.github.com/kpatsakis/primevul8/tree/main/155067.c | https://raw.githubusercontent.com/kpatsakis/primevul8/48df1b0/155067.c | kpatsakis/primevul8 48df1b0 155067.c | true | 200 | 11,474 | do_window(
int nchar,
long Prenum,
int xchar) /* extra char from ":wincmd gx" or NUL */
{
long Prenum1;
win_T *wp;
#if defined(FEAT_SEARCHPATH) || defined(FEAT_FIND_ID)
char_u *ptr;
linenr_T lnum = -1;
#endif
#ifdef FEAT_FIND_ID
int type = FIND_DEFINE;
int len;
#endif
... | 5 |
KOUSHAMBHA15IT/DSA_C | 36c1a6c | Linked_list.c | C | www.github.com/KOUSHAMBHA15IT/DSA_C/tree/main/Linked_list.c | https://raw.githubusercontent.com/KOUSHAMBHA15IT/DSA_C/36c1a6c/Linked_list.c | KOUSHAMBHA15IT/DSA_C 36c1a6c Linked_list.c | true | 200 | 2,665 | #include<stdio.h>
#include<stdlib.h>
typedef struct linklist
{
int data;// actual data
struct linklist *link;// address of next node
}node;
node *start,*temp,*ptr;
void insertFirst()
{
temp=(node*)malloc(sizeof(node));
printf("\n Enter the data : ");
scanf("%d",&temp->data);
temp->link=NULL;
if(start==NULL)
... | 2 |
Tefa95100/holbertonschool-binary_trees | 9eb1679 | 6-binary_tree_preorder.c | C | www.github.com/Tefa95100/holbertonschool-binary_trees/tree/main/6-binary_tree_preorder.c | https://raw.githubusercontent.com/Tefa95100/holbertonschool-binary_trees/9eb1679/6-binary_tree_preorder.c | Tefa95100/holbertonschool-binary_trees 9eb1679 6-binary_tree_preorder.c | true | 200 | 612 | #include "binary_trees.h"
#include <stdlib.h>
/**
* binary_tree_preorder - function to traverse using pre-order traversal
* @tree: pointer to the root node of the tree to traverse
* @func: pointer to a function to call for each node
* Return: void
*/
void binary_tree_preorder(const binary_tree_t *tree, void (*fu... | 7 |
giacomocalabria/Laboratory-of-Computer-Network | 70f2e7a | Network/HTTP-Auth.c | C | www.github.com/giacomocalabria/Laboratory-of-Computer-Network/tree/main/Network/HTTP-Auth.c | https://raw.githubusercontent.com/giacomocalabria/Laboratory-of-Computer-Network/70f2e7a/Network/HTTP-Auth.c | giacomocalabria/Laboratory-of-Computer-Network 70f2e7a Network/HTTP-Auth.c | true | 200 | 8,788 | #include <sys/types.h>
#include <sys/socket.h>
#include <stdio.h>
#include <errno.h>
#include <arpa/inet.h>
#include <string.h>
#include <unistd.h>
#include <stdlib.h>
#define ENTITY_SIZE 10000
struct headers{ // Struttura per gli header
char * n; // Nome dell'header
char * v; // Valore dell'header
};
int ma... | 3 |
kbimpis/myshell | fc56305 | modules/parseInput.c | C | www.github.com/kbimpis/myshell/tree/main/modules/parseInput.c | https://raw.githubusercontent.com/kbimpis/myshell/fc56305/modules/parseInput.c | kbimpis/myshell fc56305 modules/parseInput.c | true | 200 | 7,457 | #include "parse.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "delims.h"
#include "alias.h"
#include "history.h"
void parse_CreateAlias(job** j, char* jobString){
process* p = (process*)malloc(sizeof(*p));
p->next = NULL;
p->argv = (char**)malloc(3*sizeof(char*));
assign_proc... | 4 |
ashutro/DS-Linked-List-Algorithms | 4dbf8d3 | DLLDeleteAnyPos.c | C | www.github.com/ashutro/DS-Linked-List-Algorithms/tree/main/DLLDeleteAnyPos.c | https://raw.githubusercontent.com/ashutro/DS-Linked-List-Algorithms/4dbf8d3/DLLDeleteAnyPos.c | ashutro/DS-Linked-List-Algorithms 4dbf8d3 DLLDeleteAnyPos.c | true | 200 | 2,288 | /*
#Create the doubly linked list:
*/
#include<stdio.h>
#include<stdlib.h>
struct DLLNode{
int data;
struct DLLNode *prev;
struct DLLNode *next;
}*first = NULL;
void DLLCreate(int n)
{ int num;
struct DLLNode *head,*temp;
first = (struct DLLNode *)malloc(sizeof(struct DLLNode));
if (first ... | 5 |
Wawerukelvin111/C-patterns | 49f6e87 | num pattern 96b.c | C | www.github.com/Wawerukelvin111/C-patterns/tree/main/num pattern 96b.c | https://raw.githubusercontent.com/Wawerukelvin111/C-patterns/49f6e87/num%20pattern%2096b.c | Wawerukelvin111/C-patterns 49f6e87 num pattern 96b.c | true | 200 | 247 | #include <stdio.h>
int main(){
int i,j,k,n=5;
for(i=1;i<=n;i++){
for(j=n-1;j>=i;j--){
printf(" ");
}
for(k=1;k<=i;k++){
printf("%2d",i);
}
printf("\n");
}
return 0;
} | 2 |
aegis-aead/openssl | 1c05890 | crypto/defaults.c | C | www.github.com/aegis-aead/openssl/tree/main/crypto/defaults.c | https://raw.githubusercontent.com/aegis-aead/openssl/1c05890/crypto/defaults.c | aegis-aead/openssl 1c05890 crypto/defaults.c | true | 200 | 5,423 | /*
* Copyright 1995-2025 The OpenSSL Project Authors. All Rights Reserved.
*
* Licensed under the Apache License 2.0 (the "License"). You may not use
* this file except in compliance with the License. You can obtain a copy
* in the file LICENSE in the source distribution or at
* https://www.openssl.org/source/l... | 6 |
wenruyv/MM32F3277-5.5 | 25992cd | Project/USER/src/main.c | C | www.github.com/wenruyv/MM32F3277-5.5/tree/main/Project/USER/src/main.c | https://raw.githubusercontent.com/wenruyv/MM32F3277-5.5/25992cd/Project/USER/src/main.c | wenruyv/MM32F3277-5.5 25992cd Project/USER/src/main.c | true | 200 | 2,550 | /*********************************************************************************************************************
* COPYRIGHT NOTICE
* Copyright (c) 2019,��ɿƼ�
* All rights reserved.
* ��������QQȺ��һȺ��179029047(����) ��Ⱥ��244861897
*
* �����������ݰ�Ȩ������ɿƼ����У�δ����������������ҵ��;��
* ��ӭ��λʹ�ò�������������... | 7 |
DeviousCardi/BTP | 720b738 | deepfix_data/prob99/correct/prog34624-user190.c | C | www.github.com/DeviousCardi/BTP/tree/main/deepfix_data/prob99/correct/prog34624-user190.c | https://raw.githubusercontent.com/DeviousCardi/BTP/720b738/deepfix_data/prob99/correct/prog34624-user190.c | DeviousCardi/BTP 720b738 deepfix_data/prob99/correct/prog34624-user190.c | true | 200 | 537 | #include<stdio.h>
int fnctn(int m,int n,int l,int a[]){
int count=1;
int t,j;
t=m;
for(j=l;j<n;j++){
if(t<a[j]){
count++;
t=a[j]; } }
return count; }
int main() {
int n,l;
scanf("%d",&n);
int a[n],i;
for(i=0;i<n;i++){
scanf("%d",&a[i]); }
i... | 1 |
ChrisJmz/solong | 45cefef | srcs_bonus/utils.c | C | www.github.com/ChrisJmz/solong/tree/main/srcs_bonus/utils.c | https://raw.githubusercontent.com/ChrisJmz/solong/45cefef/srcs_bonus/utils.c | ChrisJmz/solong 45cefef srcs_bonus/utils.c | true | 200 | 2,258 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* utils.c :+: :+: :+: ... | 0 |
OPQAM/edoC | 4e83c06 | Intro101/l09_andOr.c | C | www.github.com/OPQAM/edoC/tree/main/Intro101/l09_andOr.c | https://raw.githubusercontent.com/OPQAM/edoC/4e83c06/Intro101/l09_andOr.c | OPQAM/edoC 4e83c06 Intro101/l09_andOr.c | true | 200 | 527 | #include<stdio.h>
int main(void){
int age = 0;
while(1){
scanf("%d", &age);
if ((age < 0) || (age >140)){
printf("Age is invalid.\n");
} else if ((age >= 42) && (age <= 47)){
printf("Gosh, you're the perfect age!\nCome on, be real.\n");
} else {
printf("Thank you for playing.\n");
break;
}
}
... | 5 |
AugustoCSantos/Estrutura_dados_2 | b5e4c72 | agencia_bancaria/conta.c | C | www.github.com/AugustoCSantos/Estrutura_dados_2/tree/main/agencia_bancaria/conta.c | https://raw.githubusercontent.com/AugustoCSantos/Estrutura_dados_2/b5e4c72/agencia_bancaria/conta.c | AugustoCSantos/Estrutura_dados_2 b5e4c72 agencia_bancaria/conta.c | true | 200 | 1,260 | #include "conta.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void imprimeC(Conta *cont){
printf("-----------------------------------");
printf("\nCodigo da Conta: ");
printf("%d", cont->codigo);
printf("\nCodigo da Agencia: ");
printf("%d", cont->codAgencia);
printf("\nSaldo: "... | 3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.