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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
Akulamadhumitha/codemind-c | b5e4342 | Average_of_the_array.c | C | www.github.com/Akulamadhumitha/codemind-c/tree/main/Average_of_the_array.c | https://raw.githubusercontent.com/Akulamadhumitha/codemind-c/b5e4342/Average_of_the_array.c | Akulamadhumitha/codemind-c b5e4342 Average_of_the_array.c | true | 200 | 240 | #include<stdio.h>
int main()
{
int i,n;
scanf("%d",&n);
int arr[n];
for(i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
float sum=0;
for(i=0;i<n;i++)
{
sum+=arr[i];
}
printf("%.2f",sum/n);
} | 5 |
Hibi-eth/alx-low_level_programming | e7e3b49 | 0x18-dynamic_libraries/100-atoi.c | C | www.github.com/Hibi-eth/alx-low_level_programming/tree/main/0x18-dynamic_libraries/100-atoi.c | https://raw.githubusercontent.com/Hibi-eth/alx-low_level_programming/e7e3b49/0x18-dynamic_libraries/100-atoi.c | Hibi-eth/alx-low_level_programming e7e3b49 0x18-dynamic_libraries/100-atoi.c | true | 200 | 557 | #include "main.h"
/**
* _atoi - converts a string to an ineger
* @s: string to be converted
*
* Return: the int converted from the string
*/
int _atoi(char *s)
{
int i, d, n, len, f, digit;
i = 0;
d = 0;
n = 0;
len = 0;
f = 0;
digit = 0;
while (s[len] != '\0')
{
if (s[i] == '-')
++d;
if (s[i] >... | 2 |
TheRobotAsimov/tutorial | 48e07a8 | code/example1.c | C | www.github.com/TheRobotAsimov/tutorial/tree/main/code/example1.c | https://raw.githubusercontent.com/TheRobotAsimov/tutorial/48e07a8/code/example1.c | TheRobotAsimov/tutorial 48e07a8 code/example1.c | true | 200 | 463 | #include <stdio.h>
int main(void)
{
int a = 10;
int b = 20;
int c = 30;
int c2 = 32;
int d = 40;
printf("Hello World!\n");
for (int i = 0; i < 10; i++)
{
printf("i = %d\n", i);
//////////////////////
printf("a = %d\n", a);
printf("b = %d\n", b);
... | 1 |
bhavana-shegokar/LogicBuilding | 4a9c3d6 | LB Assignment 9,10,11,12 Programs with Solution/A10Program1.c | C | www.github.com/bhavana-shegokar/LogicBuilding/tree/main/LB Assignment 9,10,11,12 Programs with Solution/A10Program1.c | https://raw.githubusercontent.com/bhavana-shegokar/LogicBuilding/4a9c3d6/LB%20Assignment%209%2C10%2C11%2C12%20Programs%20with%20Solution/A10Program1.c | bhavana-shegokar/LogicBuilding 4a9c3d6 LB Assignment 9,10,11,12 Programs with Solution/A10Program1.c | true | 200 | 1,011 | //Accept N number from user and return frequency of even numbers.
#include<stdio.h>
#include<stdlib.h>
int CountEven(int Arr[],int iLength)
{
int iCnt = 0;
int iCount = 0;
for(iCnt = 0 ; iCnt < iLength; iCnt++)
{
if((Arr[iCnt] % 2) == 0)
{
iCount++;
}
}
retu... | 6 |
APONTES19/Minishell | 7cb18ac | src/redirection_1.c | C | www.github.com/APONTES19/Minishell/tree/main/src/redirection_1.c | https://raw.githubusercontent.com/APONTES19/Minishell/7cb18ac/src/redirection_1.c | APONTES19/Minishell 7cb18ac src/redirection_1.c | true | 200 | 2,758 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* redirection_1.c :+: :+: :+: ... | 3 |
alaa2003515/alx-low_level_programming | 8f20913 | 0x01-variables_if_else_while/9-print_comb.c | C | www.github.com/alaa2003515/alx-low_level_programming/tree/main/0x01-variables_if_else_while/9-print_comb.c | https://raw.githubusercontent.com/alaa2003515/alx-low_level_programming/8f20913/0x01-variables_if_else_while/9-print_comb.c | alaa2003515/alx-low_level_programming 8f20913 0x01-variables_if_else_while/9-print_comb.c | true | 200 | 285 | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
/**
* main - Entry point
*
* Return: Always 0 (Success)
*/
int main(void)
{
int var;
for (var = 48 ; var <= 57 ; var++)
{
putchar(var);
if (var != 57)
{
putchar(',');
putchar(' ');
}
}
putchar('\n');
return (0);
}
| 0 |
zachafs/alx-low_level_programming | 46d70cd | 0x0E-structures_typedef/4-new_dog.c | C | www.github.com/zachafs/alx-low_level_programming/tree/main/0x0E-structures_typedef/4-new_dog.c | https://raw.githubusercontent.com/zachafs/alx-low_level_programming/46d70cd/0x0E-structures_typedef/4-new_dog.c | zachafs/alx-low_level_programming 46d70cd 0x0E-structures_typedef/4-new_dog.c | true | 200 | 1,119 | #include <stdlib.h>
#include "dog.h"
/**
* new_dog - creates a new dog
* @name: name of dog
* @age: age of dog
* @owner: owner of dog
*
* Return: pointer to new dog, NULL on failure
*/
dog_t *new_dog(char *name, float age, char *owner)
{
dog_t *new_dog;
char *new_name, *new_owner;
int name_len = 0, owner_len... | 4 |
DouglasAton/logica-algoritmo | 8253c44 | c/glicose.c | C | www.github.com/DouglasAton/logica-algoritmo/tree/main/c/glicose.c | https://raw.githubusercontent.com/DouglasAton/logica-algoritmo/8253c44/c/glicose.c | DouglasAton/logica-algoritmo 8253c44 c/glicose.c | true | 200 | 311 | #include <stdio.h>
int main() {
double glicose;
printf("Digite a medida da glicose: ");
scanf("%lf", &glicose);
if (glicose <= 100) {
printf("Normal\n");
}
else if (glicose <= 140) {
printf("Elevado\n");
}
else
printf("Diabetes\n");
return 0;
}
| 5 |
zwm325715/unix_book_code | 193e278 | apue/src/10/tsleep2_10.10.c | C | www.github.com/zwm325715/unix_book_code/tree/main/apue/src/10/tsleep2_10.10.c | https://raw.githubusercontent.com/zwm325715/unix_book_code/193e278/apue/src/10/tsleep2_10.10.c | zwm325715/unix_book_code 193e278 apue/src/10/tsleep2_10.10.c | true | 200 | 1,274 | #include "apue.h"
unsigned int sleep2(unsigned int);
static void sig_int(int);
//图10-9 在一个捕捉其他信号的程序调用sleep2
int main(void) {
unsigned int unslept;
//设置SIGINT的信号handler为sig_int
if (signal(SIGINT, sig_int) == SIG_ERR){
err_sys("signal(SIGINT) error");
}
//调用sleep2_10.10.c的中sleep2实现
printf("main---call sleep2 f... | 2 |
z4okolatka/Chat | ec373d8 | chatclient.c | C | www.github.com/z4okolatka/Chat/tree/main/chatclient.c | https://raw.githubusercontent.com/z4okolatka/Chat/ec373d8/chatclient.c | z4okolatka/Chat ec373d8 chatclient.c | true | 200 | 6,185 | #include <ncurses.h>
#include <stdio.h>
#include "chatclient.h"
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <pthread.h>
#include <arpa/inet.h>
#include <errno.h>
#include "defines.h"
#include "debug.h"
ChatClient initChatClient(char server_ip[SERVER_IP_BUFFER], int server_port, char username[U... | 6 |
IlyaKapralov/numerical-methods | f977b24 | numpy/numpy/_core/src/common/gil_utils.c | C | www.github.com/IlyaKapralov/numerical-methods/tree/main/numpy/numpy/_core/src/common/gil_utils.c | https://raw.githubusercontent.com/IlyaKapralov/numerical-methods/f977b24/numpy/numpy/_core/src/common/gil_utils.c | IlyaKapralov/numerical-methods f977b24 numpy/numpy/_core/src/common/gil_utils.c | true | 200 | 1,221 | #define NPY_NO_DEPRECATED_API NPY_API_VERSION
#define _MULTIARRAYMODULE
#define PY_SSIZE_T_CLEAN
#include <Python.h>
#include <numpy/ndarraytypes.h>
#include <stdarg.h>
NPY_NO_EXPORT void
npy_gil_error(PyObject *type, const char *format, ...)
{
va_list va;
va_start(va, format);
NPY_ALLOW_C_API_DEF;
... | 7 |
PenguinPepper/alx-low_level_programming | 43ce5fa | 0x06-pointers_arrays_strings/3-strcmp.c | C | www.github.com/PenguinPepper/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/3-strcmp.c | https://raw.githubusercontent.com/PenguinPepper/alx-low_level_programming/43ce5fa/0x06-pointers_arrays_strings/3-strcmp.c | PenguinPepper/alx-low_level_programming 43ce5fa 0x06-pointers_arrays_strings/3-strcmp.c | true | 200 | 477 | #include "main.h"
/**
* _strcmp - compares two strings
* @s1: variable containing string or first string to be compared
* @s2: variable containg string or sec string to be compared
*
* Description: works exaclty like strcmp function
* Return: if all goes well o
*/
int _strcmp(char *s1, char *s2)
{
int a, b;
... | 1 |
gm-sourav/Cse-Lab | d2b510b | function_of_sum.c | C | www.github.com/gm-sourav/Cse-Lab/tree/main/function_of_sum.c | https://raw.githubusercontent.com/gm-sourav/Cse-Lab/d2b510b/function_of_sum.c | gm-sourav/Cse-Lab d2b510b function_of_sum.c | true | 200 | 334 | #include<stdio.h>
int sum(int n1,int n2,int n3);
int main()
{
int a,b,c,result;
printf("Enter three integer number :- ");
scanf("%d %d %d",&a,&b,&c);
result = sum(a,b,c);
printf("Sum is %d\n",result);
return 0;
}
int sum(int n1,int n2,int n3)
{
return (n1 + n2 +... | 0 |
kinoko-neko/Uni | 1d75911 | embedded systems/6/zad3.c | C | www.github.com/kinoko-neko/Uni/tree/main/embedded systems/6/zad3.c | https://raw.githubusercontent.com/kinoko-neko/Uni/1d75911/embedded%20systems/6/zad3.c | kinoko-neko/Uni 1d75911 embedded systems/6/zad3.c | true | 200 | 856 | #include <avr/interrupt.h>
#include <avr/sleep.h>
#include <avr/io.h>
#include <util/delay.h>
//#include <avr/pgmspace.h>
#include "d3.h"
void spi_init(){
// ustaw piny MOSI, SCK i ~SS jako wyjścia
DDRB |= _BV(DDB3) | _BV(DDB5) | _BV(DDB2);
// włącz SPI w trybie master z zegarem 250 kHz
SPCR = _BV(SPE) |... | 5 |
ShadyM97/alx-low_level_programming | 5382418 | 0x05-pointers_arrays_strings/8-print_array.c | C | www.github.com/ShadyM97/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/8-print_array.c | https://raw.githubusercontent.com/ShadyM97/alx-low_level_programming/5382418/0x05-pointers_arrays_strings/8-print_array.c | ShadyM97/alx-low_level_programming 5382418 0x05-pointers_arrays_strings/8-print_array.c | true | 200 | 409 | #include<stdio.h>
#include"main.h"
/**
* print_array - function that prints n elements of an array of integers
*@a: pointer to array
*@n: number of elements
*
* Return: void
*/
void print_array(int *a, int n)
{
int i;
if (n > 0)
{
for (i = 0; i < n; i++)
{
if (i != (n - 1))
{
printf("%d, ", a[i]... | 4 |
globsky/greta-oto | 8e280d6 | Firmware/Baseband/src/TaskManager.c | C | www.github.com/globsky/greta-oto/tree/main/Firmware/Baseband/src/TaskManager.c | https://raw.githubusercontent.com/globsky/greta-oto/8e280d6/Firmware/Baseband/src/TaskManager.c | globsky/greta-oto 8e280d6 Firmware/Baseband/src/TaskManager.c | true | 200 | 4,720 | //----------------------------------------------------------------------
// TaskManager.c:
// Task management functions
//
// Copyright (C) 2020-2029 by Jun Mo, All rights reserved.
//
//----------------------------------------------------------------------
#include <stdio.h>
#include <memory.h>
#include "Ta... | 3 |
tasmanday/42_mini_rt | f5835fe | libft/src/string/ft_strstr.c | C | www.github.com/tasmanday/42_mini_rt/tree/main/libft/src/string/ft_strstr.c | https://raw.githubusercontent.com/tasmanday/42_mini_rt/f5835fe/libft/src/string/ft_strstr.c | tasmanday/42_mini_rt f5835fe libft/src/string/ft_strstr.c | true | 200 | 1,581 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_strstr.c :+: :+: :+: ... | 2 |
irtnog/so-much-stuff-cvs-mirror | fbdf542 | trunk/net/starchart/observe/outsif.c | C | www.github.com/irtnog/so-much-stuff-cvs-mirror/tree/main/trunk/net/starchart/observe/outsif.c | https://raw.githubusercontent.com/irtnog/so-much-stuff-cvs-mirror/fbdf542/trunk/net/starchart/observe/outsif.c | irtnog/so-much-stuff-cvs-mirror fbdf542 trunk/net/starchart/observe/outsif.c | true | 200 | 9,859 | /*
* outsif.c
* Output .sif and .star files for object(s)
*
* Copyright (c) 1990 by Craig Counterman. All rights reserved.
*
* This software may be redistributed freely, not sold.
* This copyright notice and disclaimer of warranty must remain
* unchanged.
*
* No representation is made about the suitabilit... | 7 |
snvas/42course_study_C | 4b05c9d | exercicio_funcoes_procedimentos/aula153.c | C | www.github.com/snvas/42course_study_C/tree/main/exercicio_funcoes_procedimentos/aula153.c | https://raw.githubusercontent.com/snvas/42course_study_C/4b05c9d/exercicio_funcoes_procedimentos/aula153.c | snvas/42course_study_C 4b05c9d exercicio_funcoes_procedimentos/aula153.c | true | 200 | 315 | #include <stdio.h>
#include <stdlib.h>
void imprimir(int x)
{
if(x == 0)
printf("%d ", x);
else{
// printf("%d ", x); descrescente
imprimir(x - 1);
printf("%d ", x); // crescente
}
}
int main(void)
{
int n;
printf("Digite um valor maior que zero: ");
scanf("%d", &n);
imprimir(n);
return (0);
} | 1 |
Tez-cyber/alx-low_level_programming | 717b69b | 0x05-pointers_arrays_strings/4-print_rev.c | C | www.github.com/Tez-cyber/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/4-print_rev.c | https://raw.githubusercontent.com/Tez-cyber/alx-low_level_programming/717b69b/0x05-pointers_arrays_strings/4-print_rev.c | Tez-cyber/alx-low_level_programming 717b69b 0x05-pointers_arrays_strings/4-print_rev.c | true | 200 | 208 | #include "main.h"
/**
* print_rev - Prints a string in reverse.
* @s: The string to be printed.
*/
void print_rev(char *s)
{
int len = strlen(s);
while (len--)
putchar(*(s + len));
putchar(10);
}
| 6 |
dinhocss/exercicios_C | 62b37fb | Lista 2 - Estruturas de Decisão/lista2.exercicio3.c | C | www.github.com/dinhocss/exercicios_C/tree/main/Lista 2 - Estruturas de Decisão/lista2.exercicio3.c | https://raw.githubusercontent.com/dinhocss/exercicios_C/62b37fb/Lista%202%20-%20Estruturas%20de%20Decis%C3%A3o/lista2.exercicio3.c | dinhocss/exercicios_C 62b37fb Lista 2 - Estruturas de Decisão/lista2.exercicio3.c | true | 200 | 744 | /*
3.Faça um programa que leia a idade de um nadador e que calcule e mostre a sua categoria
seguindo as regras:
-> Categoria baby: até 4 anos
-> Categoria infantil: 5-10 anos
-> Categoria juvenil: 11-17 anos
-> Categoria master: a partir de 18 anos
*/
#include <stdio.h>
void categoria(int idade){
i... | 0 |
anabarbara07/do-while-e-while | bc47e61 | do_while.c | C | www.github.com/anabarbara07/do-while-e-while/tree/main/do_while.c | https://raw.githubusercontent.com/anabarbara07/do-while-e-while/bc47e61/do_while.c | anabarbara07/do-while-e-while bc47e61 do_while.c | true | 200 | 315 | #include<stdio.h>
float n1,n2,m;
char nome;
int c;
main(){
c=0;
do{
printf("\ndigite o nome do aluno: ");
scanf("\n%c",&nome);
printf("nota 1: ");
scanf("\n%f",&n1);
printf("nota 2: ");
scanf("\n%f",&n2);
m=(n1+n2)/2;
c=c+1;
printf("\na media e igual a %f",m);
}
while(c<5);{
}
}
| 5 |
xuehuachunsheng/HongxiuTeamCode | dd4cc82 | ZT/ZT/scanf的&何时使用.c | C | www.github.com/xuehuachunsheng/HongxiuTeamCode/tree/main/ZT/ZT/scanf的&何时使用.c | https://raw.githubusercontent.com/xuehuachunsheng/HongxiuTeamCode/dd4cc82/ZT/ZT/scanf%E7%9A%84%26%E4%BD%95%E6%97%B6%E4%BD%BF%E7%94%A8.c | xuehuachunsheng/HongxiuTeamCode dd4cc82 ZT/ZT/scanf的&何时使用.c | true | 200 | 424 | #include<stdio.h>
int main(void)
{
int age;
int assets;
char pet[30];
printf("Enter your age,assets,and favorite pet.\n");
scanf("%d %f",&age,&assets);
scanf("%s",pet);/*scanf�ڶ�ȡ�ַ���ʱ����������һ���հ��ַ�(�����ո� �Ʊ��� ���з��ȣ���
��Ϊ�Ѿ���ɶ�ȡ���������ݲ��ٶ�ȡ�����Ǵ��뻺�������ȴ���һ������scanf
ʱ���û������... | 2 |
SIDDIQST1/alx-low_level_programming | 2bba09e | 0x01-variables_if_else_while/4-print_alphabt.c | C | www.github.com/SIDDIQST1/alx-low_level_programming/tree/main/0x01-variables_if_else_while/4-print_alphabt.c | https://raw.githubusercontent.com/SIDDIQST1/alx-low_level_programming/2bba09e/0x01-variables_if_else_while/4-print_alphabt.c | SIDDIQST1/alx-low_level_programming 2bba09e 0x01-variables_if_else_while/4-print_alphabt.c | true | 200 | 266 | #include <stdio.h>
/**
* main - Entry point
*
* Return: Alway 0 (Success)
*/
int main(void)
{
char alphabet;
for (alphabet = 'a'; alphabet <= 'z'; ++alphabet)
{
if (alphabet != 'q' && alphabet != 'e')
putchar(alphabet);
}
putchar('\n');
return (0);
}
| 4 |
Amani1617/alx-low_level_programming | d3fbc4b | 0x04-more_functions_nested_loops/10-print_triangle.c | C | www.github.com/Amani1617/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/10-print_triangle.c | https://raw.githubusercontent.com/Amani1617/alx-low_level_programming/d3fbc4b/0x04-more_functions_nested_loops/10-print_triangle.c | Amani1617/alx-low_level_programming d3fbc4b 0x04-more_functions_nested_loops/10-print_triangle.c | true | 200 | 349 | #include "main.h"
/**
* print_triangle - prints a triangle
* @n: size of the triangle
* Return: Always 0
*/
void print_triangle(int n)
{
int h, tri ;
if (n>0)
for(h <2, h >= 100, n++=)
{
fo r(n <2, n >= 100, n+=)
{
_putchar('\n')
for(h <2, h >= 100, n++=)
putchar('\n')
if (n>0)
continue
putch... | 7 |
Karthik-Ramkumar/iop-assign | 6aba02f | sem-1/lab_3/maxandmin_33.c | C | www.github.com/Karthik-Ramkumar/iop-assign/tree/main/sem-1/lab_3/maxandmin_33.c | https://raw.githubusercontent.com/Karthik-Ramkumar/iop-assign/6aba02f/sem-1/lab_3/maxandmin_33.c | Karthik-Ramkumar/iop-assign 6aba02f sem-1/lab_3/maxandmin_33.c | true | 200 | 765 | #include <stdio.h>
int main()
{
int min, max, check1, input, i;
printf("Enter how many numbers you want to enter: \n");
scanf("%d", &input);
if (input < 1)
{
printf("You need to enter at least 1 number.\n");
return 0;
}
printf("Enter number 1: \n");
scanf("%d", &max... | 6 |
nadaMAoui/holbertonschool-low_level_programming | 3b4b2e6 | more_singly_linked_lists/6-pop_listint.c | C | www.github.com/nadaMAoui/holbertonschool-low_level_programming/tree/main/more_singly_linked_lists/6-pop_listint.c | https://raw.githubusercontent.com/nadaMAoui/holbertonschool-low_level_programming/3b4b2e6/more_singly_linked_lists/6-pop_listint.c | nadaMAoui/holbertonschool-low_level_programming 3b4b2e6 more_singly_linked_lists/6-pop_listint.c | true | 200 | 325 | #include "lists.h"
#include <stdlib.h>
/**
* pop_listint - delete the head node
* @head: linked list
*Return: int
*/
int pop_listint(listint_t **head)
{
int pos = 0;
listint_t *newnode = NULL;
if (!*head)
return (0);
newnode = (*head)->next;
pos = (*head)->n;
free(*head);
(*head) = newnode;
return (pos... | 1 |
mbailes/fastchive | 727f7bf | heat.C | C | www.github.com/mbailes/fastchive/tree/main/heat.C | https://raw.githubusercontent.com/mbailes/fastchive/727f7bf/heat.C | mbailes/fastchive 727f7bf heat.C | true | 200 | 439 | #include <cpgplot.h>
void heat()
{
int logarithmic=0;
int itf = 0;
float contrast=1.0;
float brightness=0.5;
if (logarithmic)
itf = 1;
cpgsitf (itf);
float heat_l[] = {0.0, 0.2, 0.4, 0.6, 1.0};
float heat_r[] = {0.0, 0.5, 1.0, 1.0, 1.0};
float heat_g[] = {0.0, 0.0, 0.5, 1.0, 1.0};
floa... | 0 |
Fred-O-Nyarko/alx-low_level_programming | aea9eee | 0x01-variables_if_else_while/4-print_alphabt.c | C | www.github.com/Fred-O-Nyarko/alx-low_level_programming/tree/main/0x01-variables_if_else_while/4-print_alphabt.c | https://raw.githubusercontent.com/Fred-O-Nyarko/alx-low_level_programming/aea9eee/0x01-variables_if_else_while/4-print_alphabt.c | Fred-O-Nyarko/alx-low_level_programming aea9eee 0x01-variables_if_else_while/4-print_alphabt.c | true | 200 | 259 | # include <stdio.h>
/**
* main - Entry point
*
* Return: 0 (Success)
*/
int main(void)
{
char a = 'a', z = 'z';
while (a <= z)
{
if ((a != 'e') && (a != 'q'))
{
putchar(a);
a++;
}
else
{
a++;
}
}
putchar('\n');
return (0);
}
| 3 |
DJ-MrJay/alx-low_level_programming | df733fa | 0x06-pointers_arrays_strings/1-strncat.c | C | www.github.com/DJ-MrJay/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/1-strncat.c | https://raw.githubusercontent.com/DJ-MrJay/alx-low_level_programming/df733fa/0x06-pointers_arrays_strings/1-strncat.c | DJ-MrJay/alx-low_level_programming df733fa 0x06-pointers_arrays_strings/1-strncat.c | true | 200 | 541 | #include "main.h"
/**
* _strncat - Concatenates two strings using at most n bytes from src.
* @dest: Pointer to the destination string.
* @src: Pointer to the source string.
* @n: Maximum number of bytes to use from src.
*
* Return: Pointer to the resulting string `dest`.
*/
char *_strncat(char *dest, char *src... | 2 |
MedBens02/monty | d55e3a2 | queue_switch.c | C | www.github.com/MedBens02/monty/tree/main/queue_switch.c | https://raw.githubusercontent.com/MedBens02/monty/d55e3a2/queue_switch.c | MedBens02/monty d55e3a2 queue_switch.c | true | 200 | 678 | #include "monty.h"
/**
* f_queue_switch - switches to queue mode
* @head: stack head
* @counter: line count
*/
void f_queue_switch(stack_t **head, unsigned int counter)
{
(void)head;
(void)counter;
util.flag = 1;
}
/**
* add_dnodeint_end - add node to the end of stack
* @head: head of the stack
* @n: new val... | 4 |
SahilSaharn/C-practiced-programs | a02cb06 | smallestpair.c | C | www.github.com/SahilSaharn/C-practiced-programs/tree/main/smallestpair.c | https://raw.githubusercontent.com/SahilSaharn/C-practiced-programs/a02cb06/smallestpair.c | SahilSaharn/C-practiced-programs a02cb06 smallestpair.c | true | 200 | 622 | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
int compare(const void *a,const void *b)
{
const int *aa=a;
const int *bb=b;
return *aa-*bb;
}
int main()
{
int test,size,i,j,temp;
scanf("%d",&test);
while(test--)
{
scanf("%d",&size);
int arr[size];
... | 1 |
Xavier0301/PIMbthowen | 71dd6ac | host/app.c | C | www.github.com/Xavier0301/PIMbthowen/tree/main/host/app.c | https://raw.githubusercontent.com/Xavier0301/PIMbthowen/71dd6ac/host/app.c | Xavier0301/PIMbthowen 71dd6ac host/app.c | true | 200 | 14,188 | /**
* app.c
* Host Application Source File
*
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
#include <dpu.h>
#include <dpu_log.h>
#include <unistd.h>
#include <getopt.h>
#include <assert.h>
#include "../support/common.h"
#include "../support/timer.h"
#include "../support/params.h"
... | 7 |
paida09/alx-low_level_programming | 30d91c7 | 0x18-dynamic_libraries/2-strncpy.c | C | www.github.com/paida09/alx-low_level_programming/tree/main/0x18-dynamic_libraries/2-strncpy.c | https://raw.githubusercontent.com/paida09/alx-low_level_programming/30d91c7/0x18-dynamic_libraries/2-strncpy.c | paida09/alx-low_level_programming 30d91c7 0x18-dynamic_libraries/2-strncpy.c | true | 200 | 356 | #include "main.h"
/**
* _strncpy - Copy a string
* @dest: The destination value
* @src: The source value
* @n: The copy limit
*
* Return: dest
*/
char *_strncpy(char *dest, char *src, int n)
{
int j;
j = 0;
while (j < n && src[j] != '\0')
{
dest[j] = src[j];
j++;
}
while (j < n)
{
dest[j] ... | 6 |
damianobivona/Fondamenti-di-Informatica | 5c430eb | es-1-bivona-damiano-30-esame.c | C | www.github.com/damianobivona/Fondamenti-di-Informatica/tree/main/es-1-bivona-damiano-30-esame.c | https://raw.githubusercontent.com/damianobivona/Fondamenti-di-Informatica/5c430eb/es-1-bivona-damiano-30-esame.c | damianobivona/Fondamenti-di-Informatica 5c430eb es-1-bivona-damiano-30-esame.c | true | 200 | 1,331 |
/* Esercizio 1: Sostituzione elementi in un array
Si scriva un programma in C che permetta allʼutente di inserire N numeri interi e di memorizzarli in un array.
Successivamente, il programma deve chiedere allʼutente di specificare un numero tra quelli inseriti e un
nuovo valore con cui sostituirlo.
Per effettuare que... | 0 |
santirodriguezzz/holbertonschool-low_level_programming | 26b2236 | more_malloc_free/0-malloc_checked.c | C | www.github.com/santirodriguezzz/holbertonschool-low_level_programming/tree/main/more_malloc_free/0-malloc_checked.c | https://raw.githubusercontent.com/santirodriguezzz/holbertonschool-low_level_programming/26b2236/more_malloc_free/0-malloc_checked.c | santirodriguezzz/holbertonschool-low_level_programming 26b2236 more_malloc_free/0-malloc_checked.c | true | 200 | 283 | #include "main.h"
#include <stdlib.h>
/**
*malloc_checked - funcion que asigna memoria con malloc
*@b: valor para array
*Return: array
*/
void *malloc_checked(unsigned int b)
{
int *array;
array = malloc(b);
if (array == NULL)
{
free(array);
exit(98);
}
return (array);
}
| 5 |
Bassem-Ibrahiem/alx-low_level_programming | 9729f6b | 0x02-functions_nested_loops/102-fibonacci.c | C | www.github.com/Bassem-Ibrahiem/alx-low_level_programming/tree/main/0x02-functions_nested_loops/102-fibonacci.c | https://raw.githubusercontent.com/Bassem-Ibrahiem/alx-low_level_programming/9729f6b/0x02-functions_nested_loops/102-fibonacci.c | Bassem-Ibrahiem/alx-low_level_programming 9729f6b 0x02-functions_nested_loops/102-fibonacci.c | true | 200 | 329 | #include "stdio.h"
/**
* main - prints the first 50 Fibonacci numbers starting with 1 and 2
*
* Return: int.
*/
int main(void)
{
long a = 0;
long b = 1;
int n = 0;
long f;
while (n < 50)
{
f = b + a;
if (n != 49)
printf("%ld, ", f);
else
printf("%ld\n", f);
a = b;
b = f;
n += 1;
}
retur... | 3 |
MudRen/bxcy | f744a7b | d/npc/m_weapon/npc/tianjianshi.c | C | www.github.com/MudRen/bxcy/tree/main/d/npc/m_weapon/npc/tianjianshi.c | https://raw.githubusercontent.com/MudRen/bxcy/f744a7b/d/npc/m_weapon/npc/tianjianshi.c | MudRen/bxcy f744a7b d/npc/m_weapon/npc/tianjianshi.c | true | 200 | 7,991 | // npc: /d/xingxiu/npc/afanti.c
// Jay 3/26/96
#include <ansi.h>
inherit NPC;
int do_weapon();
object creat_weapon();
void create()
{
set_name("ŷұ��", ({ "ouye zi", "zi" }) );
set("nickname", RED "���Ľ���" NOR );
set("gender", "����" );
set("age", 60);
set("long",
"�... | 4 |
weiyuanzhu/stm32mp157_drivers | b79d000 | first_drv/test.c | C | www.github.com/weiyuanzhu/stm32mp157_drivers/tree/main/first_drv/test.c | https://raw.githubusercontent.com/weiyuanzhu/stm32mp157_drivers/b79d000/first_drv/test.c | weiyuanzhu/stm32mp157_drivers b79d000 first_drv/test.c | true | 200 | 551 | #include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <stdio.h>
int main(int argc, char **argv)
{
int fd;
int val = 1;
fd = open("/dev/xyz",O_RDWR);
if(fd < 0)
printf("can't open!\n");
if (argc != 2)
{
printf("Usage :\n");
printf("%s <on|off>\n", argv... | 2 |
nexos-dev/nexnix | 2e6b1db | source/hosttools/nnbuild/nnbuild.h | C | www.github.com/nexos-dev/nexnix/tree/main/source/hosttools/nnbuild/nnbuild.h | https://raw.githubusercontent.com/nexos-dev/nexnix/2e6b1db/source/hosttools/nnbuild/nnbuild.h | nexos-dev/nexnix 2e6b1db source/hosttools/nnbuild/nnbuild.h | true | 200 | 2,607 | /*
nnbuild.h - contains nnbuild header stuff
Copyright 2022 - 202444 The NexNix Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/L... | 1 |
elik2020/C_ASSEMBLER | d5d647d | Utility/general_functions.c | C | www.github.com/elik2020/C_ASSEMBLER/tree/main/Utility/general_functions.c | https://raw.githubusercontent.com/elik2020/C_ASSEMBLER/d5d647d/Utility/general_functions.c | elik2020/C_ASSEMBLER d5d647d Utility/general_functions.c | true | 200 | 3,198 | #include "../Utility/general_functions.h"
#include "../Utility/operation_handler.h"
#include "../Utility/directives_handler.h"
#include "../Utility/symbol_table.h"
int isRegister(char *name)
{
return strlen(name) == REGISTER_NAME_LENGTH && name[0] == 'r' && name[1] >= '0' && name[1] <= '7';
}
int isNumber(char* n... | 7 |
AbouN/alx-low_level_programming | 88c39c1 | 0x0B-malloc_free/0-create_array.c | C | www.github.com/AbouN/alx-low_level_programming/tree/main/0x0B-malloc_free/0-create_array.c | https://raw.githubusercontent.com/AbouN/alx-low_level_programming/88c39c1/0x0B-malloc_free/0-create_array.c | AbouN/alx-low_level_programming 88c39c1 0x0B-malloc_free/0-create_array.c | true | 200 | 341 | #include "main.h"
#include <stdlib.h>
/**
* *create_array -> creates an array of chars
* @size: number of bytes
* @c: character
* Return: array or null
*/
char *create_array(unsigned int size, char c)
{
char *array = malloc(size);
if (size == 0 || array == 0)
return (NULL);
while (size--)
array[size] = c... | 6 |
farshadahmadian/so_long | 165e07f | so_long/srcs/bonus/map_validation/map_init/set_map_enemy_bonus.c | C | www.github.com/farshadahmadian/so_long/tree/main/so_long/srcs/bonus/map_validation/map_init/set_map_enemy_bonus.c | https://raw.githubusercontent.com/farshadahmadian/so_long/165e07f/so_long/srcs/bonus/map_validation/map_init/set_map_enemy_bonus.c | farshadahmadian/so_long 165e07f so_long/srcs/bonus/map_validation/map_init/set_map_enemy_bonus.c | true | 200 | 1,546 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* set_map_enemy_bonus.c :+: :+: :+: ... | 5 |
FatihSir/alx-low_level_programming | 59b6bad | 0x0B-malloc_free/3-alloc_grid.c | C | www.github.com/FatihSir/alx-low_level_programming/tree/main/0x0B-malloc_free/3-alloc_grid.c | https://raw.githubusercontent.com/FatihSir/alx-low_level_programming/59b6bad/0x0B-malloc_free/3-alloc_grid.c | FatihSir/alx-low_level_programming 59b6bad 0x0B-malloc_free/3-alloc_grid.c | true | 200 | 695 | #include "main.h"
/**
* alloc_grid - a function that returns a pointer to a
* 2 dimensional array of integers.
*
* @width: the width of the array
* @height: the height of the array
*
* Return: returns a pointer to a 2 dimensional array of integers
*/
int **alloc_grid(int width, int height)
{
int **ptr;
int n, m;
if... | 3 |
54nd339/Algorithms | ef6b854 | 3_DP/MCM.c | C | www.github.com/54nd339/Algorithms/tree/main/3_DP/MCM.c | https://raw.githubusercontent.com/54nd339/Algorithms/ef6b854/3_DP/MCM.c | 54nd339/Algorithms ef6b854 3_DP/MCM.c | true | 200 | 1,956 | #include<stdio.h>
#include<stdlib.h>
#include<limits.h>
int tabulate(int *arr, int n) {
int **dp = (int **)malloc(n*sizeof(int *));
for (int i = 1; i < n; i++) {
dp[i] = (int *)malloc(n*sizeof(int));
for (int j = 0; j < n; j++)
dp[i][j] = INT_MAX;
dp[i][i] = 0;
}
for (... | 2 |
Astra-max/alx-low_level_programming | 5aa1d5b | 0x04-more_functions_nested_loops/7-print_diagonal.c | C | www.github.com/Astra-max/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/7-print_diagonal.c | https://raw.githubusercontent.com/Astra-max/alx-low_level_programming/5aa1d5b/0x04-more_functions_nested_loops/7-print_diagonal.c | Astra-max/alx-low_level_programming 5aa1d5b 0x04-more_functions_nested_loops/7-print_diagonal.c | true | 200 | 307 | #include "main.h"
/**
* print_diagonal - Prints diagonal lines
* @n: Test number
*
*/
void print_diagonal(int n)
{
int x, y;
if (n <= 0)
{
_putchar('\n');
}
else
{
for (x = 0; x < n; x++)
{
for (y = 0; y < x; y++)
{
_putchar(32);
}
_putchar(92);
_putchar('\n');
}
}
}
| 0 |
kpatsakis/primevul6 | c987217 | 129198.c | C | www.github.com/kpatsakis/primevul6/tree/main/129198.c | https://raw.githubusercontent.com/kpatsakis/primevul6/c987217/129198.c | kpatsakis/primevul6 c987217 129198.c | true | 200 | 632 | static inline void audit_free_context(struct audit_context *context)
{
struct audit_context *previous;
int count = 0;
do {
previous = context->previous;
if (previous || (count && count < 10)) {
++count;
printk(KERN_ERR "audit(:%d): major=%d name_count=%d:"
" freeing multiple contexts (%d)... | 7 |
Genius-Eugenius/workshop | 4c2282b | te-dev/suites/selftad/ipstack/tcp_simple.c | C | www.github.com/Genius-Eugenius/workshop/tree/main/te-dev/suites/selftad/ipstack/tcp_simple.c | https://raw.githubusercontent.com/Genius-Eugenius/workshop/4c2282b/te-dev/suites/selftad/ipstack/tcp_simple.c | Genius-Eugenius/workshop 4c2282b te-dev/suites/selftad/ipstack/tcp_simple.c | true | 200 | 4,973 | /* SPDX-License-Identifier: Apache-2.0 */
/** @file
* @brief Test Environment
*
* Simple UDP CSAP test
*
*/
#define TE_TEST_NAME "ipstack/tcp_simple"
#define TE_LOG_LEVEL 0xff
#include "te_config.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/time.h>
#include <sys/types.h>
#incl... | 6 |
MennaYasserHassaan/task2 | 8533fb0 | task2.c | C | www.github.com/MennaYasserHassaan/task2/tree/main/task2.c | https://raw.githubusercontent.com/MennaYasserHassaan/task2/8533fb0/task2.c | MennaYasserHassaan/task2 8533fb0 task2.c | true | 200 | 2,464 | #include <stdio.h>
#include <string.h>
#include <stdbool.h>
typedef struct {
char username[20];
char password[20];
char password2[20];
bool flag;
} user;
user users[10];
int userNo = 0;
bool isValid(const char* input) {
return (strcmp(input, "0") == 0 || strcmp(input, "1") == 0 ||
str... | 4 |
WeBeRATAS/Philoshophers | 92325d3 | pruebas/prueba_usleep.c | C | www.github.com/WeBeRATAS/Philoshophers/tree/main/pruebas/prueba_usleep.c | https://raw.githubusercontent.com/WeBeRATAS/Philoshophers/92325d3/pruebas/prueba_usleep.c | WeBeRATAS/Philoshophers 92325d3 pruebas/prueba_usleep.c | true | 200 | 1,516 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* prueba_usleep.c :+: :+: :+: ... | 2 |
Jeremiah-ogutu/alx-low_level_programming | 12b8e40 | 0x13-more_singly_linked_lists/9-insert_nodeint.c | C | www.github.com/Jeremiah-ogutu/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/9-insert_nodeint.c | https://raw.githubusercontent.com/Jeremiah-ogutu/alx-low_level_programming/12b8e40/0x13-more_singly_linked_lists/9-insert_nodeint.c | Jeremiah-ogutu/alx-low_level_programming 12b8e40 0x13-more_singly_linked_lists/9-insert_nodeint.c | true | 200 | 827 | #include "lists.h"
/**
* *insert_nodeint_at_index-fuction that insert new_modeat agiven position
* @head:address pointer
* @idx:index to be insert
* @n:the new_node
*
* Return:new_node
*/
listint_t *insert_nodeint_at_index(listint_t **head, unsigned int idx, int n)
{
listint_t *new_node;
listint_t *prese... | 1 |
henryseo1000/System_Programming | 1338f9f | env/env.c | C | www.github.com/henryseo1000/System_Programming/tree/main/env/env.c | https://raw.githubusercontent.com/henryseo1000/System_Programming/1338f9f/env/env.c | henryseo1000/System_Programming 1338f9f env/env.c | true | 200 | 215 | #include <stdlib.h> /* viewenv.c */
#include <stdio.h>
#include <unistd.h>
extern char **environ;
int main()
{
char **env = environ;
//sleep(100);
while(*env){
printf("%s\n",*env);
env++;
}
exit(0);
}
| 0 |
D-Murenzi/simple_shell | 330e3f6 | strsplit.c | C | www.github.com/D-Murenzi/simple_shell/tree/main/strsplit.c | https://raw.githubusercontent.com/D-Murenzi/simple_shell/330e3f6/strsplit.c | D-Murenzi/simple_shell 330e3f6 strsplit.c | true | 200 | 688 | /* this function splits the string and returns an array of each word*/
#include <stdio.h>
#include "main.c"
#include <string.h>
/**
* strsplit-splits the string into each words
* @ptr:pointer to string
* @delimit: the separator for strings to count as words
* Return: array to the array of words
*/
char **strspl... | 7 |
CubeLeopard5/lib_c | 275d456 | lib/utils/my_sort_word_array.c | C | www.github.com/CubeLeopard5/lib_c/tree/main/lib/utils/my_sort_word_array.c | https://raw.githubusercontent.com/CubeLeopard5/lib_c/275d456/lib/utils/my_sort_word_array.c | CubeLeopard5/lib_c 275d456 lib/utils/my_sort_word_array.c | true | 200 | 595 | #include <stddef.h>
int my_strcmp(char const *s1, char const *s2)
{
for (int i = 0; s1[i] != '\0'; i++) {
if (s1[i] != s2[i]) {
return s1[i] - s2[i];
}
}
return 0;
}
int my_sort_word_array(char **tab)
{
char *tmp = NULL;
for (int i = 0; tab[i] != NULL && tab[i] != 0; i... | 5 |
Victorchiemeka/C_learning | afc6fb2 | bruce.c | C | www.github.com/Victorchiemeka/C_learning/tree/main/bruce.c | https://raw.githubusercontent.com/Victorchiemeka/C_learning/afc6fb2/bruce.c | Victorchiemeka/C_learning afc6fb2 bruce.c | true | 200 | 527 | #include <stdio.h>
int main(void){
int height;
int leave;
scanf("%d",&height);
scanf("%d",&leave);
if(height==5 ||height < 5 && leave >= 8){
printf("Tinuviel");
}
else if(height == 10 || height > 10 && leave >= 10){
printf("Calaelen");
}
else if(height == 8 || heig... | 3 |
sayalipatil1528/C-Programing | 04b8e42 | Factorial/01)Factorial of User Entered Number Using While Loop.c | C | www.github.com/sayalipatil1528/C-Programing/tree/main/Factorial/01)Factorial of User Entered Number Using While Loop.c | https://raw.githubusercontent.com/sayalipatil1528/C-Programing/04b8e42/Factorial/01%29Factorial%20of%20User%20Entered%20Number%20%20Using%20While%20Loop.c | sayalipatil1528/C-Programing 04b8e42 Factorial/01)Factorial of User Entered Number Using While Loop.c | true | 200 | 329 | #include<stdio.h>>
#include<conio.h>>
int main()
{
int NO=0,Fact=0,Temp=0;
printf("\n Enter a Number : ");
scanf("%d",&NO);
Temp=NO;
Fact=1;
while(Temp>0)
{
Fact=Fact*Temp;
Temp--;
}
printf("\n Factorial Of %d is = %d.",NO,Fact);
getch();
retur... | 4 |
Abd-al-qudus/alx-low_level_programming | d8bfcfd | 0x05-pointers_arrays_strings/4-print_rev.c | C | www.github.com/Abd-al-qudus/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/4-print_rev.c | https://raw.githubusercontent.com/Abd-al-qudus/alx-low_level_programming/d8bfcfd/0x05-pointers_arrays_strings/4-print_rev.c | Abd-al-qudus/alx-low_level_programming d8bfcfd 0x05-pointers_arrays_strings/4-print_rev.c | true | 200 | 528 | #include "main.h"
/**
* _strlen - get the length of a string
* @s: string to get length
* Author: EngineerPhoenix
* Return: length
*/
int _strlen(char *s)
{
char *cpy;
int length;
for (cpy = s, length = 0; *cpy != '\0'; cpy++)
length++;
return (length);
}
/**
* print_rev - reverse and print the string
* ... | 6 |
joaopedropastura/estrutura-de-dados01 | e6dca20 | TRAB02-C/bubble_sort.c | C | www.github.com/joaopedropastura/estrutura-de-dados01/tree/main/TRAB02-C/bubble_sort.c | https://raw.githubusercontent.com/joaopedropastura/estrutura-de-dados01/e6dca20/TRAB02-C/bubble_sort.c | joaopedropastura/estrutura-de-dados01 e6dca20 TRAB02-C/bubble_sort.c | true | 200 | 532 | #include "lib.h"
Cost bubble_sort(UserData **list)
{
int i = 1, j = 1, lenght = (*list)[0].rg;
Cost cost = {0, 0};
while(i <= lenght)
{
j = 1;
while(j <= lenght - i)
{
if((*list)[j].rg > (*list)[j + 1].rg)
{
UserData aux = (*list)[j];
... | 1 |
omsfah/IELET2111 | 1a82bd0 | Arbkrav4/Arbkrav4/main.c | C | www.github.com/omsfah/IELET2111/tree/main/Arbkrav4/Arbkrav4/main.c | https://raw.githubusercontent.com/omsfah/IELET2111/1a82bd0/Arbkrav4/Arbkrav4/main.c | omsfah/IELET2111 1a82bd0 Arbkrav4/Arbkrav4/main.c | true | 200 | 2,605 | #define F_CPU 4000000UL
#define USART3_BAUD_RATE(BAUD_RATE) ((float)(F_CPU * 64 / (16 * (float)BAUD_RATE)) + 0.5)
//* RTC Period */
#define RTC_PERIOD (511)
#include <avr/io.h>
#include <avr/interrupt.h>
#include <util/delay.h>
#include <string.h>
#include <stdio.h>
uint16_t adcVal;
void ADC0_init(void);
uint16_t ADC0_... | 0 |
dinhthanh143/hackathon-fake-02-01 | 6f8fed4 | hackathon fake_de 01.c | C | www.github.com/dinhthanh143/hackathon-fake-02-01/tree/main/hackathon fake_de 01.c | https://raw.githubusercontent.com/dinhthanh143/hackathon-fake-02-01/6f8fed4/hackathon%20fake_de%2001.c | dinhthanh143/hackathon-fake-02-01 6f8fed4 hackathon fake_de 01.c | true | 200 | 3,414 | #include<stdio.h>
int main(){
int arr[100];
int choice,i,j,size,max;
int num_add,position,num_delete,temp,num_find;
int check=-1;
while(choice!=9){
printf("\n MENU \n \n 1.Nhap so phan tu can nhap va gia tri cac phan tu\n 2.In ra gia tri cac phan tu dang quan ly\n 3.In ra gia tri lon nhat cua mang\n 4... | 7 |
golioth/golioth-zephyr-sdk | 09e764b | samples/lightdb/delete/src/main.c | C | www.github.com/golioth/golioth-zephyr-sdk/tree/main/samples/lightdb/delete/src/main.c | https://raw.githubusercontent.com/golioth/golioth-zephyr-sdk/09e764b/samples/lightdb/delete/src/main.c | golioth/golioth-zephyr-sdk 09e764b samples/lightdb/delete/src/main.c | true | 200 | 1,648 | /*
* Copyright (c) 2022 Golioth, Inc.
*
* SPDX-License-Identifier: Apache-2.0
*/
#include <zephyr/logging/log.h>
LOG_MODULE_REGISTER(golioth_lightdb, LOG_LEVEL_DBG);
#include <net/golioth/system_client.h>
#include <samples/common/net_connect.h>
#include <stdlib.h>
static struct golioth_client *client = GOLIOTH_... | 5 |
jonseb974/holbertonschool-low_level_programming | 4db1b97 | more_singly_linked_lists/0-print_listint.c | C | www.github.com/jonseb974/holbertonschool-low_level_programming/tree/main/more_singly_linked_lists/0-print_listint.c | https://raw.githubusercontent.com/jonseb974/holbertonschool-low_level_programming/4db1b97/more_singly_linked_lists/0-print_listint.c | jonseb974/holbertonschool-low_level_programming 4db1b97 more_singly_linked_lists/0-print_listint.c | true | 200 | 383 | #include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include "lists.h"
/**
* print_listint - a function that prints all
* the elements of a listint_t
* @h: pointer of the header
* Return: the number of nodes.
*/
size_t print_listint(const listint_t *h)
{
size_t count = 0;
while (h != NULL)
{
printf(... | 3 |
huseyinyldrm/C-language-examples | 842fd02 | 04-diziler/dizide medyan bulma.c | C | www.github.com/huseyinyldrm/C-language-examples/tree/main/04-diziler/dizide medyan bulma.c | https://raw.githubusercontent.com/huseyinyldrm/C-language-examples/842fd02/04-diziler/dizide%20medyan%20bulma.c | huseyinyldrm/C-language-examples 842fd02 04-diziler/dizide medyan bulma.c | true | 200 | 1,223 | #include <stdio.h>
#include <stdlib.h>
#include <locale.h>
/* Medyan, veri k�mesi kucukten buyuge siralandiginda ortadaki degerdir. Mod veri k�mesinde en fazla g�r�len sayidir. */
int main(int argc, char *argv[]) {
setlocale(LC_ALL,"Turkish");
int cevap [23] = { 6, 7, 8, 9, 8, 7, 8, 9, 8, 9, 7, 8, 9, 5, 9, 8, 7, ... | 4 |
srikanthpragada/C_07_NOV_2024 | e07ed70 | strings/largest_name.c | C | www.github.com/srikanthpragada/C_07_NOV_2024/tree/main/strings/largest_name.c | https://raw.githubusercontent.com/srikanthpragada/C_07_NOV_2024/e07ed70/strings/largest_name.c | srikanthpragada/C_07_NOV_2024 e07ed70 strings/largest_name.c | true | 200 | 383 | // Take 5 strings and display the largest
#include<stdio.h>
#include<string.h>
int main()
{
char st[20], largest[20];
int i;
strcpy(largest, "");
for(i = 0; i < 5; i ++)
{
printf("Enter a string :");
gets(st);
if(strcmp(st, largest) > 0)
strcpy(la... | 1 |
NTURacingTeam/nturt_ep5_rear_box | e131652 | src/err.c | C | www.github.com/NTURacingTeam/nturt_ep5_rear_box/tree/main/src/err.c | https://raw.githubusercontent.com/NTURacingTeam/nturt_ep5_rear_box/e131652/src/err.c | NTURacingTeam/nturt_ep5_rear_box e131652 src/err.c | true | 200 | 1,914 | // glibc includes
#include <stdio.h>
// zephyr includes
#include <zephyr/device.h>
#include <zephyr/devicetree.h>
#include <zephyr/drivers/auxdisplay.h>
#include <zephyr/init.h>
#include <zephyr/kernel.h>
#include <zephyr/sys/util.h>
// nturt includes
#include <nturt/err.h>
/* macro ---------------------------------... | 7 |
jiwon0328/HYU | 031e9b0 | 2020/Data Structure/lab9/p9.c | C | www.github.com/jiwon0328/HYU/tree/main/2020/Data Structure/lab9/p9.c | https://raw.githubusercontent.com/jiwon0328/HYU/031e9b0/2020/Data%20Structure/lab9/p9.c | jiwon0328/HYU 031e9b0 2020/Data Structure/lab9/p9.c | true | 200 | 3,880 | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define ORDER 3
typedef struct B_node *BTree;
struct B_node {
int n_keys;
struct B_node *child[ORDER + 1];
int key[ORDER];
int isLeaf;
int isRoot;
};
BTree initTree();
BTree insert(BTree bTree, int key);
BTree split(BTree bTree);
void... | 4 |
bojieli/firebird-bbs | e5d3d7d | bbssrc/src/announce.c | C | www.github.com/bojieli/firebird-bbs/tree/main/bbssrc/src/announce.c | https://raw.githubusercontent.com/bojieli/firebird-bbs/e5d3d7d/bbssrc/src/announce.c | bojieli/firebird-bbs e5d3d7d bbssrc/src/announce.c | true | 200 | 29,473 | /*
Pirate Bulletin Board System
Copyright (C) 1990, Edward Luke, lush@Athena.EE.MsState.EDU
Eagles Bulletin Board System
Copyright (C) 1992, Raymond Rocker, rocker@rock.b11.ingr.com
Guy Vega, gtvega@seabass.st.usm.edu
Dominic Tynes, dbtynes@seabass.st.usm.... | 3 |
Jonathan-Odunlade/alx-low_level_programming | 6fb1452 | 0x04-more_functions_nested_loops/1-isdigit.c | C | www.github.com/Jonathan-Odunlade/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/1-isdigit.c | https://raw.githubusercontent.com/Jonathan-Odunlade/alx-low_level_programming/6fb1452/0x04-more_functions_nested_loops/1-isdigit.c | Jonathan-Odunlade/alx-low_level_programming 6fb1452 0x04-more_functions_nested_loops/1-isdigit.c | true | 200 | 219 | #include <stdio.h>
#include "main.h"
/**
* _isdigit - checks for a digit(0 through 9)
* @c: char to be checked
* Return: 1 or 0
*/
int _isdigit(int c)
{
if (c >= 48 && c < 58)
return (1);
else
return (0);
}
| 0 |
nourhan166/alx-low_level_programming | 973366e | 0x02-functions_nested_loops/100-times_table.c | C | www.github.com/nourhan166/alx-low_level_programming/tree/main/0x02-functions_nested_loops/100-times_table.c | https://raw.githubusercontent.com/nourhan166/alx-low_level_programming/973366e/0x02-functions_nested_loops/100-times_table.c | nourhan166/alx-low_level_programming 973366e 0x02-functions_nested_loops/100-times_table.c | true | 200 | 569 | #include"main.h"
/**
* print_times_table - prints time table of n
*
* @n: takes number input
*/
void print_times_table(int n)
{
int pord, mult, num;
if (n <= 15 && n >= 0)
{
for (num = 0; num <= n; num++)
{
_putchar(48);
for (mult = 1; mult <= n; mult++)
{
_putchar(',');
_putchar(' ');
pord = num * mult;
if (pord <... | 5 |
dustjq1004/c-study | 6d10467 | 01_base/4_conditional.c | C | www.github.com/dustjq1004/c-study/tree/main/01_base/4_conditional.c | https://raw.githubusercontent.com/dustjq1004/c-study/6d10467/01_base/4_conditional.c | dustjq1004/c-study 6d10467 01_base/4_conditional.c | true | 200 | 852 | #include <stdio.h>
#include <stdlib.h>
/**
조건문
if, else, else if
switch
제어문 중 하나.
프로그램의 진행 경로를 변경
*/
int main(void) {
int a, b;
/*
scanf("%d %d", &a, &b);
if(a == b) {
printf("%d 와 %d 는 같다 \n", a, b);
} else if (a >= b) {
printf("%d 는 %d 보다 크거나 같다 \n", a, b);
... | 1 |
Nirupama03/COMPILER-DESIGN | f77a554 | EXP 1/exp1.c | C | www.github.com/Nirupama03/COMPILER-DESIGN/tree/main/EXP 1/exp1.c | https://raw.githubusercontent.com/Nirupama03/COMPILER-DESIGN/f77a554/EXP%201/exp1.c | Nirupama03/COMPILER-DESIGN f77a554 EXP 1/exp1.c | true | 200 | 1,555 | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<ctype.h>
int isKeyword(char buffer[])
{
char keywords[32][10] =
{"auto","break","case","char","const","continue","default",
"do","double","else","enum","extern","float","for","goto",
"if","int","long","register","return","short","signed",
"sizeo... | 7 |
Benonii/alx-low_level_programming | 9a1508a | 0x1A-hash_tables/3-hash_table_set.c | C | www.github.com/Benonii/alx-low_level_programming/tree/main/0x1A-hash_tables/3-hash_table_set.c | https://raw.githubusercontent.com/Benonii/alx-low_level_programming/9a1508a/0x1A-hash_tables/3-hash_table_set.c | Benonii/alx-low_level_programming 9a1508a 0x1A-hash_tables/3-hash_table_set.c | true | 200 | 888 | #include "hash_tables.h"
/**
* hash_table_set - adds an element to the hash table
* @ht: the hash table
* @key: the node's key
* @value: the node's vlaue
*
* Return: 1 if success, 0 otherwise
*/
int hash_table_set(hash_table_t *ht, const char *key, const char *value)
{
hash_node_t *node = malloc(sizeof(hash_n... | 4 |
Taoreed26/binary_trees | 429a8e3 | 111-bst_insert.c | C | www.github.com/Taoreed26/binary_trees/tree/main/111-bst_insert.c | https://raw.githubusercontent.com/Taoreed26/binary_trees/429a8e3/111-bst_insert.c | Taoreed26/binary_trees 429a8e3 111-bst_insert.c | true | 200 | 732 | #include "binary_trees.h"
/**
* bst_insert - it helps to input values
* @tree: points to the root
* @value: stores values
* Return: returns 0 when completed
*/
bst_t *bst_insert(bst_t **tree, int value)
{
bst_t *aux = NULL;
if (tree == NULL)
return (NULL);
if (*tree == NULL)
{
*tree = binary_tree_node(NUL... | 3 |
owen20108/monty | d5befbc | error.c | C | www.github.com/owen20108/monty/tree/main/error.c | https://raw.githubusercontent.com/owen20108/monty/d5befbc/error.c | owen20108/monty d5befbc error.c | true | 200 | 2,603 | #include "monty.h"
/**
* errorz - Print exact error message by their error code
* @error_code: error codes are:
* (1) => The user do not file or more to program.
* (2) => The file provide is not file that can open or read.
* (3) => The file provid has invalid instruction.
* (4) => When program unable to mal... | 1 |
phenix-bnl/phenix-sw | 8b4e510 | offline/packages/svx/SvxApplyHotDead.C | C | www.github.com/phenix-bnl/phenix-sw/tree/main/offline/packages/svx/SvxApplyHotDead.C | https://raw.githubusercontent.com/phenix-bnl/phenix-sw/8b4e510/offline/packages/svx/SvxApplyHotDead.C | phenix-bnl/phenix-sw 8b4e510 offline/packages/svx/SvxApplyHotDead.C | true | 200 | 11,574 | // ===============
// FILE: SvxApplyHotDead.C
// ===============
// ******************************************************
//
// Class: SvxApplyHotDead implementation
//
// Author: Takashi Hachiya (hachiya@rcf.rhic.bnl.gov)
//
// Revisions: November 2011 - initial version
//
// **************************************... | 7 |
trisharuiz/university | 81b4d1f | C Programs/cop3502-as3-Ruiz-TrishaEsther/cop3502-as3-Ruiz-TrishaEsther.c | C | www.github.com/trisharuiz/university/tree/main/C Programs/cop3502-as3-Ruiz-TrishaEsther/cop3502-as3-Ruiz-TrishaEsther.c | https://raw.githubusercontent.com/trisharuiz/university/81b4d1f/C%20Programs/cop3502-as3-Ruiz-TrishaEsther/cop3502-as3-Ruiz-TrishaEsther.c | trisharuiz/university 81b4d1f C Programs/cop3502-as3-Ruiz-TrishaEsther/cop3502-as3-Ruiz-TrishaEsther.c | true | 200 | 15,229 | // all-monster-sorts.c - Sort monsters by name and weight.
/* The idea of sorting is simple: take unordered objects, and arrange them in an
order. It has a lot of uses, so there's been a lot of work done with it. Here,
we're going to demonstrate a few of the simpler, more classic sorting techniques.
*/
#in... | 4 |
MarkBrendan/alx-low_level_programming | ddc3eda | 0x05-pointers_arrays_strings/5-rev_string.c | C | www.github.com/MarkBrendan/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/5-rev_string.c | https://raw.githubusercontent.com/MarkBrendan/alx-low_level_programming/ddc3eda/0x05-pointers_arrays_strings/5-rev_string.c | MarkBrendan/alx-low_level_programming ddc3eda 0x05-pointers_arrays_strings/5-rev_string.c | true | 200 | 317 | #include "main.h"
/**
* rev_string - Write a function that reverses a string..
*
* @s: parameter to a pointer
*
* Return: void
*/
void rev_string(char *s)
{
int i = 0;
int j = 0;
char k;
while (s[j] != '\0')
{
j++;
}
j--;
while (i < j)
{
k = s[i];
s[i] = s[j];
s[j] = k;
i++;
j--;
}
}
| 3 |
felchion/sjever-ts | 3b2f643 | d/dali/npc/obj/yang.c | C | www.github.com/felchion/sjever-ts/tree/main/d/dali/npc/obj/yang.c | https://raw.githubusercontent.com/felchion/sjever-ts/3b2f643/d/dali/npc/obj/yang.c | felchion/sjever-ts 3b2f643 d/dali/npc/obj/yang.c | true | 200 | 360 |
inherit ITEM;
inherit F_FOOD;
void create()
{
set_name("东山羊", ({"dong shanyang", "dong", "shanyang"}));
set_weight(200);
if (clonep())
set_default_object(__FILE__);
else {
set("long", "一碗铁板烧出来的羊崽肉，海南特产。\n");
set("unit", "碗");
set("value", 150);
set("food_remaining", 3);
set("food_supply", 60);
}
}
| 1 |
madhavkataria1010/DSA-HW | fa40f82 | Lab1/4.c | C | www.github.com/madhavkataria1010/DSA-HW/tree/main/Lab1/4.c | https://raw.githubusercontent.com/madhavkataria1010/DSA-HW/fa40f82/Lab1/4.c | madhavkataria1010/DSA-HW fa40f82 Lab1/4.c | true | 200 | 1,929 | /*Given a matrix M (r x c) as input and write a complete the function which outputs an array which contains the column wise sum of of the transpose of M.
(Do not use any library other than iostream)
Input format:
First line contains two integers r and c, the rows and the columns of the matrix respectively.
Next ... | 7 |
MBAalotaibi/Sorted-count-of-the-unique-words-in-a-piece-of-text- | 015c113 | assignment2_2.c | C | www.github.com/MBAalotaibi/Sorted-count-of-the-unique-words-in-a-piece-of-text-/tree/main/assignment2_2.c | https://raw.githubusercontent.com/MBAalotaibi/Sorted-count-of-the-unique-words-in-a-piece-of-text-/015c113/assignment2_2.c | MBAalotaibi/Sorted-count-of-the-unique-words-in-a-piece-of-text- 015c113 assignment2_2.c | true | 200 | 3,337 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
// Constant for the maximum length of each line of input
#define MAX_LINE_LEN 100
// Constant for the maximum length of each word
#define MAX_WORD_LEN 30
// Structure to store a word and its count
typedef struct WordCount
{
char *word;... | 3 |
gabbzin/Atividade_faculdade | 8a82cb4 | 1 Semestre/exercicios_arrays/exercicio10.c | C | www.github.com/gabbzin/Atividade_faculdade/tree/main/1 Semestre/exercicios_arrays/exercicio10.c | https://raw.githubusercontent.com/gabbzin/Atividade_faculdade/8a82cb4/1%20Semestre/exercicios_arrays/exercicio10.c | gabbzin/Atividade_faculdade 8a82cb4 1 Semestre/exercicios_arrays/exercicio10.c | true | 200 | 518 | #include <stdio.h>
int main(){
int i, j;
int arrayOriginal[10], arrayInvertido[10];
for (i = 0; i < 10; i++){
printf("Digite o %d numero: ", i+1);
scanf("%d", &arrayOriginal[i]);
}
for (j = 9; j >= 0; j--){
arrayInvertido[j] = arrayOriginal[j];
}
for (i = 0; i < 10... | 4 |
kpatsakis/primevul | 79d278e | 30794.c | C | www.github.com/kpatsakis/primevul/tree/main/30794.c | https://raw.githubusercontent.com/kpatsakis/primevul/79d278e/30794.c | kpatsakis/primevul 79d278e 30794.c | true | 200 | 570 | void Splash::pipeRunAAMono8(SplashPipe *pipe) {
Guchar aSrc, aDest, alpha2, aResult;
SplashColor cDest;
Guchar cResult0;
cDest[0] = *pipe->destColorPtr;
aDest = *pipe->destAlphaPtr;
aSrc = div255(pipe->aInput * pipe->shape);
aResult = aSrc + aDest - div255(aSrc * aDest);
alpha2 = aResult;
if (alph... | 7 |
Abdullah-fy/alx-low_level_programming | 2008b65 | 0x15-file_io/1-create_file.c | C | www.github.com/Abdullah-fy/alx-low_level_programming/tree/main/0x15-file_io/1-create_file.c | https://raw.githubusercontent.com/Abdullah-fy/alx-low_level_programming/2008b65/0x15-file_io/1-create_file.c | Abdullah-fy/alx-low_level_programming 2008b65 0x15-file_io/1-create_file.c | true | 200 | 548 | #include "main.h"
#include <string.h>
/**
* create_file - A function that creates a file
*
* @filename: is the file name
* @text_content: the content in the file
*
* Return: 1 on success, -1 on failure
*/
int create_file(const char *filename, char *text_content)
{
int fp, len, writee;
fp = open(filename, O_... | 1 |
MildredJessica/monty | 4f7b08a | monty_func.c | C | www.github.com/MildredJessica/monty/tree/main/monty_func.c | https://raw.githubusercontent.com/MildredJessica/monty/4f7b08a/monty_func.c | MildredJessica/monty 4f7b08a monty_func.c | true | 200 | 4,511 | #include "monty.h"
#define _GNU_SOURCE
/**
* open_file - Opens a file.
* @file_name: String with the name of the file.
*/
void open_file(char *file_name)
{
int file_check;
FILE *fd;
if (file_name == NULL)
{
printf("Error: Can't open file %s\n",file_name);
free_nodes();
exit(EXIT_FAILURE);
}
/*Checks... | 3 |
DanielLeyvaM/C | 7fa9924 | Estructuras_libreria.c | C | www.github.com/DanielLeyvaM/C/tree/main/Estructuras_libreria.c | https://raw.githubusercontent.com/DanielLeyvaM/C/7fa9924/Estructuras_libreria.c | DanielLeyvaM/C 7fa9924 Estructuras_libreria.c | true | 200 | 977 | #include<stdio.h>
#include<conio.h>
#include<stdlib.h>
struct Libreria
{
char libro[25], autor[20], editorial [15];
float precio;
}book;
void capturar();
void mostrar();
void salir();
int main()
{
int opc;
do
{
printf("\nPrograma Biblioteca con Estructuras\n");
printf("\n 1. Capturar \n 2. Mostrar \n 3. Sal... | 4 |
KnightWXW/Algo-C | 1448a51 | ProgramDesign/CodeStateSystem.c | C | www.github.com/KnightWXW/Algo-C/tree/main/ProgramDesign/CodeStateSystem.c | https://raw.githubusercontent.com/KnightWXW/Algo-C/1448a51/ProgramDesign/CodeStateSystem.c | KnightWXW/Algo-C 1448a51 ProgramDesign/CodeStateSystem.c | true | 200 | 3,480 |
// Huawei: 编程语言设计系统
// 设计一个编程语言设计系统：
// CodeStateSystem(products[]): 初始化产品及其代码仓关系，所有代码仓的代码量初始化为0
// products[i] = [productId, repolds[]]: 表示一个产品及其代码仓列表。
// 产品，代码仓均是全局唯一的，一个代码仓仅归属于某一产品。
// ChangeCodeLines(int repolds, int languageId, int codeline):
// 代码仓repold中某种语言langu... | 7 |
blue409/NTI-Projects | 5e97da9 | RTOS/FreeRTOS/Traffic_light_system/DIO_interface.h | C | www.github.com/blue409/NTI-Projects/tree/main/RTOS/FreeRTOS/Traffic_light_system/DIO_interface.h | https://raw.githubusercontent.com/blue409/NTI-Projects/5e97da9/RTOS/FreeRTOS/Traffic_light_system/DIO_interface.h | blue409/NTI-Projects 5e97da9 RTOS/FreeRTOS/Traffic_light_system/DIO_interface.h | true | 200 | 2,156 | /*
* DIO_interface.h
*
* Created on: Nov 31, 2023
* Author: Menna Sayed
*/
#ifndef DIO_INTERFACE_H_
#define DIO_INTERFACE_H_
#include "STD_TYPES.h"
/*************** MACROS FOR PIN ***************/
/* Macros For Pin Id */
#define DIO_PIN0 0
#define DIO_PIN1 1
#def... | 1 |
emanueledim/gem5_tardistso | afe2bc5 | patch/tests/test-progs/tardis_tso/arm/threads/threads.c | C | www.github.com/emanueledim/gem5_tardistso/tree/main/patch/tests/test-progs/tardis_tso/arm/threads/threads.c | https://raw.githubusercontent.com/emanueledim/gem5_tardistso/afe2bc5/patch/tests/test-progs/tardis_tso/arm/threads/threads.c | emanueledim/gem5_tardistso afe2bc5 patch/tests/test-progs/tardis_tso/arm/threads/threads.c | true | 200 | 1,359 | /** Simple program to test ARM's dsb
*/
#include <stdio.h>
#include <pthread.h>
typedef struct ThreadData {
int *a;
int *b;
int *c;
int tid;
int threads;
int num_values;
}ThreadData_t;
/*
* c = a + b
*/
void *array_add(void *arg)
{
ThreadData_t *data = (ThreadData_t *)arg;
// Calc... | 3 |
andy9040/DeepUnroll | d371dfb | Data/Andre/s013766408.c | C | www.github.com/andy9040/DeepUnroll/tree/main/Data/Andre/s013766408.c | https://raw.githubusercontent.com/andy9040/DeepUnroll/d371dfb/Data/Andre/s013766408.c | andy9040/DeepUnroll d371dfb Data/Andre/s013766408.c | true | 200 | 2,232 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
int compare_int(const void *a, const void *b)
{
return *(int*)a - *(int*)b;
// return *(long long*)a - *(long long*)b;
}
// qsort(A, b, sizeof(int), compare_int);
//long long factorial(long long n) {
// if (n > 0) {
// re... | 4 |
Pami-1/Pami | fa8913d | msr-novul/0_CVE-2017-13039_tcpdump_CWE-125_e0a5a02b0fc1900a69d6c37ed0aab36fb8494e_3.c | C | www.github.com/Pami-1/Pami/tree/main/msr-novul/0_CVE-2017-13039_tcpdump_CWE-125_e0a5a02b0fc1900a69d6c37ed0aab36fb8494e_3.c | https://raw.githubusercontent.com/Pami-1/Pami/fa8913d/msr-novul/0_CVE-2017-13039_tcpdump_CWE-125_e0a5a02b0fc1900a69d6c37ed0aab36fb8494e_3.c | Pami-1/Pami fa8913d msr-novul/0_CVE-2017-13039_tcpdump_CWE-125_e0a5a02b0fc1900a69d6c37ed0aab36fb8494e_3.c | true | 200 | 1,626 | ikev1_t_print(netdissect_options *ndo, u_char tpay _U_,
const struct isakmp_gen *ext, u_int item_len,
const u_char *ep, uint32_t phase _U_, uint32_t doi _U_,
uint32_t proto, int depth _U_)
{
const struct ikev1_pl_t *p;
struct ikev1_pl_t t;
const u_char *cp;
const char *idstr;
const struct attr... | 4 |
GYPpro/ACM_res | ce3724f | 0_Template/string/compress.h | C | www.github.com/GYPpro/ACM_res/tree/main/0_Template/string/compress.h | https://raw.githubusercontent.com/GYPpro/ACM_res/ce3724f/0_Template/string/compress.h | GYPpro/ACM_res ce3724f 0_Template/string/compress.h | true | 200 | 1,275 | // ##IGNORE##
const int N = 1 << 21;
static const int mod1 = 1E9 + 7, base1 = 127;
static const int mod2 = 1E9 + 9, base2 = 131;
using U = mInt<mod1>;
using V = mInt<mod2>;
vector<U> val1;
vector<V> val2;
void init(int n = N)
{
val1.resize(n + 1), val2.resize(n + 2);
val1[0] = 1, val2[0] = 1;
for (int i = 1... | 3 |
aci2n/algorithm-design-manual-exercises | 806d24a | src/c/reconstruct_queue.c | C | www.github.com/aci2n/algorithm-design-manual-exercises/tree/main/src/c/reconstruct_queue.c | https://raw.githubusercontent.com/aci2n/algorithm-design-manual-exercises/806d24a/src/c/reconstruct_queue.c | aci2n/algorithm-design-manual-exercises 806d24a src/c/reconstruct_queue.c | true | 200 | 2,191 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include <assert.h>
#include <time.h>
#include <stdint.h>
int int_compare(int a, int b) {
return a < b ? -1 : a > b ? 1 : 0;
}
int entry_compare(int a[static 2], int b[static 2]) {
if (a[0] != b[0]) return int_compare(a[0], b[0]);
i... | 1 |
danilabokhanov/collectd_prometheus_parser | 06d6bee | ast.c | C | www.github.com/danilabokhanov/collectd_prometheus_parser/tree/main/ast.c | https://raw.githubusercontent.com/danilabokhanov/collectd_prometheus_parser/06d6bee/ast.c | danilabokhanov/collectd_prometheus_parser 06d6bee ast.c | true | 200 | 16,490 | #include "ast.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
const char *PR_METRIC_SUFFIXES[] = {"", "_bucket", "_count", "_sum"};
void pr_delete_label_list(pr_label_t *label_list) {
if (!label_list) {
return;
}
free(label_list->name);
free(label_list->value);
pr_delete_label_list(label_... | 7 |
akash0214/C-Programs | ad15f2a | chapter8/b8.c | C | www.github.com/akash0214/C-Programs/tree/main/chapter8/b8.c | https://raw.githubusercontent.com/akash0214/C-Programs/ad15f2a/chapter8/b8.c | akash0214/C-Programs ad15f2a chapter8/b8.c | true | 200 | 779 | #include <stdio.h>
void primeFactors(int n)
{
printf("Prime factors of %d are: ", n);
// Print the number of 2s that divide n
while (n % 2 == 0)
{
printf("%d ", 2);
n = n / 2;
}
for (int i = 3; i <= n / 2; i = i + 2)
{
// While i divides n, print i and divide n
... | 3 |
Priyansh-S-K/E-Infochips | db5d7d9 | C programming language/Chap4/4_3.c | C | www.github.com/Priyansh-S-K/E-Infochips/tree/main/C programming language/Chap4/4_3.c | https://raw.githubusercontent.com/Priyansh-S-K/E-Infochips/db5d7d9/C%20programming%20language/Chap4/4_3.c | Priyansh-S-K/E-Infochips db5d7d9 C programming language/Chap4/4_3.c | true | 200 | 3,133 | // Given the basic framework, it's straightforward to extend the calculator. Add the modulus (%) operator and provisions for negative numbers.
#include <stdio.h>
#include <ctype.h>
#include <stdlib.h>
#define MAXOP 100
#define MAXVAL 100
// Stack for operands
double val[MAXVAL];
int sp = 0;
// Function prototypes... | 4 |
Shanthia94/alx-low_level_programming | 7b0c558 | 0x05-pointers_arrays_strings/6-puts2.c | C | www.github.com/Shanthia94/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/6-puts2.c | https://raw.githubusercontent.com/Shanthia94/alx-low_level_programming/7b0c558/0x05-pointers_arrays_strings/6-puts2.c | Shanthia94/alx-low_level_programming 7b0c558 0x05-pointers_arrays_strings/6-puts2.c | true | 200 | 289 | #include "main.h"
/**
* puts2 - print every other character of a string
* @str: char to be checked
* Return: 0 if successful
*/
void puts2(char *str)
{
int string;
for (string = 0; str[string] != '\0'; string++)
if (string % 2 == 0)
_putchar(str[string]);
_putchar('\n');
}
| 1 |
piyush348/C-program | d769ac8 | primesum.c | C | www.github.com/piyush348/C-program/tree/main/primesum.c | https://raw.githubusercontent.com/piyush348/C-program/d769ac8/primesum.c | piyush348/C-program d769ac8 primesum.c | true | 200 | 600 | #include <stdio.h>
int main()
{
int i, j, isPrime, end, sum = 0;
printf("Find sum of all prime number from 1 to :");
scanf("%d", &end);
/*find all prime numbers between 1 to end */
for (i = 2; i <= end; i++)
{
isPrime = 1;
for (j = 2; j <= i / 2; j++)
{
... | 7 |
forampatel208/Mastering_C | c8deb24 | Programs_in_C/09_Structures/nested_structures.c | C | www.github.com/forampatel208/Mastering_C/tree/main/Programs_in_C/09_Structures/nested_structures.c | https://raw.githubusercontent.com/forampatel208/Mastering_C/c8deb24/Programs_in_C/09_Structures/nested_structures.c | forampatel208/Mastering_C c8deb24 Programs_in_C/09_Structures/nested_structures.c | true | 200 | 923 | /* Program: nested_structures.c
Demonstrates the use of nested structures.
*/
#include <stdio.h>
// Defining nested structures
struct Date {
int day;
int month;
int year;
};
struct Student {
int id;
char name[50];
struct Date dob; // Nested structure for date of birth
};
int main() {
... | 6 |
QuentinBriand/MysteryDungeon | 7111ec9 | src/utils/unix_to_date.c | C | www.github.com/QuentinBriand/MysteryDungeon/tree/main/src/utils/unix_to_date.c | https://raw.githubusercontent.com/QuentinBriand/MysteryDungeon/7111ec9/src/utils/unix_to_date.c | QuentinBriand/MysteryDungeon 7111ec9 src/utils/unix_to_date.c | true | 200 | 2,902 | /*
** EPITECH PROJECT, 2022
** B-MUL-200-NCE-2-1-myrpg-antoine.frankel
** File description:
** unix_to_t.date
*/
#include "rpg.h"
void get_dateinfo(long int ti, date_t *t)
{
int *arr = my_malloc(sizeof(int) * 12);
int arri[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
for (int i = 0; i < 12; i++... | 2 |
UsefElbedwehy/Smart-Menu-Ordering-System | 42bc8a6 | Project - Files/Src/CLCD_Program.c | C | www.github.com/UsefElbedwehy/Smart-Menu-Ordering-System/tree/main/Project - Files/Src/CLCD_Program.c | https://raw.githubusercontent.com/UsefElbedwehy/Smart-Menu-Ordering-System/42bc8a6/Project%20-%20Files/Src/CLCD_Program.c | UsefElbedwehy/Smart-Menu-Ordering-System 42bc8a6 Project - Files/Src/CLCD_Program.c | true | 200 | 3,345 | #include "STDTYPES.h"
#include <util/delay.h>
#include "DIO_Interface.h"
#include "DIO_Private.h"
#include "CLCD_Config.h"
#include "CLCD_Private.h"
#include "CLCD_Interface.h"
void CLCD_VoidInit(void)
{
/*wait for mare than 30ms*/
_delay_ms(40);
/*Function Set 2 lines & 5*8 font size*/
CLCD_VoidSendCommand(Funct... | 3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.