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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
FernandoPichardo21/Recursividad | 05d43ea | TorresHanoi.c | C | www.github.com/FernandoPichardo21/Recursividad/tree/main/TorresHanoi.c | https://raw.githubusercontent.com/FernandoPichardo21/Recursividad/05d43ea/TorresHanoi.c | FernandoPichardo21/Recursividad 05d43ea TorresHanoi.c | true | 200 | 744 | #include <stdio.h>
#include <conio.h>
int movimientos = 0;
void torresHanoi(int n, char origen, char destino, char auxiliar)
{
if (n == 1)
{
movimientos++;
printf("Mover disco 1 desde la varilla %c hasta la varilla %c\n", origen, destino);
}
else
{
torresHanoi(n - 1, orige... | 1 |
faken233/QG_Training | 5527551 | major/Week1/LinkList/linkList/Sources/function.c | C | www.github.com/faken233/QG_Training/tree/main/major/Week1/LinkList/linkList/Sources/function.c | https://raw.githubusercontent.com/faken233/QG_Training/5527551/major/Week1/LinkList/linkList/Sources/function.c | faken233/QG_Training 5527551 major/Week1/LinkList/linkList/Sources/function.c | true | 200 | 7,033 | #include <stdio.h>
#include <stdlib.h>
#include "linkedList.h"
Status InitList(LinkedList *L){
//判断*L是否为空节点
if(*L){
printf("错误\n");
return ERROR;
}
//分配
(*L) = (LinkedList) malloc(sizeof (LNode));
if((*L) == NULL){
//内存不足
printf("内寸不足\n");
return OVERFLO... | 2 |
Diogo13Antunes/42Cursus_Mini_Shell | d126713 | srcs/tree/tree.c | C | www.github.com/Diogo13Antunes/42Cursus_Mini_Shell/tree/main/srcs/tree/tree.c | https://raw.githubusercontent.com/Diogo13Antunes/42Cursus_Mini_Shell/d126713/srcs/tree/tree.c | Diogo13Antunes/42Cursus_Mini_Shell d126713 srcs/tree/tree.c | true | 200 | 1,828 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* tree.c :+: :+: :+: ... | 3 |
Vanisa23/alx-low_level_programming | 3a0d654 | 0x10-variadic_functions/1-print_numbers.c | C | www.github.com/Vanisa23/alx-low_level_programming/tree/main/0x10-variadic_functions/1-print_numbers.c | https://raw.githubusercontent.com/Vanisa23/alx-low_level_programming/3a0d654/0x10-variadic_functions/1-print_numbers.c | Vanisa23/alx-low_level_programming 3a0d654 0x10-variadic_functions/1-print_numbers.c | true | 200 | 632 | #include "variadic_functions.h"
#include <stdio.h>
#include <stdarg.h>
/**
* print_numbers - prints a varible number of intergers
* followed by a new line.
* @separator: the string printed between the numbers
* @n: number of integers passed to the function.
* @...: a variable number of integers to be printed.
*/
... | 5 |
ElysiaReaml/2024- | 7916259 | 2-2.c | C | www.github.com/ElysiaReaml/2024-/tree/main/2-2.c | https://raw.githubusercontent.com/ElysiaReaml/2024-/7916259/2-2.c | ElysiaReaml/2024- 7916259 2-2.c | true | 200 | 11,199 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define MAX_LEN 1000
// 字符串反转
void my_strrev(char *str) {
int i = 0, j = strlen(str) - 1;
while (i < j) {
char temp = str[i];
str[i] = str[j];
str[j] = temp;
i++;
j--;
}
}
... | 6 |
BrahimJandri/so_long | 848e1be | src/mandatory/check_all_map.c | C | www.github.com/BrahimJandri/so_long/tree/main/src/mandatory/check_all_map.c | https://raw.githubusercontent.com/BrahimJandri/so_long/848e1be/src/mandatory/check_all_map.c | BrahimJandri/so_long 848e1be src/mandatory/check_all_map.c | true | 200 | 2,913 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* check_all_map.c :+: :+: :+: ... | 1 |
Abdulazizgr/alx-low_level_programming | a5c6b2c | 0x1A-hash_tables/3-hash_table_set.c | C | www.github.com/Abdulazizgr/alx-low_level_programming/tree/main/0x1A-hash_tables/3-hash_table_set.c | https://raw.githubusercontent.com/Abdulazizgr/alx-low_level_programming/a5c6b2c/0x1A-hash_tables/3-hash_table_set.c | Abdulazizgr/alx-low_level_programming a5c6b2c 0x1A-hash_tables/3-hash_table_set.c | true | 200 | 1,215 | #include "hash_tables.h"
/**
* hash_table_set - adds an element to the hash table
* @ht: pointer to the hash table
* @key: key
* @value: value associated with the key
* Return: 1 if it succeeded, 0 otherwise
*/
int hash_table_set(hash_table_t *ht, const char *key, const char *value)
{
hash_node_t *new_node... | 7 |
W-nn/alx-low_level_programming | 4ae4e94 | 0x09-static_libraries/1-strncat.c | C | www.github.com/W-nn/alx-low_level_programming/tree/main/0x09-static_libraries/1-strncat.c | https://raw.githubusercontent.com/W-nn/alx-low_level_programming/4ae4e94/0x09-static_libraries/1-strncat.c | W-nn/alx-low_level_programming 4ae4e94 0x09-static_libraries/1-strncat.c | true | 200 | 431 | #include "main.h"
/**
* _strncat - a function that concatenates two strings
* with at most n bytes used from src
* @dest: input value
* @src: input value
* @n: input value
*
* Return: dest
*/
char *_strncat(char *dest, char *src, int n)
{
int x;
int y;
x = 0;
while (dest[x] != '\0')
{
x++;
}
y = 0... | 2 |
DavidCP-USC/AnalizadorLexicoPythonFlex | 39c8fbf | AnalizadorSintactico.c | C | www.github.com/DavidCP-USC/AnalizadorLexicoPythonFlex/tree/main/AnalizadorSintactico.c | https://raw.githubusercontent.com/DavidCP-USC/AnalizadorLexicoPythonFlex/39c8fbf/AnalizadorSintactico.c | DavidCP-USC/AnalizadorLexicoPythonFlex 39c8fbf AnalizadorSintactico.c | true | 200 | 607 | #include <stdio.h>
#include "AnalizadorLexico.h"
#include "definiciones.h"
#include <unistd.h>
#include <stdlib.h>
void analisisSintactico(){
tipoelem componenteLexico;
while(1){
componenteLexico = siguienteComponenteLexico();
if (componenteLexico.valor != EOF){
printf("Componente l... | 3 |
danielleoncio/THEHUXLEY | 1581a02 | Resolutions/24.c | C | www.github.com/danielleoncio/THEHUXLEY/tree/main/Resolutions/24.c | https://raw.githubusercontent.com/danielleoncio/THEHUXLEY/1581a02/Resolutions/24.c | danielleoncio/THEHUXLEY 1581a02 Resolutions/24.c | true | 200 | 419 | #include <stdio.h>
int fator(int x){
int fatorial;
if(x == 0){
fatorial = 1;
return fatorial;
}
else{
fatorial = x * fator(x-1);
return fatorial;
}
}
void ler(){
int result;
int x;
scanf("%d", &x);
if (x != -1){
result = fator(x);
printf("%d\n", resu... | 5 |
SP099/Adv_C | 7d6e693 | Assignments/sizeof.c | C | www.github.com/SP099/Adv_C/tree/main/Assignments/sizeof.c | https://raw.githubusercontent.com/SP099/Adv_C/7d6e693/Assignments/sizeof.c | SP099/Adv_C 7d6e693 Assignments/sizeof.c | true | 200 | 1,864 | /*
Name : Sushant Patil
date : 05/03/2023
Description : WAP to define a macro SIZEOF(x), without using sizeof operator
->Treat &x and &x + 1 as characters address.
->Both addresses difference will be sizeof x
Sample Execution: Test Case 1:
... | 1 |
Maliarte/PrograminC | d22eba6 | Strings/atividadeII-str-testeII.c | C | www.github.com/Maliarte/PrograminC/tree/main/Strings/atividadeII-str-testeII.c | https://raw.githubusercontent.com/Maliarte/PrograminC/d22eba6/Strings/atividadeII-str-testeII.c | Maliarte/PrograminC d22eba6 Strings/atividadeII-str-testeII.c | true | 200 | 2,333 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
//prototipo da função
int contabilizaStr (char string1[], char string2[]);
void removeCaracteres (char string[]);
void main()
{
char string1[30];
char string2[30];
//limpa buffer de entrada
fflush(stdin);
printf("Entre co... | 6 |
jahidul17/C_With_Programming_Hero | 2a2ef06 | Module 19/N. Sum of a Matrix/main.c | C | www.github.com/jahidul17/C_With_Programming_Hero/tree/main/Module 19/N. Sum of a Matrix/main.c | https://raw.githubusercontent.com/jahidul17/C_With_Programming_Hero/2a2ef06/Module%2019/N.%20Sum%20of%20a%20Matrix/main.c | jahidul17/C_With_Programming_Hero 2a2ef06 Module 19/N. Sum of a Matrix/main.c | true | 200 | 753 | #include <stdio.h>
#include <stdlib.h>
int main()
{
int row,col;
scanf("%d %d",&row,&col);
int a[row][col];
int b[row][col];
int c[row][col];
for(int i=0; i<row; i++)
{
for(int j=0; j<col; j++)
{
scanf("%d",&a[i][j]);
}
}
for(int i=0; i<row; i++... | 7 |
MinutePapillon/holbertonschool-low_level_programming | 9d74fa6 | pointers_arrays_strings/2-strncpy.c | C | www.github.com/MinutePapillon/holbertonschool-low_level_programming/tree/main/pointers_arrays_strings/2-strncpy.c | https://raw.githubusercontent.com/MinutePapillon/holbertonschool-low_level_programming/9d74fa6/pointers_arrays_strings/2-strncpy.c | MinutePapillon/holbertonschool-low_level_programming 9d74fa6 pointers_arrays_strings/2-strncpy.c | true | 200 | 339 | #include "main.h"
/**
* _strncpy - function that copies a string
* @dest: pointeur
* @src: pointeur
* @n: valeur
*
* Return: retourne dest
*/
char *_strncpy(char *dest, char *src, int n)
{
int i = 0;
while (i < n && src[i] != '\0')
{
dest[i] = src[i];
i++;
}
while (i < n)
{
dest[i] = '\0';
i++;
}... | 2 |
qp3072000/Mock | 29703b7 | header/controller/common.h | C | www.github.com/qp3072000/Mock/tree/main/header/controller/common.h | https://raw.githubusercontent.com/qp3072000/Mock/29703b7/header/controller/common.h | qp3072000/Mock 29703b7 header/controller/common.h | true | 200 | 433 | enum OptionMainMenu
{
EXIT_MENU,
SHOW_MUSIC,
CREATE_PLAYLIST,
ERASE_PLAYLIST,
SHOW_PLAYLIST,
UPDATE_PLAYLIST,
SHOW_MEDIAFILE,
PLAY
};
enum OptionUpdatePlaylist
{
EXIT_UPDATEPLAYLIST,
INSERT_MEDIAFILE,
ERASE_MEDIAFILE,
UPDATE_MEDIAFILE
};
enum OptionUpdateMediaFile
{
EXIT_UPDATEMEDIA,
TITLE... | 3 |
AVSystem/Anjay-stm32-azurertos-client | dfb4183 | Middlewares/Third_Party/trustedfirmware/secure_fw/services/secure_storage/flash/sst_flash.h | C | www.github.com/AVSystem/Anjay-stm32-azurertos-client/tree/main/Middlewares/Third_Party/trustedfirmware/secure_fw/services/secure_storage/flash/sst_flash.h | https://raw.githubusercontent.com/AVSystem/Anjay-stm32-azurertos-client/dfb4183/Middlewares/Third_Party/trustedfirmware/secure_fw/services/secure_storage/flash/sst_flash.h | AVSystem/Anjay-stm32-azurertos-client dfb4183 Middlewares/Third_Party/trustedfirmware/secure_fw/services/secure_storage/flash/sst_flash.h | true | 200 | 4,662 | /*
* Copyright (c) 2017-2019, Arm Limited. All rights reserved.
*
* SPDX-License-Identifier: BSD-3-Clause
*
*/
#ifndef __SST_FLASH_H__
#define __SST_FLASH_H__
#include <stdint.h>
#include "psa/protected_storage.h"
#include "flash_layout.h"
#ifdef __cplusplus
extern "C" {
#endif
/* Adjust to m... | 5 |
nitish-mahto/C-language | c590e77 | 21.c | C | www.github.com/nitish-mahto/C-language/tree/main/21.c | https://raw.githubusercontent.com/nitish-mahto/C-language/c590e77/21.c | nitish-mahto/C-language c590e77 21.c | true | 200 | 447 | // 21.To find out greater no from any three numbers.
#include<conio.h>
#include<stdio.h>
void main()
{
int a,b,c;
clrscr();
printf("Enter No1: ");
scanf("%d",&a);
printf("Enter No2: ");
scanf("%d",&b);
printf("Enter No3: ");
scanf("%d",&c);
if(a>b)
{
if(a>c)
{
printf("a is max");
}else
{
... | 6 |
Edward-163/MyC | 0cca0a7 | src/study_qsort.c | C | www.github.com/Edward-163/MyC/tree/main/src/study_qsort.c | https://raw.githubusercontent.com/Edward-163/MyC/0cca0a7/src/study_qsort.c | Edward-163/MyC 0cca0a7 src/study_qsort.c | true | 200 | 1,996 | #include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <ctype.h>
#include <stdbool.h>
#include "uthash.h"
/*
*/
int cmp(const void *a, const void *b)
{
return *(int *) a - *(int *) b;
}
int cmp2(const void *a, const void *b)
{
return *(char *) a - *(char *) b;
}
/// java是把元素... | 1 |
Thecanniestbadge/Walk-A-Thon | b0a6719 | Walk-A-Thon/Walk-A-Thon.c | C | www.github.com/Thecanniestbadge/Walk-A-Thon/tree/main/Walk-A-Thon/Walk-A-Thon.c | https://raw.githubusercontent.com/Thecanniestbadge/Walk-A-Thon/b0a6719/Walk-A-Thon/Walk-A-Thon.c | Thecanniestbadge/Walk-A-Thon b0a6719 Walk-A-Thon/Walk-A-Thon.c | true | 200 | 1,330 | // Programmer: Thecanniestbadge
// Date: 5/24/2023
// Program Name: Walk-A-Thon
// Description: Write a program to calculate the amount of money raised by a walk-a-thon. Ask the user for the number of miles walked (as an integer), and the amount pledged per mile (as a double).
// Then calculate and display the... | 7 |
raquelcostumerofernandez/organized | 29d4355 | lib/my/src/printf/parameter_utils.c | C | www.github.com/raquelcostumerofernandez/organized/tree/main/lib/my/src/printf/parameter_utils.c | https://raw.githubusercontent.com/raquelcostumerofernandez/organized/29d4355/lib/my/src/printf/parameter_utils.c | raquelcostumerofernandez/organized 29d4355 lib/my/src/printf/parameter_utils.c | true | 200 | 2,944 | /*
** EPITECH PROJECT, 2023
** parse_parameter.c
** File description:
** Parse data into struct
*/
#include <stdlib.h>
#include "../../include/my_printf.h"
#include "../../include/my.h"
static char flags_called(char const *format, parameter *p, int i)
{
int index = my_strchr_index("-+ #0", format[i]);
while ... | 2 |
mvenmo/cub3d | e7984f4 | src/get_and_check_map.c | C | www.github.com/mvenmo/cub3d/tree/main/src/get_and_check_map.c | https://raw.githubusercontent.com/mvenmo/cub3d/e7984f4/src/get_and_check_map.c | mvenmo/cub3d e7984f4 src/get_and_check_map.c | true | 200 | 3,062 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* get_and_check_map.c :+: :+: :+: ... | 3 |
memo-z/STARKS-TASKS | 7ed63f4 | week2/week2(2).c | C | www.github.com/memo-z/STARKS-TASKS/tree/main/week2/week2(2).c | https://raw.githubusercontent.com/memo-z/STARKS-TASKS/7ed63f4/week2/week2%282%29.c | memo-z/STARKS-TASKS 7ed63f4 week2/week2(2).c | true | 200 | 971 | #include <stdio.h>
#include <stdlib.h>
int main()
{
/*Write a login program in C that ask the user to enter his ID and his password,
if the ID is correct the system will ask the user to enter his password up to 3 times if he enters the password
right the systems welcomes him, if the three times are incorrect, ... | 5 |
sonalimerchia/CS598MEB-FinalProject | 29c7343 | src/cn3.c | C | www.github.com/sonalimerchia/CS598MEB-FinalProject/tree/main/src/cn3.c | https://raw.githubusercontent.com/sonalimerchia/CS598MEB-FinalProject/29c7343/src/cn3.c | sonalimerchia/CS598MEB-FinalProject 29c7343 src/cn3.c | true | 200 | 3,197 | #include <stdlib.h>
#include "cn3.h"
#include "utils.h"
#include "cn_profile.h"
int16_t cn3_distance(cn_profile_t* p1, cn_profile_t* p2, loci_t e, size_t num_loci) {
LOG("[cn3_distance]: e=%hu", e);
size_t n = num_loci;
chrom_t u = (*p1)[0];
chrom_t v = (*p2)[0];
loci_t B = umax(array_max(u, n),... | 1 |
adel-farukhshin/minishell | 92f0ef4 | inc/node.h | C | www.github.com/adel-farukhshin/minishell/tree/main/inc/node.h | https://raw.githubusercontent.com/adel-farukhshin/minishell/92f0ef4/inc/node.h | adel-farukhshin/minishell 92f0ef4 inc/node.h | true | 200 | 2,381 | #ifndef NODE_H
# define NODE_H
# include "lists.h"
# include "blists.h"
typedef enum e_node_type {
error_node = -1,
cmd_node = 0,
pipe_node = 1
} t_node_type;
typedef struct s_node t_node;
typedef const char *t_error_value;
typedef struct s_cmd_value {
t_list *args;
t_blist *redirs;
} t_cmd_value;
typedef s... | 6 |
DPDK/grout | 755f158 | modules/infra/datapath/gr_mbuf.h | C | www.github.com/DPDK/grout/tree/main/modules/infra/datapath/gr_mbuf.h | https://raw.githubusercontent.com/DPDK/grout/755f158/modules/infra/datapath/gr_mbuf.h | DPDK/grout 755f158 modules/infra/datapath/gr_mbuf.h | true | 200 | 2,698 | // SPDX-License-Identifier: BSD-3-Clause
// Copyright (c) 2024 Robin Jarry
#ifndef _GR_MBUF
#define _GR_MBUF
#include <gr_graph.h>
#include <rte_build_config.h>
#include <rte_mbuf.h>
#include <sys/queue.h>
#define GR_TRACE_ITEM_MAX_LEN 256
struct gr_trace_item {
STAILQ_ENTRY(gr_trace_item) next;
struct timespec... | 0 |
sgpx/notes | 7872d49 | knr-c/p123_find_pattern_in_line_example.c | C | www.github.com/sgpx/notes/tree/main/knr-c/p123_find_pattern_in_line_example.c | https://raw.githubusercontent.com/sgpx/notes/7872d49/knr-c/p123_find_pattern_in_line_example.c | sgpx/notes 7872d49 knr-c/p123_find_pattern_in_line_example.c | true | 200 | 909 | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <ctype.h>
#define LINE_LENGTH 1000
int x_getline(char *s, int len){
char *p = s, c;
while((c = getchar()) != '\n' && p - s < len) *p++ = c;
*p = '\0';
return p-s;
}
int main(int argc, char **argv){
if(argc == 1)
... | 2 |
jaburns/aoc2024 | d45de0a | src/day8.c | C | www.github.com/jaburns/aoc2024/tree/main/src/day8.c | https://raw.githubusercontent.com/jaburns/aoc2024/d45de0a/src/day8.c | jaburns/aoc2024 d45de0a src/day8.c | true | 200 | 2,678 | #include "main.h"
#if TEST_INPUTS
#define DAY8_SIZE 12
#else
#define DAY8_SIZE 50
#endif
#define DAY8_MAX_ANTENNAE_PER_FREQ 32
#define DAY8_SLOTS 75
enumdef(Day8Flag, u8){
DAY8_FLAG_PART_1 = 1,
DAY8_FLAG_PART_2 = 2,
};
structdef(Day8Frequency) {
StaticVec(ivec2, DAY8_MAX_ANTENNAE_PER_FRE... | 3 |
KaylaneLimaUnifesp/AED1 | cf2f3c8 | 2633.c | C | www.github.com/KaylaneLimaUnifesp/AED1/tree/main/2633.c | https://raw.githubusercontent.com/KaylaneLimaUnifesp/AED1/cf2f3c8/2633.c | KaylaneLimaUnifesp/AED1 cf2f3c8 2633.c | true | 200 | 781 | /*https://judge.beecrowd.com/pt/problems/view/2633*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct {
char carne[21];
int validade;
} Peca;
int compara(Peca *p1, Peca *p2) { return p1->validade - p2->validade; }
int main(void) {
Peca peca[10];
int numPecas;
while (scanf("%d",... | 7 |
Geethuprakash/DataStructure | d5bde04 | CIRCULARQUEUE.c | C | www.github.com/Geethuprakash/DataStructure/tree/main/CIRCULARQUEUE.c | https://raw.githubusercontent.com/Geethuprakash/DataStructure/d5bde04/CIRCULARQUEUE.c | Geethuprakash/DataStructure d5bde04 CIRCULARQUEUE.c | true | 200 | 1,921 | #include<stdio.h>
#define MAX 10
void enqueue();
void dequeue();
void search();
void display();
int c,queue[MAX],item,front=-1,rear=-1,i,n,flag=0;
void main(){
do {
printf("\n1)insertion\n2)deletion\n3)search\n4)display\n5)exit\n");
scanf("%d",&c);
switch(c){
case 1:
enqueue();
break;
case 2:
dequeue();
break;
case 3:... | 1 |
Rayyan-2704/Introduction-to-C | b133ad6 | Lab Task 10/Q1.c | C | www.github.com/Rayyan-2704/Introduction-to-C/tree/main/Lab Task 10/Q1.c | https://raw.githubusercontent.com/Rayyan-2704/Introduction-to-C/b133ad6/Lab%20Task%2010/Q1.c | Rayyan-2704/Introduction-to-C b133ad6 Lab Task 10/Q1.c | true | 200 | 634 | // Write a recursive function that takes an array and its size as input and prints all the elements.
#include<stdio.h>
void display_array(int arr[], int index, int size);
int main(){
int num;
printf("Enter the size of your array: ");
scanf("%d", &num);
int arr[num];
for(int i=0 ; i<num... | 6 |
Redi38/ucode | bdb5841 | Race01/src/mx_strnew.c | C | www.github.com/Redi38/ucode/tree/main/Race01/src/mx_strnew.c | https://raw.githubusercontent.com/Redi38/ucode/bdb5841/Race01/src/mx_strnew.c | Redi38/ucode bdb5841 Race01/src/mx_strnew.c | true | 200 | 261 | #include "header.h"
char *mx_strnew(const int size) {
char *memory = NULL;
int i = 0;
if (size < 0)
return NULL;
memory = (char *)malloc((size + 1) * sizeof(char));
while (i < size) {
memory[i] = '\0';
i++;
}
memory[i] = '\0';
return memory;
}
| 0 |
vHast/Practicing-with-C | d4a70cb | C-Files/IfStatements.c | C | www.github.com/vHast/Practicing-with-C/tree/main/C-Files/IfStatements.c | https://raw.githubusercontent.com/vHast/Practicing-with-C/d4a70cb/C-Files/IfStatements.c | vHast/Practicing-with-C d4a70cb C-Files/IfStatements.c | true | 200 | 303 | #include <stdio.h>
int main() {
int age;
printf("\nEnter your age: ");
scanf("%d", &age);
if(age >= 18) { // If some condition here is true, executes the block
printf("You are now signed up!\n");
} else {
printf("You are too young to sign up!\n");
}
return 0;
} | 4 |
AadhilAslam88/Udemy-Lang-C-Certificate | 15d4a6b | c udemy/Cstruc.c | C | www.github.com/AadhilAslam88/Udemy-Lang-C-Certificate/tree/main/c udemy/Cstruc.c | https://raw.githubusercontent.com/AadhilAslam88/Udemy-Lang-C-Certificate/15d4a6b/c%20udemy/Cstruc.c | AadhilAslam88/Udemy-Lang-C-Certificate 15d4a6b c udemy/Cstruc.c | true | 200 | 380 | #include<stdio.h>
struct person
{
char name[50];
int age;
float height;
};
int main(){
struct person p1;
strcpy(p1.name, "Smith");
p1.age = 25;
p1.height = 5.75;
printf("Person Information:\n");
printf("Name: %s\n", p1.name);
printf("Age: %d\n", p1.age);
... | 2 |
embedded-explorer/Exploring-SystemC | 3656c20 | MUX_4_TO_1/mux_4_to_1.h | C | www.github.com/embedded-explorer/Exploring-SystemC/tree/main/MUX_4_TO_1/mux_4_to_1.h | https://raw.githubusercontent.com/embedded-explorer/Exploring-SystemC/3656c20/MUX_4_TO_1/mux_4_to_1.h | embedded-explorer/Exploring-SystemC 3656c20 MUX_4_TO_1/mux_4_to_1.h | true | 200 | 967 | //----------------------------------------------------------------------
// 4 TO 1 Multiplexer Implementation
//----------------------------------------------------------------------
#include "systemc.h"
SC_MODULE(mux_4_to_1){
// Port Decleration
sc_in<sc_bv<4>> i_i; // 4-Bit Input
sc_in<sc_bv<2>> s_i; // 2-Bi... | 3 |
Vah3/minishell | 50e0ef6 | ft_export_utils1.c | C | www.github.com/Vah3/minishell/tree/main/ft_export_utils1.c | https://raw.githubusercontent.com/Vah3/minishell/50e0ef6/ft_export_utils1.c | Vah3/minishell 50e0ef6 ft_export_utils1.c | true | 200 | 2,358 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_export_utils1.c :+: :+: :+: ... | 5 |
mykhakos/42 | cc77648 | 23-so_long/lib/libft/ft_printf/utils_2.c | C | www.github.com/mykhakos/42/tree/main/23-so_long/lib/libft/ft_printf/utils_2.c | https://raw.githubusercontent.com/mykhakos/42/cc77648/23-so_long/lib/libft/ft_printf/utils_2.c | mykhakos/42 cc77648 23-so_long/lib/libft/ft_printf/utils_2.c | true | 200 | 1,972 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* utils_2.c :+: :+: :+: ... | 7 |
francoisfustin/HySelect_FastBuild | c0a50a3 | Spread/FpLibs/FPTOOLS/SRC/FPTOOL45.C | C | www.github.com/francoisfustin/HySelect_FastBuild/tree/main/Spread/FpLibs/FPTOOLS/SRC/FPTOOL45.C | https://raw.githubusercontent.com/francoisfustin/HySelect_FastBuild/c0a50a3/Spread/FpLibs/FPTOOLS/SRC/FPTOOL45.C | francoisfustin/HySelect_FastBuild c0a50a3 Spread/FpLibs/FPTOOLS/SRC/FPTOOL45.C | true | 200 | 10,440 | /* PortTool v2.2 FPTOOL45.C */
//
// FarPoint DrawText
//
#include "fptools.h"
#include "string.h"
#include "fptstr.h"
#define CHARS_MOVED(lpNext, lpPrev) (int)(lpNext - lpPrev)
LPTSTR FPLIB fpWordWrap (HDC hdc, LPFPWORDWRAP lpww, TEXTMETRIC FAR *lptm)
{
int... | 1 |
Khatwangadhareddy/My-C-programs | ec7b494 | pass.c | C | www.github.com/Khatwangadhareddy/My-C-programs/tree/main/pass.c | https://raw.githubusercontent.com/Khatwangadhareddy/My-C-programs/ec7b494/pass.c | Khatwangadhareddy/My-C-programs ec7b494 pass.c | true | 200 | 332 | #include<stdio.h>
void swap(int m ,int n);
void main() {
int a,b;
printf("Enter the values of a and b:");
scanf("%d%d",&a,&b);
printf("Before swapping a = %d\tb=%d",a,b);
swap(a,b);
printf("After swapping a = %d\t b = %d",a,b);
}
void swap(int m , int n ) {
int temp;
temp =m;
m = n;
n ... | 4 |
Pereiraigor1/Linguagem-C | be5446b | Cexerci/Exercicio Revisão/Questão5.c | C | www.github.com/Pereiraigor1/Linguagem-C/tree/main/Cexerci/Exercicio Revisão/Questão5.c | https://raw.githubusercontent.com/Pereiraigor1/Linguagem-C/be5446b/Cexerci/Exercicio%20Revis%C3%A3o/Quest%C3%A3o5.c | Pereiraigor1/Linguagem-C be5446b Cexerci/Exercicio Revisão/Questão5.c | true | 200 | 507 |
/* Quest�o 4 - vetor sem n�mero repetido 5,1,1,4,7,1,8,5*/
#include <stdio.h>
#include <locale.h>
main(){
setlocale(LC_ALL,"Portuguese");
int vetor[8]={5,1,1,4,7,1,8,5
},
i,j,vetorn[8],cont=0;
/*for(i=0;i<8;i++){
printf("Escreva o %d elemento do vetor: ",i+1);
scanf("%d",&vetor[i]);
}*/
for (i=0;i<8;i++){... | 2 |
BetaTester772/BAEKJOON_PS | 32bcd68 | BOJ_C99/10101.c | C | www.github.com/BetaTester772/BAEKJOON_PS/tree/main/BOJ_C99/10101.c | https://raw.githubusercontent.com/BetaTester772/BAEKJOON_PS/32bcd68/BOJ_C99/10101.c | BetaTester772/BAEKJOON_PS 32bcd68 BOJ_C99/10101.c | true | 200 | 318 | #include "stdio.h"
int main() {
int A, B, C;
scanf("%d\n%d\n%d", &A, &B, &C);
if (A + B + C != 180)
printf("Error");
else if (A == 60 && A == B && B == C)
printf("Equilateral");
else if (A != B && A != C && B != C)
printf("Scalene");
else
printf("Isosceles");
} | 3 |
abdulrhman-dev/color-sensor-readeer | 185d8fc | Core/Src/main.c | C | www.github.com/abdulrhman-dev/color-sensor-readeer/tree/main/Core/Src/main.c | https://raw.githubusercontent.com/abdulrhman-dev/color-sensor-readeer/185d8fc/Core/Src/main.c | abdulrhman-dev/color-sensor-readeer 185d8fc Core/Src/main.c | true | 200 | 10,461 | /* USER CODE BEGIN Header */
/**
******************************************************************************
* @file : main.c
* @brief : Main program body
******************************************************************************
* @attention
*
* Copyright (c) 2025 STMicroelectro... | 7 |
Sulphuratus/ProgEstruturada | 7d5c9f0 | Lista8_Resolucao/Ex01_Lista08.c | C | www.github.com/Sulphuratus/ProgEstruturada/tree/main/Lista8_Resolucao/Ex01_Lista08.c | https://raw.githubusercontent.com/Sulphuratus/ProgEstruturada/7d5c9f0/Lista8_Resolucao/Ex01_Lista08.c | Sulphuratus/ProgEstruturada 7d5c9f0 Lista8_Resolucao/Ex01_Lista08.c | true | 200 | 734 | #include<stdio.h>
#include<stdlib.h>
#include<time.h>
int main(){
int i, min, max, num, b;
int vet[100];
FILE *guarda_numero;
guarda_numero = fopen("Ex01_100NumerosAleatorios.txt","w");
srand(time(NULL));
min = -100;
max = 100;
for (i = 0; i < 100; i++)
{
vet[i] = min +... | 1 |
iurilandolt/philosophers | 5f6beab | philo/srcs/routine.c | C | www.github.com/iurilandolt/philosophers/tree/main/philo/srcs/routine.c | https://raw.githubusercontent.com/iurilandolt/philosophers/5f6beab/philo/srcs/routine.c | iurilandolt/philosophers 5f6beab philo/srcs/routine.c | true | 200 | 3,052 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* routine.c :+: :+: :+: ... | 4 |
LemonHaze420/UEFAStriker96 | d9538e4 | TEMP/VRAMPEEK.C | C | www.github.com/LemonHaze420/UEFAStriker96/tree/main/TEMP/VRAMPEEK.C | https://raw.githubusercontent.com/LemonHaze420/UEFAStriker96/d9538e4/TEMP/VRAMPEEK.C | LemonHaze420/UEFAStriker96 d9538e4 TEMP/VRAMPEEK.C | true | 200 | 2,060 | /*****************************************************************************
* *
* *
* VRAM peeker *
* *
* *
****************************************************************************... | 5 |
DunYin03/bit-sophomore-data-structure | 15a74f7 | Project1/数据结构与算法/第9章 动态规划/矩阵链乘问题.c | C | www.github.com/DunYin03/bit-sophomore-data-structure/tree/main/Project1/数据结构与算法/第9章 动态规划/矩阵链乘问题.c | https://raw.githubusercontent.com/DunYin03/bit-sophomore-data-structure/15a74f7/Project1/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/%E7%AC%AC9%E7%AB%A0%20%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/%E7%9F%A9%E9%98%B5%E9%93%BE%E4%B9%98%E9%97%AE%E9%A2%98.c | DunYin03/bit-sophomore-data-structure 15a74f7 Project1/数据结构与算法/第9章 动态规划/矩阵链乘问题.c | true | 200 | 1,027 | #define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
#include <string.h>
int a[2010], m[2010][2010], s[2010][2010];
const int inf = 2147483647;
void traceback(int i, int j)
{
if (i == j)
{
printf("A%d", i);
return;
}
printf("(");
traceback(i, s[i][j]);
traceback(s[i][j] + 1, j)... | 2 |
Enyel019/holbertonschool-low_level_programming | 485d157 | functions_nested_loops/4-isalpha.c | C | www.github.com/Enyel019/holbertonschool-low_level_programming/tree/main/functions_nested_loops/4-isalpha.c | https://raw.githubusercontent.com/Enyel019/holbertonschool-low_level_programming/485d157/functions_nested_loops/4-isalpha.c | Enyel019/holbertonschool-low_level_programming 485d157 functions_nested_loops/4-isalpha.c | true | 200 | 294 | #include "main.h"
/**
* _isalpha - checks to see if a letter is lowercasa or uppercase
*
*@c: the letter the function checks
*
*Return: 1 if c is lowercase, 0 otherwise
*/
int _isalpha(int c)
{
if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'))
return (1);
else
return (0);
}
| 3 |
KingvonfrmO/Learning_C | bd810f6 | 0x0D-structures_typedef/2-print_dog.c | C | www.github.com/KingvonfrmO/Learning_C/tree/main/0x0D-structures_typedef/2-print_dog.c | https://raw.githubusercontent.com/KingvonfrmO/Learning_C/bd810f6/0x0D-structures_typedef/2-print_dog.c | KingvonfrmO/Learning_C bd810f6 0x0D-structures_typedef/2-print_dog.c | true | 200 | 281 | #include "dog.h"
#include <stdio.h>
void print_dog(struct dog *d){
if (d == NULL){
return;
}
if (d -> name == NULL){
d -> name = "(nil)";
}
if (d -> owner == NULL){
d -> owner = "(nil)";
}
printf("Name: %s\nAge: %f\nOwner:%s\n", d -> name, d -> age, d ->owner);
} | 7 |
JoHyukJun/c | 7da4d14 | src/c-ex/13-file/ex1312.c | C | www.github.com/JoHyukJun/c/tree/main/src/c-ex/13-file/ex1312.c | https://raw.githubusercontent.com/JoHyukJun/c/7da4d14/src/c-ex/13-file/ex1312.c | JoHyukJun/c 7da4d14 src/c-ex/13-file/ex1312.c | true | 200 | 926 | #include <stdio.h>
#include <time.h>
char data_file[] = "text.txt";
void get_data(void) {
FILE *fp;
struct tm local;
if ((fp = fopen(data_file, "rb")) == NULL) {
printf("이 프로그램을 처음 실행하는군요.\n");
}
else {
fread(&local, sizeof(struct tm), 1, fp);
printf("이전 실행은 %d년 %d월 %d일... | 1 |
Krzysiek-K/Dread-source-drop | d094f08 | dreadmake/unused/005-colblit/dread_soft.c | C | www.github.com/Krzysiek-K/Dread-source-drop/tree/main/dreadmake/unused/005-colblit/dread_soft.c | https://raw.githubusercontent.com/Krzysiek-K/Dread-source-drop/d094f08/dreadmake/unused/005-colblit/dread_soft.c | Krzysiek-K/Dread-source-drop d094f08 dreadmake/unused/005-colblit/dread_soft.c | true | 200 | 11,682 |
#include "demo.h"
#include "data/frame.inc"
#define SOFT_MAX_VERT 10
#define SOFT_MAX_LINES 10
int cam_pos_x;
int cam_pos_y;
int cam_pos_z;
word cam_weapon_swing;
short lrc_cam_pos_x; // camera
short lrc_cam_pos_y;
short lrc_cam_pos_z;
short lrc_cam_angle;
word lrc_n_vert = 0; // ... | 4 |
egbuniwecemeka/alx-low_level_programming | e4b6816 | 0x01-variables_if_else_while/6-print_numberz.c | C | www.github.com/egbuniwecemeka/alx-low_level_programming/tree/main/0x01-variables_if_else_while/6-print_numberz.c | https://raw.githubusercontent.com/egbuniwecemeka/alx-low_level_programming/e4b6816/0x01-variables_if_else_while/6-print_numberz.c | egbuniwecemeka/alx-low_level_programming e4b6816 0x01-variables_if_else_while/6-print_numberz.c | true | 200 | 208 | #include <stdio.h>
/**
* main - Print all numbers from 0 to 9
*
* Return: Always 0 (Success)
*/
int main(void)
{
int i;
for (i = 0; i <= 9; i++)
{
putchar(i + 48);
}
putchar('\n');
return (0);
}
| 2 |
Justosky/alx-low_level_programming | 46e699c | 0x05-pointers_arrays_strings/3-puts.c | C | www.github.com/Justosky/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/3-puts.c | https://raw.githubusercontent.com/Justosky/alx-low_level_programming/46e699c/0x05-pointers_arrays_strings/3-puts.c | Justosky/alx-low_level_programming 46e699c 0x05-pointers_arrays_strings/3-puts.c | true | 200 | 290 | #include "main.h"
/**
*_puts - Prints a string to the standard output
*@str: The string which lenght should be returned
*Return: return lenght of str
*/
void _puts(char *str)
{
int string = 0;
while (str[string] != '\0')
{
_putchar(str[string]);
string++;
}
_putchar('\n');
}
| 5 |
oussamaDevOs/alx-low_level_programming | b1580ba | 0x04-more_functions_nested_loops/5-more_numbers.c | C | www.github.com/oussamaDevOs/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/5-more_numbers.c | https://raw.githubusercontent.com/oussamaDevOs/alx-low_level_programming/b1580ba/0x04-more_functions_nested_loops/5-more_numbers.c | oussamaDevOs/alx-low_level_programming b1580ba 0x04-more_functions_nested_loops/5-more_numbers.c | true | 200 | 374 | #include "main.h"
/**
* print_numbers - function that prints from 0 to 9
*
*
*/
void more_numbers(void)
{
int digit;
int line;
int num;
for (line = 0; line <= 10; line++)
{
for (digit = 0; digit <= 14; digit++)
{
num = digit;
if (num > 9)
{
putchar(1 + 48);
num = digit % 10;
}
... | 3 |
bhqv/coompiler | c6d09df | table.c | C | www.github.com/bhqv/coompiler/tree/main/table.c | https://raw.githubusercontent.com/bhqv/coompiler/c6d09df/table.c | bhqv/coompiler c6d09df table.c | true | 200 | 1,969 | #include <stdlib.h>
#include <string.h>
#include "memory.h"
#include "object.h"
#include "table.h"
#include "value.h"
#define TABLE_MAX_LOAD 0.75
void initTable(Table* table) {
table->count = 0;
table->capacity = 0;
table->entries = NULL;
}
void freeTable(Table* table) {
FREE_ARRAY(Entry, table->ent... | 7 |
ax12-8/ssp-s-Graduation-project | 392fbad | SYSTEM/usart/usart.c | C | www.github.com/ax12-8/ssp-s-Graduation-project/tree/main/SYSTEM/usart/usart.c | https://raw.githubusercontent.com/ax12-8/ssp-s-Graduation-project/392fbad/SYSTEM/usart/usart.c | ax12-8/ssp-s-Graduation-project 392fbad SYSTEM/usart/usart.c | true | 200 | 9,841 | #include "sys.h"
#include "usart.h"
//���ʹ��ucos,����������ͷ�ļ�����.
#if SYSTEM_SUPPORT_UCOS
#include "includes.h" //ucos ʹ��
#endif
//�������´���,֧��printf����,������Ҫѡ��use MicroLIB
#if 1
#pragma import(__use_no_semihosting)
//������Ҫ��֧�ֺ���
struct __FILE
{
int handle;
};
FILE __stdout;
//�... | 1 |
amaitou/42Exams | 18d979c | Exam Rank 2/Level 1/rev_print/rev_print.c | C | www.github.com/amaitou/42Exams/tree/main/Exam Rank 2/Level 1/rev_print/rev_print.c | https://raw.githubusercontent.com/amaitou/42Exams/18d979c/Exam%20Rank%202/Level%201/rev_print/rev_print.c | amaitou/42Exams 18d979c Exam Rank 2/Level 1/rev_print/rev_print.c | true | 200 | 303 |
#include <stdio.h>
#include <unistd.h>
int ft_strlen(char *s)
{
int i = 0;
while (s[i])
++i;
return (i);
}
int main(int ac, char **ag)
{
if (ac == 2)
{
char *p = ag[1];
int i = ft_strlen(p) - 1;
while (i >= 0)
{
write(1, &p[i], 1);
--i;
}
}
write(1, "\n", 1);
return (0);
}
| 4 |
amanpundir2/Code-Radar-Solutions | 69f22fa | Print Name, Age, and Hobby@@6788d5012db25efec946f945/code.c | C | www.github.com/amanpundir2/Code-Radar-Solutions/tree/main/Print Name, Age, and Hobby@@6788d5012db25efec946f945/code.c | https://raw.githubusercontent.com/amanpundir2/Code-Radar-Solutions/69f22fa/Print%20Name%2C%20Age%2C%20and%20Hobby%40%406788d5012db25efec946f945/code.c | amanpundir2/Code-Radar-Solutions 69f22fa Print Name, Age, and Hobby@@6788d5012db25efec946f945/code.c | true | 200 | 164 | #include <stdio.h>
int main(){
char A[1000],C[1000];
int B;
scanf("%s %d %s", A, &B, C);
printf("Name: %s\nAge: %d\nHobby: %s", A, B, C);
return 0;
} | 2 |
olin-electric-motorsports/olin-electric-motorsports | b1f3a5b | projects/btldr/libs/flash/flash.c | C | www.github.com/olin-electric-motorsports/olin-electric-motorsports/tree/main/projects/btldr/libs/flash/flash.c | https://raw.githubusercontent.com/olin-electric-motorsports/olin-electric-motorsports/b1f3a5b/projects/btldr/libs/flash/flash.c | olin-electric-motorsports/olin-electric-motorsports b1f3a5b projects/btldr/libs/flash/flash.c | true | 200 | 1,514 | #include "projects/btldr/libs/flash/api.h"
#include <avr/boot.h>
#include <avr/io.h>
#include <avr/pgmspace.h>
static uint16_t buf_address = 0;
void flash_write(uint8_t* data, uint8_t length, uint16_t* current_addr) {
uint8_t sreg = SREG;
for (int i = 0; i < length; i += 2) {
uint16_t wr_data = data... | 5 |
NadineSafwat/alx-low_level_programming | 5fd0d73 | 0x12-singly_linked_lists/3-add_node_end.c | C | www.github.com/NadineSafwat/alx-low_level_programming/tree/main/0x12-singly_linked_lists/3-add_node_end.c | https://raw.githubusercontent.com/NadineSafwat/alx-low_level_programming/5fd0d73/0x12-singly_linked_lists/3-add_node_end.c | NadineSafwat/alx-low_level_programming 5fd0d73 0x12-singly_linked_lists/3-add_node_end.c | true | 200 | 653 | #include "lists.h"
/**
* add_node_end - adds node to end of list
* @head: pointer to the node
* @str: string to be add to the node
*
* Return: the address of the new element, or NULL if it failed
*/
list_t *add_node_end(list_t **head, const char *str)
{
list_t *nwnd, *temp;
size_t nwstr;
nwnd = malloc(sizeo... | 3 |
Mary-jane1/alx-low_level_programming | 2c3477e | 0x05-pointers_arrays_strings/_putchar.c | C | www.github.com/Mary-jane1/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/_putchar.c | https://raw.githubusercontent.com/Mary-jane1/alx-low_level_programming/2c3477e/0x05-pointers_arrays_strings/_putchar.c | Mary-jane1/alx-low_level_programming 2c3477e 0x05-pointers_arrays_strings/_putchar.c | true | 200 | 264 | #include "main.h"
#include <unistd.h>
/**
*_putchar - write the character c to stdout
*@c:The character to print
*Return: On success 1
*On error, -1 is returned, and errno is set appropriately
*/
int _putchar(char c)
{
return (write(1, &c, 1));
}
| 7 |
AhmedShehab1/alx-low_level_programming | b39a939 | 0x18-dynamic_libraries/isalpha.c | C | www.github.com/AhmedShehab1/alx-low_level_programming/tree/main/0x18-dynamic_libraries/isalpha.c | https://raw.githubusercontent.com/AhmedShehab1/alx-low_level_programming/b39a939/0x18-dynamic_libraries/isalpha.c | AhmedShehab1/alx-low_level_programming b39a939 0x18-dynamic_libraries/isalpha.c | true | 200 | 341 | #include "main.h"
/**
* _isalpha - Checks Wether A Provided Ascii Value Corresponds To An Alphabetical Character (Wether Lower or Uppercase).
* @c: Ascii Value
*
* Return: 1 If True 0 Otherwise
*/
int _isalpha(int c)
{
if (((c >= 65) && (c <= 90)) || ((c >= 97) && (c <= 122)))
{
return 1;
}
else
{
... | 1 |
lm-leemoo/CSE3080-Data_structure | a42ba25 | cse3080_hw1_20211582/hw1_kmp.c | C | www.github.com/lm-leemoo/CSE3080-Data_structure/tree/main/cse3080_hw1_20211582/hw1_kmp.c | https://raw.githubusercontent.com/lm-leemoo/CSE3080-Data_structure/a42ba25/cse3080_hw1_20211582/hw1_kmp.c | lm-leemoo/CSE3080-Data_structure a42ba25 cse3080_hw1_20211582/hw1_kmp.c | true | 200 | 1,701 | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MAX_STR 10000000
#define MAX_PAT 3000
char str[MAX_STR];
char pat[MAX_PAT];
int failure[MAX_PAT];
int size_str = 0;
int size_pat = 0;
void fail(char* pattern);
int main(void) {
FILE* fp_str = fopen("string.txt", "r");
FILE* fp_pat = fopen("pattern.tx... | 4 |
TaVodic/Dev-Module-for-RSS | f8b5c3b | Software/ESP32_firmware/main/PMIC/PMIC.h | C | www.github.com/TaVodic/Dev-Module-for-RSS/tree/main/Software/ESP32_firmware/main/PMIC/PMIC.h | https://raw.githubusercontent.com/TaVodic/Dev-Module-for-RSS/f8b5c3b/Software/ESP32_firmware/main/PMIC/PMIC.h | TaVodic/Dev-Module-for-RSS f8b5c3b Software/ESP32_firmware/main/PMIC/PMIC.h | true | 200 | 1,180 | /*
Header file for PMIC handling
Radar Safety Sensor development module,
cretated by Martin Tavoda
Dept. of Radio Electronics, Brno University of Technology, Czechia
*/
#ifndef _PMIC_H_
#define _PMIC_H_
#define I2C_PORT I2C_NUM_0
#define I2C_SLAVE_ADDR 0x40
... | 5 |
librity/ft_libft | 44f3634 | sources/doubly_linked_lists/ft_dlstmap.c | C | www.github.com/librity/ft_libft/tree/main/sources/doubly_linked_lists/ft_dlstmap.c | https://raw.githubusercontent.com/librity/ft_libft/44f3634/sources/doubly_linked_lists/ft_dlstmap.c | librity/ft_libft 44f3634 sources/doubly_linked_lists/ft_dlstmap.c | true | 200 | 1,666 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_dlstmap.c :+: :+: :+: ... | 3 |
jingxie0425/DNN-Parallelization-with-GPU-CPU | b872080 | lide_c_dnnlayers/test_c/simCnn/driver.c | C | www.github.com/jingxie0425/DNN-Parallelization-with-GPU-CPU/tree/main/lide_c_dnnlayers/test_c/simCnn/driver.c | https://raw.githubusercontent.com/jingxie0425/DNN-Parallelization-with-GPU-CPU/b872080/lide_c_dnnlayers/test_c/simCnn/driver.c | jingxie0425/DNN-Parallelization-with-GPU-CPU b872080 lide_c_dnnlayers/test_c/simCnn/driver.c | true | 200 | 1,027 |
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include "lide_c_util.h"
#include "lide_c_simpleCnn_graph.h"
int main(int argc, char **argv) {
const char* WConvFile = "../../../extractParas/cnnWeight.csv";
const char* BConvFile = "../../../extractParas/cnnBias.csv";
const char* InputsFile = "... | 7 |
Dagilii/Soru1 | 4d8d17f | soru1.c | C | www.github.com/Dagilii/Soru1/tree/main/soru1.c | https://raw.githubusercontent.com/Dagilii/Soru1/4d8d17f/soru1.c | Dagilii/Soru1 4d8d17f soru1.c | true | 200 | 1,943 | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
void listyaz(int liste[],int uzunluk)
{
for (int i=0; i<uzunluk ;i++)
{
printf("%d\n",liste[i]);
}
}
void insertion(int liste[],int len) {
int gecici;
for(int i =0;i<len;i++){
for(int j=1;j<len;j++){
if(liste[j]<li... | 2 |
Tugume-Simon/alx-low_level_programming | 1d4e92f | 0x1A-hash_tables/0-hash_table_create.c | C | www.github.com/Tugume-Simon/alx-low_level_programming/tree/main/0x1A-hash_tables/0-hash_table_create.c | https://raw.githubusercontent.com/Tugume-Simon/alx-low_level_programming/1d4e92f/0x1A-hash_tables/0-hash_table_create.c | Tugume-Simon/alx-low_level_programming 1d4e92f 0x1A-hash_tables/0-hash_table_create.c | true | 200 | 563 | #include "hash_tables.h"
#include <stdlib.h>
/**
* hash_table_create - creates a hash table
* @size: size of the array
*
* Return: pointer to the newly created hash table
* Or NULL on failue
*/
hash_table_t *hash_table_create(unsigned long int size)
{
hash_table_t *table;
table = malloc(sizeof(hash_table_t));... | 4 |
Avi1928/C | 11f2a19 | digit_counter.c | C | www.github.com/Avi1928/C/tree/main/digit_counter.c | https://raw.githubusercontent.com/Avi1928/C/11f2a19/digit_counter.c | Avi1928/C 11f2a19 digit_counter.c | true | 200 | 244 | #include<stdio.h>
#include<conio.h>
void main()
{
int long no, i,c=0;
system("cls");
printf("Enter a number = ");
scanf("%d",&no);
while(no!=0)
{
no=no/10;
c++;
}
printf("%d",c);
} | 3 |
KemiGrace/alx-low_level_programming | 21d7ff8 | 0x06-pointers_arrays_strings/101-print_number.c | C | www.github.com/KemiGrace/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/101-print_number.c | https://raw.githubusercontent.com/KemiGrace/alx-low_level_programming/21d7ff8/0x06-pointers_arrays_strings/101-print_number.c | KemiGrace/alx-low_level_programming 21d7ff8 0x06-pointers_arrays_strings/101-print_number.c | true | 200 | 318 | #include "main.h"
/**
* print_number - This is a function that prints an integer.
* @n: integer params
*
* Return: 0 on success
*/
void print_number(int n)
{
unsigned int n1;
n1 = n;
if (n < 0)
{
_putchar('-');
n1 = -n;
}
if (n1 / 10 != 0)
{
print_number(n1 / 10);
}
_putchar((n1 % 10) + '0');
}
| 5 |
KitKatFarrelly/ESP32-Pet-Robot-Firmware | 6608b42 | UART_CMDS.h | C | www.github.com/KitKatFarrelly/ESP32-Pet-Robot-Firmware/tree/main/UART_CMDS.h | https://raw.githubusercontent.com/KitKatFarrelly/ESP32-Pet-Robot-Firmware/6608b42/UART_CMDS.h | KitKatFarrelly/ESP32-Pet-Robot-Firmware 6608b42 UART_CMDS.h | true | 200 | 250 | #ifndef H_UART_CMDS
#define H_UART_CMDS
typedef enum
{
not_specified,
flash,
msg_queue,
tof,
imu,
motor,
led,
mesh,
uart,
nav,
error,
dispatcher_max,
} dispatcher_type_t;
void UART_INIT(void);
#endif | 1 |
sammite/c_the_world | 9d1db98 | code_challenges/removeCharFromString.c | C | www.github.com/sammite/c_the_world/tree/main/code_challenges/removeCharFromString.c | https://raw.githubusercontent.com/sammite/c_the_world/9d1db98/code_challenges/removeCharFromString.c | sammite/c_the_world 9d1db98 code_challenges/removeCharFromString.c | true | 200 | 1,698 | // Got asked this and, well didn't do amazing, haha.
// here is what I banged out later. Still bad but I think it mostly works.
// technically you might want to realloc after this point but given that in the example (and potentially other scenarios)
// it is being allocated on the stack, that is potentially better left... | 7 |
pro2025/PROJECTS | 7767d7f | 12.C | C | www.github.com/pro2025/PROJECTS/tree/main/12.C | https://raw.githubusercontent.com/pro2025/PROJECTS/7767d7f/12.C | pro2025/PROJECTS 7767d7f 12.C | true | 200 | 334 | #include<stdio.h>
#include<conio.h>
void main()
{
int year;
clrscr();
printf("Enter the year:");
scanf("%d",&year);
if(year%400==0)
{
printf("Leap century year");
}
else if(year%4==0)
{
printf("leap year");
}
else if(year%100==0)
{
printf("Not a Leap year");
}
else
{
printf("Not a leap year");
}
... | 2 |
samuelerbo/alx-low_level_programming | 300bbe5 | 0x01-variables_if_else_while/3-print_alphabets.c | C | www.github.com/samuelerbo/alx-low_level_programming/tree/main/0x01-variables_if_else_while/3-print_alphabets.c | https://raw.githubusercontent.com/samuelerbo/alx-low_level_programming/300bbe5/0x01-variables_if_else_while/3-print_alphabets.c | samuelerbo/alx-low_level_programming 300bbe5 0x01-variables_if_else_while/3-print_alphabets.c | true | 200 | 315 | #include <stdio.h>
/**
* main - prints the alphabet in lowercase, and then in uppercase,
* followed by a new line
* Return: Always 0 (Success)
*/
int main(void)
{
int ch, C = 'A';
for (ch = 'a'; ch <= 'z'; ch++)
putchar(ch);
do {
putchar(C);
C++;
} while (C <= 'Z');
putchar('\n');
return (0);
}
| 4 |
Beshoysavitar/alx-low_level_programming | fbad1b4 | 0x13-more_singly_linked_lists/0-print_listint.c | C | www.github.com/Beshoysavitar/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/0-print_listint.c | https://raw.githubusercontent.com/Beshoysavitar/alx-low_level_programming/fbad1b4/0x13-more_singly_linked_lists/0-print_listint.c | Beshoysavitar/alx-low_level_programming fbad1b4 0x13-more_singly_linked_lists/0-print_listint.c | true | 200 | 308 | #include "lists.h"
/**
* print_listint - prints all the elements of a listint_t list
* @h: pointer to the head of the list
*
* Return: the number of nodes
*/
size_t print_listint(const listint_t *h)
{
size_t nod;
for (nod = 0; h; nod++)
{
printf("%d\n", h->n);
h = h->next;
}
return (nod);
}
| 5 |
devmt04/Vedika | 11e4a89 | parser/parser.h | C | www.github.com/devmt04/Vedika/tree/main/parser/parser.h | https://raw.githubusercontent.com/devmt04/Vedika/11e4a89/parser/parser.h | devmt04/Vedika 11e4a89 parser/parser.h | true | 200 | 854 | #ifndef PARSER_H
#define PARSER_H
#include "../lexer/lexer.h"
typedef enum {
TREE_PROGRAM = 0, //TOP-NODE
TREE_VARDECL = 1,
TREE_INITVAR = 2,
} TreeType;
typedef enum {
DT_NA = 0, // uninitialized
DT_INT = 1,
} DataTypes;
typedef enum {
LF_KW = 1,
LF_ID = 2,
LF_INTLIT = 3,
LF_ASOP_EQ = 4,
LF_AROP_PLU... | 3 |
Nilufa2850/Assignment-10 | a794c76 | Question-04.C | C | www.github.com/Nilufa2850/Assignment-10/tree/main/Question-04.C | https://raw.githubusercontent.com/Nilufa2850/Assignment-10/a794c76/Question-04.C | Nilufa2850/Assignment-10 a794c76 Question-04.C | true | 200 | 351 | /* Write a function to print first N natural numbers (TSRN) */
#include<stdio.h>
void natural (int);
int main ()
{
int x ;
printf("Enter a number : ");
scanf("%d",&x);
natural(x);
return 0;
}
void natural (int n)
{
int i ;
for(i=1 ; i<=n ; i++)
... | 1 |
Entropy675/Chase-Game-C | c3efd87 | chase.c | C | www.github.com/Entropy675/Chase-Game-C/tree/main/chase.c | https://raw.githubusercontent.com/Entropy675/Chase-Game-C/c3efd87/chase.c | Entropy675/Chase-Game-C c3efd87 chase.c | true | 200 | 6,576 | #include "defs.h"
// link in graphics, runner, main
/*
* void initChase(ChaseType* game)
* Initializes the game by creating the game object and setting up the ncurses library.
* out: ChaseType* game - pointer to the initialized game object
*/
void initChase(ChaseType* game)
{
srand( (unsigned)time(NULL)); // se... | 7 |
Stella-Kwon/Minishell | cfc2a09 | srcs/builtin/cd_utils.c | C | www.github.com/Stella-Kwon/Minishell/tree/main/srcs/builtin/cd_utils.c | https://raw.githubusercontent.com/Stella-Kwon/Minishell/cfc2a09/srcs/builtin/cd_utils.c | Stella-Kwon/Minishell cfc2a09 srcs/builtin/cd_utils.c | true | 200 | 2,743 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* cd_utils.c :+: :+: :+: ... | 2 |
Yaronsohn/rpchelps | e9c8f25 | mem.c | C | www.github.com/Yaronsohn/rpchelps/tree/main/mem.c | https://raw.githubusercontent.com/Yaronsohn/rpchelps/e9c8f25/mem.c | Yaronsohn/rpchelps e9c8f25 mem.c | true | 200 | 679 | /* %%COPYRIGHT%% */
/* INCLUDES *******************************************************************/
#if defined(_M_IA64) || defined(_M_AMD64)
#ifdef DEBUG
#include "debug\x64\rpchelp_h.h"
#else
#include "release\x64\rpchelp_h.h"
#endif
#else
#ifdef DEBUG
#include "debug\Win32\rpchelp_h.h"
#else
#includ... | 5 |
IgorYashch/linux-development | bcec9e0 | 02_TerminalProject/Show.c | C | www.github.com/IgorYashch/linux-development/tree/main/02_TerminalProject/Show.c | https://raw.githubusercontent.com/IgorYashch/linux-development/bcec9e0/02_TerminalProject/Show.c | IgorYashch/linux-development bcec9e0 02_TerminalProject/Show.c | true | 200 | 4,413 | #include <ncurses.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define DX 3
#define FREE_LINES LINES - 2 * DX - 2
#define FREE_COLS COLS - 2 * DX - 2
void get_text(FILE *f, char ***text, size_t *len_num, size_t **line_lens) {
char *line = NULL;
size_t n = 0;
size_t current_num = 0;
... | 3 |
RumataAst/miniRT | 64e40c6 | src/controls/control_shine.c | C | www.github.com/RumataAst/miniRT/tree/main/src/controls/control_shine.c | https://raw.githubusercontent.com/RumataAst/miniRT/64e40c6/src/controls/control_shine.c | RumataAst/miniRT 64e40c6 src/controls/control_shine.c | true | 200 | 2,496 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* control_shine.c :+: :+: :+: ... | 4 |
Mo2Hefny/binary_trees | dc96db8 | 113-bst_search.c | C | www.github.com/Mo2Hefny/binary_trees/tree/main/113-bst_search.c | https://raw.githubusercontent.com/Mo2Hefny/binary_trees/dc96db8/113-bst_search.c | Mo2Hefny/binary_trees dc96db8 113-bst_search.c | true | 200 | 500 | #include "binary_trees.h"
#include <stdio.h>
/**
* bst_search - searches for a value in
* a Binary Search Tree.
*
* @tree: pointer to the root node of the BST.
* @value: value to search in the tree.
*
* Return: pointer to the node containing a value.
*/
bst_t *bst_search(const bst_t *tree, int value)
{
bst_t *... | 7 |
AbdElRhmanArafa/simple_shell | 9381ec6 | builtin.c | C | www.github.com/AbdElRhmanArafa/simple_shell/tree/main/builtin.c | https://raw.githubusercontent.com/AbdElRhmanArafa/simple_shell/9381ec6/builtin.c | AbdElRhmanArafa/simple_shell 9381ec6 builtin.c | true | 200 | 3,083 | #include "main_shell.h"
/**
* find_builtin_function - checks if the command is a builtin
* @vars: variables
* Return: pointer to the function or NULL
*/
void (*find_builtin_function(vars_t *vars))(vars_t *vars)
{
unsigned int i;
builtins_t builtins[] = {
{"exit", run_exit},
{"env", show_env},
{"setenv", r... | 1 |
mobilinkd/Nucleo_RRC_Filter | 42e705d | Core/Src/stm32l4xx_hal_msp.c | C | www.github.com/mobilinkd/Nucleo_RRC_Filter/tree/main/Core/Src/stm32l4xx_hal_msp.c | https://raw.githubusercontent.com/mobilinkd/Nucleo_RRC_Filter/42e705d/Core/Src/stm32l4xx_hal_msp.c | mobilinkd/Nucleo_RRC_Filter 42e705d Core/Src/stm32l4xx_hal_msp.c | true | 200 | 13,624 |
/* USER CODE BEGIN Header */
/**
******************************************************************************
* @file stm32l4xx_hal_msp.c
* @brief This file provides code for the MSP Initialization
* and de-Initialization codes.
******************************************... | 2 |
mr-uttam/C-Discovery_Diaries | 80ac523 | P58-Power_Calculation.C | C | www.github.com/mr-uttam/C-Discovery_Diaries/tree/main/P58-Power_Calculation.C | https://raw.githubusercontent.com/mr-uttam/C-Discovery_Diaries/80ac523/P58-Power_Calculation.C | mr-uttam/C-Discovery_Diaries 80ac523 P58-Power_Calculation.C | true | 200 | 302 | #include<stdio.h>
int main(){
int a, b, power = 1;
printf("Enter base: ");
scanf("%d", &a);
printf("Enter power: ");
scanf("%d", &b);
for(int i = 1; i <= b; i++){
power = power * a;
}
printf("%d raised to the power %d is %d", a, b, power);
return 0;
}
| 0 |
Kasl0/SysOpy | 5b07c1e | Lab6/Zad1/common.h | C | www.github.com/Kasl0/SysOpy/tree/main/Lab6/Zad1/common.h | https://raw.githubusercontent.com/Kasl0/SysOpy/5b07c1e/Lab6/Zad1/common.h | Kasl0/SysOpy 5b07c1e Lab6/Zad1/common.h | true | 200 | 344 | #define MAX_CLIENTS 10
#define MSG_MAX_LEN 256
#define SERVER_QUEUE_KEY 0x1234
#define MSGSZ sizeof(struct msgbuf) - sizeof(long)
#define STOP_MSG 1
#define LIST_MSG 2
#define INIT_MSG 3
#define ALL_MSG 4
#define ONE_MSG 5
struct msgbuf {
long mtype;
int id;
int receiver;
char mtext[MSG_MAX_LEN];
c... | 5 |
O-Damilola/alx-low_level_programming | e2db930 | 0x13-more_singly_linked_lists/103-find_loop.c | C | www.github.com/O-Damilola/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/103-find_loop.c | https://raw.githubusercontent.com/O-Damilola/alx-low_level_programming/e2db930/0x13-more_singly_linked_lists/103-find_loop.c | O-Damilola/alx-low_level_programming e2db930 0x13-more_singly_linked_lists/103-find_loop.c | true | 200 | 687 | #include "lists.h"
/**
* find_listint_loop - finds the loop in a linked list.
* @head: head of a list.
*
* Return: the address of the node where the loop starts.
*/
listint_t *find_listint_loop(listint_t *head)
{
listint_t *venus;
listint_t *prev;
venus = head;
prev = head;
while (head && venus && venus->ne... | 6 |
pratiknapit/COMP2521 | 4ffb817 | lab-02/testQueue.c | C | www.github.com/pratiknapit/COMP2521/tree/main/lab-02/testQueue.c | https://raw.githubusercontent.com/pratiknapit/COMP2521/4ffb817/lab-02/testQueue.c | pratiknapit/COMP2521 4ffb817 lab-02/testQueue.c | true | 200 | 2,585 |
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include "Queue.h"
static void testQueue1(void);
static void testQueue2(void);
static void testQueue3(void);
static void testQueue4(void);
int main(void) {
testQueue1();
testQueue2();
testQueue3();
testQueue4();
printf("All tests passed!\n");
}
// te... | 3 |
UzokweJosiah/alx-low_level_programming | f597a8c | 0x02-functions_nested_loops/2-print_alphabet_x10.c | C | www.github.com/UzokweJosiah/alx-low_level_programming/tree/main/0x02-functions_nested_loops/2-print_alphabet_x10.c | https://raw.githubusercontent.com/UzokweJosiah/alx-low_level_programming/f597a8c/0x02-functions_nested_loops/2-print_alphabet_x10.c | UzokweJosiah/alx-low_level_programming f597a8c 0x02-functions_nested_loops/2-print_alphabet_x10.c | true | 200 | 439 | #include <stdio.h>
#include "main.h"
/**
* main - prints 10 times the alphabet in lowercase.
*
* Description:'This function prints 10 times the lowercase
* of alphabet followed by a newline'
*
* Return: Always 0 (success)
*/
void print_alphabet_x10(void)
{
int i;
char alphabet;
i = 0;
while (i < 10)
{
... | 4 |
ShenoudaMikhael/monty | 2617337 | _pstr.c | C | www.github.com/ShenoudaMikhael/monty/tree/main/_pstr.c | https://raw.githubusercontent.com/ShenoudaMikhael/monty/2617337/_pstr.c | ShenoudaMikhael/monty 2617337 _pstr.c | true | 200 | 402 | #include "monty.h"
/**
* _pstr - prints the char at the top of the stack
* @head: head
* @n: line number
* Return: Void
*/
void _pstr(stack_t **head, unsigned int n)
{
stack_t *tmp = *head;
(void)n;
while (tmp != NULL)
{
if ((tmp->n >= 65 && tmp->n <= 90) || (tmp->n >= 97 && tmp->n <= 122))
{
printf("... | 7 |
Zeb-0/alx-low_level_programming | 89ce814 | 0x13-more_singly_linked_lists/9-insert_nodeint.c | C | www.github.com/Zeb-0/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/9-insert_nodeint.c | https://raw.githubusercontent.com/Zeb-0/alx-low_level_programming/89ce814/0x13-more_singly_linked_lists/9-insert_nodeint.c | Zeb-0/alx-low_level_programming 89ce814 0x13-more_singly_linked_lists/9-insert_nodeint.c | true | 200 | 733 | #include "lists.h"
/**
* insert_nodeint_at_index - inserts node at nth position
* @head: pointer to the list
* @idx: position ofelement
* @n: value to insert
* Return: On success address of element, on failure NULL
*/
listint_t *insert_nodeint_at_index(listint_t **head, unsigned int idx, int n)
{
listint_t *ne... | 1 |
Oyiad23/printf | 99dcad9 | print_unsign.c | C | www.github.com/Oyiad23/printf/tree/main/print_unsign.c | https://raw.githubusercontent.com/Oyiad23/printf/99dcad9/print_unsign.c | Oyiad23/printf 99dcad9 print_unsign.c | true | 200 | 659 | #include "main.h"
/**
* unsigned_spec - Handles the %u specifier
* @king: Arguments
*
* Return: Integer
*/
int unsigned_spec(va_list king)
{
unsigned int w = va_arg(king, unsigned int);
return (print_unsign(w));
}
/**
* print_unsign - Prints an integer
* @n: The integer to print
*
* Return: The number of ... | 0 |
Zaeem-Raza/C-Programming | bd33b01 | 15.File Handling/Fwrite/main.c | C | www.github.com/Zaeem-Raza/C-Programming/tree/main/15.File Handling/Fwrite/main.c | https://raw.githubusercontent.com/Zaeem-Raza/C-Programming/bd33b01/15.File%20Handling/Fwrite/main.c | Zaeem-Raza/C-Programming bd33b01 15.File Handling/Fwrite/main.c | true | 200 | 208 | #include <stdio.h>
#include <stdlib.h>
#define SIZE 100
int main(void)
{
FILE *fp;
fp=fopen("test.txt","w");
if(fp)
{
int a[10]={1,4,6,3,2,5,7,8,9,10};
fwrite(&a,sizeof(int),1,fp);
}
}
| 5 |
jozyjozy/philosophers | 39a0e4a | sources/ft_utils2.c | C | www.github.com/jozyjozy/philosophers/tree/main/sources/ft_utils2.c | https://raw.githubusercontent.com/jozyjozy/philosophers/39a0e4a/sources/ft_utils2.c | jozyjozy/philosophers 39a0e4a sources/ft_utils2.c | true | 200 | 2,533 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_utils2.c :+: :+: :+: ... | 6 |
teapotd/algolib | 1f79b16 | src/graphs/directed_mst.h | C | www.github.com/teapotd/algolib/tree/main/src/graphs/directed_mst.h | https://raw.githubusercontent.com/teapotd/algolib/1f79b16/src/graphs/directed_mst.h | teapotd/algolib 1f79b16 src/graphs/directed_mst.h | true | 200 | 1,666 | #pragma once
#include "../template.h"
#include "../structures/find_union_undo.h"
#include <ext/pb_ds/priority_queue.hpp>
struct Edge {
int a, b;
ll w;
bool operator<(Edge r) const {
return w > r.w;
}
};
// Find directed minimum spanning tree
// rooted at vertex `root`; O(m log n)
// Returns weight of found span... | 3 |
PiratesAhoy/new-horizons | f8dcb67 | PROGRAM/DIALOGS/Prisoned_dialog.c | C | www.github.com/PiratesAhoy/new-horizons/tree/main/PROGRAM/DIALOGS/Prisoned_dialog.c | https://raw.githubusercontent.com/PiratesAhoy/new-horizons/f8dcb67/PROGRAM/DIALOGS/Prisoned_dialog.c | PiratesAhoy/new-horizons f8dcb67 PROGRAM/DIALOGS/Prisoned_dialog.c | true | 200 | 23,902 | void ProcessDialogEvent()
{
ref NPChar;
aref Link, NextDiag;
DeleteAttribute(&Dialog,"Links");
makeref(NPChar,CharacterRef);
makearef(Link, Dialog.Links);
makearef(NextDiag, NPChar.Dialog);
string NPC_Meeting, blade, gun, cuirass, reload_locator;
string sLogTitle, sLogEntry;
int iNation = sti(NPChar.nation);... | 4 |
ArmDeveloperEcosystem/rnnoise-examples-for-pico-2 | c76615b | examples/usb_pdm_microphone/main.c | C | www.github.com/ArmDeveloperEcosystem/rnnoise-examples-for-pico-2/tree/main/examples/usb_pdm_microphone/main.c | https://raw.githubusercontent.com/ArmDeveloperEcosystem/rnnoise-examples-for-pico-2/c76615b/examples/usb_pdm_microphone/main.c | ArmDeveloperEcosystem/rnnoise-examples-for-pico-2 c76615b examples/usb_pdm_microphone/main.c | true | 200 | 3,423 | //
// SPDX-FileCopyrightText: Copyright 2024 Arm Limited and/or its affiliates <open-source-office@arm.com>
// SPDX-License-Identifier: BSD-3-Clause
//
#include <pico/stdlib.h>
#include <pico/multicore.h>
#include <hardware/gpio.h>
#include <hardware/pwm.h>
#include "pico/pdm_microphone.h"
#include "usb_microphone.h... | 1 |
Se1TECH/C-language-Programs | 9ac52ca | print array using pointer.c | C | www.github.com/Se1TECH/C-language-Programs/tree/main/print array using pointer.c | https://raw.githubusercontent.com/Se1TECH/C-language-Programs/9ac52ca/print%20array%20using%20pointer.c | Se1TECH/C-language-Programs 9ac52ca print array using pointer.c | true | 200 | 442 | //Question: Write a Program in C to Print Array Values using Pointer
#include<stdio.h>
#include<conio.h>
void main()
{
int n,i;
float *p,a[20];
clrscr();
printf("How many elements you want in array :- ");
scanf("%d",&n);
printf("Enter your %d elements :- \n",n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
}
p=&a[... | 7 |
Melek78/alx-low_level_programming | 33e2848 | 0x0E-structures_typedef/1-init_dog.c | C | www.github.com/Melek78/alx-low_level_programming/tree/main/0x0E-structures_typedef/1-init_dog.c | https://raw.githubusercontent.com/Melek78/alx-low_level_programming/33e2848/0x0E-structures_typedef/1-init_dog.c | Melek78/alx-low_level_programming 33e2848 0x0E-structures_typedef/1-init_dog.c | true | 200 | 631 | #include <stdio.h>
#include <stdlib.h>
#include "dog.h"
/**
* init_dog - a function that initialize a variable of type struct dog
* @d: a pointer to the struct dog
* @name: a string 'name'
* @age: a float 'age'
* @owner: a string 'owner'
* Return: returns nothing
*/
void init_dog(struct dog *d, char *name, float age, ... | 2 |
YusungAN/algorithm-study | b6d710e | 백준/Gold/1918. 후위 표기식/후위 표기식.c | C | www.github.com/YusungAN/algorithm-study/tree/main/백준/Gold/1918. 후위 표기식/후위 표기식.c | https://raw.githubusercontent.com/YusungAN/algorithm-study/b6d710e/%EB%B0%B1%EC%A4%80/Gold/1918.%E2%80%85%ED%9B%84%EC%9C%84%E2%80%85%ED%91%9C%EA%B8%B0%EC%8B%9D/%ED%9B%84%EC%9C%84%E2%80%85%ED%91%9C%EA%B8%B0%EC%8B%9D.c | YusungAN/algorithm-study b6d710e 백준/Gold/1918. 후위 표기식/후위 표기식.c | true | 200 | 970 | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
char stack[101];
int top = -1;
void push(char v) {
if (top < 999) {
stack[++top] = v;
}
else {
printf("push fail");
}
}
char pop() {
if (top > -1) {
return stack[top--];
}
else {
return 0;
}
}
int main() ... | 6 |
desnetgirum/alx-low_level_programming | fe7de0a | 0x06-pointers_arrays_strings/5-string_toupper.c | C | www.github.com/desnetgirum/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/5-string_toupper.c | https://raw.githubusercontent.com/desnetgirum/alx-low_level_programming/fe7de0a/0x06-pointers_arrays_strings/5-string_toupper.c | desnetgirum/alx-low_level_programming fe7de0a 0x06-pointers_arrays_strings/5-string_toupper.c | true | 200 | 321 | #include "main.h"
/**
* * string_toupper - Changes all lowercase letters to uppercase
* * @p: The string will be modified
* *
* * Return: char var
*/
char *string_toupper(char *p)
{
int a = 0;
while (p[a])
{
if (p[a] >= 97 && p[a] <= 122)
{
p[a] -= 32;
}
a++;
}
return (p);
}
... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.