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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
rodrigozarate/holbertonschool-blockchain | a4cfbbc | crypto/ec_save.c | C | www.github.com/rodrigozarate/holbertonschool-blockchain/tree/main/crypto/ec_save.c | https://raw.githubusercontent.com/rodrigozarate/holbertonschool-blockchain/a4cfbbc/crypto/ec_save.c | rodrigozarate/holbertonschool-blockchain a4cfbbc crypto/ec_save.c | true | 200 | 2,251 | #include "hblk_crypto.h"
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
#include <stdio.h>
#include <errno.h>
#include <openssl/ec.h>
#include <openssl/pem.h>
#include <linux/limits.h>
#include <string.h>
/**
* ptnfile_w - FILE pointer to a new file
* @folder: path
* @filename: file
* Return: FI... | 5 |
TioDosio/PSis | bda986b | Project_B/lizardsNroachesNwasps_group26/lizardsNroachesNwasps-server/lizardsNroachesNwasps-server.c | C | www.github.com/TioDosio/PSis/tree/main/Project_B/lizardsNroachesNwasps_group26/lizardsNroachesNwasps-server/lizardsNroachesNwasps-server.c | https://raw.githubusercontent.com/TioDosio/PSis/bda986b/Project_B/lizardsNroachesNwasps_group26/lizardsNroachesNwasps-server/lizardsNroachesNwasps-server.c | TioDosio/PSis bda986b Project_B/lizardsNroachesNwasps_group26/lizardsNroachesNwasps-server/lizardsNroachesNwasps-server.c | true | 200 | 2,179 | #include <zmq.h>
#include "../common-files/lizardsNroachesNwasps.h"
#include <unistd.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <stdlib.h>
#include <assert.h>
#include "../common-files/display-funcs.h"
#include <string.h>
#include <pthread.h>
#include "thread-funcs.h"
int main()
{
// Define lizards, ... | 3 |
femix300/simple_shell | b00653e | first_functions.c | C | www.github.com/femix300/simple_shell/tree/main/first_functions.c | https://raw.githubusercontent.com/femix300/simple_shell/b00653e/first_functions.c | femix300/simple_shell b00653e first_functions.c | true | 200 | 3,399 | #include "main.h"
/**
* my_strchr - locate character in string
* @str: pointer to the string to be searched
* @ch: character to be located
*
* Return: pointer to the first occurrence of the character in the string,
* or NULL if the character is not found
*/
char *my_strchr(const char *str, int ch)
{
wh... | 1 |
thregium/practice_baekjoon | 1e3181c | 21000-21999/21612.c | C | www.github.com/thregium/practice_baekjoon/tree/main/21000-21999/21612.c | https://raw.githubusercontent.com/thregium/practice_baekjoon/1e3181c/21000-21999/21612.c | thregium/practice_baekjoon 1e3181c 21000-21999/21612.c | true | 200 | 490 | #include <stdio.h>
/*
���� : ���� ���� ���� �־��� �� 5 * B - 400 = P��� ������ ���� ��� P�� ���ϰ� �ؼ��� ������ ���Ѵ�.
�ذ� ��� : ���Ŀ� ���� ���� ������ ����� ���� �� ���� ���� 100���� ������ ���θ� ���� �ؼ���� ������ ���踦 ���ϸ� �ȴ�.
�ֿ� �˰����� : ����, ����
��ó : CCC 2021 J1��
*/
int main(void) {
int b;
scan... | 7 |
Althar93/voxel-terrain-pd | 7be9184 | src/main.c | C | www.github.com/Althar93/voxel-terrain-pd/tree/main/src/main.c | https://raw.githubusercontent.com/Althar93/voxel-terrain-pd/7be9184/src/main.c | Althar93/voxel-terrain-pd 7be9184 src/main.c | true | 200 | 5,400 | //
// main.c
// Extension
//
// Created by Dave Hayden on 7/30/14.
// Copyright (c) 2014 Panic, Inc. All rights reserved.
//
#include <stdio.h>
#include <stdlib.h>
#include "pd_api.h"
#include "voxel_terrain.h"
static int update(void* userdata);
const char* fontpath = "/System/Fonts/Asheville-Sans-14-Bold.pft";... | 4 |
SmileyAG/MSVC60 | 0cb3ee8 | vc_studio/main/VC98/Samples/Amd/Asdk/atrans.h | C | www.github.com/SmileyAG/MSVC60/tree/main/vc_studio/main/VC98/Samples/Amd/Asdk/atrans.h | https://raw.githubusercontent.com/SmileyAG/MSVC60/0cb3ee8/vc_studio/main/VC98/Samples/Amd/Asdk/atrans.h | SmileyAG/MSVC60 0cb3ee8 vc_studio/main/VC98/Samples/Amd/Asdk/atrans.h | true | 200 | 3,296 | /******************************************************************************
Copyright (c) 1999 Advanced Micro Devices, Inc.
LIMITATION OF LIABILITY: THE MATERIALS ARE PROVIDED *AS IS* WITHOUT ANY
EXPRESS OR IMPLIED WARRANTY OF ANY KIND INCLUDING WARRANTIES OF MERCHANTABILITY,
NONINFRINGEMENT OF THIRD-P... | 2 |
Kolterdyx/minishell2 | 9841e95 | list.c | C | www.github.com/Kolterdyx/minishell2/tree/main/list.c | https://raw.githubusercontent.com/Kolterdyx/minishell2/9841e95/list.c | Kolterdyx/minishell2 9841e95 list.c | true | 200 | 914 | //
// Created by kolterdyx on 7/9/24.
//
#include "list.h"
#include <stdio.h>
t_list *new_list(const void *data) {
t_list *list = calloc(1, sizeof(t_list));
list->data = (void *)data;
list->next = NULL;
list->size = 1;
return list;
}
void destroy_list(t_list *list, void (*destroy_data)(void *)) ... | 6 |
Oduoronyina/alx-low_level_programming | 74aeb53 | 0x1A-hash_tables/3-hash_table_set.c | C | www.github.com/Oduoronyina/alx-low_level_programming/tree/main/0x1A-hash_tables/3-hash_table_set.c | https://raw.githubusercontent.com/Oduoronyina/alx-low_level_programming/74aeb53/0x1A-hash_tables/3-hash_table_set.c | Oduoronyina/alx-low_level_programming 74aeb53 0x1A-hash_tables/3-hash_table_set.c | true | 200 | 2,231 | #include "hash_tables.h"
/**
* * free_node - Free a node.
* * @node: Node to free.
* *
* * Return: Void.
* */
void free_node(hash_node_t *node)
{
free(node->key);
free(node->value);
free(node);
}
/**
* * hash_table_set - Set a value in the hash table.
* * @ht: Hash table.
* * @ke... | 5 |
Judgy53/holbertonschool-interview | 9028411 | wild_cmp/0-wildcmp.c | C | www.github.com/Judgy53/holbertonschool-interview/tree/main/wild_cmp/0-wildcmp.c | https://raw.githubusercontent.com/Judgy53/holbertonschool-interview/9028411/wild_cmp/0-wildcmp.c | Judgy53/holbertonschool-interview 9028411 wild_cmp/0-wildcmp.c | true | 200 | 605 | #include "holberton.h"
/**
* wildcmp - Compares two strings with wildcard "*".
* @s1: Pointer to the first string
* @s2: Pointer to the second string.
*
* Return: 1 if the strings are identical, 0 otherwise.
*/
int wildcmp(char *s1, char *s2)
{
if (*s1 == '\0' && *s2 == '\0') /* Both strings have no char left *... | 3 |
mike-degreat/alx-low_level_programming | 7071861 | 0x06-pointers_arrays_strings/0-strcat.c | C | www.github.com/mike-degreat/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/0-strcat.c | https://raw.githubusercontent.com/mike-degreat/alx-low_level_programming/7071861/0x06-pointers_arrays_strings/0-strcat.c | mike-degreat/alx-low_level_programming 7071861 0x06-pointers_arrays_strings/0-strcat.c | true | 200 | 363 | #include "main.h"
/**
* _strcat - appends the 'src' string to the 'dest' string
* @dest: string to append by src
* @src: string to append to dest
*
* Return: pointer or address(*) of dest
*/
char *_strcat(char *dest, char *src)
{
int i, j;
i = j = 0;
while (*(dest + i))
i++;
while ((*(dest + i) = *(src + ... | 1 |
Denis926178/C | 8a4da6f | lab_10_02_06/src/execute_modes.c | C | www.github.com/Denis926178/C/tree/main/lab_10_02_06/src/execute_modes.c | https://raw.githubusercontent.com/Denis926178/C/8a4da6f/lab_10_02_06/src/execute_modes.c | Denis926178/C 8a4da6f lab_10_02_06/src/execute_modes.c | true | 200 | 2,120 | #include "execute_modes.h"
int execute_multiply()
{
matrix_list_t *matrix_1 = NULL;
matrix_list_t *matrix_2 = NULL;
int code_return;
if ((code_return = read_matrix(&matrix_1)))
{
list_free(matrix_1);
list_free(matrix_2);
return code_return;
}
if ((... | 7 |
idcyberskills/lksn2024 | 1566117 | jeopardy/Pwn/Salah Saya Lagi/chall.c | C | www.github.com/idcyberskills/lksn2024/tree/main/jeopardy/Pwn/Salah Saya Lagi/chall.c | https://raw.githubusercontent.com/idcyberskills/lksn2024/1566117/jeopardy/Pwn/Salah%20Saya%20Lagi/chall.c | idcyberskills/lksn2024 1566117 jeopardy/Pwn/Salah Saya Lagi/chall.c | true | 200 | 3,154 | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<unistd.h>
#define MAX_SPOTS 10
#define MAX_PLATE_LENGTH 16
// gcc ./chall.c -o chall -g -Wl,-z,relro,-z,now -no-pie
// Function prototypes
void displayMenu();
void parkCar(char parkingSpots[MAX_SPOTS][MAX_PLATE_LENGTH]);
void removeCar(char parkingSpot... | 4 |
dda-cunh/CWserver | 85a9f89 | src/utils/ut_output.c | C | www.github.com/dda-cunh/CWserver/tree/main/src/utils/ut_output.c | https://raw.githubusercontent.com/dda-cunh/CWserver/85a9f89/src/utils/ut_output.c | dda-cunh/CWserver 85a9f89 src/utils/ut_output.c | true | 200 | 621 | #include "../../inc/cwserver.h"
void ut_putchar_fd(int fd, char c)
{
write(fd, &c, 1);
}
void ut_putendl_fd(int fd, const char *str)
{
if (!str || !*str)
return ;
write(fd, str, strlen(str));
ut_putchar_fd(fd, '\n');
}
void ut_puterror(const char *header, const char *str)
{
if (!str || !*str)
return ;
ut_p... | 2 |
kpatsakis/primevul4 | 2e77de6 | 4957.c | C | www.github.com/kpatsakis/primevul4/tree/main/4957.c | https://raw.githubusercontent.com/kpatsakis/primevul4/2e77de6/4957.c | kpatsakis/primevul4 2e77de6 4957.c | true | 200 | 972 | static int decide_stripe_size(struct btrfs_fs_devices *fs_devices,
struct alloc_chunk_ctl *ctl,
struct btrfs_device_info *devices_info)
{
struct btrfs_fs_info *info = fs_devices->fs_info;
/*
* Round down to number of usable stripes, devs_increment can be any
* number so we can't use round_down(... | 6 |
fujitsu/compiler-test-suite | ac5d63a | C/0023/0023_0036.c | C | www.github.com/fujitsu/compiler-test-suite/tree/main/C/0023/0023_0036.c | https://raw.githubusercontent.com/fujitsu/compiler-test-suite/ac5d63a/C/0023/0023_0036.c | fujitsu/compiler-test-suite ac5d63a C/0023/0023_0036.c | true | 200 | 388 | #include <stdlib.h>
#include <stdio.h>
int main()
{
long long int a;
a = 12LL | (12LL >> 2);
#if defined(big_endian)
if ( *((int *)&a)==0x0
&& *((((int *)&a))+1)==0xf ) {
#else
if ( *((int *)&a)==0xf
&& *((((int *)&a))+1)==0x0 ) {
#endif
printf("OK\n");
exit(0);
}
printf("%x %... | 5 |
Kishakul/alx-low_level_programming | d9c3813 | 0x07-pointers_arrays_strings/4-strpbrk.c | C | www.github.com/Kishakul/alx-low_level_programming/tree/main/0x07-pointers_arrays_strings/4-strpbrk.c | https://raw.githubusercontent.com/Kishakul/alx-low_level_programming/d9c3813/0x07-pointers_arrays_strings/4-strpbrk.c | Kishakul/alx-low_level_programming d9c3813 0x07-pointers_arrays_strings/4-strpbrk.c | true | 200 | 457 | /**
* _strpbrk - a function that searches a
* string for any of a set of bytes.
*
* @s: pointer to input string
* @accept: pointer to string we
* searching for in @s
*
* Return: pointer to the bytes in @s
* or NULL if no such byte is found
*/
char *_strpbrk(char *s, char *accept)
{
int i, j;... | 3 |
DevSaurabhGirme/Programs | f5d6ba9 | Logic/program59.c | C | www.github.com/DevSaurabhGirme/Programs/tree/main/Logic/program59.c | https://raw.githubusercontent.com/DevSaurabhGirme/Programs/f5d6ba9/Logic/program59.c | DevSaurabhGirme/Programs f5d6ba9 Logic/program59.c | true | 200 | 936 | #include<stdio.h>
#include<stdbool.h>
int Power(int iNo1,int iNo2)
{
register int iCnt = 0;
int iMult = 1;
for(iCnt = 1; iCnt <= iNo2; iCnt++)
{
iMult = iMult * iNo1;
}
return iMult;
}
bool CheckArmstrong(int iNo)
{
int iTemp = 0;
int iDigCnt = 0, iDigit = 0,iSum = 0;
if(iNo < 0)
... | 1 |
unfrankie/alx-low_level_programming | f939810 | 0x1A-hash_tables/4-hash_table_get.c | C | www.github.com/unfrankie/alx-low_level_programming/tree/main/0x1A-hash_tables/4-hash_table_get.c | https://raw.githubusercontent.com/unfrankie/alx-low_level_programming/f939810/0x1A-hash_tables/4-hash_table_get.c | unfrankie/alx-low_level_programming f939810 0x1A-hash_tables/4-hash_table_get.c | true | 200 | 582 | #include "hash_tables.h"
/**
* hash_table_get - retrieve a value associated with a key
* @ht: hash table to look into
* @key: key of the value to retrieve
* Return: value || NULL key not found
*/
char *hash_table_get(const hash_table_t *ht, const char *key)
{
unsigned long int index;
hash_node_t *temp;
... | 2 |
Anagha098/DSA-II | 4d886bc | BST_insert.c | C | www.github.com/Anagha098/DSA-II/tree/main/BST_insert.c | https://raw.githubusercontent.com/Anagha098/DSA-II/4d886bc/BST_insert.c | Anagha098/DSA-II 4d886bc BST_insert.c | true | 200 | 2,324 | #include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
struct node{
int data;
struct node *right;
struct node *left;
};
struct node* createNode(int data){
struct node *n;
n = (struct node*)malloc(sizeof(struct node));
n->data = data;
n->right = NULL;
n->left = NULL;
return(n);
}
... | 6 |
Saurabh-kumar123/assignment12 | f269667 | 8.c | C | www.github.com/Saurabh-kumar123/assignment12/tree/main/8.c | https://raw.githubusercontent.com/Saurabh-kumar123/assignment12/f269667/8.c | Saurabh-kumar123/assignment12 f269667 8.c | true | 200 | 306 | #include<stdio.h>
void even(int n)
{
if(n==1)
printf("1");
else
{
even(n/2);
printf("%d",n%2);
}
}
int main()
{
int n;
printf("enter a number\n");
scanf("%d",&n);
even(n);
return 0;
}
| 5 |
Gyanprem/2025_C_AND_CPP | 37636ee | geeksforgeeks/rotation_k.c | C | www.github.com/Gyanprem/2025_C_AND_CPP/tree/main/geeksforgeeks/rotation_k.c | https://raw.githubusercontent.com/Gyanprem/2025_C_AND_CPP/37636ee/geeksforgeeks/rotation_k.c | Gyanprem/2025_C_AND_CPP 37636ee geeksforgeeks/rotation_k.c | true | 200 | 915 | // C program to rotate
// Array by k elements
#include <stdio.h>
// Print array
void printArray(int arr[], int n)
{
int i;
for (i = 0; i < n; i++)
printf("%d ", arr[i]);
}
// Caculates greatest common divisor
int gcd(int a, int b)
{
if (b == 0)
return a;
else
return gcd(b, a %... | 1 |
ophiliatex/alx-low_level_programming | f2dd1bb | 0x13-more_singly_linked_lists/100-reverse_listint.c | C | www.github.com/ophiliatex/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/100-reverse_listint.c | https://raw.githubusercontent.com/ophiliatex/alx-low_level_programming/f2dd1bb/0x13-more_singly_linked_lists/100-reverse_listint.c | ophiliatex/alx-low_level_programming f2dd1bb 0x13-more_singly_linked_lists/100-reverse_listint.c | true | 200 | 372 | #include "lists.h"
/**
* reverse_listint - reverses a listint_t linked list
* @head: head node
*
* Return: a pointer
*/
listint_t *reverse_listint(listint_t **head)
{
listint_t *prev = NULL, *next = NULL;
if (!head || !*head)
return (NULL);
while (*head)
{
next = (*head)->next;
(*head)->next = prev;
prev = *he... | 3 |
MiriamHeirich/credit | 6516528 | credit.c.c | C | www.github.com/MiriamHeirich/credit/tree/main/credit.c.c | https://raw.githubusercontent.com/MiriamHeirich/credit/6516528/credit.c.c | MiriamHeirich/credit 6516528 credit.c.c | true | 200 | 1,832 | #include <stdio.h>
#include <stdlib.h>
#include <cs50.h>
#include <string.h>
int main(void)
{
long long cardNumber;
printf("Enter your card number: ");
scanf("%lld", &cardNumber);
// Convert the card number to a string
char cardString[17];
sprintf(cardString, "%lld", cardNumber);
int size... | 2 |
rswhipple/jsmalloc | cb8a9d0 | src/backend_heap/pagemap.c | C | www.github.com/rswhipple/jsmalloc/tree/main/src/backend_heap/pagemap.c | https://raw.githubusercontent.com/rswhipple/jsmalloc/cb8a9d0/src/backend_heap/pagemap.c | rswhipple/jsmalloc cb8a9d0 src/backend_heap/pagemap.c | true | 200 | 2,921 |
#include "../../inc/main.h"
/*
pagemap_create(t_pagemap** pagemap):
Uses a double pointer to update the global t_pagemap* g_pagemap variable.
The system call mmap() is used to retrieve memory for the dynamic heap.
The frontend_cache field is initialized with a pointer to a t_cache struct
created by frontend_cache_cr... | 6 |
Kaleb9301/alx-low_level_programming | dafd52c | 0x0E-structures_typedef/4-new_dog.c | C | www.github.com/Kaleb9301/alx-low_level_programming/tree/main/0x0E-structures_typedef/4-new_dog.c | https://raw.githubusercontent.com/Kaleb9301/alx-low_level_programming/dafd52c/0x0E-structures_typedef/4-new_dog.c | Kaleb9301/alx-low_level_programming dafd52c 0x0E-structures_typedef/4-new_dog.c | true | 200 | 853 | #include "dog.h"
#include <stddef.h>
#include <stdlib.h>
/**
* new_dog - creating new struct
* @name: name of new dog
* @age: age of the dog
* @owner: owner of the dog
*
* Return: new_dog
*/
dog_t *new_dog(char *name, float age, char *owner)
{
unsigned int ln, lo, i;
dog_t *dog;
if (name == NULL || owner ==... | 5 |
My-Learning-AC/Emb_Sys_IFX | 73b274b | Workspace/BareMetal_V5/main_Timer_Delay.c | C | www.github.com/My-Learning-AC/Emb_Sys_IFX/tree/main/Workspace/BareMetal_V5/main_Timer_Delay.c | https://raw.githubusercontent.com/My-Learning-AC/Emb_Sys_IFX/73b274b/Workspace/BareMetal_V5/main_Timer_Delay.c | My-Learning-AC/Emb_Sys_IFX 73b274b Workspace/BareMetal_V5/main_Timer_Delay.c | true | 200 | 1,702 | #include "user_cfg.h"
/* Timer period in milliseconds */
#define TIMER_PERIOD_MSEC 500U
uint8_t app_heap[512] __attribute__((section (".heap")));
uint8_t app_stack[1024] __attribute__((section (".stack")));
int main()
{
/* HF CLOCK divider init*/
Cy_SysClk_ClkHfSetDivider(0u); //0 - No Divider, 1 - DIV ... | 3 |
itseugen/c_library | 6dcb1b7 | printf/ft_printf.c | C | www.github.com/itseugen/c_library/tree/main/printf/ft_printf.c | https://raw.githubusercontent.com/itseugen/c_library/6dcb1b7/printf/ft_printf.c | itseugen/c_library 6dcb1b7 printf/ft_printf.c | true | 200 | 2,782 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_printf.c :+: :+: :+: ... | 1 |
Nymbuus/struct_car2 | 8d15e75 | car.c | C | www.github.com/Nymbuus/struct_car2/tree/main/car.c | https://raw.githubusercontent.com/Nymbuus/struct_car2/8d15e75/car.c | Nymbuus/struct_car2 8d15e75 car.c | true | 200 | 4,539 | /********************************************************************************
* car.c: Funktioner som har med bilobjekten att g�ra.
********************************************************************************/
#include "car.h"
// Deklarering av statiska funktioner.
static void car_change_transmission(s... | 6 |
kpatsakis/primevul4 | 2e77de6 | 57788.c | C | www.github.com/kpatsakis/primevul4/tree/main/57788.c | https://raw.githubusercontent.com/kpatsakis/primevul4/2e77de6/57788.c | kpatsakis/primevul4 2e77de6 57788.c | true | 200 | 1,358 | static int dccp_v6_send_response(const struct sock *sk, struct request_sock *req)
{
struct inet_request_sock *ireq = inet_rsk(req);
struct ipv6_pinfo *np = inet6_sk(sk);
struct sk_buff *skb;
struct in6_addr *final_p, final;
struct flowi6 fl6;
int err = -1;
struct dst_entry *dst;
memset(&fl6, 0, sizeof(fl6));
... | 5 |
Jnklss/JKNL | 3c64b90 | JKNL_Engine/src/JKNL/EntryPoint.h | C | www.github.com/Jnklss/JKNL/tree/main/JKNL_Engine/src/JKNL/EntryPoint.h | https://raw.githubusercontent.com/Jnklss/JKNL/3c64b90/JKNL_Engine/src/JKNL/EntryPoint.h | Jnklss/JKNL 3c64b90 JKNL_Engine/src/JKNL/EntryPoint.h | true | 200 | 321 | #pragma once
#ifdef JKNL_PLATFORM_WINDOWS
extern JKNL::Application* JKNL::CreateApplication();
int main(int argc, char** argv)
{
JKNL::Log::Init();
JKNL_CORE_INFO("Init Core Log");
JKNL_CLIENT_INFO("Init App Log");
auto app = JKNL::CreateApplication();
app->Run();
delete app;
}
#endif // JKNL_PLATFORM_WINDOWS... | 2 |
GKP96/LabAssignment | 178511e | SortingOfArrays.c | C | www.github.com/GKP96/LabAssignment/tree/main/SortingOfArrays.c | https://raw.githubusercontent.com/GKP96/LabAssignment/178511e/SortingOfArrays.c | GKP96/LabAssignment 178511e SortingOfArrays.c | true | 200 | 4,594 | # include<stdio.h>
// Merge function.
void merge(int arr[],int low,int high){
int mid = low+(high-low)/2;
int len1 = mid-low+1;
int len2 = high -mid;
int arr1[len1];
int arr2[len2];
int k = low;
for(int i = 0;i<len1;i++){
arr1[i] = arr[k++];
//k++;
}
for(int i = 0;i<... | 3 |
embed-coder/data_structures_and_algorithms | b5f3225 | standard-library-functions-c/15-stack.c | C | www.github.com/embed-coder/data_structures_and_algorithms/tree/main/standard-library-functions-c/15-stack.c | https://raw.githubusercontent.com/embed-coder/data_structures_and_algorithms/b5f3225/standard-library-functions-c/15-stack.c | embed-coder/data_structures_and_algorithms b5f3225 standard-library-functions-c/15-stack.c | true | 200 | 1,478 | // C program for array implementation of stack
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
// A structure to represent a stack
struct Stack
{
int top;
unsigned capacity;
int* array;
};
// function to create a stack of given capacity. It initializes size of
// stack as 0
struct Stack* create... | 1 |
AntoineZK/Tek1_Promo2026 | fd78627 | Semester_2/MUL/RPG/src/find_coord.c | C | www.github.com/AntoineZK/Tek1_Promo2026/tree/main/Semester_2/MUL/RPG/src/find_coord.c | https://raw.githubusercontent.com/AntoineZK/Tek1_Promo2026/fd78627/Semester_2/MUL/RPG/src/find_coord.c | AntoineZK/Tek1_Promo2026 fd78627 Semester_2/MUL/RPG/src/find_coord.c | true | 200 | 1,677 | /*
** EPITECH PROJECT, 2022
** rpg
** File description:
** find_coord
*/
#include "rpg.h"
int nb_line(char **map)
{
int nb_l = 0;
for (; map[nb_l]; nb_l++);
return (nb_l);
}
sfVector2f find_char(char **map, char character)
{
sfVector2f coord;
int break_val = 0;
coord.x = 0;
coord.y = 0;... | 5 |
Roshan-1-git/Roshan | 57c8a1f | forloop.c | C | www.github.com/Roshan-1-git/Roshan/tree/main/forloop.c | https://raw.githubusercontent.com/Roshan-1-git/Roshan/57c8a1f/forloop.c | Roshan-1-git/Roshan 57c8a1f forloop.c | true | 200 | 647 | #include<stdio.h>
int main()
{
int number = 0;
printf("Enter a positive integer:");
scanf_s("%d",&number);
if(number < 0)
{
printf("A negative number cannot have a factorial");
}
else if(number==0||number==1)
{
... | 2 |
Neutron-Inv/alx-low_level_programming | a6911bc | 0x05-pointers_arrays_strings/9-strcpy.c | C | www.github.com/Neutron-Inv/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/9-strcpy.c | https://raw.githubusercontent.com/Neutron-Inv/alx-low_level_programming/a6911bc/0x05-pointers_arrays_strings/9-strcpy.c | Neutron-Inv/alx-low_level_programming a6911bc 0x05-pointers_arrays_strings/9-strcpy.c | true | 200 | 279 | #include "main.h"
/**
* _strcpy - Copy a string
* @dest: Destination value
* @src: Source value
* Return: the pointer to dest
*/
char *_strcpy(char *dest, char *src)
{
int i;
for (i = 0; src[i] != '\0'; i++)
{
dest[i] = src[i];
}
dest[i++] = '\0';
return (dest);
}
| 6 |
Minime998/uni-code | 475e866 | cp216/fedo0350_a09/src/hash.c | C | www.github.com/Minime998/uni-code/tree/main/cp216/fedo0350_a09/src/hash.c | https://raw.githubusercontent.com/Minime998/uni-code/475e866/cp216/fedo0350_a09/src/hash.c | Minime998/uni-code 475e866 cp216/fedo0350_a09/src/hash.c | true | 200 | 2,324 | /*
-------------------------
File: File Name
Project: Project name
-------------------------
Author: Noah Fedosoff
ID: 200420350
Email: fedo0350@mylaurier.ca
Version YYYY-MM-DD
-------------------------
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "hash.h"
extern int htsize;
exter... | 3 |
mohammed-444/Traffic_Light_System | 8352e7d | Traffic_light_system/utilities/std_types.h | C | www.github.com/mohammed-444/Traffic_Light_System/tree/main/Traffic_light_system/utilities/std_types.h | https://raw.githubusercontent.com/mohammed-444/Traffic_Light_System/8352e7d/Traffic_light_system/utilities/std_types.h | mohammed-444/Traffic_Light_System 8352e7d Traffic_light_system/utilities/std_types.h | true | 200 | 936 | /******************************************
* Module: common - standard types
*
* File Name: std_types.h
*
* Description: typedefs for data types to meaningful easy
*
* Author: Mohammed Alaa
*
******************************************/
#ifndef STD_TYPES_H_
#define STD_TYPES_H_
/************************************... | 1 |
Santh0sh-d/Embedded_Linux_Homework | bf842ac | util.h | C | www.github.com/Santh0sh-d/Embedded_Linux_Homework/tree/main/util.h | https://raw.githubusercontent.com/Santh0sh-d/Embedded_Linux_Homework/bf842ac/util.h | Santh0sh-d/Embedded_Linux_Homework bf842ac util.h | true | 200 | 628 | #ifndef UTIL_H
#define UTIL_H
typedef enum socktype_s
{
SOCK_STREAM_S = 1,
SOCK_DGRAM_S
}socktype_t;
typedef enum operation {
READ = 1,
WRITE
}Opts_t;
typedef enum property {
FREQUENCY,
AMPLITUDE
}Prop_t;
typedef enum object {
OUT1,
OUT2
}Obj_t;
typedef struct message {
uint16_t... | 2 |
WJKPK/esp-nix | 5c2a38b | src/main/utilities/configs/timer_definitions.h | C | www.github.com/WJKPK/esp-nix/tree/main/src/main/utilities/configs/timer_definitions.h | https://raw.githubusercontent.com/WJKPK/esp-nix/5c2a38b/src/main/utilities/configs/timer_definitions.h | WJKPK/esp-nix 5c2a38b src/main/utilities/configs/timer_definitions.h | true | 200 | 814 | /*
* Copyright 2023 WJKPK
*
* 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 required by applicable law or agreed to in... | 5 |
righthalfplane/mystic | e31ae4d | mystic/mysticPlot/wMysticPlot/Show-Common/uLibX.c | C | www.github.com/righthalfplane/mystic/tree/main/mystic/mysticPlot/wMysticPlot/Show-Common/uLibX.c | https://raw.githubusercontent.com/righthalfplane/mystic/e31ae4d/mystic/mysticPlot/wMysticPlot/Show-Common/uLibX.c | righthalfplane/mystic e31ae4d mystic/mysticPlot/wMysticPlot/Show-Common/uLibX.c | true | 200 | 78,069 | #define EXTERN22 extern
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
#include <pthread.h>
#include <sys/types.h>
#include <sys/time.h>
#include <sys/stat.h>
#ifdef MAC_RESOURCES
#include <sys/attr.h>
#endif
#include <stdarg.h>
#include "Xappl.h"
#include "uLib.h"
#include "uDialog.h"
#i... | 6 |
kevin0x0/lexgen | 3679581 | kevfa/src/set/partition.c | C | www.github.com/kevin0x0/lexgen/tree/main/kevfa/src/set/partition.c | https://raw.githubusercontent.com/kevin0x0/lexgen/3679581/kevfa/src/set/partition.c | kevin0x0/lexgen 3679581 kevfa/src/set/partition.c | true | 200 | 2,026 | #include "kevfa/include/set/partition.h"
#include "kevfa/include/object_pool/partition_set_pool.h"
#include <stdlib.h>
KevPartitionUniverse kev_partition_universe_create(size_t element_number) {
KevPartitionUniverse universe = (KevPartitionUniverse)malloc(sizeof (KevPartitionElementType) * element_number);
return... | 1 |
spire-resilient-systems/spire | 7989c0e | relay_emulator/gen_event.c | C | www.github.com/spire-resilient-systems/spire/tree/main/relay_emulator/gen_event.c | https://raw.githubusercontent.com/spire-resilient-systems/spire/7989c0e/relay_emulator/gen_event.c | spire-resilient-systems/spire 7989c0e relay_emulator/gen_event.c | true | 200 | 5,622 | /*
* Spire.
*
* The contents of this file are subject to the Spire Open-Source
* License, Version 1.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.dsn.jhu.edu/spire/LICENSE.txt
*
* or in the file ``LICENSE.txt'... | 3 |
Sharmaji9211/trainning | 0cd23d0 | cpp/Assignments/Assignment 10/Question 1.c | C | www.github.com/Sharmaji9211/trainning/tree/main/cpp/Assignments/Assignment 10/Question 1.c | https://raw.githubusercontent.com/Sharmaji9211/trainning/0cd23d0/cpp/Assignments/Assignment%2010/Question%201.c | Sharmaji9211/trainning 0cd23d0 cpp/Assignments/Assignment 10/Question 1.c | true | 200 | 456 | #include<stdio.h>
int main (){
int arr[5],brr[5],i,j,visited=-1,count;
printf("Enter a array\n");
for(i=0;i<5;i++){
scanf("%d",&arr[i]);
}
for(i=0;i<5;i++){
count=1;
for(j=i+1;j<5;j++){
if(arr[i]==arr[j]){
count++;
brr[j]=visited;
}
}
if(brr[i]!=visited)
brr[i]=count;
... | 2 |
jonssond/c-basics | 94e535f | 18-04 - struct/struct3.c | C | www.github.com/jonssond/c-basics/tree/main/18-04 - struct/struct3.c | https://raw.githubusercontent.com/jonssond/c-basics/94e535f/18-04%20-%20struct/struct3.c | jonssond/c-basics 94e535f 18-04 - struct/struct3.c | true | 200 | 508 | #include <stdio.h>
#include <locale.h>
#include <string.h>
struct pessoa{
char nome[50], sexo[10];
int idade;
float altura;
};
int main(){
struct pessoa p;
printf("Digite seu nome: ");
gets(p.nome);
printf("Digite seu sexo: ");
gets(p.sexo);
printf("Digite sua idade: ");
scanf("... | 5 |
Kushagra-G/bareOS | 00bbc8a | bareOS/kernel/system/queue.c | C | www.github.com/Kushagra-G/bareOS/tree/main/bareOS/kernel/system/queue.c | https://raw.githubusercontent.com/Kushagra-G/bareOS/00bbc8a/bareOS/kernel/system/queue.c | Kushagra-G/bareOS 00bbc8a bareOS/kernel/system/queue.c | true | 200 | 1,422 | /* system/queue.c */
#include <barelib.h>
#include <thread.h>
#include <queue.h>
queue_t queue_table[NTHREADS];
queue_t ready_list;
void init_queues(void) {
int i;
ready_list.qnext = &ready_list;
ready_list.qprev = &ready_list;
for (i = 0; i < NTHREADS; i++) {
queue_table[i].key = ... | 6 |
santoshhalke/20Days20Problems_in_C | 41da555 | Day19.c | C | www.github.com/santoshhalke/20Days20Problems_in_C/tree/main/Day19.c | https://raw.githubusercontent.com/santoshhalke/20Days20Problems_in_C/41da555/Day19.c | santoshhalke/20Days20Problems_in_C 41da555 Day19.c | true | 200 | 5,887 | #include <stdio.h>
#include <stdlib.h>
// Day 19 - Implementation of Doubly Linked List
// Structure of node of doubly linked list
struct Node{
int data;
struct Node *previous;
struct Node *next;
};
// Function to print menu
void printMenu(){
printf("\n\t*****Menu*****\t\n");
printf(... | 1 |
rahelanna/C_practice | 8a2679b | practice01/swap_values_of_variables.c | C | www.github.com/rahelanna/C_practice/tree/main/practice01/swap_values_of_variables.c | https://raw.githubusercontent.com/rahelanna/C_practice/8a2679b/practice01/swap_values_of_variables.c | rahelanna/C_practice 8a2679b practice01/swap_values_of_variables.c | true | 200 | 440 | #include <stdio.h>
#include <string.h>
int main() {
char x[15] = "water"; //if the first string is longer that the second, it can cause an unexpected behaviour
char y[15] = "soda"; // solution: set the character arrays to the same size
char temp[12];
strcpy(temp, x);
s... | 3 |
duartelopes19/FEUP-RCOM | 17bf230 | tp2/include/info.h | C | www.github.com/duartelopes19/FEUP-RCOM/tree/main/tp2/include/info.h | https://raw.githubusercontent.com/duartelopes19/FEUP-RCOM/17bf230/tp2/include/info.h | duartelopes19/FEUP-RCOM 17bf230 tp2/include/info.h | true | 200 | 478 | #ifndef _INFO_H_
#define _INFO_H_
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX_STRING_LENGTH 256
typedef char info_string[MAX_STRING_LENGTH];
typedef struct info {
info_string user;
info_string password;
info_string host;
info_string path;
info_string filename;
int port;
} info;
... | 2 |
evansk6/alx-low_level_programming | 40c8498 | 0x07-pointers_arrays_strings/1-memcpy.c | C | www.github.com/evansk6/alx-low_level_programming/tree/main/0x07-pointers_arrays_strings/1-memcpy.c | https://raw.githubusercontent.com/evansk6/alx-low_level_programming/40c8498/0x07-pointers_arrays_strings/1-memcpy.c | evansk6/alx-low_level_programming 40c8498 0x07-pointers_arrays_strings/1-memcpy.c | true | 200 | 251 | #include "main.h"
/**
* _memcpy -> copies
* @dest: param
* @src: param
* @n: param
* Return: string copy
*/
char *_memcpy(char *dest, char *src, unsigned int n)
{
unsigned int a;
for (a = 0; a < n; a++)
dest[a] = src[a];
return (dest);
}
| 5 |
ScovottoDavide/distributed-trusted-computing-base | 99feb68 | TPA/PCR9Extend.c | C | www.github.com/ScovottoDavide/distributed-trusted-computing-base/tree/main/TPA/PCR9Extend.c | https://raw.githubusercontent.com/ScovottoDavide/distributed-trusted-computing-base/99feb68/TPA/PCR9Extend.c | ScovottoDavide/distributed-trusted-computing-base 99feb68 TPA/PCR9Extend.c | true | 200 | 4,233 | #include "PCR9Extend.h"
typedef struct tpm_pcr_extend_ctx tpm_pcr_extend_ctx;
struct tpm_pcr_extend_ctx {
size_t digest_spec_len;
tpm2_pcr_digest_spec *digest_spec;
};
bool openAKPub(const char *path, unsigned char **akPub) {
int len_file = 0;
char *data;
FILE *ak_pub = fopen(path, "r");
if(ak_pub == ... | 6 |
luizabheck/water-tank-control | aec5c0f | server.c | C | www.github.com/luizabheck/water-tank-control/tree/main/server.c | https://raw.githubusercontent.com/luizabheck/water-tank-control/aec5c0f/server.c | luizabheck/water-tank-control aec5c0f server.c | true | 200 | 20,900 | #include <stdio.h>
#include <string.h>
#include <sys/socket.h>
#include <arpa/inet.h>
#include <stdlib.h>
#include <pthread.h>
#include <unistd.h>
#include <math.h>
#include <SDL/SDL.h>
#include <time.h>
#include <mqueue.h>
// Macro ///////////////////////////////////
#define max(a, b) ((a) > (b) ? (a) : ... | 1 |
ChetanPatel1999/cbatch_630 | 2c3336d | oddevenwithretuentype.c | C | www.github.com/ChetanPatel1999/cbatch_630/tree/main/oddevenwithretuentype.c | https://raw.githubusercontent.com/ChetanPatel1999/cbatch_630/2c3336d/oddevenwithretuentype.c | ChetanPatel1999/cbatch_630 2c3336d oddevenwithretuentype.c | true | 200 | 299 | #include<stdio.h>
int even_odd(int num)
{
if(num%2==0)
{
return 1;
}
else{
return 0;
}
}
void main()
{
int n;
printf("enter a num :");
scanf("%d",&n);
if(even_odd(n))
{
printf("even");
}
else{
printf("odd");
}
} | 3 |
BenjaminLarger/Cub3D | 5ec4b1f | src_bonus/sprite_bonus.c | C | www.github.com/BenjaminLarger/Cub3D/tree/main/src_bonus/sprite_bonus.c | https://raw.githubusercontent.com/BenjaminLarger/Cub3D/5ec4b1f/src_bonus/sprite_bonus.c | BenjaminLarger/Cub3D 5ec4b1f src_bonus/sprite_bonus.c | true | 200 | 2,146 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* sprite_bonus.c :+: :+: :+: ... | 0 |
nzrnshannen/dsa-files | cc101a3 | Pre-mid/Runthrough/queue_ll(enq-deq).c | C | www.github.com/nzrnshannen/dsa-files/tree/main/Pre-mid/Runthrough/queue_ll(enq-deq).c | https://raw.githubusercontent.com/nzrnshannen/dsa-files/cc101a3/Pre-mid/Runthrough/queue_ll%28enq-deq%29.c | nzrnshannen/dsa-files cc101a3 Pre-mid/Runthrough/queue_ll(enq-deq).c | true | 200 | 1,784 | #include<stdio.h>
#include<stdbool.h>
#include<stdlib.h>
typedef struct node{
int data;
struct node *next;
}nodeType, *LIST;
typedef struct{
LIST Front;
LIST Rear;
}QUEUE;
void initQueue(QUEUE *Q);
void Enqueue(QUEUE *Q, int data);
void Dequeue(QUEUE *Q);
void Print(QUEUE Q);
void Clear(QUEUE *Q);
vo... | 2 |
Syrrhus/CSEshell | 7bb1a6a | source/system_programs/resusage.c | C | www.github.com/Syrrhus/CSEshell/tree/main/source/system_programs/resusage.c | https://raw.githubusercontent.com/Syrrhus/CSEshell/7bb1a6a/source/system_programs/resusage.c | Syrrhus/CSEshell 7bb1a6a source/system_programs/resusage.c | true | 200 | 523 | #include <sys/resource.h>
#include <stdio.h>
int execute(char **args){
struct rusage r_usage;
getrusage(RUSAGE_SELF,&r_usage);
printf("Memory usage: %ld kilobytes\n",r_usage.ru_maxrss);
getrusage(RUSAGE_CHILDREN, &r_usage);
printf(" User CPU time used: %ld.%06ld seconds\n", r_usage.ru_utime.tv_sec, r_usage.... | 5 |
danihelis/uva-solutions | 05d36d1 | volumes/16/1605.c | C | www.github.com/danihelis/uva-solutions/tree/main/volumes/16/1605.c | https://raw.githubusercontent.com/danihelis/uva-solutions/05d36d1/volumes/16/1605.c | danihelis/uva-solutions 05d36d1 volumes/16/1605.c | true | 200 | 778 | /* 1605
* Building for UN
* by Daniel Donadon
*/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include <assert.h>
#include <math.h>
#define NATION(x) ((x) < 26 ? 'A' + (x) : 'a' + (x) - 26)
/* Main function */
int main() {
int n, first = 1;
while (scanf("%d", &n) != EOF)... | 6 |
chcbaram/baram-qmk-8k-boot | ece8658 | src/ap/ap.c | C | www.github.com/chcbaram/baram-qmk-8k-boot/tree/main/src/ap/ap.c | https://raw.githubusercontent.com/chcbaram/baram-qmk-8k-boot/ece8658/src/ap/ap.c | chcbaram/baram-qmk-8k-boot ece8658 src/ap/ap.c | true | 200 | 1,991 | #include "ap.h"
#include "uf2/uf2.h"
#include "boot/boot.h"
static void bootUp(void);
static void cliUpdate(void);
void apInit(void)
{
#ifdef _USE_HW_CLI
cliOpen(HW_UART_CH_CLI, 115200);
cliLogo();
#endif
bootUp();
uf2Init();
usbInit();
bootInit();
}
void apMain(void)
{
uint32_t pre_time... | 1 |
clodbrasilino/chatgpt-codesec-analysis | 517ed6c | collected_code_3/round3/heal_0/problem-948.c | C | www.github.com/clodbrasilino/chatgpt-codesec-analysis/tree/main/collected_code_3/round3/heal_0/problem-948.c | https://raw.githubusercontent.com/clodbrasilino/chatgpt-codesec-analysis/517ed6c/collected_code_3/round3/heal_0/problem-948.c | clodbrasilino/chatgpt-codesec-analysis 517ed6c collected_code_3/round3/heal_0/problem-948.c | true | 200 | 669 | #include <stdio.h>
typedef struct {
int first;
int second;
int third;
} Tuple;
int getTupleItem(Tuple tuple, int index) {
switch(index) {
case 0:
return tuple.first;
case 1:
return tuple.second;
case 2:
return tuple.third;
default:
... | 0 |
CriDiba/esp32-puf-iot | 211e5b1 | main/src/console/console.c | C | www.github.com/CriDiba/esp32-puf-iot/tree/main/main/src/console/console.c | https://raw.githubusercontent.com/CriDiba/esp32-puf-iot/211e5b1/main/src/console/console.c | CriDiba/esp32-puf-iot 211e5b1 main/src/console/console.c | true | 200 | 9,641 | #include "console/console.h"
#include "core/core.h"
#include "crypto/crypto.h"
#include "define.h"
#include "puf_sec.h"
#include "freertos/FreeRTOS.h"
#include "freertos/task.h"
#include "esp_system.h"
#include "esp_wifi.h"
#include "esp_event.h"
#include "esp_log.h"
#include "nvs_flash.h"
#include "esp_netif.h"
#in... | 3 |
YASHKUMARBORATE/C_C-_Java_Programs | 7c6914b | C_C++_JAVA/File_Handling/program492.c | C | www.github.com/YASHKUMARBORATE/C_C-_Java_Programs/tree/main/C_C++_JAVA/File_Handling/program492.c | https://raw.githubusercontent.com/YASHKUMARBORATE/C_C-_Java_Programs/7c6914b/C_C%2B%2B_JAVA/File_Handling/program492.c | YASHKUMARBORATE/C_C-_Java_Programs 7c6914b C_C++_JAVA/File_Handling/program492.c | true | 200 | 646 | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <fcntl.h>
#include <string.h>
int main()
{
int fd = 0;
char Filename[30];
int iret = 0;
char buffer[100] = {'\0'};
int i = 0,iCount = 0;
printf("enter the file name that you want open:");
scanf("%s", Filename);
fd = open(... | 2 |
mongjju/KNU | 55858dc | hw3_client.c | C | www.github.com/mongjju/KNU/tree/main/hw3_client.c | https://raw.githubusercontent.com/mongjju/KNU/55858dc/hw3_client.c | mongjju/KNU 55858dc hw3_client.c | true | 200 | 2,780 | /*
* 컴퓨터학부 2020113766 박윤진
* Network Programming hw3_client.c
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <arpa/inet.h>
#include <sys/socket.h>
#define BUF_SIZE 100
#define SEQ_START 1000
typedef struct {
int seq; // SEQ num
int ack; ... | 5 |
cauaa-victorr/Faculdade | ae661ad | TECNICAS DE PROGRAMAÇÃO/lista4Ex003.c | C | www.github.com/cauaa-victorr/Faculdade/tree/main/TECNICAS DE PROGRAMAÇÃO/lista4Ex003.c | https://raw.githubusercontent.com/cauaa-victorr/Faculdade/ae661ad/TECNICAS%20DE%20PROGRAMA%C3%87%C3%83O/lista4Ex003.c | cauaa-victorr/Faculdade ae661ad TECNICAS DE PROGRAMAÇÃO/lista4Ex003.c | true | 200 | 1,007 | #include <stdio.h>
int comparar_strings(const char *str1, const char *str2) {
int i = 0;
while (str1[i] != '\0' && str2[i] != '\0') {
if (str1[i] < str2[i]) {
return -1;
} else if (str1[i] > str2[i]) {
return 1;
}
i++;
}
if (str1... | 7 |
EGCO112-progtech/bst-auuauu19697 | 76b8e0a | .ccls-cache/@home@runner@bst-auuauu19697/BST.h | C | www.github.com/EGCO112-progtech/bst-auuauu19697/tree/main/.ccls-cache/@home@runner@bst-auuauu19697/BST.h | https://raw.githubusercontent.com/EGCO112-progtech/bst-auuauu19697/76b8e0a/.ccls-cache/%40home%40runner%40bst-auuauu19697/BST.h | EGCO112-progtech/bst-auuauu19697 76b8e0a .ccls-cache/@home@runner@bst-auuauu19697/BST.h | true | 200 | 2,822 | // An integer binary search tree
struct TreeNode {
struct TreeNode *leftPtr; // pointer to left subtree
int data; // node value
struct TreeNode *rightPtr; // pointer to right subtree
}; // end structure treeNode
typedef struct TreeNode *TreeNodePtr; // synonym for Tre... | 4 |
philcrump/rpi-opclock | 0a71feb | src/clock.c | C | www.github.com/philcrump/rpi-opclock/tree/main/src/clock.c | https://raw.githubusercontent.com/philcrump/rpi-opclock/0a71feb/src/clock.c | philcrump/rpi-opclock 0a71feb src/clock.c | true | 200 | 2,089 | #include <stdio.h>
#include <stdint.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <pthread.h>
#include <signal.h>
#include <sys/time.h>
#include "main.h"
#include "clock.h"
#include "screen.h"
#include "graphics.h"
#include "font/font.h"
#include "util/timing.h"
extern c... | 1 |
SCENG/alx-low_level_programming | f645d55 | 0x04-more_functions_nested_loops/9-fizz_buzz.c | C | www.github.com/SCENG/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/9-fizz_buzz.c | https://raw.githubusercontent.com/SCENG/alx-low_level_programming/f645d55/0x04-more_functions_nested_loops/9-fizz_buzz.c | SCENG/alx-low_level_programming f645d55 0x04-more_functions_nested_loops/9-fizz_buzz.c | true | 200 | 445 | #include "main.h"
#include <stdio.h>
/**
* main - prints 1 - 100,
* multiples of 3 with fizz
* multiples of 5 with buzz
* multiples of 15 fizzbuzz
* Return: 0
*/
int main(void)
{
int i;
for (i = 1; i <= 100; i++)
{
if (i % 15 == 0)
printf("FizzBuzz");
else if (i % 3 == 0)
printf("Fizz");
else if... | 3 |
mohamed-ragab20/alx-low_level_programming | f6e2481 | 0x08-recursion/6-is_prime_number.c | C | www.github.com/mohamed-ragab20/alx-low_level_programming/tree/main/0x08-recursion/6-is_prime_number.c | https://raw.githubusercontent.com/mohamed-ragab20/alx-low_level_programming/f6e2481/0x08-recursion/6-is_prime_number.c | mohamed-ragab20/alx-low_level_programming f6e2481 0x08-recursion/6-is_prime_number.c | true | 200 | 568 | #include "main.h"
/**
* is_prime - check if the input integer is a prime number
*
* @n: input
* @divisor: input
*
* Return: is number prime or not
*/
int is_prime(int n, int divisor)
{
if (n == divisor)
return (1);
if (n % divisor == 0)
return (0);
return (is_prime(n, divisor + 1));
}
/**
*is_prime_num... | 0 |
BromicOuma/alx-low_level_programming | 9306ec6 | 0x02-functions_nested_loops/6-abs.c | C | www.github.com/BromicOuma/alx-low_level_programming/tree/main/0x02-functions_nested_loops/6-abs.c | https://raw.githubusercontent.com/BromicOuma/alx-low_level_programming/9306ec6/0x02-functions_nested_loops/6-abs.c | BromicOuma/alx-low_level_programming 9306ec6 0x02-functions_nested_loops/6-abs.c | true | 200 | 220 | #include <stdlib.h>
#include "main.h"
/**
* _abs - function to compute absolute value
*@n: takes an integer variable
*Return: returns the absolute value of a number
*/
int _abs(int n)
{
n = abs(n);
return (n);
}
| 2 |
Ebogen/alx-low_level_programming | d388b00 | 0x10-variadic_functions/0-sum_them_all.c | C | www.github.com/Ebogen/alx-low_level_programming/tree/main/0x10-variadic_functions/0-sum_them_all.c | https://raw.githubusercontent.com/Ebogen/alx-low_level_programming/d388b00/0x10-variadic_functions/0-sum_them_all.c | Ebogen/alx-low_level_programming d388b00 0x10-variadic_functions/0-sum_them_all.c | true | 200 | 415 | #include "variadic_functions.h"
/**
* sum_them_all - a function that returns the sum of all its parameters
* @n: amount of the argument
* Return: sum of the parameters
*/
int sum_them_all(const unsigned int n, ...)
{
va_list valist;
unsigned int i;
int sum = 0;
if (n == 0)
return (0);
va_start(valist, n)... | 5 |
BobyWoby/cs50-stuff | 5a6726e | Week3/plurality/plurality.c | C | www.github.com/BobyWoby/cs50-stuff/tree/main/Week3/plurality/plurality.c | https://raw.githubusercontent.com/BobyWoby/cs50-stuff/5a6726e/Week3/plurality/plurality.c | BobyWoby/cs50-stuff 5a6726e Week3/plurality/plurality.c | true | 200 | 2,175 | #include <cs50.h>
#include <stdio.h>
#include <string.h>
// Max number of candidates
#define MAX 9
// Candidates have name and vote count
typedef struct
{
string name;
int votes;
}
candidate;
// Array of candidates
candidate candidates[MAX];
// Number of candidates
int candidate_count;
// Function prototyp... | 7 |
worawichtitle/Physical-program | 7300fd4 | Lab_10_13_Linked_List_Create_DataNode.c | C | www.github.com/worawichtitle/Physical-program/tree/main/Lab_10_13_Linked_List_Create_DataNode.c | https://raw.githubusercontent.com/worawichtitle/Physical-program/7300fd4/Lab_10_13_Linked_List_Create_DataNode.c | worawichtitle/Physical-program 7300fd4 Lab_10_13_Linked_List_Create_DataNode.c | true | 200 | 867 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
// DataNode structure using typedef
typedef struct DataNode {
char* data;
struct DataNode* next;
} DataNode;
// Create a new DataNode
DataNode* createDataNode(char* data) {
// Allocate memory for the node
DataNode* newNode = (DataNode*)ma... | 4 |
lenkras/Minishell | fbe493d | initialize.c | C | www.github.com/lenkras/Minishell/tree/main/initialize.c | https://raw.githubusercontent.com/lenkras/Minishell/fbe493d/initialize.c | lenkras/Minishell fbe493d initialize.c | true | 200 | 2,034 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* initialize.c :+: :+: :+: ... | 1 |
divysoni03/begineer_programs | 0bb1022 | stringque/task18.c | C | www.github.com/divysoni03/begineer_programs/tree/main/stringque/task18.c | https://raw.githubusercontent.com/divysoni03/begineer_programs/0bb1022/stringque/task18.c | divysoni03/begineer_programs 0bb1022 stringque/task18.c | true | 200 | 944 | // 18. Write a program in C to find the frequency of characters .
#include<stdio.h>
#include<string.h>
void bubbleSort(char arr[], int n) {
int i, j;
char temp;
for (i = 0; i < n-1; i++) {
for (j = 0; j < n-i-1; j++) {
if(arr[j] > arr[j+1]) {
temp = arr[j];
... | 3 |
onyii-e/monty | 4409cac | main.c | C | www.github.com/onyii-e/monty/tree/main/main.c | https://raw.githubusercontent.com/onyii-e/monty/4409cac/main.c | onyii-e/monty 4409cac main.c | true | 200 | 846 | #include "monty.h"
#include <stdio.h>
/**
* main - interprets monty code from a file
* @argc: number of arguments
* @argv: monty file location
* Return: 0 on success execution, non-zero otherwise
*/
int main(int argc, char *argv[])
{
bus_t bus = {NULL, NULL, NULL, 0};
/* moved bus variable inside main */
cha... | 0 |
flucloxin500/Problem-Solving | ae18834 | Pattern Printing/All_Pattern-main/Pattern6.c | C | www.github.com/flucloxin500/Problem-Solving/tree/main/Pattern Printing/All_Pattern-main/Pattern6.c | https://raw.githubusercontent.com/flucloxin500/Problem-Solving/ae18834/Pattern%20Printing/All_Pattern-main/Pattern6.c | flucloxin500/Problem-Solving ae18834 Pattern Printing/All_Pattern-main/Pattern6.c | true | 200 | 506 | /*
*
**
***
****
*****
****
***
**
*
*/
#include<stdio.h>
#include<math.h>
int main (){
int row , col , n ;
scanf("%d",&n);
for ( row = 1 ; row <= n ; row++)
{
for ( col = 1 ; col <= row ; col++)
{
printf("*");//col also
}
printf("\n");
}
fo... | 6 |
andrea-cpu96/Useful-Srcs-ST7735 | 24664c8 | example_SD/Core/Inc/sd_ex.h | C | www.github.com/andrea-cpu96/Useful-Srcs-ST7735/tree/main/example_SD/Core/Inc/sd_ex.h | https://raw.githubusercontent.com/andrea-cpu96/Useful-Srcs-ST7735/24664c8/example_SD/Core/Inc/sd_ex.h | andrea-cpu96/Useful-Srcs-ST7735 24664c8 example_SD/Core/Inc/sd_ex.h | true | 200 | 1,894 | /*
* sd_ex.h
*
* Created on: Apr 27, 2024
* Author: andre
*/
#ifndef INC_SD_EX_H_
#define INC_SD_EX_H_
/*************** SETTINGS *****************/
// Frame sizes
#define FRAME_DIM_WD 100
#define FRAME_DIM_HT 100
// Frame division factor (in order to save RAM during run time I chose
// to subdivi... | 2 |
IlianDev/C-code | 9a58f86 | C/22.05.27 (func_pointers)/22.05.27-HW/04.c | C | www.github.com/IlianDev/C-code/tree/main/C/22.05.27 (func_pointers)/22.05.27-HW/04.c | https://raw.githubusercontent.com/IlianDev/C-code/9a58f86/C/22.05.27%20%28func_pointers%29/22.05.27-HW/04.c | IlianDev/C-code 9a58f86 C/22.05.27 (func_pointers)/22.05.27-HW/04.c | true | 200 | 2,551 | /*Задача 4. Напишете функция void sort_arr(void *A, int n, int dir, ftype fp),
където А е обикновен масив от цели числа,
n - размера на масива,
dir - посоката, в която да бъде сортиран масива,
ftype - указател към функция, която приема масив, неговия размер и в каква посока да бъде
сортиран входния масив.
ftype трябва ... | 5 |
jerellsworth/ssss | 38e8f14 | src/physics.c | C | www.github.com/jerellsworth/ssss/tree/main/src/physics.c | https://raw.githubusercontent.com/jerellsworth/ssss/38e8f14/src/physics.c | jerellsworth/ssss 38e8f14 src/physics.c | true | 200 | 9,122 | #include "bh.h"
Physics *_all_physics_objs[MAX_PHYSICS_OBJS];
Physics **ALL_PHYSICS_OBJS = _all_physics_objs;
s16 Physics_register(Physics *p) {
for (int i = 0; i < MAX_PHYSICS_OBJS; ++i) {
if (ALL_PHYSICS_OBJS[i] == NULL) {
ALL_PHYSICS_OBJS[i] = p;
return i;
}
}
re... | 7 |
Jhonburte2244/alx-low_level_programming | 15df61d | 0x07-pointers_arrays_strings/4-strpbrk.c | C | www.github.com/Jhonburte2244/alx-low_level_programming/tree/main/0x07-pointers_arrays_strings/4-strpbrk.c | https://raw.githubusercontent.com/Jhonburte2244/alx-low_level_programming/15df61d/0x07-pointers_arrays_strings/4-strpbrk.c | Jhonburte2244/alx-low_level_programming 15df61d 0x07-pointers_arrays_strings/4-strpbrk.c | true | 200 | 282 | #include "main.h"
/**
* _strpbrk - Entry point
* s: input
* accept: input
* Return: Always 0 (Success)
*/
char *_strpbrk(char *s, char *accept)
{
int x;
while (*s)
{
for (x = 0; accept[x]; x++)
{
if (*s == accept[x])
return (s);
}
s++;
}
return ('\0');
}
| 4 |
sadegh15khedry/ATmega16-Projects | 6ad5d1f | usart/usart1.c | C | www.github.com/sadegh15khedry/ATmega16-Projects/tree/main/usart/usart1.c | https://raw.githubusercontent.com/sadegh15khedry/ATmega16-Projects/6ad5d1f/usart/usart1.c | sadegh15khedry/ATmega16-Projects 6ad5d1f usart/usart1.c | true | 200 | 6,070 | /*******************************************************
This program was created by the
CodeWizardAVR V3.12 Advanced
Automatic Program Generator
� Copyright 1998-2014 Pavel Haiduc, HP InfoTech s.r.l.
http://www.hpinfotech.com
Project :
Version :
Date : 11/15/2020
Author :
Company :
Comments:
Chip type ... | 1 |
tmelquiades/ADS | 4981eb6 | p2/tda/N1L1/ED-lista2-questao25.c | C | www.github.com/tmelquiades/ADS/tree/main/p2/tda/N1L1/ED-lista2-questao25.c | https://raw.githubusercontent.com/tmelquiades/ADS/4981eb6/p2/tda/N1L1/ED-lista2-questao25.c | tmelquiades/ADS 4981eb6 p2/tda/N1L1/ED-lista2-questao25.c | true | 200 | 564 | /*
** Função: Ler coordenadas x e y de pontos no R2 e calcular sua
distancia da origem (0,0)
** Autor: Thaís Melquíades Macêdo - ADS P2 - TDA - TURMA B
** Data: 21/09/2023
** Observações: utilizei a biblioteca math.h para poder realizar o
calculo da raiz quadrada
*/
#include <stdio.h>
#include <math.h>
int main() {
... | 0 |
ahtamaral/concurrence | 71ca865 | lab1/lab1.c | C | www.github.com/ahtamaral/concurrence/tree/main/lab1/lab1.c | https://raw.githubusercontent.com/ahtamaral/concurrence/71ca865/lab1/lab1.c | ahtamaral/concurrence 71ca865 lab1/lab1.c | true | 200 | 2,978 | /* Disciplina: Programacao Concorrente */
/* Profa.: Silvana Rossetto */
/* Laboratório: 1 */
/* Codigo: "Hello World" usando threads em C */
#include <stdio.h>
#include <stdlib.h>
#include <pthread.h>
typedef struct {
int idThread, indexToIncrement;
int* vec;
} t_Args;
void *IncrementaVetor (void *arg) {
... | 3 |
mgala404/so_long | 8f6919b | src_bonus/checkers_bonus.c | C | www.github.com/mgala404/so_long/tree/main/src_bonus/checkers_bonus.c | https://raw.githubusercontent.com/mgala404/so_long/8f6919b/src_bonus/checkers_bonus.c | mgala404/so_long 8f6919b src_bonus/checkers_bonus.c | true | 200 | 1,854 | #include "so_long_bonus.h"
void ft_error(t_vb *tat)
{
int y;
y = 0;
while (tat->mappa[y])
{
free(tat->mappa[y]);
free(tat->tempura[y]);
y++;
}
free(tat->tempura);
free(tat->mappa);
ft_printf("%s", "cambia sta mappa coglione\n");
exit (0);
}
//tutti i bordi sono muri?
void cborders(t_vb *tat)
{
int x;... | 6 |
asif7695/c | 54127ff | 34_structute.c/5_array.c | C | www.github.com/asif7695/c/tree/main/34_structute.c/5_array.c | https://raw.githubusercontent.com/asif7695/c/54127ff/34_structute.c/5_array.c | asif7695/c 54127ff 34_structute.c/5_array.c | true | 200 | 509 | #include<stdio.h>
//global structure
struct person {
int age;
float salary;
};
int main(){
int i;
struct person per1[4];
for(i = 0 ; i <= 3 ; i++ ){
printf("person %d age : ",i+1);
scanf("%d",&per1[i].age);
printf("person %d salary : ",i+1);
scanf("%f",&per1[i].salary);
}
prin... | 2 |
fatihgoral/Cprojects | 38e6513 | karakterDizileri9/main.c | C | www.github.com/fatihgoral/Cprojects/tree/main/karakterDizileri9/main.c | https://raw.githubusercontent.com/fatihgoral/Cprojects/38e6513/karakterDizileri9/main.c | fatihgoral/Cprojects 38e6513 karakterDizileri9/main.c | true | 200 | 322 | #include <stdio.h>
#include <stdlib.h>
int main()
{
char name[30];
printf("lutfen isminizi giriniz:\n");
gets(name);
printf("%s",name);
char surname[40];
printf("lutfen soyadinizi giriniz");
fgets(name,sizeof(name),stdin); // daha guvenilir bir yontem
printf("%s",name);
return 0;
}
... | 7 |
jon5307/PS | 988e9d2 | 백준/Bronze/8958. OX퀴즈/OX퀴즈.c | C | www.github.com/jon5307/PS/tree/main/백준/Bronze/8958. OX퀴즈/OX퀴즈.c | https://raw.githubusercontent.com/jon5307/PS/988e9d2/%EB%B0%B1%EC%A4%80/Bronze/8958.%E2%80%85OX%ED%80%B4%EC%A6%88/OX%ED%80%B4%EC%A6%88.c | jon5307/PS 988e9d2 백준/Bronze/8958. OX퀴즈/OX퀴즈.c | true | 200 | 449 | #include <stdio.h>
int main() {
char word[80];
int a;
scanf("%d",&a);
for (int i = 0; i < a; i++){
int bonus = 0, score = 0;
scanf("%s",&word);
for (int j = 0;;j++){
if (word[j] == 'O'){
score += 1 + bonus;
bonus++;
}
else if (word[j] == 'X'){
... | 1 |
tksabum/Ga | 4b951c6 | Ga/SoundPlayer.h | C | www.github.com/tksabum/Ga/tree/main/Ga/SoundPlayer.h | https://raw.githubusercontent.com/tksabum/Ga/4b951c6/Ga/SoundPlayer.h | tksabum/Ga 4b951c6 Ga/SoundPlayer.h | true | 200 | 6,057 | #pragma once
#include "fmod.h"
#define SOUND_BGM_BEGIN 0
#define SOUND_BGM_MAIN 0
#define SOUND_BGM_ROOM1 1
#define SOUND_BGM_ROOM2 2
#define SOUND_BGM_ROOM3 3
#define SOUND_BGM_ROOM4 4
#define SOUND_BGM_SETTING 5
#define SOUND_BGM_VERYDANGERTIME 6
#define SOUND_BGM_MAINMENU 7
#define SOUND_BGM_ENDING 8
#define SOUND_... | 4 |
Suwumonster/c_learning | 982bd51 | Training/模拟实现memmove.c | C | www.github.com/Suwumonster/c_learning/tree/main/Training/模拟实现memmove.c | https://raw.githubusercontent.com/Suwumonster/c_learning/982bd51/Training/%E6%A8%A1%E6%8B%9F%E5%AE%9E%E7%8E%B0memmove.c | Suwumonster/c_learning 982bd51 Training/模拟实现memmove.c | true | 200 | 479 | #define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
void* my_memmove(void* des, void* sor, size_t count)
{
void* ret = des;
if ((char *)sor - (char *)des >= 0)
{
while (count--)
{
*(char*)des = *(char*)sor;
des = (char*)des + 1;
sor = (char*)sor + 1;
}
}
else
{
while (count--)
{
*((char*)d... | 5 |
AnastasiaT18/LAB1_SDA | f4717ed | LAB 1/prob15.c | C | www.github.com/AnastasiaT18/LAB1_SDA/tree/main/LAB 1/prob15.c | https://raw.githubusercontent.com/AnastasiaT18/LAB1_SDA/f4717ed/LAB%201/prob15.c | AnastasiaT18/LAB1_SDA f4717ed LAB 1/prob15.c | true | 200 | 2,665 | #include <stdio.h>
//The function which checks whether the elements are
//the same two by two
int checkpairs(int a, int b, int c, int d){
if (a==c && b==d){
return 1;
}
else {
return 0;
}
}
//The function which sort the elements descendingly
//if the elements ARE the same two by tw... | 0 |
Asochka/42_MiniShell | a79ec3d | executor/redirects.c | C | www.github.com/Asochka/42_MiniShell/tree/main/executor/redirects.c | https://raw.githubusercontent.com/Asochka/42_MiniShell/a79ec3d/executor/redirects.c | Asochka/42_MiniShell a79ec3d executor/redirects.c | true | 200 | 1,924 | #include "../includes/minishell.h"
void r_in(t_block_process *block, t_child *child)
{
t_file_info *tmp;
int i;
i = 0;
tmp = block->files;
while (i < block->files_count)
{
if (tmp[i].redirect_type == REDIR_FROM)
child->fd_in = open(tmp[i].file_name, O_RDONLY);
else if (tmp[i].redirect_type == HEREDOC_F... | 6 |
ktkuri132/SendMedicalCar_1 | 42d13a5 | SMC/USART/usart.c | C | www.github.com/ktkuri132/SendMedicalCar_1/tree/main/SMC/USART/usart.c | https://raw.githubusercontent.com/ktkuri132/SendMedicalCar_1/42d13a5/SMC/USART/usart.c | ktkuri132/SendMedicalCar_1 42d13a5 SMC/USART/usart.c | true | 200 | 4,371 | #include <usart.h>
#include <string.h>
#include <math.h>
uint8_t USART_array[20][200];
uint8_t Data[20][200];
uint8_t c;
void uart1_irq_handler();
void uart0_irq_handler();
void USART_Init()
{
uart_init(uart1, 115200);
gpio_set_function(4, GPIO_FUNC_UART);
gpio_set_function(5, GPIO_FUNC_UART);
//打... | 2 |
jeffersonchou/mt7921u | b1b96fb | mgmt/p2p_rlm.c | C | www.github.com/jeffersonchou/mt7921u/tree/main/mgmt/p2p_rlm.c | https://raw.githubusercontent.com/jeffersonchou/mt7921u/b1b96fb/mgmt/p2p_rlm.c | jeffersonchou/mt7921u b1b96fb mgmt/p2p_rlm.c | true | 200 | 39,012 | /******************************************************************************
* FILE DESCRIPTOR
*****************************************************************************/
/*
** Id: @(#) p2p_rlm.c@@
*/
/*! \file "p2p_rlm.c"
* \brief
*
*/
/********************************... | 7 |
Nachiket992/Function | 21dacc1 | Lecture 10.2/Question 8/QEIGHT.c | C | www.github.com/Nachiket992/Function/tree/main/Lecture 10.2/Question 8/QEIGHT.c | https://raw.githubusercontent.com/Nachiket992/Function/21dacc1/Lecture%2010.2/Question%208/QEIGHT.c | Nachiket992/Function 21dacc1 Lecture 10.2/Question 8/QEIGHT.c | true | 200 | 306 | #include <stdio.h>
#include <string.h>
void string(char s[]) {
int l=strlen(s);
printf("Length :- %d", l);
}
int main() {
printf("This is a function to print the length of a given string.\n\n");
char s[50];
fgets(s,50,stdin);
string(s);
printf("\n\nThank you.");
return 0;
} | 3 |
HimanshuMohanty-Git24/OOP-Lab | e3348af | 01Structures/Day1OOPLabQuestions/Q9.c | C | www.github.com/HimanshuMohanty-Git24/OOP-Lab/tree/main/01Structures/Day1OOPLabQuestions/Q9.c | https://raw.githubusercontent.com/HimanshuMohanty-Git24/OOP-Lab/e3348af/01Structures/Day1OOPLabQuestions/Q9.c | HimanshuMohanty-Git24/OOP-Lab e3348af 01Structures/Day1OOPLabQuestions/Q9.c | true | 200 | 1,306 | //9)Write a program to read the name, address,and salary of 5 employees using array of
//structure.Display information of each employee in alphabetical order of their name.
#include<stdio.h>
#include<string.h>
struct employee{
char name[30];
char address[100];
int salary;
};
void ShortName(struct employee s[]){
... | 1 |
google/pebble | 4051c5b | src/fw/apps/system_apps/weather/weather_app.c | C | www.github.com/google/pebble/tree/main/src/fw/apps/system_apps/weather/weather_app.c | https://raw.githubusercontent.com/google/pebble/4051c5b/src/fw/apps/system_apps/weather/weather_app.c | google/pebble 4051c5b src/fw/apps/system_apps/weather/weather_app.c | true | 200 | 8,978 | /*
* Copyright 2024 Google LLC
*
* 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 required by applicable law or agreed to i... | 4 |
ThomasRgl/OBHPC | 66cd79a | dgemm/main.c | C | www.github.com/ThomasRgl/OBHPC/tree/main/dgemm/main.c | https://raw.githubusercontent.com/ThomasRgl/OBHPC/66cd79a/dgemm/main.c | ThomasRgl/OBHPC 66cd79a dgemm/main.c | true | 200 | 3,284 | //
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <unistd.h>
//
#include "types.h"
//
#include "tools.h"
//
#include "kernels.h"
//
#define ALIGN64 64
//
#define MAX_SAMPLES 33
//
void run_benchmark(const ascii *title,
void (*kernel)(f64 *restrict, f64 *restrict, f64 *restric... | 5 |
castrothais/disciplina-estrutura-dados | 46e1e8e | 4-Pilhas e Filas/Atividades Ebook/3 - Pilha Struct/main.c | C | www.github.com/castrothais/disciplina-estrutura-dados/tree/main/4-Pilhas e Filas/Atividades Ebook/3 - Pilha Struct/main.c | https://raw.githubusercontent.com/castrothais/disciplina-estrutura-dados/46e1e8e/4-Pilhas%20e%20Filas/Atividades%20Ebook/3%20-%20Pilha%20Struct/main.c | castrothais/disciplina-estrutura-dados 46e1e8e 4-Pilhas e Filas/Atividades Ebook/3 - Pilha Struct/main.c | true | 200 | 1,328 | #include <stdio.h>
#include <stdlib.h>
#include<locale.h>
struct TipoPilha{
int info;
struct TipoPilha *prox;
};
typedef struct TipoPilha Pilha;
// inser��o de um elemento no topo da pilha
Pilha *insere(Pilha *atual, int v) {
Pilha *novo = (Pilha*)malloc(sizeof(Pilha));
if(novo == NULL) {
... | 0 |
MehdiAl-heloo/CP264 | 43cc76d | assignment/a5/myrecord_sllist.c | C | www.github.com/MehdiAl-heloo/CP264/tree/main/assignment/a5/myrecord_sllist.c | https://raw.githubusercontent.com/MehdiAl-heloo/CP264/43cc76d/assignment/a5/myrecord_sllist.c | MehdiAl-heloo/CP264 43cc76d assignment/a5/myrecord_sllist.c | true | 200 | 2,740 | /*
--------------------------------------------------
Project: a5q1
File: myrecord_sllist.c
Author: Mehdi Al-heloo
Version: 2025-02-14
--------------------------------------------------
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "myrecord_sllist.h"
/**
* Search si... | 2 |
oshaboy/rcfunge-with-ffi | d619c96 | ext/jstr.c | C | www.github.com/oshaboy/rcfunge-with-ffi/tree/main/ext/jstr.c | https://raw.githubusercontent.com/oshaboy/rcfunge-with-ffi/d619c96/ext/jstr.c | oshaboy/rcfunge-with-ffi d619c96 ext/jstr.c | true | 200 | 2,513 | /*
*******************************************************************
*** This software is copyright 1998-2008 by Michael H Riley ***
*** You have permission to use, modify, copy, and distribute ***
*** this software so long as this copyright notice is retained. ***
*** This software may not be used in com... | 3 |
NK2552003/C-Samples | 6a604c2 | num_tri_pattern.c | C | www.github.com/NK2552003/C-Samples/tree/main/num_tri_pattern.c | https://raw.githubusercontent.com/NK2552003/C-Samples/6a604c2/num_tri_pattern.c | NK2552003/C-Samples 6a604c2 num_tri_pattern.c | true | 200 | 365 | //making the numtri_pattern pattern
#include <stdio.h>
int main(void)
{
int r,c,i,j;
printf("Enter the number of rows: ");
scanf("%d",&r);
printf("Enter the numbers of columns:");
scanf("%d",&c);
for (j=1;j<=r;j++)
{
for (i=j;i>=1;i--)
{
printf("%d",j-1);
... | 4 |
islam003007/alx-low_level_programming | 8747c60 | 0x15-file_io/0-read_textfile.c | C | www.github.com/islam003007/alx-low_level_programming/tree/main/0x15-file_io/0-read_textfile.c | https://raw.githubusercontent.com/islam003007/alx-low_level_programming/8747c60/0x15-file_io/0-read_textfile.c | islam003007/alx-low_level_programming 8747c60 0x15-file_io/0-read_textfile.c | true | 200 | 711 | #include "main.h"
/**
* read_textfile - reads a text file then prints it.
*
* @filename: inputs file pathname.
* @letters: number of letters to read or write.
*
* Return: the actual read characters.
*/
ssize_t read_textfile(const char *filename, size_t letters)
{
int fp;
ssize_t i;
char *buffer;
if (!filen... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.