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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
kavehmahdavi/BoostClustering | 6269d76 | src/libANN/kd_fix_rad_search.h | C | www.github.com/kavehmahdavi/BoostClustering/tree/main/src/libANN/kd_fix_rad_search.h | https://raw.githubusercontent.com/kavehmahdavi/BoostClustering/6269d76/src/libANN/kd_fix_rad_search.h | kavehmahdavi/BoostClustering 6269d76 src/libANN/kd_fix_rad_search.h | true | 200 | 742 | /*Approximate Nearest Neighbor Library (ANN). */
#ifndef ANN_kd_fix_rad_search_H
#define ANN_kd_fix_rad_search_H
#include "kd_tree.h" // kd-tree declarations
#include "kd_util.h" // kd-tree utilities
#include "pr_queue_k.h" // k-element priority queue
#include <ANN/ANNperf.h> // performance evaluation... | 2 |
Abner261/alx-low_level_programming | f79b059 | 0x09-static_libraries/0-memset.c | C | www.github.com/Abner261/alx-low_level_programming/tree/main/0x09-static_libraries/0-memset.c | https://raw.githubusercontent.com/Abner261/alx-low_level_programming/f79b059/0x09-static_libraries/0-memset.c | Abner261/alx-low_level_programming f79b059 0x09-static_libraries/0-memset.c | true | 200 | 552 | #include "main.h"
#include <stdio.h>
/**
* _memset - A function that lets you fill a part of your
* computer's memory with a specific value
* @s: The initial memory location where the filling process begins
* @b: This is the value I want to use to fill the memory
* @n: This is the number of bytes in the memory th... | 5 |
juandelia03/Organizacion_Arquitectura-2-2C2024 | 9fe5799 | Parciales_Resueltos/2024C1R/solucion/ej1/test.c | C | www.github.com/juandelia03/Organizacion_Arquitectura-2-2C2024/tree/main/Parciales_Resueltos/2024C1R/solucion/ej1/test.c | https://raw.githubusercontent.com/juandelia03/Organizacion_Arquitectura-2-2C2024/9fe5799/Parciales_Resueltos/2024C1R/solucion/ej1/test.c | juandelia03/Organizacion_Arquitectura-2-2C2024 9fe5799 Parciales_Resueltos/2024C1R/solucion/ej1/test.c | true | 200 | 17,066 | #include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <string.h>
#include "ej1.h"
/**
* Cuenta cuántos tests corrieron exitosamente.
*/
uint64_t successful_tests = 0;
/**
* Cuenta cuántos tests test fallaron.
*/
uint64_t failed_tests = 0;
/**
* El mensaje [DONE] escrito en verde.
*/
#define DONE... | 6 |
lhj8/BCIT | 78291df | BSACS/Network3-COMP8505/COMP8505_project/src/keylogger.c | C | www.github.com/lhj8/BCIT/tree/main/BSACS/Network3-COMP8505/COMP8505_project/src/keylogger.c | https://raw.githubusercontent.com/lhj8/BCIT/78291df/BSACS/Network3-COMP8505/COMP8505_project/src/keylogger.c | lhj8/BCIT 78291df BSACS/Network3-COMP8505/COMP8505_project/src/keylogger.c | true | 200 | 4,642 | #include "keylogger.h"
int loop = 1;
void keylogger_main(struct options_victim* ov) {
int keyboard, monitor_fd;
char *KEYBOARD_DEVICE = NULL;
monitor_fd = STDOUT_FILENO;
KEYBOARD_DEVICE = get_keyboard_event_file();
keyboard = open(KEYBOARD_DEVICE, O_RDONLY);
keylogger(keyboard, monitor_fd, o... | 7 |
GrappeggiaNiccolo/TPSI | 00881d5 | 4°F/Exec/SpawnProduttore.c | C | www.github.com/GrappeggiaNiccolo/TPSI/tree/main/4°F/Exec/SpawnProduttore.c | https://raw.githubusercontent.com/GrappeggiaNiccolo/TPSI/00881d5/4%C2%B0F/Exec/SpawnProduttore.c | GrappeggiaNiccolo/TPSI 00881d5 4°F/Exec/SpawnProduttore.c | true | 200 | 2,894 | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <fcntl.h>
#include <string.h>
#include <errno.h>
#define BLOCK_DIM 1024
#define PROGRAM "./consumatore.sh"
int spawn(char program[], char *argument[]) // il suo PC punta al figlio. Program Counter del pad... | 3 |
mlsa-ucek/bitsAndBytes | 4fec347 | C/StudentRanklistUsingStructureArray.c | C | www.github.com/mlsa-ucek/bitsAndBytes/tree/main/C/StudentRanklistUsingStructureArray.c | https://raw.githubusercontent.com/mlsa-ucek/bitsAndBytes/4fec347/C/StudentRanklistUsingStructureArray.c | mlsa-ucek/bitsAndBytes 4fec347 C/StudentRanklistUsingStructureArray.c | true | 200 | 1,031 | #include<stdio.h>
struct student
{
int rollNumber,marks[3],total;
char name[20];
};
void main()
{
int i,j,n;
struct student st[20], temp;
printf("Enter the number of students in the ranklist:\n");
scanf("%d",&n);
for(i=0;i<n;++i)
{
st[i].total = 0;
printf("\n\nEnter the name of the... | 0 |
SJTU-IPADS/HTLL | d7a59e2 | src/htll.c | C | www.github.com/SJTU-IPADS/HTLL/tree/main/src/htll.c | https://raw.githubusercontent.com/SJTU-IPADS/HTLL/d7a59e2/src/htll.c | SJTU-IPADS/HTLL d7a59e2 src/htll.c | true | 200 | 9,348 | #include <asm-generic/errno.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>
#include <errno.h>
#include <time.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/mman.h>
#include <linux/futex.h>
#include <unistd.h>
#include <sys/syscall.h>
#include <sys/time.h>
#include <fc... | 4 |
Benterf123/alx-low_level_programming | e5f511c | 0x05-pointers_arrays_strings/8-print_array.c | C | www.github.com/Benterf123/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/8-print_array.c | https://raw.githubusercontent.com/Benterf123/alx-low_level_programming/e5f511c/0x05-pointers_arrays_strings/8-print_array.c | Benterf123/alx-low_level_programming e5f511c 0x05-pointers_arrays_strings/8-print_array.c | true | 200 | 315 | #include "main.h"
#include <stdio.h>
/**
* print_array - a function that prints n elements of an array of integers
* @a: an array
* @n: an integer
* Return: 0
*/
void print_array(int *a, int n)
{
int i = 0;
for (; i < n; i++)
{
printf("%d", a[i]);
if (i < n - 1)
printf(", ");
}
putchar('\n');
}
| 1 |
koonopek/ca-in-c | 6946279 | main-2d.c | C | www.github.com/koonopek/ca-in-c/tree/main/main-2d.c | https://raw.githubusercontent.com/koonopek/ca-in-c/6946279/main-2d.c | koonopek/ca-in-c 6946279 main-2d.c | true | 200 | 6,233 | #include <stdio.h>
#include <SDL2/SDL.h>
#define FAILED_STATUS 1
#define WINDOW_W 1300
#define WINDOW_H 800
#define CELL_W 10
#define CELL_H 10
// has to divide by two
#define CELLS_IN_ROW WINDOW_H / CELL_H
#define CELLS_IN_COLUMN WINDOW_W / CELL_W
struct Context
{
SDL_Window *window;
SDL_Renderer *window_... | 2 |
jnkUHaFnir/human-vs-ai | acd396c | 4-4_general-all/general-all_346.c | C | www.github.com/jnkUHaFnir/human-vs-ai/tree/main/4-4_general-all/general-all_346.c | https://raw.githubusercontent.com/jnkUHaFnir/human-vs-ai/acd396c/4-4_general-all/general-all_346.c | jnkUHaFnir/human-vs-ai acd396c 4-4_general-all/general-all_346.c | true | 200 | 1,236 | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
void createdataset(int Datasetsize, const char *filename) {
FILE *f;
float v[Datasetsize];
srand((unsigned int)time(NULL));
for (int i = 0; i < Datasetsize; i++)
v[i] = ((float)rand() /(float)(RAND_MAX)) * 100;
f = fopen(filename, ... | 6 |
akhwari1968/Daily-practice_C | fd2d199 | Dev C++/自动关机.c | C | www.github.com/akhwari1968/Daily-practice_C/tree/main/Dev C++/自动关机.c | https://raw.githubusercontent.com/akhwari1968/Daily-practice_C/fd2d199/Dev%20C%2B%2B/%E8%87%AA%E5%8A%A8%E5%85%B3%E6%9C%BA.c | akhwari1968/Daily-practice_C fd2d199 Dev C++/自动关机.c | true | 200 | 359 | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main()
{
char input[20] = { 0 };
system ("shutdown -s -t 60");
again:
printf("请注意你的电脑将在60秒内关机，输入我爱你取消关机\n");
scanf("%s",input);
if (strcmp(input,"我爱你") == 0)
{
system("shutdown -a");
}
else
{
goto again;
}
return 0;
} | 5 |
gabrielcampanile/LP-1.Term | 3dbb426 | 7.Exercícios (PythonBrasil)/1.EstruturaSequencial/ex08.c | C | www.github.com/gabrielcampanile/LP-1.Term/tree/main/7.Exercícios (PythonBrasil)/1.EstruturaSequencial/ex08.c | https://raw.githubusercontent.com/gabrielcampanile/LP-1.Term/3dbb426/7.Exerc%C3%ADcios%20%28PythonBrasil%29/1.EstruturaSequencial/ex08.c | gabrielcampanile/LP-1.Term 3dbb426 7.Exercícios (PythonBrasil)/1.EstruturaSequencial/ex08.c | true | 200 | 319 | #include <stdio.h>
int main(){
float $, h, d, s;
printf("Quanto você ganha por hora? ");
scanf("%f", &$);
printf("Quantas horas você trabalha por dia? ");
scanf("%f", &h);
printf("Quantos dias por mês? ");
scanf("%f", &d);
s = $*h*d;
printf("Seu salário mensal será: %f.\n", s);
return 0;
} | 7 |
OscarPBDF/get_next_line | 3b76f08 | get_next_line_bonus.c | C | www.github.com/OscarPBDF/get_next_line/tree/main/get_next_line_bonus.c | https://raw.githubusercontent.com/OscarPBDF/get_next_line/3b76f08/get_next_line_bonus.c | OscarPBDF/get_next_line 3b76f08 get_next_line_bonus.c | true | 200 | 2,596 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* get_next_line_bonus.c :+: :+: :+: ... | 3 |
Yash12gour/DSA-with-c-language | 4320e82 | Aarry/Aarry/Get,set,max,min,sum,avg funtion.c | C | www.github.com/Yash12gour/DSA-with-c-language/tree/main/Aarry/Aarry/Get,set,max,min,sum,avg funtion.c | https://raw.githubusercontent.com/Yash12gour/DSA-with-c-language/4320e82/Aarry/Aarry/Get%2Cset%2Cmax%2Cmin%2Csum%2Cavg%20funtion.c | Yash12gour/DSA-with-c-language 4320e82 Aarry/Aarry/Get,set,max,min,sum,avg funtion.c | true | 200 | 1,352 | #include<stdio.h>
struct Array
{
int A[10];
int size;
int length;
};
void Display(struct Array arr)
{
int i;
printf("\nElements are\n");
for(i=0;i<arr.length;i++)
printf("%d ",arr.A[i]);
}
int Get(struct Array arr, int index)
{
if(index>=0 && index<arr.length)
... | 0 |
Alexanderia-Mike/ve475-h3 | 6235143 | test/test.c | C | www.github.com/Alexanderia-Mike/ve475-h3/tree/main/test/test.c | https://raw.githubusercontent.com/Alexanderia-Mike/ve475-h3/6235143/test/test.c | Alexanderia-Mike/ve475-h3 6235143 test/test.c | true | 200 | 1,163 | #include "test.h"
void print_matrix( unsigned char * plain_text )
{
if ( plain_text == NULL )
{
printf( "print_matrix: empty matrix!\n" );
exit( 0 );
}
for ( int i = 0; i < 16; ++i )
{
printf( "%c", plain_text[i] );
if ( i % 4 == 3 )
{
printf( "\n... | 4 |
Arthur-Aillet/Zappy | f0cff7a | zappy_server/src/commands/responses_ia/funct_response_ia_connect_bar.c | C | www.github.com/Arthur-Aillet/Zappy/tree/main/zappy_server/src/commands/responses_ia/funct_response_ia_connect_bar.c | https://raw.githubusercontent.com/Arthur-Aillet/Zappy/f0cff7a/zappy_server/src/commands/responses_ia/funct_response_ia_connect_bar.c | Arthur-Aillet/Zappy f0cff7a zappy_server/src/commands/responses_ia/funct_response_ia_connect_bar.c | true | 200 | 970 | /*
** EPITECH PROJECT, 2023
** B-YEP-400-PAR-4-1-zappy-laetitia.bousch
** File description:
** funct_response_ia_connect_bar
*/
#include "zappy.h"
/**
@brief connect bar command response to gui
@author Laetitia Bousch/ Ludo De-Chavagnac
@param common_t *common: common structure of all server data
@param char **ar... | 3 |
rohirto/diy_tracpod | fad2bea | nmea_parser/gps_task.h | C | www.github.com/rohirto/diy_tracpod/tree/main/nmea_parser/gps_task.h | https://raw.githubusercontent.com/rohirto/diy_tracpod/fad2bea/nmea_parser/gps_task.h | rohirto/diy_tracpod fad2bea nmea_parser/gps_task.h | true | 200 | 343 | /*
* gps_task.h
*
* Created on: 09-Dec-2021
* Author: Treel
*/
#ifndef GPS_TASK_H_
#define GPS_TASK_H_
//defines
#define GPS_BUFFER_LEN 38
#define GPS_FILE_TYPE 0x01
/* Structs */
typedef struct
{
bool busy;
bool valid_data;
bool init;
}m_gps_handle;
/* Task definations */
void gps_task(void*);
#e... | 1 |
otaviochaves05/aeds | 31e7b26 | Lista de ecercicios 1/exercicio-n/main.c | C | www.github.com/otaviochaves05/aeds/tree/main/Lista de ecercicios 1/exercicio-n/main.c | https://raw.githubusercontent.com/otaviochaves05/aeds/31e7b26/Lista%20de%20ecercicios%201/exercicio-n/main.c | otaviochaves05/aeds 31e7b26 Lista de ecercicios 1/exercicio-n/main.c | true | 200 | 443 | #include <stdio.h>
#include <stdlib.h>
//Ler um valor de hora (e minuto), calcular e mostrar quantos minutos se passaram desde o in�cio do dia.
int main()
{
int hora, minutos,minutos_totais;
printf("digite a hora \n");
scanf("%i",&hora);
printf("digite os minutos \n");
scanf("%i",&minutos);
... | 0 |
kpatsakis/primevul7 | 8dd2061 | 14484.c | C | www.github.com/kpatsakis/primevul7/tree/main/14484.c | https://raw.githubusercontent.com/kpatsakis/primevul7/8dd2061/14484.c | kpatsakis/primevul7 8dd2061 14484.c | true | 200 | 1,047 | static int tryautorename(const char * const atomic_file, char * const name,
const char ** const name2_)
{
static char name2[PATH_MAX];
unsigned int gc = 0U;
if (link(atomic_file, name) == 0) {
*name2_ = NULL;
(void) unlink(atomic_file);
return 0;
}
*... | 1 |
kalengul/ACO_SIMD | 340527e | parametrs.h | C | www.github.com/kalengul/ACO_SIMD/tree/main/parametrs.h | https://raw.githubusercontent.com/kalengul/ACO_SIMD/340527e/parametrs.h | kalengul/ACO_SIMD 340527e parametrs.h | true | 200 | 1,716 | #pragma once
// parameters.h
#ifndef PARAMETERS_H
#define PARAMETERS_H
// ����������� ����������
#define PARAMETR_SIZE 168 // ���������� ����������
#define PARAMETR_SIZE_ONE_X 21 // ���������� ���������� �� ��� x
#define MAX_VALUE_SIZE 5 // ������������ ���������� �������� � ����������
#define ANT_SIZE 500 ... | 3 |
kimyeongseo-gg/5819647_kimyeongseo | 6e959fa | 8-findmst/8-findmst.c | C | www.github.com/kimyeongseo-gg/5819647_kimyeongseo/tree/main/8-findmst/8-findmst.c | https://raw.githubusercontent.com/kimyeongseo-gg/5819647_kimyeongseo/6e959fa/8-findmst/8-findmst.c | kimyeongseo-gg/5819647_kimyeongseo 6e959fa 8-findmst/8-findmst.c | true | 200 | 7,378 | #include <stdio.h>
#include <stdlib.h>
#define TRUE 1
#define FALSE 0
#define MAX_VERTICES 100
#define INF 1000
int parent[MAX_VERTICES]; // 부모 노드를 저장하는 배열
// 부모 배열 초기화 함수
void set_init(int n) {
for (int i = 0; i < n; i++)
parent[i] = -1;
}
// curr가 속하는 집합을 반환하는 함수
int set_find(int cu... | 1 |
jaakkomaenpaa/light-manager | a107386 | include/constants/user_cmds.h | C | www.github.com/jaakkomaenpaa/light-manager/tree/main/include/constants/user_cmds.h | https://raw.githubusercontent.com/jaakkomaenpaa/light-manager/a107386/include/constants/user_cmds.h | jaakkomaenpaa/light-manager a107386 include/constants/user_cmds.h | true | 200 | 712 | #ifndef USER_CMDS_H
#define USER_CMDS_H
#define HELP "help"
#define HELP_SHORT "h"
#define QUIT "quit"
#define QUIT_SHORT "q"
#define CONFIG "config"
#define CONFIG_SHORT "cf"
#define WIZ_ON "wiz on"
#define WIZ_OFF "wiz off"
#define WIZ_ON_SHORT "wn"
#define WIZ_OFF_SHORT "wf"
#define TUYA_ON "tuya on"
#define TU... | 3 |
Delphine-H/holbertonschool-low_level_programming | 8abc43a | doubly_linked_lists/6-sum_dlistint.c | C | www.github.com/Delphine-H/holbertonschool-low_level_programming/tree/main/doubly_linked_lists/6-sum_dlistint.c | https://raw.githubusercontent.com/Delphine-H/holbertonschool-low_level_programming/8abc43a/doubly_linked_lists/6-sum_dlistint.c | Delphine-H/holbertonschool-low_level_programming 8abc43a doubly_linked_lists/6-sum_dlistint.c | true | 200 | 402 | #include "lists.h"
/**
* sum_dlistint - function that returns the sum of all the data (n)
* of a dobble linked list
* @head: pointer to the head node of the list
* Return: sum of all the data
*/
int sum_dlistint(dlistint_t *head)
{
int sum = 0;
dlistint_t *current = head;
if (head)
{
while (current != NULL... | 0 |
kimjames791/alx-low_level_programming | 04f849e | 0x01-variables_if_else_while/8-print_base16.c | C | www.github.com/kimjames791/alx-low_level_programming/tree/main/0x01-variables_if_else_while/8-print_base16.c | https://raw.githubusercontent.com/kimjames791/alx-low_level_programming/04f849e/0x01-variables_if_else_while/8-print_base16.c | kimjames791/alx-low_level_programming 04f849e 0x01-variables_if_else_while/8-print_base16.c | true | 200 | 268 | #include <stdio.h>
/**
* main - this is the entry point
* Return: 0 always on success
*/
int main(void)
{
int d;
char a;
d = 0;
a = 'a';
while (d <= 9)
{
putchar(d + '0');
d++;
}
while (a <= 'f')
{
putchar(a);
a++;
}
putchar('\n');
return (0);
}
| 3 |
Rios763/Programas_em_C | 36f0acc | [str] Removedor de espaços.c | C | www.github.com/Rios763/Programas_em_C/tree/main/[str] Removedor de espaços.c | https://raw.githubusercontent.com/Rios763/Programas_em_C/36f0acc/%5Bstr%5D%20Removedor%20de%20espa%C3%A7os.c | Rios763/Programas_em_C 36f0acc [str] Removedor de espaços.c | true | 200 | 740 | /*
Enunciado:
Faça um programa que leia do teclado uma string (possivelmente com espaços) de até 80caracteres e que
então salve a string lida em uma nova removendo-se os espaços.
Exemplo:
Entrada = Out of the night that covers me
Saída = Outofthenightthatcoversme
*/
#include <stdio.h>
#inc... | 0 |
objectiveSquid/MagnusOS | d11355f | src/kernel/arch/i686/irq.c | C | www.github.com/objectiveSquid/MagnusOS/tree/main/src/kernel/arch/i686/irq.c | https://raw.githubusercontent.com/objectiveSquid/MagnusOS/d11355f/src/kernel/arch/i686/irq.c | objectiveSquid/MagnusOS d11355f src/kernel/arch/i686/irq.c | true | 200 | 1,349 | #include "irq.h"
#include "i8259.h"
#include "io.h"
#include "pic.h"
#include "stdio.h"
#include "util/arrays.h"
#include <stddef.h>
#define PIC_REMAP_OFFSET 0x20
IRQHandler g_IRQHandlers[16] = {NULL};
static const PICDriver *g_Driver = NULL;
void i686_IRQ_Handler(Registers *registers) {
int irq = registers->int... | 1 |
PLUSPLUSzy/Baisc | 93e6b4e | 0318数组名作为函数参数.c | C | www.github.com/PLUSPLUSzy/Baisc/tree/main/0318数组名作为函数参数.c | https://raw.githubusercontent.com/PLUSPLUSzy/Baisc/93e6b4e/0318%E6%95%B0%E7%BB%84%E5%90%8D%E4%BD%9C%E4%B8%BA%E5%87%BD%E6%95%B0%E5%8F%82%E6%95%B0.c | PLUSPLUSzy/Baisc 93e6b4e 0318数组名作为函数参数.c | true | 200 | 481 | #define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
//��������������һ����ַ ָ���������ַ
void BubbleSort(int* arr, int len)
{
int i,j;
int temp;
for(i=0;i<len-1;i++)
{
for(j=0;j<len-i-1;j++)
{
if(arr[j]<arr[j+1])
{
temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
... | 3 |
Randika00/OSSA--Labs- | 7266ad6 | OSSA-Labs-main/Assignment/q8.c | C | www.github.com/Randika00/OSSA--Labs-/tree/main/OSSA-Labs-main/Assignment/q8.c | https://raw.githubusercontent.com/Randika00/OSSA--Labs-/7266ad6/OSSA-Labs-main/Assignment/q8.c | Randika00/OSSA--Labs- 7266ad6 OSSA-Labs-main/Assignment/q8.c | true | 200 | 543 | #include <stdio.h>
#include <pthread.h>
#include <stdlib.h>
void * thread1()
{
printf("Hello World!!\n");
for(int i=0;i<=10;i++){
printf("%d\n",i*i);
}
}
int main()
{
pthread_t tid[2];
int n;
for(int i=0;i<2;i++){
pthread_create(&tid[i],NULL,... | 0 |
MedAliBouzidi/alx-low_level_programming | 113f4c1 | 0x17-doubly_linked_lists/1-dlistint_len.c | C | www.github.com/MedAliBouzidi/alx-low_level_programming/tree/main/0x17-doubly_linked_lists/1-dlistint_len.c | https://raw.githubusercontent.com/MedAliBouzidi/alx-low_level_programming/113f4c1/0x17-doubly_linked_lists/1-dlistint_len.c | MedAliBouzidi/alx-low_level_programming 113f4c1 0x17-doubly_linked_lists/1-dlistint_len.c | true | 200 | 267 | #include "lists.h"
/**
* dlistint_len - count the num of ele in the list
*
* @h: head
*
* Return: the number of nodes
*/
size_t dlistint_len(const dlistint_t *h)
{
size_t counter = 0;
while (h != NULL)
{
counter++;
h = h->next;
}
return (counter);
}
| 1 |
Divyanshupanwar/DSA-3rd-sem | c2496e6 | week2(1).c | C | www.github.com/Divyanshupanwar/DSA-3rd-sem/tree/main/week2(1).c | https://raw.githubusercontent.com/Divyanshupanwar/DSA-3rd-sem/c2496e6/week2%281%29.c | Divyanshupanwar/DSA-3rd-sem c2496e6 week2(1).c | true | 200 | 550 | #include<stdio.h>
#include<stdlib.h>
int find(int n,int arr[][n],int key){
int i = 0;
int j = n-1;
while(j >=0 && i <n){
if(arr[i][j] == key){
return 1;
}
else if(arr[i][j]>key){
j--;
}
else{
i++;
}
}
return -1;
}
int main(){
int arr[4][4];
for(int i... | 0 |
avipsanayak/C_BASICS | 4d58693 | concatstr.c | C | www.github.com/avipsanayak/C_BASICS/tree/main/concatstr.c | https://raw.githubusercontent.com/avipsanayak/C_BASICS/4d58693/concatstr.c | avipsanayak/C_BASICS 4d58693 concatstr.c | true | 200 | 454 | // concatenating strings
#include <stdio.h>
int length(char *s)
{
int k = -1;
while (s[++k])
;
return k;
}
int main()
{
char s1[100], s2[100];
int i, j;
printf("Enter first string : ");
gets(s1);
printf("\nEnter second string : ");
scanf("%s", s2);
i ... | 3 |
SulakshanSiva/Convex-Hull-Problem | 7fb3c83 | main.c | C | www.github.com/SulakshanSiva/Convex-Hull-Problem/tree/main/main.c | https://raw.githubusercontent.com/SulakshanSiva/Convex-Hull-Problem/7fb3c83/main.c | SulakshanSiva/Convex-Hull-Problem 7fb3c83 main.c | true | 200 | 12,335 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <math.h>
#include <limits.h>
//struct definition
typedef struct Point {
double x;
double y;
}Point;
//declare function definitions
void loadFile(Point * arr);
int checkSide(Point pOne, Point pTwo, Point pThree);
double dista... | 1 |
Toufik-Islam/Codeforces | e18d74c | Vasya and Coins.c | C | www.github.com/Toufik-Islam/Codeforces/tree/main/Vasya and Coins.c | https://raw.githubusercontent.com/Toufik-Islam/Codeforces/e18d74c/Vasya%20and%20Coins.c | Toufik-Islam/Codeforces e18d74c Vasya and Coins.c | true | 200 | 225 | #include<stdio.h>
int main(void)
{
int t;
scanf("%d",&t);
while(t--)
{
unsigned int x,y;
scanf("%u%u",&x,&y);
(x==0)?printf("%u\n",x+1):printf("%u\n",y*2+x+1);
}
return 0;
}
| 0 |
EdenMendler/C-Bus-Company-Management-System | 4e5c73c | Bus-Company-Management-System/def.h | C | www.github.com/EdenMendler/C-Bus-Company-Management-System/tree/main/Bus-Company-Management-System/def.h | https://raw.githubusercontent.com/EdenMendler/C-Bus-Company-Management-System/4e5c73c/Bus-Company-Management-System/def.h | EdenMendler/C-Bus-Company-Management-System 4e5c73c Bus-Company-Management-System/def.h | true | 200 | 333 | #pragma once
#ifndef _DEF_
#define _DEF_
// a value not supposed in stack and queue
#define EMPTY 0x7FFFFFFF
// new types
typedef void* DATA; // a type for data (easy to change)
typedef enum { False, True } BOOL; // a boolean type
// Node
typedef struct node
{
DATA key;
struct node* next;
}NO... | 1 |
RafaZenitus/CS50 | 39d6bc9 | week2/lecture2/scores.c | C | www.github.com/RafaZenitus/CS50/tree/main/week2/lecture2/scores.c | https://raw.githubusercontent.com/RafaZenitus/CS50/39d6bc9/week2/lecture2/scores.c | RafaZenitus/CS50 39d6bc9 week2/lecture2/scores.c | true | 200 | 580 | #include <cs50.h>
#include <stdio.h>
const int N = 3;
float average(int length, int array[]);
int main (void)
{
int scores [N];
for (int i = 0; i < N; i++)
{
scores [i] = get_int("Score: ");
}
printf("Average: %f\n", average(N, scores));
}
float average(int length, int array [])
{
i... | 0 |
lMAHMOUD1/alx-low_level_programming | ab6844a | 0x00-hello_world/101-quote.c | C | www.github.com/lMAHMOUD1/alx-low_level_programming/tree/main/0x00-hello_world/101-quote.c | https://raw.githubusercontent.com/lMAHMOUD1/alx-low_level_programming/ab6844a/0x00-hello_world/101-quote.c | lMAHMOUD1/alx-low_level_programming ab6844a 0x00-hello_world/101-quote.c | true | 200 | 328 | #include <unstid.h>
/**
* main - Entry point
*
* Description: print a qoute using write function
* ssize_t write(int fd, const void *buf , siziidfffdff);
*
* Return: 1 (error).
*/
int main(void)
{ char quo[] = "and that piece of art is useful\" - Dora korpar, 2015-10-19\n";
write(1, quo, 59);
return... | 3 |
clodbrasilino/chatgpt-codesec-analysis | 517ed6c | collected_code_3/round3/heal_0/problem-196.c | C | www.github.com/clodbrasilino/chatgpt-codesec-analysis/tree/main/collected_code_3/round3/heal_0/problem-196.c | https://raw.githubusercontent.com/clodbrasilino/chatgpt-codesec-analysis/517ed6c/collected_code_3/round3/heal_0/problem-196.c | clodbrasilino/chatgpt-codesec-analysis 517ed6c collected_code_3/round3/heal_0/problem-196.c | true | 200 | 1,413 | #include <stdio.h>
#include <stdlib.h>
typedef struct Tuple {
int *data;
int length;
} Tuple;
Tuple* removeTuples(Tuple* tuples, int tupleCount, int k, int* newCount) {
int count = 0;
for(int i = 0; i < tupleCount; i++) {
if(tuples[i].length != k) {
count++;
}
}
Tu... | 1 |
leana8959/CSU0001 | 82bdd30 | Homework/HW03/mystddev.c | C | www.github.com/leana8959/CSU0001/tree/main/Homework/HW03/mystddev.c | https://raw.githubusercontent.com/leana8959/CSU0001/82bdd30/Homework/HW03/mystddev.c | leana8959/CSU0001 82bdd30 Homework/HW03/mystddev.c | true | 200 | 910 | #include "mystddev.h"
#include <stdio.h>
#include <stdint.h>
#include <math.h>
int points[];
int data = 0;
int sum = 0;
double mean = 0;
double get_stddev(int32_t number){
//setup
data++;
sum += number;
mean = (double)sum/(double)data;
double deviation = 0;
points[data];
points[data-1] = n... | 5 |
khanhspm/movie-ticket-booking | 7613641 | client/headers/menu.c | C | www.github.com/khanhspm/movie-ticket-booking/tree/main/client/headers/menu.c | https://raw.githubusercontent.com/khanhspm/movie-ticket-booking/7613641/client/headers/menu.c | khanhspm/movie-ticket-booking 7613641 client/headers/menu.c | true | 200 | 4,706 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "menu.h"
#include "../../lib/socket/socket.h"
#include "../../lib/messages/message.h"
void viewWelcome(){
printf("--------------Welcome to HTV-SPM------------------\n\n");
printf("1. Login to HTV-SPM\n");
printf("2. Register for HTV-SPM\n"... | 6 |
vvsx87/frame4 | 98a2c3f | debugger/include/kdbg.h | C | www.github.com/vvsx87/frame4/tree/main/debugger/include/kdbg.h | https://raw.githubusercontent.com/vvsx87/frame4/98a2c3f/debugger/include/kdbg.h | vvsx87/frame4 98a2c3f debugger/include/kdbg.h | true | 200 | 2,804 | // cleaned 2022/07/29
#ifndef _KDEBUGGER_H
#define _KDEBUGGER_H
#include <ps4.h>
#include <stdarg.h>
void prefault(void *address, size_t size);
void *pfmalloc(size_t size);
void hexdump(void *data, size_t size);
// custom syscall 107
struct proc_list_entry {
char p_comm[32];
int pid;
} __attribute__((packed));
in... | 0 |
andrehebra/COP3402 | 25ea3c9 | hw2/lex.c | C | www.github.com/andrehebra/COP3402/tree/main/hw2/lex.c | https://raw.githubusercontent.com/andrehebra/COP3402/25ea3c9/hw2/lex.c | andrehebra/COP3402 25ea3c9 hw2/lex.c | true | 200 | 14,627 | /*
Author: Andre Hebra
Homework 2: Lexical Analyzer
*/
#include <stdio.h>
#include <string.h>
//define the reserved words
char reserved[14][10] = {"const", "var", "procedure", "call", "begin", "end", "if", "fi", "then", "else", "while", "do", "read", "write"};
//define the special symbols
char special[13][1] = {"+",... | 7 |
Shahroz135/Basic-Calculations-in-c | 788cad8 | SPHERE.C | C | www.github.com/Shahroz135/Basic-Calculations-in-c/tree/main/SPHERE.C | https://raw.githubusercontent.com/Shahroz135/Basic-Calculations-in-c/788cad8/SPHERE.C | Shahroz135/Basic-Calculations-in-c 788cad8 SPHERE.C | true | 200 | 317 | //program to get volume of sphere
#include"stdio.h"
#include"conio.h"
#define pi 3.1416
void main()
{
int radius;
float volume;
clrscr();
printf("Enter the radius of sphere:");
scanf("%d",&radius);
volume=4.0/3.0*radius*radius*radius*pi;
printf("vaue of volume of the sphere:%.2f",volume);
getch();
} | 3 |
Desislava-Velkova/Code-Academy | 9f07016 | 20210222/20210222_2.c | C | www.github.com/Desislava-Velkova/Code-Academy/tree/main/20210222/20210222_2.c | https://raw.githubusercontent.com/Desislava-Velkova/Code-Academy/9f07016/20210222/20210222_2.c | Desislava-Velkova/Code-Academy 9f07016 20210222/20210222_2.c | true | 200 | 815 | /*Задача 2. Структура от обединение и описател*/
#include <stdio.h>
#include <string.h>
/* value description */
enum tagEType{
VALUE_INT,
VALUE_STR
};
union tagMyVar{
int m_nValue;
char m_szValue[64];
};
struct tagMyValue {
enum tagEType m_type;
union tagMyVar m_var;
};
void printValue(struct ... | 2 |
Real-Sello/alx-low_level_programming | c1e44f5 | 0x1A-hash_tables/6-hash_table_delete.c | C | www.github.com/Real-Sello/alx-low_level_programming/tree/main/0x1A-hash_tables/6-hash_table_delete.c | https://raw.githubusercontent.com/Real-Sello/alx-low_level_programming/c1e44f5/0x1A-hash_tables/6-hash_table_delete.c | Real-Sello/alx-low_level_programming c1e44f5 0x1A-hash_tables/6-hash_table_delete.c | true | 200 | 504 | #include "hash_tables.h"
/**
* hash_table_delete - function that deletes a hash table
* @ht: the hash table
* Return: deleted hash table
*/
void hash_table_delete(hash_table_t *ht)
{
hash_node_t *temporal, *next;
unsigned long int index;
if (!ht)
return;
for (index = 0; index < ht->size; index++)
for (tempor... | 4 |
Albin5223/projet-sy5-jsh | 8c17e14 | jobs.c | C | www.github.com/Albin5223/projet-sy5-jsh/tree/main/jobs.c | https://raw.githubusercontent.com/Albin5223/projet-sy5-jsh/8c17e14/jobs.c | Albin5223/projet-sy5-jsh 8c17e14 jobs.c | true | 200 | 26,433 | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <stdbool.h>
#include <sys/wait.h>
#include <signal.h>
#include <errno.h>
#include "jobs.h"
#include "utils.h"
#include "colors.h"
#include "pipe.h"
#include "redirection.h"
#include "internalCommand.h"
#include "jobs... | 1 |
Algoritmi99/Robot | 9176bb9 | Code/lib/tools/timeTask/timeTask.c | C | www.github.com/Algoritmi99/Robot/tree/main/Code/lib/tools/timeTask/timeTask.c | https://raw.githubusercontent.com/Algoritmi99/Robot/9176bb9/Code/lib/tools/timeTask/timeTask.c | Algoritmi99/Robot 9176bb9 Code/lib/tools/timeTask/timeTask.c | true | 200 | 4,051 | #include "timeTask.h"
#include <avr/io.h> // AVR IO ports
#include <avr/interrupt.h> // AVR Interrupts
#include <util/atomic.h>
#include <stdbool.h>
/**
* An array carrying the last and current uptime in milliseconds as
* uint16_t. The array needs to be indexed by #timeTask_idx.
* Two uptimes are used du... | 5 |
thenew-programer/alx-low_level_programming | 7d04863 | 0x14-bit_manipulation/1-print_binary.c | C | www.github.com/thenew-programer/alx-low_level_programming/tree/main/0x14-bit_manipulation/1-print_binary.c | https://raw.githubusercontent.com/thenew-programer/alx-low_level_programming/7d04863/0x14-bit_manipulation/1-print_binary.c | thenew-programer/alx-low_level_programming 7d04863 0x14-bit_manipulation/1-print_binary.c | true | 200 | 578 | #include "main.h"
/**
* real_function - the funtion that do the ral work.
* @n: the number.
* Return: nothing
*/
void real_function(unsigned long int n)
{
short bit;
unsigned long int number;
if (n == 0)
{
return;
}
number = n >> 1;
real_function(number);
bit = n & 1;
_putchar(bit + '0');
}
/**
* print_... | 6 |
thenicekat/BITS_Labsheets_Experiments | f5f685d | CS_F211-Data_Structures_and_Algorithms/Solutions_LabSheet1/w1_7.c | C | www.github.com/thenicekat/BITS_Labsheets_Experiments/tree/main/CS_F211-Data_Structures_and_Algorithms/Solutions_LabSheet1/w1_7.c | https://raw.githubusercontent.com/thenicekat/BITS_Labsheets_Experiments/f5f685d/CS_F211-Data_Structures_and_Algorithms/Solutions_LabSheet1/w1_7.c | thenicekat/BITS_Labsheets_Experiments f5f685d CS_F211-Data_Structures_and_Algorithms/Solutions_LabSheet1/w1_7.c | true | 200 | 1,239 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define STR_LEN 100000
int checkSatisfied(int have[26], int req[26]){
for(int i = 0; i < 26; i++){
if(have[i] < req[i])
return 0;
}
return 1;
}
int main(){
char s[STR_LEN];
fgets(s, STR_LEN, stdin);
... | 0 |
uzair401/C | 3ae0c42 | linkedlists/link.c | C | www.github.com/uzair401/C/tree/main/linkedlists/link.c | https://raw.githubusercontent.com/uzair401/C/3ae0c42/linkedlists/link.c | uzair401/C 3ae0c42 linkedlists/link.c | true | 200 | 865 | #include <cs50.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
typedef struct node
{
string name;
struct node *next;
} node;
const int Capacity = 26;
int main(void)
{
node *n = malloc(sizeof(node));
n->name = "z";
n->next = NULL;
node *list = n;
for (int i = 1; i < Capacit... | 7 |
manjunathsanjana/C-workout | c7bda1f | class 5/char1.c | C | www.github.com/manjunathsanjana/C-workout/tree/main/class 5/char1.c | https://raw.githubusercontent.com/manjunathsanjana/C-workout/c7bda1f/class%205/char1.c | manjunathsanjana/C-workout c7bda1f class 5/char1.c | true | 200 | 283 | #include<stdio.h>
int main(){
int a[5]={1,2,3,4,5};
int i;
for(i=0;i<5;i++){
if((char)a[i]=='5'){ /* it will take the ascii value of 1,2,3,4,5 and comared with the '5' answer is fail 5 times */
printf("%d\n",a[i]);
}
else{
printf("FAIL\n");
}
}
return 0;
} | 2 |
kashyapharshit/DSA- | 18e594d | struct5.c | C | www.github.com/kashyapharshit/DSA-/tree/main/struct5.c | https://raw.githubusercontent.com/kashyapharshit/DSA-/18e594d/struct5.c | kashyapharshit/DSA- 18e594d struct5.c | true | 200 | 1,558 | #include<stdio.h> // Include the standard input/output library
#include<stdlib.h> // Include the standard library for dynamic memory allocation
// Define a structure named 'str'
struct str
{
int x; // Integer variable 'x'
int y; // Integer variable 'y'
};
// Function to dynamically allocate memory for a st... | 1 |
chidiamara/alx-low_level_programming | 32d6de7 | 0x0A-argc_argv/0-whatsmyname.c | C | www.github.com/chidiamara/alx-low_level_programming/tree/main/0x0A-argc_argv/0-whatsmyname.c | https://raw.githubusercontent.com/chidiamara/alx-low_level_programming/32d6de7/0x0A-argc_argv/0-whatsmyname.c | chidiamara/alx-low_level_programming 32d6de7 0x0A-argc_argv/0-whatsmyname.c | true | 200 | 245 | #include <stdio.h>
#include "main.h"
/**
* main - print the name of the program followed by a new line
*@argc: int
*@argv: an array of strings
* Return: 0
*/
int main(int argc, char *argv[])
{
(void) argc;
printf("%s\n", argv[0]);
return (0);
}
| 4 |
rich-ardwang/apue-learning | 795c980 | apue-src/010/10_14/10_14_280.c | C | www.github.com/rich-ardwang/apue-learning/tree/main/apue-src/010/10_14/10_14_280.c | https://raw.githubusercontent.com/rich-ardwang/apue-learning/795c980/apue-src/010/10_14/10_14_280.c | rich-ardwang/apue-learning 795c980 apue-src/010/10_14/10_14_280.c | true | 200 | 3,175 | #include "apue.h"
/* Reliable version of signal(), using POSIX sigaction(). */
// 利用sigaction函数重新实现了signal函数，取名为my_signal。
Sigfunc *
my_signal(int signo, Sigfunc *func)
{
// act保存该信号需要修改的动作。
// oact保存该信号处理动作被修改前的上一个动作。
struct sigaction act, oact;
// 指定信号处理函数。
act.sa_handler = func;
// 取消一切信号屏蔽字。
// 注意不可以这样做act.... | 5 |
5102a/iot-car | d82b380 | app/HARDWEAR/inc/pid.h | C | www.github.com/5102a/iot-car/tree/main/app/HARDWEAR/inc/pid.h | https://raw.githubusercontent.com/5102a/iot-car/d82b380/app/HARDWEAR/inc/pid.h | 5102a/iot-car d82b380 app/HARDWEAR/inc/pid.h | true | 200 | 694 | #ifndef __PID_H
#define __PID_H
#include "main.h"
typedef struct
{
uint16_t Cur_Index; //��ǰֵ����
uint16_t Pre_Index; //ǰһ������
uint16_t PPre_Index; //ǰ��������
uint8_t Init_Count; //������ʼ��
int16_t Set_Val; //�趨Ҫ�ﵽ��ֵ���ⲿ�ṩֵ��
float Kp; //����ϵ�����ⲿ�ṩֵ��
float Ki; ... | 6 |
AhmedHesham0/alx-low_level_programming | fe8baeb | 0x14-bit_manipulation/100-get_endianness.c | C | www.github.com/AhmedHesham0/alx-low_level_programming/tree/main/0x14-bit_manipulation/100-get_endianness.c | https://raw.githubusercontent.com/AhmedHesham0/alx-low_level_programming/fe8baeb/0x14-bit_manipulation/100-get_endianness.c | AhmedHesham0/alx-low_level_programming fe8baeb 0x14-bit_manipulation/100-get_endianness.c | true | 200 | 212 | #include "main.h"
/**
* get_endianness - check if the machine small or big endian
* Return: 1 for small, 0 for big
*/
int get_endianness(void)
{
unsigned int i = 1;
char *c = (char *) &i;
return (*c);
}
| 0 |
whigitantriya/stack-and-queue | 0a73e61 | 672022081_Tugas Stack and queue.c | C | www.github.com/whigitantriya/stack-and-queue/tree/main/672022081_Tugas Stack and queue.c | https://raw.githubusercontent.com/whigitantriya/stack-and-queue/0a73e61/672022081_Tugas%20Stack%20and%20queue.c | whigitantriya/stack-and-queue 0a73e61 672022081_Tugas Stack and queue.c | true | 200 | 6,974 | #include <stdio.h>
#include <conio.h>
#define MAX 5
struct STACK {
char top;
char data[MAX][MAX];
}tumpuk;
typedef struct{
int data[MAX];
int head;
int tail;
} Queue;
Queue antrian;
// stack
void inisialisasi1()
{
tumpuk.top = -1;
}
int IsFull()
{
if(tumpuk.top == MAX... | 7 |
Favourite101/old_printf | 353d31c | flagger.c | C | www.github.com/Favourite101/old_printf/tree/main/flagger.c | https://raw.githubusercontent.com/Favourite101/old_printf/353d31c/flagger.c | Favourite101/old_printf 353d31c flagger.c | true | 200 | 622 | #include "main.h"
/**
* flags - Calculates active flags
* @format: Formatted string in which to print the arguments
* @i: takes a parameter.
* Return: Flags:
*/
int flags(const char *format, int *i)
{
int j, curr_i;
int flag = 0;
const char FLAGS_CH[] = {'-', '+', '0', '#', ' ', '\0'};
const int FLAGS_ARR[]... | 3 |
SanderGi/Neuralink-Compression | 65cb0bb | unique_2dot00/decode.c | C | www.github.com/SanderGi/Neuralink-Compression/tree/main/unique_2dot00/decode.c | https://raw.githubusercontent.com/SanderGi/Neuralink-Compression/65cb0bb/unique_2dot00/decode.c | SanderGi/Neuralink-Compression 65cb0bb unique_2dot00/decode.c | true | 200 | 2,516 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "wav.h"
int main(int argc, char **argv) {
if (argc < 3) {
printf("Usage: %s <filename.brainwire> <filename.wav.copy>", argv[0]);
exit(1);
}
char *src_name = argv[1];
char *dst_name = argv[2];
// open file
FIL... | 2 |
yadavhrishi/Development | 4aad856 | Storage1.c | C | www.github.com/yadavhrishi/Development/tree/main/Storage1.c | https://raw.githubusercontent.com/yadavhrishi/Development/4aad856/Storage1.c | yadavhrishi/Development 4aad856 Storage1.c | true | 200 | 228 | #include <stdio.h>
int X = 51;
void Demo()
{
auto int no = 11;
register int Data = 21;
int Y;
int A = 51;
}
int main()
{
int i = 10;
auto int j = 20;
Demo(); // Function call
return 0;
} | 4 |
Himanshu0508Raturi/CODES | e3781bb | C/Question/q16.c | C | www.github.com/Himanshu0508Raturi/CODES/tree/main/C/Question/q16.c | https://raw.githubusercontent.com/Himanshu0508Raturi/CODES/e3781bb/C/Question/q16.c | Himanshu0508Raturi/CODES e3781bb C/Question/q16.c | true | 200 | 788 | /*16.Develop a C program to find total and average sales of 'N' employees by reading the details such as empcode, name, and
sales using array of structures.*/
#include <stdio.h>
struct empl
{
int cd;
char name[20];
float sales;
};
void main()
{
struct empl s[20];
int i, n;
float sum... | 1 |
Galile-Vincent/CAL | ed9a743 | Nov_24/10.c | C | www.github.com/Galile-Vincent/CAL/tree/main/Nov_24/10.c | https://raw.githubusercontent.com/Galile-Vincent/CAL/ed9a743/Nov_24/10.c | Galile-Vincent/CAL ed9a743 Nov_24/10.c | true | 200 | 2,296 | #include <stdio.h>
#include <stdbool.h>
#include <string.h>
typedef char Str50[50]; // 新型別；一個可存放50字元的陣列
struct Customer {
int id; // 客戶編號
Str50 name; // 名字
int balance; // 存款
};
typedef struct Customer CustomerArray[200];
int Read(CustomerArray cus_arr) {
int count = 0;
int id = 0;
char name[50];
... | 5 |
pauwan-github/C-programming | 54e9b9c | C/search2array.c | C | www.github.com/pauwan-github/C-programming/tree/main/C/search2array.c | https://raw.githubusercontent.com/pauwan-github/C-programming/54e9b9c/C/search2array.c | pauwan-github/C-programming 54e9b9c C/search2array.c | true | 200 | 500 | #include<stdio.h>
#define MAX_SIZE 100
int main(){int arr[MAX_SIZE];
int size,i,toSearch,found;
printf("Enter size of array:");
scanf("%d", &size);
printf("Enter elements in array:");
for(i=0; i<size; i++){scanf("%d", &arr[i]);}
printf("\nEnter element to Search:");
scanf("%d", &toSearch);found=0; for(i=0; i<s... | 6 |
owiamusic/alx-low_level_programming | dbc46d8 | 0x0C-more_malloc_free/1-string_nconcat.c | C | www.github.com/owiamusic/alx-low_level_programming/tree/main/0x0C-more_malloc_free/1-string_nconcat.c | https://raw.githubusercontent.com/owiamusic/alx-low_level_programming/dbc46d8/0x0C-more_malloc_free/1-string_nconcat.c | owiamusic/alx-low_level_programming dbc46d8 0x0C-more_malloc_free/1-string_nconcat.c | true | 200 | 678 | #include "main.h"
#include <stdlib.h>
/**
* string_nconcat - Concatenates two strings
* @s1: string
* @s2: string
* @n: integer
* Return: Boolean
*/
char *string_nconcat(char *s1, char *s2, unsigned int n)
{
char *cat;
unsigned int len1 = 0;
unsigned int len2 = 0;
unsigned int i;
if (s1 == NULL)
s1 = "... | 0 |
oscarmorenosancho/minishell | 94ea0a3 | src/ft_chdir.c | C | www.github.com/oscarmorenosancho/minishell/tree/main/src/ft_chdir.c | https://raw.githubusercontent.com/oscarmorenosancho/minishell/94ea0a3/src/ft_chdir.c | oscarmorenosancho/minishell 94ea0a3 src/ft_chdir.c | true | 200 | 2,173 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_chdir.c :+: :+: :+: ... | 7 |
MyUCF/Lab6 | 197dd7d | lab_assignment_6.c | C | www.github.com/MyUCF/Lab6/tree/main/lab_assignment_6.c | https://raw.githubusercontent.com/MyUCF/Lab6/197dd7d/lab_assignment_6.c | MyUCF/Lab6 197dd7d lab_assignment_6.c | true | 200 | 1,565 | #include <stdio.h>
#include <stdlib.h>
int search(int numbers[], int low, int high, int value)
{
if(!(low <= high))
return -1;
int midpoint = (low+high)/2;
if(value == numbers[midpoint])
return 1;
return (value < numbers[midpoint]) ? search(numbers, low, midpoint-1, ... | 4 |
okraus42/42-4-miniRT | a413ba3 | src/maths/solve_quadratic_eq_cylinder.c | C | www.github.com/okraus42/42-4-miniRT/tree/main/src/maths/solve_quadratic_eq_cylinder.c | https://raw.githubusercontent.com/okraus42/42-4-miniRT/a413ba3/src/maths/solve_quadratic_eq_cylinder.c | okraus42/42-4-miniRT a413ba3 src/maths/solve_quadratic_eq_cylinder.c | true | 200 | 2,110 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* solve_quadratic_eq_cylinder.c :+: :+: :+: ... | 1 |
dawnbreaker28/VE482 | d21da05 | 482p3/sys/sys/sem.h | C | www.github.com/dawnbreaker28/VE482/tree/main/482p3/sys/sys/sem.h | https://raw.githubusercontent.com/dawnbreaker28/VE482/d21da05/482p3/sys/sys/sem.h | dawnbreaker28/VE482 d21da05 482p3/sys/sys/sem.h | true | 200 | 4,033 | /* $NetBSD: sem.h,v 1.29 2009/01/19 19:39:41 christos Exp $ */
/*-
* Copyright (c) 1999 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Jason R. Thorpe of the Numerical Aerospace Simulation Facility,
* NASA Ames Research ... | 3 |
sudaichi1248/wpfm_9 | c33ee08 | firmware/src/rtc.c | C | www.github.com/sudaichi1248/wpfm_9/tree/main/firmware/src/rtc.c | https://raw.githubusercontent.com/sudaichi1248/wpfm_9/c33ee08/firmware/src/rtc.c | sudaichi1248/wpfm_9 c33ee08 firmware/src/rtc.c | true | 200 | 19,548 | /*
* File: rtc.c
* Author: Interark Corp.
* Summary: Real Time Clock(RX8035) driver implementation file.
* Date: 2022/08/13 (R0)
* Note: Refer to Application manual of RX-8035SA/LC [ETM35J-09(Epson)]
*/
// Build configuration
#define DEBUG_UART
#define RTC_DEBUG // Debug RTC initialize f... | 2 |
ADev-123/Parallel | 1314b3d | Project/SeqArray (1).c | C | www.github.com/ADev-123/Parallel/tree/main/Project/SeqArray (1).c | https://raw.githubusercontent.com/ADev-123/Parallel/1314b3d/Project/SeqArray%20%281%29.c | ADev-123/Parallel 1314b3d Project/SeqArray (1).c | true | 200 | 3,233 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <openssl/evp.h>
#include <openssl/rand.h>
#include <openssl/err.h>
#define AES_GCM_KEY_SIZE 16
#define AES_GCM_IV_SIZE 12
#define AES_GCM_TAG_SIZE 16
// Function to handle OpenSSL errors
void handleErrors(void) {
ERR_print_errors_fp(... | 6 |
ivinjabraham/random-drivers | a80a7ea | scull/scull.c | C | www.github.com/ivinjabraham/random-drivers/tree/main/scull/scull.c | https://raw.githubusercontent.com/ivinjabraham/random-drivers/a80a7ea/scull/scull.c | ivinjabraham/random-drivers a80a7ea scull/scull.c | true | 200 | 5,459 | // SCULL Driver: based off of Linux Device Drivers edtn. 3
// Copyright (C) 2024 Ivin Joel Abraham
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
//... | 0 |
JorreJ/holbertonschool-low_level_programming | 1fa037e | variables_if_else_while/102-print_comb5.c | C | www.github.com/JorreJ/holbertonschool-low_level_programming/tree/main/variables_if_else_while/102-print_comb5.c | https://raw.githubusercontent.com/JorreJ/holbertonschool-low_level_programming/1fa037e/variables_if_else_while/102-print_comb5.c | JorreJ/holbertonschool-low_level_programming 1fa037e variables_if_else_while/102-print_comb5.c | true | 200 | 512 | #include <stdio.h>
/**
* main - Prints all possible combinations of two different digits,
* in ascending order, separated by a comma followed by a space.
*
* Return: Always 0.
*/
int main(void)
{
int tw1, tw2;
for (tw1 = 0; tw1 < 99; tw1++)
{
for (tw2 = tw1 + 1; tw2 <= 99; tw2++)
{
putchar((tw1 / 10) + '0... | 4 |
bryokim/alx-low_level_programming | 61b8495 | 0x02-functions_nested_loops/0-putchar.c | C | www.github.com/bryokim/alx-low_level_programming/tree/main/0x02-functions_nested_loops/0-putchar.c | https://raw.githubusercontent.com/bryokim/alx-low_level_programming/61b8495/0x02-functions_nested_loops/0-putchar.c | bryokim/alx-low_level_programming 61b8495 0x02-functions_nested_loops/0-putchar.c | true | 200 | 262 | #include "main.h"
/**
* main - entry point
*
* Description: prints _putchar, followed
* by a new line
*
* Return: Always 0
*/
int main(void)
{
char s[9] = "_putchar";
int i;
for (i = 0; i < 8 ; i++)
_putchar(s[i]);
_putchar('\n');
return (0);
}
| 5 |
vantab3259/minishell | f521956 | srcs/utils.c | C | www.github.com/vantab3259/minishell/tree/main/srcs/utils.c | https://raw.githubusercontent.com/vantab3259/minishell/f521956/srcs/utils.c | vantab3259/minishell f521956 srcs/utils.c | true | 200 | 2,117 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* utils.c :+: :+: :+: ... | 1 |
bilije/C_programs_2019 | 0121056 | PP07_Nalecz-projekt_etapA/main.c | C | www.github.com/bilije/C_programs_2019/tree/main/PP07_Nalecz-projekt_etapA/main.c | https://raw.githubusercontent.com/bilije/C_programs_2019/0121056/PP07_Nalecz-projekt_etapA/main.c | bilije/C_programs_2019 0121056 PP07_Nalecz-projekt_etapA/main.c | true | 200 | 1,174 | /* Tomasz Nalecz
Grupa U2
29.05.2020r. */
// Projekt etap I, A
#include "biblioteka.h"
int wczytaj (int d_gran, int g_gran, const char * komunikat)
{
int wybor = 0;
printf("Podaj %s z zakresu <%d, %d>:", komunikat, d_gran, g_gran);
do
{
scanf("%d", &wybor);
}
while(wybor < d_gran || wybor > g_gran);
ret... | 2 |
LEUNSU/basic-TCP-IP-2024 | 155a54c | day04/select.c | C | www.github.com/LEUNSU/basic-TCP-IP-2024/tree/main/day04/select.c | https://raw.githubusercontent.com/LEUNSU/basic-TCP-IP-2024/155a54c/day04/select.c | LEUNSU/basic-TCP-IP-2024 155a54c day04/select.c | true | 200 | 960 | #include <stdio.h>
#include <unistd.h>
#include <sys/time.h>
#include <sys/select.h>
#define BUF_SIZE 30
int main(int argc, char *argv[])
{
fd_set reads, temps;
int result, str_len;
char buf[BUF_SIZE];
struct timeval timeout;
FD_ZERO(&reads);
FD_SET(0, &reads); // 0 is standard input(console)
... | 7 |
micas2002/minishell | bc4d6fa | sources/execute_programs.c | C | www.github.com/micas2002/minishell/tree/main/sources/execute_programs.c | https://raw.githubusercontent.com/micas2002/minishell/bc4d6fa/sources/execute_programs.c | micas2002/minishell bc4d6fa sources/execute_programs.c | true | 200 | 3,012 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* execute_programs.c :+: :+: :+: ... | 3 |
CesarAugusto88/Introduction-to-C-Language-Course | c9e61f4 | aula5/graf.c | C | www.github.com/CesarAugusto88/Introduction-to-C-Language-Course/tree/main/aula5/graf.c | https://raw.githubusercontent.com/CesarAugusto88/Introduction-to-C-Language-Course/c9e61f4/aula5/graf.c | CesarAugusto88/Introduction-to-C-Language-Course c9e61f4 aula5/graf.c | true | 200 | 688 | // graf.c - exibe grafico para variacao de temperatura
#include <stdio.h>
void preencher(float t[7])
{
int i;
for(i=0; i<7; i++)
{
printf("%da. temperatura? ", i+1);
scanf("%f", &t[i]);
}
}
float media(float t[7])
{
int i;
float s=0;
for(i=0; i<7; i++) s += t[i];
return s/7;
}
void barra(float t)
{
in... | 6 |
PeteJames21/alx-low_level_programming | dc7d88d | 0x0A-argc_argv/2-args.c | C | www.github.com/PeteJames21/alx-low_level_programming/tree/main/0x0A-argc_argv/2-args.c | https://raw.githubusercontent.com/PeteJames21/alx-low_level_programming/dc7d88d/0x0A-argc_argv/2-args.c | PeteJames21/alx-low_level_programming dc7d88d 0x0A-argc_argv/2-args.c | true | 200 | 300 | #include <stdio.h>
#include "main.h"
/**
* main - print all the args passed to the program
* @argc: number of commandline arguments
* @argv: argument vector
*
* Return: 0 (success)
*/
int main(int argc, char *argv[])
{
int i;
for (i = 0; i < argc; i++)
printf("%s\n", argv[i]);
return (0);
}
| 0 |
icareus1/printf | 74c76f2 | test-1/print_int.c | C | www.github.com/icareus1/printf/tree/main/test-1/print_int.c | https://raw.githubusercontent.com/icareus1/printf/74c76f2/test-1/print_int.c | icareus1/printf 74c76f2 test-1/print_int.c | true | 200 | 786 | #include "main.h"
/**
* print_d - Print decimal (Base 10) digits
* @args: Store the value of arguments
* Return: Counter print numbers
*/
int print_d(va_list args)
{
unsigned int num_Absolute, aux_Num, count_Zero, count;
int numbers;
count = 0;
numbers = va_arg(args, int);
if (numbers < 0)
{
num_Absolute... | 4 |
Egosoniaragp/alx-low_level_programming | 7986551 | 0x05-pointers_arrays_strings/6-puts2.c | C | www.github.com/Egosoniaragp/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/6-puts2.c | https://raw.githubusercontent.com/Egosoniaragp/alx-low_level_programming/7986551/0x05-pointers_arrays_strings/6-puts2.c | Egosoniaragp/alx-low_level_programming 7986551 0x05-pointers_arrays_strings/6-puts2.c | true | 200 | 299 | #include "main.h"
/**
* puts2 - prints one char out of 2 of a string
* @str: input string.
* Return: no return
*/
void puts2(char *str)
{
int count = 0;
while (count >= 0)
{
if (str[count] == '\0')
{
_putchar('\n');
break;
}
if (count % 2 == 0)
_putchar(str[count]);
count++;
}
}
| 1 |
019shobhit/C-Codes | b0695f3 | codeWithHarry/ch8 String/ps9.c | C | www.github.com/019shobhit/C-Codes/tree/main/codeWithHarry/ch8 String/ps9.c | https://raw.githubusercontent.com/019shobhit/C-Codes/b0695f3/codeWithHarry/ch8%20String/ps9.c | 019shobhit/C-Codes b0695f3 codeWithHarry/ch8 String/ps9.c | true | 200 | 633 | // Write a program to check weather a given character is present in string or not.
#include<stdio.h>
int check(char *ptr,char x){
int flag =0;
while(*ptr != '\0'){
if(*ptr==x){
flag =1;
break;
}
ptr++;
}
return flag;
}
int main()
{
... | 3 |
a1091150/2023q1_Homework6_quiz5_problem2 | 596a202 | rbtree.c | C | www.github.com/a1091150/2023q1_Homework6_quiz5_problem2/tree/main/rbtree.c | https://raw.githubusercontent.com/a1091150/2023q1_Homework6_quiz5_problem2/596a202/rbtree.c | a1091150/2023q1_Homework6_quiz5_problem2 596a202 rbtree.c | true | 200 | 6,913 | #include "rbtree.h"
#include <assert.h>
#include <errno.h>
#include <stdbool.h>
#include <string.h>
static bool resize_tab_values(metadata_t **old, rbnode_t *node);
static rbnode_t *new_rbtree(metadata_t *node);
static rbnode_t *remove_node(rbnode_t *node, t_key key, rbnode_t *tmp);
static inline void flip_color(rbno... | 6 |
Olivergist/alx-low_level_programming | 7cb2939 | 0x02-functions_nested_loops/9-times_table.c | C | www.github.com/Olivergist/alx-low_level_programming/tree/main/0x02-functions_nested_loops/9-times_table.c | https://raw.githubusercontent.com/Olivergist/alx-low_level_programming/7cb2939/0x02-functions_nested_loops/9-times_table.c | Olivergist/alx-low_level_programming 7cb2939 0x02-functions_nested_loops/9-times_table.c | true | 200 | 517 | #include "main.h"
/**
* times_table - prints the 9 times table
*/
void times_table(void)
{
int row, column, product;
for (row = 0; row <= 9; row++)
{
for (column = 0; column <= 9; column++)
{
product = row * column;
if (product <= 9)
{
if (column != 0)
_putchar(' ');
_putchar(product + ... | 0 |
tgjones/IR2IL | be0fae6 | tests/fujitsu-compiler-test-suite/C/0016/0016_0058.c | C | www.github.com/tgjones/IR2IL/tree/main/tests/fujitsu-compiler-test-suite/C/0016/0016_0058.c | https://raw.githubusercontent.com/tgjones/IR2IL/be0fae6/tests/fujitsu-compiler-test-suite/C/0016/0016_0058.c | tgjones/IR2IL be0fae6 tests/fujitsu-compiler-test-suite/C/0016/0016_0058.c | true | 200 | 279 | #include <stdio.h>
#include <complex.h>
int main()
{
float _Complex a,b,c;
a = 50.000f + 4.000fi;
b = 25.000f + 2.000fi;
c = a * b;
if (crealf(c) == 1242.0f && cimagf(c) == 200.0f){
printf("OK\n");
}else{
printf("NG (%f,%f)\n",crealf(c),cimagf(c));
}
}
| 7 |
haiji1212/Leetcode | 74157cf | Leetcode-199.c | C | www.github.com/haiji1212/Leetcode/tree/main/Leetcode-199.c | https://raw.githubusercontent.com/haiji1212/Leetcode/74157cf/Leetcode-199.c | haiji1212/Leetcode 74157cf Leetcode-199.c | true | 200 | 2,682 | #include<stdio.h>
#include<stdlib.h>
//【199】二叉树的右视图
// 给定一棵二叉树，想象自己站在它的右侧，按照从顶部到底部的顺序，返回从右侧所能看到的节点值。
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
};
#define MAXSIZE 100
typedef struct{
struct TreeNode** base;
int front;
int rear;
}SqQueue; //循环队列
int InitQueue(SqQ... | 5 |
NKECHI123/simple_shell | b4a313b | cmd_exec.c | C | www.github.com/NKECHI123/simple_shell/tree/main/cmd_exec.c | https://raw.githubusercontent.com/NKECHI123/simple_shell/b4a313b/cmd_exec.c | NKECHI123/simple_shell b4a313b cmd_exec.c | true | 200 | 4,118 | #include "shell.h"
/**
* isCurrentDirectory - checks if ":" is in the current directory
* @path: path string
* @index: pointer to the index
* Return: 1 if the path is searchable in the current directory, 0 otherwise
*/
int isCurrentDirectory(char *path, int *index)
{
if (path[*index] == ':')
return (1);
whil... | 2 |
fing9/BOJ-fin | 832f1d4 | 백준/Bronze/10989. 수 정렬하기 3/수 정렬하기 3.c | C | www.github.com/fing9/BOJ-fin/tree/main/백준/Bronze/10989. 수 정렬하기 3/수 정렬하기 3.c | https://raw.githubusercontent.com/fing9/BOJ-fin/832f1d4/%EB%B0%B1%EC%A4%80/Bronze/10989.%E2%80%85%EC%88%98%E2%80%85%EC%A0%95%EB%A0%AC%ED%95%98%EA%B8%B0%E2%80%853/%EC%88%98%E2%80%85%EC%A0%95%EB%A0%AC%ED%95%98%EA%B8%B0%E2%80%853.c | fing9/BOJ-fin 832f1d4 백준/Bronze/10989. 수 정렬하기 3/수 정렬하기 3.c | true | 200 | 359 | # include <stdio.h>
int main()
{
int N, i, j, k, answer[10001] = {0,};
scanf("%d",&N); //입력부
for(i=0;i<N;i++){
scanf("%d",&k);
answer[k] += 1;
}
for(i=1;i<10001;i++){ //출력부
for(j=0;j<answer[i];j++){
printf("%d\n",i);
}
... | 4 |
markCwatson/toyos | dca9965 | src/fs/path_parser.h | C | www.github.com/markCwatson/toyos/tree/main/src/fs/path_parser.h | https://raw.githubusercontent.com/markCwatson/toyos/dca9965/src/fs/path_parser.h | markCwatson/toyos dca9965 src/fs/path_parser.h | true | 200 | 1,907 | #ifndef _PATH_PARSER_H_
#define _PATH_PARSER_H_
/**
* @brief Structure representing the root of a parsed path.
*
* This structure holds the drive number and the first part of the path.
* For example, in the path "0:/tmp/file.txt", "0:/" would be the first part.
*/
struct path_root {
int drive_no; ... | 1 |
nus-sys/pktgen | 0887cb0 | include/pktgen-info.h | C | www.github.com/nus-sys/pktgen/tree/main/include/pktgen-info.h | https://raw.githubusercontent.com/nus-sys/pktgen/0887cb0/include/pktgen-info.h | nus-sys/pktgen 0887cb0 include/pktgen-info.h | true | 200 | 508 | #ifndef _PKTGEN_SEQ_H_
#define _PKTGEN_SEQ_H_
#include <net/ethernet.h>
typedef struct pkt_info_s {
uint8_t eth_src_addr[ETH_ALEN]; /**< Source Ethernet address */
uint8_t eth_dst_addr[ETH_ALEN]; /**< Destination Ethernet address */
uint32_t ip_src_addr; /**< Source IPv4 address in network bytes order */
uint32_... | 3 |
KyleBKesler/SHell-mush- | ffef74e | parseline.h | C | www.github.com/KyleBKesler/SHell-mush-/tree/main/parseline.h | https://raw.githubusercontent.com/KyleBKesler/SHell-mush-/ffef74e/parseline.h | KyleBKesler/SHell-mush- ffef74e parseline.h | true | 200 | 560 | #ifndef PARSELINE_H
#define PARSELINE_H
#define CMD_LENGTH 512
#define CMD_PIPE 10
#define CMD_ARG 10
#define LEN_IN 20
#define PROMPT 4
/* struct to hold parsed command values */
typedef struct Parse {
int stage;
char *stage_name;
char *input;
char *output;
int... | 6 |
hojuncha997/c-study | 112630c | ch_04-1/4-9.c | C | www.github.com/hojuncha997/c-study/tree/main/ch_04-1/4-9.c | https://raw.githubusercontent.com/hojuncha997/c-study/112630c/ch_04-1/4-9.c | hojuncha997/c-study 112630c ch_04-1/4-9.c | true | 200 | 536 | #include <stdio.h>
int main(void)
// 두 과목의 점수를 입력하여 평균을 출력하는 프로그램 작성
{
int a, b, tot;
double avg;
printf("두 과목의 점수: ");
scanf("%d %d", &a, &b); // 점수입력
tot = a + b;
avg = tot / 2.0;
// 평균계산, tot가 정수형이므로 나누는 값을 2.0과 같이 실수값으로 사용해야 한다.
// 그렇지 않으면 피연산자가 모두 정수 값이므로 몫을 계산한다.
printf("평균... | 0 |
Khaya14/alx-low_level_programming | a05e53b | 0x18-dynamic_libraries/2-strchr.c | C | www.github.com/Khaya14/alx-low_level_programming/tree/main/0x18-dynamic_libraries/2-strchr.c | https://raw.githubusercontent.com/Khaya14/alx-low_level_programming/a05e53b/0x18-dynamic_libraries/2-strchr.c | Khaya14/alx-low_level_programming a05e53b 0x18-dynamic_libraries/2-strchr.c | true | 200 | 345 | #include "main.h"
/**
* _strchr - locates character in string
*
* @s: source string
* @c: character to find
*
* Return: the string from character found
*/
char *_strchr(char *s, char c)
{
int p = 0, w;
while (s[p])
{
p++;
}
for (w = 0; w <= p; w++)
{
if (c == s[w])
{
s += w;
return (s);
... | 7 |
AmaiamUlHaque/COMP-2SH4 | 86493f9 | ProblemSets/PS4/PS4Q2.c | C | www.github.com/AmaiamUlHaque/COMP-2SH4/tree/main/ProblemSets/PS4/PS4Q2.c | https://raw.githubusercontent.com/AmaiamUlHaque/COMP-2SH4/86493f9/ProblemSets/PS4/PS4Q2.c | AmaiamUlHaque/COMP-2SH4 86493f9 ProblemSets/PS4/PS4Q2.c | true | 200 | 431 | //matrix transpose
#include <stdio.h>
#define N 10
int symmetric(double matrix[][N]) {
//check if [i][j] == [j][i]
int result = 1; // true
int i, j;
for(i = 0; i < N; i++) {
for(j = i + 1; j < N; j++) {
if(matrix[i][j] != matrix[j][i]){
result = 0; // false
... | 5 |
Akpobos/alx-dump | aad256b | alx-low_level_programming/0x05-pointers_arrays_strings/1-swap.c | C | www.github.com/Akpobos/alx-dump/tree/main/alx-low_level_programming/0x05-pointers_arrays_strings/1-swap.c | https://raw.githubusercontent.com/Akpobos/alx-dump/aad256b/alx-low_level_programming/0x05-pointers_arrays_strings/1-swap.c | Akpobos/alx-dump aad256b alx-low_level_programming/0x05-pointers_arrays_strings/1-swap.c | true | 200 | 204 | #include "main.h"
/**
* swap_int - Swap value of two integers
* @a: First integer
* @b: Second integer
*
* Return: Nothing
*/
void swap_int(int *a, int *b)
{
int tmp = *a;
*a = *b;
*b = tmp;
}
| 2 |
i-m-samarth-cs/DSA-Programs | b7f420a | Demonstration of Circular Linked list.c | C | www.github.com/i-m-samarth-cs/DSA-Programs/tree/main/Demonstration of Circular Linked list.c | https://raw.githubusercontent.com/i-m-samarth-cs/DSA-Programs/b7f420a/Demonstration%20of%20Circular%20Linked%20list.c | i-m-samarth-cs/DSA-Programs b7f420a Demonstration of Circular Linked list.c | true | 200 | 4,225 | #include<stdio.h>
#include<conio.h>
#include<malloc.h>
#include<stdlib.h>
void create();
void insert_at_beg();
void insert_at_end();
void insert_after_pos();
void del_at_beg();
void del_after_pos();
void del_at_end();
void search();
void display();
struct node
{
int info;
struct node *link;
}... | 1 |
BuildStormTechnologies/arduino-esp32-thingsboard-iot | b10bdab | Thingsboard_IoT/examples/video_demos/01_DeviceProvisioning/app_config.h | C | www.github.com/BuildStormTechnologies/arduino-esp32-thingsboard-iot/tree/main/Thingsboard_IoT/examples/video_demos/01_DeviceProvisioning/app_config.h | https://raw.githubusercontent.com/BuildStormTechnologies/arduino-esp32-thingsboard-iot/b10bdab/Thingsboard_IoT/examples/video_demos/01_DeviceProvisioning/app_config.h | BuildStormTechnologies/arduino-esp32-thingsboard-iot b10bdab Thingsboard_IoT/examples/video_demos/01_DeviceProvisioning/app_config.h | true | 200 | 844 | /*******************************************************************************
* Copyright (c) 2021-2024, Buildstorm Pvt Ltd
*
* Filename: app_config.h
*
* Description:
* Contains macros for the application
*******************************************************************************/
#ifn... | 3 |
tami-cp0/alx-low_level_programming | fa53fa5 | 0x1A-hash_tables/4-hash_table_get.c | C | www.github.com/tami-cp0/alx-low_level_programming/tree/main/0x1A-hash_tables/4-hash_table_get.c | https://raw.githubusercontent.com/tami-cp0/alx-low_level_programming/fa53fa5/0x1A-hash_tables/4-hash_table_get.c | tami-cp0/alx-low_level_programming fa53fa5 0x1A-hash_tables/4-hash_table_get.c | true | 200 | 650 | #include "hash_tables.h"
/**
* hash_table_get - Retrieves a value associated with a key in a hash table.
*
* @ht: A pointer to the hash table.
* @key: The key to search for.
*
* Return: The value associated with the key, or NULL if key not found.
*/
char *hash_table_get(const hash_table_t *ht, const char *key)
{
unsi... | 6 |
baddimehamad/alx-low_level_programming | 267529d | 0x1E-search_algorithms/102-interpolation.c | C | www.github.com/baddimehamad/alx-low_level_programming/tree/main/0x1E-search_algorithms/102-interpolation.c | https://raw.githubusercontent.com/baddimehamad/alx-low_level_programming/267529d/0x1E-search_algorithms/102-interpolation.c | baddimehamad/alx-low_level_programming 267529d 0x1E-search_algorithms/102-interpolation.c | true | 200 | 639 | #include "search_algos.h"
/**
*interpolation_search
* @array: array
* @size: array
* @value: value
* Return: index
*/
int interpolation_search(int *array, size_t size, int value)
{
size_t i, l, r;
if (array == NULL)
return (-1);
for (l = 0, r = size - 1; r >= l;)
{
i = l + (((double)(r - l) / (array[r... | 0 |
Vitor-costa-diniz/Faculdade | 92f4c85 | Lab_Programacao/Trabalho_Final/main.c | C | www.github.com/Vitor-costa-diniz/Faculdade/tree/main/Lab_Programacao/Trabalho_Final/main.c | https://raw.githubusercontent.com/Vitor-costa-diniz/Faculdade/92f4c85/Lab_Programacao/Trabalho_Final/main.c | Vitor-costa-diniz/Faculdade 92f4c85 Lab_Programacao/Trabalho_Final/main.c | true | 200 | 1,425 | #include <dirent.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <string.h>
#include "pj.h"
int main(void){
DIR *d;
struct pgm imgIn;
struct dirent *dir;
unsigned int hist[256];
char r, nomeFinal[200];
clock_t begin, end;
double time_per_img, time_total=0;
d = opendir("./image... | 7 |
CloudMojos/Final-Project-in-DSA | c820d30 | files.c | C | www.github.com/CloudMojos/Final-Project-in-DSA/tree/main/files.c | https://raw.githubusercontent.com/CloudMojos/Final-Project-in-DSA/c820d30/files.c | CloudMojos/Final-Project-in-DSA c820d30 files.c | true | 200 | 811 | #include <stdio.h>
#include <stdlib.h>
#include "utils.h"
#include "countfreq.h"
#include "ui.h"
void printFile(FILE *fp)
{
char ch;
char lastch;
int x = LP + 32;
int y = TP + 7;
if (isFileNull(fp)){ return; }
while (!feof(fp))
{
if (x >= RP - 10)
{
y += 1;
... | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.