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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
vladman-25/PCOM-HW | fd9931b | tcp-udp-clients/server.c | C | www.github.com/vladman-25/PCOM-HW/tree/main/tcp-udp-clients/server.c | https://raw.githubusercontent.com/vladman-25/PCOM-HW/fd9931b/tcp-udp-clients/server.c | vladman-25/PCOM-HW fd9931b tcp-udp-clients/server.c | true | 200 | 8,476 | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <netinet/tcp.h>
#include <limits.h>
#include "helper.h"
struct client *clients;
int max;
fd_set file_descr;
#define MAX_CLIENTS_NO 100
#d... | 4 |
amitdervadiya/3 | 21a1715 | revison-1/7.c | C | www.github.com/amitdervadiya/3/tree/main/revison-1/7.c | https://raw.githubusercontent.com/amitdervadiya/3/21a1715/revison-1/7.c | amitdervadiya/3 21a1715 revison-1/7.c | true | 200 | 691 | #include <stdio.h>
void concatStrings(char str1[], char str2[]) {
int i, j;
for (i = 0; str1[i] != '\0'; i++);
for (j = 0; str2[j] != '\0'; j++, i++) {
str1[i] = str2[j];
}
str1[i] = '\0';
}
int main() {
char str1[100], str2[100];
printf("Enter the first string: ");
fget... | 1 |
TusharMgl/DAA_LAB_CODE | cb70d7b | Class Problems/5.c | C | www.github.com/TusharMgl/DAA_LAB_CODE/tree/main/Class Problems/5.c | https://raw.githubusercontent.com/TusharMgl/DAA_LAB_CODE/cb70d7b/Class%20Problems/5.c | TusharMgl/DAA_LAB_CODE cb70d7b Class Problems/5.c | true | 200 | 532 | #include <stdio.h>
int Smallest_Missing(int arr[], int n) {
int low = 0, high = n - 1;
while (low <= high) {
int mid = (low + high) / 2;
if (arr[mid] == mid) {
low = mid + 1;
} else {
high = mid - 1;
}
}
return low;
}
int main() ... | 0 |
0Island0/C-Primer-Plus | 05200fd | 7-1.c | C | www.github.com/0Island0/C-Primer-Plus/tree/main/7-1.c | https://raw.githubusercontent.com/0Island0/C-Primer-Plus/05200fd/7-1.c | 0Island0/C-Primer-Plus 05200fd 7-1.c | true | 200 | 261 | #include<stdio.h>
int main()
{
int a, b, c;
char ch;
a = b = c = 0;
while ((ch = getchar()) != '#')
{
if (ch == ' ')
a++;
if (ch == '\n')
b++;
else
c++;
}
printf("%d���ո�%d�����з���%d�������ַ�", a, b, c);
return 0;
} | 2 |
Afeez23/alx-low_level_programming | 96db778 | 0x08-recursion/101-wildcmp.c | C | www.github.com/Afeez23/alx-low_level_programming/tree/main/0x08-recursion/101-wildcmp.c | https://raw.githubusercontent.com/Afeez23/alx-low_level_programming/96db778/0x08-recursion/101-wildcmp.c | Afeez23/alx-low_level_programming 96db778 0x08-recursion/101-wildcmp.c | true | 200 | 501 | #include "main.h"
/**
* wildcmp - Compare two strings allowing for wildcard char
*
* @s1: String being compared
*
* @s2: String being compared against
*
* Return: 1 if considered identical, 0 otherwise
*/
int wildcmp(char *s1, char *s2)
{
if (*s1 == '\0' && *s2 == '\0')
return (1);
if (*s1 == *s2)
return ... | 3 |
Jjlenton27/Pico-Project | 19ea585 | define.h | C | www.github.com/Jjlenton27/Pico-Project/tree/main/define.h | https://raw.githubusercontent.com/Jjlenton27/Pico-Project/19ea585/define.h | Jjlenton27/Pico-Project 19ea585 define.h | true | 200 | 481 | #include "pico/cyw43_arch.h"
#include "hardware/spi.h"
#define LED_PIN CYW43_WL_GPIO_LED_PIN
//#define SET_PIN(pinNum, state) cyw43_arch_gpio_put(pinNum, state);
#define BLINK(state) cyw43_arch_gpio_put(LED_PIN, state);
#define SPI_SPD 4000000 // Screen chip speed
//master (pico) TX -> MOSI wire -> slave RX
/... | 5 |
fh2010/powerchk | 8dc09b7 | board/driver/inc/drv_uart.h | C | www.github.com/fh2010/powerchk/tree/main/board/driver/inc/drv_uart.h | https://raw.githubusercontent.com/fh2010/powerchk/8dc09b7/board/driver/inc/drv_uart.h | fh2010/powerchk 8dc09b7 board/driver/inc/drv_uart.h | true | 200 | 9,264 | #ifndef __DRV_UART_H_
#define __DRV_UART_H_
#include "drv_config.h"
#include "drv_server.h"
#if defined(BSP_USING_UART1)
#ifndef UART1_CONFIG
#define UART1_CONFIG \
{ \
.name = "uart1", ... | 6 |
kd1318079/C | cec2347 | Pointer/ex061.c | C | www.github.com/kd1318079/C/tree/main/Pointer/ex061.c | https://raw.githubusercontent.com/kd1318079/C/cec2347/Pointer/ex061.c | kd1318079/C cec2347 Pointer/ex061.c | true | 200 | 240 | #include<stdio.h>
main()
{
char data[10] = "orange";
char* p_data;
char* p = "apple";
p_data = data;
printf("data[]=");
while (*p_data) {
putchar(*p_data++);
}
printf("\n*p = ");
while (*p) {
putchar(*p++);
}
putchar('\n');
} | 4 |
dan1122-ctrl/alx-low_level_programming | eccf42e | 0x05-pointers_arrays_strings/7-puts_half.c | C | www.github.com/dan1122-ctrl/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/7-puts_half.c | https://raw.githubusercontent.com/dan1122-ctrl/alx-low_level_programming/eccf42e/0x05-pointers_arrays_strings/7-puts_half.c | dan1122-ctrl/alx-low_level_programming eccf42e 0x05-pointers_arrays_strings/7-puts_half.c | true | 200 | 276 | #include "main.h"
/**
* puts_half - prints half of a string
* @str: strig
* Return: void
*/
void puts_half(char *str)
{
int ln = 0;
while (*str != '\0')
{
ln++;
str++;
}
str -= (ln / 2);
while (*str != '\0')
{
_putchar(*str);
str++;
}
_putchar('\n');
}
| 1 |
dsimwinga/alx-low_level_programming | 08a7515 | 0x12-singly_linked_lists/2-add_node.c | C | www.github.com/dsimwinga/alx-low_level_programming/tree/main/0x12-singly_linked_lists/2-add_node.c | https://raw.githubusercontent.com/dsimwinga/alx-low_level_programming/08a7515/0x12-singly_linked_lists/2-add_node.c | dsimwinga/alx-low_level_programming 08a7515 0x12-singly_linked_lists/2-add_node.c | true | 200 | 495 | #include "lists.h"
/**
*list_t *add_node - my main structure
*@head: head to the linked list
*@str: the address
*Return: a pointer
*/
list_t *add_node(list_t **head, const char *str)
{
list_t *newElement;
unsigned int i, count = 0;
newElement = malloc(sizeof(list_t));
if (newElement == NULL)
return (NULL... | 0 |
Dhruvin3103/AOA | a408223 | KMP.c | C | www.github.com/Dhruvin3103/AOA/tree/main/KMP.c | https://raw.githubusercontent.com/Dhruvin3103/AOA/a408223/KMP.c | Dhruvin3103/AOA a408223 KMP.c | true | 200 | 1,345 | #include<stdio.h>
#include<string.h>
int pie[100];
void prefix_fun(char p[])
{
int k=0;
pie[0]=0;
// printf("hi");
for(int i=1; i<strlen(p);i++)
{
// printf("\nk %d",k);
while(k>0 && p[k]!=p[i])
{
k=pie[k];
}
// printf("|%c %c- %d %d|",p[k],p[i],k,... | 3 |
xxjo99/Study | c6321a8 | CLanguage/Kruskal.c | C | www.github.com/xxjo99/Study/tree/main/CLanguage/Kruskal.c | https://raw.githubusercontent.com/xxjo99/Study/c6321a8/CLanguage/Kruskal.c | xxjo99/Study c6321a8 CLanguage/Kruskal.c | true | 200 | 2,915 | #include <stdio.h>
#define MAX_VERTICES 100
#define INF 1000
#define MAX_ELEMENT 100
#define TRUE 1
#define FALSE 0
char* strArr[5] = { "���", "����", "����", "��õ", "����" };
int parent[MAX_VERTICES];
int num[MAX_VERTICES];
typedef struct
{
int key;
int u;
int v;
} element;
typedef struct
{
elemen... | 5 |
abderrazakerrifaouy/abderrazak | a95a380 | main.c | C | www.github.com/abderrazakerrifaouy/abderrazak/tree/main/main.c | https://raw.githubusercontent.com/abderrazakerrifaouy/abderrazak/a95a380/main.c | abderrazakerrifaouy/abderrazak a95a380 main.c | true | 200 | 1,177 | #include <stdio.h>
#include <stdlib.h>
struct eleve{
char name[30];
int x ;
}abdo;
int main()
{
int w , i=0 , a=0 , y=20 , z=0 ;
printf(" enterz le nombre d'eleves ; ");
scanf("%d",&w);
struct eleve abdo[w] ;
for( i ; i < w ; i++){
printf(" Entrez le nom de l'eleve num�ro... | 4 |
adventuresin9/9front-A64 | 5401937 | clock.c | C | www.github.com/adventuresin9/9front-A64/tree/main/clock.c | https://raw.githubusercontent.com/adventuresin9/9front-A64/5401937/clock.c | adventuresin9/9front-A64 5401937 clock.c | true | 200 | 2,061 |
#include "u.h"
#include "../port/lib.h"
#include "mem.h"
#include "dat.h"
#include "fns.h"
#include "io.h"
#include "ureg.h"
#include "sysreg.h"
static uvlong freq;
enum {
Enable = 1<<0,
Imask = 1<<1,
Istatus = 1<<2,
};
void
clockshutdown(void)
{
}
static void
localclockintr(Ureg *ureg, void *)
{
timerintr(u... | 1 |
Abanob15/alx-low_level_programming | 4560cbd | 0x05-pointers_arrays_strings/6-puts2.c | C | www.github.com/Abanob15/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/6-puts2.c | https://raw.githubusercontent.com/Abanob15/alx-low_level_programming/4560cbd/0x05-pointers_arrays_strings/6-puts2.c | Abanob15/alx-low_level_programming 4560cbd 0x05-pointers_arrays_strings/6-puts2.c | true | 200 | 294 | #include "main.h"
/**
* puts2 - prints one char out of 2 of a string
* followed by a new line
*
* @str: string to print the chars from
*
* Return: void
*/
void puts2(char *str)
{
int i;
for (i = 0; str[i] != '\0'; ++i)
{
if (i % 2 == 0)
_putchar(str[i]);
}
_putchar('\n');
}
| 6 |
rogeriofrsouza/Fatec-ED | 11788d7 | pratica/4-listas/pLista3_cont.c | C | www.github.com/rogeriofrsouza/Fatec-ED/tree/main/pratica/4-listas/pLista3_cont.c | https://raw.githubusercontent.com/rogeriofrsouza/Fatec-ED/11788d7/pratica/4-listas/pLista3_cont.c | rogeriofrsouza/Fatec-ED 11788d7 pratica/4-listas/pLista3_cont.c | true | 200 | 1,713 | /*
Versão inicial do programa da lista linear de números implementada por CONTIGUIDADE.
Faz a exclusão de elementos da lista. Utiliza subrotina para impressão.
*/
#include <stdio.h>
#define MAXIMO 50
typedef int TItem;
void ImprimeLista(TItem *, char *, int);
int main(void)
{
int numero, final, cont;
TItem lis... | 0 |
Bobzycruiz/alx-low_level_programming | bf6776e | 0x01-variables_if_else_while/0-positive_or_negative.c | C | www.github.com/Bobzycruiz/alx-low_level_programming/tree/main/0x01-variables_if_else_while/0-positive_or_negative.c | https://raw.githubusercontent.com/Bobzycruiz/alx-low_level_programming/bf6776e/0x01-variables_if_else_while/0-positive_or_negative.c | Bobzycruiz/alx-low_level_programming bf6776e 0x01-variables_if_else_while/0-positive_or_negative.c | true | 200 | 520 | #include <stdlib.h>
#include <time.h>
#include <stdio.h>
/* betty style doc for function main goes there */
/**
* main - Entry point
*
* Return: Always 0 (Success)
*/
int main(void)
{
int n;
srand(time(0));
n = rand() - RAND_MAX / 2;
if (n > 0)
{
printf(... | 3 |
ChaseCake/alx-low_level_programming | cfa0e4c | 0x08-recursion/100-is_palindrome.c | C | www.github.com/ChaseCake/alx-low_level_programming/tree/main/0x08-recursion/100-is_palindrome.c | https://raw.githubusercontent.com/ChaseCake/alx-low_level_programming/cfa0e4c/0x08-recursion/100-is_palindrome.c | ChaseCake/alx-low_level_programming cfa0e4c 0x08-recursion/100-is_palindrome.c | true | 200 | 596 | #include "main.h"
/**
*_strlen_recursion - size
*@s: pointer to string params
*Return: recursion
*/
int _strlen_recursion(char *s)
{
if (!*s)
{
return (0);
}
return (1 + _strlen_recursion(++s));
}
/**
*p1 - palindrome
*@s: pointer to string
*@l: position
*Return: boolena
*/
int p1(char *s, int l)
{
... | 4 |
wappon28dev/prg1k | 1e1a467 | src/b1a/09/challenge1.c | C | www.github.com/wappon28dev/prg1k/tree/main/src/b1a/09/challenge1.c | https://raw.githubusercontent.com/wappon28dev/prg1k/1e1a467/src/b1a/09/challenge1.c | wappon28dev/prg1k 1e1a467 src/b1a/09/challenge1.c | true | 200 | 2,501 | #include <stdio.h>
#include <stdbool.h>
#include <stdlib.h>
#define LENGTH 1000
/*
equation? 100 + 200 - 300
| [ 0]: 1 preNum: 0 result: 0 needAddOnNext: 1
| [ 1]: 0 preNum: 1 result: 0 needAddOnNext: 1
| [ 2]: 0 preNum: 10 result: 0 needAddOnNext: 1
| [ 3]: preNum: 100 re... | 5 |
Rintu341/A-Job-Ready-Bootcamp-in-C-CPP | 3831f98 | CAssignment/Assignment16/problem10.c | C | www.github.com/Rintu341/A-Job-Ready-Bootcamp-in-C-CPP/tree/main/CAssignment/Assignment16/problem10.c | https://raw.githubusercontent.com/Rintu341/A-Job-Ready-Bootcamp-in-C-CPP/3831f98/CAssignment/Assignment16/problem10.c | Rintu341/A-Job-Ready-Bootcamp-in-C-CPP 3831f98 CAssignment/Assignment16/problem10.c | true | 200 | 942 | // Write a program in C to find the row with maximum number of 1s.
#include <stdio.h>
#include <conio.h>
const int column;
const int Row;
void input(int a[][column]);
int Maximum_1s(int a[][column]);
int main()
{
printf("Enter a length of Row and column: ");
scanf("%d %d", &Row, &column);
int a[Row][column]... | 1 |
abdorabie905tag/Robotic_Car | f4f635d | MultipleTasksCar_Prg.c | C | www.github.com/abdorabie905tag/Robotic_Car/tree/main/MultipleTasksCar_Prg.c | https://raw.githubusercontent.com/abdorabie905tag/Robotic_Car/f4f635d/MultipleTasksCar_Prg.c | abdorabie905tag/Robotic_Car f4f635d MultipleTasksCar_Prg.c | true | 200 | 12,922 | /*
* MultipleTasksCar_Prg.c
*
* Created on: 18/12/2022
* Author: ENG/Shehab aldeen
*/
/* Libraries */
/******************/
/* Lower Layer Interface Files*/
/* no needed */
/* Own Driver Files*/
#include "MultipleTasksCar_Private.h"
/*
Name : MultipleTasksCar_VidInit... | 6 |
Eyab0/University | e6bc6c6 | ENCS4330 - Real-time Applications and Embedded Systems/RTP3/parent.c | C | www.github.com/Eyab0/University/tree/main/ENCS4330 - Real-time Applications and Embedded Systems/RTP3/parent.c | https://raw.githubusercontent.com/Eyab0/University/e6bc6c6/ENCS4330%20-%20Real-time%20Applications%20and%20Embedded%20Systems/RTP3/parent.c | Eyab0/University e6bc6c6 ENCS4330 - Real-time Applications and Embedded Systems/RTP3/parent.c | true | 200 | 27,978 | #include "local.h"
//------------------------------------------------Global variables-------------------------------------------------------------//
int NUM_OF_ANTS, NUM_OF_FOODS;
int MIN_SPEED, MAX_SPEED;
int FOOD_TIMER, FOOD_SMELL_DISTANCE;
int PHEROMONE_SMELL_DISTANCE_THRESHOLD;
float FOOD_PORTION;
int SI... | 3 |
drone911/A536US_BP_skeleton | e6c883e | PSS/MFRVAR/T1/PSSVar/LTESpecific/IMS_CC/code/src/IMS_CC_IpIntfManagement.c | C | www.github.com/drone911/A536US_BP_skeleton/tree/main/PSS/MFRVAR/T1/PSSVar/LTESpecific/IMS_CC/code/src/IMS_CC_IpIntfManagement.c | https://raw.githubusercontent.com/drone911/A536US_BP_skeleton/e6c883e/PSS/MFRVAR/T1/PSSVar/LTESpecific/IMS_CC/code/src/IMS_CC_IpIntfManagement.c | drone911/A536US_BP_skeleton e6c883e PSS/MFRVAR/T1/PSSVar/LTESpecific/IMS_CC/code/src/IMS_CC_IpIntfManagement.c | true | 200 | 2,208 | Error allocating memory to TCP/Ip structure
IP Interface creation for IPv4 address : 0x%x
IP Interface creation for IPv6 address
- ImsPdnIpVer IPV4V6 not supported currently
- ImsPdnIpVer Invalid or not supported currently
Error allocating memory to TcpIp_Start_msg
Error allocating memory to LteTcpIp_Msg_t
IPsendStartI... | 4 |
Yuqn/data-structure | a897a20 | 斐波那契数/斐波那契数/main.c | C | www.github.com/Yuqn/data-structure/tree/main/斐波那契数/斐波那契数/main.c | https://raw.githubusercontent.com/Yuqn/data-structure/a897a20/%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0/%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0/main.c | Yuqn/data-structure a897a20 斐波那契数/斐波那契数/main.c | true | 200 | 747 | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
// ����쳲�������
int get_fbnqs(int n) {
int a = 1;
int b = 1;
int c = 1;
while (n > 2) {
c = a + b;
a = b;
b = c;
n--;
}
return c;
}
int main() {
char arr[] = "abcde";
char arr2[] = {'a','b','c','d','e'};
//int i = 50;
//int num1 = 0;
//int sc... | 5 |
raphael-coeffic/Ex2 | c858158 | my_graph.c | C | www.github.com/raphael-coeffic/Ex2/tree/main/my_graph.c | https://raw.githubusercontent.com/raphael-coeffic/Ex2/c858158/my_graph.c | raphael-coeffic/Ex2 c858158 my_graph.c | true | 200 | 741 | #include <stdio.h>
#include <stdlib.h>
#include "my_mat.h"
int main() {
while (1) {
char func_choice = 0;
int i, j;
scanf(" %c", &func_choice);
switch (func_choice) {
case 'A': // first function
functionA_init();
break;
... | 0 |
kawakubo2/myc | 45de3a6 | bohyoh/nyumon_yasumatsu/chapter04/list0401.c | C | www.github.com/kawakubo2/myc/tree/main/bohyoh/nyumon_yasumatsu/chapter04/list0401.c | https://raw.githubusercontent.com/kawakubo2/myc/45de3a6/bohyoh/nyumon_yasumatsu/chapter04/list0401.c | kawakubo2/myc 45de3a6 bohyoh/nyumon_yasumatsu/chapter04/list0401.c | true | 200 | 353 | #include <stdio.h>
int main(void)
{
int retry;
do {
int no;
printf("整数値を入力してください: ");
scanf("%d", &no);
if (no % 2)
puts("その数は奇数です。");
else
puts("その数は偶数です。");
printf("もう一度？ [yes…0／no…9] : ");
scanf("%d", &retry);
} while (retry == 0);
return 0;
}
| 1 |
gonutech/STM32F103C8_LEDMATX | bae5df8 | UserDev/HwLib/LedMat/MAX7219.c | C | www.github.com/gonutech/STM32F103C8_LEDMATX/tree/main/UserDev/HwLib/LedMat/MAX7219.c | https://raw.githubusercontent.com/gonutech/STM32F103C8_LEDMATX/bae5df8/UserDev/HwLib/LedMat/MAX7219.c | gonutech/STM32F103C8_LEDMATX bae5df8 UserDev/HwLib/LedMat/MAX7219.c | true | 200 | 8,297 | /*
* MAX7219.c
*
* Created on: 16 Jan 2023
* Author: EDISON NGUNJIRI
*/
#include "MAX7219.h"
#include "UartDebug.h"
#define CHAR_MAX 38
uint8_t decode[2];
uint8_t data[2];
uint8_t shutdown[2];
uint8_t i=0;
uint8_t ON=0xFF;
uint8_t OFF=0x00;
const uint8_t InitCommands[10][2]={
{0x09,0x00}, // Set no d... | 6 |
TaherML1/Terminal-Based-File-Manager | b47089d | systemProgrammingProject/permissions.c | C | www.github.com/TaherML1/Terminal-Based-File-Manager/tree/main/systemProgrammingProject/permissions.c | https://raw.githubusercontent.com/TaherML1/Terminal-Based-File-Manager/b47089d/systemProgrammingProject/permissions.c | TaherML1/Terminal-Based-File-Manager b47089d systemProgrammingProject/permissions.c | true | 200 | 344 | #include <stdio.h>
#include <stdlib.h>
#include <sys/stat.h>
#include "logger.h"
#include <fcntl.h>
void change_permissions(const char *path, mode_t mode) {
if (chmod(path, mode) == -1) {
perror("chmod");
log_error("Failed to change permissions");
} else {
log_info("Permissions changed ... | 3 |
SADDDD98/alx-low_level_programming | b05d924 | 0x04-more_functions_nested_loops/10-print_triangle.c | C | www.github.com/SADDDD98/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/10-print_triangle.c | https://raw.githubusercontent.com/SADDDD98/alx-low_level_programming/b05d924/0x04-more_functions_nested_loops/10-print_triangle.c | SADDDD98/alx-low_level_programming b05d924 0x04-more_functions_nested_loops/10-print_triangle.c | true | 200 | 426 | #include "main.h"
/**
* print_triangle - Prints a triangle of squares according parameter
* @s: The size of the squares triangle
*
* Return: empty
*/
void print_triangle(int s)
{
int i, j, k;
if (s <= 0)
{
_putchar('\n');
}
else
{
for (i = 0; i < s; i++)
{
for (j = s - i; j > 1; j--)
{
... | 4 |
pbrucla/SecureOS | 097130a | source/kernel/memory.c | C | www.github.com/pbrucla/SecureOS/tree/main/source/kernel/memory.c | https://raw.githubusercontent.com/pbrucla/SecureOS/097130a/source/kernel/memory.c | pbrucla/SecureOS 097130a source/kernel/memory.c | true | 200 | 8,396 | #include "memory.h"
#include "terminal_driver.h"
#include "io.h"
#include <stdint.h>
uint32_t l2_page_table[1024] __attribute__((aligned(4096)));
// dedicate the 4 MiB at 0x400000-0x800000 for page tables, everything after
// that can be used for memory
uint32_t next_page = 0x800000;
uint32_t page_freelist_head = 0;
... | 0 |
Flammrock/rover | 06bbd4a | src/core/rover.c | C | www.github.com/Flammrock/rover/tree/main/src/core/rover.c | https://raw.githubusercontent.com/Flammrock/rover/06bbd4a/src/core/rover.c | Flammrock/rover 06bbd4a src/core/rover.c | true | 200 | 3,188 | #include <core/rover.h>
Rover RoverBuild() {
Rover rover = {0};
rover.width = 0.8f;
rover.height = 2.4f;
return rover;
}
void RoverPlace(Rover *rover, int x, int y, int angle) {
rover->origin = Vec2Make(x, y);
rover->origin_angle = angle;
rover->position = Vec2Make(x, y);
rover->angle = angle;
}
void RoverRe... | 5 |
001sarvesh/RPS-game | 7bc79f5 | RPS.c | C | www.github.com/001sarvesh/RPS-game/tree/main/RPS.c | https://raw.githubusercontent.com/001sarvesh/RPS-game/7bc79f5/RPS.c | 001sarvesh/RPS-game 7bc79f5 RPS.c | true | 200 | 1,680 | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <stdbool.h>
#define ROCK 1
#define PAPER 2
#define SCISSORS 3
int main()
{
srand(time(NULL));
int player_throw = 0;
int ai_throw = 0;
bool draw = false;
do
{
printf("Select your throw. \n");
... | 1 |
kingmulla79/alx-low_level_programming | dd15990 | 0x05-pointers_arrays_strings/5-rev_string.c | C | www.github.com/kingmulla79/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/5-rev_string.c | https://raw.githubusercontent.com/kingmulla79/alx-low_level_programming/dd15990/0x05-pointers_arrays_strings/5-rev_string.c | kingmulla79/alx-low_level_programming dd15990 0x05-pointers_arrays_strings/5-rev_string.c | true | 200 | 325 | #include "main.h"
/**
* rev_string - a function that reverse a string
*
* followed by a new line.
*
* @s: an input string
*
* Return: Nothing
*/
void rev_string(char *s)
{
int len = 0, i = 0;
char aux;
while (s[len] != '\0')
len++;
while (i < len--)
{
aux = s[i];
s[i++] = s[len];
s[len] = aux;
... | 6 |
Zohaifa/Beecrowd | 635fb03 | 1241.c | C | www.github.com/Zohaifa/Beecrowd/tree/main/1241.c | https://raw.githubusercontent.com/Zohaifa/Beecrowd/635fb03/1241.c | Zohaifa/Beecrowd 635fb03 1241.c | true | 200 | 549 | #include <stdio.h>
#include <string.h>
int main(){
char a[1010], b[1010], c[1010];
int t, i, j, k;
scanf("%d", &t);
for(i = 0; i<t; i++){
scanf(" %s %s", a, b);
int la = strlen(a);
int lb = strlen(b);
for(j =(la-lb), k=0; j<la; j++, k++){
... | 3 |
Azees06/SMART-GRADUATE-AZEES | d25f350 | Untitled58.c | C | www.github.com/Azees06/SMART-GRADUATE-AZEES/tree/main/Untitled58.c | https://raw.githubusercontent.com/Azees06/SMART-GRADUATE-AZEES/d25f350/Untitled58.c | Azees06/SMART-GRADUATE-AZEES d25f350 Untitled58.c | true | 200 | 364 | #include <math.h>
#include <stdio.h>
int main() {
double base, exp, result;
printf("Enter a base number: ");
scanf("%lf", &base);
printf("Enter an exponent: ");
scanf("%lf", &exp);
// calculates the power
result = pow(base, exp);
printf("%.1lf^%.1lf = %.2lf",... | 4 |
EngrMatin/C_Programming | 3292209 | Programs/Exam 04/9.c | C | www.github.com/EngrMatin/C_Programming/tree/main/Programs/Exam 04/9.c | https://raw.githubusercontent.com/EngrMatin/C_Programming/3292209/Programs/Exam%2004/9.c | EngrMatin/C_Programming 3292209 Programs/Exam 04/9.c | true | 200 | 465 | #include <stdio.h>
void RevArray(int n, int array[]);
int main()
{
int n;
scanf("%d", &n);
int a[n];
for(int i=0; i<n; i++)
{
scanf("%d", &a[i]);
}
RevArray(&n, a);
return 0;
}
void RevArray(int n, int array[])
{
for(int i=0, j=n-1; i<j; i++, j--)
{
int temp... | 5 |
kauschie/3600 | ec8d47b | 4/shm_io.c | C | www.github.com/kauschie/3600/tree/main/4/shm_io.c | https://raw.githubusercontent.com/kauschie/3600/ec8d47b/4/shm_io.c | kauschie/3600 ec8d47b 4/shm_io.c | true | 200 | 1,638 | /* shm_io.c
*
* Demonstate writing and reading from SysV IPC shared memory
*/
#include <sys/types.h>
#include <sys/ipc.h>
#include <sys/shm.h>
#include <unistd.h>
#include <sys/wait.h>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#define SIZE 256
int main(void) {
int shmid;
ch... | 0 |
MohamedElsaeed424/Processor-design | 8ee9f08 | Memory/DataMemory.h | C | www.github.com/MohamedElsaeed424/Processor-design/tree/main/Memory/DataMemory.h | https://raw.githubusercontent.com/MohamedElsaeed424/Processor-design/8ee9f08/Memory/DataMemory.h | MohamedElsaeed424/Processor-design 8ee9f08 Memory/DataMemory.h | true | 200 | 1,534 | #ifndef PROCESSOR_DESIGN_DATAMEMORY_H
#define PROCESSOR_DESIGN_DATAMEMORY_H
#include <stdio.h>
#include <stdint.h>
//#define WORD_SIZE 8
#define DATA_MEM_SIZE 2024
//typedef struct {
// uint8_t size ;
//}Word;
// Array of words
typedef struct {
uint8_t Dmemory[DATA_MEM_SIZE];
}DataMemory;
/**
* Initializing... | 6 |
tc-portal/WFI32-IoT-002 | 614f3a9 | firmware/src/app_pic32mz_w1.h | C | www.github.com/tc-portal/WFI32-IoT-002/tree/main/firmware/src/app_pic32mz_w1.h | https://raw.githubusercontent.com/tc-portal/WFI32-IoT-002/614f3a9/firmware/src/app_pic32mz_w1.h | tc-portal/WFI32-IoT-002 614f3a9 firmware/src/app_pic32mz_w1.h | true | 200 | 7,634 | /*******************************************************************************
MPLAB Harmony Application Header File
Company:
Microchip Technology Inc.
File Name:
app_pic32mz_w1.h
Summary:
This header file provides prototypes and definitions for the application.
Description:
This header ... | 3 |
sofiarecreio/Listas-de-Prog-ll | 72ef2a1 | codigos-fonte/lista3/exercicio5.c | C | www.github.com/sofiarecreio/Listas-de-Prog-ll/tree/main/codigos-fonte/lista3/exercicio5.c | https://raw.githubusercontent.com/sofiarecreio/Listas-de-Prog-ll/72ef2a1/codigos-fonte/lista3/exercicio5.c | sofiarecreio/Listas-de-Prog-ll 72ef2a1 codigos-fonte/lista3/exercicio5.c | true | 200 | 581 | #include <stdio.h>
float max_vet(int n, float * vet);
int main() {
int n, i;
printf("Insira o tamanho do vetor: ");
scanf("%d", &n);
float vet[n], maior;
for (i = 0; i < n; i++) {
printf("Insira o valor %d: ", i);
scanf("%f", &vet[i]);
}
maior = max_vet(n, vet);
pr... | 1 |
321aspatil/ARM-LPC2148-Microcontroller-interfacing-and-Programming | ff13e6e | TestProject2/prog2.c | C | www.github.com/321aspatil/ARM-LPC2148-Microcontroller-interfacing-and-Programming/tree/main/TestProject2/prog2.c | https://raw.githubusercontent.com/321aspatil/ARM-LPC2148-Microcontroller-interfacing-and-Programming/ff13e6e/TestProject2/prog2.c | 321aspatil/ARM-LPC2148-Microcontroller-interfacing-and-Programming ff13e6e TestProject2/prog2.c | true | 200 | 320 | //write an embeddded c program to flash led connected at P0.4 using software delay use IOSET register,IOCLR register and left shift operator
#include <LPC213X.H>
int main()
{
unsigned int i;
IODIR0=(1<<4);
while(1)
{
IOSET0=(1<<4);
for(i=0;i<20000;i++);
IOCLR0=(1<<4);
for(i=0;i<20000;i++);
}
return 0;
}
| 4 |
Pkal99/alx-low_level_programming | d7ff1d1 | 0x01-variables_if_else_while/7-print_tebahpla.c | C | www.github.com/Pkal99/alx-low_level_programming/tree/main/0x01-variables_if_else_while/7-print_tebahpla.c | https://raw.githubusercontent.com/Pkal99/alx-low_level_programming/d7ff1d1/0x01-variables_if_else_while/7-print_tebahpla.c | Pkal99/alx-low_level_programming d7ff1d1 0x01-variables_if_else_while/7-print_tebahpla.c | true | 200 | 234 | #include <stdio.h>
/**
* main - main block function
* Description: alphabet in reverse order in lowercase.
* Return: 0
*/
int main(void)
{
char c;
for (c = 'z'; c >= 'a'; c--)
{
putchar(c);
}
putchar('\n');
return (0);
}
| 0 |
NaderSameh/CI-HIL-test | ab59d80 | cylock/src/bg95.h | C | www.github.com/NaderSameh/CI-HIL-test/tree/main/cylock/src/bg95.h | https://raw.githubusercontent.com/NaderSameh/CI-HIL-test/ab59d80/cylock/src/bg95.h | NaderSameh/CI-HIL-test ab59d80 cylock/src/bg95.h | true | 200 | 3,797 | #ifndef BG95_H
#define BG95_H
#include "StateMachines_Config.h"
#define _USE_MQTT_
#define GPS_PDP "AT+CGDCONT=1,\"IP\",\"public.pccwglobal.hktdcp\""
#define GPS_POS_TOKEN "AT+QLBSCFG=\"token\",\"41q7p1007W1861f5\""
#define GPS_MQTT_QMTOPEN "AT+QMTOPEN=0,\"104.218.120.206\",8443"
#define BG95_PDP "AT+CGDCONT=1,\"IP\... | 5 |
b64-Sm9yZGFuIExBSVJFUw/B_FIGHT | 4e4511f | Game.c | C | www.github.com/b64-Sm9yZGFuIExBSVJFUw/B_FIGHT/tree/main/Game.c | https://raw.githubusercontent.com/b64-Sm9yZGFuIExBSVJFUw/B_FIGHT/4e4511f/Game.c | b64-Sm9yZGFuIExBSVJFUw/B_FIGHT 4e4511f Game.c | true | 200 | 687 | ///FICHIER PRINCIPAL DU JEU POSSEDANT TOUTES LES GRANDES FONCTIONS
#include <stdio.h>
#include "graphics.h"
SDL_AudioSpec desired, obtained, soundfile;
SDL_AudioCVT cvt;
Uint32 soundlength; //Taille du fichier du son charg� (Octets)
Uint32 soundpos; //Position courante de lecture dans le fichier son
Uint8 * sounddata... | 6 |
x64-exploit0r/HellokittyRansomwareLeakedSourceCode | 5d2a8c8 | NTRUEncrypt/src/ntru_crypto_ntru_poly.c | C | www.github.com/x64-exploit0r/HellokittyRansomwareLeakedSourceCode/tree/main/NTRUEncrypt/src/ntru_crypto_ntru_poly.c | https://raw.githubusercontent.com/x64-exploit0r/HellokittyRansomwareLeakedSourceCode/5d2a8c8/NTRUEncrypt/src/ntru_crypto_ntru_poly.c | x64-exploit0r/HellokittyRansomwareLeakedSourceCode 5d2a8c8 NTRUEncrypt/src/ntru_crypto_ntru_poly.c | true | 200 | 17,566 | /******************************************************************************
* NTRU Cryptography Reference Source Code
*
* Copyright (C) 2009-2016 Security Innovation (SI)
*
* SI has dedicated the work to the public domain by waiving all of its rights
* to the work worldwide under copyright law, includi... | 3 |
chucktilbury/cmdline | 0cc647f | temp.c | C | www.github.com/chucktilbury/cmdline/tree/main/temp.c | https://raw.githubusercontent.com/chucktilbury/cmdline/0cc647f/temp.c | chucktilbury/cmdline 0cc647f temp.c | true | 200 | 1,792 | /**
* @file temp.c
*
* @brief This is the example program from the getopt_long(3) man page.
*
*/
#include <getopt.h>
#include <stdio.h> /* for printf */
#include <stdlib.h> /* for exit */
int main(int argc, char *argv[]) {
int c;
int digit_optind = 0;
while (1) {
int this_option_optind = optind ? o... | 4 |
SergioRodriguez262002/2022-2023-Projects | 505ced5 | lec1.c | C | www.github.com/SergioRodriguez262002/2022-2023-Projects/tree/main/lec1.c | https://raw.githubusercontent.com/SergioRodriguez262002/2022-2023-Projects/505ced5/lec1.c | SergioRodriguez262002/2022-2023-Projects 505ced5 lec1.c | true | 200 | 1,347 | #include <stdio.h> // printf
struct coord {
int x;
int y;
int z;
}; // watch out for crazy ;
int doubleIt(int a); // function prototype
void swap(int* a, int* b) {
int temp = *a;
*a = *b;
*b = temp;
// printf("%d %d\n", a, b);
}
void foo(int* theArray) {
theArray[3] = 3;
}
int main() {
struct coor... | 1 |
igordzierwa/operating-systems-labs | 3ae5634 | laboratory_1/zad1/recc.c | C | www.github.com/igordzierwa/operating-systems-labs/tree/main/laboratory_1/zad1/recc.c | https://raw.githubusercontent.com/igordzierwa/operating-systems-labs/3ae5634/laboratory_1/zad1/recc.c | igordzierwa/operating-systems-labs 3ae5634 laboratory_1/zad1/recc.c | true | 200 | 562 | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define BILLION 1000000000.0
int fibo(volatile int n) {
if (n == 0) {
return 0;
}
if (n == 1) {
return n;
}
return fibo(n - 2) + fibo(n - 1);
}
int main () {
struct timespec start, end;
double final_time;
int score;
clock... | 0 |
Elijah-Raffel/Engraver_256 | cddd5eb | code/Lazer_Engraver_Preset_2/Lazer Engraver/Port_Init.c | C | www.github.com/Elijah-Raffel/Engraver_256/tree/main/code/Lazer_Engraver_Preset_2/Lazer Engraver/Port_Init.c | https://raw.githubusercontent.com/Elijah-Raffel/Engraver_256/cddd5eb/code/Lazer_Engraver_Preset_2/Lazer%20Engraver/Port_Init.c | Elijah-Raffel/Engraver_256 cddd5eb code/Lazer_Engraver_Preset_2/Lazer Engraver/Port_Init.c | true | 200 | 1,262 | #include "tm4c123gh6pm.h"
#include <stdint.h>
void Init_Ports(void); // port initialization file
void Init_Ports(void){
volatile unsigned long delay;
SYSCTL_RCGCGPIO_R |= 0x07; //Port A,B and C Clock Init; Want to use PB0&3 and PC4-7 as outputs
//PP0&3 will drive directional input on motor driver board
//This wil... | 5 |
Scaarif/alx-low_level_programming | b6dfcd6 | 0x17-doubly_linked_lists/8-delete_dnodeint.c | C | www.github.com/Scaarif/alx-low_level_programming/tree/main/0x17-doubly_linked_lists/8-delete_dnodeint.c | https://raw.githubusercontent.com/Scaarif/alx-low_level_programming/b6dfcd6/0x17-doubly_linked_lists/8-delete_dnodeint.c | Scaarif/alx-low_level_programming b6dfcd6 0x17-doubly_linked_lists/8-delete_dnodeint.c | true | 200 | 844 | #include "lists.h"
/**
* delete_dnodeint_at_index - deletes the nth node of a linked list
* @head: double pointer to the head of list
* @index: the nth index(starting at 0)
* Return: 1 if success and -1 otherwise
*/
int delete_dnodeint_at_index(dlistint_t **head, unsigned int index)
{
unsigned int len = 0;
dlis... | 6 |
Akashgund13/ApplicationPrograms | 8105e64 | C _Programming/Program14.c | C | www.github.com/Akashgund13/ApplicationPrograms/tree/main/C _Programming/Program14.c | https://raw.githubusercontent.com/Akashgund13/ApplicationPrograms/8105e64/C%20_Programming/Program14.c | Akashgund13/ApplicationPrograms 8105e64 C _Programming/Program14.c | true | 200 | 418 | #include<stdio.h>
void Display(int iNo)
{
int iCnt = 0;
if(iNo < 0) // Updator
{
iNo = -iNo;
}
for(iCnt = 1; iCnt <= iNo; iCnt++)
{
printf("Jay Ganesh...\n");
}
}
int main()
{
int iValue = 0;
printf("Please enter the frequency of Jay Gan... | 3 |
atjjnnn/Online_Judge_LTP1 | 31df004 | ITP1_6_A/reversing_numbers.c | C | www.github.com/atjjnnn/Online_Judge_LTP1/tree/main/ITP1_6_A/reversing_numbers.c | https://raw.githubusercontent.com/atjjnnn/Online_Judge_LTP1/31df004/ITP1_6_A/reversing_numbers.c | atjjnnn/Online_Judge_LTP1 31df004 ITP1_6_A/reversing_numbers.c | true | 200 | 403 | #include <stdio.h>
int main(void)
{
int num;
int i;
scanf("%d", &num);
int array[num];
for (i=0; i<num; i++) {
fflush(stdin);
scanf("%d", &array[i]);
}
for (i = (i-1); i>=0; i--) {
printf("%d", array[i]);
... | 1 |
Oreva-Raphael/alx-low_level_programming | 88987ce | 0x05-pointers_arrays_strings/1-swap.c | C | www.github.com/Oreva-Raphael/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/1-swap.c | https://raw.githubusercontent.com/Oreva-Raphael/alx-low_level_programming/88987ce/0x05-pointers_arrays_strings/1-swap.c | Oreva-Raphael/alx-low_level_programming 88987ce 0x05-pointers_arrays_strings/1-swap.c | true | 200 | 187 | #include "main.h"
/**
* swap_int - Changing the address of two variables
*
* @a: input one
* @b: input two
*/
void swap_int(int *a, int *b)
{
int y;
y = *a;
*a = *b;
*b = y;
}
| 4 |
ROBIN-MIAH1/C-PROGRAMS | a19bb2a | 9) EVEN_ODD.C | C | www.github.com/ROBIN-MIAH1/C-PROGRAMS/tree/main/9) EVEN_ODD.C | https://raw.githubusercontent.com/ROBIN-MIAH1/C-PROGRAMS/a19bb2a/9%29%20EVEN_ODD.C | ROBIN-MIAH1/C-PROGRAMS a19bb2a 9) EVEN_ODD.C | true | 200 | 313 | #include<stdio.h>
int main()
{
int n;
printf("ENTER A NUMBER TO CHECK WHETHER IT'S EVEN OR ODD: ");
scanf("%d", &n);
if(n % 2 == 0)
{
printf("%d IS A EVEN NUMBER\n\n", n);
}
else
{
printf("%d IS A ODD NUMBER\n\n", n);
}
return 0;
}
| 7 |
Mohamed-Hamdy-MA/Mastering_Embedded_System | 037dc69 | Unit_2_C_Programming/Lesson_8_Pointers/Ex5_Pointer_To_Array_Of_Structers/Ex5_Pointer_To_Array_Of_Structers.c | C | www.github.com/Mohamed-Hamdy-MA/Mastering_Embedded_System/tree/main/Unit_2_C_Programming/Lesson_8_Pointers/Ex5_Pointer_To_Array_Of_Structers/Ex5_Pointer_To_Array_Of_Structers.c | https://raw.githubusercontent.com/Mohamed-Hamdy-MA/Mastering_Embedded_System/037dc69/Unit_2_C_Programming/Lesson_8_Pointers/Ex5_Pointer_To_Array_Of_Structers/Ex5_Pointer_To_Array_Of_Structers.c | Mohamed-Hamdy-MA/Mastering_Embedded_System 037dc69 Unit_2_C_Programming/Lesson_8_Pointers/Ex5_Pointer_To_Array_Of_Structers/Ex5_Pointer_To_Array_Of_Structers.c | true | 200 | 679 | /*
============================================================================
Name : Ex5_Pointer_To_Array_Of_Structers.c
Author : Mohamed Hamdy
Version :
Copyright :
Description : Hello World in C, Ansi-style
============================================================================
*/
#... | 5 |
Emyjakarta/alx-low_level_programming | 51cf4c9 | 0x02-functions_nested_loops/11-print_to_98.c | C | www.github.com/Emyjakarta/alx-low_level_programming/tree/main/0x02-functions_nested_loops/11-print_to_98.c | https://raw.githubusercontent.com/Emyjakarta/alx-low_level_programming/51cf4c9/0x02-functions_nested_loops/11-print_to_98.c | Emyjakarta/alx-low_level_programming 51cf4c9 0x02-functions_nested_loops/11-print_to_98.c | true | 200 | 596 | #include "main.h"
#include <stdio.h>
/**
* print_to_98-a function that prints all
* natural numbers from n to 98, followed by a new line.
* Numbers must be separated by a comma, followed by a space
* Numbers should be printed in order
* The first printed number should be the number passed to your function
* The l... | 0 |
RDobrinov/cbus | 987fd35 | components/cbus_i2c_driver/include/cbus_i2c_driver.h | C | www.github.com/RDobrinov/cbus/tree/main/components/cbus_i2c_driver/include/cbus_i2c_driver.h | https://raw.githubusercontent.com/RDobrinov/cbus/987fd35/components/cbus_i2c_driver/include/cbus_i2c_driver.h | RDobrinov/cbus 987fd35 components/cbus_i2c_driver/include/cbus_i2c_driver.h | true | 200 | 394 | #ifndef _CBUS_I2C_DRIVER_H
#define _CBUS_I2C_DRIVER_H
#include <inttypes.h>
#include "idf_gpio_driver.h"
#include "driver/i2c_master.h"
#include "../i2c_private.h"
#include "cbus_driver.h"
#ifdef __cplusplus
extern "C" {
#endif
void *i2cbus_get_bus(void);
//cbus_driver_t *i2cbus_get_bus(void);
void i2cbus_dump_dev... | 6 |
arundada9000/Code-Olympiad-2080 | 2efefbd | BCO Code/08_Program.c | C | www.github.com/arundada9000/Code-Olympiad-2080/tree/main/BCO Code/08_Program.c | https://raw.githubusercontent.com/arundada9000/Code-Olympiad-2080/2efefbd/BCO%20Code/08_Program.c | arundada9000/Code-Olympiad-2080 2efefbd BCO Code/08_Program.c | true | 200 | 190 | #include <stdio.h>
int main()
{
int x;
x = 10;
if(x > 10)
x -= 10;
else if(x >= 0)
x += 00;
else if(x)
x += 10;
else
x -= 10;
printf("%d\n",x);
return 0;
}
//Output: 10 | 7 |
devi1262005/Data-structures | 2f0cc2d | binarytree.c | C | www.github.com/devi1262005/Data-structures/tree/main/binarytree.c | https://raw.githubusercontent.com/devi1262005/Data-structures/2f0cc2d/binarytree.c | devi1262005/Data-structures 2f0cc2d binarytree.c | true | 200 | 1,455 | #include <stdio.h>
#include <stdlib.h>
// Structure for a node in the Binary Search Tree
struct Node {
int data;
struct Node* left;
struct Node* right;
};
// Function to create a new node with a given key
struct Node* newNode(int key) {
struct Node* node = (struct Node*)malloc(sizeof(struct Node));
... | 4 |
Elouatassi/alx-low_level_programming | 35461fe | 0x01-variables_if_else_while/100-print_comb3.c | C | www.github.com/Elouatassi/alx-low_level_programming/tree/main/0x01-variables_if_else_while/100-print_comb3.c | https://raw.githubusercontent.com/Elouatassi/alx-low_level_programming/35461fe/0x01-variables_if_else_while/100-print_comb3.c | Elouatassi/alx-low_level_programming 35461fe 0x01-variables_if_else_while/100-print_comb3.c | true | 200 | 405 | #include <stdio.h>
/**
* main -Entry point
*
* Description: prints all possible different combinations of two digits
*
* Return: Always 0 (Success)
*/
int main(void)
{
int a, b;
for (a = '0'; a < '9'; a++)
{
for (b = a + 1; b <= '9'; b++)
{
if (a != b)
{
putchar(a);
putchar(b);
if (a == '8' && b == '... | 3 |
ChongChi-hub/Session-7-C | 37c813f | Session 7 BT4.c | C | www.github.com/ChongChi-hub/Session-7-C/tree/main/Session 7 BT4.c | https://raw.githubusercontent.com/ChongChi-hub/Session-7-C/37c813f/Session%207%20BT4.c | ChongChi-hub/Session-7-C 37c813f Session 7 BT4.c | true | 200 | 387 | #include <stdio.h>
int main()
{
int n;
printf("Nhap so phan tu cua mang: ");
scanf("%d", &n);
int array[n];
for(int i = 0; i < n; i++){
printf("Nhap phan tu thu %d: ",i + 1 );
scanf("%d", &array[i]);
}
printf("Cac phan tu co trong mang la: ");
for(int i = 0; i ... | 5 |
Carolina0110/Gerador-de-media | a4bb182 | main.c | C | www.github.com/Carolina0110/Gerador-de-media/tree/main/main.c | https://raw.githubusercontent.com/Carolina0110/Gerador-de-media/a4bb182/main.c | Carolina0110/Gerador-de-media a4bb182 main.c | true | 200 | 648 | #include <stdio.h>
#include <locale.h>
float entradadedados()
{
float nota;
do {
printf("Digite a nota do aluno(a):\n");
scanf("%f",¬a);
if (nota<0 || nota>10)
{
printf("Digite somente notas maiores ou iguais a zero e menores que 10!\n");
}
}
while (nota<0 || nota>10);
return... | 0 |
chabhadiyadhrupal/Dhrupal_26_july_2022_C | 6436793 | task/addi.. matrix.c | C | www.github.com/chabhadiyadhrupal/Dhrupal_26_july_2022_C/tree/main/task/addi.. matrix.c | https://raw.githubusercontent.com/chabhadiyadhrupal/Dhrupal_26_july_2022_C/6436793/task/addi..%20matrix.c | chabhadiyadhrupal/Dhrupal_26_july_2022_C 6436793 task/addi.. matrix.c | true | 200 | 818 | #include<stdio.h>
int main()
{
int a[20][20];
int b[20][20];
int c,d,e=0,f,g;
printf("Enter raw column you want.");
printf("\nEnter raw : ");
scanf("%d",&f);
printf("Enter column : ");
scanf("%d",&g);
printf("\nEnter the value of element.\n");
printf("\nEnter the First matrics value.\n\n");
... | 1 |
elecarlier/philosophers_42 | 7d9920a | dinner.c | C | www.github.com/elecarlier/philosophers_42/tree/main/dinner.c | https://raw.githubusercontent.com/elecarlier/philosophers_42/7d9920a/dinner.c | elecarlier/philosophers_42 7d9920a dinner.c | true | 200 | 2,529 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* dinner.c :+: :+: :+: ... | 6 |
NatanFA/ProgramasC | 1b49f27 | quaisDiv.c | C | www.github.com/NatanFA/ProgramasC/tree/main/quaisDiv.c | https://raw.githubusercontent.com/NatanFA/ProgramasC/1b49f27/quaisDiv.c | NatanFA/ProgramasC 1b49f27 quaisDiv.c | true | 200 | 797 | /*
*Arquivo: quaisDiv.c
*Data criação: 01/dez/22
*Autor: Natan Ferreira
*Matrícula: 12121EEL016
*/
void identifica_divisores(int * vetor, int tamanho, int ref);
#include <stdio.h>
int main(void){
int n, ref;
printf("Quantos elementos? ");
scanf("%d",&n);
int vetor[n];
for(int i = 0; i < n; i++){
... | 7 |
IanPeternucci/Ebac-Notary-Office-Project | e5d58a0 | Ebac Project.c | C | www.github.com/IanPeternucci/Ebac-Notary-Office-Project/tree/main/Ebac Project.c | https://raw.githubusercontent.com/IanPeternucci/Ebac-Notary-Office-Project/e5d58a0/Ebac%20Project.c | IanPeternucci/Ebac-Notary-Office-Project e5d58a0 Ebac Project.c | true | 200 | 3,508 | #include <stdio.h> //comunica��o
#include <stdlib.h> // aloca��o de espa�o na mem�ria
#include <locale.h> // aloca��o de texto por regi�o
#include <string.h> // respons�vel pela string
int registro() // Registro de nomes
{
setlocale(LC_ALL, "Portuguese");// C�digo para ler acentos
char arquivo[40];
... | 4 |
mode777/Kanvas.js | 26cfddd | src/js.c | C | www.github.com/mode777/Kanvas.js/tree/main/src/js.c | https://raw.githubusercontent.com/mode777/Kanvas.js/26cfddd/src/js.c | mode777/Kanvas.js 26cfddd src/js.c | true | 200 | 11,359 | #include <stdio.h>
#include <assert.h>
#include <stdbool.h>
#define STB_DS_IMPLEMENTATION
#include "stb_ds.h"
#include "stb_image.h"
#include <SDL.h>
#include <duktape.h>
#include "js.h"
static KVS_Context* kvs;
static inline int get_int(duk_context* vm, const char* key, int def){
duk_get_prop_string(vm, -1, ... | 3 |
lor54/arduinoscope | 8633a6a | arduino/main.c | C | www.github.com/lor54/arduinoscope/tree/main/arduino/main.c | https://raw.githubusercontent.com/lor54/arduinoscope/8633a6a/arduino/main.c | lor54/arduinoscope 8633a6a arduino/main.c | true | 200 | 4,615 | #include <avr/interrupt.h>
#include <avr/io.h>
#include <util/delay.h>
#include <stdint.h>
#include <stdio.h>
#include <avr/sleep.h>
#include "avr_common/uart.h"
#include "utils.h"
#include "main.h"
int done_samples = 0;
int samples[8];
bool read = false;
int ADC_read(unsigned char channel) {
ADMUX = (ADMUX & 0x... | 2 |
ewelser/tms9900_libc | 4fe9aa6 | include/limits.h | C | www.github.com/ewelser/tms9900_libc/tree/main/include/limits.h | https://raw.githubusercontent.com/ewelser/tms9900_libc/4fe9aa6/include/limits.h | ewelser/tms9900_libc 4fe9aa6 include/limits.h | true | 200 | 1,503 | #ifndef __LIBC_LIMITS_H__
#define __LIBC_LIMITS_H__
/* These are the sizes of our supported data types:
char 8-bits
int 16-bits
short 16-bits
long 32-bits
long long 64-bits */
/* Number of bits in a byte */
#define CHAR_BIT (8)
/* Minimum and maximum values for a "char... | 0 |
tchayen/zig-text-rendering | afc9d78 | external/plutosvg/source/plutosvg.c | C | www.github.com/tchayen/zig-text-rendering/tree/main/external/plutosvg/source/plutosvg.c | https://raw.githubusercontent.com/tchayen/zig-text-rendering/afc9d78/external/plutosvg/source/plutosvg.c | tchayen/zig-text-rendering afc9d78 external/plutosvg/source/plutosvg.c | true | 200 | 89,531 | #include "plutosvg.h"
#include <stdint.h>
#include <float.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int plutosvg_version(void)
{
return PLUTOSVG_VERSION;
}
const char* plutosvg_version_string(void)
{
return PLUTOSVG_VERSION_STRING;
}
enum {
TAG_UNKNOWN = 0,
TAG_... | 5 |
alvls/mp1-2024-practice-test | 2b5aebd | 3824Б1ПР5/07 Жданов Никита Валерьевич/task1.c | C | www.github.com/alvls/mp1-2024-practice-test/tree/main/3824Б1ПР5/07 Жданов Никита Валерьевич/task1.c | https://raw.githubusercontent.com/alvls/mp1-2024-practice-test/2b5aebd/3824%D0%911%D0%9F%D0%A05/07%20%D0%96%D0%B4%D0%B0%D0%BD%D0%BE%D0%B2%20%D0%9D%D0%B8%D0%BA%D0%B8%D1%82%D0%B0%20%D0%92%D0%B0%D0%BB%D0%B5%D1%80%D1%8C%D0%B5%D0%B2%D0%B8%D1%87/task1.c | alvls/mp1-2024-practice-test 2b5aebd 3824Б1ПР5/07 Жданов Никита Валерьевич/task1.c | true | 200 | 1,299 | // Задача 1. Дан непустой массив A, содержащий n целых чисел, среди которых
// не менее двух нулей. Найти сумму элементов, расположенных между первыми
// двумя нулями.
#include <stddef.h> // Для определения типа size_t
#include <stdio.h> // Для ввода-вывода
int task1(int A[], size_t n)
{
int first_zero_index = -1;... | 7 |
superbaolong/CJourney | 5169e1a | 2012/6.c | C | www.github.com/superbaolong/CJourney/tree/main/2012/6.c | https://raw.githubusercontent.com/superbaolong/CJourney/5169e1a/2012/6.c | superbaolong/CJourney 5169e1a 2012/6.c | true | 200 | 1,376 | #include <stdio.h>
#include<stdlib.h>
#include <string.h>
#include<stdbool.h>
#include<math.h>
int main() {
int record[26]={0};
char a[100],b[100],c[100],d[100];
//输入四行大写字母，每行不超过一百个,要统计每个字母总共出现的次数,并以柱形图表示
printf("请依次输入四行大写字母:\n");
fgets(a,sizeof(a),stdin);
fgets(b,sizeof(b),stdin);
fgets(c,... | 6 |
XiaoLiQWQ/English-dictionary | 47c6e66 | server.c | C | www.github.com/XiaoLiQWQ/English-dictionary/tree/main/server.c | https://raw.githubusercontent.com/XiaoLiQWQ/English-dictionary/47c6e66/server.c | XiaoLiQWQ/English-dictionary 47c6e66 server.c | true | 200 | 7,485 | /*===============================================
* 文件名称：server.c
* 创 建 者：
* 创建日期：2024年05月09日
* 描 述：
================================================*/
#include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <unistd.h>... | 4 |
wangquanlikun/CS_LEARNING_HOMEWORK | f265063 | C/EXERCISE/Luogu/P1071.c | C | www.github.com/wangquanlikun/CS_LEARNING_HOMEWORK/tree/main/C/EXERCISE/Luogu/P1071.c | https://raw.githubusercontent.com/wangquanlikun/CS_LEARNING_HOMEWORK/f265063/C/EXERCISE/Luogu/P1071.c | wangquanlikun/CS_LEARNING_HOMEWORK f265063 C/EXERCISE/Luogu/P1071.c | true | 200 | 987 | #include<stdio.h>
#include<string.h>
int main()
{
char a[101], b[101], c[101];
scanf("%s%s", a, b);
scanf("%s", c);
char rule[128] = {'\0'};
char re_rule[128] = {'\0'};
int i, len;
len = strlen(a);
int adjust = 0;
for (i = 0; i < len;i++)
{
if(rule[a[i]]!='\0'&&rule[a[i]]... | 2 |
RiyaMunot/C | 8cc6280 | array/ar2d-1.c | C | www.github.com/RiyaMunot/C/tree/main/array/ar2d-1.c | https://raw.githubusercontent.com/RiyaMunot/C/8cc6280/array/ar2d-1.c | RiyaMunot/C 8cc6280 array/ar2d-1.c | true | 200 | 501 | //Enter and Dispaly values of matrix
#include<stdio.h>
int main()
{
int a[5][5],r,c,i,j;
printf("\n Enter the no. of rows and columns=");
scanf("%d%d",&r,&c);
printf("\n Enter the values of MAtrix");
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
scanf("%d",&a[i][j]);
... | 0 |
Muhammad-mansur/alx-low_level_programming | 29e5550 | 0x17-doubly_linked_lists/0-print_dlistint.c | C | www.github.com/Muhammad-mansur/alx-low_level_programming/tree/main/0x17-doubly_linked_lists/0-print_dlistint.c | https://raw.githubusercontent.com/Muhammad-mansur/alx-low_level_programming/29e5550/0x17-doubly_linked_lists/0-print_dlistint.c | Muhammad-mansur/alx-low_level_programming 29e5550 0x17-doubly_linked_lists/0-print_dlistint.c | true | 200 | 327 | #include "lists.h"
/**
* print_dlistint - A function that prints elements of a
* doubly linked list
*
* @h: linked list pointer
*
* Return: number of nodes
*/
size_t print_dlistint(const dlistint_t *h)
{
size_t count = 0;
while (h)
{
printf("%d\n", h->n);
h = h->next;
count++;
}
return (cou... | 5 |
Emix200/monty | 73e3384 | pstr.c | C | www.github.com/Emix200/monty/tree/main/pstr.c | https://raw.githubusercontent.com/Emix200/monty/73e3384/pstr.c | Emix200/monty 73e3384 pstr.c | true | 200 | 371 | #include "monty.h"
/**
* f_pstr - prints the string starting at the top of the stack
* @head: head of stack
* @counter: line_number
* Return: null
*/
void f_pstr(stack_t **head, unsigned int counter)
{
stack_t *h;
(void)counter;
h = *head;
while (h)
{
if (h->n > 127 || h->n <= 0)
{
break;
}
prin... | 6 |
enescelebii/Data_Structures | a6d222b | LAB 3/BINARY SEARCH TREE.c | C | www.github.com/enescelebii/Data_Structures/tree/main/LAB 3/BINARY SEARCH TREE.c | https://raw.githubusercontent.com/enescelebii/Data_Structures/a6d222b/LAB%203/BINARY%20SEARCH%20TREE.c | enescelebii/Data_Structures a6d222b LAB 3/BINARY SEARCH TREE.c | true | 200 | 1,802 | #include<stdio.h>
#include<stdlib.h>
#include<time.h>
#include<string.h>
#include<math.h>
#include<unistd.h>
#include<ctype.h>
struct node{
int data;
struct node *left;
struct node *right;
};
typedef struct node *btree;
void inorder(btree root);
btree insert(btree root,int x);
btree newnode(int x);
int main(){
... | 7 |
shital0101/Linked-List | aadf7a3 | singly.h | C | www.github.com/shital0101/Linked-List/tree/main/singly.h | https://raw.githubusercontent.com/shital0101/Linked-List/aadf7a3/singly.h | shital0101/Linked-List aadf7a3 singly.h | true | 200 | 706 | #include<stdio.h>
#include<stdlib.h>
#define NODEALLOC (NODE *)malloc(sizeof(NODE))
typedef struct node
{
int data;
struct node *next;
}NODE;
NODE *create(NODE *head)
{
NODE *temp,*newnode;
int i,n;
printf("\n enter the limit:");
scanf("%d",&n);
for(i=0;i<n;i++)
{
newnode=NODEALLOC;
... | 4 |
raytomely/Tommy-s-Adventures | e0ececb | tommy/tommy_platformer/tomsrce/fastgraf_sdl.c | C | www.github.com/raytomely/Tommy-s-Adventures/tree/main/tommy/tommy_platformer/tomsrce/fastgraf_sdl.c | https://raw.githubusercontent.com/raytomely/Tommy-s-Adventures/e0ececb/tommy/tommy_platformer/tomsrce/fastgraf_sdl.c | raytomely/Tommy-s-Adventures e0ececb tommy/tommy_platformer/tomsrce/fastgraf_sdl.c | true | 200 | 23,120 | #include <SDL/SDL.h>
//#include "font.h"
int main_loop = 1;
SDL_Event event;
SDL_Surface *screen = NULL;
Uint8 *keystate;
unsigned char alpha_color = 0;
unsigned char transcolors = 0;
unsigned char *frame_buffer;
int fb_width = 352;
int fb_height = 744;
int graphics_x = 0;
int graphics_y = 0;
int org_x =... | 5 |
TheJashShah/C-Projects | 8c4419d | Algorithms/booths.c | C | www.github.com/TheJashShah/C-Projects/tree/main/Algorithms/booths.c | https://raw.githubusercontent.com/TheJashShah/C-Projects/8c4419d/Algorithms/booths.c | TheJashShah/C-Projects 8c4419d Algorithms/booths.c | true | 200 | 5,435 | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define MAX_SIZE 100
typedef struct{
int top;
int arr[MAX_SIZE];
}Stack;
void initialize(Stack * s){
s->top = -1;
}
int isFull(Stack * s){
return s->top == MAX_SIZE - 1;
}
int isEmpty(Stack * s){
return s->top == -1;
}
void push(Stack ... | 0 |
ElianDochev/RPG_TEMP_REPO | fd59643 | source/game_running/create_player.c | C | www.github.com/ElianDochev/RPG_TEMP_REPO/tree/main/source/game_running/create_player.c | https://raw.githubusercontent.com/ElianDochev/RPG_TEMP_REPO/fd59643/source/game_running/create_player.c | ElianDochev/RPG_TEMP_REPO fd59643 source/game_running/create_player.c | true | 200 | 2,200 | /*
** EPITECH PROJECT, 2022
** rpg
** File description:
** file to create_player
*/
#include "player.h"
#include "m_my.h"
#include "main.h"
#include "items.h"
#include <fcntl.h>
#include <unistd.h>
static sprite_t **init_player_sprites(player_t *player)
{
sprite_t **sprites = malloc(sizeof(sprite_t *) * PLAYER_TE... | 2 |
ArinaMgk/unisym | caa1c18 | lib/c/ustring/chrar/ChrComMul.c | C | www.github.com/ArinaMgk/unisym/tree/main/lib/c/ustring/chrar/ChrComMul.c | https://raw.githubusercontent.com/ArinaMgk/unisym/caa1c18/lib/c/ustring/chrar/ChrComMul.c | ArinaMgk/unisym caa1c18 lib/c/ustring/chrar/ChrComMul.c | true | 200 | 1,069 | // ASCII C99 TAB4 CRLF
// Attribute: ArnCovenant Host[Allocation]
// LastCheck: RFZ22
// AllAuthor: @dosconio
// ModuTitle: Operations for ChrAr
/*
Copyright 2023 ArinaMgk
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You ... | 6 |
Chisonia/C-programming-notes | de76467 | strings/one.c | C | www.github.com/Chisonia/C-programming-notes/tree/main/strings/one.c | https://raw.githubusercontent.com/Chisonia/C-programming-notes/de76467/strings/one.c | Chisonia/C-programming-notes de76467 strings/one.c | true | 200 | 383 | #include <stdio.h>
#include <string.h>
int main(){
char name[20];
int i;
ssize_t count;
ssize_t len;
printf("Enter your name: ");
if (fgets(name, sizeof(name), stdin) != NULL){
len = strlen(name);
if (len > 0 && name[len - 1] == '\n'){
name[len - 1] = '\0';
... | 7 |
raiyan-fr/C_Tutorials | 9f013fa | hw2.c | C | www.github.com/raiyan-fr/C_Tutorials/tree/main/hw2.c | https://raw.githubusercontent.com/raiyan-fr/C_Tutorials/9f013fa/hw2.c | raiyan-fr/C_Tutorials 9f013fa hw2.c | true | 200 | 370 | # include <stdio.h>
//sum of n through recursion
int sum(int n) {
if(n == 0){
return 0;
}
if(n == 1) {
return 1;
}
int sumnm1 = sum(n-1);
int sumn = sum(n-1) + n;
return sumn;
}
int main() {
int a;
printf("enter a number: ");
scanf("%d", &n);
... | 4 |
Bigpapa2022/alx-low_level_programming | f5df15d | 0x05-pointers_arrays_strings/7-puts_half.c | C | www.github.com/Bigpapa2022/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/7-puts_half.c | https://raw.githubusercontent.com/Bigpapa2022/alx-low_level_programming/f5df15d/0x05-pointers_arrays_strings/7-puts_half.c | Bigpapa2022/alx-low_level_programming f5df15d 0x05-pointers_arrays_strings/7-puts_half.c | true | 200 | 389 | #include "main.h"
#include <stdio.h>
/**
*puts_half - prints every other character of a string
*@str: A pointer to an int that will be changed
*(Code by Hayzed)
*Return: void which means our answer is correct
*/
void puts_half(char *str)
{
int i, last;
i = 0;
while (str[i] != '\0')
{
i++;
}
last = (i + 1) / 2... | 0 |
andjalu/cobacobagit | 9eacf54 | tp8/EDBB211.c | C | www.github.com/andjalu/cobacobagit/tree/main/tp8/EDBB211.c | https://raw.githubusercontent.com/andjalu/cobacobagit/9eacf54/tp8/EDBB211.c | andjalu/cobacobagit 9eacf54 tp8/EDBB211.c | true | 200 | 5,470 | /*Saya Muhammad Cahyana Bintang Fajar NIM 2102665 mengerjakan
soal Tugas Praktikum 8 dalam mata kuliah Algoritma dan Pemrograman 1
untuk keberkahanNya maka saya tidak melakukan kecurangan seperti yang telah dispesifikasikan. Aamiin.*/
// library
#include <stdio.h>
#include <string.h>
// kodingan utama
int main()
{
... | 2 |
Mad-Host/C-Programming | 0e075b9 | Assignment 27/P6.c | C | www.github.com/Mad-Host/C-Programming/tree/main/Assignment 27/P6.c | https://raw.githubusercontent.com/Mad-Host/C-Programming/0e075b9/Assignment%2027/P6.c | Mad-Host/C-Programming 0e075b9 Assignment 27/P6.c | true | 200 | 1,970 | // Q5) Define a structure Student name, rollno and college name as a members. Define another structure Team with Two Student member variable.
// Q6) Define a method to create dynamically Student variable & return the address of student.
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<windows.h>
... | 5 |
miltonfruiz/tecnicatura | 3056eb4 | Programación I/C/Unidad 6/integradores/ej01RegistroVenta.c | C | www.github.com/miltonfruiz/tecnicatura/tree/main/Programación I/C/Unidad 6/integradores/ej01RegistroVenta.c | https://raw.githubusercontent.com/miltonfruiz/tecnicatura/3056eb4/Programaci%C3%B3n%20I/C/Unidad%206/integradores/ej01RegistroVenta.c | miltonfruiz/tecnicatura 3056eb4 Programación I/C/Unidad 6/integradores/ej01RegistroVenta.c | true | 200 | 2,146 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
// Prototipos
void carga(char arreglo[4][4][30]);
void muestro(char arreglo[4][4][30]);
void registro(char arreglo[4][4][30]);
void montos(char arreglo[4][4][30]);
float calculo(float valor1, float valor2);
// llamados
void main(){
char datos[4][4][30];
... | 6 |
comphy-lab/Viscoelastic3D | e90e3f9 | basilisk/src/test/couette.c | C | www.github.com/comphy-lab/Viscoelastic3D/tree/main/basilisk/src/test/couette.c | https://raw.githubusercontent.com/comphy-lab/Viscoelastic3D/e90e3f9/basilisk/src/test/couette.c | comphy-lab/Viscoelastic3D e90e3f9 basilisk/src/test/couette.c | true | 200 | 3,563 | /**
# Couette flow between rotating cylinders
We test embedded boundaries by solving the (Stokes) Couette flow
between two rotating cylinders. */
#include "grid/multigrid.h"
#include "embed.h"
#include "navier-stokes/centered.h"
#include "view.h"
int main()
{
/**
Space and time are dimensionless. This is necess... | 7 |
Ibrahim-Saber-Mohammed/ATMEGA32_COTS | b323b2d | 02-HAL/01 - LED/V03/LED_interface.h | C | www.github.com/Ibrahim-Saber-Mohammed/ATMEGA32_COTS/tree/main/02-HAL/01 - LED/V03/LED_interface.h | https://raw.githubusercontent.com/Ibrahim-Saber-Mohammed/ATMEGA32_COTS/b323b2d/02-HAL/01%20-%20LED/V03/LED_interface.h | Ibrahim-Saber-Mohammed/ATMEGA32_COTS b323b2d 02-HAL/01 - LED/V03/LED_interface.h | true | 200 | 1,573 | /********************************************************************************/
/* Author : Ibrahim saber */
/* Date : 10/11/2020 */
/* Version : V01 */
/********************************************************************************/
#ifndef LED_INTERFACE_H
#define LED_I... | 4 |
KopanoTezz/alx-low_level_programming | 8a893f7 | 0x0B-malloc_free/3-alloc_grid.c | C | www.github.com/KopanoTezz/alx-low_level_programming/tree/main/0x0B-malloc_free/3-alloc_grid.c | https://raw.githubusercontent.com/KopanoTezz/alx-low_level_programming/8a893f7/0x0B-malloc_free/3-alloc_grid.c | KopanoTezz/alx-low_level_programming 8a893f7 0x0B-malloc_free/3-alloc_grid.c | true | 200 | 646 | #include <stdlib.h>
#include "main.h"
/**
* alloc_grid - nested loop to make grid
* @width: width input
* @height: height input
* Return: pointer to 2 dim. array
*/
int **alloc_grid(int width, int height)
{
int **mem;
int a, y;
if (width <= 0 || height <= 0)
return (NULL);
mem = malloc(sizeof(int *) * heig... | 0 |
MohaimenH/K32L2B3-MIDI2 | 612f380 | source/main.c | C | www.github.com/MohaimenH/K32L2B3-MIDI2/tree/main/source/main.c | https://raw.githubusercontent.com/MohaimenH/K32L2B3-MIDI2/612f380/source/main.c | MohaimenH/K32L2B3-MIDI2 612f380 source/main.c | true | 200 | 7,236 | /*
* The MIT License (MIT)
*
* Copyright (c) 2019 Ha Thach (tinyusb.org)
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
... | 2 |
dremisze/42-Piscine | 0bd9b67 | Piscine/Rush02/ex00/main.c | C | www.github.com/dremisze/42-Piscine/tree/main/Piscine/Rush02/ex00/main.c | https://raw.githubusercontent.com/dremisze/42-Piscine/0bd9b67/Piscine/Rush02/ex00/main.c | dremisze/42-Piscine 0bd9b67 Piscine/Rush02/ex00/main.c | true | 200 | 2,312 | #include <unistd.h>
#include <stdlib.h>
#include <fcntl.h>
// Funkcja do wypisywania ciągu znaków
void ft_putstr(char *str) {
while (*str) {
write(1, str++, 1);
}
}
// Własna implementacja funkcji strlen
int ft_strlen(char *str) {
int length = 0;
while (str[length]) length++;
return length... | 5 |
paused89/Data-Structures-C | b051d82 | LINKED LIST/SINGLY LINKED LIST/Reverse.c | C | www.github.com/paused89/Data-Structures-C/tree/main/LINKED LIST/SINGLY LINKED LIST/Reverse.c | https://raw.githubusercontent.com/paused89/Data-Structures-C/b051d82/LINKED%20LIST/SINGLY%20LINKED%20LIST/Reverse.c | paused89/Data-Structures-C b051d82 LINKED LIST/SINGLY LINKED LIST/Reverse.c | true | 200 | 2,342 | /* Objectives:
* Reverses the linked list.
*/
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
struct node {
int data;
struct node *next;
};
typedef struct node node;
//FUNCTION DECALARATION
void insert_end(node **,int);
void display(node *);
void reverse(node **);
int main()
{
node *head=NULL;
int ch=0... | 6 |
kangina-tech/alx-low_level_programming | c1e47e6 | 0x07-pointers_arrays_strings/5-strstr.c | C | www.github.com/kangina-tech/alx-low_level_programming/tree/main/0x07-pointers_arrays_strings/5-strstr.c | https://raw.githubusercontent.com/kangina-tech/alx-low_level_programming/c1e47e6/0x07-pointers_arrays_strings/5-strstr.c | kangina-tech/alx-low_level_programming c1e47e6 0x07-pointers_arrays_strings/5-strstr.c | true | 200 | 686 | #include "main.h"
/**
* _strstr - The _strstr() function finds the first occurrence
* of the substring needle in the string haystack.
* The terminating null bytes (\0) are not compared
* @haystack: string where the search is made
* @needle: string whose occurence is searched in haystack
* Return:Returns a pointe... | 7 |
younicorn777/baekjoon | e8b4218 | 백준/Bronze/14681. 사분면 고르기/사분면 고르기.c | C | www.github.com/younicorn777/baekjoon/tree/main/백준/Bronze/14681. 사분면 고르기/사분면 고르기.c | https://raw.githubusercontent.com/younicorn777/baekjoon/e8b4218/%EB%B0%B1%EC%A4%80/Bronze/14681.%E2%80%85%EC%82%AC%EB%B6%84%EB%A9%B4%E2%80%85%EA%B3%A0%EB%A5%B4%EA%B8%B0/%EC%82%AC%EB%B6%84%EB%A9%B4%E2%80%85%EA%B3%A0%EB%A5%B4%EA%B8%B0.c | younicorn777/baekjoon e8b4218 백준/Bronze/14681. 사분면 고르기/사분면 고르기.c | true | 200 | 341 | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main(void)
{
int x = 0, y = 0;
scanf("%d%d", &x, &y);
if ((x > 0) && (y > 0))
printf("1");
else if ((x < 0) && (y > 0))
printf("2");
else if ((x < 0) && (y < 0))
printf("3");
else
printf("4")... | 0 |
wangyuan0225/C-Primer-Plus | a59609f | C Primer Plus第6版中文版习题解答 源代码/第05章/ex_02.c | C | www.github.com/wangyuan0225/C-Primer-Plus/tree/main/C Primer Plus第6版中文版习题解答 源代码/第05章/ex_02.c | https://raw.githubusercontent.com/wangyuan0225/C-Primer-Plus/a59609f/C%20Primer%20Plus%E7%AC%AC6%E7%89%88%E4%B8%AD%E6%96%87%E7%89%88%E4%B9%A0%E9%A2%98%E8%A7%A3%E7%AD%94%20%E6%BA%90%E4%BB%A3%E7%A0%81/%E7%AC%AC05%E7%AB%A0/ex_02.c | wangyuan0225/C-Primer-Plus a59609f C Primer Plus第6版中文版习题解答 源代码/第05章/ex_02.c | true | 200 | 466 | /*
第五章：编程练习 2
*/
#include <stdio.h>
int main(int argc, char *argv[]) {
int counter, i = 0;
printf("PRINT COUNTINUE 10 NUMBERS!\n");
printf("PLEASE INPUT THE START NUMBER :");
scanf("%d",&counter);
/* 读取用户输入，保存至counter */
while(i++ < 11){
printf(" %d \n",counter++);
}
/* 循环十次，打印范... | 5 |
TheLostOne388/kernel_sony | 997ba78 | pdx245/prebuilts/kernel-headers/include/linux/stackleak.h | C | www.github.com/TheLostOne388/kernel_sony/tree/main/pdx245/prebuilts/kernel-headers/include/linux/stackleak.h | https://raw.githubusercontent.com/TheLostOne388/kernel_sony/997ba78/pdx245/prebuilts/kernel-headers/include/linux/stackleak.h | TheLostOne388/kernel_sony 997ba78 pdx245/prebuilts/kernel-headers/include/linux/stackleak.h | true | 200 | 1,406 | /* SPDX-License-Identifier: GPL-2.0 */
#ifndef _LINUX_STACKLEAK_H
#define _LINUX_STACKLEAK_H
#include <linux/sched.h>
#include <linux/sched/task_stack.h>
#define STACKLEAK_POISON -0xBEEF
#define STACKLEAK_SEARCH_DEPTH 128
#ifdef CONFIG_GCC_PLUGIN_STACKLEAK
#include <asm/stacktrace.h>
static __always_inline unsign... | 6 |
r3dbug/c | a450f47 | mandel/multitasking/mandelbrot_client.c | C | www.github.com/r3dbug/c/tree/main/mandel/multitasking/mandelbrot_client.c | https://raw.githubusercontent.com/r3dbug/c/a450f47/mandel/multitasking/mandelbrot_client.c | r3dbug/c a450f47 mandel/multitasking/mandelbrot_client.c | true | 200 | 24,318 |
/* Classic Mandelbrot calculation implemented as:
* - Superbitmap window with scrollbars
* - Client/server application with message ports
*
* Compile with SAS/C (developped under V6.59):
*
* smake all
*
*
* Start from Shell with:
*
* execute mandelbrot_start
*
*/
/* includes */
#include <proto/exec.h>
#... | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.