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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
ravi0424/codemind-c | 2a54f52 | Find_the_sum_of_elements_in_the_array_without_using_loops.c | C | www.github.com/ravi0424/codemind-c/tree/main/Find_the_sum_of_elements_in_the_array_without_using_loops.c | https://raw.githubusercontent.com/ravi0424/codemind-c/2a54f52/Find_the_sum_of_elements_in_the_array_without_using_loops.c | ravi0424/codemind-c 2a54f52 Find_the_sum_of_elements_in_the_array_without_using_loops.c | true | 200 | 333 | #include<bits/stdc++.h>
using namespace std;
int operate(int array[], int N)
{
int sum = 0, index = 0;
label:
sum += array[index++];
if (index < N) {
goto label;
}
cout<<sum;
}
int main(){
int a;
cin>>a;
int b[a];
for(int i=0;i<a;i++){
cin>>b[i];
}
operate... | 7 |
SebKuzminsky/hm2-rp2040 | 244c174 | firmware/lbp16.h | C | www.github.com/SebKuzminsky/hm2-rp2040/tree/main/firmware/lbp16.h | https://raw.githubusercontent.com/SebKuzminsky/hm2-rp2040/244c174/firmware/lbp16.h | SebKuzminsky/hm2-rp2040 244c174 firmware/lbp16.h | true | 200 | 2,018 | #ifndef LBP16_H
#define LBP16_H
typedef struct {
uint16_t raw;
bool write;
bool has_addr;
bool info_area;
uint8_t memory_space;
uint8_t transfer_size;
int8_t transfer_bits;
int8_t transfer_bytes;
bool addr_increment;
uint8_t transfer_count;
int num_bytes;
} lbp16_cmd_t;
s... | 3 |
waleon-x/alx-low_level_programming | 395c3da | 0x05-pointers_arrays_strings/8-print_array.c | C | www.github.com/waleon-x/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/8-print_array.c | https://raw.githubusercontent.com/waleon-x/alx-low_level_programming/395c3da/0x05-pointers_arrays_strings/8-print_array.c | waleon-x/alx-low_level_programming 395c3da 0x05-pointers_arrays_strings/8-print_array.c | true | 200 | 355 | #include "main.h"
/**
* print_array - function that prints n elements of array
* @a: array name
* @n: number of elements of array to be printed
* Return: a and n inputs
*/
void print_array(int *a, int n)
{
int i;
for (i = 0; i < (n - 1); i++)
{
printf("%d, ", a[i]);
}
if (i == (n - 1))
{
printf("%d",... | 0 |
goldsteinn/eztest | 2115978 | src/eztest/eztest-test.h | C | www.github.com/goldsteinn/eztest/tree/main/src/eztest/eztest-test.h | https://raw.githubusercontent.com/goldsteinn/eztest/2115978/src/eztest/eztest-test.h | goldsteinn/eztest 2115978 src/eztest/eztest-test.h | true | 200 | 1,696 | #ifndef EZTEST_D_EZTEST_D_EZTEST_TEST_H_
#define EZTEST_D_EZTEST_D_EZTEST_TEST_H_
#include "eztest-compiler.h"
#include "eztest-lang.h"
#include "eztest-libc.h"
#include "eztest-status.h"
#include "eztest-struct-padding.h"
EZTEST_NAMESPACE_BEGIN_
typedef void (*eztest_test_func)(EZTEST_VOID_ARG_);
/* Struct with i... | 6 |
cskilbeck/wifi_alarm_clock | 47fc61e | alarm_clock_firmware/components/assets/assets.c | C | www.github.com/cskilbeck/wifi_alarm_clock/tree/main/alarm_clock_firmware/components/assets/assets.c | https://raw.githubusercontent.com/cskilbeck/wifi_alarm_clock/47fc61e/alarm_clock_firmware/components/assets/assets.c | cskilbeck/wifi_alarm_clock 47fc61e alarm_clock_firmware/components/assets/assets.c | true | 200 | 1,179 | //////////////////////////////////////////////////////////////////////
#include <esp_log.h>
#include "assets.h"
#include "Cascadia.c"
#include "Segoe.c"
#include "Digits.c"
#include "Big.c"
#include "Forte.c"
LOG_CONTEXT("assets");
#define LOAD_IMG(x) ESP_ERROR_CHECK(image_decode_png(#x, &image_id_##x, x##_png_star... | 5 |
Saurav-K-yadav/Network-Programming | 10c8cdd | select() server/server.c | C | www.github.com/Saurav-K-yadav/Network-Programming/tree/main/select() server/server.c | https://raw.githubusercontent.com/Saurav-K-yadav/Network-Programming/10c8cdd/select%28%29%20server/server.c | Saurav-K-yadav/Network-Programming 10c8cdd select() server/server.c | true | 200 | 3,130 | #include <stdio.h>
#include <arpa/inet.h>
#include <unistd.h>
#include <sys/socket.h>
#include <string.h>
#include <stdlib.h>
#include <netinet/in.h>
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
int main()
{
int sock = 0;
if ((sock = socket(AF_INET, SOCK_STREAM, 0)) < 0)
{
printf("Unable to create ... | 1 |
Jkiruri/alx-low_level_programming | d94ea37 | 0x15-file_io/0-read_textfile.c | C | www.github.com/Jkiruri/alx-low_level_programming/tree/main/0x15-file_io/0-read_textfile.c | https://raw.githubusercontent.com/Jkiruri/alx-low_level_programming/d94ea37/0x15-file_io/0-read_textfile.c | Jkiruri/alx-low_level_programming d94ea37 0x15-file_io/0-read_textfile.c | true | 200 | 593 | #include "main.h"
#include <stdlib.h>
/**
* read_textfile- This will read text file print to STDOUT.
* @filename: This is the text file being read
* @letters: These are the number of letters to be read
* Return: w- These are the actual number of bytes read and printed
*/
ssize_t read_textfile(const char *filename,... | 2 |
au-thev/cub3d_old | a29c658 | src/game/loader/load_scene.c | C | www.github.com/au-thev/cub3d_old/tree/main/src/game/loader/load_scene.c | https://raw.githubusercontent.com/au-thev/cub3d_old/a29c658/src/game/loader/load_scene.c | au-thev/cub3d_old a29c658 src/game/loader/load_scene.c | true | 200 | 5,844 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* load_scene.c :+: :+: :+: ... | 4 |
Gids11/alx-low_level_programming | 53dbba3 | 0x06-pointers_arrays_strings/2-strncpy.c | C | www.github.com/Gids11/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/2-strncpy.c | https://raw.githubusercontent.com/Gids11/alx-low_level_programming/53dbba3/0x06-pointers_arrays_strings/2-strncpy.c | Gids11/alx-low_level_programming 53dbba3 0x06-pointers_arrays_strings/2-strncpy.c | true | 200 | 276 | #include "main.h"
#include <string.h>
/**
* *_strncpy - A function that copies a string
* @dest: destination string
* @src: source string
* @n: size of bytes
*
* Return: dest
*/
char *_strncpy(char *dest, char *src, int n)
{
strncpy(dest, src, n);
return (dest);
}
| 7 |
Kisotu/alx-low_level_programming | 89ab9ec | 0x08-recursion/100-is_palindrome.c | C | www.github.com/Kisotu/alx-low_level_programming/tree/main/0x08-recursion/100-is_palindrome.c | https://raw.githubusercontent.com/Kisotu/alx-low_level_programming/89ab9ec/0x08-recursion/100-is_palindrome.c | Kisotu/alx-low_level_programming 89ab9ec 0x08-recursion/100-is_palindrome.c | true | 200 | 690 | #include "main.h"
/**
* str_len - prints length of string
* @s: string to print
* Return: length of string
*/
int str_len(char *s)
{
if (s[0] != '\0')
return (1 + str_len(s + 1));
return (0);
}
/**
* pali_check - check if string is palindrome
* @s: string address
* @j: left index
* @k: right index
* Retu... | 3 |
sidev86/minishell | 96792af | builtins.c | C | www.github.com/sidev86/minishell/tree/main/builtins.c | https://raw.githubusercontent.com/sidev86/minishell/96792af/builtins.c | sidev86/minishell 96792af builtins.c | true | 200 | 2,458 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* builtins.c :+: :+: :+: ... | 0 |
dmitro-kaprarenko/C-Embedded-Tech | 1e2a8ac | lab1/main.c | C | www.github.com/dmitro-kaprarenko/C-Embedded-Tech/tree/main/lab1/main.c | https://raw.githubusercontent.com/dmitro-kaprarenko/C-Embedded-Tech/1e2a8ac/lab1/main.c | dmitro-kaprarenko/C-Embedded-Tech 1e2a8ac lab1/main.c | true | 200 | 511 | #include <stdio.h>
#include <math.h>
// Calculate z1
double z1(double a)
{
return (1 - 2 * sin(a) * sin(a)) / (1 + sin(2 * a));
}
// Calculate z2
double z2(double a)
{
return (1 - tan(a)) / (1 + tan(a));
}
int main()
{
double a;
// Input the value of angle alpha
printf("Enter... | 6 |
rekebuba/alx-low_level_programming | c6536e6 | 0x0A-argc_argv/3-mul.c | C | www.github.com/rekebuba/alx-low_level_programming/tree/main/0x0A-argc_argv/3-mul.c | https://raw.githubusercontent.com/rekebuba/alx-low_level_programming/c6536e6/0x0A-argc_argv/3-mul.c | rekebuba/alx-low_level_programming c6536e6 0x0A-argc_argv/3-mul.c | true | 200 | 386 | #include <stdio.h>
#include <stdlib.h>
#include "main.h"
/**
* main - prints the name of the program
* @argc: number of arguments
* @argv: array of arguments
*
* Return: Always 0 (Success)
*/
int main(int argc, char *argv[])
{
int a, b;
if (argc - 1 != 2)
{
printf("Error\n");
return (1);
}
a = atoi(arg... | 5 |
Mitalkach/c-programming | e51f47f | module2(2).c | C | www.github.com/Mitalkach/c-programming/tree/main/module2(2).c | https://raw.githubusercontent.com/Mitalkach/c-programming/e51f47f/module2%282%29.c | Mitalkach/c-programming e51f47f module2(2).c | true | 200 | 208 | #include<stdio.h>
int main()
{
int no;
printf("enter a numbar:");
scanf("%d",&no);
printf("square of %d is %d\n",no,(no*no));
printf("cube of %d is %d\n",no,(no*no*no));
} | 1 |
Echo-Aran/Data-structure | a3d6b4d | 02链表/SLTt.c | C | www.github.com/Echo-Aran/Data-structure/tree/main/02链表/SLTt.c | https://raw.githubusercontent.com/Echo-Aran/Data-structure/a3d6b4d/02%E9%93%BE%E8%A1%A8/SLTt.c | Echo-Aran/Data-structure a3d6b4d 02链表/SLTt.c | true | 200 | 2,104 | #include"SList.h"
void SLTPrint(SLTNode* phead)
{
SLTNode* cur = phead;
while (cur)
{
printf("%d->", cur->data);
cur = cur->next;
}
printf("NULL");
printf("\n");
}//�ܲ�����phead ֱ�ӱ���
SLTNode* BuySLTNode(SLTDataType x)
{
SLTNode* newnode = (SLTNode*)malloc(sizeof(SLTNode));
if (newnode == NULL)
{
perro... | 2 |
KennyD4Christ/alx-low_level_programming | e4b5d24 | 0x1E-search_algorithms/102-interpolation.c | C | www.github.com/KennyD4Christ/alx-low_level_programming/tree/main/0x1E-search_algorithms/102-interpolation.c | https://raw.githubusercontent.com/KennyD4Christ/alx-low_level_programming/e4b5d24/0x1E-search_algorithms/102-interpolation.c | KennyD4Christ/alx-low_level_programming e4b5d24 0x1E-search_algorithms/102-interpolation.c | true | 200 | 955 | #include "search_algos.h"
/**
* interpolation_search - Searches for a value in a sorted array
* of integers using interpolation search.
* @array: A pointer to the first element of the array to search.
* @size: The number of elements in the array.
* @value: The value to search for.
*
* Return: If the value is no... | 4 |
calmsacibis995/uw2-src | 95995ce | usr/src/common/cmd/cmd-nm/usr.sbin/snmp/in.snmpd/v_at.c | C | www.github.com/calmsacibis995/uw2-src/tree/main/usr/src/common/cmd/cmd-nm/usr.sbin/snmp/in.snmpd/v_at.c | https://raw.githubusercontent.com/calmsacibis995/uw2-src/95995ce/usr/src/common/cmd/cmd-nm/usr.sbin/snmp/in.snmpd/v_at.c | calmsacibis995/uw2-src 95995ce usr/src/common/cmd/cmd-nm/usr.sbin/snmp/in.snmpd/v_at.c | true | 200 | 18,056 | /* 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... | 7 |
LeepiDK24/My-Codes | af0dd95 | C codes/C/ap.c | C | www.github.com/LeepiDK24/My-Codes/tree/main/C codes/C/ap.c | https://raw.githubusercontent.com/LeepiDK24/My-Codes/af0dd95/C%20codes/C/ap.c | LeepiDK24/My-Codes af0dd95 C codes/C/ap.c | true | 200 | 160 | #include<stdio.h>
int main()
{ int n;
int a=4,d=3;
printf("Enter n\n");
scanf("%d",&n);
for(int i=1;i<=n;i++){
printf("%d\n",a);
a=a+d;
} return 0;
} | 0 |
HibaHac/alx-low_level_programming | a8ad711 | 0x02-functions_nested_loops/1-alphabet.c | C | www.github.com/HibaHac/alx-low_level_programming/tree/main/0x02-functions_nested_loops/1-alphabet.c | https://raw.githubusercontent.com/HibaHac/alx-low_level_programming/a8ad711/0x02-functions_nested_loops/1-alphabet.c | HibaHac/alx-low_level_programming a8ad711 0x02-functions_nested_loops/1-alphabet.c | true | 200 | 220 | #include"main.h"
/**
*print_alphabet - function that prints the alphabet in lowercase
*
* Return: always 0
*/
void print_alphabet(void)
{
int j;
for (j = 97; j <= 122; j++)
{
_putchar(j);
}
_putchar('\n');
}
| 6 |
JoaoVictorADM/Projeto-Computacao-Grafica | bcbe11d | ProjetoCG/globals.h | C | www.github.com/JoaoVictorADM/Projeto-Computacao-Grafica/tree/main/ProjetoCG/globals.h | https://raw.githubusercontent.com/JoaoVictorADM/Projeto-Computacao-Grafica/bcbe11d/ProjetoCG/globals.h | JoaoVictorADM/Projeto-Computacao-Grafica bcbe11d ProjetoCG/globals.h | true | 200 | 222 | #pragma once
#ifndef GLOBALS_H
#define GLOBALS_H
#include <glm.hpp>
#include "Shader.h"
// Declara��o da vari�vel global
extern glm::mat4 ortho;
extern Shader objectShader;
extern Shader texShader;
#endif // GLOBALS_H
| 5 |
jalajSinha56/DSA-Programs | db43405 | Stack Programs/Stack_5.c | C | www.github.com/jalajSinha56/DSA-Programs/tree/main/Stack Programs/Stack_5.c | https://raw.githubusercontent.com/jalajSinha56/DSA-Programs/db43405/Stack%20Programs/Stack_5.c | jalajSinha56/DSA-Programs db43405 Stack Programs/Stack_5.c | true | 200 | 500 | //Program for Decimal to any base Conversion
#include<stdio.h>
int Stack[50],top=-1;
void main()
{
int n,b;
printf("Enter the number:");
scanf("%d",&n);
printf("Enter the base into which number should be converted:");
scanf("%d",&b);
int t=n;
while(n>0)
{
Stack[top+1... | 1 |
Arif-462/C-Language-code | 6631994 | Week 7 introduction to pointer and recursion/practice module/Module 25.5 practice day 1/module 25.5/practice problem 5 sum first n natural numbers.c | C | www.github.com/Arif-462/C-Language-code/tree/main/Week 7 introduction to pointer and recursion/practice module/Module 25.5 practice day 1/module 25.5/practice problem 5 sum first n natural numbers.c | https://raw.githubusercontent.com/Arif-462/C-Language-code/6631994/Week%207%20introduction%20to%20pointer%20and%20recursion/practice%20module/Module%2025.5%20practice%20day%201/module%2025.5/practice%20problem%205%20sum%20first%20n%20natural%20numbers.c | Arif-462/C-Language-code 6631994 Week 7 introduction to pointer and recursion/practice module/Module 25.5 practice day 1/module 25.5/practice problem 5 sum first n natural numbers.c | true | 200 | 208 | #include<stdio.h>
int sum(int x)
{
if(x>0)
{
return sum(x-1)+x ;
}
return 0;
}
int main(void)
{
int n;
scanf("%d",&n);
int a = sum(n);
printf("%d",a);
return 0;
}
| 3 |
abhishekraut1/C_Programs | 812c19e | simple interest.c | C | www.github.com/abhishekraut1/C_Programs/tree/main/simple interest.c | https://raw.githubusercontent.com/abhishekraut1/C_Programs/812c19e/simple%20interest.c | abhishekraut1/C_Programs 812c19e simple interest.c | true | 200 | 247 | #include<stdio.h>
#include<conio.h>
int main()
{
int p,r,t;
float si;
printf("Input principle,Rate of interest & time to find simple interest: \n");
scanf("%d%d%d",&p,&r,&t);
si=(p*r*t)/100;
printf("Simple interest = %f",si);
return 0;
} | 6 |
lae1965/lasy | 3fd42c1 | MN/MNDSKINP.C | C | www.github.com/lae1965/lasy/tree/main/MN/MNDSKINP.C | https://raw.githubusercontent.com/lae1965/lasy/3fd42c1/MN/MNDSKINP.C | lae1965/lasy 3fd42c1 MN/MNDSKINP.C | true | 200 | 4,111 | /*****************************************************************
mndskinp - ���� ����� ��᪠
bool mndskinp (row, col, dsk, ttl, num[,msg1,msg2,...] );
int row; ����� ��ப� ���� ����� �� ��࠭�
int col; ����� ������� ���� ����� �� ��࠭�
char *ttl; ��������� ���� ����� (��� NULL)
char ... | 5 |
xzzcyber/c_prog | e293f6f | Exam Prep/decimal_hexa.c | C | www.github.com/xzzcyber/c_prog/tree/main/Exam Prep/decimal_hexa.c | https://raw.githubusercontent.com/xzzcyber/c_prog/e293f6f/Exam%20Prep/decimal_hexa.c | xzzcyber/c_prog e293f6f Exam Prep/decimal_hexa.c | true | 200 | 237 | #include <stdio.h>
int main() {
int decimal;
char hex[100];
printf("Enter a decimal number: ");
scanf("%d", &decimal);
sprintf(hex, "%X", decimal);
printf("Hexadecimal equivalent: %s\n", hex);
return 0;
} | 3 |
Bolad-001/alx-low_level_programming | a8d2a4c | 0x15-file_io/0-read_textfile.c | C | www.github.com/Bolad-001/alx-low_level_programming/tree/main/0x15-file_io/0-read_textfile.c | https://raw.githubusercontent.com/Bolad-001/alx-low_level_programming/a8d2a4c/0x15-file_io/0-read_textfile.c | Bolad-001/alx-low_level_programming a8d2a4c 0x15-file_io/0-read_textfile.c | true | 200 | 759 | #include "main.h"
/**
* read_textfile - function that read a text file
* and prints it to the POSIX
* @filename: name of the file
* @letters: number of letters to read and print
*
* Return: the actual number of letter it could print
*/
ssize_t read_textfile(const char *filename, size_t letters)
{
int fp;
ssi... | 1 |
gkethamallax/Zephyrproject | 7f8cc43 | tests/drivers/mspi/api/src/main.c | C | www.github.com/gkethamallax/Zephyrproject/tree/main/tests/drivers/mspi/api/src/main.c | https://raw.githubusercontent.com/gkethamallax/Zephyrproject/7f8cc43/tests/drivers/mspi/api/src/main.c | gkethamallax/Zephyrproject 7f8cc43 tests/drivers/mspi/api/src/main.c | true | 200 | 3,541 | /*
* Copyright (c) 2024 Ambiq Micro Inc. <www.ambiq.com>
* SPDX-License-Identifier: Apache-2.0
*/
#include <zephyr/device.h>
#include <zephyr/drivers/mspi.h>
#include <zephyr/drivers/mspi_emul.h>
#include <zephyr/ztest.h>
#define TEST_MSPI_REINIT 1
/* add else if for other SoC platforms */
#if defined(CONFIG_S... | 6 |
calmsacibis995/uw2-src | 95995ce | usr/src/common/uts/net/rpc/authu_prot.c | C | www.github.com/calmsacibis995/uw2-src/tree/main/usr/src/common/uts/net/rpc/authu_prot.c | https://raw.githubusercontent.com/calmsacibis995/uw2-src/95995ce/usr/src/common/uts/net/rpc/authu_prot.c | calmsacibis995/uw2-src 95995ce usr/src/common/uts/net/rpc/authu_prot.c | true | 200 | 3,123 | /* Copyright (c) 1990, 1991, 1992, 1993, 1994 Novell, Inc. All Rights Reserved. */
/* Copyright (c) 1984, 1985, 1986, 1987, 1988, 1989, 1990 Novell, Inc. All Rights Reserved. */
/* All Rights Reserved */
/* THIS IS UNPUBLISHED PROPRIETARY SOURCE CODE OF Novell Inc. */
/* The copyright notice above does not evidenc... | 5 |
veerapatadia/C-language | 8ec549d | practical/task4.c | C | www.github.com/veerapatadia/C-language/tree/main/practical/task4.c | https://raw.githubusercontent.com/veerapatadia/C-language/8ec549d/practical/task4.c | veerapatadia/C-language 8ec549d practical/task4.c | true | 200 | 311 | #include<stdio.h>
main()
{
int i,v[10],*ptr[10],n;
printf("Enter size of array=");
scanf("%d",&n);
printf("enter arrays element=\n");
for(i=0;i<n;i++)
{
printf("v[%d]=",i);
scanf("%d",&v[i]);
ptr[i]=&v[i];
}
for(i=0;i<n;i++)
{
if(v[i]%2!=0)
{
printf("odd=%d\n",*ptr[i]);
}
}
}
| 3 |
Kkyn-ltcode/Raw_code | cca1292 | data/batch_16/16874_0.c | C | www.github.com/Kkyn-ltcode/Raw_code/tree/main/data/batch_16/16874_0.c | https://raw.githubusercontent.com/Kkyn-ltcode/Raw_code/cca1292/data/batch_16/16874_0.c | Kkyn-ltcode/Raw_code cca1292 data/batch_16/16874_0.c | true | 200 | 477 | void rfbProcessClientMessage ( rfbClientPtr cl ) {
switch ( cl -> state ) {
case RFB_PROTOCOL_VERSION : rfbProcessClientProtocolVersion ( cl ) ;
return ;
case RFB_SECURITY_TYPE : rfbProcessClientSecurityType ( cl ) ;
return ;
case RFB_AUTHENTICATION : rfbAuthProcessClientMessage ( cl ) ;
return ;
case RFB_INITI... | 1 |
kimaru355/alx-low_level_programming | 86331aa | 0x01-variables_if_else_while/3-print_alphabets.c | C | www.github.com/kimaru355/alx-low_level_programming/tree/main/0x01-variables_if_else_while/3-print_alphabets.c | https://raw.githubusercontent.com/kimaru355/alx-low_level_programming/86331aa/0x01-variables_if_else_while/3-print_alphabets.c | kimaru355/alx-low_level_programming 86331aa 0x01-variables_if_else_while/3-print_alphabets.c | true | 200 | 275 | #include <stdio.h>
/**
* main - prints alphabets in lower ase followed by uppercase
*
* Return: Always 0.
*/
int main(void)
{
char ch;
for (ch = 'a' ; ch <= 'z' ; ch++)
putchar(ch);
for (ch = 'A' ; ch <= 'Z' ; ch++)
putchar(ch);
putchar('\n');
return (0);
}
| 6 |
jpc-cermics/scicos-4.4 | b0d157d | src/scicos_utils.c | C | www.github.com/jpc-cermics/scicos-4.4/tree/main/src/scicos_utils.c | https://raw.githubusercontent.com/jpc-cermics/scicos-4.4/b0d157d/src/scicos_utils.c | jpc-cermics/scicos-4.4 b0d157d src/scicos_utils.c | true | 200 | 1,307 |
#include <nsp/nsp.h>
#include <scicos/simul4.h>
#include <scicos/blocks.h>
void *scicos_malloc (size_t size)
{
return malloc (size);
}
void scicos_free (void *p)
{
free (p);
}
/*
* mtran transpose matrice a in matrix b
* a et b do not share memory.
* na nombre de ligne du tableau a dans le p... | 5 |
olegpreed/so_long | 457193a | game/map_check.c | C | www.github.com/olegpreed/so_long/tree/main/game/map_check.c | https://raw.githubusercontent.com/olegpreed/so_long/457193a/game/map_check.c | olegpreed/so_long 457193a game/map_check.c | true | 200 | 2,726 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* map_check.c :+: :+: :+: ... | 3 |
Brain-0ut/CS50 | dc8cf50 | Week1/mario-less/mario.c | C | www.github.com/Brain-0ut/CS50/tree/main/Week1/mario-less/mario.c | https://raw.githubusercontent.com/Brain-0ut/CS50/dc8cf50/Week1/mario-less/mario.c | Brain-0ut/CS50 dc8cf50 Week1/mario-less/mario.c | true | 200 | 557 | #include <cs50.h>
#include <stdio.h>
int main(void)
{
int height;
string s;
do
{
height = get_int("What height of pyramid you whant? "); //put height of pyramid
}
while (height < 1 || height > 8);
for (int i = 1; i <= height; i++)
{
for (int x = height; x > 0; x--) //rev... | 1 |
Harshitha-4243/harshitha_diploma_parvam_cdsa | 4dc5834 | string5.c | C | www.github.com/Harshitha-4243/harshitha_diploma_parvam_cdsa/tree/main/string5.c | https://raw.githubusercontent.com/Harshitha-4243/harshitha_diploma_parvam_cdsa/4dc5834/string5.c | Harshitha-4243/harshitha_diploma_parvam_cdsa 4dc5834 string5.c | true | 200 | 347 | #include <stdio.h>
#include<string.h>
int main() {
// Declare a string variable (character array)
char str[100];
printf("Enter a string ");
fgets(str,sizeof(str),stdin);
str[strcspn(str,"\n")]=0;
printf("the str is: %s\n", str);
int length=strlen(str);
printf("%d is the length of string"... | 5 |
ShadyTh/C_Embedded_Projects | 3c23c25 | Mini_Project_2/timer0_pwm.c | C | www.github.com/ShadyTh/C_Embedded_Projects/tree/main/Mini_Project_2/timer0_pwm.c | https://raw.githubusercontent.com/ShadyTh/C_Embedded_Projects/3c23c25/Mini_Project_2/timer0_pwm.c | ShadyTh/C_Embedded_Projects 3c23c25 Mini_Project_2/timer0_pwm.c | true | 200 | 434 | /*
* timer0_pwm.c
*
* Created on: Feb 18, 2021
* Author: Shady Thomas
*/
#include "timer0_pwm.h"
void TIMER0_PWM_init()
{
TCNT0 = 0; /* Timer starts counting from zero */
/* */
TCCR0 = (1<<WGM00) | (1<<WGM01) | (1<<COM01) | (1<<CS01);
DDRB = DDRB | (1<<PB3); /* Enable OC0 (PB3) pin a... | 3 |
skmahto101210/C-Programming | f7ec2bd | myCode/patterns/3.c | C | www.github.com/skmahto101210/C-Programming/tree/main/myCode/patterns/3.c | https://raw.githubusercontent.com/skmahto101210/C-Programming/f7ec2bd/myCode/patterns/3.c | skmahto101210/C-Programming f7ec2bd myCode/patterns/3.c | true | 200 | 618 | // Date- 17/12/22
// Author- Saksham_Mahto
#include <stdio.h>
int main()
{
int n;
char ch = 'y';
while (ch == 'y' || ch == 'Y')
{
printf("Enter the size of the Pattern\n");
scanf("%d", &n);
fflush(stdin);
printf("\nPATTERN :-\n");
for (int i = 0; i < n; i++)
... | 1 |
olugbeminiyi2000/printf | c00b7e7 | _putchar.c | C | www.github.com/olugbeminiyi2000/printf/tree/main/_putchar.c | https://raw.githubusercontent.com/olugbeminiyi2000/printf/c00b7e7/_putchar.c | olugbeminiyi2000/printf c00b7e7 _putchar.c | true | 200 | 277 | #include "main.h"
/*a function that returns a value*/
/**
* _putchar - writes the character c to stdout
*
* @c: the c parameter
* Return: On success 1
* On error, -1 is returned , and errno is set appropriately.
*/
int _putchar(char c)
{
write(1, &c, 1);
return (1);
}
| 6 |
LukaszG92/MetodiNumerici | dd5104d | Esercitazione 3/Materiale/prodottoSequenziale.c | C | www.github.com/LukaszG92/MetodiNumerici/tree/main/Esercitazione 3/Materiale/prodottoSequenziale.c | https://raw.githubusercontent.com/LukaszG92/MetodiNumerici/dd5104d/Esercitazione%203/Materiale/prodottoSequenziale.c | LukaszG92/MetodiNumerici dd5104d Esercitazione 3/Materiale/prodottoSequenziale.c | true | 200 | 1,223 | #include <stdlib.h>
#include <stdio.h>
#include <mpi.h>
#define ROWS 40000
#define COLS 40000
int main(int argc, char **argv) {
double *matrix, *vector, *result;
double start_time, end_time;
MPI_Init(&argc, &argv);
matrix = (double*)malloc(ROWS * COLS * sizeof(double));
vector = (double*... | 5 |
Annihilator544/MIT-Bengaluru-CSE-Labs | f805859 | Year 2/Semester 4/ES/Hardware Programs/5. Keypad/KEY_PAD.c | C | www.github.com/Annihilator544/MIT-Bengaluru-CSE-Labs/tree/main/Year 2/Semester 4/ES/Hardware Programs/5. Keypad/KEY_PAD.c | https://raw.githubusercontent.com/Annihilator544/MIT-Bengaluru-CSE-Labs/f805859/Year%202/Semester%204/ES/Hardware%20Programs/5.%20Keypad/KEY_PAD.c | Annihilator544/MIT-Bengaluru-CSE-Labs f805859 Year 2/Semester 4/ES/Hardware Programs/5. Keypad/KEY_PAD.c | true | 200 | 2,617 | #include <LPC17xx.h>
#include "lcd.h"
void scan(void);
unsigned char Msg1[14] = "ALS BENGALURU";
unsigned char Msg2[13] = "KEY PRESSED=";
unsigned char col,row,var,flag,key,*ptr;
unsigned long int i,var1,temp,temp3;
unsigned char SCAN_CODE[16] = {0x1E,0x1D,0x1B,0x17,
0x2E,0x2D,0x2B,0x27,
... | 3 |
LLNL/SAC2000 | c347f4f | src/gam/disppkLandscape.c | C | www.github.com/LLNL/SAC2000/tree/main/src/gam/disppkLandscape.c | https://raw.githubusercontent.com/LLNL/SAC2000/c347f4f/src/gam/disppkLandscape.c | LLNL/SAC2000 c347f4f src/gam/disppkLandscape.c | true | 200 | 4,414 | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include "../../inc/complex.h"
#include "../../inc/proto.h"
#include <string.h>
#include "../../inc/mach.h"
#include "../../inc/hdr.h"
#include "../../inc/lhf.h"
#include "../../inc/gem.h"
#include "../../inc/gam.h"
void getxw(double ywloc, float* xw... | 1 |
Pengv1n/CDev-with-ring-buffer | 3ecb5a3 | circ_cdev.c | C | www.github.com/Pengv1n/CDev-with-ring-buffer/tree/main/circ_cdev.c | https://raw.githubusercontent.com/Pengv1n/CDev-with-ring-buffer/3ecb5a3/circ_cdev.c | Pengv1n/CDev-with-ring-buffer 3ecb5a3 circ_cdev.c | true | 200 | 6,064 | #include "circ_cdev.h"
void set_last_op(char *out, const char *op)
{
struct timespec64 curr_tm;
struct tm tm1;
ktime_to_timespec64_cond(ktime_get_real(), &curr_tm);
time64_to_tm(curr_tm.tv_sec, 0, &tm1);
sprintf(out, "%s TIME: %.4lu-%.2d-%.2d %.2d:%.2d:%.2d PID: %u",
... | 6 |
Baribor/printf | d71ad03 | specifier_b.c | C | www.github.com/Baribor/printf/tree/main/specifier_b.c | https://raw.githubusercontent.com/Baribor/printf/d71ad03/specifier_b.c | Baribor/printf d71ad03 specifier_b.c | true | 200 | 327 | #include "main.h"
#include <stdarg.h>
/**
* specifier_b - Function to handle the b custom specifier
* @args: Argument list
* @info: Specifier info
* Return: Void
*/
int specifier_b(va_list args, specifier_info info)
{
int counter = 0;
(void)info;
print_bin(&counter, va_arg(args, unsigned int));
return (count... | 5 |
Priyankasingh1011/K-R-Programming-solutions | 56ab087 | K&R_exercises/Chapter 1/Exer_1_10.c | C | www.github.com/Priyankasingh1011/K-R-Programming-solutions/tree/main/K&R_exercises/Chapter 1/Exer_1_10.c | https://raw.githubusercontent.com/Priyankasingh1011/K-R-Programming-solutions/56ab087/K%26R_exercises/Chapter%201/Exer_1_10.c | Priyankasingh1011/K-R-Programming-solutions 56ab087 K&R_exercises/Chapter 1/Exer_1_10.c | true | 200 | 523 | #include <stdio.h>
int main(void) {
int cinput;
while ((cinput = getchar()) != EOF) {
if (cinput == '\t') {
putchar('\\');
putchar('t');
}
if (cinput == '\b') {
putchar('\\');
putchar('b');
}
if (cinput ... | 1 |
Sethuslt/alx-low_level_programming | a3c28bc | 0x0D-preprocessor/02-main.c | C | www.github.com/Sethuslt/alx-low_level_programming/tree/main/0x0D-preprocessor/02-main.c | https://raw.githubusercontent.com/Sethuslt/alx-low_level_programming/a3c28bc/0x0D-preprocessor/02-main.c | Sethuslt/alx-low_level_programming a3c28bc 0x0D-preprocessor/02-main.c | true | 200 | 197 | #include <stdio.h>
/**
* main - print name of file of program
* was compiled from followed by a new line.
*
*
* Return: always 0
*/
int main(void)
{
printf("%s\n", __FILE__);
return (0);
}
| 5 |
ErnestoBoca/alx-low_level_programming | 03127be | 0x13-more_singly_linked_lists/8-sum_listint.c | C | www.github.com/ErnestoBoca/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/8-sum_listint.c | https://raw.githubusercontent.com/ErnestoBoca/alx-low_level_programming/03127be/0x13-more_singly_linked_lists/8-sum_listint.c | ErnestoBoca/alx-low_level_programming 03127be 0x13-more_singly_linked_lists/8-sum_listint.c | true | 200 | 364 | #include "lists.h"
/**
* sum_listint - returns the sum of all the data (n) of a list
* @head: the head of the list
* Return: the sum of all the data (n) of a list
*/
int sum_listint(listint_t *head)
{
int sum = 0;
listint_t *temp = head;
if (head == NULL)
return (0);
while (temp != NULL)
{
sum += temp->n... | 6 |
richnguyen2/Cookin-Slime | ba8c652 | game/images/zero.h | C | www.github.com/richnguyen2/Cookin-Slime/tree/main/game/images/zero.h | https://raw.githubusercontent.com/richnguyen2/Cookin-Slime/ba8c652/game/images/zero.h | richnguyen2/Cookin-Slime ba8c652 game/images/zero.h | true | 200 | 492 | /*
* Exported with nin10kit v1.8
* Invocation command was nin10kit --mode=3 --resize=5x7 zero zero.png
* Time-stamp: Sunday 07/16/2023, 20:48:02
*
* Image Information
* -----------------
* zero.png 5@7
*
* All bug reports / feature requests are to be filed here https://github.com/TricksterGuy/nin10kit/issue... | 1 |
HenriqueSBDEV/Lista-Esbel | 5f23e82 | 06.c | C | www.github.com/HenriqueSBDEV/Lista-Esbel/tree/main/06.c | https://raw.githubusercontent.com/HenriqueSBDEV/Lista-Esbel/5f23e82/06.c | HenriqueSBDEV/Lista-Esbel 5f23e82 06.c | true | 200 | 1,197 | #include <stdio.h>
#include <stdlib.h>
int desenhaTriangulo(int tamanho, int tipo);
int desenhaLinha(int tamanho, char linha[]);
int main() {
int tamanho, tipo;
printf("Informe o tamanho do triangulo:\n");
scanf("%d", &tamanho);
char linha[tamanho];
printf("Informe o tipo do trinagulo\n");
scanf("%d", &tipo);
... | 3 |
IsaRosseto/ListaDeTarefas2 | c9be085 | biblioteca.c | C | www.github.com/IsaRosseto/ListaDeTarefas2/tree/main/biblioteca.c | https://raw.githubusercontent.com/IsaRosseto/ListaDeTarefas2/c9be085/biblioteca.c | IsaRosseto/ListaDeTarefas2 c9be085 biblioteca.c | true | 200 | 14,248 | //
// Created by isabe on 19/09/2023.
//
#include "biblioteca.h"
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
// Função para salvar tarefas em um arquivo binário
void salvarTarefa(struct Tarefa tarefas[], int nTarefas) {
FILE *arquivo;
arquivo = fopen("tarefas.bin", "wb");
if ... | 5 |
ashutoshphegade/MCPI_Assignment | bcca491 | As3_extintrupt_v2/Inc/switch_intr.h | C | www.github.com/ashutoshphegade/MCPI_Assignment/tree/main/As3_extintrupt_v2/Inc/switch_intr.h | https://raw.githubusercontent.com/ashutoshphegade/MCPI_Assignment/bcca491/As3_extintrupt_v2/Inc/switch_intr.h | ashutoshphegade/MCPI_Assignment bcca491 As3_extintrupt_v2/Inc/switch_intr.h | true | 200 | 421 | /*
Author: Nilesh Ghule <nilesh@sunbeaminfo.com>
Course: PG-DESD @ Sunbeam Infotech
Date: Sep 21, 2024
*/
#ifndef SWITCH_INTR_H_
#define SWITCH_INTR_H_
#include "stm32f4xx.h"
#define GPIO_SWITCH GPIOA
#define SWITCH_PIN 0
#define SWITCH_GPIO_CLKEN 0
#define SWITCH_EXTI 0
void SwitchInit(void);
void EXTI0... | 1 |
harturalcantara/federal-university-of-ceara | 9f09380 | Data Structure/3 - Trabalhos/Trabalho 01/Código/lista.c | C | www.github.com/harturalcantara/federal-university-of-ceara/tree/main/Data Structure/3 - Trabalhos/Trabalho 01/Código/lista.c | https://raw.githubusercontent.com/harturalcantara/federal-university-of-ceara/9f09380/Data%20Structure/3%20-%20Trabalhos/Trabalho%2001/C%C3%B3digo/lista.c | harturalcantara/federal-university-of-ceara 9f09380 Data Structure/3 - Trabalhos/Trabalho 01/Código/lista.c | true | 200 | 5,084 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "lista.h"
#include "indice.h"
/*
struct paginas{
int pg;
struct paginas *proxPagina;
};
*/
//typedef struct paginas Paginas;
struct nomes{
char nome[100];
struct nomes *proxNome;
Paginas *paginasDoLivro;
};
Nomes* criaNomesNu... | 6 |
parvathipb/CS211_DSA-Lab | 3d9eaa6 | Assignment_1/sample.c | C | www.github.com/parvathipb/CS211_DSA-Lab/tree/main/Assignment_1/sample.c | https://raw.githubusercontent.com/parvathipb/CS211_DSA-Lab/3d9eaa6/Assignment_1/sample.c | parvathipb/CS211_DSA-Lab 3d9eaa6 Assignment_1/sample.c | true | 200 | 1,109 | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<stdbool.h>
void toh(int,char,char,char);
int main(int argc, char *argv[]){
// printf("enter the no.of disks\n");
//scanf("%d",&n);
FILE *f_o;
int n=atoi(argv[1]);
toh(n,'a','b','c');
f_o= fopen("toh.txt","w");//writi... | 3 |
Yoannmey/casse_brique | cc2888c | game.c | C | www.github.com/Yoannmey/casse_brique/tree/main/game.c | https://raw.githubusercontent.com/Yoannmey/casse_brique/cc2888c/game.c | Yoannmey/casse_brique cc2888c game.c | true | 200 | 12,542 | #include "game.h"
#include "function.h"
#include "graph.h"
#include "save.h"
#include "sdl_helper/text_functions.h"
#include "sdl_helper/audio_functions.h"
#include "sdl_helper/constants.h"
#include <SDL2/SDL.h>
#include <unistd.h>
#include <time.h>
#define RAYON 15
#define BRICKLONG 100
#define BRICKHAUT 50
extern ... | 5 |
WBforever/wbn2023 | 7291ced | wbn_3_16.c | C | www.github.com/WBforever/wbn2023/tree/main/wbn_3_16.c | https://raw.githubusercontent.com/WBforever/wbn2023/7291ced/wbn_3_16.c | WBforever/wbn2023 7291ced wbn_3_16.c | true | 200 | 1,137 | #define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
//�ݹ鷽ʽʵ�ִ�ӡһ��������ÿһλ
//void print(int n)
//{
// if (n > 9)
// {
// print(n / 10);
// }
// printf("%d ", n % 10);
//}
//int main()
//{
// int num = 0;
// scanf("%d", &num);
// print(num);
// return 0;
//}
//�ݹ�ͷǵݹ�ֱ�ʵ����n�Ľ׳ˣ���������������⣩
//�ǵݹ�
//int ma... | 7 |
enikeevtg/e_matrix | b90738f | src/determinant.c | C | www.github.com/enikeevtg/e_matrix/tree/main/src/determinant.c | https://raw.githubusercontent.com/enikeevtg/e_matrix/b90738f/src/determinant.c | enikeevtg/e_matrix b90738f src/determinant.c | true | 200 | 1,323 | /**
* @author T. Enikeev
* enikeeev.tg@gmail.com
*/
#include "../e_matrix.h"
int det_calc(matrix_t* A, double* result);
/// @brief matrix determinant calculation main function
/// @param A square matrix pointer
/// @param result deteminant of matrix
/// @return error code: OK 0, INCORRECT_MATRIX 1, CALCULATION_ER... | 4 |
ubonisrael/alx-low_level_programming | 73ece17 | 0x13-more_singly_linked_lists/101-print_listint_safe.c | C | www.github.com/ubonisrael/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/101-print_listint_safe.c | https://raw.githubusercontent.com/ubonisrael/alx-low_level_programming/73ece17/0x13-more_singly_linked_lists/101-print_listint_safe.c | ubonisrael/alx-low_level_programming 73ece17 0x13-more_singly_linked_lists/101-print_listint_safe.c | true | 200 | 1,010 | #include "lists.h"
/**
* free_listptr - frees a listptr_t list
* @head: pointer to head of the list
* Return: void
*/
void free_listptr(listptr_t **head)
{
listptr_t *tmp, *current;
if (head != NULL)
{
current = *head;
while ((tmp = current) != NULL)
{
current = current->next;
free(tmp);
}
*he... | 1 |
CullenFitz/Misophonia | 99e4440 | DSP/Src/audio_processing.c | C | www.github.com/CullenFitz/Misophonia/tree/main/DSP/Src/audio_processing.c | https://raw.githubusercontent.com/CullenFitz/Misophonia/99e4440/DSP/Src/audio_processing.c | CullenFitz/Misophonia 99e4440 DSP/Src/audio_processing.c | true | 200 | 3,262 | /*
* audio_processing.c
*
* Created on: Jan 2, 2024
* Author: cullen fitzgerald
*/
#include "audio_processing.h"
#include <stdio.h>
#define FIR_FILTER_SIZE 16
/*
* Read in data from the audio sample. Store this in the audio buffer
*/
void readWavFile(const char* filename, int16_t* audioBuffer, size_t ... | 0 |
andestech/libvec | de949d6 | statistics/riscv_vec_mse_q31.c | C | www.github.com/andestech/libvec/tree/main/statistics/riscv_vec_mse_q31.c | https://raw.githubusercontent.com/andestech/libvec/de949d6/statistics/riscv_vec_mse_q31.c | andestech/libvec de949d6 statistics/riscv_vec_mse_q31.c | true | 200 | 1,946 | /******************************************************************************
* Copyright (C) 2010-2023 Arm Limited or its affiliates. All rights reserved.*
* Copyright (C) 2018-2023 Andes Technology Corporation. All rights reserved. *
* *
... | 2 |
ManLikeTeetos/alx-low_level_programming | 4e1618c | 0x05-pointers_arrays_strings/2-strlen.c | C | www.github.com/ManLikeTeetos/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/2-strlen.c | https://raw.githubusercontent.com/ManLikeTeetos/alx-low_level_programming/4e1618c/0x05-pointers_arrays_strings/2-strlen.c | ManLikeTeetos/alx-low_level_programming 4e1618c 0x05-pointers_arrays_strings/2-strlen.c | true | 200 | 188 | #include "main.h"
#include <string.h>
/**
*_strlen - returns the length of a string
*@s: pointer to char c
*Return: length
*/
int _strlen(char *s)
{
int d;
d = strlen(s);
return (d);
}
| 6 |
nicoagustinn/scutils | 36db63f | src/deldir.c | C | www.github.com/nicoagustinn/scutils/tree/main/src/deldir.c | https://raw.githubusercontent.com/nicoagustinn/scutils/36db63f/src/deldir.c | nicoagustinn/scutils 36db63f src/deldir.c | true | 200 | 760 | #include <err.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
int rm_path(char *);
static void usage(void);
int main(int argc, char *argv[]) {
int ch, errors; int pflag; pflag = 0;
while ((ch = getopt(argc, argv, "p")) != -1)
switch(ch) {
case 'p':
pflag = 1;
break;
def... | 3 |
SnehilVukkusila/plc-first-year | 7a941e0 | bubsort.c | C | www.github.com/SnehilVukkusila/plc-first-year/tree/main/bubsort.c | https://raw.githubusercontent.com/SnehilVukkusila/plc-first-year/7a941e0/bubsort.c | SnehilVukkusila/plc-first-year 7a941e0 bubsort.c | true | 200 | 789 | #include<stdio.h>
int main()
{
int a,b,c,i,j,n;
printf("Enter the size of the array to be sorted\n");
scanf("%d",&n);
int arr[n];
printf("Enter the elements of the array\n");
for ( i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
printf("The unsorted array is \n");
... | 5 |
maqsoodahmad-1/C_Programs | e58a778 | programs/letusc5.c | C | www.github.com/maqsoodahmad-1/C_Programs/tree/main/programs/letusc5.c | https://raw.githubusercontent.com/maqsoodahmad-1/C_Programs/e58a778/programs/letusc5.c | maqsoodahmad-1/C_Programs e58a778 programs/letusc5.c | true | 200 | 829 | // calculation area and perimeter of a rectangle and area and circumference of a circle
// programmed by maqsood ahmad tali .Dated: 06/06/2021
#include<stdio.h >
#define pi 3.1415
void main ()
{
float length ,breadth , radius ,area_of_rectangle ,area_of_circle ,perimeter_of_rectangle ,circumference_of_circl... | 7 |
BerkeGulmen/LearningC | 4f0305f | 2024/2024-03-06_02.c | C | www.github.com/BerkeGulmen/LearningC/tree/main/2024/2024-03-06_02.c | https://raw.githubusercontent.com/BerkeGulmen/LearningC/4f0305f/2024/2024-03-06_02.c | BerkeGulmen/LearningC 4f0305f 2024/2024-03-06_02.c | true | 200 | 681 | #include <stdio.h>
#include <stdlib.h>
int main (int argc, char **argv, char **envp) {
int a, c, d, e;
printf ("Kaç elemanlı? ");
scanf ("%d", &a);
int b [a];
for (c = 0; c < a; ++ c) {
printf ("%d. elemanı gir: ", c);
scanf ("%d", &b [c]);
}
for (e = 0; e < a; ++ e) {
... | 2 |
Amid68/multithreaded_memory_allocator | 3e0b761 | src/allocator.c | C | www.github.com/Amid68/multithreaded_memory_allocator/tree/main/src/allocator.c | https://raw.githubusercontent.com/Amid68/multithreaded_memory_allocator/3e0b761/src/allocator.c | Amid68/multithreaded_memory_allocator 3e0b761 src/allocator.c | true | 200 | 5,250 | /**
* @file allocator.c
* @brief Memory allocator implementation.
*
* @author Ameed Othman
* @date 30/11/2024
*/
#include "allocator.h"
#include "allocator_internal.h"
#include <stdlib.h>
#include <string.h>
#include <pthread.h>
#include <unistd.h>
#include <sys/mman.h>
// Constants and Macros
#define ALIGNMENT... | 1 |
mauriziominieri/esercizi-c | 7a3c4a1 | Esercizi/Esercizio-13.3/Esercizio-13.3/main.c | C | www.github.com/mauriziominieri/esercizi-c/tree/main/Esercizi/Esercizio-13.3/Esercizio-13.3/main.c | https://raw.githubusercontent.com/mauriziominieri/esercizi-c/7a3c4a1/Esercizi/Esercizio-13.3/Esercizio-13.3/main.c | mauriziominieri/esercizi-c 7a3c4a1 Esercizi/Esercizio-13.3/Esercizio-13.3/main.c | true | 200 | 2,148 | //
// main.c
// Esercizio-13.3
//
// Created by Maurizio Minieri on 17/01/21.
//
/*
Elemento di media massima
Si realizzi un programma in linguaggio C che, data una matrice NxM di interi, trovi l’elemento per cui la media degli elementi ad esso adiacenti sia massima. Si stampino le coordinate di tale elemento ed il... | 0 |
os0021/alx-low_level_programming | 4a76a4d | 0x01-variables_if_else_while/0-positive_or_negative.c | C | www.github.com/os0021/alx-low_level_programming/tree/main/0x01-variables_if_else_while/0-positive_or_negative.c | https://raw.githubusercontent.com/os0021/alx-low_level_programming/4a76a4d/0x01-variables_if_else_while/0-positive_or_negative.c | os0021/alx-low_level_programming 4a76a4d 0x01-variables_if_else_while/0-positive_or_negative.c | true | 200 | 447 | #include <stdlib.h>
#include <time.h>
#include <stdio.h>
/**
* main - assigns a random number to int n everytime
*
* Return: Always 0 (Success)
*/
int main(void)
{
int n;
srand(time(0));
n = rand() - RAND_MAX / 2;
if (n > 0)
printf("%d is positive\n", n);
else if (n == 0)
... | 4 |
io-club/2022-c | 68a1970 | code/class3/vector.c | C | www.github.com/io-club/2022-c/tree/main/code/class3/vector.c | https://raw.githubusercontent.com/io-club/2022-c/68a1970/code/class3/vector.c | io-club/2022-c 68a1970 code/class3/vector.c | true | 200 | 837 | #include <stdio.h>
#include <stdlib.h>
typedef struct Vector {
int cap;
int len;
char *inner;
void (*push)(struct Vector *, char elem);
} Vector;
void vec_push(Vector *vec, char elem) {
if (vec->len == vec->cap) {
vec->inner = realloc(vec->inner, vec->cap * 2);
vec->cap *= 2;
}
vec->inner[vec->l... | 6 |
Kinyikamwamburi/alx-low_level_programming | eac4958 | 0x05-pointers_arrays_strings/5-main.c | C | www.github.com/Kinyikamwamburi/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/5-main.c | https://raw.githubusercontent.com/Kinyikamwamburi/alx-low_level_programming/eac4958/0x05-pointers_arrays_strings/5-main.c | Kinyikamwamburi/alx-low_level_programming eac4958 0x05-pointers_arrays_strings/5-main.c | true | 200 | 236 | #include "main.h"
#include <stdio.h>
/**
* main - check the code
*
* Return: Always 0.
*/
int main(void)
{
char s[10] = "My School";
printf("%s\n", s);
rev_string(s);
printf("%s\n", s);
return (0);
}
| 3 |
Ramix76/Minishell | 386063c | src/parse/syntax_parenthesis.c | C | www.github.com/Ramix76/Minishell/tree/main/src/parse/syntax_parenthesis.c | https://raw.githubusercontent.com/Ramix76/Minishell/386063c/src/parse/syntax_parenthesis.c | Ramix76/Minishell 386063c src/parse/syntax_parenthesis.c | true | 200 | 2,707 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* syntax_parenthesis.c :+: :+: :+: ... | 5 |
DEV-Shaozi/alx-low_level_programming | c1a2049 | 0x0B-malloc_free/3-alloc_grid.c | C | www.github.com/DEV-Shaozi/alx-low_level_programming/tree/main/0x0B-malloc_free/3-alloc_grid.c | https://raw.githubusercontent.com/DEV-Shaozi/alx-low_level_programming/c1a2049/0x0B-malloc_free/3-alloc_grid.c | DEV-Shaozi/alx-low_level_programming c1a2049 0x0B-malloc_free/3-alloc_grid.c | true | 200 | 644 | #include "main.h"
#include <stdlib.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 **mee;
int x, y;
if (width <= 0 || height <= 0)
return (NULL);
mee = malloc(sizeof(int *) * heigh... | 7 |
Aerlany/My_MarkDown_File | 21e89df | 计算机操作系统/ExampleCode/11-Message_Queues_Receive.c | C | www.github.com/Aerlany/My_MarkDown_File/tree/main/计算机操作系统/ExampleCode/11-Message_Queues_Receive.c | https://raw.githubusercontent.com/Aerlany/My_MarkDown_File/21e89df/%E8%AE%A1%E7%AE%97%E6%9C%BA%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F/ExampleCode/11-Message_Queues_Receive.c | Aerlany/My_MarkDown_File 21e89df 计算机操作系统/ExampleCode/11-Message_Queues_Receive.c | true | 200 | 833 | #include <fcntl.h>
#include <mqueue.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <sys/stat.h>
#include <sys/types.h>
int main(int argc, char *argv[]) {
mqd_t queue;
struct mq_attr attrs;
char *msg_ptr;
ssize_t recvd;
size_t i;
if (argc < 2) {
puts("ERROR");
}
queue = mq_o... | 4 |
YogitaBhagatni/Cafeteria-Management-System-Project | 934eab7 | cafecode.c | C | www.github.com/YogitaBhagatni/Cafeteria-Management-System-Project/tree/main/cafecode.c | https://raw.githubusercontent.com/YogitaBhagatni/Cafeteria-Management-System-Project/934eab7/cafecode.c | YogitaBhagatni/Cafeteria-Management-System-Project 934eab7 cafecode.c | true | 200 | 1,215 | #include<stdio.h>
#include<conio.h>
int main()
{
int Momos,Frenchfries,Manchurian,Pizza,n=0,i,sum=0;
Momos=1;
Frenchfries=2;
Manchurian=3;
Pizza=4;
printf("\n\t\tWELCOME TO CURIOUS CAFE!");
printf("\n\n\t\t******MENU*****\n");
printf("\n\t1.Momos Rs.100\n\t2.Frenchfries Rs.70\n\t3.Manchurian Rs.90\n\t4.Pizza... | 2 |
Guk0/AlgorithmStudy | 7f8cb13 | week3/changkim/test.c | C | www.github.com/Guk0/AlgorithmStudy/tree/main/week3/changkim/test.c | https://raw.githubusercontent.com/Guk0/AlgorithmStudy/7f8cb13/week3/changkim/test.c | Guk0/AlgorithmStudy 7f8cb13 week3/changkim/test.c | true | 200 | 199 | #include <stdio.h>
#include <string.h>
#include <math.h>
int main(void)
{
int n;
int t;
n = 7;
t = 2;
double result = (double)n / (double)t;
printf("%d\n%d\n", n, t);
printf("%f", result);
} | 1 |
AguineloP/AP1 | ec07700 | Lista 2/desconto.c | C | www.github.com/AguineloP/AP1/tree/main/Lista 2/desconto.c | https://raw.githubusercontent.com/AguineloP/AP1/ec07700/Lista%202/desconto.c | AguineloP/AP1 ec07700 Lista 2/desconto.c | true | 200 | 633 | #include <stdio.h>
int main()
{
float produto, porcentagem;
printf("digite o valor inicial do produto e o desconto que será aplicado nele:\n");
scanf("%f %f", &produto, &porcentagem);
//conferindo se o produto ou o desconto não assumem valores negativos
if(produto < 0 || porcentagem < 0){
printf("... | 0 |
billy-hipps/Shortest-Vector-Problem-Solution | 6af3ecf | code/checkArgs.c | C | www.github.com/billy-hipps/Shortest-Vector-Problem-Solution/tree/main/code/checkArgs.c | https://raw.githubusercontent.com/billy-hipps/Shortest-Vector-Problem-Solution/6af3ecf/code/checkArgs.c | billy-hipps/Shortest-Vector-Problem-Solution 6af3ecf code/checkArgs.c | true | 200 | 577 | #include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include "checkArgs.h"
// Checks if the number of arguments is valid
int checkArgs(int argc) {
int nUnits = argc - 1;
int root = (int)sqrt((double)nUnits);
int root2 = root * root;
// Dimension must be > 2
if (nUnits < 4) {
printf("I... | 6 |
feupee/UFU | 0f8ae62 | Programacao Procedimental - C/Lista 06/Ex12.c | C | www.github.com/feupee/UFU/tree/main/Programacao Procedimental - C/Lista 06/Ex12.c | https://raw.githubusercontent.com/feupee/UFU/0f8ae62/Programacao%20Procedimental%20-%20C/Lista%2006/Ex12.c | feupee/UFU 0f8ae62 Programacao Procedimental - C/Lista 06/Ex12.c | true | 200 | 1,932 | #include<stdio.h>
#include<stdlib.h>
#include<time.h>
struct baralho{
int carta[52]; //Cada carta é interpretada como un número inteiro
};
int main(){
struct baralho b, scr;
int i, k, aux;
srand(time(NULL));
for(i=0; i<52; i++){
b.carta[i]=0;
}
for(i=0; i<52; i++){
aux=rand... | 3 |
TDSn3/philosophers | 7c77de3 | source/init.c | C | www.github.com/TDSn3/philosophers/tree/main/source/init.c | https://raw.githubusercontent.com/TDSn3/philosophers/7c77de3/source/init.c | TDSn3/philosophers 7c77de3 source/init.c | true | 200 | 2,961 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* init.c :+: :+: :+: ... | 5 |
days0102/Los | 55ae85d | kernel/exec.c | C | www.github.com/days0102/Los/tree/main/kernel/exec.c | https://raw.githubusercontent.com/days0102/Los/55ae85d/kernel/exec.c | days0102/Los 55ae85d kernel/exec.c | true | 200 | 2,103 | /*
* @Author : Outsider
* @Date : 2022-08-14 13:42:37
* @LastEditors : Outsider
* @LastEditTime : 2023-08-01 11:16:26
* @Description : In User Settings Edit
* @FilePath : /los/kernel/exec.c
*/
#include "types.h"
#include "proc.h"
#include "defs.h"
#include "elf.h"
#include "fs.h"
#include "vm... | 7 |
TurboPing/C_Simple_Documentation | 3c73be1 | windows/Hosts/Hosts.c | C | www.github.com/TurboPing/C_Simple_Documentation/tree/main/windows/Hosts/Hosts.c | https://raw.githubusercontent.com/TurboPing/C_Simple_Documentation/3c73be1/windows/Hosts/Hosts.c | TurboPing/C_Simple_Documentation 3c73be1 windows/Hosts/Hosts.c | true | 200 | 2,581 | /* Host.c */
#include <stdio.h>
#include <stdarg.h>
#include <stdlib.h>
#include <winsock.h>
#include <windows.h>
int
InitialiseWinSockDLL()
{
int err;
/* check the WinSock DLL */
WORD wVersionRequested;
WSADATA wsaData; /* structure of IPC Networkprogramming */
/* The MAKEWORD macro creates an unsi... | 4 |
KindarkhediyaKhushbu/ASSIGEMENT | 994bf82 | C-LANG/pro46.c | C | www.github.com/KindarkhediyaKhushbu/ASSIGEMENT/tree/main/C-LANG/pro46.c | https://raw.githubusercontent.com/KindarkhediyaKhushbu/ASSIGEMENT/994bf82/C-LANG/pro46.c | KindarkhediyaKhushbu/ASSIGEMENT 994bf82 C-LANG/pro46.c | true | 200 | 334 | //WAP to find minimum number among 3 numbers using ternary operator
#include<stdio.h>
int main()
{
int num1,num2,num3;
printf("enter three number: ");
scanf("%d %d %d",&num1,&num2,&num3);
int min=(num1<num2)?((num1<num3)?num1:num3):((num2<num3)?num2:num3);
printf("the minimum number is: %d\n",min... | 2 |
Taki157/Praktikum-Alpro | ddb86e8 | 01_InOut/gayaSentr.c | C | www.github.com/Taki157/Praktikum-Alpro/tree/main/01_InOut/gayaSentr.c | https://raw.githubusercontent.com/Taki157/Praktikum-Alpro/ddb86e8/01_InOut/gayaSentr.c | Taki157/Praktikum-Alpro ddb86e8 01_InOut/gayaSentr.c | true | 200 | 632 | //Nama File : gayaSentr
//Deskripsi : Menghitung Gaya Sentripetal
//Pembuat : Syafiq Abiyyu Taqi
//Tanggal Pembuatan : Kamis, 21 Februari 2024
#include <stdio.h>
#include <stdlib.h>
int main(){
/*Kamus Lokal*/
int m,v,r;
float F;
/*Algoritma*/
printf("=====Menghitung Gay... | 0 |
Yan6425/CYTECH | 3e3a88a | morpion.c | C | www.github.com/Yan6425/CYTECH/tree/main/morpion.c | https://raw.githubusercontent.com/Yan6425/CYTECH/3e3a88a/morpion.c | Yan6425/CYTECH 3e3a88a morpion.c | true | 200 | 4,253 | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
typedef struct Joueur {
char prenom[30];
int age;
int existe;
char symbole;
} Joueur;
Joueur creerJoueur(int nJoueur){
Joueur joueur;
char symboles[2] = {'X', 'O'};
printf("Joueur %d saisie ton prénom : ", nJoueur);
scanf("%s",... | 1 |
okiokwiri/ThrowTheSwitch | b5e7c96 | Logger/test/TestCommandHandlers.c | C | www.github.com/okiokwiri/ThrowTheSwitch/tree/main/Logger/test/TestCommandHandlers.c | https://raw.githubusercontent.com/okiokwiri/ThrowTheSwitch/b5e7c96/Logger/test/TestCommandHandlers.c | okiokwiri/ThrowTheSwitch b5e7c96 Logger/test/TestCommandHandlers.c | true | 200 | 6,221 | #include "unity.h"
#include "MockTimer.h"
#include "MockCapture.h"
#include "CommandHandlers.h"
#include "MockTrigger.h"
static uint8_t Seq[] = { 1, 2, 3, 4, 5, 6, 7, 8 };
void setUp(void)
{
}
void tearDown(void)
{
}
void test_CommandHandlerClock_should_GetTimeStamp_when_Empty(void)
{
MESSAGE_T Msg;
Msg.Cmd = 'C';... | 6 |
suzzannah/alx-low_level_programming | 3183106 | 0x01-variables_if_else_while/2-print_alphabet.c | C | www.github.com/suzzannah/alx-low_level_programming/tree/main/0x01-variables_if_else_while/2-print_alphabet.c | https://raw.githubusercontent.com/suzzannah/alx-low_level_programming/3183106/0x01-variables_if_else_while/2-print_alphabet.c | suzzannah/alx-low_level_programming 3183106 0x01-variables_if_else_while/2-print_alphabet.c | true | 200 | 240 | #include <stdio.h>
/**
* main - A program that Prints the alphabet in lowercase.
*
* Return: Always 0.
*/
int main(void)
{
char letter;
for (letter = 'a'; letter <= 'z'; letter++)
putchar(letter);
putchar('\n');
return (0);
}
| 3 |
DuyThaiNgx/Network_Programming | 7c7666c | BTVN01_20230411/Ex4/sv_server.c | C | www.github.com/DuyThaiNgx/Network_Programming/tree/main/BTVN01_20230411/Ex4/sv_server.c | https://raw.githubusercontent.com/DuyThaiNgx/Network_Programming/7c7666c/BTVN01_20230411/Ex4/sv_server.c | DuyThaiNgx/Network_Programming 7c7666c BTVN01_20230411/Ex4/sv_server.c | true | 200 | 2,413 | #include <stdio.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <unistd.h>
#include <netdb.h>
#include <string.h>
#include <arpa/inet.h>
#include <stdlib.h>
#include <netinet/in.h>
#include <time.h>
int main(int argc, char const *argv[]){
int listener = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);
i... | 5 |
Kevinjnr/alx-low_level_programming | 67e9e81 | 0x06-pointers_arrays_strings/100-rot13.c | C | www.github.com/Kevinjnr/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/100-rot13.c | https://raw.githubusercontent.com/Kevinjnr/alx-low_level_programming/67e9e81/0x06-pointers_arrays_strings/100-rot13.c | Kevinjnr/alx-low_level_programming 67e9e81 0x06-pointers_arrays_strings/100-rot13.c | true | 200 | 463 | #include "main.h"
#include <stdio.h>
/**
* rot13 - encoder rot13
* @s: pointer to string params
* Return: *s
*/
char *rot13(char *s)
{
int x;
int y;
char data1[] =
"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
char datarot[] =
"NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm";
for (x = 0; s... | 7 |
AshwinDesai1/DS | b25e080 | pro15.c | C | www.github.com/AshwinDesai1/DS/tree/main/pro15.c | https://raw.githubusercontent.com/AshwinDesai1/DS/b25e080/pro15.c | AshwinDesai1/DS b25e080 pro15.c | true | 200 | 4,393 | #include <stdio.h>
#include <stdlib.h>
struct Node {
int data;
struct Node *l, *r;
};
// Iterative Insert Function
struct Node* Insert(struct Node* root, int ele) {
struct Node *newNode = (struct Node*)malloc(sizeof(struct Node));
struct Node *curr = root, *prev = NULL;
if (newNode =... | 2 |
Figuejojo/CatchObj_Game | 27d5993 | include/amio_functions.c | C | www.github.com/Figuejojo/CatchObj_Game/tree/main/include/amio_functions.c | https://raw.githubusercontent.com/Figuejojo/CatchObj_Game/27d5993/include/amio_functions.c | Figuejojo/CatchObj_Game 27d5993 include/amio_functions.c | true | 200 | 22,278 | /* amio_functions.c defines the implementations of the
wrapper functions which hide
complexities of allegro. This is done so that many of the complexities
of C are hidden from the beginner.
Author: Cameron Harwood, School of Physics, Engineering and Technology
University of York, Nov 2022.
Notes:
... | 4 |
Pooja831-dev/C-Programs | 2841624 | program74.c | C | www.github.com/Pooja831-dev/C-Programs/tree/main/program74.c | https://raw.githubusercontent.com/Pooja831-dev/C-Programs/2841624/program74.c | Pooja831-dev/C-Programs 2841624 program74.c | true | 200 | 271 | #include <stdio.h>
#include <stdlib.h>
int main()
{
int iLength = 0;
int *ptr = NULL;
printf("Enter the number of elements :\n");
scanf("%d",&iLength);
ptr = (int *)malloc(iLength * sizeof(int));
free(ptr);
return 0;
} | 0 |
Jagadeesh7989/my-coding-program | bb2c59b | fact.c | C | www.github.com/Jagadeesh7989/my-coding-program/tree/main/fact.c | https://raw.githubusercontent.com/Jagadeesh7989/my-coding-program/bb2c59b/fact.c | Jagadeesh7989/my-coding-program bb2c59b fact.c | true | 200 | 220 | #include <stdio.h>
int main() {
int f,n;
scanf("%d",&n);
f=fact(n);
printf("the factorial of %d is:%d",n,f);
}
int fact(int n){
if(n==1)
return 1;
else
return n*fact(n-1);
}
| 1 |
hun01222/Data_Structure-Algorithm | 2454ffe | Algorithm/Sorting/quick sotr1.c | C | www.github.com/hun01222/Data_Structure-Algorithm/tree/main/Algorithm/Sorting/quick sotr1.c | https://raw.githubusercontent.com/hun01222/Data_Structure-Algorithm/2454ffe/Algorithm/Sorting/quick%20sotr1.c | hun01222/Data_Structure-Algorithm 2454ffe Algorithm/Sorting/quick sotr1.c | true | 200 | 1,021 | #include <stdio.h>
#define SWAP(x, y, temp) ((temp) = (x), (x) = (y), (y) = (temp))
int partition(int list[], int left, int right)
{
int pivot, temp;
int low, high;
low = left;
high = right + 1;
pivot = list[left];
do
{
do
{
low++;
} while (low <= right... | 6 |
Aarohi-Sharma/Practice-code-C | 0e84bc4 | questions/array_sum.c | C | www.github.com/Aarohi-Sharma/Practice-code-C/tree/main/questions/array_sum.c | https://raw.githubusercontent.com/Aarohi-Sharma/Practice-code-C/0e84bc4/questions/array_sum.c | Aarohi-Sharma/Practice-code-C 0e84bc4 questions/array_sum.c | true | 200 | 383 | #include<stdio.h>
int main(){
int n, arr[100];
printf("Enter size of array:");
scanf("%d", &n);
printf("Enter elements:\n");
for (int i = 0; i < n; i++) {
printf("Element %d:", i + 1);
scanf("%d", &arr[i]);
}
int sum=0;
for (int i = 0; i < n; i++) {
sum+=arr[i];
... | 3 |
OddRon1/alx-low_level_programming | 33792fc | 0x14-bit_manipulation/0-binary_to_uint.c | C | www.github.com/OddRon1/alx-low_level_programming/tree/main/0x14-bit_manipulation/0-binary_to_uint.c | https://raw.githubusercontent.com/OddRon1/alx-low_level_programming/33792fc/0x14-bit_manipulation/0-binary_to_uint.c | OddRon1/alx-low_level_programming 33792fc 0x14-bit_manipulation/0-binary_to_uint.c | true | 200 | 462 | #include "main.h"
#include <stdio.h>
/**
* binary_to_uint - this converts a binary digit to an unsigned int
* @b: this is the string that contains the binary digit
*
* Return: this returns the converted digit
*/
unsigned int binary_to_uint(const char *b)
{
int a;
unsigned int dec_val = 0;
if (!b)
return (0)... | 5 |
farahmc/holbertonschool-low_level_programming | 0fb0434 | 0x01-variables_if_else_while/1-last_digit.c | C | www.github.com/farahmc/holbertonschool-low_level_programming/tree/main/0x01-variables_if_else_while/1-last_digit.c | https://raw.githubusercontent.com/farahmc/holbertonschool-low_level_programming/0fb0434/0x01-variables_if_else_while/1-last_digit.c | farahmc/holbertonschool-low_level_programming 0fb0434 0x01-variables_if_else_while/1-last_digit.c | true | 200 | 820 | #include <stdlib.h>
#include <time.h>
#include <stdio.h>
/**
*main - Defines main can only be called without any parameters
*
*Description: int n defines n as random variable
*lastn defines the last digit of the random variable
*if function to print the last digit of random variable and define if it is
*larger than 5,... | 7 |
Njine/binary_trees | f086e08 | 1-binary_tree_insert_left.c | C | www.github.com/Njine/binary_trees/tree/main/1-binary_tree_insert_left.c | https://raw.githubusercontent.com/Njine/binary_trees/f086e08/1-binary_tree_insert_left.c | Njine/binary_trees f086e08 1-binary_tree_insert_left.c | true | 200 | 837 | #include "binary_trees.h"
/**
* binary_tree_insert_left - Insert a node as the left-child of another node
*
* @parentNode: Pointer to the node to insert the left-child in
* @value: Value to store in the new node
* Return: Pointer to the created node, or NULL on failure or if parent is NULL
*/
binary_tree_t *bina... | 2 |
taehoy/malloc-lab | a56d0a5 | mm.c | C | www.github.com/taehoy/malloc-lab/tree/main/mm.c | https://raw.githubusercontent.com/taehoy/malloc-lab/a56d0a5/mm.c | taehoy/malloc-lab a56d0a5 mm.c | true | 200 | 6,451 | /*
* mm-naive.c - The fastest, least memory-efficient malloc package.
*
* In this naive approach, a block is allocated by simply incrementing
* the brk pointer. A block is pure payload. There are no headers or
* footers. Blocks are never coalesced or reused. Realloc is
* implemented directly using mm_malloc an... | 4 |
Damarice/alx-low_level_programming | 758fbca | 0x17-doubly_linked_lists/3-add_dnodeint_end.c | C | www.github.com/Damarice/alx-low_level_programming/tree/main/0x17-doubly_linked_lists/3-add_dnodeint_end.c | https://raw.githubusercontent.com/Damarice/alx-low_level_programming/758fbca/0x17-doubly_linked_lists/3-add_dnodeint_end.c | Damarice/alx-low_level_programming 758fbca 0x17-doubly_linked_lists/3-add_dnodeint_end.c | true | 200 | 1,010 | /*
*
* * File: 3-add_dnodeint_end.c
*
* * Auth: Brennan D Baraban
*
* */
#include "lists.h"
/**
*
* * add_dnodeint_end - Adds a new node at the end of a dlistint_t list.
*
* * @head: A pointer to the head of the dlistint_t list.
*
* * @n: The integer for the new node to contain.
*
* ... | 0 |
productivesa/binary_trees | 3909a5e | 101-binary_tree_levelorder.c | C | www.github.com/productivesa/binary_trees/tree/main/101-binary_tree_levelorder.c | https://raw.githubusercontent.com/productivesa/binary_trees/3909a5e/101-binary_tree_levelorder.c | productivesa/binary_trees 3909a5e 101-binary_tree_levelorder.c | true | 200 | 1,194 | #include "binary_trees.h"
/**
* recursive_height - measures the height of a binary tree
*
* @tree: tree root
* Return: height
*/
size_t recursive_height(const binary_tree_t *tree)
{
size_t le = 0;
size_t ri = 0;
if (tree == NULL)
return (0);
le = recursive_height(tree->left);
ri = recursive_height(tree->... | 1 |
fuzzylogic123/FIT2100 | 7f1d288 | Labs/LAB01/Task2.c | C | www.github.com/fuzzylogic123/FIT2100/tree/main/Labs/LAB01/Task2.c | https://raw.githubusercontent.com/fuzzylogic123/FIT2100/7f1d288/Labs/LAB01/Task2.c | fuzzylogic123/FIT2100 7f1d288 Labs/LAB01/Task2.c | true | 200 | 225 | // /∗ task2.c ∗/
#include <stdio.h>
int main()
{
char string[10]; // Initialise our string
printf("Enter a word , up to 10 characters long : ");
scanf("%s", string);
printf("You entered %s\n", string);
}
| 6 |
taka-code888/ossanaction | b154d5c | ossannoboken/Classes/Native/Il2CppMetadataRegistration.c | C | www.github.com/taka-code888/ossanaction/tree/main/ossannoboken/Classes/Native/Il2CppMetadataRegistration.c | https://raw.githubusercontent.com/taka-code888/ossanaction/b154d5c/ossannoboken/Classes/Native/Il2CppMetadataRegistration.c | taka-code888/ossanaction b154d5c ossannoboken/Classes/Native/Il2CppMetadataRegistration.c | true | 200 | 1,089 | #include "il2cpp-config.h"
#ifndef _MSC_VER
# include <alloca.h>
#else
# include <malloc.h>
#endif
#include "codegen/il2cpp-codegen-metadata.h"
IL2CPP_EXTERN_C_BEGIN
IL2CPP_EXTERN_C_END
extern Il2CppGenericClass* const s_Il2CppGenericTypes[];
extern const Il2CppGenericInst* const g_Il2CppGenericInstTable[... | 3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.