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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
rkboni/U-boot.MR46 | 5ca23f3 | board/qca/arm/ipq807x/ipq807x.c | C | www.github.com/rkboni/U-boot.MR46/tree/main/board/qca/arm/ipq807x/ipq807x.c | https://raw.githubusercontent.com/rkboni/U-boot.MR46/5ca23f3/board/qca/arm/ipq807x/ipq807x.c | rkboni/U-boot.MR46 5ca23f3 board/qca/arm/ipq807x/ipq807x.c | true | 200 | 30,408 | /*
* Copyright (c) 2016-2017, The Linux Foundation. All rights reserved.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 and
* only version 2 as published by the Free Software Foundation.
*
* This program is distributed in ... | 7 |
Omar-Alaa-Eldin/CS50-cours | b6d1f39 | week1/lacture1/mario3.c | C | www.github.com/Omar-Alaa-Eldin/CS50-cours/tree/main/week1/lacture1/mario3.c | https://raw.githubusercontent.com/Omar-Alaa-Eldin/CS50-cours/b6d1f39/week1/lacture1/mario3.c | Omar-Alaa-Eldin/CS50-cours b6d1f39 week1/lacture1/mario3.c | true | 200 | 1,210 | #include <stdio.h>
#include <cs50.h>
// define my function before the "main" fun. to can be used inside it
int get_size(void);
void print_grid(int size);
int main(void)
{
//Get size of grid
int n = get_size();
//Print grid of bricks
// calling the fun. by it's name and pass a variable ... | 1 |
keshav260820/Code-Radar-Solutions | 6740d14 | Traffic Light Simulation@@6788dd63490637cfc44e1ba9/code.c | C | www.github.com/keshav260820/Code-Radar-Solutions/tree/main/Traffic Light Simulation@@6788dd63490637cfc44e1ba9/code.c | https://raw.githubusercontent.com/keshav260820/Code-Radar-Solutions/6740d14/Traffic%20Light%20Simulation%40%406788dd63490637cfc44e1ba9/code.c | keshav260820/Code-Radar-Solutions 6740d14 Traffic Light Simulation@@6788dd63490637cfc44e1ba9/code.c | true | 200 | 391 | #include <stdio.h>
char* welcome() {
return "Welcome to Code Radar!";
}
int main() {
char x;
scanf("%c",&x);
switch(x){
case 'R':
printf("Stop");
break;
case 'G':
printf("Go");
break;
case 'Y':
printf("Slow Down");
... | 4 |
calel26/eaos | 3492c34 | tool/gengdt.c | C | www.github.com/calel26/eaos/tree/main/tool/gengdt.c | https://raw.githubusercontent.com/calel26/eaos/3492c34/tool/gengdt.c | calel26/eaos 3492c34 tool/gengdt.c | true | 200 | 1,684 | #include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>
#include <string.h>
// https://wiki.osdev.org/GDT_Tutorial#Basics
// ported to tool so that I can encode values directly in the bootloader's assembly
int main(void) {
uint8_t *target = malloc(8);
for(;;) {
memset(target, ... | 3 |
tgjones/IR2IL | be0fae6 | tests/fujitsu-compiler-test-suite/C/0031/0031_0091.c | C | www.github.com/tgjones/IR2IL/tree/main/tests/fujitsu-compiler-test-suite/C/0031/0031_0091.c | https://raw.githubusercontent.com/tgjones/IR2IL/be0fae6/tests/fujitsu-compiler-test-suite/C/0031/0031_0091.c | tgjones/IR2IL be0fae6 tests/fujitsu-compiler-test-suite/C/0031/0031_0091.c | true | 200 | 565 | #include<stdio.h>
#include<complex.h>
#define CF _Complex float
#define CD _Complex double
#define CL _Complex long double
void dump(CL arg, int len)
{
if(len == 8)
printf("%f %f \n",crealf(arg),cimagf(arg));
else if(len == 16)
printf("%lf %lf \n",creal(arg),cimag(arg));
else
printf("%Lf %Lf \n",cr... | 0 |
kangrot/alx-low_level_programming | 93f92d8 | 0x05-pointers_arrays_strings/4-print_rev.c | C | www.github.com/kangrot/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/4-print_rev.c | https://raw.githubusercontent.com/kangrot/alx-low_level_programming/93f92d8/0x05-pointers_arrays_strings/4-print_rev.c | kangrot/alx-low_level_programming 93f92d8 0x05-pointers_arrays_strings/4-print_rev.c | true | 200 | 285 | #include "main.h"
/**
* print_rev - prints a tring in reverse
* @s: string to be printed
*
* Return: void
*/
void print_rev(char *s)
{
int i;
int counter = 0;
for (i = 0; s[i] != '\0'; i++)
counter++;
for (i = counter - 1; i >= 0; i--)
_putchar(s[i]);
_putchar('\n');
}
| 5 |
roetlich/fsummary | 611baed | src/script_finder.c | C | www.github.com/roetlich/fsummary/tree/main/src/script_finder.c | https://raw.githubusercontent.com/roetlich/fsummary/611baed/src/script_finder.c | roetlich/fsummary 611baed src/script_finder.c | true | 200 | 713 | #include "script_finder.h"
#include "string_helpers.h"
#include <dirent.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
const char *find_script(const char *filename, const char *scripts_dir) {
const char *file_extension = get_filename_ext(filename);
DIR *dir = opendir(scripts_d... | 6 |
amchiclet/compiler-evaluation-experiments | 3222475 | LoopGen/reduction-add-dependency/5_stmts_14_arrs_2_deps/5_stmts_14_arrs_2_deps_de/wrapper.c | C | www.github.com/amchiclet/compiler-evaluation-experiments/tree/main/LoopGen/reduction-add-dependency/5_stmts_14_arrs_2_deps/5_stmts_14_arrs_2_deps_de/wrapper.c | https://raw.githubusercontent.com/amchiclet/compiler-evaluation-experiments/3222475/LoopGen/reduction-add-dependency/5_stmts_14_arrs_2_deps/5_stmts_14_arrs_2_deps_de/wrapper.c | amchiclet/compiler-evaluation-experiments 3222475 LoopGen/reduction-add-dependency/5_stmts_14_arrs_2_deps/5_stmts_14_arrs_2_deps_de/wrapper.c | true | 200 | 5,243 | #include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <time.h>
#include <assert.h>
#include <limits.h>
#include <math.h>
#include <string.h>
int n_arrs;
double scalar1;
double scalar2;
double scalar3;
double scalar4;
double scalar5;
int size;
double (*Arr01_ptr);
double (*Arr02_ptr);
... | 2 |
jessNzembi/alx-low_level_programming | a7c4fab | 0x06-pointers_arrays_strings/3-strcmp.c | C | www.github.com/jessNzembi/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/3-strcmp.c | https://raw.githubusercontent.com/jessNzembi/alx-low_level_programming/a7c4fab/0x06-pointers_arrays_strings/3-strcmp.c | jessNzembi/alx-low_level_programming a7c4fab 0x06-pointers_arrays_strings/3-strcmp.c | true | 200 | 351 | #include "main.h"
#include <stdio.h>
/**
* _strcmp - compares two strings
* @s1: first string
* @s2: second string
* Return: 0 if strings are the same, -15 if otherwise
*/
int _strcmp(char *s1, char *s2)
{
int i = 0;
while (s1[i] != '\0' && s2[i] != '\0')
{
if (s1[i] != s2[i])
{
return (s1[i] - s2[i])... | 7 |
byeoldong/Hon-Gong-C | ee08558 | 확인문제 14-2_1.c | C | www.github.com/byeoldong/Hon-Gong-C/tree/main/확인문제 14-2_1.c | https://raw.githubusercontent.com/byeoldong/Hon-Gong-C/ee08558/%ED%99%95%EC%9D%B8%EB%AC%B8%EC%A0%9C%2014-2_1.c | byeoldong/Hon-Gong-C ee08558 확인문제 14-2_1.c | true | 200 | 201 | #include <stdio.h>
int main(void)
{
char *pary[5] = {"apple", "pear", "peach", "banana", "melon"};
int i,j;
for(i=0; i<5; i++)
{
printf("%s\n",pary[i]);
}
return 0;
} | 1 |
liyuethiop/alx-low_level_programming | a6df878 | 0x04-more_functions_nested_loops/main.c | C | www.github.com/liyuethiop/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/main.c | https://raw.githubusercontent.com/liyuethiop/alx-low_level_programming/a6df878/0x04-more_functions_nested_loops/main.c | liyuethiop/alx-low_level_programming a6df878 0x04-more_functions_nested_loops/main.c | true | 200 | 240 | #include "main.h"
#include <stdio.h>
/**
*
* main - check the code
* Return: Always 0.
*/
int main(void)
{
char c;
c = 'A';
printf("%c: %d\n", c, _isupper(c));
c = 'a';
printf("%c: %d\n", c, _isupper(c));
return (0);
}
| 4 |
OctCarp/SUSTech_CS205-CPP_2023f_Works | 094f8e5 | Assignment1/a1p3v1.c | C | www.github.com/OctCarp/SUSTech_CS205-CPP_2023f_Works/tree/main/Assignment1/a1p3v1.c | https://raw.githubusercontent.com/OctCarp/SUSTech_CS205-CPP_2023f_Works/094f8e5/Assignment1/a1p3v1.c | OctCarp/SUSTech_CS205-CPP_2023f_Works 094f8e5 Assignment1/a1p3v1.c | true | 200 | 3,042 | #include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
#ifndef M_PI
#define M_PI (3.14159265358979323846)
#endif
#define MAX_TRIANGLES 100
double EPS = 1e-1;
typedef struct {
double s1, s2, s3;
} Triangle;
typedef struct {
Triangle triangles[MAX_TRIANGLES];
int... | 3 |
rawan-abdelrahim/alx-low_level_programming | 7db0cd6 | 0x15-file_io/1-create_file.c | C | www.github.com/rawan-abdelrahim/alx-low_level_programming/tree/main/0x15-file_io/1-create_file.c | https://raw.githubusercontent.com/rawan-abdelrahim/alx-low_level_programming/7db0cd6/0x15-file_io/1-create_file.c | rawan-abdelrahim/alx-low_level_programming 7db0cd6 0x15-file_io/1-create_file.c | true | 200 | 659 | #include "main.h"
/**
* create_file - Creates a file with the given text content and permissions.
* @filename: Name of the file to create.
* @text_content: NULL-terminated string to write to the file.
*
* Return: 1 on success, -1 on failure.
*/
int create_file(const char *filename, char *text_content)
{
int fd;... | 6 |
ElinaTsovo/alx-low_level_programming | c53a6de | 0x04-more_functions_nested_loops/2-mul.c | C | www.github.com/ElinaTsovo/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/2-mul.c | https://raw.githubusercontent.com/ElinaTsovo/alx-low_level_programming/c53a6de/0x04-more_functions_nested_loops/2-mul.c | ElinaTsovo/alx-low_level_programming c53a6de 0x04-more_functions_nested_loops/2-mul.c | true | 200 | 230 | #include "main.h"
/**
* mul - multiplication of two numbers
* @a: first number
* @b: second number
* Return: the result of the multiplcation
*/
int mul(int a, int b)
{
int multi;
multi = a * b;
return (multi);
}
| 5 |
joyenjoy3/Study.v1 | 4f875b4 | Project1_C++/202211261516/main.c | C | www.github.com/joyenjoy3/Study.v1/tree/main/Project1_C++/202211261516/main.c | https://raw.githubusercontent.com/joyenjoy3/Study.v1/4f875b4/Project1_C%2B%2B/202211261516/main.c | joyenjoy3/Study.v1 4f875b4 Project1_C++/202211261516/main.c | true | 200 | 475 | #include <stdio.h>
void SetArray(int(*parray)[5], int column, int row) {
for (int i = 0; i < column; i++) {
for (int j = 0; j < row; j++) {
parray[i][j] = i * row + j;
}
}
}
void PrintArray(int(*parray)[5], int column, int row) {
for (int i = 0; i < column; i++) {
for (int j = 0; j < row; j++) {
print... | 2 |
KaiVvv/Student-Management-system | ea05ca3 | main.c | C | www.github.com/KaiVvv/Student-Management-system/tree/main/main.c | https://raw.githubusercontent.com/KaiVvv/Student-Management-system/ea05ca3/main.c | KaiVvv/Student-Management-system ea05ca3 main.c | true | 200 | 445 | #include <stdio.h>
#include <stdlib.h>
#include "mainMenu.h"
#include "login.h"
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
void welcome(){
printf("**********************************************\n");
printf("\n\t��ӭ����ѧ����Ϣ����ϵͳ\n\n");
}
int main(... | 7 |
tenok-rtos/tenok | 6f63023 | user/tasks/mavlink_task.c | C | www.github.com/tenok-rtos/tenok/tree/main/user/tasks/mavlink_task.c | https://raw.githubusercontent.com/tenok-rtos/tenok/6f63023/user/tasks/mavlink_task.c | tenok-rtos/tenok 6f63023 user/tasks/mavlink_task.c | true | 200 | 1,872 | #include <fcntl.h>
#include <mqueue.h>
#include <stdint.h>
#include <stdlib.h>
#include <task.h>
#include <tenok.h>
#include <unistd.h>
#include "mavlink.h"
#include "mavlink/parser.h"
#include "mavlink/publisher.h"
#include <kconfig.h>
#if (PAGE_SIZE_SELECT == PAGE_SIZE_64K)
#define MAVLINK_MAX_MSG 25
#else
#define ... | 4 |
KamruzzamanAsif/Operating-System | 6b2edbc | Thread/semaphore.c | C | www.github.com/KamruzzamanAsif/Operating-System/tree/main/Thread/semaphore.c | https://raw.githubusercontent.com/KamruzzamanAsif/Operating-System/6b2edbc/Thread/semaphore.c | KamruzzamanAsif/Operating-System 6b2edbc Thread/semaphore.c | true | 200 | 1,237 | #include <stdio.h>
#include <stdlib.h>
#include <pthread.h>
#include <semaphore.h>
void *functionC();
sem_t mutex; // semaphore : data type is sem_t
int counter = 0;
int main(void)
{
int rc1, rc2;
pthread_t thread1, thread2;
/* initialize semaphore */
sem_init(&mutex, 0, 1); // 0 means semaphore is shar... | 0 |
Abraham-Afework/alx-low_level_programming | 84c6a74 | 0x13-more_singly_linked_lists/3-add_nodeint_end.c | C | www.github.com/Abraham-Afework/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/3-add_nodeint_end.c | https://raw.githubusercontent.com/Abraham-Afework/alx-low_level_programming/84c6a74/0x13-more_singly_linked_lists/3-add_nodeint_end.c | Abraham-Afework/alx-low_level_programming 84c6a74 0x13-more_singly_linked_lists/3-add_nodeint_end.c | true | 200 | 640 | #include<stdio.h>
#include<stdlib.h>
#include"lists.h"
/**
* add_nodeint_end - function that add a node at the end of a list
*
* @head:the adderess of the list head
* @n:the data
*
* Return:the address of the new element,or NULL if it failed
*
*/
listint_t *add_nodeint_end(listint_t **head, const int n)
{
list... | 6 |
imoore02/fdf | 8746cb6 | utils_lib/ft_strncmp.c | C | www.github.com/imoore02/fdf/tree/main/utils_lib/ft_strncmp.c | https://raw.githubusercontent.com/imoore02/fdf/8746cb6/utils_lib/ft_strncmp.c | imoore02/fdf 8746cb6 utils_lib/ft_strncmp.c | true | 200 | 894 | #include "libft.h"
/*
** ft_strncmp
** --------------------
** Description:
** Compares the first differing characters between two strings 's1' and 's2'.
**
** Parameters:
** - s1: The first string to be compared.
** - s2: The second string to be compared.
**
** Returns:
** - An integer less than, equal to, or... | 5 |
salahmalih/alx-low_level_programming | 1d41ab0 | 0x13-more_singly_linked_lists/6-pop_listint.c | C | www.github.com/salahmalih/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/6-pop_listint.c | https://raw.githubusercontent.com/salahmalih/alx-low_level_programming/1d41ab0/0x13-more_singly_linked_lists/6-pop_listint.c | salahmalih/alx-low_level_programming 1d41ab0 0x13-more_singly_linked_lists/6-pop_listint.c | true | 200 | 412 | #include "lists.h"
/**
* pop_listint - deletes the head node of a linked list
* @head: pointer to the first element in the linked list
*
* Return: the data inside the elements that was deleted,
* or 0 if the list is empty
*/
int pop_listint(listint_t **head)
{
int n;
listint_t *tmp;
if (!head || !*head)
ret... | 3 |
matteofuso/Esercizi-C | dfe749c | Classe 4/Programmazione Concorrente/exec.c | C | www.github.com/matteofuso/Esercizi-C/tree/main/Classe 4/Programmazione Concorrente/exec.c | https://raw.githubusercontent.com/matteofuso/Esercizi-C/dfe749c/Classe%204/Programmazione%20Concorrente/exec.c | matteofuso/Esercizi-C dfe749c Classe 4/Programmazione Concorrente/exec.c | true | 200 | 581 | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
int main(int argc, char **argv)
{
if (argc == 1)
{
printf("Sono il primo processo, il mio PID è %d\n", getpid());
execl(argv[0], "ciao", "buongiorno", NULL);
printf("Errore nell'invocazione della execl\n");
return -1;
... | 2 |
Rgsis-commits/SoftwareSystems | e800245 | hands-on-1/25.c | C | www.github.com/Rgsis-commits/SoftwareSystems/tree/main/hands-on-1/25.c | https://raw.githubusercontent.com/Rgsis-commits/SoftwareSystems/e800245/hands-on-1/25.c | Rgsis-commits/SoftwareSystems e800245 hands-on-1/25.c | true | 200 | 1,226 | #include<stdio.h>
#include<unistd.h>
#include<stdlib.h>
#include<sys/wait.h>
int main(){
int waitstatus;
pid_t childA, childB, childC, terminated_child;
if((childA = fork())==0){
printf("First Child is created successfully.\n");
printf("Child A is going to sleep for 5 second.\n");
sleep(5);
printf("Child A ... | 1 |
ashGHub/simple_shell | 5c1cce3 | utils_lib3.c | C | www.github.com/ashGHub/simple_shell/tree/main/utils_lib3.c | https://raw.githubusercontent.com/ashGHub/simple_shell/5c1cce3/utils_lib3.c | ashGHub/simple_shell 5c1cce3 utils_lib3.c | true | 200 | 1,800 | #include "main.h"
/**
* _strcpy - copies the string src to dest, including the null character.
* @src: source string
* @dest: destination string
*
* Return: void
*/
char *_strcpy(char *dest, const char *src)
{
int i;
if (src == NULL || dest == NULL)
return (dest);
for (i = 0; *(src + i) != '\0'; i++)
*(d... | 0 |
Dope04/Lab-Practical | 0028160 | p001.c | C | www.github.com/Dope04/Lab-Practical/tree/main/p001.c | https://raw.githubusercontent.com/Dope04/Lab-Practical/0028160/p001.c | Dope04/Lab-Practical 0028160 p001.c | true | 200 | 335 | //WAP in c to use printf and basic arithmetic operations.
#include<stdio.h>
int main(){
int a=10, b=5;
int sum=a+b;
int diff=a-b;
int pro=a*b;
float quotient=a/b;
printf("Sum:%d\n",sum);
printf("Difference:%d\n",diff);
printf("Product:%d\n",pro);
printf("Quotient:%.2f\n", quotient);
... | 4 |
GerbenAaltink/rlib | 72f161b | rhashtable.h | C | www.github.com/GerbenAaltink/rlib/tree/main/rhashtable.h | https://raw.githubusercontent.com/GerbenAaltink/rlib/72f161b/rhashtable.h | GerbenAaltink/rlib 72f161b rhashtable.h | true | 200 | 1,493 | #ifndef RHASHTABLE_H
#define RHASHTABLE_H
/*
ORIGINAL SOURCE IS FROM K&R
*/
#include "rmalloc.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define HASHSIZE 101
// Structure for the table entries
typedef struct rnlist {
struct rnlist *next;
char *name;
char *defn;
} rnlist;
// Hash ... | 7 |
IstiCusi/peace-demo | e5df105 | event.c | C | www.github.com/IstiCusi/peace-demo/tree/main/event.c | https://raw.githubusercontent.com/IstiCusi/peace-demo/e5df105/event.c | IstiCusi/peace-demo e5df105 event.c | true | 200 | 440 | #include "event.h"
bool is_game_over(void) {
SDL_Event event;
bool over = false;
while (SDL_PollEvent(&event)) {
switch (event.type) {
case SDL_QUIT:
over = true;
break;
case SDL_MOUSEBUTTONUP:
over = true;
break;
case SDL_KEYDOWN:
if (event.key... | 3 |
RoboMaster-Club/wheel-legged-standard | d3635e9 | src/devices/inc/dm_motor.h | C | www.github.com/RoboMaster-Club/wheel-legged-standard/tree/main/src/devices/inc/dm_motor.h | https://raw.githubusercontent.com/RoboMaster-Club/wheel-legged-standard/d3635e9/src/devices/inc/dm_motor.h | RoboMaster-Club/wheel-legged-standard d3635e9 src/devices/inc/dm_motor.h | true | 200 | 1,558 | #ifndef DM_MOTOR_H
#define DM_MOTOR_H
#include <stdint.h>
#include "bsp_can.h"
#define P_MIN -12.5f
#define P_MAX 12.5f
#define V_MIN -30.0f
#define V_MAX 30.0f
#define KP_MIN 0.0f
#define KP_MAX 500.0f
#define KD_MIN 0.0f
#define KD_MAX 5.0f
#define T_MIN -10.0f
#define T_MAX 10.0f
#define DM_MOTOR_MIT (0)
#define ... | 6 |
jawadzizo/alx-low_level_programming | 5c9b7ae | 0x02-functions_nested_loops/6-abs.c | C | www.github.com/jawadzizo/alx-low_level_programming/tree/main/0x02-functions_nested_loops/6-abs.c | https://raw.githubusercontent.com/jawadzizo/alx-low_level_programming/5c9b7ae/0x02-functions_nested_loops/6-abs.c | jawadzizo/alx-low_level_programming 5c9b7ae 0x02-functions_nested_loops/6-abs.c | true | 200 | 279 | #include <stdio.h>
#include "main.h"
/**
* _abs - a function to print the absolute value of an integer
* @n: to be checked for its absolute value
* Return: returns n
*/
int _abs(int n)
{
if (n > 0)
n = n;
else if (n == 0)
n = n;
else
n = n * -1;
return (n);
}
| 5 |
ShrimpyJ/misc | 925d5a2 | files/c/counter.c | C | www.github.com/ShrimpyJ/misc/tree/main/files/c/counter.c | https://raw.githubusercontent.com/ShrimpyJ/misc/925d5a2/files/c/counter.c | ShrimpyJ/misc 925d5a2 files/c/counter.c | true | 200 | 2,077 | #include <stdlib.h>
#include <time.h>
#include <stdio.h>
#include <unistd.h>
#include <pthread.h>
#define NUMCPUS 4
#define THRESHOLD 5
#define TIMESTEP 1
pthread_t tids[NUMCPUS];
typedef struct __counter_t {
int global;
pthread_mutex_t glock;
int local[NUMCPUS];
pthread_mutex_t llock[NUMCPUS];
in... | 2 |
123Ayomi/alx-low_level_programming | 5042d0f | 0x06-pointers_arrays_strings/100-rot13.c | C | www.github.com/123Ayomi/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/100-rot13.c | https://raw.githubusercontent.com/123Ayomi/alx-low_level_programming/5042d0f/0x06-pointers_arrays_strings/100-rot13.c | 123Ayomi/alx-low_level_programming 5042d0f 0x06-pointers_arrays_strings/100-rot13.c | true | 200 | 424 | #include "main.h"
#include <stdio.h>
/**
* rot13 - encoder rot13
* @s: pointer to string params
* Return: *s
*/
char *rot13(char *s)
{
int i;
int j;
char data1[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
char dataot[] = "NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm";
for (i = 0; s[i] != '\0'; ... | 7 |
whoatebambi/minishell | e0bd1ff | src/parsing/node_utils.c | C | www.github.com/whoatebambi/minishell/tree/main/src/parsing/node_utils.c | https://raw.githubusercontent.com/whoatebambi/minishell/e0bd1ff/src/parsing/node_utils.c | whoatebambi/minishell e0bd1ff src/parsing/node_utils.c | true | 200 | 1,724 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* node_utils.c :+: :+: :+: ... | 1 |
Fausto-Mendez/Programacion-Segura | 52dcfb4 | cwe-767/programa.c | C | www.github.com/Fausto-Mendez/Programacion-Segura/tree/main/cwe-767/programa.c | https://raw.githubusercontent.com/Fausto-Mendez/Programacion-Segura/52dcfb4/cwe-767/programa.c | Fausto-Mendez/Programacion-Segura 52dcfb4 cwe-767/programa.c | true | 200 | 307 | #include<stdio.h>
#include<string.h>
int main()
{
char correctPassword[] = "patito";
char password[10];
gets(password);
if(strncmp(password, correctPassword, 10) == 0)
printf("\nPassword correcto. Bienvenido!\n");
else
printf("\nAcceso denegado.\n");
} | 0 |
tizilogic/krink | 609907a | Tests/DragDrop/Sources/main.c | C | www.github.com/tizilogic/krink/tree/main/Tests/DragDrop/Sources/main.c | https://raw.githubusercontent.com/tizilogic/krink/609907a/Tests/DragDrop/Sources/main.c | tizilogic/krink 609907a Tests/DragDrop/Sources/main.c | true | 200 | 2,214 | #include <assert.h>
#include <kinc/graphics4/graphics.h>
#include <kinc/system.h>
#include <krink/flecs/krink_flecs.h>
#include <krink/flecs/modules/drag_comp.h>
#include <krink/flecs/modules/render_comp.h>
#include <krink/graphics2/graphics.h>
#include <krink/memory.h>
#include <krink/system.h>
#include <stdlib.h>
st... | 4 |
jyuurin/BCC7-CPD | db55434 | ADO11/SomaVetorAnel.c | C | www.github.com/jyuurin/BCC7-CPD/tree/main/ADO11/SomaVetorAnel.c | https://raw.githubusercontent.com/jyuurin/BCC7-CPD/db55434/ADO11/SomaVetorAnel.c | jyuurin/BCC7-CPD db55434 ADO11/SomaVetorAnel.c | true | 200 | 967 | #include <stdio.h>
#include <stdlib.h>
#include <mpi.h>
int main(int argc, char *argv[]) {
int rank, tamanho;
int n = 12;
int r;
int *localVet;
int localSoma = 0;
int totalSoma = 0;
MPI_Init(&argc, &argv);
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
MPI_Comm_size(MPI_COMM_WORLD, &tamanho);
r = n / tamanho;
loca... | 3 |
Markg747/alx-low_level_programming | e6f9176 | 0x09-static_libraries/100-atoi.c | C | www.github.com/Markg747/alx-low_level_programming/tree/main/0x09-static_libraries/100-atoi.c | https://raw.githubusercontent.com/Markg747/alx-low_level_programming/e6f9176/0x09-static_libraries/100-atoi.c | Markg747/alx-low_level_programming e6f9176 0x09-static_libraries/100-atoi.c | true | 200 | 463 | #include "main.h"
#include <stdio.h>
/**
* _atoi - conterts string to int
*
*@s: string variable
*
* Return: Always 0.
*/
int _atoi(char *s)
{
int sign = 1;
unsigned int total = 0;
char null_flag = 0;
while (*s)
{
if (*s == '-')
{
sign = sign * -1;
}
if (*s >= 48 && *s <= 57)
{
null_flag =... | 5 |
RyanSun1991/network_management_service | 30855da | factory_test/video_test.c | C | www.github.com/RyanSun1991/network_management_service/tree/main/factory_test/video_test.c | https://raw.githubusercontent.com/RyanSun1991/network_management_service/30855da/factory_test/video_test.c | RyanSun1991/network_management_service 30855da factory_test/video_test.c | true | 200 | 6,368 | #include "video_test.h"
#define VIDEO_PATH ("./res/jobs.mp4")
#define VIDEO_PATH1 ("./res/movie.mp4")
typedef struct VideoState {
volatile int status;
int delete;
int video_type;
int video_index;
AVPacket* pkt;
AVCodec *codec;
AVFormatContext* ic;
AVCodecContext* avctx;
AVInputFormat* iformat;
}... | 6 |
kioelka/ds18b20 | df75bb8 | Ds18b20/ds18sensor.c | C | www.github.com/kioelka/ds18b20/tree/main/Ds18b20/ds18sensor.c | https://raw.githubusercontent.com/kioelka/ds18b20/df75bb8/Ds18b20/ds18sensor.c | kioelka/ds18b20 df75bb8 Ds18b20/ds18sensor.c | true | 200 | 4,836 | #include "ds18sensor.h"
#define SKIP_ROM_ADR 0xCC // пропуск адресации
#define CONVERT_TEMP 0x44 // запускает преобразование температуры
#define READ_DATA_COMAND 0xBE //команда чтения содержимого памяти
extern indicatorTypedef indicator;
static void delay_us(unsigned T)
{
asm(
"cmp r0, #0\n"
"beq ... | 2 |
adigitadi/temp | 2e26790 | test_split_coal.c | C | www.github.com/adigitadi/temp/tree/main/test_split_coal.c | https://raw.githubusercontent.com/adigitadi/temp/2e26790/test_split_coal.c | adigitadi/temp 2e26790 test_split_coal.c | true | 200 | 1,187 |
// Check splitting and coalescing
#ifndef DEMO_TEST
#include <malloc.h>
#else
#include <stdlib.h>
#endif
#include <stdio.h>
#include <stddef.h>
#include <assert.h>
#define BLOCK_SIZE 16
#define BLOCK_COUNT 100
int main() {
char *data[BLOCK_COUNT];
fprintf(stderr, "Checking splitting...");
data[0] = mallo... | 7 |
Bassel-saleh/alx-low_level_programming | 3b6a1a6 | 0x14-bit_manipulation/1-print_binary.c | C | www.github.com/Bassel-saleh/alx-low_level_programming/tree/main/0x14-bit_manipulation/1-print_binary.c | https://raw.githubusercontent.com/Bassel-saleh/alx-low_level_programming/3b6a1a6/0x14-bit_manipulation/1-print_binary.c | Bassel-saleh/alx-low_level_programming 3b6a1a6 0x14-bit_manipulation/1-print_binary.c | true | 200 | 395 | #include "main.h"
/**
* print_binary - convert decimals into binary
* @n: the number to be converted
*/
void print_binary(unsigned long int n)
{
unsigned long int cpy = n, mask = 1;
int len = 0;
while (cpy > 0)
{
len++;
cpy >>= 1;
}
len -= 1;
if (len > 0)
mask = mask << len;
while (mask > 0)
{
if... | 1 |
AbdelhayZaadaddi/alx-low_level_programming | ca6ba30 | 0x15-file_io/0-read_textfile.c | C | www.github.com/AbdelhayZaadaddi/alx-low_level_programming/tree/main/0x15-file_io/0-read_textfile.c | https://raw.githubusercontent.com/AbdelhayZaadaddi/alx-low_level_programming/ca6ba30/0x15-file_io/0-read_textfile.c | AbdelhayZaadaddi/alx-low_level_programming ca6ba30 0x15-file_io/0-read_textfile.c | true | 200 | 619 | #include "main.h"
/**
* read_textfile - reads a text file & prints the letters
*
* @filename: file name.
* @letters: numbers of letters printed.
*
* Return: numbers of letters printed if fails returns 0.
*/
ssize_t read_textfile(const char *filename, size_t letters)
{
char *buffer;
int filed;
ssize_t nr, nw... | 0 |
BoostedT/atlas-low_level_programming | 12bf9c3 | function_pointers/3-calc.h | C | www.github.com/BoostedT/atlas-low_level_programming/tree/main/function_pointers/3-calc.h | https://raw.githubusercontent.com/BoostedT/atlas-low_level_programming/12bf9c3/function_pointers/3-calc.h | BoostedT/atlas-low_level_programming 12bf9c3 function_pointers/3-calc.h | true | 200 | 252 | #ifndef CALC_H
#define CALC_H
#include <stdio.h>
/**
* struct op - Struct op
*
* @op: The operator
* @f: The function associated
*/
typedef struct op
{
char *op;
int (*f)(int a, int b);
} op_t;
int (*get_op_func(char *s))(int, int);
#endif
| 4 |
Jullsss/Educational_projects | d487200 | TASK2/main5.c | C | www.github.com/Jullsss/Educational_projects/tree/main/TASK2/main5.c | https://raw.githubusercontent.com/Jullsss/Educational_projects/d487200/TASK2/main5.c | Jullsss/Educational_projects d487200 TASK2/main5.c | true | 200 | 2,246 | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
double p(double x){
return -3 * x;
}
double q(double x){
return 2;
}
double f(double x){
return 1.5;
}
void resh(double **a, double *b, double *x1, int n) {
double d1[n], d2[n], d3[n], k;
d1[0] = 0; d3[n] = 0;
for (int i = 0; i < n; i... | 6 |
GoldMane01/minishell-42 | d5b5bcc | builtins/builtins_second.c | C | www.github.com/GoldMane01/minishell-42/tree/main/builtins/builtins_second.c | https://raw.githubusercontent.com/GoldMane01/minishell-42/d5b5bcc/builtins/builtins_second.c | GoldMane01/minishell-42 d5b5bcc builtins/builtins_second.c | true | 200 | 1,702 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* builtins2.c :+: :+: :+: ... | 5 |
rsenn/c-utils | 5b6f3b4 | lib/ucs/stralloc_utf8_to_latin1.c | C | www.github.com/rsenn/c-utils/tree/main/lib/ucs/stralloc_utf8_to_latin1.c | https://raw.githubusercontent.com/rsenn/c-utils/5b6f3b4/lib/ucs/stralloc_utf8_to_latin1.c | rsenn/c-utils 5b6f3b4 lib/ucs/stralloc_utf8_to_latin1.c | true | 200 | 385 | #include "../stralloc.h"
#include "../ucs.h"
size_t
stralloc_utf8_to_latin1(stralloc* out, const char* s, size_t len) {
const char* x = s;
ssize_t i, n = len;
char* p;
stralloc_readyplus(out, n);
p = stralloc_end(out);
while(n > 0) {
i = scan_latin1_utf8(x, n, p);
x += i;
n -= i;
++p;
... | 2 |
specs-feup/code-mending | 61e6ee9 | repos/repos_output/dataset/projects/torvalds_linux_master/drivers_net_ethernet_netronome_nfp_nfd3_ipsec.c | C | www.github.com/specs-feup/code-mending/tree/main/repos/repos_output/dataset/projects/torvalds_linux_master/drivers_net_ethernet_netronome_nfp_nfd3_ipsec.c | https://raw.githubusercontent.com/specs-feup/code-mending/61e6ee9/repos/repos_output/dataset/projects/torvalds_linux_master/drivers_net_ethernet_netronome_nfp_nfd3_ipsec.c | specs-feup/code-mending 61e6ee9 repos/repos_output/dataset/projects/torvalds_linux_master/drivers_net_ethernet_netronome_nfp_nfd3_ipsec.c | true | 200 | 941 | // SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
/* Copyright (C) 2018 Netronome Systems, Inc */
/* Copyright (C) 2021 Corigine, Inc */
#include <net/xfrm.h>
#include "nfp_net.h"
#include "nfd3.h"
void nfp_nfd3_ipsec_tx(struct nfp_nfd3_tx_desc *txd, struct sk_buff *skb)
{
struct xfrm_state *x = xfrm_input... | 7 |
PL-play/build-LanguageForMyDaughter | 53f1a34 | src/compiler/scanner.h | C | www.github.com/PL-play/build-LanguageForMyDaughter/tree/main/src/compiler/scanner.h | https://raw.githubusercontent.com/PL-play/build-LanguageForMyDaughter/53f1a34/src/compiler/scanner.h | PL-play/build-LanguageForMyDaughter 53f1a34 src/compiler/scanner.h | true | 200 | 2,342 | //
// Created by ran on 2024-03-16.
//
#ifndef ZHI_SCANNER_SCANNER_H_
#define ZHI_SCANNER_SCANNER_H_
#include <stddef.h>
#include "common/common.h"
#ifdef __cplusplus
extern "C" {
#endif
typedef enum {
// Single-character tokens.
TOKEN_LEFT_PAREN, TOKEN_RIGHT_PAREN,
TOKEN_LEFT_BRACE, TOKEN_RIGHT_BRACE,
TOKEN_L... | 1 |
ssanath/UnixSEE | e3b88c1 | 6b.c | C | www.github.com/ssanath/UnixSEE/tree/main/6b.c | https://raw.githubusercontent.com/ssanath/UnixSEE/e3b88c1/6b.c | ssanath/UnixSEE e3b88c1 6b.c | true | 200 | 877 | #include<stdio.h>
#include<stdlib.h>
#include<unistd.h>
#include<fcntl.h>
#include<errno.h>
#include<sys/stat.h>
int main(int argc, char *argv[])
{
int fd = open(argv[1],O_RDWR,0);
struct flock fvar;
char buf[100];
fvar.l_type = F_WRLCK;
fvar.l_whence = SEEK_END;
fvar.l_start = SEEK_END-100;
fvar.l_len = 100;
... | 4 |
UCINE/cuby | b89f7bb | get_next_line/get_next_line_utils.c | C | www.github.com/UCINE/cuby/tree/main/get_next_line/get_next_line_utils.c | https://raw.githubusercontent.com/UCINE/cuby/b89f7bb/get_next_line/get_next_line_utils.c | UCINE/cuby b89f7bb get_next_line/get_next_line_utils.c | true | 200 | 2,430 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* get_next_line_utils.c :+: :+: :+: ... | 6 |
aseec-lab/llms-for-code-analysis | f1bdb01 | results/obfuscated/IOCCC-data/gpt-3.5-turbo/2018-burton2-test09.c | C | www.github.com/aseec-lab/llms-for-code-analysis/tree/main/results/obfuscated/IOCCC-data/gpt-3.5-turbo/2018-burton2-test09.c | https://raw.githubusercontent.com/aseec-lab/llms-for-code-analysis/f1bdb01/results/obfuscated/IOCCC-data/gpt-3.5-turbo/2018-burton2-test09.c | aseec-lab/llms-for-code-analysis f1bdb01 results/obfuscated/IOCCC-data/gpt-3.5-turbo/2018-burton2-test09.c | true | 200 | 988 | Based on the given code, here is the deobfuscated version:
```c
#include <stdio.h>
int main(int argc, char **argv) {
if (argv[0][0] == '"') {
switch (argv[0][1]) {
case 'a':
printf("a\n");
break;
case 'b':
printf("b\n");
break;
}
}
while (--argc > 0) {
printf("%d", argc);
}
return 0;
}
``... | 5 |
MoamenNasser/ARM-DRIVERS | 31f1ffd | RCC_DRIVER/include/RCC_Private.h | C | www.github.com/MoamenNasser/ARM-DRIVERS/tree/main/RCC_DRIVER/include/RCC_Private.h | https://raw.githubusercontent.com/MoamenNasser/ARM-DRIVERS/31f1ffd/RCC_DRIVER/include/RCC_Private.h | MoamenNasser/ARM-DRIVERS 31f1ffd RCC_DRIVER/include/RCC_Private.h | true | 200 | 6,337 | /*************************************************************************************/
/* Author: Moamen Nasser */
/* Date: 13 Aug 2022 */
/* Version: V1.0 */
/************************************************************************************/
#ifndef _RCC_Private_H
#define _RCC... | 2 |
lambertoo/alx-low_level_programming | 2b228de | 0x04-more_functions_nested_loops/7-print_diagonal.c | C | www.github.com/lambertoo/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/7-print_diagonal.c | https://raw.githubusercontent.com/lambertoo/alx-low_level_programming/2b228de/0x04-more_functions_nested_loops/7-print_diagonal.c | lambertoo/alx-low_level_programming 2b228de 0x04-more_functions_nested_loops/7-print_diagonal.c | true | 200 | 385 | #include "print_diagonal.h"
#include "_putchar.h"
/**
* print_diagonal - draw a diagonal line in terminal
* @n: length of the diagonal line to draw
*
* Return: void
*/
void print_diagonal(int n)
{
int i = 1;
while (i <= n)
{
int j = 1;
++i;
while (j <= (i - 2))
{
_putchar(' ');
++j;
}
_putc... | 3 |
Happiness0952/alx-low_level_programming | 105471d | 0x08-recursion/6-is_prime_number.c | C | www.github.com/Happiness0952/alx-low_level_programming/tree/main/0x08-recursion/6-is_prime_number.c | https://raw.githubusercontent.com/Happiness0952/alx-low_level_programming/105471d/0x08-recursion/6-is_prime_number.c | Happiness0952/alx-low_level_programming 105471d 0x08-recursion/6-is_prime_number.c | true | 200 | 490 | #include "main.h"
/**
* prime_checker - checker for prime number
*
* @a: number
* @b: divisor
*
* Return: if prime or not
*/
int prime_checker(int a, int b)
{
if (a == b)
{
return (1);
}
else if (a % b == 0)
{
return (0);
}
return (prime_checker(a, b + 1));
}
/**
* is_prime_number - returns 1 if the... | 0 |
kunalgavhane12/c-assignment-1 | e0eb113 | Assignment1/1.c | C | www.github.com/kunalgavhane12/c-assignment-1/tree/main/Assignment1/1.c | https://raw.githubusercontent.com/kunalgavhane12/c-assignment-1/e0eb113/Assignment1/1.c | kunalgavhane12/c-assignment-1 e0eb113 Assignment1/1.c | true | 200 | 384 | /* Define an integer (int) varialbe. Read a number from the user into this
variable. Finally print the value in the variable. Also print the
variable as hexadecimal(hex) number and as octal number.*/
#include<stdio.h>
int main()
{
int a;
printf("Enter a number:\n");
scanf("%d",&a);
printf("In Decimal :%d\n",a);
pr... | 7 |
martinmarsh/compass_cmps12 | 299a5d6 | example_net_config.h | C | www.github.com/martinmarsh/compass_cmps12/tree/main/example_net_config.h | https://raw.githubusercontent.com/martinmarsh/compass_cmps12/299a5d6/example_net_config.h | martinmarsh/compass_cmps12 299a5d6 example_net_config.h | true | 200 | 656 | // Enter your WiFi ssid and password for network A when available
//Enclose strings in double quotes without anything else on the line
#define SSID_A "********"
#define PASSWORD_A "***********"
// Retries the above password a number of times before trying the second password
// If second password also fails after re... | 1 |
hugo-b-fx/holbertonschool-low_level_programming | cb637c9 | functions_nested_loops/1-alphabet.c | C | www.github.com/hugo-b-fx/holbertonschool-low_level_programming/tree/main/functions_nested_loops/1-alphabet.c | https://raw.githubusercontent.com/hugo-b-fx/holbertonschool-low_level_programming/cb637c9/functions_nested_loops/1-alphabet.c | hugo-b-fx/holbertonschool-low_level_programming cb637c9 functions_nested_loops/1-alphabet.c | true | 200 | 232 | #include "main.h"
/**
* print_alphabet - prints _putchar, followed by a new line
* Return: Always 0 (Success)
*/
void print_alphabet(void)
{
char alp;
for (alp = 'a'; alp <= 'z'; alp++)
_putchar(alp);
_putchar('\n');
}
| 4 |
GauravAsane/C-Langauge | c9bb454 | Programs_On_Numbers/program5.c | C | www.github.com/GauravAsane/C-Langauge/tree/main/Programs_On_Numbers/program5.c | https://raw.githubusercontent.com/GauravAsane/C-Langauge/c9bb454/Programs_On_Numbers/program5.c | GauravAsane/C-Langauge c9bb454 Programs_On_Numbers/program5.c | true | 200 | 364 | // Accept one number from user if number is less than 10 then print "Hello" otherwise print "Demo".
#include <stdio.h>
void Display(int Value)
{
if(Value < 10)
{
printf("Hello\n");
}
else
{
printf("Demo\n");
}
}
int main()
{
int No1 = 0;
printf("Enter the Number :\n");
scanf("%d"... | 5 |
Link265/code | 126531f | C/tareas.c | C | www.github.com/Link265/code/tree/main/C/tareas.c | https://raw.githubusercontent.com/Link265/code/126531f/C/tareas.c | Link265/code 126531f C/tareas.c | true | 200 | 5,723 | #include <stdio.h>
#include <stdlib.h>
#define PENDIENTES 1
#define TERMINADAS 0
#define true 1
#define false 0
#define TAREAS_PENDIENTES "lista_de_tareas_pendientes.txt"
#define TAREAS_TERMINADAS "lista_de_tareas_terminadas.txt"
int agregar_tarea(char [100]);
int terminar_tarea(int id_tarea);
void mostrar_menu(void)... | 6 |
code-lover636/DSA | 482e432 | Cycle2/linearSearch.c | C | www.github.com/code-lover636/DSA/tree/main/Cycle2/linearSearch.c | https://raw.githubusercontent.com/code-lover636/DSA/482e432/Cycle2/linearSearch.c | code-lover636/DSA 482e432 Cycle2/linearSearch.c | true | 200 | 968 | /*
1. Implement Linear Search
Search an array or list by checking items one at a time.
Time complexity ……………O(n)
*/
#include <stdio.h>
void linearSearch(int arr[], int n, int target) {
for (int i = 0; i < n; i++) {
if (arr[i] == target) {
printf("Element is found at index %d.\n", i);
... | 2 |
brian101okumu/alx-low_level_programming | accd33f | 0x02-functions_nested_loops/6-abs.c | C | www.github.com/brian101okumu/alx-low_level_programming/tree/main/0x02-functions_nested_loops/6-abs.c | https://raw.githubusercontent.com/brian101okumu/alx-low_level_programming/accd33f/0x02-functions_nested_loops/6-abs.c | brian101okumu/alx-low_level_programming accd33f 0x02-functions_nested_loops/6-abs.c | true | 200 | 239 | #include "main.h"
/**
* _abs - finds absolute value
* @c: The number to be computed
* Return: returns absolute value or zero
*/
int _abs(int c)
{
if (c < 0)
{
int abs_val;
abs_val = c * -1;
return (abs_val);
}
return (c);
}
| 3 |
KSmaranSai/DAA_Lab | 64e662f | 23_07_27/q3.c | C | www.github.com/KSmaranSai/DAA_Lab/tree/main/23_07_27/q3.c | https://raw.githubusercontent.com/KSmaranSai/DAA_Lab/64e662f/23_07_27/q3.c | KSmaranSai/DAA_Lab 64e662f 23_07_27/q3.c | true | 200 | 2,359 | #include <stdio.h>
#include <stdlib.h>
int findIndex(int *arr, int size, int key)
{
for (int i = 0; i < size; i++)
{
if (arr[i] == key)
{
return i;
}
}
return -1;
}
int main()
{
// Opening file
FILE *intFile = fopen("IntArray.txt", "r");
... | 0 |
dzaky2636/IFSemester2 | 4ad8d50 | Algoritma&StrukturData/00000089614_DzakyFaturRahman_Week01/W01_00000089614_PointerArr.c | C | www.github.com/dzaky2636/IFSemester2/tree/main/Algoritma&StrukturData/00000089614_DzakyFaturRahman_Week01/W01_00000089614_PointerArr.c | https://raw.githubusercontent.com/dzaky2636/IFSemester2/4ad8d50/Algoritma%26StrukturData/00000089614_DzakyFaturRahman_Week01/W01_00000089614_PointerArr.c | dzaky2636/IFSemester2 4ad8d50 Algoritma&StrukturData/00000089614_DzakyFaturRahman_Week01/W01_00000089614_PointerArr.c | true | 200 | 307 | #include <stdio.h>
int hitungJumlah(int *jumlah, int numbers[]){
int i = 0;
for(i = 0; i < 5; i++){
*jumlah += numbers[i];
}
}
int main(){
int randomNumber[5] = {1, 2, 3, 4};
int jumlah = 0;
hitungJumlah(&jumlah, randomNumber);
printf("Jumlah = %d\n", jumlah);
return 0;
}
| 7 |
OkotEgarim/epitech-1st-year-projects | 9f9e973 | unix-system-programming/42sh/src/parse/carac/backticks.c | C | www.github.com/OkotEgarim/epitech-1st-year-projects/tree/main/unix-system-programming/42sh/src/parse/carac/backticks.c | https://raw.githubusercontent.com/OkotEgarim/epitech-1st-year-projects/9f9e973/unix-system-programming/42sh/src/parse/carac/backticks.c | OkotEgarim/epitech-1st-year-projects 9f9e973 unix-system-programming/42sh/src/parse/carac/backticks.c | true | 200 | 1,309 | /*
** EPITECH PROJECT, 2024
** INHIBITORS
** File description:
** Things that ignore parsing.
*/
#include "../../../include/shell.h"
void rebuild_val(cmd_data_t *tmp, char *result, int start, int end)
{
char *start_str = my_substr(tmp->value, 0, start);
char *end_str = my_substr(tmp->value, end + 1, my_strlen... | 4 |
Levyslater/alx-low_level_programming | bba1a68 | 0x13-more_singly_linked_lists/103-find_loop.c | C | www.github.com/Levyslater/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/103-find_loop.c | https://raw.githubusercontent.com/Levyslater/alx-low_level_programming/bba1a68/0x13-more_singly_linked_lists/103-find_loop.c | Levyslater/alx-low_level_programming bba1a68 0x13-more_singly_linked_lists/103-find_loop.c | true | 200 | 629 | #include <stdlib.h>
#include <stdio.h>
#include "lists.h"
/**
* find_listint_loop - functio that finds the loop in a linked list
* @head: the loop searched for
*
* Return: pointer to the start of the node, NULL otherwise
*/
listint_t *find_listint_loop(listint_t *head)
{
listint_t *list1 = head;
listint_t *list... | 1 |
Njokii/alx-low_level_programming | c41f7a1 | 0x02-functions_nested_loops/6-abs.c | C | www.github.com/Njokii/alx-low_level_programming/tree/main/0x02-functions_nested_loops/6-abs.c | https://raw.githubusercontent.com/Njokii/alx-low_level_programming/c41f7a1/0x02-functions_nested_loops/6-abs.c | Njokii/alx-low_level_programming c41f7a1 0x02-functions_nested_loops/6-abs.c | true | 200 | 243 | #include "main.h"
/**
*_abs - computes the absolute value of a number
*@m: value to be made absolute
*
*Return: the value itself
*/
int _abs(int m)
{
if (m < 0)
{
m = ((-1) * (m));
return (m);
}
else
{
return (m);
}
}
| 5 |
jos-ssh/itask | 663fd46 | kmod/net/net.h | C | www.github.com/jos-ssh/itask/tree/main/kmod/net/net.h | https://raw.githubusercontent.com/jos-ssh/itask/663fd46/kmod/net/net.h | jos-ssh/itask 663fd46 kmod/net/net.h | true | 200 | 737 | #pragma once
#include "queue.h"
#include <inc/env.h>
#include <inc/types.h>
#include <inc/pool_alloc.h>
extern envid_t g_InitdEnvid;
extern envid_t g_PcidEnvid;
extern struct virtio_net_device_t* net;
#define RECEIVE_ADDR 0x0FFFF000
#define VENDOR_ID 0x1AF4
#define DEVICE_ID 0x1000
#define SEND_BUF_NUM 512
#defi... | 6 |
asutosh04/DSA-in-C | 0bb00df | DSA LAB/Assignment_6/Q5.c | C | www.github.com/asutosh04/DSA-in-C/tree/main/DSA LAB/Assignment_6/Q5.c | https://raw.githubusercontent.com/asutosh04/DSA-in-C/0bb00df/DSA%20LAB/Assignment_6/Q5.c | asutosh04/DSA-in-C 0bb00df DSA LAB/Assignment_6/Q5.c | true | 200 | 1,255 | //prefix
#include <stdio.h>
#include <conio.h>
#include <string.h>
int steck[10];
int top = -1;
void push(int value)
{
steck[top++] = value;
}
int pop()
{
return (steck[top--]);
}
int ope(char c)
{
if (c == '+' || c == '-' || c == '*' || c == '/')
return 1;
else
... | 0 |
ShawkyAh/alx-low_level_programming | 2335ba6 | 0x08-recursion/4-pow_recursion.c | C | www.github.com/ShawkyAh/alx-low_level_programming/tree/main/0x08-recursion/4-pow_recursion.c | https://raw.githubusercontent.com/ShawkyAh/alx-low_level_programming/2335ba6/0x08-recursion/4-pow_recursion.c | ShawkyAh/alx-low_level_programming 2335ba6 0x08-recursion/4-pow_recursion.c | true | 200 | 329 | #include "main.h"
/**
* _pow_recursion - function that returns the value of x
* raised to the power of y
*
*@x: base
*@y: exposant
*Return: pointer to source input
*/
int _pow_recursion(int x, int y)
{
if (y < 0)
return (-1);
else if (y == 1)
return (x);
else if (y == 0)
return (1);
return (x * _pow_recursion(x, y ... | 3 |
thisisignitedoreo/mus2 | d513cec | src/tags.c | C | www.github.com/thisisignitedoreo/mus2/tree/main/src/tags.c | https://raw.githubusercontent.com/thisisignitedoreo/mus2/d513cec/src/tags.c | thisisignitedoreo/mus2 d513cec src/tags.c | true | 200 | 14,284 |
unsigned int parse_syncsafe_int(unsigned int value) {
unsigned int a, b, c, d, result = 0;
a = value & 0xFF;
b = (value >> 8) & 0xFF;
c = (value >> 16) & 0xFF;
d = (value >> 24) & 0xFF;
result = result | a;
result = result | (b << 7);
result = result | (c << 14);
result = result | ... | 2 |
tunabaris/About-C | 843733b | 4-Structure/structureDates/main.c | C | www.github.com/tunabaris/About-C/tree/main/4-Structure/structureDates/main.c | https://raw.githubusercontent.com/tunabaris/About-C/843733b/4-Structure/structureDates/main.c | tunabaris/About-C 843733b 4-Structure/structureDates/main.c | true | 200 | 493 | /****************
Date Structures
*****************/
#include <stdio.h>
#include <stdlib.h>
typedef struct date{
int day;
int month;
int year;
}date;
dateShow(date temp);
int main()
{ date today;
today.day=24;
today.month=6;
today.year=2022;
dateShow(today);
return 0;
}
dateShow(... | 7 |
calmsacibis995/uw2-src | 95995ce | usr/src/common/lib/libnwNcp/23s51.c | C | www.github.com/calmsacibis995/uw2-src/tree/main/usr/src/common/lib/libnwNcp/23s51.c | https://raw.githubusercontent.com/calmsacibis995/uw2-src/95995ce/usr/src/common/lib/libnwNcp/23s51.c | calmsacibis995/uw2-src 95995ce usr/src/common/lib/libnwNcp/23s51.c | true | 200 | 3,017 | /* Copyright (c) 1990, 1991, 1992, 1993, 1994 Novell, Inc. All Rights Reserved. */
/* Copyright (c) 1993 Novell, Inc. All Rights Reserved. */
/* All Rights Reserved */
/* THIS IS UNPUBLISHED PROPRIETARY SOURCE CODE OF Novell Inc. */
/* The copyright notice above does not evidence any */
/* actual or intended pu... | 4 |
devwizard64/sm64_newipl3 | 2d1b67e | stage/vcutm/shp.c | C | www.github.com/devwizard64/sm64_newipl3/tree/main/stage/vcutm/shp.c | https://raw.githubusercontent.com/devwizard64/sm64_newipl3/2d1b67e/stage/vcutm/shp.c | devwizard64/sm64_newipl3 2d1b67e stage/vcutm/shp.c | true | 200 | 840 | #include <sm64/shplang.h>
#define SCRIPT
S_SCRIPT s_vcutm_54[] =
{
sCull(1000),
sStart(),
sGfx(LAYER_OPA_SURF, (void *)0x070096E0),
sEnd(),
sExit(),
};
S_SCRIPT s_vcutm1[] =
{
sScene(160, 120, 160, 120, 10),
sStart(),
sLayer(FALSE),
sStart(),
sOrtho(100),
sStart(),
sBackground(GPACK_RGBA5551(0x... | 1 |
Gnyanikasula/Sort | 53fbd5d | insertion_sort.c | C | www.github.com/Gnyanikasula/Sort/tree/main/insertion_sort.c | https://raw.githubusercontent.com/Gnyanikasula/Sort/53fbd5d/insertion_sort.c | Gnyanikasula/Sort 53fbd5d insertion_sort.c | true | 200 | 517 | #include<stdio.h>
void printArray(int* A, int n){
for (int i = 0; i< n; i++ ){
printf("%d ",A[i]);
}
printf("\n");
}
void insertionSort(int *A,int n){
int key, j;
for(int i=1; i < n ; i++){
key = A[i];
j = i-1;
while(j>= 0 && A[j] > key){
A[j+1] = A[j];
... | 6 |
gsmereka/Pipex | 3f8665a | src/set_cmds.c | C | www.github.com/gsmereka/Pipex/tree/main/src/set_cmds.c | https://raw.githubusercontent.com/gsmereka/Pipex/3f8665a/src/set_cmds.c | gsmereka/Pipex 3f8665a src/set_cmds.c | true | 200 | 2,120 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* set_cmds.c :+: :+: :+: ... | 5 |
brenonsantos/OpenPDM | 3fc9d8b | Software/stm32f103c8t6_v0.1/Core/Src/pdm_cfg.c | C | www.github.com/brenonsantos/OpenPDM/tree/main/Software/stm32f103c8t6_v0.1/Core/Src/pdm_cfg.c | https://raw.githubusercontent.com/brenonsantos/OpenPDM/3fc9d8b/Software/stm32f103c8t6_v0.1/Core/Src/pdm_cfg.c | brenonsantos/OpenPDM 3fc9d8b Software/stm32f103c8t6_v0.1/Core/Src/pdm_cfg.c | true | 200 | 10,828 | /*
* opdm_output_cfg.c
*
* Created on: 31 de mar de 2023
* Author: breno
*/
#include "opdm_cfg.h"
//extern CANBusReceiverTypedef CANBUS_RECEIVER_FRAMES[];
extern CANBusReceiverTypedef CANBUS_RECEIVER_FRAMES[NUM_OF_CAN_RECEIVERS];
extern CANBusTransmiterTypedef CANBUS_TRANSMITER_FRAMES[NUM_OF_CAN_TRANSMITER... | 3 |
genz0nline/aoc2024 | 2c8a848 | day9.c | C | www.github.com/genz0nline/aoc2024/tree/main/day9.c | https://raw.githubusercontent.com/genz0nline/aoc2024/2c8a848/day9.c | genz0nline/aoc2024 2c8a848 day9.c | true | 200 | 2,621 | #include <stdio.h>
#include <stdlib.h>
enum state {EMPTY, FILLED};
int main(void) {
char *input = NULL;
size_t max_input = 20000;
int len = getline(&input, &max_input, stdin) - 1;
int start_state = FILLED;
int finish_state = len % 2 ? FILLED : EMPTY;
char *start, *finish;
start = input... | 7 |
zhangzhongjun/webcode | 20152bd | bound_host1.c | C | www.github.com/zhangzhongjun/webcode/tree/main/bound_host1.c | https://raw.githubusercontent.com/zhangzhongjun/webcode/20152bd/bound_host1.c | zhangzhongjun/webcode 20152bd bound_host1.c | true | 200 | 1,202 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <arpa/inet.h>
#include <sys/socket.h>
#define BUF_SIZE 30
void error_handling(char *message);
int main(int argc, char *argv[])
{
int sock;
char message[BUF_SIZE];
struct sockaddr_in my_adr, your_adr;
socklen_t adr... | 4 |
ei-grad/usb-hid-brightness | a0fb4e4 | main.c | C | www.github.com/ei-grad/usb-hid-brightness/tree/main/main.c | https://raw.githubusercontent.com/ei-grad/usb-hid-brightness/a0fb4e4/main.c | ei-grad/usb-hid-brightness a0fb4e4 main.c | true | 200 | 3,830 | #include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#include <libusb.h>
#include "brightness.h"
#include "device_list.h"
#define MAX_BRIGHTNESS 54000
int main(int argc, char **argv) {
if(argc > 2) {
fprintf(stderr, "Usage: %s [0-54000]\n", argv[0]);
return EXIT_FAILURE;
}
libusb_c... | 1 |
NationsTechCoreLib/N32G003xx | 3bbd36b | firmware/n32g003_std_periph_driver/src/n32g003_rcc.c | C | www.github.com/NationsTechCoreLib/N32G003xx/tree/main/firmware/n32g003_std_periph_driver/src/n32g003_rcc.c | https://raw.githubusercontent.com/NationsTechCoreLib/N32G003xx/3bbd36b/firmware/n32g003_std_periph_driver/src/n32g003_rcc.c | NationsTechCoreLib/N32G003xx 3bbd36b firmware/n32g003_std_periph_driver/src/n32g003_rcc.c | true | 200 | 22,921 | /**
* Copyright (c) 2022, Nations Technologies Inc.
*
* All rights reserved.
*
* This software is the exclusive property of Nations Technologies Inc. (Hereinafter
* referred to as NATIONS). This software, and the product of NATIONS described herein
* (Hereinafter referred to as the Product) are ow... | 2 |
Integrated-circuit-design/Bai-Tap-C-18-8-2024 | 0ce2ee7 | ex1.c | C | www.github.com/Integrated-circuit-design/Bai-Tap-C-18-8-2024/tree/main/ex1.c | https://raw.githubusercontent.com/Integrated-circuit-design/Bai-Tap-C-18-8-2024/0ce2ee7/ex1.c | Integrated-circuit-design/Bai-Tap-C-18-8-2024 0ce2ee7 ex1.c | true | 200 | 760 | #include <stdio.h>
int main()
{
int n, sum = 0;
int check = 1;
while (check)
{
do
{
// Yêu cầu người dùng nhập giá trị của n
printf("Nhap mot so nguyen duong n: ");
scanf("%d", &n);
if (n <= 0)
{
printf("n... | 0 |
mratunjya/github-collaboration | 5c55e48 | railFenceCipher.c | C | www.github.com/mratunjya/github-collaboration/tree/main/railFenceCipher.c | https://raw.githubusercontent.com/mratunjya/github-collaboration/5c55e48/railFenceCipher.c | mratunjya/github-collaboration 5c55e48 railFenceCipher.c | true | 200 | 2,807 | #include <stdbool.h>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
// function to encrypt a message
char *encryptRailFence(char *text, int key)
{
// create the matrix to cipher plain text
// key = rows , length(text) = columns
int text_length = strlen(text);
char rail[key][text_length];
// filling t... | 6 |
cornell-zhang/allo | dc2eab6 | mlir/include/allo-c/Dialect/Registration.h | C | www.github.com/cornell-zhang/allo/tree/main/mlir/include/allo-c/Dialect/Registration.h | https://raw.githubusercontent.com/cornell-zhang/allo/dc2eab6/mlir/include/allo-c/Dialect/Registration.h | cornell-zhang/allo dc2eab6 mlir/include/allo-c/Dialect/Registration.h | true | 200 | 656 | /*
* Copyright Allo authors. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0
*/
#ifndef ALLO_MLIR_C_REGISTRATION_H
#define ALLO_MLIR_C_REGISTRATION_H
#include "mlir/CAPI/IR.h"
#include "mlir-c/IR.h"
#include "mlir-c/Support.h"
#ifdef __cplusplus
extern "C" {
#endif
/** Registers all dialects with a co... | 5 |
jetperch/fitterbap | c5021e1 | include/fitterbap/host/win/error.h | C | www.github.com/jetperch/fitterbap/tree/main/include/fitterbap/host/win/error.h | https://raw.githubusercontent.com/jetperch/fitterbap/c5021e1/include/fitterbap/host/win/error.h | jetperch/fitterbap c5021e1 include/fitterbap/host/win/error.h | true | 200 | 1,180 | /*
* Copyright 2022 Jetperch LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to... | 3 |
PaulaMaina/monty | fbfc723 | exec.c | C | www.github.com/PaulaMaina/monty/tree/main/exec.c | https://raw.githubusercontent.com/PaulaMaina/monty/fbfc723/exec.c | PaulaMaina/monty fbfc723 exec.c | true | 200 | 1,125 | #include "monty.h"
/**
* execute_op - executes opcode
* @stack: stack
* @count: line number
* @file: points to the monty file
* @cont: content of the line
* Return: 0 or 1
*/
int execute_op(char *cont, stack_t **stack, unsigned int count, FILE *file)
{
instruction_t ops_f[] = {
{"push", push_func}, {"pall",... | 7 |
GiannPabon/holbertonschool-binary_trees | cbade4b | 18-binary_tree_uncle.c | C | www.github.com/GiannPabon/holbertonschool-binary_trees/tree/main/18-binary_tree_uncle.c | https://raw.githubusercontent.com/GiannPabon/holbertonschool-binary_trees/cbade4b/18-binary_tree_uncle.c | GiannPabon/holbertonschool-binary_trees cbade4b 18-binary_tree_uncle.c | true | 200 | 512 | #include "binary_trees.h"
/**
* binary_tree_uncle - Finds the uncle of a node
* @node: Pointer to the node to find the uncle
*
* Return: Pointer to the uncle node or NULL
*/
binary_tree_t *binary_tree_uncle(binary_tree_t *node)
{
binary_tree_t *parent, *grandparent;
if (!node || !node->parent || !node->parent... | 4 |
kpatsakis/primevul7 | 8dd2061 | 144116.c | C | www.github.com/kpatsakis/primevul7/tree/main/144116.c | https://raw.githubusercontent.com/kpatsakis/primevul7/8dd2061/144116.c | kpatsakis/primevul7 8dd2061 144116.c | true | 200 | 1,797 | **/
CImg<T>& autocrop(const T *const color=0, const char *const axes="zyx") {
if (is_empty()) return *this;
if (!color) { // Guess color
const CImg<T> col1 = get_vector_at(0,0,0);
const unsigned int w = _width, h = _height, d = _depth, s = _spectrum;
autocrop(col1,axes);
... | 1 |
jaehyeon7217/Algorithm | b7e4324 | 백준/Bronze/2908. 상수/상수.c | C | www.github.com/jaehyeon7217/Algorithm/tree/main/백준/Bronze/2908. 상수/상수.c | https://raw.githubusercontent.com/jaehyeon7217/Algorithm/b7e4324/%EB%B0%B1%EC%A4%80/Bronze/2908.%E2%80%85%EC%83%81%EC%88%98/%EC%83%81%EC%88%98.c | jaehyeon7217/Algorithm b7e4324 백준/Bronze/2908. 상수/상수.c | true | 200 | 345 | #include <stdio.h>
int reverse(int a) {
int tempx, tempy, tempz;
tempx = a / 100;
tempy = (a - (tempx * 100)) / 10;
tempz = a % 10;
return (tempz * 100) + (tempy * 10) + tempx;
}
int main() {
int a, b;
scanf("%d %d", &a, &b);
a = reverse(a);
b = reverse(b);
printf("%d", a > b ? a... | 6 |
DevMohi/C-Programming | 524d35b | Module 7/array_input_output.c | C | www.github.com/DevMohi/C-Programming/tree/main/Module 7/array_input_output.c | https://raw.githubusercontent.com/DevMohi/C-Programming/524d35b/Module%207/array_input_output.c | DevMohi/C-Programming 524d35b Module 7/array_input_output.c | true | 200 | 238 | #include<stdio.h>
int main(){
int ar[5];
//Taking input
for(int i=0; i<5 ; i++){
scanf("%d",&ar[i]);
}
//Printing output
for(int i=0; i<5 ; i++){
printf("%d\n",ar[i]);
}
return 0;
} | 2 |
hd9s1lk/C | 683a17d | Grupo_C/GrupoCEx8.c | C | www.github.com/hd9s1lk/C/tree/main/Grupo_C/GrupoCEx8.c | https://raw.githubusercontent.com/hd9s1lk/C/683a17d/Grupo_C/GrupoCEx8.c | hd9s1lk/C 683a17d Grupo_C/GrupoCEx8.c | true | 200 | 634 | //Implemene um programa que permia enconrar o maior e menor número de
//uma série de números posivos ornecidos. A sequência ermina com o número
//‘0’.
#include<stdio.h>
int main(int argc, char*argv[]){
int maior, menor, i=0, num=0, op;
printf("Insira um numero: ");
scanf("%d", &num);
maior=nu... | 0 |
Lolita0000/atividadesEmC. | 2ddc453 | atividades em C/Vetores9/5.c | C | www.github.com/Lolita0000/atividadesEmC./tree/main/atividades em C/Vetores9/5.c | https://raw.githubusercontent.com/Lolita0000/atividadesEmC./2ddc453/atividades%20em%20C/Vetores9/5.c | Lolita0000/atividadesEmC. 2ddc453 atividades em C/Vetores9/5.c | true | 200 | 484 | #include <stdio.h>
int main() {
int vetor[10];
int countPares = 0;
// Lendo o vetor de 10 posições
printf("Digite 10 valores inteiros:\n");
for (int i = 0; i < 10; i++) {
scanf("%d", &vetor[i]);
}
// Contando valores pares no vetor
for (int i = 0; i < 10; i++) {
... | 3 |
Mahmoud666-hub/alx-low_level_programming | 508134c | 0x05-pointers_arrays_strings/2main.c | C | www.github.com/Mahmoud666-hub/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/2main.c | https://raw.githubusercontent.com/Mahmoud666-hub/alx-low_level_programming/508134c/0x05-pointers_arrays_strings/2main.c | Mahmoud666-hub/alx-low_level_programming 508134c 0x05-pointers_arrays_strings/2main.c | true | 200 | 223 | #include "main.h"
#include <stdio.h>
/**
* main - check the code
*
* Return: Always 0.
*/
int main(void)
{
char *str;
int len;
str = "i";
len = _strlen(str);
printf("%d\n", len);
return (0);
}
| 5 |
coderahn/c_workspace | b1d8e8a | pointer_project.c | C | www.github.com/coderahn/c_workspace/tree/main/pointer_project.c | https://raw.githubusercontent.com/coderahn/c_workspace/b1d8e8a/pointer_project.c | coderahn/c_workspace b1d8e8a pointer_project.c | true | 200 | 3,765 | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
int level;
int arrayFish[6];
int *cursor;
void initData();
void printfFishes();
void decreaseWater(long elpasedTime);
int checkFishArrive();
//물고기가 6마리가 있습니다.
//이들은 어항에 살고 있는데 사막이라 너무 더워서 물이 계속 증발합니다.
//물이 다 증발하기 전에 부지런히 어항에 물을 줘서 물고기를 살려주세요.
//물고기는 시간이 지날수록 점... | 7 |
faraabin/fw_exp_board_usb_v1 | b5fcb75 | src/library/faraabin/faraabin_fobject.h | C | www.github.com/faraabin/fw_exp_board_usb_v1/tree/main/src/library/faraabin/faraabin_fobject.h | https://raw.githubusercontent.com/faraabin/fw_exp_board_usb_v1/b5fcb75/src/library/faraabin/faraabin_fobject.h | faraabin/fw_exp_board_usb_v1 b5fcb75 src/library/faraabin/faraabin_fobject.h | true | 200 | 2,429 | /**
******************************************************************************
* @file : faraabin_fobject.h
* @brief : Faraabin fobject types header file.
******************************************************************************
* @attention
*
* Copyright (c) 2024 FaraabinCo.
* All r... | 4 |
stmikeal/Low-Level-Programming | 30c26e0 | LLP1/include/basic_types/tuple.h | C | www.github.com/stmikeal/Low-Level-Programming/tree/main/LLP1/include/basic_types/tuple.h | https://raw.githubusercontent.com/stmikeal/Low-Level-Programming/30c26e0/LLP1/include/basic_types/tuple.h | stmikeal/Low-Level-Programming 30c26e0 LLP1/include/basic_types/tuple.h | true | 200 | 705 | #ifndef TUPLE_H
#define TUPLE_H
#include <inttypes.h>
#include "basic_tools/basic_file_manager.h"
#include "basic_tools/basic_convert.h"
/**
* Определение типов данных
*/
union tuple_header {
struct {
uint64_t parent;
uint64_t alloc;
};
struct {
uint64_t prev;
uint64_t ... | 6 |
LauraYarda/alx-low_level_programming | 39004e9 | 0x07-pointers_arrays_strings/100-set_string.c | C | www.github.com/LauraYarda/alx-low_level_programming/tree/main/0x07-pointers_arrays_strings/100-set_string.c | https://raw.githubusercontent.com/LauraYarda/alx-low_level_programming/39004e9/0x07-pointers_arrays_strings/100-set_string.c | LauraYarda/alx-low_level_programming 39004e9 0x07-pointers_arrays_strings/100-set_string.c | true | 200 | 196 | #include "main.h"
/**
* set_string - Sets the value of a pointer to a char
* @s: The pointer
* @to: The char
* Return: Always 0 (success)
*/
void set_string(char **s, char *to)
{
*s = to;
}
| 1 |
israel080/alx-low_level_programming | 76f4b8e | 0x01-variables_if_else_while/5-print_numbers.c | C | www.github.com/israel080/alx-low_level_programming/tree/main/0x01-variables_if_else_while/5-print_numbers.c | https://raw.githubusercontent.com/israel080/alx-low_level_programming/76f4b8e/0x01-variables_if_else_while/5-print_numbers.c | israel080/alx-low_level_programming 76f4b8e 0x01-variables_if_else_while/5-print_numbers.c | true | 200 | 211 | #include <stdio.h>
/**
* main - print numbers from 0 to 9
*
* Return: Always 0 (Ssuccess)
*/
int main(void)
{
char n;
for (n = '0'; n <= '9'; n++)
{
putchar (n);
}
putchar ('\n');
return (0);
}
| 0 |
rbas/homedevices | 4031299 | mafos/sample_conf.h | C | www.github.com/rbas/homedevices/tree/main/mafos/sample_conf.h | https://raw.githubusercontent.com/rbas/homedevices/4031299/mafos/sample_conf.h | rbas/homedevices 4031299 mafos/sample_conf.h | true | 200 | 382 | #define WIFI_SSID "XXX"
#define WIFI_PASSWORD "XXX"
#define MQTT_USERNAME "XXX"
#define MQTT_PASSWORD "XXX"
#define MQTT_SERVER "XXX"
#define MQTT_SERVER_PORT 1883
#define DEVICE_NAME "mafos"
#define DEVICE_PASSWORD "XXX"
#define SLEEP_SEC 5 * 60 // Measurement interval (seconds)
// Device specific implementation c... | 2 |
sumeyyekoyuncu/veri-yapilari | f2eca4b | kesisimbulma.c | C | www.github.com/sumeyyekoyuncu/veri-yapilari/tree/main/kesisimbulma.c | https://raw.githubusercontent.com/sumeyyekoyuncu/veri-yapilari/f2eca4b/kesisimbulma.c | sumeyyekoyuncu/veri-yapilari f2eca4b kesisimbulma.c | true | 200 | 1,518 |
#include <stdio.h>
#include <stdlib.h>
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
struct dugum{
int veri; //lıstelerin ozelligi olarak bir eleman hem kendi verisini hem de kendisinden sonraki verinin adresini tutar (hafizada kaybolmamasi icin)
struct... | 7 |
princepatel9114/C-LANG_TASK | c98065e | wstar.c | C | www.github.com/princepatel9114/C-LANG_TASK/tree/main/wstar.c | https://raw.githubusercontent.com/princepatel9114/C-LANG_TASK/c98065e/wstar.c | princepatel9114/C-LANG_TASK c98065e wstar.c | true | 200 | 487 | #include <stdio.h>
int main()
{
int i,j,row;
printf("Enter the number of rows: ");
scanf("%d",&row);
i=row;
while(i>=1)
{
j=1;
while(j<=i)
{
printf(" ");
j++;
}
j=i;
while(j<=row)
{
printf("*");
printf(" ");
j++;
}
i--;
printf("\n");
}
i+=2;
while(i<=row)
{
... | 4 |
ivenlaw/INF029-GeorgianaLaw | a14ee40 | .ccls-cache/@home@runner@INF029-GeorgianaLaw/ProjetoEscola@professores.c | C | www.github.com/ivenlaw/INF029-GeorgianaLaw/tree/main/.ccls-cache/@home@runner@INF029-GeorgianaLaw/ProjetoEscola@professores.c | https://raw.githubusercontent.com/ivenlaw/INF029-GeorgianaLaw/a14ee40/.ccls-cache/%40home%40runner%40INF029-GeorgianaLaw/ProjetoEscola%40professores.c | ivenlaw/INF029-GeorgianaLaw a14ee40 .ccls-cache/@home@runner@INF029-GeorgianaLaw/ProjetoEscola@professores.c | true | 200 | 12,531 | /* Cadastro de Professores */
#include <stdio.h>
#include "geral.h"
//#include "alunos.h"
#include "relatorios.h"
#include "professores.h"
#include "disciplinas.h"
#include <ctype.h>
#include <stdlib.h>
#include <string.h>
// FUNÇÃO com Opcao de cadastramento de professores
int cadastarProfessor(Ficha professor[], i... | 6 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.