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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
nicktalm/minitalk | 7d9313c | minitalk/src/server.c | C | www.github.com/nicktalm/minitalk/tree/main/minitalk/src/server.c | https://raw.githubusercontent.com/nicktalm/minitalk/7d9313c/minitalk/src/server.c | nicktalm/minitalk 7d9313c minitalk/src/server.c | true | 200 | 1,710 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* server.c :+: :+: :+: ... | 6 |
ACreTeam/ac-decomp | cb8d8bc | include/ac_npc_guide2.h | C | www.github.com/ACreTeam/ac-decomp/tree/main/include/ac_npc_guide2.h | https://raw.githubusercontent.com/ACreTeam/ac-decomp/cb8d8bc/include/ac_npc_guide2.h | ACreTeam/ac-decomp cb8d8bc include/ac_npc_guide2.h | true | 200 | 850 | #ifndef AC_NPC_GUIDE2_H
#define AC_NPC_GUIDE2_H
#include "types.h"
#include "m_actor.h"
#include "ac_npc.h"
#ifdef __cplusplus
extern "C" {
#endif
typedef struct npc_guide2_actor_s NPC_GUIDE2_ACTOR;
typedef void (*aNG2_PROC)(NPC_GUIDE2_ACTOR*, GAME_PLAY*);
struct npc_guide2_actor_s {
NPC_ACTOR npc_class;
i... | 5 |
DenBelik/home_c | 7a34658 | HW10/task17.c | C | www.github.com/DenBelik/home_c/tree/main/HW10/task17.c | https://raw.githubusercontent.com/DenBelik/home_c/7a34658/HW10/task17.c | DenBelik/home_c 7a34658 HW10/task17.c | true | 200 | 1,374 | // Пары соседних символов
// В файле .txt записаны символы. Необходимо разработать функцию, которая меняет местами пары соседних символов не обращая внимание на символы пробел.
// Если количество символов нечетно (пробелы не считаем), то последний символ не меняем. Результат записать в файл .txt.
#include <stdio.h>
... | 7 |
yinshilongger/stm32_f103zet6_study | 7288934 | pal/stm32f10x_pal_exti.h | C | www.github.com/yinshilongger/stm32_f103zet6_study/tree/main/pal/stm32f10x_pal_exti.h | https://raw.githubusercontent.com/yinshilongger/stm32_f103zet6_study/7288934/pal/stm32f10x_pal_exti.h | yinshilongger/stm32_f103zet6_study 7288934 pal/stm32f10x_pal_exti.h | true | 200 | 3,009 | /**
******************************************************************************
* @file stm32f10x_pal_exti.h
* @author 铁头山羊
* @version V 1.0.0
* @date 2023年4月24日
* @brief 外部中断驱动程序
******************************************************************************
* @attention
* Copyright (c) 20... | 0 |
biapacifico/pc-1 | dddddfe | strings/12.c | C | www.github.com/biapacifico/pc-1/tree/main/strings/12.c | https://raw.githubusercontent.com/biapacifico/pc-1/dddddfe/strings/12.c | biapacifico/pc-1 dddddfe strings/12.c | true | 200 | 365 | #include <stdio.h>
int caracteres (char quantidade []){
int contador=0;
for (int i=0; quantidade [i]!=0; i++){
contador ++;
}
return contador;
}
int main (){
int resultado;
char quantidade [50];
printf ("Digite: ");
scanf ("%s", quantidade);
resultado = caracteres (quantidade);
printf ("A quan... | 6 |
fivekingsktym/c | effadb1 | CS50_lecture_3_algorithms/1.0_linear_search_numbers_array.c | C | www.github.com/fivekingsktym/c/tree/main/CS50_lecture_3_algorithms/1.0_linear_search_numbers_array.c | https://raw.githubusercontent.com/fivekingsktym/c/effadb1/CS50_lecture_3_algorithms/1.0_linear_search_numbers_array.c | fivekingsktym/c effadb1 CS50_lecture_3_algorithms/1.0_linear_search_numbers_array.c | true | 200 | 365 | #include <cs50.h>
#include <stdio.h>
// Linear Search :- 7:38 hour
int main(void) {
int numbers[] = {20, 500, 10, 5, 100, 1, 50};
int n = get_int("Number : ");
for (int i=0; i<7; i++){
if (numbers[i] == n){
printf("Found at index %i\n", i);
return 0;
}
}
... | 5 |
teuben/cmhog2 | 5698899 | param.h | C | www.github.com/teuben/cmhog2/tree/main/param.h | https://raw.githubusercontent.com/teuben/cmhog2/5698899/param.h | teuben/cmhog2 5698899 param.h | true | 200 | 494 | c-----------------------------------------------------------------------
c PARAMETERS - Always set by CPP macros
c in,jn,kn = number of array elements in i,j,k direction
c tiny[huge] = smallest[biggest] number allowed (machine dependent)
c
integer jn, kn, ijkn,icartx,icarty
real tiny,huge
parameter... | 7 |
melvinhqb/CY-biblioTECH | 592b4fc | book.c | C | www.github.com/melvinhqb/CY-biblioTECH/tree/main/book.c | https://raw.githubusercontent.com/melvinhqb/CY-biblioTECH/592b4fc/book.c | melvinhqb/CY-biblioTECH 592b4fc book.c | true | 200 | 6,336 | #include "biblio.h"
// Displays the characteristics of a book
// enter the data book
void ShowBook(Book book){
ReplaceUnderscores(book.title);
printf("%s ",book.title);
ReplaceSpaces(book.title);
for(int i=0;i<MAX_SIZE_TITLE+3-strlen(book.title);i++){
printf(" ");
}
... | 0 |
akechi-haruka/segatools | a0e92f3 | carolhook/touch.c | C | www.github.com/akechi-haruka/segatools/tree/main/carolhook/touch.c | https://raw.githubusercontent.com/akechi-haruka/segatools/a0e92f3/carolhook/touch.c | akechi-haruka/segatools a0e92f3 carolhook/touch.c | true | 200 | 2,739 | #include <windows.h>
#include <assert.h>
#include <stdbool.h>
#include <stdint.h>
#include <string.h>
#include "carolhook/carol-dll.h"
#include "carolhook/touch.h"
#include "hooklib/uart.h"
#include "util/dprintf.h"
#include "util/dump.h"
static HRESULT touch_handle_irp(struct irp *irp);
static HRESULT touch_handl... | 6 |
Mwandoe-Shali/all_examples_trials | 577ef56 | my_shell/_shell/tok+exec.c | C | www.github.com/Mwandoe-Shali/all_examples_trials/tree/main/my_shell/_shell/tok+exec.c | https://raw.githubusercontent.com/Mwandoe-Shali/all_examples_trials/577ef56/my_shell/_shell/tok%2Bexec.c | Mwandoe-Shali/all_examples_trials 577ef56 my_shell/_shell/tok+exec.c | true | 200 | 1,434 | #include "shell.h"
/**
* strsplit - Splits a string into an array of strings using a delimiter
* @input: The input string to split
* Return: An array of strings, or NULL on failure
*/
char **strsplit(char *input)
{
char *input_copy, *tokens;
char **av;
int j;
int token_num = 0;
const char *delimiter = " ";
... | 5 |
AbdelazizMaher/Embedded_Systems_In_Depth | 6f9ec67 | Unit2_C_Programming/MidTerm/C_Function_To_Return_Nnmber_Of_Ones_In_Binary_Number.c | C | www.github.com/AbdelazizMaher/Embedded_Systems_In_Depth/tree/main/Unit2_C_Programming/MidTerm/C_Function_To_Return_Nnmber_Of_Ones_In_Binary_Number.c | https://raw.githubusercontent.com/AbdelazizMaher/Embedded_Systems_In_Depth/6f9ec67/Unit2_C_Programming/MidTerm/C_Function_To_Return_Nnmber_Of_Ones_In_Binary_Number.c | AbdelazizMaher/Embedded_Systems_In_Depth 6f9ec67 Unit2_C_Programming/MidTerm/C_Function_To_Return_Nnmber_Of_Ones_In_Binary_Number.c | true | 200 | 435 | /*
* main.c
*
* Created on: July 26, 2022
* Author: Abdelaziz Maher
*/
#include "stdio.h"
int num_of_ones(int num);
int main()
{
int num;
printf("Enter number : ");
fflush(stdout);
scanf("%d",&num);
printf("number of ones = %d ",num_of_ones(num));
return 0;
}
int num_of_ones(int ... | 7 |
prijall/C | d3b40ae | NeuralNet/neuron.h | C | www.github.com/prijall/C/tree/main/NeuralNet/neuron.h | https://raw.githubusercontent.com/prijall/C/d3b40ae/NeuralNet/neuron.h | prijall/C d3b40ae NeuralNet/neuron.h | true | 200 | 359 | #ifndef NEURON_H
#define NEURON_H
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<time.h>
// Neuron Structure:
typedef struct neuron_t
{
float actv;
float *out_weights;
float bias;
float z;
float deact;
float *dw;
float dbias;
float dz;
}neuron;
neuron creat... | 0 |
Maix0/batou | bfcaf79 | normed/small_parse_table/small_table686.c | C | www.github.com/Maix0/batou/tree/main/normed/small_parse_table/small_table686.c | https://raw.githubusercontent.com/Maix0/batou/bfcaf79/normed/small_parse_table/small_table686.c | Maix0/batou bfcaf79 normed/small_parse_table/small_table686.c | true | 200 | 3,960 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* funcs686.c :+: :+: :+: ... | 6 |
Ntsanii/simple_shell | d1c7a2a | getenv.c | C | www.github.com/Ntsanii/simple_shell/tree/main/getenv.c | https://raw.githubusercontent.com/Ntsanii/simple_shell/d1c7a2a/getenv.c | Ntsanii/simple_shell d1c7a2a getenv.c | true | 200 | 1,855 | #include "shell.h"
/**
* get_environ - Returns string array copy of our environ
* @info: Structure containing potential arguments. To maintain
* constant function prototype.
* Return: Always 0
*/
char **get_environ(info_t *info)
{
if (!info->environ || info->env_changed)
{
info->environ = list_to_str... | 5 |
TonyHolby/holbertonschool-low_level_programming | 35d3d82 | singly_linked_lists/4-free_list.c | C | www.github.com/TonyHolby/holbertonschool-low_level_programming/tree/main/singly_linked_lists/4-free_list.c | https://raw.githubusercontent.com/TonyHolby/holbertonschool-low_level_programming/35d3d82/singly_linked_lists/4-free_list.c | TonyHolby/holbertonschool-low_level_programming 35d3d82 singly_linked_lists/4-free_list.c | true | 200 | 304 | #include "lists.h"
/**
* free_list - a function that frees a list_t list.
* @head: pointer to the singly linked list node structure
*/
void free_list(list_t *head)
{
list_t *next_node;
while (head != NULL)
{
next_node = head->next;
free(head->str);
free(head);
head = next_node;
}
}
| 7 |
LeeDaeWook/Immersion_projects | f4b2f6f | cursus/circle_2/fractol/keyboard_hook.c | C | www.github.com/LeeDaeWook/Immersion_projects/tree/main/cursus/circle_2/fractol/keyboard_hook.c | https://raw.githubusercontent.com/LeeDaeWook/Immersion_projects/f4b2f6f/cursus/circle_2/fractol/keyboard_hook.c | LeeDaeWook/Immersion_projects f4b2f6f cursus/circle_2/fractol/keyboard_hook.c | true | 200 | 1,994 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* keyboard_hook.c :+: :+: :+: ... | 0 |
Matan-Eliyahu/Automated-Testing-System | f6532be | Automated Testing System/Source.c | C | www.github.com/Matan-Eliyahu/Automated-Testing-System/tree/main/Automated Testing System/Source.c | https://raw.githubusercontent.com/Matan-Eliyahu/Automated-Testing-System/f6532be/Automated%20Testing%20System/Source.c | Matan-Eliyahu/Automated-Testing-System f6532be Automated Testing System/Source.c | true | 200 | 5,508 | #include <unistd.h>
#include <fcntl.h>
#include <stdlib.h>
#include <string.h>
#include <sys/wait.h>
#include <stdio.h>
int readLine(int, char*);
void createStudentsList(char*);
void getInputParameters(char*, char[][50]);
void writeGrades(char[], char[], char[][50]);
void runStudentProgram(char[], char[], c... | 6 |
ReinanArgolo/LP1-UESC | 1c19a9a | Lista 05/ex07.c | C | www.github.com/ReinanArgolo/LP1-UESC/tree/main/Lista 05/ex07.c | https://raw.githubusercontent.com/ReinanArgolo/LP1-UESC/1c19a9a/Lista%2005/ex07.c | ReinanArgolo/LP1-UESC 1c19a9a Lista 05/ex07.c | true | 200 | 1,694 | #include <stdio.h>
#define SIZE 20
#include <time.h>
void preencherVetor(int vetor1[], int vetor2[]);
void reorganizarVetor(int vetor1[], int vetor2[], int vetor3[]);
void imprimirVetor(int vetor[]);
int main(void) {
int vetor1[SIZE], vetor2[SIZE], vetor3[SIZE*2];
clock_t start, end;
double cpu_time_use... | 3 |
Lakshya-sketch/Code-Radar-Solutions | 80afcb9 | Count the Occurrences of a Character@@676c039d80e1714600f6764b/code.c | C | www.github.com/Lakshya-sketch/Code-Radar-Solutions/tree/main/Count the Occurrences of a Character@@676c039d80e1714600f6764b/code.c | https://raw.githubusercontent.com/Lakshya-sketch/Code-Radar-Solutions/80afcb9/Count%20the%20Occurrences%20of%20a%20Character%40%40676c039d80e1714600f6764b/code.c | Lakshya-sketch/Code-Radar-Solutions 80afcb9 Count the Occurrences of a Character@@676c039d80e1714600f6764b/code.c | true | 200 | 282 | #include <stdio.h>
#include <string.h>
int main() {
char str[100],find[2];
scanf("%99s %s",str,find);
int count = 0;
for ( int i = 0 ; i < strlen(str) ; i++ ){
if (str[i] == find[0]){
count ++;
}
}
printf("%d",count);
return 0;
} | 5 |
HaywhyCoder/alx-low_level_programming | 865def9 | 0x0A-argc_argv/2-args.c | C | www.github.com/HaywhyCoder/alx-low_level_programming/tree/main/0x0A-argc_argv/2-args.c | https://raw.githubusercontent.com/HaywhyCoder/alx-low_level_programming/865def9/0x0A-argc_argv/2-args.c | HaywhyCoder/alx-low_level_programming 865def9 0x0A-argc_argv/2-args.c | true | 200 | 252 | #include <stdio.h>
/**
*main - Entry point
*@argc: argument counter
*@argv: argument vector
*
*Return: 0
*/
int main(int argc, char **argv)
{
int i;
if (argc > 0)
{
for (i = 0; i < argc; i++)
printf("%s\n", argv[i]);
}
return (0);
}
| 7 |
Nanasmd/ft_printf-Bonus | 275d5e8 | libft/ft_lstsize.c | C | www.github.com/Nanasmd/ft_printf-Bonus/tree/main/libft/ft_lstsize.c | https://raw.githubusercontent.com/Nanasmd/ft_printf-Bonus/275d5e8/libft/ft_lstsize.c | Nanasmd/ft_printf-Bonus 275d5e8 libft/ft_lstsize.c | true | 200 | 224 | #include "libft.h"
/* finds out how many elements there are in the list */
int ft_lstsize(t_list *lst)
{
int i;
if (!lst)
return (0);
i = 1;
while (lst->next != NULL)
{
i++;
lst = lst->next;
}
return (i);
}
| 0 |
rushairer/STM32F10x_ABLib | 2c772c8 | src/stm32f10x_abl_key.c | C | www.github.com/rushairer/STM32F10x_ABLib/tree/main/src/stm32f10x_abl_key.c | https://raw.githubusercontent.com/rushairer/STM32F10x_ABLib/2c772c8/src/stm32f10x_abl_key.c | rushairer/STM32F10x_ABLib 2c772c8 src/stm32f10x_abl_key.c | true | 200 | 909 | #include "stm32f10x_abl_key.h"
#include "stm32f10x_abl_delay.h"
void KEY_Init(
KEY_InitTypeDef *Keyx,
uint32_t RCC_APB2Periph,
GPIO_TypeDef *GPIOx,
uint16_t GPIO_Pin)
{
RCC_APB2PeriphClockCmd(RCC_APB2Periph, ENABLE);
Keyx->RCC_APB2Periph = RCC_APB2Periph;
Keyx->GPIOx = GPIOx;
... | 6 |
MageMCU/Numerics | dace379 | Algebra/src/TESTS/TestMatrix3x3.h | C | www.github.com/MageMCU/Numerics/tree/main/Algebra/src/TESTS/TestMatrix3x3.h | https://raw.githubusercontent.com/MageMCU/Numerics/dace379/Algebra/src/TESTS/TestMatrix3x3.h | MageMCU/Numerics dace379 Algebra/src/TESTS/TestMatrix3x3.h | true | 200 | 7,662 | //
// Carpenter Software
// File: TestMatrix3x3.h
// Github: MageMCU
// Repository: Numerics
// Folder: TESTS
//
// By Jesse Carpenter (carpentersoftware.com)
//
// Testing Platform:
// * MCU:Atmega328P
// * IDE:PlatformIO
// * Editor: VSCode
//
// MIT LICENSE
//
#ifndef Numerics_Test_Matrix3x3_h
#define Numerics_T... | 5 |
AkashPaul923/SPL-Lab_Problem | 3174ab5 | string palindrome test.c | C | www.github.com/AkashPaul923/SPL-Lab_Problem/tree/main/string palindrome test.c | https://raw.githubusercontent.com/AkashPaul923/SPL-Lab_Problem/3174ab5/string%20palindrome%20test.c | AkashPaul923/SPL-Lab_Problem 3174ab5 string palindrome test.c | true | 200 | 446 | //Read a string and test whether it is palindrome or not
#include<stdio.h>
#include<string.h>
int main(){
char str[20];
int i, len, temp=0;
int flag = 0;
printf("Enter a string:");
scanf("%s", str);
len = strlen(str);
for(i=0;i < len ;i++){
if(str[i] != str[len-i-1]){
temp = 1;
break;
}
}... | 3 |
malw4/Master-Thesis | beb5514 | mat_vec_new/read_modfem_crs_matrix.c | C | www.github.com/malw4/Master-Thesis/tree/main/mat_vec_new/read_modfem_crs_matrix.c | https://raw.githubusercontent.com/malw4/Master-Thesis/beb5514/mat_vec_new/read_modfem_crs_matrix.c | malw4/Master-Thesis beb5514 mat_vec_new/read_modfem_crs_matrix.c | true | 200 | 2,848 | #include <stdlib.h>
#include <stdio.h>
#include <omp.h>
#include <math.h>
#include "structures.h"
//#define DEBUG
//#define FILENAME "small.txt"
//#define FILENAME "modfem_crs_1210.txt"
#define FILENAME "modfem_crs_476912.txt"
//#define FILENAME "/home/dyplomy/malwina_ciesla/mgr/data/modfem_crs_1210.txt"
//#define FI... | 7 |
Eyoel-Mekonnen/alx-low_level_programming | 656c619 | 0x12-singly_linked_lists/3-add_node_end.c | C | www.github.com/Eyoel-Mekonnen/alx-low_level_programming/tree/main/0x12-singly_linked_lists/3-add_node_end.c | https://raw.githubusercontent.com/Eyoel-Mekonnen/alx-low_level_programming/656c619/0x12-singly_linked_lists/3-add_node_end.c | Eyoel-Mekonnen/alx-low_level_programming 656c619 0x12-singly_linked_lists/3-add_node_end.c | true | 200 | 707 | #include "lists.h"
#include <string.h>
/**
* add_node_end - adds a node at the last
* @head: address of pointer to a pointer
* @str: the string passed
*
* Return: the added node address
*/
list_t *add_node_end(list_t **head, const char *str)
{
list_t *end_node;
list_t *tmp;
size_t counter = 0;
end_node = mal... | 0 |
lasyadevops/C-Language | e80e7bf | natural.c | C | www.github.com/lasyadevops/C-Language/tree/main/natural.c | https://raw.githubusercontent.com/lasyadevops/C-Language/e80e7bf/natural.c | lasyadevops/C-Language e80e7bf natural.c | true | 200 | 214 | #include<stdio.h>
#include<Stdlib.h>
void main()
{
int i,number,sum=0;
system("clear");
printf("\n enter ho many numbers you want to print");
scanf("%d",number);
{
for(i=1;i<=number;i++)
}
}
| 2 |
TenzinBonium/Stone_Paper_Scissors_in_C | 5067971 | stonepaperscissor.c | C | www.github.com/TenzinBonium/Stone_Paper_Scissors_in_C/tree/main/stonepaperscissor.c | https://raw.githubusercontent.com/TenzinBonium/Stone_Paper_Scissors_in_C/5067971/stonepaperscissor.c | TenzinBonium/Stone_Paper_Scissors_in_C 5067971 stonepaperscissor.c | true | 200 | 1,174 | #include<stdio.h>
#include<stdlib.h>
#include<time.h>
int main() {
int point = 1;
while(point <= 5) {
int number;
char userinput;
printf("Enter s for stone \nEnter p for paper \nEnter k for scissor\n");
scanf("%c", &userinput);
srand(time(0));
number = ... | 6 |
tony1455/Disciplinas | 0b1f1ea | Algoritmo e Programação/Lista 04 Laboratorio Repeticao/exerTony.c | C | www.github.com/tony1455/Disciplinas/tree/main/Algoritmo e Programação/Lista 04 Laboratorio Repeticao/exerTony.c | https://raw.githubusercontent.com/tony1455/Disciplinas/0b1f1ea/Algoritmo%20e%20Programa%C3%A7%C3%A3o/Lista%2004%20Laboratorio%20Repeticao/exerTony.c | tony1455/Disciplinas 0b1f1ea Algoritmo e Programação/Lista 04 Laboratorio Repeticao/exerTony.c | true | 200 | 368 | #include <stdio.h>
#include <stdlib.h>
int main()
{
int num, menor=-1;
while(1)
{
scanf("%d", &num);
if(num == -1)
{
break;
}
if(num < menor || menor == -1)
{
menor = num;
}
}
printf("O menor valor i... | 5 |
JamalAnsari23/C_language | 71051f4 | alpcha.c | C | www.github.com/JamalAnsari23/C_language/tree/main/alpcha.c | https://raw.githubusercontent.com/JamalAnsari23/C_language/71051f4/alpcha.c | JamalAnsari23/C_language 71051f4 alpcha.c | true | 200 | 268 | #include <stdio.h>
void main()
{
char ch;
printf("Enter a alphabet\n");
scanf("%c",&ch);
else if((ch>='a'&&ch<='z'||ch>='A'&&ch<='Z'))
{
printf(" Alphabet");
}
else if(ch>='0'&&ch<='9')
{
printf(" digit");
}
else
{
printf("special character");
}
}
| 4 |
wenqianq3/kl720 | f5d8d6d | firmware/mdw/model/kmdw_model.c | C | www.github.com/wenqianq3/kl720/tree/main/firmware/mdw/model/kmdw_model.c | https://raw.githubusercontent.com/wenqianq3/kl720/f5d8d6d/firmware/mdw/model/kmdw_model.c | wenqianq3/kl720 f5d8d6d firmware/mdw/model/kmdw_model.c | true | 200 | 54,900 | /*
* Kneron Model API Manager
*
* Copyright (C) 2019 Kneron, Inc. All rights reserved.
*
*/
#include <string.h>
#include <stdlib.h>
#include "base.h"
#include "kmdw_ipc.h"
#include "kmdw_model.h"
#include "kmdw_console.h" /*for dbg_msg */
#include "kdrv_clock.h" /*for kdrv_delay_us() */
#include "kmdw_memxf... | 3 |
DeviousCardi/BTP | 720b738 | deepfix_data/prob108/correct/prog18726-user775.c | C | www.github.com/DeviousCardi/BTP/tree/main/deepfix_data/prob108/correct/prog18726-user775.c | https://raw.githubusercontent.com/DeviousCardi/BTP/720b738/deepfix_data/prob108/correct/prog18726-user775.c | DeviousCardi/BTP 720b738 deepfix_data/prob108/correct/prog18726-user775.c | true | 200 | 288 | #include <stdio.h>
#include <stdlib.h>
int main() {
int n,b,c,d;
scanf("%d",&n);
for(b=1;b<=(n+1)/2;b=b+1) {
printf("*");
for(c=1;c<b-1;c++) {
printf(" "); }
if(b=1)
printf(" ");
else
print("*");
printf("\n"); }
return 0; } | 7 |
kamenoseiji/VSOP_FX | d96f1f2 | TOOLS/pgtest/pgtest.c | C | www.github.com/kamenoseiji/VSOP_FX/tree/main/TOOLS/pgtest/pgtest.c | https://raw.githubusercontent.com/kamenoseiji/VSOP_FX/d96f1f2/TOOLS/pgtest/pgtest.c | kamenoseiji/VSOP_FX d96f1f2 TOOLS/pgtest/pgtest.c | true | 200 | 4,531 | /*************************************************
** PGTEST : Demonstration Program for PGPLOT **
** **
** AUTHOR : KAMENO Seiji **
**************************************************/
#include <stdio.h>
#include <math.h>
#include "cpgplot.h"
#define PI2 6.28318530717959
#define NDATA 512
MAIN__(ar... | 0 |
Obarechrispus/alx-low_level_programming | 8a45a3f | 0x0A-argc_argv/100-change.c | C | www.github.com/Obarechrispus/alx-low_level_programming/tree/main/0x0A-argc_argv/100-change.c | https://raw.githubusercontent.com/Obarechrispus/alx-low_level_programming/8a45a3f/0x0A-argc_argv/100-change.c | Obarechrispus/alx-low_level_programming 8a45a3f 0x0A-argc_argv/100-change.c | true | 200 | 636 | #include "main.h"
/**
*main - prints the number of count
*argc: counts of argument
*argv: the string vecto
*@argc: counts of argument
*@argv: the string vecto
*Return: null
*/
int main(int argc, char *argv[])
{
int cents, x = 0;
if (argc != 2)
{
printf("Error\n");
return (1);
}
cents = atoi(argv[1])... | 1 |
bbt420/alx-low_level_programming | 19acdb1 | 0x0A-argc_argv/2-args.c | C | www.github.com/bbt420/alx-low_level_programming/tree/main/0x0A-argc_argv/2-args.c | https://raw.githubusercontent.com/bbt420/alx-low_level_programming/19acdb1/0x0A-argc_argv/2-args.c | bbt420/alx-low_level_programming 19acdb1 0x0A-argc_argv/2-args.c | true | 200 | 281 | #include "main.h"
#include <stdio.h>
/**
* main - prints all the args content
* @argc: argument count
* @argv: argument vector
*
* Return: always 0
*/
int main(int argc, char *argv[])
{
int i;
for (i = 0 ; i < argc ; i++)
{
printf("%s\n", argv[i]);
}
return (0);
}
| 2 |
candef582/TDA-en-C | 9269ab2 | sala.c | C | www.github.com/candef582/TDA-en-C/tree/main/sala.c | https://raw.githubusercontent.com/candef582/TDA-en-C/9269ab2/sala.c | candef582/TDA-en-C 9269ab2 sala.c | true | 200 | 1,090 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define TAM 10
#include "sala.h"
struct SalaS
{
int num;
char nombr[20];
int asientos[TAM];
int disponible;
};
SalaP crearSala()
{
SalaP s = malloc(sizeof(struct SalaS));
printf("\nIngresar numero de sala:\n");
... | 5 |
Aden1ke/alx-low_level_programming | 60e850d | 0x04-more_functions_nested_loops/9-fizz_buzz.c | C | www.github.com/Aden1ke/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/9-fizz_buzz.c | https://raw.githubusercontent.com/Aden1ke/alx-low_level_programming/60e850d/0x04-more_functions_nested_loops/9-fizz_buzz.c | Aden1ke/alx-low_level_programming 60e850d 0x04-more_functions_nested_loops/9-fizz_buzz.c | true | 200 | 384 | #include <stdio.h>
/**
* main - check the code
*
* Return: Always 0.
*/
int main(void)
{
int i;
for (i = 1; i <= 100; i++)
{
if ((i % 3) == 0 && (i % 5) == 0)
printf("FizzBuzz");
else if ((i % 3) == 0)
printf("Fizz");
else if ((i % 5) == 0)
printf("Buzz");
else
printf("%d", i);
if (i == 10... | 4 |
SHINE-six/HackerEarth-problem-solved | 06394d6 | Maximum borders.c | C | www.github.com/SHINE-six/HackerEarth-problem-solved/tree/main/Maximum borders.c | https://raw.githubusercontent.com/SHINE-six/HackerEarth-problem-solved/06394d6/Maximum%20borders.c | SHINE-six/HackerEarth-problem-solved 06394d6 Maximum borders.c | true | 200 | 668 | #include <stdio.h>
void findbig(int goal[], int n){
int big = goal[0];
for (int k = 0; k < n; k++){
if (goal[k] > big)
{
big = goal[k];
}
}
printf("%d\n", big);
}
int main(){
int t,n,m;
scanf("%d", &t);
for (int i = 0; i < t; i++){
scanf(... | 3 |
Francoherrera123/holbertonschool-low_level_programming | bedc683 | bit_manipulation/3-set_bit.c | C | www.github.com/Francoherrera123/holbertonschool-low_level_programming/tree/main/bit_manipulation/3-set_bit.c | https://raw.githubusercontent.com/Francoherrera123/holbertonschool-low_level_programming/bedc683/bit_manipulation/3-set_bit.c | Francoherrera123/holbertonschool-low_level_programming bedc683 bit_manipulation/3-set_bit.c | true | 200 | 425 | #include "main.h"
/**
* set_bit - That sets the value of a bit to 1 at a given index.
* @n: Is a number
* @index: is the index, starting from 0
* Return: 1 if it worked, or -1 if an error ocurred
*/
int set_bit(unsigned long int *n, unsigned int index)
{
int power = 1;
unsigned int i = 0;
if (index > 64)
ret... | 7 |
Raniah06/alx-low_level_programming | 6fc9517 | 0x04-more_functions_nested_loops/3-print_numbers.c | C | www.github.com/Raniah06/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/3-print_numbers.c | https://raw.githubusercontent.com/Raniah06/alx-low_level_programming/6fc9517/0x04-more_functions_nested_loops/3-print_numbers.c | Raniah06/alx-low_level_programming 6fc9517 0x04-more_functions_nested_loops/3-print_numbers.c | true | 200 | 212 | #include "main.h"
/**
* print_numbers - prints numbers between 0 to 9.
* Return: no return but print.
*/
void print_numbers(void)
{
int d;
for (d = 48; d < 58; d++)
{
_putchar(d);
}
_putchar('\n');
}
| 0 |
wachirawahomed/alx-low_level_programming | b06873f | 0x17-doubly_linked_lists/7-insert_dnodeint.c | C | www.github.com/wachirawahomed/alx-low_level_programming/tree/main/0x17-doubly_linked_lists/7-insert_dnodeint.c | https://raw.githubusercontent.com/wachirawahomed/alx-low_level_programming/b06873f/0x17-doubly_linked_lists/7-insert_dnodeint.c | wachirawahomed/alx-low_level_programming b06873f 0x17-doubly_linked_lists/7-insert_dnodeint.c | true | 200 | 880 | #include "lists.h"
/**
* insert_dnodeint_at_index - inserts a new node at given index in the list
* @h: pointer to head of the list
* @idx: index to add at, starting from 0
* @n: value of new node
* Return: new node or null
**/
dlistint_t *insert_dnodeint_at_index(dlistint_t **h, unsigned int idx, int n)
{
dlist... | 1 |
phthalos/algorithm | e14da67 | 백준/Bronze/10798. 세로읽기/세로읽기.c | C | www.github.com/phthalos/algorithm/tree/main/백준/Bronze/10798. 세로읽기/세로읽기.c | https://raw.githubusercontent.com/phthalos/algorithm/e14da67/%EB%B0%B1%EC%A4%80/Bronze/10798.%E2%80%85%EC%84%B8%EB%A1%9C%EC%9D%BD%EA%B8%B0/%EC%84%B8%EB%A1%9C%EC%9D%BD%EA%B8%B0.c | phthalos/algorithm e14da67 백준/Bronze/10798. 세로읽기/세로읽기.c | true | 200 | 436 | #include <stdio.h>
#include <stdlib.h>
#define COL 5
#define ROW 16
int main(void)
{
char str[COL][ROW] = {};
for (int i = 0; i < COL; i++)
scanf("%s", str[i]);
for (int i = 0; i < ROW; i++)
{
for (int j = 0; j < COL; j++)
{
if (str[j][i] != 0)
... | 5 |
Srilikhitha24/codemind-c | 97d4bd6 | Last_odd_number_in_an_Array.c | C | www.github.com/Srilikhitha24/codemind-c/tree/main/Last_odd_number_in_an_Array.c | https://raw.githubusercontent.com/Srilikhitha24/codemind-c/97d4bd6/Last_odd_number_in_an_Array.c | Srilikhitha24/codemind-c 97d4bd6 Last_odd_number_in_an_Array.c | true | 200 | 312 | #include<stdio.h>
int main( )
{
int n,i;
scanf("%d",&n);
int arr[n];
for(i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
int max=0;
for(i=n-1;i>0;i--)
{
if(arr[i]%2==1 && arr[i]>max)
{
max=arr[i];
break;
}
}
printf("%d",max);
} | 6 |
php-ecma-intl/ext | 595254e | src/ecma402/calendar.h | C | www.github.com/php-ecma-intl/ext/tree/main/src/ecma402/calendar.h | https://raw.githubusercontent.com/php-ecma-intl/ext/595254e/src/ecma402/calendar.h | php-ecma-intl/ext 595254e src/ecma402/calendar.h | true | 200 | 2,783 | /**
* Copyright (c) php-ecma-intl contributors.
*
* This source file is subject to the BSD-3-Clause license that is bundled with
* this package in the file LICENSE and is available at the following web
* address: https://opensource.org/license/bsd-3-clause/
*
* This source file may utilize copyrighted material f... | 3 |
alenstein/alx-low_level_programming | 7c045d2 | 0x05-pointers_arrays_strings/4-print_rev.c | C | www.github.com/alenstein/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/4-print_rev.c | https://raw.githubusercontent.com/alenstein/alx-low_level_programming/7c045d2/0x05-pointers_arrays_strings/4-print_rev.c | alenstein/alx-low_level_programming 7c045d2 0x05-pointers_arrays_strings/4-print_rev.c | true | 200 | 304 | #include <stdio.h>
#include "main.h"
/**
* print_rev - function to print string in reverse.
* @s: value taken from main
* Return: (0)
*/
void print_rev(char *s)
{
int len;
for (len = 0; s[len] != '\0'; len++)
{}
for (len = len - 1; len >= 0 ; len--)
{
_putchar(s[len]);
}
_putchar('\n');
}
| 4 |
1m30s/STM32_USB-PD_Power | d917f22 | USBPD/App/usbpd_dpm_core.c | C | www.github.com/1m30s/STM32_USB-PD_Power/tree/main/USBPD/App/usbpd_dpm_core.c | https://raw.githubusercontent.com/1m30s/STM32_USB-PD_Power/d917f22/USBPD/App/usbpd_dpm_core.c | 1m30s/STM32_USB-PD_Power d917f22 USBPD/App/usbpd_dpm_core.c | true | 200 | 13,273 | /* USER CODE BEGIN Header */
/**
******************************************************************************
* @file usbpd_dpm_core.c
* @author MCD Application Team
* @brief USBPD dpm core file
******************************************************************************
* @attention
*
* Copyr... | 2 |
ferhadme/fcmpl | a95445a | src/main.c | C | www.github.com/ferhadme/fcmpl/tree/main/src/main.c | https://raw.githubusercontent.com/ferhadme/fcmpl/a95445a/src/main.c | ferhadme/fcmpl a95445a src/main.c | true | 200 | 616 | /*
* Copyright (c) 2023, Farhad Mehdizada
*/
#include <stdio.h>
#include "trie.h"
#include "repl.h"
int main(void) {
trie *t = create_trie();
if (t == NULL) {
fprintf(stderr, "REPL couldn't be initialized\n");
return 1;
}
bool termination = false;
do {
printf("%s", COMMAND_PROMPT);
char *l... | 0 |
audiocx/labs-inf246 | 0868071 | Tarea2/main.c | C | www.github.com/audiocx/labs-inf246/tree/main/Tarea2/main.c | https://raw.githubusercontent.com/audiocx/labs-inf246/0868071/Tarea2/main.c | audiocx/labs-inf246 0868071 Tarea2/main.c | true | 200 | 6,229 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include "domino.h"
#include "comm.h"
#define N_JUG 4 // numero de jugadores
#define WAIT_TIME 1 // tiempo en segundos entre turnos de los bots
mesa table;
mano h[4];
int main()
{
mensaje msg;
initMesa(&table); ... | 1 |
liuhaoping2002/ComputerNetLab | d461fad | Lab2/code/my_udp_server.c | C | www.github.com/liuhaoping2002/ComputerNetLab/tree/main/Lab2/code/my_udp_server.c | https://raw.githubusercontent.com/liuhaoping2002/ComputerNetLab/d461fad/Lab2/code/my_udp_server.c | liuhaoping2002/ComputerNetLab d461fad Lab2/code/my_udp_server.c | true | 200 | 1,099 | #include "net.h"
int main() {
/* 建立套接字 */
int sockfd = Socket(AF_INET, SOCK_DGRAM, IPPROTO_UDP);
int enable = 1;
Setsockopt(sockfd, SOL_SOCKET, SO_REUSEADDR, &enable, sizeof(int));
/* 绑定端口 */
struct sockaddr_in server_addr = {0};
server_addr.sin_family = AF_INET;
s... | 5 |
nehal-sampath/codechef | 0f8be92 | c/Cost of painting.c | C | www.github.com/nehal-sampath/codechef/tree/main/c/Cost of painting.c | https://raw.githubusercontent.com/nehal-sampath/codechef/0f8be92/c/Cost%20of%20painting.c | nehal-sampath/codechef 0f8be92 c/Cost of painting.c | true | 200 | 344 | //Update the blanks in the code below to solve the problem
#include <stdio.h>
int main() {
int s = 14 ;
int area = s * s ;
int cost = area * 7 ;
printf("%d \n", area ); //Area and cost have to be output on separate lines
printf("%d", cost ); //'$' has to be printed after cost without any space
prin... | 6 |
Khun111/alx-low_level_programming | 6631414 | 0x0E-structures_typedef/1-init_dog.c | C | www.github.com/Khun111/alx-low_level_programming/tree/main/0x0E-structures_typedef/1-init_dog.c | https://raw.githubusercontent.com/Khun111/alx-low_level_programming/6631414/0x0E-structures_typedef/1-init_dog.c | Khun111/alx-low_level_programming 6631414 0x0E-structures_typedef/1-init_dog.c | true | 200 | 286 | #include "dog.h"
/**
* init_dog - initialize dog struct
* @d: pointer to struct
* @name: dog's name
* @age: dog's age
* @owner: dog's owner
*/
void init_dog(struct dog *d, char *name, float age, char *owner)
{
if (d)
{
d->name = name;
d->age = age;
d->owner = owner;
}
}
| 7 |
Harshavardhan-Pandurangan/OSN | 845bad8 | Assignment 3/builtin_comm.c | C | www.github.com/Harshavardhan-Pandurangan/OSN/tree/main/Assignment 3/builtin_comm.c | https://raw.githubusercontent.com/Harshavardhan-Pandurangan/OSN/845bad8/Assignment%203/builtin_comm.c | Harshavardhan-Pandurangan/OSN 845bad8 Assignment 3/builtin_comm.c | true | 200 | 5,220 | #include "Headers.h"
extern int removeSpaces(char *input, int type);
extern char homeDir[size];
char prevDir[size] = "";
int spaceCheck(char *input){
int quote_flag = 0;
int len = strlen(input);
for(int i = 0 ; i < len ; i++){
if(input[i] == 34){
if(quote_flag == 0){
... | 3 |
SafeXF4ZesX/EGCI252-System-Programming | 5045f06 | 09-shared-memory/pconsumer.c | C | www.github.com/SafeXF4ZesX/EGCI252-System-Programming/tree/main/09-shared-memory/pconsumer.c | https://raw.githubusercontent.com/SafeXF4ZesX/EGCI252-System-Programming/5045f06/09-shared-memory/pconsumer.c | SafeXF4ZesX/EGCI252-System-Programming 5045f06 09-shared-memory/pconsumer.c | true | 200 | 1,283 | #include <unistd.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <fcntl.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/mman.h>
#define SHM_NAME "/pshm"
#define MEM_SIZE 64
struct shm_st
{
int written;
char data[MEM_SIZE];
};
int main()
{
int running = 1, shmfd, st_siz... | 4 |
NotAsier/minishell | df7e87e | src/builtins/export.c | C | www.github.com/NotAsier/minishell/tree/main/src/builtins/export.c | https://raw.githubusercontent.com/NotAsier/minishell/df7e87e/src/builtins/export.c | NotAsier/minishell df7e87e src/builtins/export.c | true | 200 | 1,267 | #include "minishell.h"
char *find_until_char(char *str, char letter)
{
int i;
char *result;
i = 0;
while (str[i] != '\0' && str[i] != letter)
i++;
if (str[i])
{
result = ft_strndup(str, i);
return (result);
}
return (str);
}
int check_syntax(char *str)
{
int i;
i = 0;
if (ft_strchr(str, '=') == NU... | 0 |
mjsimo99/langage-c | 29fbf69 | simple_recherche/main.c | C | www.github.com/mjsimo99/langage-c/tree/main/simple_recherche/main.c | https://raw.githubusercontent.com/mjsimo99/langage-c/29fbf69/simple_recherche/main.c | mjsimo99/langage-c 29fbf69 simple_recherche/main.c | true | 200 | 346 | #include <stdio.h>
#include <stdlib.h>
int rechercheSimple(int x , int *T,int n)
{
int i ;
for(i=0;i<n;i++)
if(x == T[i])
return i ;
return -1;
}
int main()
{
int T[5]={5,2,9,6,0};
int x ;
printf("saisir le nombre saisir : ");
scanf("%d",&x);
printf("%d",rechercheSi... | 2 |
oldcast1e/C | ef67093 | Cprograming/1st Grade/2학기/12.동적할당/문제8.c | C | www.github.com/oldcast1e/C/tree/main/Cprograming/1st Grade/2학기/12.동적할당/문제8.c | https://raw.githubusercontent.com/oldcast1e/C/ef67093/Cprograming/1st%20Grade/2%ED%95%99%EA%B8%B0/12.%EB%8F%99%EC%A0%81%ED%95%A0%EB%8B%B9/%EB%AC%B8%EC%A0%9C8.c | oldcast1e/C ef67093 Cprograming/1st Grade/2학기/12.동적할당/문제8.c | true | 200 | 1,022 | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main(){//메인함수
int N,cnt=0;
int spn,len,minlen= 101,minspn= 101;
//입력받은 문자열의 매개변수 설정
char *score = NULL;//포인터 선언 및 초기화
char word[100];//포인터 선언 및 초기화
scanf("%d",&N);//입력받음
getchar();
score = (char*)malloc(100*sizeof(char))... | 5 |
Vasichar11/MTMP_Root | 6d85fbb | useless/fillTree_locks.C | C | www.github.com/Vasichar11/MTMP_Root/tree/main/useless/fillTree_locks.C | https://raw.githubusercontent.com/Vasichar11/MTMP_Root/6d85fbb/useless/fillTree_locks.C | Vasichar11/MTMP_Root 6d85fbb useless/fillTree_locks.C | true | 200 | 3,161 | /// Fill in the same tree using locks, the conventional way
/// Incorrect results - Race condition - Fills duplicate entries like in fillTree_ompCritical.C
/// Issue: Concurrent access in conditional thread safe object (TTree). This is not allowed even if we use locks
#include <iostream>
#include <vector>
#include <t... | 1 |
Lucasdye/MinishellBash | 6ebe24a | srcs/parse/parse_quote.c | C | www.github.com/Lucasdye/MinishellBash/tree/main/srcs/parse/parse_quote.c | https://raw.githubusercontent.com/Lucasdye/MinishellBash/6ebe24a/srcs/parse/parse_quote.c | Lucasdye/MinishellBash 6ebe24a srcs/parse/parse_quote.c | true | 200 | 2,103 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* parse_quote.c :+: :+: :+: ... | 6 |
EPTONE/PicoBoot | aba3005 | Src/Loader/loader.c | C | www.github.com/EPTONE/PicoBoot/tree/main/Src/Loader/loader.c | https://raw.githubusercontent.com/EPTONE/PicoBoot/aba3005/Src/Loader/loader.c | EPTONE/PicoBoot aba3005 Src/Loader/loader.c | true | 200 | 3,709 | /* standerd c library */
#include <stdio.h>
#include <string.h>
#include <errno.h>
/* code base */
#include "ASM/exec.h" // keep this at the top or else compiler will complain
#include "../Err/err.h"
#include "../Filesystem/filesystem.h"
#include "loader.h"
#include "ff.h"
/* pico-sdk */
#include <pico.h>
#includ... | 7 |
Coll76/alx-low_level_programming | 8b6568f | 0x01-variables_if_else_while/2-print_alphabet.c | C | www.github.com/Coll76/alx-low_level_programming/tree/main/0x01-variables_if_else_while/2-print_alphabet.c | https://raw.githubusercontent.com/Coll76/alx-low_level_programming/8b6568f/0x01-variables_if_else_while/2-print_alphabet.c | Coll76/alx-low_level_programming 8b6568f 0x01-variables_if_else_while/2-print_alphabet.c | true | 200 | 271 | #include<stdio.h>
#include<ctype.h>
/**
*main - Entry point
*description - 'Print alphabets in lowercase'
*Return: Always 0
*/
int main(void)
{
int lowercase = 'a';
while (lowercase <= 'z')
{
putchar(lowercase);
lowercase++;
}
putchar('\n');
return (0);
}
| 4 |
BigPanford/alx-low_level_programming | d83172e | 0x07-pointers_arrays_strings/0-memset.c | C | www.github.com/BigPanford/alx-low_level_programming/tree/main/0x07-pointers_arrays_strings/0-memset.c | https://raw.githubusercontent.com/BigPanford/alx-low_level_programming/d83172e/0x07-pointers_arrays_strings/0-memset.c | BigPanford/alx-low_level_programming d83172e 0x07-pointers_arrays_strings/0-memset.c | true | 200 | 324 | #include "main.h"
/**
* _memset - file memory with a constant byte
* @s: memory area to be filled
* @b: char to copy
* @n: number of times to copy b
* Return: pointer to the memory area s
*/
char *_memset(char *s, char b, unsigned int n)
{
unsigned int i;
for (i = 0; i < n; i++)
{
s[i] = b;
}
return (s);... | 3 |
nik0zer/stm32f051r8_study_projects | 458fd73 | oneWireUSART2.h | C | www.github.com/nik0zer/stm32f051r8_study_projects/tree/main/oneWireUSART2.h | https://raw.githubusercontent.com/nik0zer/stm32f051r8_study_projects/458fd73/oneWireUSART2.h | nik0zer/stm32f051r8_study_projects 458fd73 oneWireUSART2.h | true | 200 | 1,525 | #ifndef ONEWIREUSART2_H
#define ONEWIREUSART2_H
#include "Main.h"
#include "USART2.h"
#include "stm32f0xx.h"
#define OW_RESET 0xF0
#define OW_W0 0x00
#define OW_W1 0xFF
#define OW_R 0xFF
#define OW_NO_DEVICE 1
#define OW_OK 0
... | 0 |
MuhamadSopianaKun26/LinkedList_UtsMahasiswa | ca61811 | requirement.c | C | www.github.com/MuhamadSopianaKun26/LinkedList_UtsMahasiswa/tree/main/requirement.c | https://raw.githubusercontent.com/MuhamadSopianaKun26/LinkedList_UtsMahasiswa/ca61811/requirement.c | MuhamadSopianaKun26/LinkedList_UtsMahasiswa ca61811 requirement.c | true | 200 | 2,313 | #include <stdlib.h>
#include <string.h>
#include "requirement.h"
#include "linkedList.h"
void InitializeLists(List *L1, List *L2) {
CreateList(L1);
CreateList(L2);
}
void CopyBiggerThan(List *L1, List *L2, int threshold) {
address P = L1->First;
while (P != NULL) {
if (P->nilai > threshold) {
... | 2 |
iamdavy/learning-C | 98ea140 | Lista 1/Questão 11/main.c | C | www.github.com/iamdavy/learning-C/tree/main/Lista 1/Questão 11/main.c | https://raw.githubusercontent.com/iamdavy/learning-C/98ea140/Lista%201/Quest%C3%A3o%2011/main.c | iamdavy/learning-C 98ea140 Lista 1/Questão 11/main.c | true | 200 | 266 | #include <stdio.h>
#include <stdlib.h>
int main()
{
float ms, km;
printf("Insira a velocidade em metros por segundo: ");
scanf("%f", &ms);
km = ms * 3.6;
printf("A velocidade convertida em Quilometros por Minuto e %.1f", km);
return 0;
}
| 5 |
Dytoma/MY_RPG | 47eadcc | src/player/player.c | C | www.github.com/Dytoma/MY_RPG/tree/main/src/player/player.c | https://raw.githubusercontent.com/Dytoma/MY_RPG/47eadcc/src/player/player.c | Dytoma/MY_RPG 47eadcc src/player/player.c | true | 200 | 1,384 | /*
** EPITECH PROJECT, 2024
** player
** File description:
** functions to manage player
*/
#include "rpg.h"
static void fill_player(player_t *player)
{
player->orientation = NONE;
player->inv = init_inv();
player->experience = 35;
player->exp = init_xp(player);
player->attack = 5;
player->spee... | 1 |
dragonmushu3/Piscine-Atelier-C | 2f68dbe | array_max_min/array_max_min.c | C | www.github.com/dragonmushu3/Piscine-Atelier-C/tree/main/array_max_min/array_max_min.c | https://raw.githubusercontent.com/dragonmushu3/Piscine-Atelier-C/2f68dbe/array_max_min/array_max_min.c | dragonmushu3/Piscine-Atelier-C 2f68dbe array_max_min/array_max_min.c | true | 200 | 340 | #include <stddef.h>
void array_max_min(int tab[], size_t len, int *max, int *min)
{
if (!tab || len == 0)
return;
*max = tab[0];
*min = tab[0];
for (size_t i = 1; i < len; i++)
{
if (*(tab + i) > *max)
*max = *(tab + i);
if (*(tab + i) < *min)
*min = ... | 6 |
AdamLesage/Zappy | 9292459 | src/server/command/GUI_command/gui_command.c | C | www.github.com/AdamLesage/Zappy/tree/main/src/server/command/GUI_command/gui_command.c | https://raw.githubusercontent.com/AdamLesage/Zappy/9292459/src/server/command/GUI_command/gui_command.c | AdamLesage/Zappy 9292459 src/server/command/GUI_command/gui_command.c | true | 200 | 397 | /*
** EPITECH PROJECT, 2024
** Zappy
** File description:
** client_command
*/
#include "server.h"
const command_list_t commands_gui_list[] = {
{"msz", &msz, 1, 0},
{"bct", &bct, 3, 0},
{"mct", &mct, 1, 0},
{"tna", &tna, 1, 0},
{"ppo", &ppo, 2, 0},
{"plv", &plv, 2, 0},
{"pin", &pin, 2, 0},... | 7 |
cwolff/c_code | 8a0d73b | owpl.c | C | www.github.com/cwolff/c_code/tree/main/owpl.c | https://raw.githubusercontent.com/cwolff/c_code/8a0d73b/owpl.c | cwolff/c_code 8a0d73b owpl.c | true | 200 | 457 | #include <stdio.h>
#define SPACE ' '
#define TAB '\t'
#define NL '\n'
#define TRUE 1
#define FALSE 0
int main(void) {
int ws;
char c, lc;
while ((c = getchar()) != EOF) {
if (c == SPACE || c == TAB || c == NL) {
if (ws != TRUE) {
ws = TRUE;
... | 4 |
Martanos/mini_RT | 34a4751 | srcs/02_parser/create_obj/create_cylinder.c | C | www.github.com/Martanos/mini_RT/tree/main/srcs/02_parser/create_obj/create_cylinder.c | https://raw.githubusercontent.com/Martanos/mini_RT/34a4751/srcs/02_parser/create_obj/create_cylinder.c | Martanos/mini_RT 34a4751 srcs/02_parser/create_obj/create_cylinder.c | true | 200 | 2,682 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* create_cylinder.c :+: :+: :+: ... | 3 |
gerry-mandering/doIt_DataStructure_Algorithm-c | a5f9633 | 01.Basic_Algorithm/Questions/print_rectangle.c | C | www.github.com/gerry-mandering/doIt_DataStructure_Algorithm-c/tree/main/01.Basic_Algorithm/Questions/print_rectangle.c | https://raw.githubusercontent.com/gerry-mandering/doIt_DataStructure_Algorithm-c/a5f9633/01.Basic_Algorithm/Questions/print_rectangle.c | gerry-mandering/doIt_DataStructure_Algorithm-c a5f9633 01.Basic_Algorithm/Questions/print_rectangle.c | true | 200 | 324 | #include <stdio.h>
int main(void)
{
int height, width;
printf("직사각형을 출력합니다.\n");
printf("높이 : ");
scanf("%d", &height);
printf("너비 : ");
scanf("%d", &width);
for (int i = 0; i < height; i++)
{
for (int j = 0; j < width; j++)
{
printf("*");
}
printf("\n");
}
return (0);
}
| 2 |
VascoCariou/BTS_ProjetGroveEXaO | 3c16c58 | realisations/GrovExAO/include/StructCapteur.h | C | www.github.com/VascoCariou/BTS_ProjetGroveEXaO/tree/main/realisations/GrovExAO/include/StructCapteur.h | https://raw.githubusercontent.com/VascoCariou/BTS_ProjetGroveEXaO/3c16c58/realisations/GrovExAO/include/StructCapteur.h | VascoCariou/BTS_ProjetGroveEXaO 3c16c58 realisations/GrovExAO/include/StructCapteur.h | true | 200 | 710 | /**
* @struct Capteur
* @brief
* Structure permetant de stocker les donn�es utile au autre fonction du programmes ( Parser et afficheur )
*
*/
#ifndef STRUCTCAPTEUR_H
#define STRUCTCAPTEUR_H
#include <QObject>
typedef struct Capteur
{
QString Nom; /// Nom du capteur
QString Unites; ... | 5 |
AbhinavGangwar12/C_Learning- | e550351 | Asignment11/answer10.c | C | www.github.com/AbhinavGangwar12/C_Learning-/tree/main/Asignment11/answer10.c | https://raw.githubusercontent.com/AbhinavGangwar12/C_Learning-/e550351/Asignment11/answer10.c | AbhinavGangwar12/C_Learning- e550351 Asignment11/answer10.c | true | 200 | 288 | #include<stdio.h>
int main(){
int num,i,digits,rem,rev=0;
printf("Enter any number : ");
scanf("%d",&num);
while (num != 0)
{
rem = num%10;
rev = rev*10 + rem;
num /= 10;
}
printf("Reverse number : %d",rev);
return 0;
} | 1 |
itanini/C-CPP-HUJI | d25d0b7 | EX2/sort_bus_lines.c | C | www.github.com/itanini/C-CPP-HUJI/tree/main/EX2/sort_bus_lines.c | https://raw.githubusercontent.com/itanini/C-CPP-HUJI/d25d0b7/EX2/sort_bus_lines.c | itanini/C-CPP-HUJI d25d0b7 EX2/sort_bus_lines.c | true | 200 | 2,549 | #include "sort_bus_lines.h"
#define BUFFER_SIZE 60
#define NO_ERROR 5
#define INVALID_NUM_OF_LINES 0
#define INVALID_LINE_NAME 1
#define INVALID_DISTANCE 2
#define INVALID_DURATION 3
#define ARG_LENGTH 21
/**
* swaps two BusLine objects.
* @param i Pointer to the first BusLine object.
* @param j P... | 6 |
kpatsakis/primevul5 | 87b7605 | 234490.c | C | www.github.com/kpatsakis/primevul5/tree/main/234490.c | https://raw.githubusercontent.com/kpatsakis/primevul5/87b7605/234490.c | kpatsakis/primevul5 87b7605 234490.c | true | 200 | 774 | bool JOIN::rollup_process_const_fields()
{
ORDER *group_tmp;
Item *item;
List_iterator<Item> it(all_fields);
for (group_tmp= group_list; group_tmp; group_tmp= group_tmp->next)
{
if (!(*group_tmp->item)->const_item())
continue;
while ((item= it++))
{
if (*group_tmp->item == item)
... | 7 |
VishwajeetGupta95/Dsa_Lab_File | 6d82ef5 | 12 Heap/all_in_one.c | C | www.github.com/VishwajeetGupta95/Dsa_Lab_File/tree/main/12 Heap/all_in_one.c | https://raw.githubusercontent.com/VishwajeetGupta95/Dsa_Lab_File/6d82ef5/12%20Heap/all_in_one.c | VishwajeetGupta95/Dsa_Lab_File 6d82ef5 12 Heap/all_in_one.c | true | 200 | 4,748 | // 1) Algorithm Build_Max_Heap(arr, n)
// 2) Pre: arr is an array of n elements, n is the size of the array
// 3) Post: arr is transformed into a max-heap
// 4) for i ← n / 2 - 1 down to 0 do
// 5) heapify(arr, n, i)
// 6) end for
// 7) return arr
// 8) end Build_Max_Heap
// 1) Algorithm Heapify(arr, n, i)
// 2) P... | 3 |
JV4K/Alarm-practice | e74da02 | Alarmiks/Core/Inc/button.h | C | www.github.com/JV4K/Alarm-practice/tree/main/Alarmiks/Core/Inc/button.h | https://raw.githubusercontent.com/JV4K/Alarm-practice/e74da02/Alarmiks/Core/Inc/button.h | JV4K/Alarm-practice e74da02 Alarmiks/Core/Inc/button.h | true | 200 | 458 | /*
* button.h
*
* Created on: Oct 23, 2023
* Author: JV4K
*/
#ifndef INC_BUTTON_H_
#define INC_BUTTON_H_
typedef struct {
unsigned int maximum;
unsigned int integrator; /* Will range from 0 to the specified maximum */
unsigned int output;
} Button_Handle_t;
Button_Handle_t* buttonInit(float debounce_... | 4 |
gustavo-lelli/Conic-Calculator | 31cb2d1 | conic_classifier.c | C | www.github.com/gustavo-lelli/Conic-Calculator/tree/main/conic_classifier.c | https://raw.githubusercontent.com/gustavo-lelli/Conic-Calculator/31cb2d1/conic_classifier.c | gustavo-lelli/Conic-Calculator 31cb2d1 conic_classifier.c | true | 200 | 12,949 | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
double **allocate_matrix() {
int i;
double **m;
m = (double **)malloc(3 * sizeof(double *));
for (i = 0; i < 3; i++) {
m[i] = (double *)calloc(3, sizeof(double));
}
return m;
}
void deallocate_matrix(double **m) {
int i... | 5 |
matthewwittenberg/alesis_q88 | a068e92 | User/keypad.c | C | www.github.com/matthewwittenberg/alesis_q88/tree/main/User/keypad.c | https://raw.githubusercontent.com/matthewwittenberg/alesis_q88/a068e92/User/keypad.c | matthewwittenberg/alesis_q88 a068e92 User/keypad.c | true | 200 | 5,464 | /*
* keypad.c
*
* Created on: Sep 20, 2023
* Author: matt
*/
#include "keypad.h"
#include "NUC100Series.h"
#include "sys_timer.h"
#include <string.h>
static keypad_event_callback _keypad_callback = NULL;
#define KEYPAD_DEBOUNCE_MS 50
#define KEYPAD_DELAY_LOOP_COUNT 10
#define KEYPAD_DELAY() delay = KEYPAD... | 2 |
TheUltimateFoxOS/FoxOS-programs | b2649e8 | foxe/render.c | C | www.github.com/TheUltimateFoxOS/FoxOS-programs/tree/main/foxe/render.c | https://raw.githubusercontent.com/TheUltimateFoxOS/FoxOS-programs/b2649e8/foxe/render.c | TheUltimateFoxOS/FoxOS-programs b2649e8 foxe/render.c | true | 200 | 2,521 | #include <render.h>
#include <foxe.h>
void render_tui() {
fox_start_frame(&graphics_buffer_info, true);
max_length_before_line_wrap = graphics_buffer_info.width / CHAR_WIDTH;
char edited = '-';
if (is_edited) {
edited = '+';
}
char buff[512] = { 0 };
sprintf(buff, "File: %s [%c] Mode: --%s-- Current Line:... | 0 |
11Anay/Logic-Building-Applications | f8aae92 | Program_174.c | C | www.github.com/11Anay/Logic-Building-Applications/tree/main/Program_174.c | https://raw.githubusercontent.com/11Anay/Logic-Building-Applications/f8aae92/Program_174.c | 11Anay/Logic-Building-Applications f8aae92 Program_174.c | true | 200 | 724 | #include<stdio.h>
#define ERR_NOT_FOUND -1
int LastOccurance(char *str, char cValue)
{
int iCnt = 1;
int iPos = ERR_NOT_FOUND;
while(*str != '\0')
{
if(*str == cValue)
{
iPos = iCnt;
}
str++;
iCnt++;
}
return iPos;
}
int main()
{
char A... | 6 |
gaph-pucrs/hemps_OSZ | 4cbba93 | software/modules/task_control.c | C | www.github.com/gaph-pucrs/hemps_OSZ/tree/main/software/modules/task_control.c | https://raw.githubusercontent.com/gaph-pucrs/hemps_OSZ/4cbba93/software/modules/task_control.c | gaph-pucrs/hemps_OSZ 4cbba93 software/modules/task_control.c | true | 200 | 8,673 | /*!\file task_control.c
* HEMPS VERSION - 8.0 - support for RT applications
*
* Distribution: June 2016
*
* Created by: Marcelo Ruaro - contact: marcelo.ruaro@acad.pucrs.br
*
* Research group: GAPH-PUCRS - contact: fernando.moraes@pucrs.br
*
* \brief
* This module implements function relative t... | 7 |
SebiIl/practice | 98c97c7 | Algoritmi_elementari/cmmdc.c | C | www.github.com/SebiIl/practice/tree/main/Algoritmi_elementari/cmmdc.c | https://raw.githubusercontent.com/SebiIl/practice/98c97c7/Algoritmi_elementari/cmmdc.c | SebiIl/practice 98c97c7 Algoritmi_elementari/cmmdc.c | true | 200 | 972 | #include<stdio.h>
int cmmdc(int nr1, int nr2);
int cmmmc(int nr1, int nr2);
int main()
{
printf("Program pentru cel mai mare divizor comun\n");
int nr1, nr2;
printf("Introduceti nr: ");
scanf("%d %d", &nr1, &nr2);
printf("CMMDC este: %d\n", cmmdc(nr1, nr2));
printf("CMMMC este: %d\n", cm... | 3 |
brainface/havenmud | ae9eab3 | lib/domains/westwood/areas/monastery/npc/pole_tr.c | C | www.github.com/brainface/havenmud/tree/main/lib/domains/westwood/areas/monastery/npc/pole_tr.c | https://raw.githubusercontent.com/brainface/havenmud/ae9eab3/lib/domains/westwood/areas/monastery/npc/pole_tr.c | brainface/havenmud ae9eab3 lib/domains/westwood/areas/monastery/npc/pole_tr.c | true | 200 | 921 | #include <lib.h>
inherit LIB_NPC;
#include "../monastery.h"
static void create() {
npc::create();
SetTown("Soleil");
SetProperty("monasterynoleave",1);
switch(random(2)){
case 0:
SetGender("male");
break;
case 1:
SetGender("female");
break;
}
SetKeyName("pole train... | 4 |
TasneemMahmoud/alx-low_level_programming | 914e15c | 0x0A-argc_argv/4-add.c | C | www.github.com/TasneemMahmoud/alx-low_level_programming/tree/main/0x0A-argc_argv/4-add.c | https://raw.githubusercontent.com/TasneemMahmoud/alx-low_level_programming/914e15c/0x0A-argc_argv/4-add.c | TasneemMahmoud/alx-low_level_programming 914e15c 0x0A-argc_argv/4-add.c | true | 200 | 447 | #include "main.h"
#include<stdio.h>
#include<stdlib.h>
/**
* main - program that adds positive numbers.
*
* @argc: arguments
* @argv: pointer array
*
* Return: Always 0 (success)
*/
int main(int argc, char **argv)
{
int res = 0;
char *s;
while (--argc)
{
for (s = argv[argc]; *s; s++)
if (*s < '0' ||... | 1 |
fohz67/epitech-dump | fce38e7 | B/CPE/210/Stumper 6/src/choose_word.c | C | www.github.com/fohz67/epitech-dump/tree/main/B/CPE/210/Stumper 6/src/choose_word.c | https://raw.githubusercontent.com/fohz67/epitech-dump/fce38e7/B/CPE/210/Stumper%206/src/choose_word.c | fohz67/epitech-dump fce38e7 B/CPE/210/Stumper 6/src/choose_word.c | true | 200 | 341 | /*
** EPITECH PROJECT, 2023
** choose_word.c
** File description:
** choose_word.c
*/
#include <stdlib.h>
#include "hangman.h"
char *choose_word(char **array)
{
int i = 0;
int random_nb = 0;
for (; array[i] != NULL; i++);
if (i == 0) {
return NULL;
}
random_nb = rand() % i;
return... | 5 |
CodeMaster17/My-C-lanhgauge-Practice | 78baad9 | 79_TRICKY_PRG1.c | C | www.github.com/CodeMaster17/My-C-lanhgauge-Practice/tree/main/79_TRICKY_PRG1.c | https://raw.githubusercontent.com/CodeMaster17/My-C-lanhgauge-Practice/78baad9/79_TRICKY_PRG1.c | CodeMaster17/My-C-lanhgauge-Practice 78baad9 79_TRICKY_PRG1.c | true | 200 | 245 | //HARSSHIT YADAV
//2105891
//solve this tricky program
#include<stdio.h>
int main()
{
printf("%d" ,printf("%s","hello world"));
// printf function also returns the number of characters that is succesfully prints on screen
return 0;
} | 2 |
khadas/rtos_audio_server_source | 4efa8b5 | common/id3v2.c | C | www.github.com/khadas/rtos_audio_server_source/tree/main/common/id3v2.c | https://raw.githubusercontent.com/khadas/rtos_audio_server_source/4efa8b5/common/id3v2.c | khadas/rtos_audio_server_source 4efa8b5 common/id3v2.c | true | 200 | 773 | /*
* Copyright (c) 2021 Fuzhou Rockchip Electronic Co.,Ltd
*
* SPDX-License-Identifier: Apache-2.0
*
* Change Logs:
* Date Author Notes
* 2021-03-16 Jair Wu First version
*
*/
#include "AudioConfig.h"
struct id3v2_header
{
char id3[3];
char mainVer;
char subVer;
char ... | 6 |
riapush/Numerical-Methods | 96d355e | NumMethods4/NumMethods4/Lab4.c | C | www.github.com/riapush/Numerical-Methods/tree/main/NumMethods4/NumMethods4/Lab4.c | https://raw.githubusercontent.com/riapush/Numerical-Methods/96d355e/NumMethods4/NumMethods4/Lab4.c | riapush/Numerical-Methods 96d355e NumMethods4/NumMethods4/Lab4.c | true | 200 | 12,335 | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <stdbool.h>
#include <string.h>
#pragma warning(disable : 4996)
void print_matrix(double** A, int N, int M)
{
printf("\n");
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
printf("%*.2lf& ", 6, A[i][j]);
}
printf("\\\\\n");
}
}
... | 0 |
miss-mimie/alx-low_level_programming | 30f1d86 | 0x01-variables_if_else_while/102-print_comb5.c | C | www.github.com/miss-mimie/alx-low_level_programming/tree/main/0x01-variables_if_else_while/102-print_comb5.c | https://raw.githubusercontent.com/miss-mimie/alx-low_level_programming/30f1d86/0x01-variables_if_else_while/102-print_comb5.c | miss-mimie/alx-low_level_programming 30f1d86 0x01-variables_if_else_while/102-print_comb5.c | true | 200 | 708 | #include <stdio.h>
/**
* main - Entry point
*
* This rints possible combination with range 0 to 99
* Numbers should be separated with a , then a space
* All numbers should be printed with two digits
* Numbers hsould be printed in ascending order
*
* Return: 0
*/
int main(void)
{
int i, j;
int a, b, c, d;
... | 7 |
guilhermedebrites/Aeds-II | 0bb05a1 | Estruturas de Dados/FilaWithCelula.c | C | www.github.com/guilhermedebrites/Aeds-II/tree/main/Estruturas de Dados/FilaWithCelula.c | https://raw.githubusercontent.com/guilhermedebrites/Aeds-II/0bb05a1/Estruturas%20de%20Dados/FilaWithCelula.c | guilhermedebrites/Aeds-II 0bb05a1 Estruturas de Dados/FilaWithCelula.c | true | 200 | 772 | #include <stdio.h>
#include <stdlib.h>
typedef struct Celula{
int elemento;
struct Celula *prox;
}
Celula* new_celula(int elemento){
Celula tmp* = (Celula*)malloc(sizeof(Celula));
tmp->elemento = elemento;
tmp->prox = NULL;
return tmp;
}
typedef struct Fila{
struct Celula *primeiro;
s... | 3 |
Bond408/Lab_26 | eb5f2ed | Task2/Task2.c | C | www.github.com/Bond408/Lab_26/tree/main/Task2/Task2.c | https://raw.githubusercontent.com/Bond408/Lab_26/eb5f2ed/Task2/Task2.c | Bond408/Lab_26 eb5f2ed Task2/Task2.c | true | 200 | 1,322 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
char** init(int size) {
static char* sports[] = { "golf", "hockey", "football", "cricket" };
int N = sizeof(sports) / sizeof(sports[0]);
char** arr = (char**)malloc(size * sizeof(char*));
if (!arr) {
perror("������ ��������� ������");
... | 4 |
eng-Bruno/estudos_EDA | ad3effa | EDA/Filas e Pilhas/pilha.c | C | www.github.com/eng-Bruno/estudos_EDA/tree/main/EDA/Filas e Pilhas/pilha.c | https://raw.githubusercontent.com/eng-Bruno/estudos_EDA/ad3effa/EDA/Filas%20e%20Pilhas/pilha.c | eng-Bruno/estudos_EDA ad3effa EDA/Filas e Pilhas/pilha.c | true | 200 | 594 | #include <stdio.h>
#include <stdlib.h>
struct prato
{
int cor;
struct prato *prox;
};
typedef struct prato Prato;
Prato *pilha;
void add(char cor){
Prato *p = (Prato*) malloc(sizeof(Prato));
p->cor = cor;
p->prox = pilha;
pilha = p;
}
void remover(){
if(pilha==NULL){
printf("PILHA VAZIA");
}else {
pilh... | 1 |
phanhao24/RaspberryPi | 2d9681a | LCD_I2C/lcd1602.c | C | www.github.com/phanhao24/RaspberryPi/tree/main/LCD_I2C/lcd1602.c | https://raw.githubusercontent.com/phanhao24/RaspberryPi/2d9681a/LCD_I2C/lcd1602.c | phanhao24/RaspberryPi 2d9681a LCD_I2C/lcd1602.c | true | 200 | 2,893 | #include <linux/module.h>
#include <linux/i2c.h>
#include <linux/init.h>
#include <linux/fs.h>
#include <linux/uaccess.h>
#include <linux/delay.h>
/* Meta Information */
MODULE_LICENSE("GPL");
MODULE_AUTHOR("Phan Hao");
MODULE_DESCRIPTION("A driver to write 'Hello World' to a LCD text display with I2C");
#define DRIV... | 5 |
garrza/utf-coding | 3bb24f2 | include/decoder.h | C | www.github.com/garrza/utf-coding/tree/main/include/decoder.h | https://raw.githubusercontent.com/garrza/utf-coding/3bb24f2/include/decoder.h | garrza/utf-coding 3bb24f2 include/decoder.h | true | 200 | 704 | #ifndef DECODER_H
#define DECODER_H
#include <stdint.h>
#include <stddef.h>
// Error codes for encoder operations
typedef enum
{
UTF_SUCCESS = 0,
UTF_INVALID_CODEPOINT,
UTF_BUFFER_TOO_SMALL,
UTF_INVALID_SEQUENCE
} utf_result_t;
// Gets the number of bytes needed to decode a codepoint
size_t utf8_deco... | 2 |
yunonXD/C_EDU | 1c08c54 | beakJoon/2753.c | C | www.github.com/yunonXD/C_EDU/tree/main/beakJoon/2753.c | https://raw.githubusercontent.com/yunonXD/C_EDU/1c08c54/beakJoon/2753.c | yunonXD/C_EDU 1c08c54 beakJoon/2753.c | true | 200 | 282 | #include<stdio.h>
#include<stdlib.h>
int main(int argc, char *argv[]){
int a= 0;
scanf("%d", &a);
if( a >=1 && a <=4000){
if( a%4 == 0 && a%100 !=0 || a%400 == 0)
puts("1");
else{
puts("0");
}
}
return 0;
} | 6 |
VinneB/POP3-Protocol-Server-and-Client | 74984e9 | shared.c | C | www.github.com/VinneB/POP3-Protocol-Server-and-Client/tree/main/shared.c | https://raw.githubusercontent.com/VinneB/POP3-Protocol-Server-and-Client/74984e9/shared.c | VinneB/POP3-Protocol-Server-and-Client 74984e9 shared.c | true | 200 | 1,386 | #include "shared.h"
int send_head (int sock, int head) {
int ret = 0;
head = htonl(head);
if (send(sock, &head, sizeof(int), 0) == -1) {
ret = errno;
errno = 0;
}
return ret;
}
int send_msg (int sock, char *msg, int msg_len) {
int bytes_sent = 0;
int ret = 0;
while (byt... | 3 |
gagan-0205/final-year-project-smart-traffic- | 6b14ccd | cars/main.c | C | www.github.com/gagan-0205/final-year-project-smart-traffic-/tree/main/cars/main.c | https://raw.githubusercontent.com/gagan-0205/final-year-project-smart-traffic-/6b14ccd/cars/main.c | gagan-0205/final-year-project-smart-traffic- 6b14ccd cars/main.c | true | 200 | 5,223 | #include <GL/glut.h>
#include <stdlib.h>
#include <stdio.h>
// Define a structure for a car
typedef struct {
float x;
float y;
float speed;
float size; // Size of the car (width and height)
int direction; // 0: left, 1: right, 2: up, 3: down
float red;
float green;
float blue;
} Car;
C... | 4 |
EliunKKy/SO | 5e1ba1c | Guião 8/sig1.c | C | www.github.com/EliunKKy/SO/tree/main/Guião 8/sig1.c | https://raw.githubusercontent.com/EliunKKy/SO/5e1ba1c/Gui%C3%A3o%208/sig1.c | EliunKKy/SO 5e1ba1c Guião 8/sig1.c | true | 200 | 399 | #include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include <unistd.h>
int main(int argc, char *argv[])
{
unsigned int i;
printf("PID = %u\n", getpid());
//printf("Cronómetro: ");
//scanf("%u", &i);
i = 0;
while (i <= 10) {
printf("\r%08u ", i++);
fflush(s... | 7 |
uu0901/Periph_code | 4c09814 | IIC/软件IIC读写MPU6050/MPU6050.c | C | www.github.com/uu0901/Periph_code/tree/main/IIC/软件IIC读写MPU6050/MPU6050.c | https://raw.githubusercontent.com/uu0901/Periph_code/4c09814/IIC/%E8%BD%AF%E4%BB%B6IIC%E8%AF%BB%E5%86%99MPU6050/MPU6050.c | uu0901/Periph_code 4c09814 IIC/软件IIC读写MPU6050/MPU6050.c | true | 200 | 10,288 | #include "stm32f10x.h" // Device header
#include "MyI2C.h"
#include "MPU6050_Reg.h"
#define MPU6050_ADDRESS 0xD0 //MPU6050的I2C从机地址
/**
* 函 数：MPU6050写寄存器
* 参 数：RegAddress 寄存器地址，范围：参考MPU6050手册的寄存器描述
* 参 数：Data 要写入寄存器的数据，范围：0x00~0xFF
* 返 回 值：无
*
* 指定地址写多个字节 ？？？？在最后的MyI2C_SendBye... | 0 |
Nikhilkumar-B/Embedded-training | 4b1c545 | area circle/triangleeis/main.c | C | www.github.com/Nikhilkumar-B/Embedded-training/tree/main/area circle/triangleeis/main.c | https://raw.githubusercontent.com/Nikhilkumar-B/Embedded-training/4b1c545/area%20circle/triangleeis/main.c | Nikhilkumar-B/Embedded-training 4b1c545 area circle/triangleeis/main.c | true | 200 | 366 | #include <stdio.h>
#include <stdlib.h>
int main()
{
int a,b,c;
printf("enter degrees \n");
scanf("%d%d%d",&a,&b,&c);
if(a==b&&b==c&&c==a)
{
printf("equilateral triangle \n ");
}
else if(a==b||b==c||c==a)
{
printf("isosceles triangle \n");
}
else
{
pri... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.