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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
aya20044/c_programmingset1 | a239bff | set2/problem_set210/main.c | C | www.github.com/aya20044/c_programmingset1/tree/main/set2/problem_set210/main.c | https://raw.githubusercontent.com/aya20044/c_programmingset1/a239bff/set2/problem_set210/main.c | aya20044/c_programmingset1 a239bff set2/problem_set210/main.c | true | 200 | 929 | #include <stdio.h>
int main ()
{
// This program mimics the system of logging on any website, asking the user to enter his/her ID and id the ID exists asking for the password
// giving the 3 tries only.
int userID , userPass;
printf(" Enter Your ID:\n");
do
{
scanf("%d",&userID)... | 4 |
weioncrypto/C-learning | 66aac4b | LeetCode/Medium/034. Find First and Last Position of Element in Sorted Array.c | C | www.github.com/weioncrypto/C-learning/tree/main/LeetCode/Medium/034. Find First and Last Position of Element in Sorted Array.c | https://raw.githubusercontent.com/weioncrypto/C-learning/66aac4b/LeetCode/Medium/034.%20Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array.c | weioncrypto/C-learning 66aac4b LeetCode/Medium/034. Find First and Last Position of Element in Sorted Array.c | true | 200 | 3,018 | /*
Runtime: 14 ms, faster than 48.85% of C online submissions for Find First and Last Position of Element in Sorted Array.
Memory Usage: 7.7 MB, less than 11.17% of C online submissions for Find First and Last Position of Element in Sorted Array.
*/
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b)... | 0 |
RakeshDesale/C-Programming | be159ce | Logic-Based-Programming/LBP-061/solution4.c | C | www.github.com/RakeshDesale/C-Programming/tree/main/Logic-Based-Programming/LBP-061/solution4.c | https://raw.githubusercontent.com/RakeshDesale/C-Programming/be159ce/Logic-Based-Programming/LBP-061/solution4.c | RakeshDesale/C-Programming be159ce Logic-Based-Programming/LBP-061/solution4.c | true | 200 | 544 | # Using Function and Using Constraints
# Solution:
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int checkBoard(char[]);
int main() {
char str[20];
scanf("%s",str);
if(strlen(str)==2)
printf((checkBoard(str))?"true":"false");
else
exit(0);
return 0;... | 5 |
Lakshitha1818/ADA | 5c9cfe4 | heapsort.c | C | www.github.com/Lakshitha1818/ADA/tree/main/heapsort.c | https://raw.githubusercontent.com/Lakshitha1818/ADA/5c9cfe4/heapsort.c | Lakshitha1818/ADA 5c9cfe4 heapsort.c | true | 200 | 1,542 | #include <stdio.h>
#include <stdlib.h>
#include<time.h>
void heapify(int arr[100], int n, int i) {
int max, left, right, temp;
max = i;
left = 2 * i + 1;
right = 2 * i + 2;
if (left < n && arr[left] > arr[max]) {
max = left;
}
if (right < n && arr[right] > arr[max]) {
... | 2 |
TheBigEye/Monarch-OS | 3c4bbe6 | source/kernel/bugfault.c | C | www.github.com/TheBigEye/Monarch-OS/tree/main/source/kernel/bugfault.c | https://raw.githubusercontent.com/TheBigEye/Monarch-OS/3c4bbe6/source/kernel/bugfault.c | TheBigEye/Monarch-OS 3c4bbe6 source/kernel/bugfault.c | true | 200 | 7,125 | #include "bugfault.h"
#include "CPU/ISR/ISR.h"
#include "CPU/PIT/timer.h"
#include "CPU/HAL.h"
#include "drivers/TTY/console.h"
#include "modules/terminal.h"
#include "drivers/speaker.h"
#include "drivers/power.h"
#include "binaries.h"
/**
* If you're reading this, it's because you've probably broken something and... | 6 |
Landriou/prog-paralela | c57e739 | paralelasTP36/main.c | C | www.github.com/Landriou/prog-paralela/tree/main/paralelasTP36/main.c | https://raw.githubusercontent.com/Landriou/prog-paralela/c57e739/paralelasTP36/main.c | Landriou/prog-paralela c57e739 paralelasTP36/main.c | true | 200 | 1,204 | #include <stdio.h>
#include <pthread.h>
#include <stdlib.h>
#define NUMBERTHREADS 8
#define LENTHARRAY 16
int total = 0;
int vector[LENTHARRAY] = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16};
struct numbers{
int first;
int last;
};
void sumar(void *received_struct) {
struct numbers *numbersObject = (struct n... | 3 |
rooneyeno/alx-low_level_programming | 1077750 | 0x18-dynamic_libraries/3-strcmp.c | C | www.github.com/rooneyeno/alx-low_level_programming/tree/main/0x18-dynamic_libraries/3-strcmp.c | https://raw.githubusercontent.com/rooneyeno/alx-low_level_programming/1077750/0x18-dynamic_libraries/3-strcmp.c | rooneyeno/alx-low_level_programming 1077750 0x18-dynamic_libraries/3-strcmp.c | true | 200 | 444 | #include "main.h"
/**
* _strcmp - compares two strings
* @s1: string 1
* @s2: string 2
* Return: 0 if matching, and ns1 - ns2 if not matching
*/
int _strcmp(char *s1, char *s2)
{
int i;
/**
* We have reached the end of S1 OR we have reached the end of S2
*/
for (i = 0; s1[i] !=... | 7 |
sopyansyauri/searching | 9ddde10 | main.c | C | www.github.com/sopyansyauri/searching/tree/main/main.c | https://raw.githubusercontent.com/sopyansyauri/searching/9ddde10/main.c | sopyansyauri/searching 9ddde10 main.c | true | 200 | 742 | #include <cs50.h>
#include <stdio.h>
#include <string.h>
#include <ctype.h>
int main(int argc, char** argv) {
string names[] = {"syauri","sopyan", "putri", "siti", "zahra", "susi"};
string cari = get_string("Cari Nama: ");
for (int i = 0; i < sizeof(names) / sizeof(string); i++) {
if (strcmp(cari, ... | 1 |
wil-mus/alx-low_level_programming | 565a1da | 0x06-pointers_arrays_strings/2-strncpy.c | C | www.github.com/wil-mus/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/2-strncpy.c | https://raw.githubusercontent.com/wil-mus/alx-low_level_programming/565a1da/0x06-pointers_arrays_strings/2-strncpy.c | wil-mus/alx-low_level_programming 565a1da 0x06-pointers_arrays_strings/2-strncpy.c | true | 200 | 354 | #include "main.h"
#include <stddef.h>
/**
* _strncpy - copies string
* @dest: destination
* @src: source
*@n: paramater
*
*Return: dest
*/
char *_strncpy(char *dest, char *src, int n)
{
size_t a;
for (a = 0; a < (size_t)n && src[a] != '\0'; a++)
{
dest[a] = src[a];
}
for (; a < (size_t)n; a++)
{
des... | 4 |
shinde-dipak/Programs | 42f84b4 | Program5.c | C | www.github.com/shinde-dipak/Programs/tree/main/Program5.c | https://raw.githubusercontent.com/shinde-dipak/Programs/42f84b4/Program5.c | shinde-dipak/Programs 42f84b4 Program5.c | true | 200 | 449 | #include<stdio.h>
int main()
{
int iNo1 = 0;
int iNo2 = 0;
int iMult = 0;
printf("Enter First Number : \n");
scanf("%d",&iNo1);
printf("Enter Second Number : \n");
scanf("%d",&iNo2);
printf("First number is : %d\n",iNo1);
printf("Second number is : %d\n",iNo2);
... | 0 |
merituulie/fdf | b4b226d | src/map/dimension.c | C | www.github.com/merituulie/fdf/tree/main/src/map/dimension.c | https://raw.githubusercontent.com/merituulie/fdf/b4b226d/src/map/dimension.c | merituulie/fdf b4b226d src/map/dimension.c | true | 200 | 2,008 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* dimension.c :+: :+: :+: ... | 2 |
LtMtrunG/Assigment2-EEET2490 | f95390f | src/uart.h | C | www.github.com/LtMtrunG/Assigment2-EEET2490/tree/main/src/uart.h | https://raw.githubusercontent.com/LtMtrunG/Assigment2-EEET2490/f95390f/src/uart.h | LtMtrunG/Assigment2-EEET2490 f95390f src/uart.h | true | 200 | 9,386 | // -----------------------------------uart.h -------------------------------------
/* PL011 UART (UART0) registers */
#define UART0_BASE (MMIO_BASE + 0x201000)
/* DR = Data register */
#define UART0_DR (* (volatile unsigned int*)(UART0_BASE + 0x00))
/* On write, write 8-bits to send */
/* On receive, get 12-bits: ... | 7 |
IbrahimHindawi/spaceshooter | ababa32 | source/shops.c | C | www.github.com/IbrahimHindawi/spaceshooter/tree/main/source/shops.c | https://raw.githubusercontent.com/IbrahimHindawi/spaceshooter/ababa32/source/shops.c | IbrahimHindawi/spaceshooter ababa32 source/shops.c | true | 200 | 1,740 | #include "shops.h"
void shader_compile_check(u32 shader) {
int success;
char info_log[512];
glGetShaderiv(shader, GL_COMPILE_STATUS, &success);
if (!success) {
glGetShaderInfoLog(shader, 512, NULL, info_log);
printf("shader compile error:\n%s", info_log);
}
}
void shader_link_check... | 6 |
maryamehilali/alx-low_level_programming | 29071ee | 0x1A-hash_tables/0-hash_table_create.c | C | www.github.com/maryamehilali/alx-low_level_programming/tree/main/0x1A-hash_tables/0-hash_table_create.c | https://raw.githubusercontent.com/maryamehilali/alx-low_level_programming/29071ee/0x1A-hash_tables/0-hash_table_create.c | maryamehilali/alx-low_level_programming 29071ee 0x1A-hash_tables/0-hash_table_create.c | true | 200 | 640 | #include "hash_tables.h"
/**
* hash_table_create - function that creates a hash table
* @size: the size of the hash table
* Return: pointer to the created hash table
*/
hash_table_t *hash_table_create(unsigned long int size)
{
hash_table_t *hash = malloc(sizeof(hash_table_t));
unsigned long int i;
if (hash == N... | 4 |
kubapoke/casual-programming | 8d96638 | C/lotto.c | C | www.github.com/kubapoke/casual-programming/tree/main/C/lotto.c | https://raw.githubusercontent.com/kubapoke/casual-programming/8d96638/C/lotto.c | kubapoke/casual-programming 8d96638 C/lotto.c | true | 200 | 826 | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define MAX_VAL 49
void reset(int* vals)
{
for(int i = 0; i < MAX_VAL; i++)
vals[i] = i + 1;
}
void shuffle(int* vals)
{
int temp, r;
for(int i = MAX_VAL; i > 0; i--)
{
r = rand() % i;
temp = vals[i - 1];
vals[i -... | 1 |
nikhilmole/Problem-Statement-Using-C-2 | d5f45b2 | LBAssignment21_5.c | C | www.github.com/nikhilmole/Problem-Statement-Using-C-2/tree/main/LBAssignment21_5.c | https://raw.githubusercontent.com/nikhilmole/Problem-Statement-Using-C-2/d5f45b2/LBAssignment21_5.c | nikhilmole/Problem-Statement-Using-C-2 d5f45b2 LBAssignment21_5.c | true | 200 | 810 | #include<stdio.h>
#include<stdlib.h>
int Product(int Arr[], int iLength)
{
int i = 0;
int iPro = 1;
for(i = 0; i< iLength; i++)
{
if((Arr[i] % 2) != 0)
{
iPro = iPro * Arr[i];
}
}
return iPro;
}
int main()
{
int iCnt = 0;
int ... | 0 |
adhamo0o/alx-low_level_programming | a22622d | 0x05-pointers_arrays_strings/4-print_rev.c | C | www.github.com/adhamo0o/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/4-print_rev.c | https://raw.githubusercontent.com/adhamo0o/alx-low_level_programming/a22622d/0x05-pointers_arrays_strings/4-print_rev.c | adhamo0o/alx-low_level_programming a22622d 0x05-pointers_arrays_strings/4-print_rev.c | true | 200 | 299 | #include "main.h"
/**
* print_rev - prints a string, in reverse.
* @s: The pointer for the string will be printed.
*
* Return: Void.
*/
void print_rev(char *s)
{
int len = 0;
while (*s != '\0')
{
len++;
s++;
}
while (len > 0)
{
s--;
_putchar(*s);
len--;
}
_putchar('\n');
}
| 5 |
SandhyaReddy21/LogicBuildingPrograms2 | 8caf7ed | LB199.c | C | www.github.com/SandhyaReddy21/LogicBuildingPrograms2/tree/main/LB199.c | https://raw.githubusercontent.com/SandhyaReddy21/LogicBuildingPrograms2/8caf7ed/LB199.c | SandhyaReddy21/LogicBuildingPrograms2 8caf7ed LB199.c | true | 200 | 966 | //Assignment:40
/*Write a program which accept one number, two position from user and check whether
bit at first or bit at second position is ON or OFF*/
//Input : 10 3 7
//Output : true
#include<stdio.h>
#include<stdbool.h>
bool CheckBit(int iNo,int iPos,int iiPos)
{
int iMask = 0X00000001;
... | 7 |
Sanousi1/alx-low_level_programming | 3aa952a | 0x06-pointers_arrays_strings/5-string_toupper.c | C | www.github.com/Sanousi1/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/5-string_toupper.c | https://raw.githubusercontent.com/Sanousi1/alx-low_level_programming/3aa952a/0x06-pointers_arrays_strings/5-string_toupper.c | Sanousi1/alx-low_level_programming 3aa952a 0x06-pointers_arrays_strings/5-string_toupper.c | true | 200 | 297 | #include "main.h"
/**
* *string_toupper - this is the function of the task
*@str : the function prarmeter
* Return: return result
*/
char *string_toupper(char *str)
{
int i;
for (i = 0; str[i] != '\0'; i++)
{
if (str[i] >= 'a' && str[i] <= 'z')
str[i] = str[i] - 32;
}
return (str);
}
| 4 |
enzo-cesaretti/42sh | 6b77961 | src/commands/history.c | C | www.github.com/enzo-cesaretti/42sh/tree/main/src/commands/history.c | https://raw.githubusercontent.com/enzo-cesaretti/42sh/6b77961/src/commands/history.c | enzo-cesaretti/42sh 6b77961 src/commands/history.c | true | 200 | 1,139 | /*
** EPITECH PROJECT, 2023
** HISTORY
** File description:
** HISTORY
*/
#include "shell.h"
#include "gll.h"
#include <stdio.h>
#include <stdlib.h>
int history_clear(char **args, gll_t *env)
{
(void)args;
char *hist_path = get_env(env, "HISTFILE");
if (!hist_path) {
free(hist_path);
retur... | 0 |
kevkatam/sorting_algorithms | a93dae5 | 103-merge_sort.c | C | www.github.com/kevkatam/sorting_algorithms/tree/main/103-merge_sort.c | https://raw.githubusercontent.com/kevkatam/sorting_algorithms/a93dae5/103-merge_sort.c | kevkatam/sorting_algorithms a93dae5 103-merge_sort.c | true | 200 | 1,884 | #include "sort.h"
/**
* printdata - prints data
* @m: message
* @arr: array
* @f: from
* @t: to
* Return: no return
*/
void printdata(char *m, int *arr, int f, int t)
{
char *s;
int i;
printf("[%s]: ", m);
s = "";
for (i = f; i < t + 1; i++)
{
printf("%s%d", s, arr[i]);
s = ", ";
}
printf("\n");
}
... | 5 |
Variyameet/C-LANGUAGE | 6e949cb | prg35.c | C | www.github.com/Variyameet/C-LANGUAGE/tree/main/prg35.c | https://raw.githubusercontent.com/Variyameet/C-LANGUAGE/6e949cb/prg35.c | Variyameet/C-LANGUAGE 6e949cb prg35.c | true | 200 | 556 | // electricity bile
#include<stdio.h>
int main()
{
int unit;
float total;
printf("enter the unit");
scanf("%d",&unit);
if(unit>0 && unit<=100)
{
total=50+(unit*0.60);
printf(" total elecricity bile %f",total);
}
else if(unit>100 && unit<300)
{
total=50+(unit*0.80);
p... | 1 |
20245096/start | 7d50620 | star.c | C | www.github.com/20245096/start/tree/main/star.c | https://raw.githubusercontent.com/20245096/start/7d50620/star.c | 20245096/start 7d50620 star.c | true | 200 | 1,370 | #include <stdio.h>
void drawRect(void) {
for (int j = 0; j < 5; j++) {
for (int i = 0; i < 10; i++) {
printf("*");
}
printf("\n");
}
}
void drawRect2(int n, int m) {
for (int j = 0; j < n; j++) {
for (int i = 0; i < m; i++) {
printf("*");
}
... | 2 |
rioquentin/holbertonschool-low_level_programming | 2c062dc | more_malloc_free/1-string_nconcat.c | C | www.github.com/rioquentin/holbertonschool-low_level_programming/tree/main/more_malloc_free/1-string_nconcat.c | https://raw.githubusercontent.com/rioquentin/holbertonschool-low_level_programming/2c062dc/more_malloc_free/1-string_nconcat.c | rioquentin/holbertonschool-low_level_programming 2c062dc more_malloc_free/1-string_nconcat.c | true | 200 | 629 | #include <stdlib.h>
#include <stddef.h>
#include <stdio.h>
#include "main.h"
/**
* string_nconcat - function
* @s1: s1
* @s2: s2
* @n: n
* Return: 0
*/
char *string_nconcat(char *s1, char *s2, unsigned int n)
{
unsigned int i = 0, x = 0, size = 0, a = 0, b = 0, m = 0;
char *p = NULL;
if (s1 == NULL)
s1 = "... | 6 |
daveSeme/alx-low_level_programming | 694b634 | 0x0B-malloc_free/0-main.c | C | www.github.com/daveSeme/alx-low_level_programming/tree/main/0x0B-malloc_free/0-main.c | https://raw.githubusercontent.com/daveSeme/alx-low_level_programming/694b634/0x0B-malloc_free/0-main.c | daveSeme/alx-low_level_programming 694b634 0x0B-malloc_free/0-main.c | true | 200 | 745 | #include "main.h"
#include <stdio.h>
#include <stdlib.h>
/**
* simple_print_buffer - prints buffer in hexa
* @buffer: the address of memory to print
* @size: the size of the memory to print
* Return: Nothing.
*/
void simple_print_buffer(char *buffer, unsigned int size)
{
unsigned int i;
i = 0;
while (i < siz... | 3 |
Lucie-Kin/minishell | a22ef69 | parser/user_data/prompt.c | C | www.github.com/Lucie-Kin/minishell/tree/main/parser/user_data/prompt.c | https://raw.githubusercontent.com/Lucie-Kin/minishell/a22ef69/parser/user_data/prompt.c | Lucie-Kin/minishell a22ef69 parser/user_data/prompt.c | true | 200 | 3,094 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* prompt.c :+: :+: :+: ... | 7 |
ChengNanFlower/Xiao-You-s-Code | 113955c | CS50/Lecture2-Arrays/uppercase.c | C | www.github.com/ChengNanFlower/Xiao-You-s-Code/tree/main/CS50/Lecture2-Arrays/uppercase.c | https://raw.githubusercontent.com/ChengNanFlower/Xiao-You-s-Code/113955c/CS50/Lecture2-Arrays/uppercase.c | ChengNanFlower/Xiao-You-s-Code 113955c CS50/Lecture2-Arrays/uppercase.c | true | 200 | 413 | // 将单词全部转发为大写
#include <stdio.h>
#include <string.h>
int main(void)
{
char words[51];
printf("Before: ");
scanf("%s",words);
printf("After: ");
for (int i = 0;i < strlen(words);i++)
{
if (words[i] >= 'a' && words[i] <= 'z')
printf("%c",words[i] - ('a' - 'A'));
els... | 4 |
azzbcc/leetcode | 7072b9e | base/04/0401/suites.c | C | www.github.com/azzbcc/leetcode/tree/main/base/04/0401/suites.c | https://raw.githubusercontent.com/azzbcc/leetcode/7072b9e/base/04/0401/suites.c | azzbcc/leetcode 7072b9e base/04/0401/suites.c | true | 200 | 1,767 | /**
* suites.c
* Copyright(c) 2020 beijing. All rights reserved.
* Description:
* Version :
* Created on : 2020/8/7 下午3:14
* Modified :
* Author : Clarence <xjh.azzbcc@gmail.com>
*/
#include <common.h>
#include "0401.c"
int comp(const void *a, const void *b) {
return strcmp(*( char ** )a, *( char... | 5 |
ashrafbel/alx-low_level_programming | 83e668b | 0x12-singly_linked_lists/2-add_node.c | C | www.github.com/ashrafbel/alx-low_level_programming/tree/main/0x12-singly_linked_lists/2-add_node.c | https://raw.githubusercontent.com/ashrafbel/alx-low_level_programming/83e668b/0x12-singly_linked_lists/2-add_node.c | ashrafbel/alx-low_level_programming 83e668b 0x12-singly_linked_lists/2-add_node.c | true | 200 | 649 | #include "lists.h"
#include <stdlib.h>
#include <string.h>
/**
* add_node - adds a new node at the beginning of a list_t list
* @head: Pointer to the address of the first of the list.
* @str: String to be duplicated and assigned to the new node.
*
* Return: The address of the new element
*/
list_t *add_node(list... | 0 |
paulotcj/C_Integrated_LUA | 317e830 | current/src/main.c | C | www.github.com/paulotcj/C_Integrated_LUA/tree/main/current/src/main.c | https://raw.githubusercontent.com/paulotcj/C_Integrated_LUA/317e830/current/src/main.c | paulotcj/C_Integrated_LUA 317e830 current/src/main.c | true | 200 | 3,580 | #include <stdio.h>
#include<SDL2/SDL.h>
#include "../lib/lua/src/lua.h"
#include "../lib/lua/src/lualib.h"
#include "../lib/lua/src/lauxlib.h"
#define FALSE 0
#define TRUE 1
#define WINDOW_WIDTH 800
#define WINDOW_HEIGHT 600
#define FPS 30
#define FRAME_TIME_LENGTH (1000 / FPS)
SDL_Window* window = NULL;
SDL_Rende... | 2 |
calmsacibis995/uw2-src | 95995ce | usr/src/common/cmd/bkrs/libbrmeth.d/brsndfname.c | C | www.github.com/calmsacibis995/uw2-src/tree/main/usr/src/common/cmd/bkrs/libbrmeth.d/brsndfname.c | https://raw.githubusercontent.com/calmsacibis995/uw2-src/95995ce/usr/src/common/cmd/bkrs/libbrmeth.d/brsndfname.c | calmsacibis995/uw2-src 95995ce usr/src/common/cmd/bkrs/libbrmeth.d/brsndfname.c | true | 200 | 1,427 | /* 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... | 6 |
MustofAhmed41/Compiler | aafded2 | Extras/Lab 2/final_assignment Updated/180104005_Assignment2.c | C | www.github.com/MustofAhmed41/Compiler/tree/main/Extras/Lab 2/final_assignment Updated/180104005_Assignment2.c | https://raw.githubusercontent.com/MustofAhmed41/Compiler/aafded2/Extras/Lab%202/final_assignment%20Updated/180104005_Assignment2.c | MustofAhmed41/Compiler aafded2 Extras/Lab 2/final_assignment Updated/180104005_Assignment2.c | true | 200 | 13,269 | #include <stdio.h>
#include <ctype.h>
#include <string.h>
int detect_numeric(char *lex);
void detect_word(char *word, int length);
int detect_keyword(char *word);
int detect_separator(char *word);
int detect_operator(char *word);
int detect_identifier(char *word);
int identifier_detector;
void take_input_from_console(... | 1 |
Dongcunhui/WL-SVC | d14c210 | Interframe EZBC/TempSub/src/cnv_data_4_1.c | C | www.github.com/Dongcunhui/WL-SVC/tree/main/Interframe EZBC/TempSub/src/cnv_data_4_1.c | https://raw.githubusercontent.com/Dongcunhui/WL-SVC/d14c210/Interframe%20EZBC/TempSub/src/cnv_data_4_1.c | Dongcunhui/WL-SVC d14c210 Interframe EZBC/TempSub/src/cnv_data_4_1.c | true | 200 | 398 | /* file: cnv_data_4_1.c */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <malloc.h>
#include "basic.h"
void
cnv_data_4_1( float *y, unsigned char *x, int n )
{
int i, tmp;
for( i = 0; i < n; i++ ) {
tmp = nint( y[i] + 128.0 );
if( tmp < 0 )
tmp = 0;
if( ... | 7 |
Powerisinschool/alx-low_level_programming | 31b7c7e | 0x1A-hash_tables/6-hash_table_delete.c | C | www.github.com/Powerisinschool/alx-low_level_programming/tree/main/0x1A-hash_tables/6-hash_table_delete.c | https://raw.githubusercontent.com/Powerisinschool/alx-low_level_programming/31b7c7e/0x1A-hash_tables/6-hash_table_delete.c | Powerisinschool/alx-low_level_programming 31b7c7e 0x1A-hash_tables/6-hash_table_delete.c | true | 200 | 543 | #include "hash_tables.h"
/**
* hash_table_delete - Deletes a hash table freeing it completely from memory
* @ht: The hash table to be deleted
* Return: void
*/
void hash_table_delete(hash_table_t *ht)
{
unsigned long int i;
hash_node_t *node;
hash_node_t *next;
if (ht == NULL)
return;
for (i = 0; i < ht->... | 4 |
Karolreyes2/programasc | 81bba69 | 22-horasegundo.c | C | www.github.com/Karolreyes2/programasc/tree/main/22-horasegundo.c | https://raw.githubusercontent.com/Karolreyes2/programasc/81bba69/22-horasegundo.c | Karolreyes2/programasc 81bba69 22-horasegundo.c | true | 200 | 2,034 | /*
Karol Reyes Sánchez
21-La hora un segudo despues
TDMS 1A 5244
[Instrucciones del problema]
Pida por teclado una hora en tres variables: horas, minutos y segundos (datos
enteros).
2º) Muestre por pantalla la hora un segundo después.
Nota 1: Si la hora introducida por el usuario es incorrecta, se debe mostrar el
me... | 5 |
kpatsakis/primevul3 | f35d800 | 65187.c | C | www.github.com/kpatsakis/primevul3/tree/main/65187.c | https://raw.githubusercontent.com/kpatsakis/primevul3/f35d800/65187.c | kpatsakis/primevul3 f35d800 65187.c | true | 200 | 407 | static ssize_t ucma_disconnect(struct ucma_file *file, const char __user *inbuf,
int in_len, int out_len)
{
struct rdma_ucm_disconnect cmd;
struct ucma_context *ctx;
int ret;
if (copy_from_user(&cmd, inbuf, sizeof(cmd)))
return -EFAULT;
ctx = ucma_get_ctx_dev(file, cmd.id);
if (IS_ERR(ctx))
return... | 0 |
GermanCrisci/tp1SistemasOperativos | ab2bf41 | p8/p8.c | C | www.github.com/GermanCrisci/tp1SistemasOperativos/tree/main/p8/p8.c | https://raw.githubusercontent.com/GermanCrisci/tp1SistemasOperativos/ab2bf41/p8/p8.c | GermanCrisci/tp1SistemasOperativos ab2bf41 p8/p8.c | true | 200 | 2,167 | #include <pthread.h>
#include <unistd.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int matriz[4][3];
int subtotales[3] = {-1,-1,-1};
int totalMatriz = 0.0;
int columnas[3] = {0,1,2};
int sumadas = 0;
void *cargoMatriz(void *);
void *sumoColumna(void *);
void *sumoTotal(void *); //suma toda... | 6 |
Sara-Hossny/Power-window-control-system | 072a8ba | include/window.h | C | www.github.com/Sara-Hossny/Power-window-control-system/tree/main/include/window.h | https://raw.githubusercontent.com/Sara-Hossny/Power-window-control-system/072a8ba/include/window.h | Sara-Hossny/Power-window-control-system 072a8ba include/window.h | true | 200 | 1,578 | /*
* Window_control.h
*
* Created on: May 5, 2024
* Author: Rana Hossny
* Sara Hossny
*/
#ifndef INCLUDE_WINDOW_CONTROL_H_
#define INCLUDE_WINDOW_CONTROL_H_
#include <stdint.h>
#include "driverlib/gpio.h"
#include "driverlib/sysctl.h"
#include "inc/tm4c123gh6pm.h"
#include "inc/h... | 1 |
pixelsconcepts/alx-low_level_programming | 38cd1d2 | 0x18-dynamic_libraries/0-strcat.c | C | www.github.com/pixelsconcepts/alx-low_level_programming/tree/main/0x18-dynamic_libraries/0-strcat.c | https://raw.githubusercontent.com/pixelsconcepts/alx-low_level_programming/38cd1d2/0x18-dynamic_libraries/0-strcat.c | pixelsconcepts/alx-low_level_programming 38cd1d2 0x18-dynamic_libraries/0-strcat.c | true | 200 | 396 | #include "main.h"
#include <stdio.h>
/**
* _strcat - Concatenates two strings
* @dest: First string
* @src: second string
* Return: destination string
*/
char *_strcat(char *dest, char *src)
{
int ind1 = 0;
int ind2 = 0;
while (dest[ind1] != '\0')
{
ind1++;
}
while (src[ind2] != '\0')
{
dest[ind1] ... | 3 |
AguilarJ11/holbertonschool-low_level_programming | 3f46a01 | pointers_arrays_strings/5-rev_string.c | C | www.github.com/AguilarJ11/holbertonschool-low_level_programming/tree/main/pointers_arrays_strings/5-rev_string.c | https://raw.githubusercontent.com/AguilarJ11/holbertonschool-low_level_programming/3f46a01/pointers_arrays_strings/5-rev_string.c | AguilarJ11/holbertonschool-low_level_programming 3f46a01 pointers_arrays_strings/5-rev_string.c | true | 200 | 325 | #include "main.h"
/**
* rev_string - reverse a string
* @str: entry string
*/
void rev_string(char *str)
{
int a = 0, b, c = 0;
char l;
while (str[a] != '\0')
a++;
a--;
if (a / 2 == 0)
c = a / 2;
else
c = a / 2 + 1;
for (b = 0; a >= c; b++)
{
l = str[b];
str[b] = str[a];
str[a] = l;
a--;
... | 2 |
NNikolakopoulos/Systems-Programming-assignments | d857425 | prj1/functions.c | C | www.github.com/NNikolakopoulos/Systems-Programming-assignments/tree/main/prj1/functions.c | https://raw.githubusercontent.com/NNikolakopoulos/Systems-Programming-assignments/d857425/prj1/functions.c | NNikolakopoulos/Systems-Programming-assignments d857425 prj1/functions.c | true | 200 | 9,466 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include <stdint.h>
#include <time.h>
#include "list.h"
#include "slist.h"
#include "hash.h"
#include "bloom.h"
void vaccineStatusBloom(virusList *list, char *citizenid, char *virusname)
{
virusListNode *temp=NULL;
if(list==NU... | 7 |
axel-lukongo/cub3D | 383d4de | stop_game/my_free.c | C | www.github.com/axel-lukongo/cub3D/tree/main/stop_game/my_free.c | https://raw.githubusercontent.com/axel-lukongo/cub3D/383d4de/stop_game/my_free.c | axel-lukongo/cub3D 383d4de stop_game/my_free.c | true | 200 | 1,766 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* my_free.c :+: :+: :+: ... | 4 |
dmaessen/fdf | f63b663 | draw.c | C | www.github.com/dmaessen/fdf/tree/main/draw.c | https://raw.githubusercontent.com/dmaessen/fdf/f63b663/draw.c | dmaessen/fdf f63b663 draw.c | true | 200 | 2,502 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* draw.c :+: :+: :+: ... | 5 |
NawalAbdelmoniem/alx-low_level_programming | f4609bd | 0x12-singly_linked_lists/4-free_list.c | C | www.github.com/NawalAbdelmoniem/alx-low_level_programming/tree/main/0x12-singly_linked_lists/4-free_list.c | https://raw.githubusercontent.com/NawalAbdelmoniem/alx-low_level_programming/f4609bd/0x12-singly_linked_lists/4-free_list.c | NawalAbdelmoniem/alx-low_level_programming f4609bd 0x12-singly_linked_lists/4-free_list.c | true | 200 | 225 | #include <stdlib.h>
#include "lists.h"
/**
* free_list - frees a list
* @head: list_t list to be freed
*/
void free_list(list_t *head)
{
list_t *m;
while (head)
{
m = head->next;
free(head->str);
free(head);
head = m;
}
}
| 3 |
IrsyadAzraei21/Lab_Assignment | 8cfee00 | integerPipe.c | C | www.github.com/IrsyadAzraei21/Lab_Assignment/tree/main/integerPipe.c | https://raw.githubusercontent.com/IrsyadAzraei21/Lab_Assignment/8cfee00/integerPipe.c | IrsyadAzraei21/Lab_Assignment 8cfee00 integerPipe.c | true | 200 | 512 | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
int main(void){
int pipefds[2];
int buffer;
if(pipe(pipefds) == -1){
perror("pipe");
exit(EXIT_FAILURE);
}
int nombor = 22;
printf("Writing a number to pipe...\n");
write(pipefds[1], &nombor, sizeof(nombor));
printf("Done.... | 6 |
vincentmuriithi/alx-low_level_programming | a44d937 | 0x0E-structures_typedef/2-print_dog.c | C | www.github.com/vincentmuriithi/alx-low_level_programming/tree/main/0x0E-structures_typedef/2-print_dog.c | https://raw.githubusercontent.com/vincentmuriithi/alx-low_level_programming/a44d937/0x0E-structures_typedef/2-print_dog.c | vincentmuriithi/alx-low_level_programming a44d937 0x0E-structures_typedef/2-print_dog.c | true | 200 | 378 | #include "dog.h"
/**
* print_dog - prints the values of the struc t dog given
* @d: input struct pointer
* Return: returns void
*
*/
void print_dog(struct dog *d)
{
if (d != NULL)
{
printf("Name: %s\n", d->name != NULL ? d->name : "(nil)");
if (d->age >= 0)
printf("Age: %.6f\n", d->age);
else
printf("nil\n");
printf("... | 1 |
cooliesboy/alx-low_level_programming | cce4919 | 0x01-variables_if_else_while/4-print_alphabt.c | C | www.github.com/cooliesboy/alx-low_level_programming/tree/main/0x01-variables_if_else_while/4-print_alphabt.c | https://raw.githubusercontent.com/cooliesboy/alx-low_level_programming/cce4919/0x01-variables_if_else_while/4-print_alphabt.c | cooliesboy/alx-low_level_programming cce4919 0x01-variables_if_else_while/4-print_alphabt.c | true | 200 | 213 | #include <stdio.h>
/**
* main - main function
* Return: Always 0 (success)
*/
int main(void)
{
char i;
for (i = 'a'; i <= 'z'; i++)
if (i != 'q' && i != 'e')
putchar(i);
putchar('\n');
return (0);
}
| 2 |
Abdalrhman-Olimat/PIPEX | cb2031a | src/pipex_utils.c | C | www.github.com/Abdalrhman-Olimat/PIPEX/tree/main/src/pipex_utils.c | https://raw.githubusercontent.com/Abdalrhman-Olimat/PIPEX/cb2031a/src/pipex_utils.c | Abdalrhman-Olimat/PIPEX cb2031a src/pipex_utils.c | true | 200 | 2,534 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* pipex_utils.c :+: :+: :+: ... | 7 |
Josfem-leeeds/alx-low_level_programming | c58a12d | 0x02-functions_nested_loops/0-putchar.c | C | www.github.com/Josfem-leeeds/alx-low_level_programming/tree/main/0x02-functions_nested_loops/0-putchar.c | https://raw.githubusercontent.com/Josfem-leeeds/alx-low_level_programming/c58a12d/0x02-functions_nested_loops/0-putchar.c | Josfem-leeeds/alx-low_level_programming c58a12d 0x02-functions_nested_loops/0-putchar.c | true | 200 | 301 | #include "main.h"
/**
* main - prints the word putchar
* Return: always 0
*/
int main(void)
{
/* this calls the function to be printed */
_putchar('_');
_putchar('p');
_putchar('u');
_putchar('t');
_putchar('c');
_putchar('h');
_putchar('a');
_putchar('r');
_putchar('\n');
return (0);
}
| 0 |
zario3/RSA_C | d5b7791 | rsa.c | C | www.github.com/zario3/RSA_C/tree/main/rsa.c | https://raw.githubusercontent.com/zario3/RSA_C/d5b7791/rsa.c | zario3/RSA_C d5b7791 rsa.c | true | 200 | 2,385 | #include "rsa.h"
/*Fonctions pour la generation de cle publique et privee, et de chiffrement RSA*/
/*Calcul le pgcd de 2 entiers naturels*/
int pgcd(int a, int b){
if (a>b)
return pgcd(b,a);
if (a == 0)
return b;
else
return pgcd(a, b%a);
}
/*Fonction qui verifie si deux entier... | 5 |
shutup-p/practice_codes | 44266d2 | 5.Arm Strong Number.c | C | www.github.com/shutup-p/practice_codes/tree/main/5.Arm Strong Number.c | https://raw.githubusercontent.com/shutup-p/practice_codes/44266d2/5.Arm%20Strong%20Number.c | shutup-p/practice_codes 44266d2 5.Arm Strong Number.c | true | 200 | 370 | #include <stdio.h>
#include<math.h>
int main(){
int num,temp1,temp2,sum=0;
scanf("%d",&num);
temp1=num;
while(temp1!=0){
temp2=temp1%10;
sum+=pow(temp2,3);
temp1=temp1/10;
}
printf("sum = %d \n",sum);
if(sum==num){
printf("Armstrong number \n");
}
else... | 4 |
kiber11/c-tilidagi-dastlabki-kodlarim | 7273cb5 | 2-oy/11-uy ishi/c11dars2.c | C | www.github.com/kiber11/c-tilidagi-dastlabki-kodlarim/tree/main/2-oy/11-uy ishi/c11dars2.c | https://raw.githubusercontent.com/kiber11/c-tilidagi-dastlabki-kodlarim/7273cb5/2-oy/11-uy%20ishi/c11dars2.c | kiber11/c-tilidagi-dastlabki-kodlarim 7273cb5 2-oy/11-uy ishi/c11dars2.c | true | 200 | 417 | #include<stdio.h>
#include<time.h>
#include<stdlib.h>
void mas_in(int A[],int n){
srand(time(NULL));
for(int i=0;i<n;i++){
A[i]=rand()%60+1;
printf("A[%d]=%d\t",i,A[i]);
}
}
void max_in(int A[],int n){
int max;
max=A[0];
for(int i=0;i<n;i++){
if(A[i]>max){
max=A[i];
}
}
printf("Max=%d",max);
}
int m... | 6 |
bbrown585/holbertonschool-low_level_programming | 5b9ae49 | 0x10-variadic_functions/3-print_all.c | C | www.github.com/bbrown585/holbertonschool-low_level_programming/tree/main/0x10-variadic_functions/3-print_all.c | https://raw.githubusercontent.com/bbrown585/holbertonschool-low_level_programming/5b9ae49/0x10-variadic_functions/3-print_all.c | bbrown585/holbertonschool-low_level_programming 5b9ae49 0x10-variadic_functions/3-print_all.c | true | 200 | 367 | #include "variadic_functions.h"
#include <stdlib.h>
/**
* print_all - prints anything
*
*
* Return: an int
*/
void print_all(const char * const format, ...)
{
int i = 0;
char *string, *ptr = "";
va_list var;
va_start(var, format);
if (format)
{
while (format[i])
{
switch (format[i])
{
case '... | 3 |
Faizatmonsuru/alx-low_level_programming | 0ecaa05 | 0x04-more_functions_nested_loops/3-print_numbers.c | C | www.github.com/Faizatmonsuru/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/3-print_numbers.c | https://raw.githubusercontent.com/Faizatmonsuru/alx-low_level_programming/0ecaa05/0x04-more_functions_nested_loops/3-print_numbers.c | Faizatmonsuru/alx-low_level_programming 0ecaa05 0x04-more_functions_nested_loops/3-print_numbers.c | true | 200 | 217 | #include "main.h"
/**
* print_numbers - displays the value from 0 to 9
* Return: displays digit value
*/
void print_numbers(void)
{
int a;
for (a = '0'; a <= '9'; a++)
{
_putchar(a);
}
_putchar('\n');
}
| 1 |
AlexiCor/LP25_project | a37d7ea | utility.c | C | www.github.com/AlexiCor/LP25_project/tree/main/utility.c | https://raw.githubusercontent.com/AlexiCor/LP25_project/a37d7ea/utility.c | AlexiCor/LP25_project a37d7ea utility.c | true | 200 | 1,272 | #include <defines.h>
#include <string.h>
/*!
* @brief concat_path concatenates suffix to prefix into result
* It checks if prefix ends by / and adds this token if necessary
* It also checks that result will fit into PATH_SIZE length
* @param result the result of the concatenation
* @param prefix the first part of... | 2 |
MathieuSoysal/minishell | cb4a5c2 | .test/utils/parser/test_internal_outfiles.h | C | www.github.com/MathieuSoysal/minishell/tree/main/.test/utils/parser/test_internal_outfiles.h | https://raw.githubusercontent.com/MathieuSoysal/minishell/cb4a5c2/.test/utils/parser/test_internal_outfiles.h | MathieuSoysal/minishell cb4a5c2 .test/utils/parser/test_internal_outfiles.h | true | 200 | 2,276 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* test_internal_outfiles.h :+: :+: :+: ... | 0 |
hveit01/pcs-munix | 41e3c92 | usr/src/m32/lib/libc/port/gen/putpwent.c | C | www.github.com/hveit01/pcs-munix/tree/main/usr/src/m32/lib/libc/port/gen/putpwent.c | https://raw.githubusercontent.com/hveit01/pcs-munix/41e3c92/usr/src/m32/lib/libc/port/gen/putpwent.c | hveit01/pcs-munix 41e3c92 usr/src/m32/lib/libc/port/gen/putpwent.c | true | 200 | 1,290 | /*
********************************************************************************
* Copyright (c) 1985 AT&T *
* All Rights Reserved *
* ... | 7 |
Frankensbein/ctfsmk6 | 9391312 | binex/Kok Kamu Bisa Begitu Bang/public/chall.c | C | www.github.com/Frankensbein/ctfsmk6/tree/main/binex/Kok Kamu Bisa Begitu Bang/public/chall.c | https://raw.githubusercontent.com/Frankensbein/ctfsmk6/9391312/binex/Kok%20Kamu%20Bisa%20Begitu%20Bang/public/chall.c | Frankensbein/ctfsmk6 9391312 binex/Kok Kamu Bisa Begitu Bang/public/chall.c | true | 200 | 4,439 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
int numGuests = 0; // Number of guests checked in
int choice;
int roomNumber;
int readint(){
char buf[0x10];
return atoi(fgets(buf,0x10,stdin));
}
// Structure to store guest information
struct Guest {
int roomNumber... | 5 |
WemimoAdewale/alx-low_level_programming | 854cab9 | 0x14-bit_manipulation/3-set_bit.c | C | www.github.com/WemimoAdewale/alx-low_level_programming/tree/main/0x14-bit_manipulation/3-set_bit.c | https://raw.githubusercontent.com/WemimoAdewale/alx-low_level_programming/854cab9/0x14-bit_manipulation/3-set_bit.c | WemimoAdewale/alx-low_level_programming 854cab9 0x14-bit_manipulation/3-set_bit.c | true | 200 | 323 | #include "main.h"
/**
* set_bit - Sets the value of a bit at a given index to 1.
* @n: pointer to int
* @index: The index to set the value at
* Return: -1 on error
*/
int set_bit(unsigned long int *n, unsigned int index)
{
if (index >= (sizeof(unsigned long int) * 8))
return (-1);
*n ^= (1 << index);
return (1);... | 4 |
rafac183/ProgramacionEstructurada | a33b264 | logicos/main.c | C | www.github.com/rafac183/ProgramacionEstructurada/tree/main/logicos/main.c | https://raw.githubusercontent.com/rafac183/ProgramacionEstructurada/a33b264/logicos/main.c | rafac183/ProgramacionEstructurada a33b264 logicos/main.c | true | 200 | 728 | #include <stdio.h>
#include <stdlib.h>
int main()
{
printf("Operadores Logicos \n");
float valA, valB, valC;
valA = 5;
valB = valC = 10;
if((valA < valB) && (valB == valC)) {
printf("Se Cumplieron las 2 Condiciones \n");
}
else {
printf("No se Cumplieron las Condiciones \n... | 6 |
AydinMuhammed/SMB101 | c0b9f3d | TP3_/Exo2/threaded_sort2.c | C | www.github.com/AydinMuhammed/SMB101/tree/main/TP3_/Exo2/threaded_sort2.c | https://raw.githubusercontent.com/AydinMuhammed/SMB101/c0b9f3d/TP3_/Exo2/threaded_sort2.c | AydinMuhammed/SMB101 c0b9f3d TP3_/Exo2/threaded_sort2.c | true | 200 | 3,106 | #include <stdio.h>
#include <stdlib.h>
#include <sys/time.h>
#include <pthread.h>
#define SIZE (int)1e8
#define NUM_THREADS 2// essayer aevc 2, 4, 8
// Question :
// Que constatez-voud ?
// Je constate que avec 2 Thread ( c'est plus rapide ) :
//Le tableau a été initialisé en 1.034055 secondes.
//La r... | 3 |
Solaar7/Maldev | aa008c3 | NTAPI/hNTAPI.h | C | www.github.com/Solaar7/Maldev/tree/main/NTAPI/hNTAPI.h | https://raw.githubusercontent.com/Solaar7/Maldev/aa008c3/NTAPI/hNTAPI.h | Solaar7/Maldev aa008c3 NTAPI/hNTAPI.h | true | 200 | 3,431 | #pragma once
#pragma comment (lib, "ntdll")
#include <Windows.h>
#include <stdio.h>
/*-----[SETTING UP MACROS]-----*/
#define STATUS_SUCCESS ((NTSTATUS)0x00000000L)
#define warn(msg, ...) printf("[-] " msg "\n", ##__VA_ARGS__)
#define info(msg, ...) printf("[i] " msg "\n", ##__VA_ARGS__)
#define okay(msg, ...) printf... | 1 |
ggutierrez545/AdventOfCode2023 | 4b2a138 | 2023/puzzle_16/puzzle_16.c | C | www.github.com/ggutierrez545/AdventOfCode2023/tree/main/2023/puzzle_16/puzzle_16.c | https://raw.githubusercontent.com/ggutierrez545/AdventOfCode2023/4b2a138/2023/puzzle_16/puzzle_16.c | ggutierrez545/AdventOfCode2023 4b2a138 2023/puzzle_16/puzzle_16.c | true | 200 | 4,915 | #define PCRE2_CODE_UNIT_WIDTH 8
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <pcre2.h>
char** apply_regex(PCRE2_SPTR* p, PCRE2_SPTR* s) {
char** out = malloc(100000);
int out_idx = 0;
PCRE2_SPTR pattern = *p, subject = *s;
pcre2_code* re;
int crlf_is_newline;
int errornumber;
... | 2 |
ajayrawat/Tutorials | c6342ca | expo_petsc.c | C | www.github.com/ajayrawat/Tutorials/tree/main/expo_petsc.c | https://raw.githubusercontent.com/ajayrawat/Tutorials/c6342ca/expo_petsc.c | ajayrawat/Tutorials c6342ca expo_petsc.c | true | 200 | 660 | #include <petsc.h>
int main(int argc, char **argv)
{
PetscErrorCode ierr;
int rank, i;
double eapp, localfact;
PetscInitialize(&argc, &argv, NULL, "Approximation for e\n");
ierr = MPI_Comm_rank(PETSC_COMM_WORLD, &rank);
localfact = 1.0;
for (i = 2; i<rank + 1; i++)
{
localfact = localfact/i... | 7 |
linzhanwei1/linuxNetTang | 24a3ede | lesson08/test.c | C | www.github.com/linzhanwei1/linuxNetTang/tree/main/lesson08/test.c | https://raw.githubusercontent.com/linzhanwei1/linuxNetTang/24a3ede/lesson08/test.c | linzhanwei1/linuxNetTang 24a3ede lesson08/test.c | true | 200 | 861 | #include <stdio.h>
#include <stdlib.h>
#include "msg_parser.h"
int main(int argc, char **argv)
{
MParser *p = MParserNew();
char buf[] = {0x00, 0x01, 0x00, 0x02, 0x00, 0x03, 0x00, 0x04, 0x00, 0x00, 0x00, 0x04};
char data[] = {0x11, 0x12, 0x13, 0x14};
message_t *m = MParserReadMem(p, buf, sizeof(buf))... | 0 |
Dune-001/alx-low_level_programming | e6e4836 | 0x01-variables_if_else_while/102-print_comb5.c | C | www.github.com/Dune-001/alx-low_level_programming/tree/main/0x01-variables_if_else_while/102-print_comb5.c | https://raw.githubusercontent.com/Dune-001/alx-low_level_programming/e6e4836/0x01-variables_if_else_while/102-print_comb5.c | Dune-001/alx-low_level_programming e6e4836 0x01-variables_if_else_while/102-print_comb5.c | true | 200 | 646 | #include <stdio.h>
/**
* main - Entry point
*
* Description: Prints all the unique combinations of two two-digit numbers
* numbers are separated by a space and a comma
* digits are printed with leading zeros if necessary
*
* Return: Always 0 (Success)
*/
int main(void)
{
int num1 = 0;
while (num1 < 100)
{
... | 5 |
tflaemig68/BALi | af0ae61 | Src/i2cDeivces.c | C | www.github.com/tflaemig68/BALi/tree/main/Src/i2cDeivces.c | https://raw.githubusercontent.com/tflaemig68/BALi/af0ae61/Src/i2cDeivces.c | tflaemig68/BALi af0ae61 Src/i2cDeivces.c | true | 200 | 5,448 | /*
* I2C.c
*
* Created on: 18.12.2023
* Author: tobia
*/
#include <mcalGPIO.h>
#include <mcalI2C.h>
#include <mcalSysTick.h>
#include "i2cDevices.h"
//RFID SL018
uint8_t *strFirmware = (uint8_t *) " .... \0";
uint8_t RFIDcmd_LEDon[3] = {0x02, 0x40, 0xFF};
uint8_t RFIDcmd_LEDoff[3] = {0... | 4 |
kertgbh-nqt/phil | 451aab0 | manda/init.c | C | www.github.com/kertgbh-nqt/phil/tree/main/manda/init.c | https://raw.githubusercontent.com/kertgbh-nqt/phil/451aab0/manda/init.c | kertgbh-nqt/phil 451aab0 manda/init.c | true | 200 | 2,255 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* init.c :+: :+: :+... | 3 |
pooja210603/Nodes_in_linked_list | cdb04a9 | nodes_in_linkedlist.c | C | www.github.com/pooja210603/Nodes_in_linked_list/tree/main/nodes_in_linkedlist.c | https://raw.githubusercontent.com/pooja210603/Nodes_in_linked_list/cdb04a9/nodes_in_linkedlist.c | pooja210603/Nodes_in_linked_list cdb04a9 nodes_in_linkedlist.c | true | 200 | 1,410 | #include <stdio.h>
#include <stdlib.h>
void addatend(int);
void addatstart(int);
void addinbetween(int);
void display();
struct node
{
int data;
struct node*next;
};
struct node *start;
int data1, data2;
void addatend(int info)
{
struct node *newnode = (struct node*)malloc(sizeof(struct... | 6 |
dreamos82/Dreamos64 | b272c25 | src/kernel/scheduling/scheduler.c | C | www.github.com/dreamos82/Dreamos64/tree/main/src/kernel/scheduling/scheduler.c | https://raw.githubusercontent.com/dreamos82/Dreamos64/b272c25/src/kernel/scheduling/scheduler.c | dreamos82/Dreamos64 b272c25 src/kernel/scheduling/scheduler.c | true | 200 | 7,062 | #include <framebuffer.h>
#include <scheduler.h>
#include <string.h>
#include <kernel.h>
#include <kheap.h>
#include <logging.h>
#include <stdio.h>
#include <task.h>
#include <tss.h>
#include <vm.h>
uint16_t scheduler_ticks;
size_t next_thread_id;
size_t next_task_id;
thread_t* thread_list;
thread_t* current_executing... | 1 |
01Lucasena/linguagem-c | 85a6fa8 | for-6.c | C | www.github.com/01Lucasena/linguagem-c/tree/main/for-6.c | https://raw.githubusercontent.com/01Lucasena/linguagem-c/85a6fa8/for-6.c | 01Lucasena/linguagem-c 85a6fa8 for-6.c | true | 200 | 522 | #include <stdio.h>
#include <stdlib.h>
#include <locale.h>
void cabecalho(){
system("cls||clear");
printf("\n===SENAI===\n");
fflush(stdin);
}
int main(){
setlocale(LC_ALL,"portuguese");
//Declarar variaveis
int numero,i;
//Solicitar dados ao usuário
cabecalho();
printf("... | 7 |
tuvshinerdene1/C | df8fcc2 | Lab2b_relational_comparison/home4.c | C | www.github.com/tuvshinerdene1/C/tree/main/Lab2b_relational_comparison/home4.c | https://raw.githubusercontent.com/tuvshinerdene1/C/df8fcc2/Lab2b_relational_comparison/home4.c | tuvshinerdene1/C df8fcc2 Lab2b_relational_comparison/home4.c | true | 200 | 448 | #include<stdio.h>
int main(){
int arr[10];
int num;
//int temp = num;
printf("num=");scanf("%d",&num);
int temp = num;
for(int i=0; i<10; i++){
arr[i]=0;
}
while(temp !=0){
arr[temp%10] = arr[temp%10]+1;
temp /= 10;
}
int max = 0;
for(int i = 1 ... | 5 |
mbustamanter/codeforces | c9cbde1 | 1301-1400/1369A30.c | C | www.github.com/mbustamanter/codeforces/tree/main/1301-1400/1369A30.c | https://raw.githubusercontent.com/mbustamanter/codeforces/c9cbde1/1301-1400/1369A30.c | mbustamanter/codeforces c9cbde1 1301-1400/1369A30.c | true | 200 | 278 | #include <stdio.h>
#define rep(i,a,b) for (int i=a; i<b; i++)
typedef long long ll;
int main() {
int queries;
ll n;
scanf("%d\n",&queries);
rep (i,0,queries) {
scanf("%I64d\n",&n);
(n%4==0) ? printf("YES\n"):printf("NO\n");
}
return 0;
}
| 4 |
Divyanshusingh22/C_Assingment_1 | 274c0cd | 34.c | C | www.github.com/Divyanshusingh22/C_Assingment_1/tree/main/34.c | https://raw.githubusercontent.com/Divyanshusingh22/C_Assingment_1/274c0cd/34.c | Divyanshusingh22/C_Assingment_1 274c0cd 34.c | true | 200 | 1,184 | #include <stdio.h>
int main() {
char operator;
double num1, num2, result;
// Prompt user to enter operator
printf("Enter an operator (+, -, *, /): ");
scanf(" %c", &operator);
// Prompt user to enter two numbers
printf("Enter two numbers: ");
scanf("%lf %lf", &num1, &num2)... | 2 |
Loyoenock/alx-low_level_programming | cd3acf3 | 0x01-variables_if_else_while/8-print_base16.c | C | www.github.com/Loyoenock/alx-low_level_programming/tree/main/0x01-variables_if_else_while/8-print_base16.c | https://raw.githubusercontent.com/Loyoenock/alx-low_level_programming/cd3acf3/0x01-variables_if_else_while/8-print_base16.c | Loyoenock/alx-low_level_programming cd3acf3 0x01-variables_if_else_while/8-print_base16.c | true | 200 | 330 | #include <stdio.h>
/**
* main - Prints bases of 16 in lowercase.
*
* Description: This function uses put to print 16 basses and begins new line
*
* Return: 0
*/
int main(void)
{
char i;
for (i = '0' ; i <= '9' ; i++)
{
putchar(i);
}
for (i = 'a' ; i <= 'f' ; i++)
{
putchar(i);
}
putchar('\n');
retu... | 3 |
KaushalKapadnis/codes | e36974c | program180.c | C | www.github.com/KaushalKapadnis/codes/tree/main/program180.c | https://raw.githubusercontent.com/KaushalKapadnis/codes/e36974c/program180.c | KaushalKapadnis/codes e36974c program180.c | true | 200 | 878 | #include<stdio.h>
#include<stdlib.h>
#include<fcntl.h>
#define FILESIZE 1024
void FileCopy(char Source[], char Destination[])
{
int Fdsrc = 0, Fddest = 0, iRet = 0, i = 0;
char Buffer[FILESIZE];
Fdsrc = open(Source,O_RDONLY);
if(Fdsrc == -1)
{
printf("Unable to open Source File \n");
return... | 6 |
AddictedK1/C-Coding | 7e71d27 | recursionFiconacci.c | C | www.github.com/AddictedK1/C-Coding/tree/main/recursionFiconacci.c | https://raw.githubusercontent.com/AddictedK1/C-Coding/7e71d27/recursionFiconacci.c | AddictedK1/C-Coding 7e71d27 recursionFiconacci.c | true | 200 | 444 | #include<stdio.h>
int fib(int n); // fib is fibonacci
int main() {
int n;
printf("enter the number of term : ");
scanf("%d", &n);
printf("the %dth term is %d", n, fib(n));
return 0;
}
int fib(int n) {
if(n == 1) {
return 1;
}else if(n == 0) {
return... | 7 |
CLEMENT-OLATOYE/alx-low_level_programming | 15dcfa3 | 0x00-hello_world/101-quote.c | C | www.github.com/CLEMENT-OLATOYE/alx-low_level_programming/tree/main/0x00-hello_world/101-quote.c | https://raw.githubusercontent.com/CLEMENT-OLATOYE/alx-low_level_programming/15dcfa3/0x00-hello_world/101-quote.c | CLEMENT-OLATOYE/alx-low_level_programming 15dcfa3 0x00-hello_world/101-quote.c | true | 200 | 272 | #include <stdio.h>
#include <unistd.h>
/**
* main - Entry point of a C program that prints a line to the standard error
*
* Return: Always 1 (success)
*/
int main(void)
{
fputs("and that piece of art is useful\" - Dora Korpar, 2015-10-19\n", stdout);
return (1);
}
| 1 |
OfficialEcho95/alx-low_level_programming | a506768 | 0x01-variables_if_else_while/6-print_numberz.c | C | www.github.com/OfficialEcho95/alx-low_level_programming/tree/main/0x01-variables_if_else_while/6-print_numberz.c | https://raw.githubusercontent.com/OfficialEcho95/alx-low_level_programming/a506768/0x01-variables_if_else_while/6-print_numberz.c | OfficialEcho95/alx-low_level_programming a506768 0x01-variables_if_else_while/6-print_numberz.c | true | 200 | 225 | #include <stdlib.h>
#include <time.h>
#include <stdio.h>
/**
* main - Entry point
*
* Return: Always 0 (Success)
*/
int main(void)
{
int c;
for (c = '0' ; c <= '9' ; c++)
{
putchar(c);
}
putchar('\n');
return (0);
}
| 5 |
Lesanth18/placement-training | e989083 | 26.07.2024/Store Data in Structures Dynamically.c | C | www.github.com/Lesanth18/placement-training/tree/main/26.07.2024/Store Data in Structures Dynamically.c | https://raw.githubusercontent.com/Lesanth18/placement-training/e989083/26.07.2024/Store%20Data%20in%20Structures%20Dynamically.c | Lesanth18/placement-training e989083 26.07.2024/Store Data in Structures Dynamically.c | true | 200 | 582 | #include <stdio.h>
#include <stdlib.h>
struct course {
int marks;
char subject[30];
};
int main() {
struct course*ptr;
int noOfRecords;
printf("Enter the number of records: ");
scanf("%d",&noOfRecords);
ptr = (struct course*)malloc(noOfRecords*sizeof(struct course));
for (int i=0;i<noOfRecords; ++i) {... | 2 |
Wos2610/C_PTIT | b283405 | C03023.c | C | www.github.com/Wos2610/C_PTIT/tree/main/C03023.c | https://raw.githubusercontent.com/Wos2610/C_PTIT/b283405/C03023.c | Wos2610/C_PTIT b283405 C03023.c | true | 200 | 410 | #include<stdio.h>
int thuanNghich(int n){
int m = n;
int dao = 0;
int cs = 0;
while(n > 0){
cs = n % 10;
if(cs == 9){
return 0;
}
dao = dao * 10 + cs;
n /= 10;
}
if(dao == m){
return 1;
}
return 0;
}
int main(){
int n;
scanf("%d", &n);
int count = 0;
int i;
for(i = 2; i < n; i++){
if(thu... | 3 |
nikitakliatskyi/gl_embedded_tasks | 5f77b90 | pure_c_03/Book/Book.c | C | www.github.com/nikitakliatskyi/gl_embedded_tasks/tree/main/pure_c_03/Book/Book.c | https://raw.githubusercontent.com/nikitakliatskyi/gl_embedded_tasks/5f77b90/pure_c_03/Book/Book.c | nikitakliatskyi/gl_embedded_tasks 5f77b90 pure_c_03/Book/Book.c | true | 200 | 914 | #include "Book.h"
#include <stdio.h>
const char *Language_ToString(Language language) {
static const char *LanguagesNames[] = {"Ukrainian", "English", "German",
"French", "Undefined"};
return LanguagesNames[language];
}
void Book_Print(const Book *book) {
printf("Title: ... | 6 |
p-e-a-c-e2/alx-low_level_programming | 196f384 | 0x17-doubly_linked_lists/4-free_dlistint.c | C | www.github.com/p-e-a-c-e2/alx-low_level_programming/tree/main/0x17-doubly_linked_lists/4-free_dlistint.c | https://raw.githubusercontent.com/p-e-a-c-e2/alx-low_level_programming/196f384/0x17-doubly_linked_lists/4-free_dlistint.c | p-e-a-c-e2/alx-low_level_programming 196f384 0x17-doubly_linked_lists/4-free_dlistint.c | true | 200 | 222 | #include "lists.h"
/**
*free_dlistint - that frees a dlistint
*@head: pointer of the first element
*/
void free_dlistint(dlistint_t *head)
{
dlistint_t *temp;
while (head)
{
temp = head->next;
free(head);
head = temp;
}
}
| 7 |
PrincePrynx/printf | ea26200 | helper_functions.c | C | www.github.com/PrincePrynx/printf/tree/main/helper_functions.c | https://raw.githubusercontent.com/PrincePrynx/printf/ea26200/helper_functions.c | PrincePrynx/printf ea26200 helper_functions.c | true | 200 | 1,195 | #include "main.h"
#include <stdio.h>
/**
* rev_string - reverses a string
* @s: string to reverse
* Return: pointer to a char
*/
char *rev_string(char *s)
{
int a;
int b;
char new;
char *dest;
for (a = 0; s[a] != '\0'; a++)
{}
dest = malloc(sizeof(char) * a + 1);
if (dest == NULL)
return (NULL);
_me... | 1 |
Esteban3737/RPG | 0f6e833 | src/statistisch/init_statistish.c | C | www.github.com/Esteban3737/RPG/tree/main/src/statistisch/init_statistish.c | https://raw.githubusercontent.com/Esteban3737/RPG/0f6e833/src/statistisch/init_statistish.c | Esteban3737/RPG 0f6e833 src/statistisch/init_statistish.c | true | 200 | 4,051 | /*
** EPITECH PROJECT, 2023
** init stat
** File description:
** true
*/
#include "rpg.h"
void init_str(general_t *all)
{
all->satt->str = malloc(sizeof(char *) * 5);
for (int a = 0; a != 5; a++) {
all->satt->str[a] = malloc(sizeof(char) * 2);
all->satt->str[a][0] = '0';
all->satt->str... | 5 |
adel-elmala/SPI-UART-project | 589464d | avr/MCAL/TWI/TWI.c | C | www.github.com/adel-elmala/SPI-UART-project/tree/main/avr/MCAL/TWI/TWI.c | https://raw.githubusercontent.com/adel-elmala/SPI-UART-project/589464d/avr/MCAL/TWI/TWI.c | adel-elmala/SPI-UART-project 589464d avr/MCAL/TWI/TWI.c | true | 200 | 6,503 | #include "TWI_REG.h"
#include "TWI_Interface.h"
#include "TWI_Private.h"
#include "../../LIB/Calcbit.h"
#include "../GIE/GIE_Interface.h"
#include <math.h>
// typedef struct TWI_Config
// {
// /* data */
// uint32 scl_freq; // shouldn't exceed twi_max_scl supported
// uint8 scl_prescaler; // shouldn't ... | 2 |
hajoura89/simple_shell | 206621a | builtin1.c | C | www.github.com/hajoura89/simple_shell/tree/main/builtin1.c | https://raw.githubusercontent.com/hajoura89/simple_shell/206621a/builtin1.c | hajoura89/simple_shell 206621a builtin1.c | true | 200 | 1,001 | #include "main.h"
/**
* _cd - changes the current directory
* @info: cmd info structure
* Return: Always 0
*/
int _cd(cmdinfo_t *info)
{
char *s, *dir, buffer[1024];
int chdir_ret;
s = getcwd(buffer, 1024);
if (!s)
_puts("failure msg \n");
if (!info->argv[1])
{
dir = _getenvvalue(info, "HOME=");
if (!... | 3 |
Konstantin-Krokhin/Minishell | 7f6a0fb | libft/ft_atoi.c | C | www.github.com/Konstantin-Krokhin/Minishell/tree/main/libft/ft_atoi.c | https://raw.githubusercontent.com/Konstantin-Krokhin/Minishell/7f6a0fb/libft/ft_atoi.c | Konstantin-Krokhin/Minishell 7f6a0fb libft/ft_atoi.c | true | 200 | 5,622 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_atoi.c :+: :+: :+: ... | 7 |
agbuenoch/simple_shell | dfe9ca8 | my_atoi.c | C | www.github.com/agbuenoch/simple_shell/tree/main/my_atoi.c | https://raw.githubusercontent.com/agbuenoch/simple_shell/dfe9ca8/my_atoi.c | agbuenoch/simple_shell dfe9ca8 my_atoi.c | true | 200 | 1,252 | #include "shell.h"
/**
* interactive - returns true if shell is interactive mode
*
* @info: struct address
*
* Return: 1 if interactive mode, 0 otherwise
*/
int interactive(info_t *info)
{
return (isatty(STDIN_FILENO) && info->readfd <= 2);
}
/**
* is_delim - checks if character is a delimeter
* @c: the char to check
*... | 1 |
Feanor-19/tree | b1b9d33 | src/tree_common.h | C | www.github.com/Feanor-19/tree/tree/main/src/tree_common.h | https://raw.githubusercontent.com/Feanor-19/tree/b1b9d33/src/tree_common.h | Feanor-19/tree b1b9d33 src/tree_common.h | true | 200 | 2,896 | #ifndef TREE_COMMON_H
#define TREE_COMMON_H
#include <stdint.h>
#include <stdio.h>
/*
AVAILABLE DEFINES:
- TREE_DO_DUMP
- TREE_ABORT_ON_DUMP - requires TREE_DO_DUMP
*/
#ifndef NDEBUG
# define TREE_DO_DUMP
#endif
#ifdef TREE_DO_DUMP
typedef uint64_t tree_verify_t;
#endif /* TREE_DO_DUMP */
#define DE... | 6 |
Ahmed-Foullane/exerices_sur_les_tableu | 9a513fc | 11_remplacer_un_élément.c | C | www.github.com/Ahmed-Foullane/exerices_sur_les_tableu/tree/main/11_remplacer_un_élément.c | https://raw.githubusercontent.com/Ahmed-Foullane/exerices_sur_les_tableu/9a513fc/11_remplacer_un_%C3%A9l%C3%A9ment.c | Ahmed-Foullane/exerices_sur_les_tableu 9a513fc 11_remplacer_un_élément.c | true | 200 | 1,403 | // écrivz un programme c qui remplace toutes les occurrences d'une valeur spécifique
// dans un tableau d'ntiers par une nouvelle valeur. le programmedoit demander
// a l'utilisateur le nombre d"éléments, les éléments du tableau, la valeur a remplacer, et la nouvell valeur.
// écrivz un programme c qui remplace tout... | 5 |
The-alpha-male/binary_trees | 668db9f | 17-binary_tree_sibling.c | C | www.github.com/The-alpha-male/binary_trees/tree/main/17-binary_tree_sibling.c | https://raw.githubusercontent.com/The-alpha-male/binary_trees/668db9f/17-binary_tree_sibling.c | The-alpha-male/binary_trees 668db9f 17-binary_tree_sibling.c | true | 200 | 562 | #include <stdlib.h>
#include <stdio.h>
#include "binary_trees.h"
/**
* binary_tree_sibling - finds the sibling of a node
* @node: pointer to the node to find the sibling
*
* Return: pointer to the sibling node, or NULL if node is NULL or no sibling
*/
binary_tree_t *binary_tree_sibling(binary_tree_t *node)
{
bina... | 2 |
eve1moms/simple_shell | eb5b60b | _shell.c | C | www.github.com/eve1moms/simple_shell/tree/main/_shell.c | https://raw.githubusercontent.com/eve1moms/simple_shell/eb5b60b/_shell.c | eve1moms/simple_shell eb5b60b _shell.c | true | 200 | 3,139 | #include "shell.h"
/**
* _shell - this function is the main shell loop
* @av: this is the argument vecor
* @info: this pointer to the parametr and retuen info struct
* Ths funcion is reponsible for runnig the main loop of shell
* Return: on success 0 on error 1 or and rror message
*/
int _shell(p_info_t *info, c... | 3 |
Abheyjeet0007/Code-Radar-Solutions | 7f3069c | Check Leap Year@@6788dd63490637cfc44e1b90/code.c | C | www.github.com/Abheyjeet0007/Code-Radar-Solutions/tree/main/Check Leap Year@@6788dd63490637cfc44e1b90/code.c | https://raw.githubusercontent.com/Abheyjeet0007/Code-Radar-Solutions/7f3069c/Check%20Leap%20Year%40%406788dd63490637cfc44e1b90/code.c | Abheyjeet0007/Code-Radar-Solutions 7f3069c Check Leap Year@@6788dd63490637cfc44e1b90/code.c | true | 200 | 281 | #include <stdio.h>
char* welcome() {
return "Welcome to Code Radar!";
}
int main() {
int a;
scanf("%d",&a);
if((a%400==0)||(a%4==0)&&(a%100!=0)){
printf("Leap Year");
}
else{
printf("Not a Leap Year");
}
return 0;
} | 7 |
DevIago15/projects_target | c4b2a45 | fibonnaci.c | C | www.github.com/DevIago15/projects_target/tree/main/fibonnaci.c | https://raw.githubusercontent.com/DevIago15/projects_target/c4b2a45/fibonnaci.c | DevIago15/projects_target c4b2a45 fibonnaci.c | true | 200 | 713 | #include <stdio.h>
int fibonacci(int n, int fib[]) {
fib[0] = 0;
fib[1] = 1;
int i = 2;
while(fib[i-1] + fib[i-2] <= n) {
fib[i] = fib[i-1] + fib[i-2];
i++;
}
return i;
}
int main() {
int num;
int i;
printf("Digite um Numero: ");
scanf("%d", &num);
int fib_seq[... | 6 |
marwaneds/MiniTalk | 11d6ed3 | src/client.c | C | www.github.com/marwaneds/MiniTalk/tree/main/src/client.c | https://raw.githubusercontent.com/marwaneds/MiniTalk/11d6ed3/src/client.c | marwaneds/MiniTalk 11d6ed3 src/client.c | true | 200 | 1,996 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* client.c :+: :+: :+: ... | 1 |
ga-hirakawa/university-codes | 5f26d6e | SCC0220 - Introduction to Computer Science II Laboratory/8-date.c | C | www.github.com/ga-hirakawa/university-codes/tree/main/SCC0220 - Introduction to Computer Science II Laboratory/8-date.c | https://raw.githubusercontent.com/ga-hirakawa/university-codes/5f26d6e/SCC0220%20-%20Introduction%20to%20Computer%20Science%20II%20Laboratory/8-date.c | ga-hirakawa/university-codes 5f26d6e SCC0220 - Introduction to Computer Science II Laboratory/8-date.c | true | 200 | 1,953 | #include <stdio.h>
#include <stdlib.h>
typedef struct data{
int d;
int m;
int a;
} Data;
long mergeSort(Data *A, int p, int r);
long intercala(Data *A, int p, int q, int r);
int compare(Data A, Data B);
int main(void){
int n;
Data *datas;
scanf("%d", &n);
datas = (Data*)m... | 5 |
alivejojo/Data-Structures-and-Algorithms-DSA | cf3778a | AVL Tree/q1_A2.c | C | www.github.com/alivejojo/Data-Structures-and-Algorithms-DSA/tree/main/AVL Tree/q1_A2.c | https://raw.githubusercontent.com/alivejojo/Data-Structures-and-Algorithms-DSA/cf3778a/AVL%20Tree/q1_A2.c | alivejojo/Data-Structures-and-Algorithms-DSA cf3778a AVL Tree/q1_A2.c | true | 200 | 18,361 | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <stdbool.h>
// Create Node
typedef struct Node {
char model_name[200];
int price;
char company[200];
// float cam;
char cam[200];
char color[50];
int RAM;
int battery;
bool rem_battery;
//this tree is searched usi... | 2 |
asilajdzic/Uvod-u-programiranje | 87a2736 | Z1/Z2/main.c | C | www.github.com/asilajdzic/Uvod-u-programiranje/tree/main/Z1/Z2/main.c | https://raw.githubusercontent.com/asilajdzic/Uvod-u-programiranje/87a2736/Z1/Z2/main.c | asilajdzic/Uvod-u-programiranje 87a2736 Z1/Z2/main.c | true | 200 | 1,621 | #include <stdio.h>
#include <math.h>
#define e 0.0001
int main()
{
float p1,q1,r1,p2,q2,r2,d;
float x,y,x1,x2,y1,y2,a,h,b,m,n;
printf("Unesite koordinate centra kruznice A: ");
scanf("%f%f",&p1,&q1);
printf("Unesite poluprecnik kruznice A: ");
scanf("%f",&r1);
if(r1<=0)
{
printf("Pogresan unos !");
retur... | 3 |
kavy0707/C-programing | 3e9dadf | c language/other pro/dma.c | C | www.github.com/kavy0707/C-programing/tree/main/c language/other pro/dma.c | https://raw.githubusercontent.com/kavy0707/C-programing/3e9dadf/c%20language/other%20pro/dma.c | kavy0707/C-programing 3e9dadf c language/other pro/dma.c | true | 200 | 1,329 | /*
types :
malloc p = (p -type*) malloc(n*size in bite)
calloc p= (p-type*) callocn(n,size of bite)
free free(p)
realloc p= (p-type*) realloc(p,new size of bite)
*/
#include <stdio.h>
#include <stdlib.h>
void main()
{
// use of malloc
int *p, n;
/*
p = (int *)malloc(n * sizeof(int));
printf("ente... | 6 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.