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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
code-master-lab/c-language-tutorial | 1fddb87 | 2Darray/studentmarks.c | C | www.github.com/code-master-lab/c-language-tutorial/tree/main/2Darray/studentmarks.c | https://raw.githubusercontent.com/code-master-lab/c-language-tutorial/1fddb87/2Darray/studentmarks.c | code-master-lab/c-language-tutorial 1fddb87 2Darray/studentmarks.c | true | 200 | 930 | // thise programme is related to students number and mark
//Giving a marks of number of students
//row is defind number of student and coloumn define number of mark
#include <stdio.h>
int main() {
int students;
// Input: Number of students
printf("Enter the number of students: ");
scanf("%d", ... | 0 |
scuranger0625/FinTech-Program-Programming-and-Applications-in-C | 96bee81 | 5_1字串.c | C | www.github.com/scuranger0625/FinTech-Program-Programming-and-Applications-in-C/tree/main/5_1字串.c | https://raw.githubusercontent.com/scuranger0625/FinTech-Program-Programming-and-Applications-in-C/96bee81/5_1%E5%AD%97%E4%B8%B2.c | scuranger0625/FinTech-Program-Programming-and-Applications-in-C 96bee81 5_1字串.c | true | 200 | 411 | /*寫一個程式，指定一個變數，
設定一個文字變數 Hello, Dice，然後印出來。*/
#include <stdio.h>
int main() {
// 定義一個字串變數text
char text[] = "Hello, Dice";
/* %s 是 格式指定符（format specifier），
用來表示 字串（string），通常與 printf()
或 scanf() 函式一起使用。*/
printf("%s\n",text);
return 0;
} | 6 |
ningninger/code-of-jyyos | bac505b | 1-concurrency/1/3-alipay/alipay.c | C | www.github.com/ningninger/code-of-jyyos/tree/main/1-concurrency/1/3-alipay/alipay.c | https://raw.githubusercontent.com/ningninger/code-of-jyyos/bac505b/1-concurrency/1/3-alipay/alipay.c | ningninger/code-of-jyyos bac505b 1-concurrency/1/3-alipay/alipay.c | true | 200 | 432 | #include "thread.h"
unsigned long balance = 100;//共享变量
void Alipay_withdraw(int amt) {
if (balance >= amt) {
usleep(1); // Unexpected delays
//因为延迟的产生，这个时候if语句可能已经不满足条件了
balance -= amt;
}
}
void Talipay(int id) {
Alipay_withdraw(100);
}
int main() {
create(Talipay);
create(Talipa... | 4 |
C0ulday/TP_C_ESISAR | 141845a | tp4/exo2/lib.c | C | www.github.com/C0ulday/TP_C_ESISAR/tree/main/tp4/exo2/lib.c | https://raw.githubusercontent.com/C0ulday/TP_C_ESISAR/141845a/tp4/exo2/lib.c | C0ulday/TP_C_ESISAR 141845a tp4/exo2/lib.c | true | 200 | 2,765 | #include <stdio.h>
#include <stdlib.h>
#include "lib.h"
int myStrlen(char mot[]){
int i=0;
while(mot[i]!= '\0'){
i++;
}
return i; // sans caractere '\0'
}
char* myStrcpy(char* destination, char* Acopier){
if(destination ==NULL || Acopier ==NULL) perror("Emplacement(s) non defini(s)");... | 3 |
gunner206/alx-low_level_programming | 09bff51 | 0x10-variadic_functions/0-sum_them_all.c | C | www.github.com/gunner206/alx-low_level_programming/tree/main/0x10-variadic_functions/0-sum_them_all.c | https://raw.githubusercontent.com/gunner206/alx-low_level_programming/09bff51/0x10-variadic_functions/0-sum_them_all.c | gunner206/alx-low_level_programming 09bff51 0x10-variadic_functions/0-sum_them_all.c | true | 200 | 417 | #include "variadic_functions.h"
/**
* sum_them_all - function that returns the sum of all its parameters
* @n: number of parametters
*
* Return: sum
*/
int sum_them_all(const unsigned int n, ...)
{
va_list args;
unsigned int i;
int sum = 0;
int x;
va_start(args, n);
if (n == 0)
{
return (0);
}
for (... | 2 |
lucas-sss/SSL-TEST | ae44fde | tun.c | C | www.github.com/lucas-sss/SSL-TEST/tree/main/tun.c | https://raw.githubusercontent.com/lucas-sss/SSL-TEST/ae44fde/tun.c | lucas-sss/SSL-TEST ae44fde tun.c | true | 200 | 2,474 | #include <assert.h>
#include <errno.h>
#include <fcntl.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/ioctl.h>
#include <sys/socket.h>
#include <sys/types.h>
#include <linux/if.h>
#include <linux/if_tun.h>
#include <unistd.h>
#include "tun.h"
/**
* @brief 配置虚拟网卡
*
*
* @param tunCfg
*... | 1 |
dunghh90/x-wallet-bk | 321ad6c | it_sim/artiza-5g-project/cpri-int/soft/src/pf/ft_com/com/src/f_com_iniSysParaTbl.c | C | www.github.com/dunghh90/x-wallet-bk/tree/main/it_sim/artiza-5g-project/cpri-int/soft/src/pf/ft_com/com/src/f_com_iniSysParaTbl.c | https://raw.githubusercontent.com/dunghh90/x-wallet-bk/321ad6c/it_sim/artiza-5g-project/cpri-int/soft/src/pf/ft_com/com/src/f_com_iniSysParaTbl.c | dunghh90/x-wallet-bk 321ad6c it_sim/artiza-5g-project/cpri-int/soft/src/pf/ft_com/com/src/f_com_iniSysParaTbl.c | true | 200 | 6,013 | /*!
* @skip $ld:$
* @file f_com_iniSysParaTbl.c
* @brief pf_main テーブルのsystem parameter初期化処理
* @author FFCS)linb
* @date 2014/12/16 FFCS)linb Create
*
* All Rights Reserved, Copyright (C) FUJITSU LIMITED 2014
*/
/*!
* @addtogroup RRH_PF_MAIN
* @{
*/
#include "f_com_inc.h"
/*!
* @brief... | 0 |
HUS1904/MACHINE-PROJEKT-2 | 3d099b2 | Yukon/Card.c | C | www.github.com/HUS1904/MACHINE-PROJEKT-2/tree/main/Yukon/Card.c | https://raw.githubusercontent.com/HUS1904/MACHINE-PROJEKT-2/3d099b2/Yukon/Card.c | HUS1904/MACHINE-PROJEKT-2 3d099b2 Yukon/Card.c | true | 200 | 2,113 | #include <string.h>
#include <stdbool.h>
typedef struct cardType Card;
struct cardType {
char name[2];
char suit; // Clubs, Hearts, Diamonds, Spades (C, H, D, S)
int precedence; // Ace through King (A,1,...9,T,J,Q,K)
bool hidden; // Whether the card is visible or not
Card *next; // The card on top... | 5 |
dominic-source/alx-low_level_programming | 05dc257 | 0x06-pointers_arrays_strings/5-string_toupper.c | C | www.github.com/dominic-source/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/5-string_toupper.c | https://raw.githubusercontent.com/dominic-source/alx-low_level_programming/05dc257/0x06-pointers_arrays_strings/5-string_toupper.c | dominic-source/alx-low_level_programming 05dc257 0x06-pointers_arrays_strings/5-string_toupper.c | true | 200 | 334 | #include "main.h"
/**
* string_toupper - convert letter to uppercase
* Return: a pointer to char
* @str: char argument
*/
char *string_toupper(char *str)
{
int i = 0;
int j = 0;
while (*(str + i) != '\0')
{
j = 0;
while (j < 26)
{
if (*(str + i) == ('a' + j))
{
*(str + i) = *(str + i) - 32;
}
else
j++;
}
i++;
}
re... | 7 |
Badr-Annabi/alx-higher_level_programming | 7a59c61 | 0x03-python-data_structures/13-is_palindrome.c | C | www.github.com/Badr-Annabi/alx-higher_level_programming/tree/main/0x03-python-data_structures/13-is_palindrome.c | https://raw.githubusercontent.com/Badr-Annabi/alx-higher_level_programming/7a59c61/0x03-python-data_structures/13-is_palindrome.c | Badr-Annabi/alx-higher_level_programming 7a59c61 0x03-python-data_structures/13-is_palindrome.c | true | 200 | 778 | #include "lists.h"
/**
* is_palindrome - checks if a singly linked list is a palindrome.
* @head: pointer to the first node of the list.
* Return: 1 if the list is a palindrome, 0 if not
*/
int is_palindrome(listint_t **head)
{
listint_t *fast = *head;
listint_t *slow = *head;
listint_t *first_half = NULL;
lis... | 6 |
Pietro2704/data-structure | b70e768 | SENHA/desafio3.c | C | www.github.com/Pietro2704/data-structure/tree/main/SENHA/desafio3.c | https://raw.githubusercontent.com/Pietro2704/data-structure/b70e768/SENHA/desafio3.c | Pietro2704/data-structure b70e768 SENHA/desafio3.c | true | 200 | 537 | #include<stdio.h>
#include<stdlib.h>
#include<locale.h>
int main(){
setlocale(LC_ALL, "Portuguese");
int senha, chute;
int vidas = 3;
printf("1 - Digite a senha: ");
scanf("%i", &senha);
system("cls");
while(vidas>0){
printf("\n2 - Qual é a senha? ");
scanf("%i", &chute);
if(senha == chute){... | 3 |
twinmagixx/alx-low_level_programming | 9479ea4 | 0x02-functions_nested_loops/103-fibonacci.c | C | www.github.com/twinmagixx/alx-low_level_programming/tree/main/0x02-functions_nested_loops/103-fibonacci.c | https://raw.githubusercontent.com/twinmagixx/alx-low_level_programming/9479ea4/0x02-functions_nested_loops/103-fibonacci.c | twinmagixx/alx-low_level_programming 9479ea4 0x02-functions_nested_loops/103-fibonacci.c | true | 200 | 470 | #include <stdio.h>
#include <stdlib.h>
/**
* main - prints the first 50 Fibonacci numbers, starting with 1 and 2, followed by a new line. The numbers must be separated by comma, followed by a space.
*
* Return: Always (Success)
*/
int main(void)
{
double a = 0;
double b = 1;
double sum = 0;
double f;
int i, pair;... | 4 |
Parth-83919/RTOS_Assignment | e4af091 | Day4_3.c | C | www.github.com/Parth-83919/RTOS_Assignment/tree/main/Day4_3.c | https://raw.githubusercontent.com/Parth-83919/RTOS_Assignment/e4af091/Day4_3.c | Parth-83919/RTOS_Assignment e4af091 Day4_3.c | true | 200 | 2,526 | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<sched.h>
#include<signal.h>
#include<unistd.h>
#include<sys/shm.h>
#include<sys/wait.h>
#include<pthread.h>
typedef struct shm {
pthread_mutex_t m;
pthread_mutexattr_t ma;
pthread_cond_t c;
pthread_condattr_t ca;
int wakeup;
} shm_t;
... | 2 |
AAyoub-0/philo | 4fc75e1 | src/philo.c | C | www.github.com/AAyoub-0/philo/tree/main/src/philo.c | https://raw.githubusercontent.com/AAyoub-0/philo/4fc75e1/src/philo.c | AAyoub-0/philo 4fc75e1 src/philo.c | true | 200 | 1,580 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* philo.c :+: :+: :+: ... | 0 |
frank731/pill-dispenser | 286ff08 | STM Files/Core/Inc/main.h | C | www.github.com/frank731/pill-dispenser/tree/main/STM Files/Core/Inc/main.h | https://raw.githubusercontent.com/frank731/pill-dispenser/286ff08/STM%20Files/Core/Inc/main.h | frank731/pill-dispenser 286ff08 STM Files/Core/Inc/main.h | true | 200 | 2,706 | /* USER CODE BEGIN Header */
/**
******************************************************************************
* @file : main.h
* @brief : Header for main.c file.
* This file contains the common defines of the application.
*************************************************... | 1 |
JamesonJC/alx-low_level_programming | 0d64a53 | 0x14-bit_manipulation/5-flip_bits.c | C | www.github.com/JamesonJC/alx-low_level_programming/tree/main/0x14-bit_manipulation/5-flip_bits.c | https://raw.githubusercontent.com/JamesonJC/alx-low_level_programming/0d64a53/0x14-bit_manipulation/5-flip_bits.c | JamesonJC/alx-low_level_programming 0d64a53 0x14-bit_manipulation/5-flip_bits.c | true | 200 | 605 | #include "main.h"
/**
* flip_bits - Number of bits need to be flipped to get from 1 num to another
* @n: The first number
* @m: The second number
* Return: The value of occurance of flips
*/
unsigned int flip_bits(unsigned long int n, unsigned long int m)
{
/*Initializations*/
unsigned long int xor = n ^ m;
u... | 5 |
Ravenports/ravensource | f27cf99 | bucket_2E/zsh/patches/patch-Src_Modules_watch.c | C | www.github.com/Ravenports/ravensource/tree/main/bucket_2E/zsh/patches/patch-Src_Modules_watch.c | https://raw.githubusercontent.com/Ravenports/ravensource/f27cf99/bucket_2E/zsh/patches/patch-Src_Modules_watch.c | Ravenports/ravensource f27cf99 bucket_2E/zsh/patches/patch-Src_Modules_watch.c | true | 200 | 525 | --- Src/Modules/watch.c.orig 2022-05-08 06:18:22 UTC
+++ Src/Modules/watch.c
@@ -30,9 +30,21 @@
#include "watch.mdh"
/* Headers for utmp/utmpx structures */
+
+# if defined(__DragonFly__) || defined(__FreeBSD__) || defined(__MidnightBSD__)
+# if defined(HAVE_UTMP_H) && !defined(HAVE_UTMPX_H)
+# include <utmp.h>... | 6 |
Niklas-Seppala/c-utl | bc1d73f | test/include/test.h | C | www.github.com/Niklas-Seppala/c-utl/tree/main/test/include/test.h | https://raw.githubusercontent.com/Niklas-Seppala/c-utl/bc1d73f/test/include/test.h | Niklas-Seppala/c-utl bc1d73f test/include/test.h | true | 200 | 355 | #if !defined(GUARD_TEST_H)
#define GUARD_TEST_H
#include <check.h>
#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include "../include/ctl/io/logger.h"
typedef void (*TestCase)(int);
#define PRINTF_TEST(format, ...) CTLLogPrintf(CTL_TEST, format, __VA_ARGS__)
Suite *test_add_case(Suite *suite, const TT... | 3 |
AlinaKhairullina/cmc_2nd | c35ac45 | CC++/dz/dz2/dz22.c | C | www.github.com/AlinaKhairullina/cmc_2nd/tree/main/CC++/dz/dz2/dz22.c | https://raw.githubusercontent.com/AlinaKhairullina/cmc_2nd/c35ac45/CC%2B%2B/dz/dz2/dz22.c | AlinaKhairullina/cmc_2nd c35ac45 CC++/dz/dz2/dz22.c | true | 200 | 909 | #include <stdio.h>
typedef unsigned int uint;
/*Если в x старший байт не равен его младшему байту, поменять эти байты местами, иначе обнулить остальные (все, кроме старшего и младшего) байты в x.*/
uint change(uint x)
{
uint c = 0x00ffff00; //маска
if ((x >> 24) != (x & 0x000000ff)) // если x1 != x4
... | 4 |
TrudyB-T/alx-low_level_programming | c86efd2 | 0x07-pointers_arrays_strings/5-strstr.c | C | www.github.com/TrudyB-T/alx-low_level_programming/tree/main/0x07-pointers_arrays_strings/5-strstr.c | https://raw.githubusercontent.com/TrudyB-T/alx-low_level_programming/c86efd2/0x07-pointers_arrays_strings/5-strstr.c | TrudyB-T/alx-low_level_programming c86efd2 0x07-pointers_arrays_strings/5-strstr.c | true | 200 | 374 | #include "main.h"
/**
* _strstr - locates a substring
* @needle: substring
* @haystack: string
*
* Return: Always 0
*/
char *_strstr(char *haystack, char *needle)
{
for (; *haystack != '\0'; haystack++)
{
char *h = haystack;
char *n = needle;
while (*h == *n && *n != '\0')
{
h++;
n++;
}
if... | 2 |
bulupubulupu/longxin | 1ec17e0 | WaterQualityTesting/test/pwm0_dome.c | C | www.github.com/bulupubulupu/longxin/tree/main/WaterQualityTesting/test/pwm0_dome.c | https://raw.githubusercontent.com/bulupubulupu/longxin/1ec17e0/WaterQualityTesting/test/pwm0_dome.c | bulupubulupu/longxin 1ec17e0 WaterQualityTesting/test/pwm0_dome.c | true | 200 | 4,305 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#define PWM_CHIP_PATH "/sys/class/pwm/pwmchip0/"
#define PWM_EXPORT_PATH PWM_CHIP_PATH "export"
#define PWM_UNEXPORT_PATH PWM_CHIP_PATH "unexport"
#define PWM_PERIOD_PATH PWM_CHIP_PATH "pwm0/period"
#define PWM_DUTY_CYCLE_PATH PWM_CHIP_PATH... | 0 |
Cleroy288/42_Cursus | 34b5c3f | minishell/get_env_var_name.c | C | www.github.com/Cleroy288/42_Cursus/tree/main/minishell/get_env_var_name.c | https://raw.githubusercontent.com/Cleroy288/42_Cursus/34b5c3f/minishell/get_env_var_name.c | Cleroy288/42_Cursus 34b5c3f minishell/get_env_var_name.c | true | 200 | 2,427 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* get_env_var_name.c :+: :+: :+: ... | 1 |
dmytroshytyi-6WIND/l2fwd-nv-rtx4090 | d52b6f2 | external/dpdk/lib/cryptodev/cryptodev_pmd.c | C | www.github.com/dmytroshytyi-6WIND/l2fwd-nv-rtx4090/tree/main/external/dpdk/lib/cryptodev/cryptodev_pmd.c | https://raw.githubusercontent.com/dmytroshytyi-6WIND/l2fwd-nv-rtx4090/d52b6f2/external/dpdk/lib/cryptodev/cryptodev_pmd.c | dmytroshytyi-6WIND/l2fwd-nv-rtx4090 d52b6f2 external/dpdk/lib/cryptodev/cryptodev_pmd.c | true | 200 | 5,960 | /* SPDX-License-Identifier: BSD-3-Clause
* Copyright(c) 2017 Intel Corporation
*/
#include <rte_errno.h>
#include <rte_malloc.h>
#include <rte_string_fns.h>
#include <sys/queue.h>
#include "cryptodev_pmd.h"
/**
* Parse name from argument
*/
static int rte_cryptodev_pmd_parse_name_arg(const char *key __rte_unused... | 5 |
DhirendranathBarmanBappy/C-programing-pps | 662d0ec | Series tutorial problem solving/1 divided by n number with sum.c | C | www.github.com/DhirendranathBarmanBappy/C-programing-pps/tree/main/Series tutorial problem solving/1 divided by n number with sum.c | https://raw.githubusercontent.com/DhirendranathBarmanBappy/C-programing-pps/662d0ec/Series%20tutorial%20problem%20solving/1%20divided%20by%20n%20number%20with%20sum.c | DhirendranathBarmanBappy/C-programing-pps 662d0ec Series tutorial problem solving/1 divided by n number with sum.c | true | 200 | 439 | #include<stdio.h>
int main()
{
double sum=0,i,n;
printf("Enter number of n: ");
scanf("%lf",&n);
for(i=1;i<=n;i++)
{
sum=sum+1/i;
if(i==1)
printf("\n 1 + ");
else if(i==n)
{
printf("1/%.2lf",i);
}
... | 6 |
5rujana/DSA-in-C | 0a63090 | creation_traversal_BST.c | C | www.github.com/5rujana/DSA-in-C/tree/main/creation_traversal_BST.c | https://raw.githubusercontent.com/5rujana/DSA-in-C/0a63090/creation_traversal_BST.c | 5rujana/DSA-in-C 0a63090 creation_traversal_BST.c | true | 200 | 1,650 | #include<stdio.h>
#include<stdlib.h>
struct node{
int data;
struct node *left;
struct node *right;
};
struct node* newnode(int data) {
struct node* newnode = (struct node*)malloc(sizeof(struct node));
newnode->left = NULL;
newnode->right = NULL;
newnode->data = data;
retu... | 3 |
p0lyh3dron/hobknights | c624bbf | src/base/sprite.c | C | www.github.com/p0lyh3dron/hobknights/tree/main/src/base/sprite.c | https://raw.githubusercontent.com/p0lyh3dron/hobknights/c624bbf/src/base/sprite.c | p0lyh3dron/hobknights c624bbf src/base/sprite.c | true | 200 | 4,722 | /*
* sprite.c -- source for sprite operations
*
* Authored by Karl "p0lyh3dron" Kreuze on October 15, 2022.
*
* This file is part of the Chik game base.
*
* This file defines functions for creating and rendering sprites.
*/
#include "sprite.h"
#ifdef __unix__
#include <dirent.h>
#endif
#incl... | 4 |
Tosin61/OS-Lab3-Part1 | 209d065 | pipes_processes2.c | C | www.github.com/Tosin61/OS-Lab3-Part1/tree/main/pipes_processes2.c | https://raw.githubusercontent.com/Tosin61/OS-Lab3-Part1/209d065/pipes_processes2.c | Tosin61/OS-Lab3-Part1 209d065 pipes_processes2.c | true | 200 | 1,621 | #include <stdio.h>
#include <unistd.h>
#include <fcntl.h>
#include <sys/types.h>
#include <sys/stat.h>
/**
* Executes the command "cat scores | grep Lakers". In this quick-and-dirty
* implementation the parent doesn't wait for the child to finish and
* so the command prompt may reappear before the child terminates... | 7 |
CharlesBC2023/OSAssignment1 | 238f243 | Ass 1/charles_biffin_hw1/bccat/bccat.c | C | www.github.com/CharlesBC2023/OSAssignment1/tree/main/Ass 1/charles_biffin_hw1/bccat/bccat.c | https://raw.githubusercontent.com/CharlesBC2023/OSAssignment1/238f243/Ass%201/charles_biffin_hw1/bccat/bccat.c | CharlesBC2023/OSAssignment1 238f243 Ass 1/charles_biffin_hw1/bccat/bccat.c | true | 200 | 302 | #include <stdio.h>
#include <stdlib.h>
int main(int argc, char *argv[]) {
for (int i = 1; i < argc; i++) {
FILE *file = fopen(argv[i], "r");
int c;
while ((c = fgetc(file)) != EOF) {
putchar(c);
}
fclose(file);
}
return 0;
} | 1 |
EmmaAdabra/alx-low_level_programming | 3f91b63 | 0x10-variadic_functions/0-sum_them_all.c | C | www.github.com/EmmaAdabra/alx-low_level_programming/tree/main/0x10-variadic_functions/0-sum_them_all.c | https://raw.githubusercontent.com/EmmaAdabra/alx-low_level_programming/3f91b63/0x10-variadic_functions/0-sum_them_all.c | EmmaAdabra/alx-low_level_programming 3f91b63 0x10-variadic_functions/0-sum_them_all.c | true | 200 | 557 | #include "variadic_functions.h"
/**
* sum_them_all - Returns the sum of all its paramters.
* @n: The number of paramters passed to the function.
* @...: A variable number of paramters to calculate the sum of.
*
* Return: If n == 0 - 0.
* Otherwise - the sum of all parameters.
*/
int sum_them_all(const ... | 0 |
Toxaencom1/BaseC_DZ3 | 48ebd8c | DZ5/DZ5_4.c | C | www.github.com/Toxaencom1/BaseC_DZ3/tree/main/DZ5/DZ5_4.c | https://raw.githubusercontent.com/Toxaencom1/BaseC_DZ3/48ebd8c/DZ5/DZ5_4.c | Toxaencom1/BaseC_DZ3 48ebd8c DZ5/DZ5_4.c | true | 200 | 705 | #include <stdio.h>
/* Задача 4. Сумма от 1 до N
Составить функцию, которая определяет сумму всех чисел от 1 до N и
привести пример ее использования.
*/
int allNumbersSumm(int num)
{
int res = 0;
for (int i = 1; i <= num; i++)
{
res += i;
}
return res;
}
int main()
{
int num;
prin... | 2 |
aditya-arcot/C-Exercises | d0e7c58 | 04_functions_program_structure/01_filter_lines.c | C | www.github.com/aditya-arcot/C-Exercises/tree/main/04_functions_program_structure/01_filter_lines.c | https://raw.githubusercontent.com/aditya-arcot/C-Exercises/d0e7c58/04_functions_program_structure/01_filter_lines.c | aditya-arcot/C-Exercises d0e7c58 04_functions_program_structure/01_filter_lines.c | true | 200 | 1,576 | // print each line of input that contains a string
#include <stdio.h>
#define MAX_LINE 5
#define NULL_CHAR '\0'
int get_line(char line[], int max);
int find_substring_idx(char str[], char substr[]);
int main(void) {
char line[MAX_LINE + 1]; // 1 extra for null terminator
char pattern[] = "abc";
// whil... | 5 |
uguu-org/magero | 22fc348 | data/collect_tile_layers.c | C | www.github.com/uguu-org/magero/tree/main/data/collect_tile_layers.c | https://raw.githubusercontent.com/uguu-org/magero/22fc348/data/collect_tile_layers.c | uguu-org/magero 22fc348 data/collect_tile_layers.c | true | 200 | 7,290 | /* Given a list of coordinates and a set of layer images, gather tiles from
the same coordinates across all layers and merge them into a single image.
./collect_tile_layers {output.png} {points.txt} {input.png...}
This is useful for checking the consistency of breakable/collectible
tile images, without ha... | 3 |
Roudra25/-Average-3 | 87a35e6 | 1040.c | C | www.github.com/Roudra25/-Average-3/tree/main/1040.c | https://raw.githubusercontent.com/Roudra25/-Average-3/87a35e6/1040.c | Roudra25/-Average-3 87a35e6 1040.c | true | 200 | 641 |
#include<stdio.h>
int main ()
{
float a,b,c,d,e;
double avg1,avg2;
scanf("%f %f %f %f",&a,&b,&c,&d);
avg1=((a*2)+(b*3)+(c*4)+d)/10;
printf("Media: %.1lf\n",avg1);
if(avg1>=7.0)
printf("Aluno aprovado.\n");
else if(avg1<5.0 )
printf("Aluno reprovado.\n");
... | 4 |
syrinetrabelsiii/holbertonschool-low_level_programming | 6f017a6 | 0x04-more_functions_nested_loops/0-isupper.c | C | www.github.com/syrinetrabelsiii/holbertonschool-low_level_programming/tree/main/0x04-more_functions_nested_loops/0-isupper.c | https://raw.githubusercontent.com/syrinetrabelsiii/holbertonschool-low_level_programming/6f017a6/0x04-more_functions_nested_loops/0-isupper.c | syrinetrabelsiii/holbertonschool-low_level_programming 6f017a6 0x04-more_functions_nested_loops/0-isupper.c | true | 200 | 218 | #include "holberton.h"
/**
* _isupper - checks for uppercase character
* @c: int
* Return: 0
*/
int _isupper(int c)
{
char i;
for (i = 'A'; i <= 'Z'; i++)
if (c >= 'A' && c <= 'Z')
return (1);
return (0);
}
| 7 |
davidgiven/glueesp | 663b957 | src/glue/sym.h | C | www.github.com/davidgiven/glueesp/tree/main/src/glue/sym.h | https://raw.githubusercontent.com/davidgiven/glueesp/663b957/src/glue/sym.h | davidgiven/glueesp 663b957 src/glue/sym.h | true | 200 | 2,276 | /***********************************************************************
*
* Copyright (c) Berkeley Softworks 1989 -- All Rights Reserved
*
* PROJECT: PCGEOS
* MODULE: Glue -- Symbol Definitions
* FILE: sym.h
*
* AUTHOR: Adam de Boor: Oct 21, 1989
*
* REVISION HISTORY:
* Date Name Description... | 1 |
Molodchina/MSU-OS-Prac | 91df97f | doom-jos/doomgeneric_sdl.c | C | www.github.com/Molodchina/MSU-OS-Prac/tree/main/doom-jos/doomgeneric_sdl.c | https://raw.githubusercontent.com/Molodchina/MSU-OS-Prac/91df97f/doom-jos/doomgeneric_sdl.c | Molodchina/MSU-OS-Prac 91df97f doom-jos/doomgeneric_sdl.c | true | 200 | 4,027 | // doomgeneric for cross-platform development library 'Simple DirectMedia Layer'
#include <inc/lib.h>
#include "doomkeys.h"
#include "m_argv.h"
#include "doomgeneric.h"
window_d window = NULL;
renderer_d renderer = NULL;
texture_d texture = NULL;
#define KEYQUEUE_SIZE 16
static unsigned short s_KeyQueue[KEYQUEUE_S... | 6 |
m15115021148/OpenGl-car | 16cba05 | 8mic_ssp/ssp_hal/src/uni_4mic_i2c_driver.c | C | www.github.com/m15115021148/OpenGl-car/tree/main/8mic_ssp/ssp_hal/src/uni_4mic_i2c_driver.c | https://raw.githubusercontent.com/m15115021148/OpenGl-car/16cba05/8mic_ssp/ssp_hal/src/uni_4mic_i2c_driver.c | m15115021148/OpenGl-car 16cba05 8mic_ssp/ssp_hal/src/uni_4mic_i2c_driver.c | true | 200 | 5,622 | #include<sys/types.h>
#include<sys/stat.h>
#include<fcntl.h>
#include<sys/ioctl.h>
#include<stdio.h>
#include<stdlib.h>
#include <errno.h>
#include <pthread.h>
#include <stdint.h>
#include <sys/time.h>
#include <semaphore.h>
#include <unistd.h>
#include <string.h>
#include <linux/i2c.h>
#include <linux/i2c-dev.h>
#inc... | 0 |
swarupcoding56/C-PROGRAMMING- | 99dd917 | squarerootofanumber.c | C | www.github.com/swarupcoding56/C-PROGRAMMING-/tree/main/squarerootofanumber.c | https://raw.githubusercontent.com/swarupcoding56/C-PROGRAMMING-/99dd917/squarerootofanumber.c | swarupcoding56/C-PROGRAMMING- 99dd917 squarerootofanumber.c | true | 200 | 246 | #include <stdio.h>
int main(){
int m;int i;
printf(" ENTER A NUMBER: ");
scanf("%d",&m);
int number=1;
for (i=1;i<=(m-1);i++){
number=m/i;
if(number==i) printf("THE SQUARE ROOT OF %d is:%d",m,i);
}
return 0;
} | 2 |
Mathi27/InterviewPrep | b56988c | Level1/11.c | C | www.github.com/Mathi27/InterviewPrep/tree/main/Level1/11.c | https://raw.githubusercontent.com/Mathi27/InterviewPrep/b56988c/Level1/11.c | Mathi27/InterviewPrep b56988c Level1/11.c | true | 200 | 387 | // Get a three-digit number from user and print the ten’s digit.
#include<stdio.h>
int main(){
int x;
printf("Enter 2 Digit Number :");
scanf("%d",&x);
int unitDigitExtract = x%10; // it return the ones digit.
int tensDigitExtract = x/10; // remove the ones digit.
int result = unitDigitExtract +... | 5 |
kevinckorir/alx-low_level_programming | b1c8873 | 0x0B-malloc_free/3-alloc_grid.c | C | www.github.com/kevinckorir/alx-low_level_programming/tree/main/0x0B-malloc_free/3-alloc_grid.c | https://raw.githubusercontent.com/kevinckorir/alx-low_level_programming/b1c8873/0x0B-malloc_free/3-alloc_grid.c | kevinckorir/alx-low_level_programming b1c8873 0x0B-malloc_free/3-alloc_grid.c | true | 200 | 900 | #include "main.h"
#include <stdlib.h>
/**
* alloc_grid - creates a 2D array of integers
* @width: width of the array
* @height: height of the array
*
* Return: pointer to the 2D array, or NULL on failure
*/
int **alloc_grid(int width, int height)
{
int **grid;
int row, col;
if (width <= 0 || height <= 0)
r... | 3 |
bharatigore/C-Programming | 2fce09c | problems-on-numbers/program13.c | C | www.github.com/bharatigore/C-Programming/tree/main/problems-on-numbers/program13.c | https://raw.githubusercontent.com/bharatigore/C-Programming/2fce09c/problems-on-numbers/program13.c | bharatigore/C-Programming 2fce09c problems-on-numbers/program13.c | true | 200 | 426 | #include<stdio.h>
int SumNonFact(int iNo)
{
int iCnt =0;
int iSum =0;
for(iCnt = 1; iCnt <= iNo; iCnt++)
{
if((iNo % iCnt) != 0)
{
iSum = iSum + iCnt;
}
}
return iSum;
}
int main(){
int iValue = 0;
int iRet = 0;
printf("enter nu... | 4 |
chaejin-jen/cursus_inner | 619fca0 | circle_02/minitalk/bsrc/server_sigaction_bonus.c | C | www.github.com/chaejin-jen/cursus_inner/tree/main/circle_02/minitalk/bsrc/server_sigaction_bonus.c | https://raw.githubusercontent.com/chaejin-jen/cursus_inner/619fca0/circle_02/minitalk/bsrc/server_sigaction_bonus.c | chaejin-jen/cursus_inner 619fca0 circle_02/minitalk/bsrc/server_sigaction_bonus.c | true | 200 | 2,701 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* server_sigaction_bonus.c :+: :+: :+: ... | 7 |
eyadfattah23/alx-low_level_programming | c75f6c1 | 0x0A-argc_argv/1-args.c | C | www.github.com/eyadfattah23/alx-low_level_programming/tree/main/0x0A-argc_argv/1-args.c | https://raw.githubusercontent.com/eyadfattah23/alx-low_level_programming/c75f6c1/0x0A-argc_argv/1-args.c | eyadfattah23/alx-low_level_programming c75f6c1 0x0A-argc_argv/1-args.c | true | 200 | 223 | #include <stdio.h>
/**
* main - print count of args
* @argc: arguments count
* @argv: arguments vector
* Return: 0 (success)
*/
int main(int argc, char *argv[])
{
(void)argv;
printf("%d\n", argc - 1);
return (0);
}
| 6 |
NiniolaX/alx-low_level_programming | 706398b | 0x0C-more_malloc_free/0-malloc_checked.c | C | www.github.com/NiniolaX/alx-low_level_programming/tree/main/0x0C-more_malloc_free/0-malloc_checked.c | https://raw.githubusercontent.com/NiniolaX/alx-low_level_programming/706398b/0x0C-more_malloc_free/0-malloc_checked.c | NiniolaX/alx-low_level_programming 706398b 0x0C-more_malloc_free/0-malloc_checked.c | true | 200 | 292 | #include "main.h"
#include <stdlib.h>
/**
* malloc_checked - Allocates memory using malloc
* @b: Amount of memory to be allocated
* Return: Void
*/
void *malloc_checked(unsigned int b)
{
void *ptr = malloc(b);
if (ptr == NULL)
{
exit(98);
}
return (ptr);
}
| 0 |
havensjg/osdev-demos | 2506197 | 08-pagealloc/src/printf.c | C | www.github.com/havensjg/osdev-demos/tree/main/08-pagealloc/src/printf.c | https://raw.githubusercontent.com/havensjg/osdev-demos/2506197/08-pagealloc/src/printf.c | havensjg/osdev-demos 2506197 08-pagealloc/src/printf.c | true | 200 | 5,321 | #include <limits.h>
#include <stdarg.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <string.h>
#include <terminal.h>
const char *HEX_LOWERCASE = "0123456789abcdef";
const char *HEX_UPPERCASE = "0123456789ABCDEF";
/* Print a single character */
int putchar(int ic) {
char c... | 2 |
Mradegboyega/alx-low_level_programming | a494e56 | 0x0F-function_pointers/3-main.c | C | www.github.com/Mradegboyega/alx-low_level_programming/tree/main/0x0F-function_pointers/3-main.c | https://raw.githubusercontent.com/Mradegboyega/alx-low_level_programming/a494e56/0x0F-function_pointers/3-main.c | Mradegboyega/alx-low_level_programming a494e56 0x0F-function_pointers/3-main.c | true | 200 | 565 | #include <stdio.h>
#include <stdlib.h>
#include "3-calc.h"
/**
* main - Entry point of the program
* @argc: The number of arguments
* @argv: The array of arguments
*
* Return: 0 if successful, otherwise exit status.
*/
int main(int argc, char *argv[])
{
int a, b;
int result;
int (*calc_func)(int, int... | 5 |
luccasfoliveira/beecrowdC | 7d4ac5c | 1021.c | C | www.github.com/luccasfoliveira/beecrowdC/tree/main/1021.c | https://raw.githubusercontent.com/luccasfoliveira/beecrowdC/7d4ac5c/1021.c | luccasfoliveira/beecrowdC 7d4ac5c 1021.c | true | 200 | 809 | # include <stdio.h>
int main(){
double valor;
int nota, i;
scanf("%lf", &valor);
nota = 100;
printf("NOTAS:\n");
for(i = 0; i <= 5; i++){
printf("%d nota(s) de R$ %d.00\n", (int)(valor/nota), nota);
valor -= ((int)valor/nota * nota);
switch(nota){
case 100: nota = 50; break;
case 50: not... | 3 |
sthaarwin/DSA-Queue-Simulator | 4fe125e | src/traffic_simulation.h | C | www.github.com/sthaarwin/DSA-Queue-Simulator/tree/main/src/traffic_simulation.h | https://raw.githubusercontent.com/sthaarwin/DSA-Queue-Simulator/4fe125e/src/traffic_simulation.h | sthaarwin/DSA-Queue-Simulator 4fe125e src/traffic_simulation.h | true | 200 | 2,458 | #ifndef TRAFFIC_SIMULATION_H
#define TRAFFIC_SIMULATION_H
#include <SDL.h>
#include <stdbool.h>
#define WINDOW_WIDTH 800
#define WINDOW_HEIGHT 600
#define LANE_WIDTH 80
#define MAX_VEHICLES 100
#define INTERSECTION_X (WINDOW_WIDTH / 2)
#define INTERSECTION_Y (WINDOW_HEIGHT / 2)
#define TRAFFIC_LIGHT_WIDTH (LANE_WIDT... | 4 |
211220156/nju_pa | c375e4f | nemu/src/cpu/instr/out.c | C | www.github.com/211220156/nju_pa/tree/main/nemu/src/cpu/instr/out.c | https://raw.githubusercontent.com/211220156/nju_pa/c375e4f/nemu/src/cpu/instr/out.c | 211220156/nju_pa c375e4f nemu/src/cpu/instr/out.c | true | 200 | 350 | #include "cpu/instr.h"
#include "device/port_io.h"
/*
Put the implementations of `out' instructions here.
*/
make_instr_func(out_b)
{
print_asm_0("out", "b", 1);
pio_write(cpu.edx, 1, cpu.eax);
return 1;
}
make_instr_func(out_v)
{
print_asm_0("out", (data_size == 16) ? "w" : "l", 1);
pio_write(cpu.edx, data_siz... | 7 |
252880/Praca_inz | acdc3aa | Core/Src/driver_setup.c | C | www.github.com/252880/Praca_inz/tree/main/Core/Src/driver_setup.c | https://raw.githubusercontent.com/252880/Praca_inz/acdc3aa/Core/Src/driver_setup.c | 252880/Praca_inz acdc3aa Core/Src/driver_setup.c | true | 200 | 18,499 | #include "driver_setup.h"
uint8_t bldc;
motor_t motor_L, motor_R;
motorConfigStuct_t motor_config = {0};
void motorsSetup(uint8_t actuation_type, uint8_t motor_type)
{
bldc = motor_type;
LL_GPIO_InitTypeDef gpio_init = {0};
LL_APB1_GRP1_EnableClock(LL_APB1_GRP1_PERIPH_TIM3);
LL_AHB1_GRP1_EnableClock(LL_AHB1_GRP... | 6 |
Lucasvw89/Solved-Problems | 633f873 | Algo_course/Set1_Search&Sort/Promo.c | C | www.github.com/Lucasvw89/Solved-Problems/tree/main/Algo_course/Set1_Search&Sort/Promo.c | https://raw.githubusercontent.com/Lucasvw89/Solved-Problems/633f873/Algo_course/Set1_Search%26Sort/Promo.c | Lucasvw89/Solved-Problems 633f873 Algo_course/Set1_Search&Sort/Promo.c | true | 200 | 2,577 | # include <stdio.h>
# include <stdlib.h>
void merge_sort(unsigned long long array[], unsigned long size)
{
if (size == 1) {return;}
unsigned long long* first_half;
unsigned long long* second_half;
first_half = (unsigned long long*)malloc((size/2) * sizeof(unsigned long long));
seco... | 0 |
Douglas-Dachicourt/holbertonschool-low_level_programming | a46d986 | more_functions_nested_loops/5-more_numbers.c | C | www.github.com/Douglas-Dachicourt/holbertonschool-low_level_programming/tree/main/more_functions_nested_loops/5-more_numbers.c | https://raw.githubusercontent.com/Douglas-Dachicourt/holbertonschool-low_level_programming/a46d986/more_functions_nested_loops/5-more_numbers.c | Douglas-Dachicourt/holbertonschool-low_level_programming a46d986 more_functions_nested_loops/5-more_numbers.c | true | 200 | 359 | #include "main.h"
/**
* more_numbers - fct qui imprime 10 fois les chiffres de 0 à 14
*
*/
void more_numbers(void)
{
int i, j;
for (i = 0; i < 10; i++)
{
for (j = 0; j <= 14; j++)
{
int d = j / 10;
int m = j % 10;
if (j <= 14)
{
if (j > 9)
{
_putchar('0' + d);
}
_putchar('0'... | 2 |
KiPTM/alx-low_level_programming | 202e8aa | 0x18-dynamic_libraries/libdynamic.c | C | www.github.com/KiPTM/alx-low_level_programming/tree/main/0x18-dynamic_libraries/libdynamic.c | https://raw.githubusercontent.com/KiPTM/alx-low_level_programming/202e8aa/0x18-dynamic_libraries/libdynamic.c | KiPTM/alx-low_level_programming 202e8aa 0x18-dynamic_libraries/libdynamic.c | true | 200 | 1,923 | #include <stdio.h>
#include "main.h"
int _putchar(char c) {
/* Implementation of _putchar function
* Add your implementation here
*/
return 0;
}
int _islower(int c) {
/* Implementation of _islower function */
/* Add your implementation here */
return 0;
}
int _isalpha(int c) {
/* I... | 5 |
etienne-m88/minishell | c9f3231 | src/my_put_nbr_pointeur.c | C | www.github.com/etienne-m88/minishell/tree/main/src/my_put_nbr_pointeur.c | https://raw.githubusercontent.com/etienne-m88/minishell/c9f3231/src/my_put_nbr_pointeur.c | etienne-m88/minishell c9f3231 src/my_put_nbr_pointeur.c | true | 200 | 436 | /*
** EPITECH PROJECT, 2023
** printf
** File description:
** put_nbr_pointeur
*/
#include "../include/my.h"
int my_put_nbr_pointeur(void *nb)
{
char str[] = "0123456789abcdef";
unsigned long l = (unsigned long)nb;
int size = 12;
char a[size + 1];
a[size] = '\0';
for (int i = size - 1; i >= 0;... | 3 |
wendev21/42Cursus_03ft_printf | 51958a6 | libftprintf_utils.c | C | www.github.com/wendev21/42Cursus_03ft_printf/tree/main/libftprintf_utils.c | https://raw.githubusercontent.com/wendev21/42Cursus_03ft_printf/51958a6/libftprintf_utils.c | wendev21/42Cursus_03ft_printf 51958a6 libftprintf_utils.c | true | 200 | 2,079 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* libftprintf_utils.c :+: :+: :+: ... | 1 |
Rashkudii/alx-low_level_programming | f7e5681 | 0x0C-more_malloc_free/1-string_nconcat.c | C | www.github.com/Rashkudii/alx-low_level_programming/tree/main/0x0C-more_malloc_free/1-string_nconcat.c | https://raw.githubusercontent.com/Rashkudii/alx-low_level_programming/f7e5681/0x0C-more_malloc_free/1-string_nconcat.c | Rashkudii/alx-low_level_programming f7e5681 0x0C-more_malloc_free/1-string_nconcat.c | true | 200 | 776 | #include "main.h"
#include <stdlib.h>
/**
* *string_nconcat - function that concatenates two strings.
* @s1: string to append to
* @s2: string to concatenate from
* @n: number of bytes to concatenate
*
* Return: pointer to resulting string
*/
char *string_nconcat(char *s1, char *s2, unsigned int n)
{
char *s;... | 7 |
EesunMoon/Image_Processing | b0a0b7b | Hw5_Decoder/Hw5_Decoder/Entropy.c | C | www.github.com/EesunMoon/Image_Processing/tree/main/Hw5_Decoder/Hw5_Decoder/Entropy.c | https://raw.githubusercontent.com/EesunMoon/Image_Processing/b0a0b7b/Hw5_Decoder/Hw5_Decoder/Entropy.c | EesunMoon/Image_Processing b0a0b7b Hw5_Decoder/Hw5_Decoder/Entropy.c | true | 200 | 10,212 | #include "main.h"
# define MAX 99999 // ���� ū ����(99999)�� MAX�� ����
// Ʈ�� ���
typedef struct TreeNode {
char ch; // ����
int weight; // ������ ��(������ ��)
struct TreeNode* left;
struct TreeNode* right;
}TreeNode;
// heap�� element
typedef struct {
TreeNode* htree; // hitten T... | 6 |
j-nary/Process_Scheduling_Policy | ce9ea8c | assignment3.c | C | www.github.com/j-nary/Process_Scheduling_Policy/tree/main/assignment3.c | https://raw.githubusercontent.com/j-nary/Process_Scheduling_Policy/ce9ea8c/assignment3.c | j-nary/Process_Scheduling_Policy ce9ea8c assignment3.c | true | 200 | 4,644 | #define _GNU_SOURCE
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <time.h>
#include <sys/syscall.h>
#include <sched.h>
#include <sys/resource.h>
#include <string.h>
#include <sys/wait.h>
#include <errno.h>
void printResult(pid_t pid, struct timespec start, struct timespec end, double elapsedTime,... | 4 |
Pami-1/Pami | fa8913d | msr-vul/1_CVE-2018-12322_radare2_CWE-125_bbb4af56003c1afdad67af0c4339267ca38b1017.c | C | www.github.com/Pami-1/Pami/tree/main/msr-vul/1_CVE-2018-12322_radare2_CWE-125_bbb4af56003c1afdad67af0c4339267ca38b1017.c | https://raw.githubusercontent.com/Pami-1/Pami/fa8913d/msr-vul/1_CVE-2018-12322_radare2_CWE-125_bbb4af56003c1afdad67af0c4339267ca38b1017.c | Pami-1/Pami fa8913d msr-vul/1_CVE-2018-12322_radare2_CWE-125_bbb4af56003c1afdad67af0c4339267ca38b1017.c | true | 200 | 12,358 | static int _6502_op(RAnal *anal, RAnalOp *op, ut64 addr, const ut8 *data, int len) {
char addrbuf[64];
const int buffsize = sizeof (addrbuf) - 1;
memset (op, '\0', sizeof (RAnalOp));
op->size = snes_op_get_size (1, 1, &snes_op[data[0]]);
op->addr = addr;
op->type = R_ANAL_OP_TYPE_UNK;
op->id = data[0];
r_strb... | 2 |
IbrahimGazzar/alx-low_level_programming | 161e5a5 | 0x08-recursion/101-wildcmp.c | C | www.github.com/IbrahimGazzar/alx-low_level_programming/tree/main/0x08-recursion/101-wildcmp.c | https://raw.githubusercontent.com/IbrahimGazzar/alx-low_level_programming/161e5a5/0x08-recursion/101-wildcmp.c | IbrahimGazzar/alx-low_level_programming 161e5a5 0x08-recursion/101-wildcmp.c | true | 200 | 527 | #include "main.h"
/**
* wildcmp - compares two strings
* @s1: pointer at the start of the first string
* @s2: pointer at the start of the second string
*
* Return: 1 if s1 and s2 are identical, 0 otherwise
*/
int wildcmp(char *s1, char *s2)
{
if (*s2 == '\0')
return (*s1 == '0');
if (*s2 == '*')
{
if (*(... | 0 |
LuiVLoureiro/Studies-In-Objective-C | 984bbcc | Programs/Exercise/exercise4.c | C | www.github.com/LuiVLoureiro/Studies-In-Objective-C/tree/main/Programs/Exercise/exercise4.c | https://raw.githubusercontent.com/LuiVLoureiro/Studies-In-Objective-C/984bbcc/Programs/Exercise/exercise4.c | LuiVLoureiro/Studies-In-Objective-C 984bbcc Programs/Exercise/exercise4.c | true | 200 | 506 | // Faça um programa que leia três valores e apresente como
// resultado a soma dos quadrados dos valores lidos.
# include <stdio.h>
int main(){
int num1, num2, num3, sum = 0;
setbuf(stdout, NULL);
printf("Type your first number -> ");
scanf("%d", &num1);
printf("Type your second number -> ");
scanf("%d", &num... | 5 |
Pankaj878/PROJECTS-in-c-Programming- | 4ef957a | Bankatm.c | C | www.github.com/Pankaj878/PROJECTS-in-c-Programming-/tree/main/Bankatm.c | https://raw.githubusercontent.com/Pankaj878/PROJECTS-in-c-Programming-/4ef957a/Bankatm.c | Pankaj878/PROJECTS-in-c-Programming- 4ef957a Bankatm.c | true | 200 | 1,153 | #include<stdio.h>
void main()
{
int a,b,d,e,c;
printf(" @@@@@@@@@ Welcome To Atm @@@@@@@@\nPlease Enter Your Pin=");
scanf("%d",&b);
if (b==1122)
{
printf(" ****select Your choice****\n 1=Knowing Bank balance\n 2=Changing pin \n 3=Knowing statement\n 4=for exit\n YOUR CHOICE=");
scanf... | 1 |
awkless/chip-8 | dc2cb77 | test/test_auxfun.c | C | www.github.com/awkless/chip-8/tree/main/test/test_auxfun.c | https://raw.githubusercontent.com/awkless/chip-8/dc2cb77/test/test_auxfun.c | awkless/chip-8 dc2cb77 test/test_auxfun.c | true | 200 | 2,523 | /* SPDX-FileCopyrightText: 2023 Jason Pena <jasonpena@awkless.com>
* SPDX-License-Identifier: MIT
*/
#include <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include "tap.h"
#include "utils/error.h"
#include "utils/auxfun.h"
/*
* Default stub rom to test with.
*/
#define DEFAULT_ROM_FILE "test/roms/stub.ch8"... | 3 |
JohnnyCPP/42_exams | ef12b4e | exam_02/level_4/ft_list_remove_if/main_list_remove_if.c | C | www.github.com/JohnnyCPP/42_exams/tree/main/exam_02/level_4/ft_list_remove_if/main_list_remove_if.c | https://raw.githubusercontent.com/JohnnyCPP/42_exams/ef12b4e/exam_02/level_4/ft_list_remove_if/main_list_remove_if.c | JohnnyCPP/42_exams ef12b4e exam_02/level_4/ft_list_remove_if/main_list_remove_if.c | true | 200 | 2,380 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* main_list_remove_if.c :+: :+: :+: ... | 7 |
anshukushwaha07/c-language | e2eced9 | assignment27.c | C | www.github.com/anshukushwaha07/c-language/tree/main/assignment27.c | https://raw.githubusercontent.com/anshukushwaha07/c-language/e2eced9/assignment27.c | anshukushwaha07/c-language e2eced9 assignment27.c | true | 200 | 817 | #include<stdio.h>
int naturalsum(int n){
if(n==1)
return 1;
return n+ naturalsum(n-1);
}
int oddsum(int n){
if(n==1)
return 1;
return 2*n-1 + oddsum(n-1);
}
int evennum(int n){
if(n==1)
return 2;
return 2*n + evennum(n-1);
}
int SquareOfNatural(int n){
if(n==1)
... | 2 |
GregTheWolfman/GEM_Analysis_Software | f53ba7f | LAGD_Tracker_Alignment.C | C | www.github.com/GregTheWolfman/GEM_Analysis_Software/tree/main/LAGD_Tracker_Alignment.C | https://raw.githubusercontent.com/GregTheWolfman/GEM_Analysis_Software/f53ba7f/LAGD_Tracker_Alignment.C | GregTheWolfman/GEM_Analysis_Software f53ba7f LAGD_Tracker_Alignment.C | true | 200 | 33,265 | #include <vector>
#include <iostream>
#include <fstream>
#include <sstream>
#include <map>
#include "TH1D.h"
#include "TH2D.h"
#include "TF1.h"
#include "TFile.h"
#include "TLegend.h"
#include "TROOT.h"
#include "TTreeReader.h"
#include "TTreeReaderValue.h"
#include "TTreeReaderArray.h"
#include "TTree.h"
#include "TBr... | 0 |
cdeletre/sm64ex-coop | e5b65bd | src/game/behaviors/king_bobomb.inc.c | C | www.github.com/cdeletre/sm64ex-coop/tree/main/src/game/behaviors/king_bobomb.inc.c | https://raw.githubusercontent.com/cdeletre/sm64ex-coop/e5b65bd/src/game/behaviors/king_bobomb.inc.c | cdeletre/sm64ex-coop e5b65bd src/game/behaviors/king_bobomb.inc.c | true | 200 | 15,552 | // king_bobomb.c.inc
struct MarioState* king_bobomb_nearest_mario_state() {
struct MarioState* nearest = NULL;
f32 nearestDist = 0;
u8 checkActive = TRUE;
do {
for (s32 i = 0; i < MAX_PLAYERS; i++) {
if (checkActive && !is_player_active(&gMarioStates[i])) { continue; }
i... | 4 |
AgapegifT/alx-low_level_programming | d37b553 | 0x02-functions_nested_loops/5-sign.c | C | www.github.com/AgapegifT/alx-low_level_programming/tree/main/0x02-functions_nested_loops/5-sign.c | https://raw.githubusercontent.com/AgapegifT/alx-low_level_programming/d37b553/0x02-functions_nested_loops/5-sign.c | AgapegifT/alx-low_level_programming d37b553 0x02-functions_nested_loops/5-sign.c | true | 200 | 307 | #include "main.h"
#include <stdio.h>
/**
* print_sign - function that prints signs
*
* Return: 1, 0 and -1
*
*/
int print_sign(int n)
{
if (n > 0)
{
_putchar('+');
return (1);
}
else if (n == 0)
{
_putchar('0');
return (0);
}
else
{
_putchar('-');
return (-1);
}
}
| 5 |
FkReMy/Embedded_Systems | 9838256 | Final_Project/1_Passwoed_Based_Security_System/Microchip/Passwoed_Based_Security_System/HAL/05- 7Segment/SEVEN_SEG_program.c | C | www.github.com/FkReMy/Embedded_Systems/tree/main/Final_Project/1_Passwoed_Based_Security_System/Microchip/Passwoed_Based_Security_System/HAL/05- 7Segment/SEVEN_SEG_program.c | https://raw.githubusercontent.com/FkReMy/Embedded_Systems/9838256/Final_Project/1_Passwoed_Based_Security_System/Microchip/Passwoed_Based_Security_System/HAL/05-%207Segment/SEVEN_SEG_program.c | FkReMy/Embedded_Systems 9838256 Final_Project/1_Passwoed_Based_Security_System/Microchip/Passwoed_Based_Security_System/HAL/05- 7Segment/SEVEN_SEG_program.c | true | 200 | 1,541 |
/**********************************************************************************************/
/* Author : Mostafa Zween */
/* Date : 05/8/2021 11:30 AM */
/* version : 01 ... | 1 |
Tensai99/alx-low_level_programming | 4f73c75 | 0x06-pointers_arrays_strings/104-print_buffer.c | C | www.github.com/Tensai99/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/104-print_buffer.c | https://raw.githubusercontent.com/Tensai99/alx-low_level_programming/4f73c75/0x06-pointers_arrays_strings/104-print_buffer.c | Tensai99/alx-low_level_programming 4f73c75 0x06-pointers_arrays_strings/104-print_buffer.c | true | 200 | 976 | #include "main.h"
#include <stdio.h>
/**
* print_line - prints a s bytes of a buffer
*
* @c: buffer to print
*
* @s: bytes of buffer to print
*
* @l: line of buffer to print
*
* Return: void
*
*/
void print_line(char *c, int s, int l)
{
int j, k;
for (j = 0; j <= 9; j++)
{
if (j <= s)
prin... | 6 |
Lucas-Anderson-PAD/Estudos-de-C | 4230c29 | ex ponteiros/ex6.c | C | www.github.com/Lucas-Anderson-PAD/Estudos-de-C/tree/main/ex ponteiros/ex6.c | https://raw.githubusercontent.com/Lucas-Anderson-PAD/Estudos-de-C/4230c29/ex%20ponteiros/ex6.c | Lucas-Anderson-PAD/Estudos-de-C 4230c29 ex ponteiros/ex6.c | true | 200 | 4,343 | #include <stdio.h>
#define n_reis_rainhas 10
void numero_de_alunos(int * n);
void cod_reis(int n, int * vetor);
int busca_posicao(int * vetor, int e, int n);
void votacao(int * candidatorei,int * candidatarainha, int n, int * votosrei, int *votosrainha, int n_r);
void listadevotos(int * candidatos,int *votos, int n_r,... | 3 |
PraneethEmandi/sem_4 | 2a61248 | qq2.c | C | www.github.com/PraneethEmandi/sem_4/tree/main/qq2.c | https://raw.githubusercontent.com/PraneethEmandi/sem_4/2a61248/qq2.c | PraneethEmandi/sem_4 2a61248 qq2.c | true | 200 | 2,255 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#define vmax 100
struct q{
int arr[vmax];
int front;
int rear;
};
typedef struct q* q;
int empty(q que){
return que->front==que->rear;
}
void push(q que,int x){
que->arr[(que->rear)++]=x;
}
void pop(q que){
(que->front)++;
}
int front(q... | 7 |
wresinski/bm | 9cd9f6b | bm.c | C | www.github.com/wresinski/bm/tree/main/bm.c | https://raw.githubusercontent.com/wresinski/bm/9cd9f6b/bm.c | wresinski/bm 9cd9f6b bm.c | true | 200 | 5,645 | #include "color.h"
#include <dirent.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <unistd.h>
#define IS_EXT(name, ext) strcmp(&name[strlen(name) - strlen(ext)], ext)
int b[256] = {0};
int *g = NULL;
int size = 0;
void buildBads(char *t, int tLengt... | 4 |
shiroyapravin/C-Language_by_CodewithHarry | 24a06b6 | Chapter 07 - Practice set/07_Problem_1.c | C | www.github.com/shiroyapravin/C-Language_by_CodewithHarry/tree/main/Chapter 07 - Practice set/07_Problem_1.c | https://raw.githubusercontent.com/shiroyapravin/C-Language_by_CodewithHarry/24a06b6/Chapter%2007%20-%20Practice%20set/07_Problem_1.c | shiroyapravin/C-Language_by_CodewithHarry 24a06b6 Chapter 07 - Practice set/07_Problem_1.c | true | 200 | 358 | /*
Create an array of 10 numbers. Verify using pointer arithmetic that (ptr+2) points
to the third element where ptr is a pointer pointing to the first element of the
array.
*/
#include <stdio.h>
int main()
{
int a[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
int *ptr = a;
printf("The value at address %u is %d", ... | 2 |
keshavblack123/C-Files | c97d6cc | Week 3/student-after-class.c | C | www.github.com/keshavblack123/C-Files/tree/main/Week 3/student-after-class.c | https://raw.githubusercontent.com/keshavblack123/C-Files/c97d6cc/Week%203/student-after-class.c | keshavblack123/C-Files c97d6cc Week 3/student-after-class.c | true | 200 | 1,311 | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
typedef struct lestudent student;
struct lestudent
{
char * firstname;
char * lastname;
char gradeLetter;
float averageGrade;
void (* print) (student *);
};
void print_student(student * this);
student * create_student (char *f, char *l, char letter, f... | 0 |
brainface/havenmud | ae9eab3 | lib/domains/estergrym/areas/skaven/room/r5.c | C | www.github.com/brainface/havenmud/tree/main/lib/domains/estergrym/areas/skaven/room/r5.c | https://raw.githubusercontent.com/brainface/havenmud/ae9eab3/lib/domains/estergrym/areas/skaven/room/r5.c | brainface/havenmud ae9eab3 lib/domains/estergrym/areas/skaven/room/r5.c | true | 200 | 1,682 | #include <lib.h>
#include "../skaven.h"
inherit LIB_ROOM;
static void create () {
room::create();
SetClimate("underground");
SetDomain("Estergrym");
SetAmbientLight(1);
SetShort("garbage chamber");
SetLong("This small cavern appears to be mostly a natural"
" formation with only a slight amount of arti... | 3 |
Najib632/alx-low_level_programming | 438cbac | 0x13-more_singly_linked_lists/7-get_nodeint.c | C | www.github.com/Najib632/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/7-get_nodeint.c | https://raw.githubusercontent.com/Najib632/alx-low_level_programming/438cbac/0x13-more_singly_linked_lists/7-get_nodeint.c | Najib632/alx-low_level_programming 438cbac 0x13-more_singly_linked_lists/7-get_nodeint.c | true | 200 | 578 | #include "lists.h"
/**
* get_nodeint_at_index - Returns the nth node of a listint_t linked list
* @head: head node of a listint_t linked list
* @index: position of a value in a linked list
*
* Return: Addresss of value at index
**/
listint_t *get_nodeint_at_index(listint_t *head, unsigned int index)
{
unsigned ... | 1 |
google/pebble | 4051c5b | src/apps/watch_info_test/src/watch_info_test.c | C | www.github.com/google/pebble/tree/main/src/apps/watch_info_test/src/watch_info_test.c | https://raw.githubusercontent.com/google/pebble/4051c5b/src/apps/watch_info_test/src/watch_info_test.c | google/pebble 4051c5b src/apps/watch_info_test/src/watch_info_test.c | true | 200 | 1,794 | /*
* Copyright 2024 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to i... | 6 |
kzamanbd/phitron | e307651 | B_Print.c | C | www.github.com/kzamanbd/phitron/tree/main/B_Print.c | https://raw.githubusercontent.com/kzamanbd/phitron/e307651/B_Print.c | kzamanbd/phitron e307651 B_Print.c | true | 200 | 326 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void displayNumber(int n)
{
for (int i = 1; i <= n; i++)
{
printf("%d", i);
if (i < n)
{
printf(" ");
}
}
}
int main()
{
int n;
scanf("%d", &n);
displayNumber(n);
retur... | 7 |
Vasubhalodi011/c-language | 1f44d12 | filament/1.c | C | www.github.com/Vasubhalodi011/c-language/tree/main/filament/1.c | https://raw.githubusercontent.com/Vasubhalodi011/c-language/1f44d12/filament/1.c | Vasubhalodi011/c-language 1f44d12 filament/1.c | true | 200 | 335 | #include<stdio.h>
#include<string.h>
int main(){
char a[10];
char b[10];
printf("enter value:");
scanf("%s",a);
strcpy(b,a);
strrev(a);
int i=strcmp(a,b);
if(i==0)
{
printf("\nvalue is palindrome value");
}
else
{
printf("\nvalue is not palindrome value");
}
r... | 5 |
Shaylee21/alx-low_level_programming | 135e201 | 0x13-more_singly_linked_lists/2-add_nodeint.c | C | www.github.com/Shaylee21/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/2-add_nodeint.c | https://raw.githubusercontent.com/Shaylee21/alx-low_level_programming/135e201/0x13-more_singly_linked_lists/2-add_nodeint.c | Shaylee21/alx-low_level_programming 135e201 0x13-more_singly_linked_lists/2-add_nodeint.c | true | 200 | 466 | #include "lists.h"
#include <stddef.h>
/**
* add_nodeint - Adds a new node at the beginning of a listint_t list.
* @head: Pointer to head of list.
* @n: data to add to the new node.
*
* Return: New address of node, NULL on failure.
*/
listint_t *add_nodeint(listint_t **head, const int n)
{
listint_t *new_n;
... | 0 |
psaxel1/holbertonschool-low_level_programming | 7042f81 | more_functions_nested_loops/10-print_triangle.c | C | www.github.com/psaxel1/holbertonschool-low_level_programming/tree/main/more_functions_nested_loops/10-print_triangle.c | https://raw.githubusercontent.com/psaxel1/holbertonschool-low_level_programming/7042f81/more_functions_nested_loops/10-print_triangle.c | psaxel1/holbertonschool-low_level_programming 7042f81 more_functions_nested_loops/10-print_triangle.c | true | 200 | 340 | #include "main.h"
/**
* print_triangle- pr triangle
* @size: size triangle
*/
void print_triangle(int size)
{
int a, b, c;
if (size <= 0)
{
_putchar('\n');
}
for (a = 1; a <= size; a++)
{
for (c = size - a; c >= 1; c--)
{
_putchar(' ');
}
for (b = 1; b <= a; b++)
{
_putchar('#');
}
_... | 2 |
Mindol7/Operating-System | aaa1e3d | Project#01-Simple_Scheduling/Ten_Thousand_ver/queue.c | C | www.github.com/Mindol7/Operating-System/tree/main/Project#01-Simple_Scheduling/Ten_Thousand_ver/queue.c | https://raw.githubusercontent.com/Mindol7/Operating-System/aaa1e3d/Project%2301-Simple_Scheduling/Ten_Thousand_ver/queue.c | Mindol7/Operating-System aaa1e3d Project#01-Simple_Scheduling/Ten_Thousand_ver/queue.c | true | 200 | 2,313 | #include "queue.h"
Queue* createQueue(){
Queue *q = (Queue*)malloc(sizeof(Queue));
if(q == NULL){
perror("Failed to create Queue");
exit(EXIT_FAILURE);
}
q->head = q->tail = NULL;
q->count = 0;
return q;
}
int isEmpty(Queue *q){
return (q->count == 0);
}
void enqueue(Queu... | 3 |
hiteshmailarapwar/programming | 5b8fad2 | LogicBuilding/program403.c | C | www.github.com/hiteshmailarapwar/programming/tree/main/LogicBuilding/program403.c | https://raw.githubusercontent.com/hiteshmailarapwar/programming/5b8fad2/LogicBuilding/program403.c | hiteshmailarapwar/programming 5b8fad2 LogicBuilding/program403.c | true | 200 | 4,563 | #include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
typedef struct node
{
int data;
struct node *next;
}NODE, *PNODE, **PPNODE;
void InsertFirst(PPNODE Head, int no)
{
PNODE newn = NULL;
newn = (PNODE)malloc(sizeof(NODE));
newn->data = no;
newn->next = NULL;
if(*Head != NULL)
{
... | 7 |
david-wis/Tellurium | 0cd252f | src/main.c | C | www.github.com/david-wis/Tellurium/tree/main/src/main.c | https://raw.githubusercontent.com/david-wis/Tellurium/0cd252f/src/main.c | david-wis/Tellurium 0cd252f src/main.c | true | 200 | 2,063 | #include "backend/code-generation/generator.h"
#include "backend/support/logger.h"
#include "backend/support/shared.h"
#include "backend/support/linkedListADT.h"
#include "frontend/syntactic-analysis/bison-parser.h"
#include <stdio.h>
// Estado de la aplicación.
CompilerState state;
// Punto de entrada principal del ... | 4 |
starsdong/RNC | da72602 | 2022_StrategyPlan/0919/personpower.C | C | www.github.com/starsdong/RNC/tree/main/2022_StrategyPlan/0919/personpower.C | https://raw.githubusercontent.com/starsdong/RNC/da72602/2022_StrategyPlan/0919/personpower.C | starsdong/RNC da72602 2022_StrategyPlan/0919/personpower.C | true | 200 | 5,445 | #include "style.C+"
#include "draw.C+"
void personpower()
{
style();
const Double_t CE = 24;
const Int_t N = 40;
const Int_t NP = 8;
const Char_t *Name[NP] = {"STAR", "sPHENIX", "JLab", "Instr-Comp", "CBM-ALICE3", "ALICE", "EIC-Other","EIC-Si"};
const Char_t *LabelName[NP] = {"STAR", "sPHENIX", "JLab", "... | 0 |
AnaVal05/Programacion-para-mecatronicos | 229ddef | CAP.6/ejer02/main.c | C | www.github.com/AnaVal05/Programacion-para-mecatronicos/tree/main/CAP.6/ejer02/main.c | https://raw.githubusercontent.com/AnaVal05/Programacion-para-mecatronicos/229ddef/CAP.6/ejer02/main.c | AnaVal05/Programacion-para-mecatronicos 229ddef CAP.6/ejer02/main.c | true | 200 | 1,199 | #include <stdio.h>
const int max = 50;
void lectura(int [][max], int, int);
void suma(int[][max], int[][max], int[][max], int, int);
void imprime(int[][max], int, int);
void main(void)
{
int ma[max][max], mb[max][max], mc[max][max];
int fil, col;
do
{
printf("Ingrese el numeri de filas de los arreglos: ");
s... | 2 |
younicorn777/baekjoon | e8b4218 | 백준/Bronze/1978. 소수 찾기/소수 찾기.c | C | www.github.com/younicorn777/baekjoon/tree/main/백준/Bronze/1978. 소수 찾기/소수 찾기.c | https://raw.githubusercontent.com/younicorn777/baekjoon/e8b4218/%EB%B0%B1%EC%A4%80/Bronze/1978.%E2%80%85%EC%86%8C%EC%88%98%E2%80%85%EC%B0%BE%EA%B8%B0/%EC%86%8C%EC%88%98%E2%80%85%EC%B0%BE%EA%B8%B0.c | younicorn777/baekjoon e8b4218 백준/Bronze/1978. 소수 찾기/소수 찾기.c | true | 200 | 386 | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main(void)
{
int n, pcnt = 0; // 소수의 개수
scanf("%d", &n);
for (int i = 0, num, cnt; i < n; i++)
{
cnt = 0;
scanf("%d", &num);
if (num == 1)
continue;
for (register int j = 2; j < num; j++)
cnt += (num % j == 0) ? 1 : 0;
... | 5 |
donnellyCodes/alx-low_level_programming | 589d863 | 0x14-bit_manipulation/0-binary_to_uint.c | C | www.github.com/donnellyCodes/alx-low_level_programming/tree/main/0x14-bit_manipulation/0-binary_to_uint.c | https://raw.githubusercontent.com/donnellyCodes/alx-low_level_programming/589d863/0x14-bit_manipulation/0-binary_to_uint.c | donnellyCodes/alx-low_level_programming 589d863 0x14-bit_manipulation/0-binary_to_uint.c | true | 200 | 494 | #include "main.h"
#include <stddef.h>
/**
* binary_to_uint - function that converts a binary number to an unsigned int
* @b: pointer to a string of 0 and 1 chars
* Return: the converted number, or 0
*/
unsigned int binary_to_uint(const char *b)
{
unsigned int result = 0;
unsigned int bit;
int i;
if (b == NULL)... | 7 |
OHOHA3/NSUlabs | 81e743b | OS2/lab2.sync/5.http_cache_proxy/cache.c | C | www.github.com/OHOHA3/NSUlabs/tree/main/OS2/lab2.sync/5.http_cache_proxy/cache.c | https://raw.githubusercontent.com/OHOHA3/NSUlabs/81e743b/OS2/lab2.sync/5.http_cache_proxy/cache.c | OHOHA3/NSUlabs 81e743b OS2/lab2.sync/5.http_cache_proxy/cache.c | true | 200 | 2,484 | #define _GNU_SOURCE
#include <pthread.h>
#include "cache.h"
cache_t *cache_init(int max_count) {
cache_t *c = malloc(sizeof(cache_t));
if (!c) {
printf("Cannot allocate memory for a cache\n");
abort();
}
c->rwlock = malloc(sizeof(pthread_rwlock_t));
if (!c->rwlock) {
prin... | 2 |
tuke307/cau-multicore-computing | c906a38 | proj4/problem1/openmp_ray.c | C | www.github.com/tuke307/cau-multicore-computing/tree/main/proj4/problem1/openmp_ray.c | https://raw.githubusercontent.com/tuke307/cau-multicore-computing/c906a38/proj4/problem1/openmp_ray.c | tuke307/cau-multicore-computing c906a38 proj4/problem1/openmp_ray.c | true | 200 | 5,998 | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>
#include <math.h>
#include <omp.h>
#define CUDA 0
#define OPENMP 1
#define SPHERES 20
#define rnd(x) (x * rand() / RAND_MAX)
#define INF 2e10f
#define DIM 2048
struct Sphere
{
float r, g, b; // red, green, and blue color components of t... | 4 |
Hagermaher/simple_shell | 66d3fc8 | ich.c | C | www.github.com/Hagermaher/simple_shell/tree/main/ich.c | https://raw.githubusercontent.com/Hagermaher/simple_shell/66d3fc8/ich.c | Hagermaher/simple_shell 66d3fc8 ich.c | true | 200 | 424 | #include "shell.h"
/**
* ich - Remable
* @in: Structning po
* @b: f
* @bt: g
* Return: Aays 0
*/
int ich(mnmt *in, char *b, size_t *bt)
{
size_t k = *bt;
if (b[k] == '|' && b[k + 1] == '|')
{
b[k] = 0;
k++;
in->cbt = 1;
}
else if (b[k] == '&' && b[k + 1] == '&')
{
b[k] = 0;
k++;
in->cbt = 2;
... | 0 |
BbillahrariBBr/c_practise_phitron | e1ec02b | Lab Exam 07/A1.c | C | www.github.com/BbillahrariBBr/c_practise_phitron/tree/main/Lab Exam 07/A1.c | https://raw.githubusercontent.com/BbillahrariBBr/c_practise_phitron/e1ec02b/Lab%20Exam%2007/A1.c | BbillahrariBBr/c_practise_phitron e1ec02b Lab Exam 07/A1.c | true | 200 | 243 | #include<stdio.h>
int main()
{
int n;
scanf("%d",&n);
int arr[n];
int sum =0;
for(int i =0; i<n; i++)
{
scanf("%d",arr+i);
sum +=arr[i];
}
printf("%d",sum);
return 0;
}
| 3 |
aKhadiemik/alx-low_level_programming | 090176e | 0x0B-malloc_free/3-alloc_grid.c | C | www.github.com/aKhadiemik/alx-low_level_programming/tree/main/0x0B-malloc_free/3-alloc_grid.c | https://raw.githubusercontent.com/aKhadiemik/alx-low_level_programming/090176e/0x0B-malloc_free/3-alloc_grid.c | aKhadiemik/alx-low_level_programming 090176e 0x0B-malloc_free/3-alloc_grid.c | true | 200 | 739 | #include "main.h"
#include <stdlib.h>
/**
* alloc_grid - returns pointer to 2 dim-array of ints
*
* @width: width of array
* @height: height of array
* Return: on success - 2-dim grid, on failure - NULL
*/
int **alloc_grid(int width, int height)
{
int i, j, **grid;
if (width <= 0 || height <= 0)
{
return ... | 5 |
ChurroLightyear/KOSMO-MULTITOOL-CODE | 4c2403a | main/JUNK/multiple.h | C | www.github.com/ChurroLightyear/KOSMO-MULTITOOL-CODE/tree/main/main/JUNK/multiple.h | https://raw.githubusercontent.com/ChurroLightyear/KOSMO-MULTITOOL-CODE/4c2403a/main/JUNK/multiple.h | ChurroLightyear/KOSMO-MULTITOOL-CODE 4c2403a main/JUNK/multiple.h | true | 200 | 404 | int multipleMode = 0;
result handleMultiple(eventMask event, navNode& nav, prompt &item);
SELECT(multipleMode,multipleModeMenu,"MODE",doNothing,noEvent,noStyle
,VALUE("1>14",0,doNothing,noEvent)
,VALUE("1,3>12,34",1,doNothing,noEvent)
);
MENU(subMenuMultiple,"MULTIPLE",handleMultiple,(Menu::eventMask)(e... | 7 |
aparasingh/CS50-Problems | a05508e | Week 2/caesar/caesar.c | C | www.github.com/aparasingh/CS50-Problems/tree/main/Week 2/caesar/caesar.c | https://raw.githubusercontent.com/aparasingh/CS50-Problems/a05508e/Week%202/caesar/caesar.c | aparasingh/CS50-Problems a05508e Week 2/caesar/caesar.c | true | 200 | 1,298 | #include <cs50.h>
#include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
bool only_digits(string key);
char rotate(char value, int key);
int main(int argc, string argv[])
{
if (argc != 2)
{
printf("Usage: ./caesar key\n");
return 1;
}
else if (o... | 4 |
ml1150258/CSC_CIS_5 | e37aacc | Lab/MarkSort_DynamicArrayStaticStructure_V3/Array.h | C | www.github.com/ml1150258/CSC_CIS_5/tree/main/Lab/MarkSort_DynamicArrayStaticStructure_V3/Array.h | https://raw.githubusercontent.com/ml1150258/CSC_CIS_5/e37aacc/Lab/MarkSort_DynamicArrayStaticStructure_V3/Array.h | ml1150258/CSC_CIS_5 e37aacc Lab/MarkSort_DynamicArrayStaticStructure_V3/Array.h | true | 200 | 373 | /*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/*
* File: Array.h
* Author: mlehr
*
* Created on May 21, 2024, 10:54 AM
*/
#ifndef ARRAY_H
#define ARRAY_H
struct Array{
... | 2 |
anayy09/C-Programming | 816186c | Lec 05/Lecture_05_4.c | C | www.github.com/anayy09/C-Programming/tree/main/Lec 05/Lecture_05_4.c | https://raw.githubusercontent.com/anayy09/C-Programming/816186c/Lec%2005/Lecture_05_4.c | anayy09/C-Programming 816186c Lec 05/Lecture_05_4.c | true | 200 | 606 | // Suppose you entered a 4 digit number. Write a program to display a number whose digits are 2 greater than the corresponding digits of the entered number.
// For example, if he entered number is 5696, then the displayed number should be 7818. (Use while loop)
#include<stdio.h>
int main() {
int a, rev = 0, ans = ... | 0 |
Amborsia/malloc_lab | ea0afa9 | mm.c | C | www.github.com/Amborsia/malloc_lab/tree/main/mm.c | https://raw.githubusercontent.com/Amborsia/malloc_lab/ea0afa9/mm.c | Amborsia/malloc_lab ea0afa9 mm.c | true | 200 | 11,401 | // explicit 방법
/*
* 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 usin... | 3 |
EduardoSOuzaz/Algoritimo-e-Estruturas-de-Dados | 79da830 | Algoritimo e Estruturas de dados I/Lista - 3 - Vetor/Lista3_Vet_Ex3.c | C | www.github.com/EduardoSOuzaz/Algoritimo-e-Estruturas-de-Dados/tree/main/Algoritimo e Estruturas de dados I/Lista - 3 - Vetor/Lista3_Vet_Ex3.c | https://raw.githubusercontent.com/EduardoSOuzaz/Algoritimo-e-Estruturas-de-Dados/79da830/Algoritimo%20e%20Estruturas%20de%20dados%20I/Lista%20-%203%20-%20%20Vetor/Lista3_Vet_Ex3.c | EduardoSOuzaz/Algoritimo-e-Estruturas-de-Dados 79da830 Algoritimo e Estruturas de dados I/Lista - 3 - Vetor/Lista3_Vet_Ex3.c | true | 200 | 386 | #include <stdio.h>
#include <locale.h>
int main() {
setlocale(LC_ALL, "Portuguese");
float med = 0, vet[20], tot = 0;
int i = 0;
for (i = 0; i<20; i++){
printf("Digite as notas:");
scanf("%f",&vet[i]);
}
for (i = 0; i<20; i++){
tot += vet[i];
med = tot / 20;
... | 7 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.