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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
Filip-Nikic/CS50-2023 | 6fe6b11 | mario.c | C | www.github.com/Filip-Nikic/CS50-2023/tree/main/mario.c | https://raw.githubusercontent.com/Filip-Nikic/CS50-2023/6fe6b11/mario.c | Filip-Nikic/CS50-2023 6fe6b11 mario.c | true | 200 | 654 | #include <stdio.h>
#include <ctype.h>
int get_size(void);
void print_grid(int size);
int main (void)
{
int n=get_size();
print_grid(n);
}
int get_size(void)
{
int n;
do
{
printf("Enter size of grid: ");
scanf("%d", &n);
}
while (n<1 || n>8);
return n;
}
void print_g... | 5 |
Ermenz/Rascunho | 7f555e4 | Ex3.c | C | www.github.com/Ermenz/Rascunho/tree/main/Ex3.c | https://raw.githubusercontent.com/Ermenz/Rascunho/7f555e4/Ex3.c | Ermenz/Rascunho 7f555e4 Ex3.c | true | 200 | 3,772 | #include <stdio.h>
#include <stdlib.h>
#include <locale.h>
#include <string.h>
#include <ctype.h>
#include <time.h>
/*Exerc�cio 3:
Desenvolva uma struct "Produto" que contenha informa��es como nome, pre�o e quantidade em estoque. Em seguida,
desenvolva um menu para facilitar a escolha das op��es:
1 - Reali... | 4 |
DonGates1001/Wordle-C | e7ca55d | lexicon.c | C | www.github.com/DonGates1001/Wordle-C/tree/main/lexicon.c | https://raw.githubusercontent.com/DonGates1001/Wordle-C/e7ca55d/lexicon.c | DonGates1001/Wordle-C e7ca55d lexicon.c | true | 200 | 2,514 | /**
* @file lexicon.c
* @author Don Gates (dpgates)
stores list of words read from a file and provides functions for working with the list. Allows for
acceptance of valid lists and rejection of invalid lists. Picks a target word and provides useful functions
for wordle.c to manage gameplay
*/
#include "l... | 2 |
Evan-Lab/Epitech-first-year | 3c4d3f1 | C Graphical Programming/my_defender/sprite.c | C | www.github.com/Evan-Lab/Epitech-first-year/tree/main/C Graphical Programming/my_defender/sprite.c | https://raw.githubusercontent.com/Evan-Lab/Epitech-first-year/3c4d3f1/C%20Graphical%20Programming/my_defender/sprite.c | Evan-Lab/Epitech-first-year 3c4d3f1 C Graphical Programming/my_defender/sprite.c | true | 200 | 2,282 | /*
** EPITECH PROJECT, 2021
** my_defender - sprite.c
** File description:
** jitter jitter
*/
#include "defender.h"
array_t *init_n_sprites(int nb, int pos_x, int pos_y, int health)
{
int i = 0;
array_t *sprites = malloc(sizeof(array_t));
sprites->x = malloc(sizeof(int) * (nb + 1));
sprites->y = mal... | 0 |
yoyo71212/alx-higher_level_programming | f9cc5d9 | 0x00-python-hello_world/10-check_cycle.c | C | www.github.com/yoyo71212/alx-higher_level_programming/tree/main/0x00-python-hello_world/10-check_cycle.c | https://raw.githubusercontent.com/yoyo71212/alx-higher_level_programming/f9cc5d9/0x00-python-hello_world/10-check_cycle.c | yoyo71212/alx-higher_level_programming f9cc5d9 0x00-python-hello_world/10-check_cycle.c | true | 200 | 476 | #include "lists.h"
#include <stdio.h>
#include <stdlib.h>
/**
* check_cycle - Checks if a singly linked list has a cycle in it
*
* @list: The singly linked list
*
* Return: 0 if there is no cycle, 1 if there is a cycle
*/
int check_cycle(listint_t *list)
{
listint_t *turtle, *hare;
turtle = list;
hare = list;... | 7 |
ishanm0/ece118-finalproject | cb806ce | Sensors Reading.X/Main.c | C | www.github.com/ishanm0/ece118-finalproject/tree/main/Sensors Reading.X/Main.c | https://raw.githubusercontent.com/ishanm0/ece118-finalproject/cb806ce/Sensors%20Reading.X/Main.c | ishanm0/ece118-finalproject cb806ce Sensors Reading.X/Main.c | true | 200 | 2,086 | /*
* File: mainPart6.c
* Author: yafit
*
* Created on April 30, 2024, 3:54 PM
*/
/*
*
*/
#include <stdio.h>
#include <stdlib.h>
#include "AD.h"
#include "BOARD.h"
#include "xc.h"
#include <stdio.h>
#include "LED.h"
#include "RC_Servo.h"
#include "pwm.h"
#include "IO_Ports.h"
int main(void) {
printf("At... | 5 |
faliavicky/testDMA-voltage-and-current | 4d91d50 | testDMA/Src/stm32f4xx_hal_msp.c | C | www.github.com/faliavicky/testDMA-voltage-and-current/tree/main/testDMA/Src/stm32f4xx_hal_msp.c | https://raw.githubusercontent.com/faliavicky/testDMA-voltage-and-current/4d91d50/testDMA/Src/stm32f4xx_hal_msp.c | faliavicky/testDMA-voltage-and-current 4d91d50 testDMA/Src/stm32f4xx_hal_msp.c | true | 200 | 10,423 | /**
******************************************************************************
* File Name : stm32f4xx_hal_msp.c
* Description : This file provides code for the MSP Initialization
* and de-Initialization codes.
**********************************************************... | 0 |
ogolafreeman/alx-low_level_programming | 1edbc32 | 0x14-bit_manipulation/3-set_bit.c | C | www.github.com/ogolafreeman/alx-low_level_programming/tree/main/0x14-bit_manipulation/3-set_bit.c | https://raw.githubusercontent.com/ogolafreeman/alx-low_level_programming/1edbc32/0x14-bit_manipulation/3-set_bit.c | ogolafreeman/alx-low_level_programming 1edbc32 0x14-bit_manipulation/3-set_bit.c | true | 200 | 307 | #include "main.h"
/**
* set_bit - sets bit at a given index
* @n: pointer to a nymber to change
* @index: index of bit to set to 1
*
* Return: Always 1 for success
*/
int set_bit(unsigned long int *n, unsigned int index)
{
if (index > 63)
return (-1);
*n = ((1UL << index) | *n);
return (1);
}
| 4 |
gistraw0454/C_Study_24Summer | f1e5572 | soruce/section16.c | C | www.github.com/gistraw0454/C_Study_24Summer/tree/main/soruce/section16.c | https://raw.githubusercontent.com/gistraw0454/C_Study_24Summer/f1e5572/soruce/section16.c | gistraw0454/C_Study_24Summer f1e5572 soruce/section16.c | true | 200 | 721 | #include <stdio.h>
#include <stdlib.h>
//1
int getDiffByValue(int num1, int num2){
int result =0;
result = num1-num2;
result = result>=0?result:result*-1;
return result;
}
void callDiffByAddr(int* num1, int* num2){
int temp=0;
if (*num1<*num2){
temp = *num1;
*... | 2 |
openxm-org/OpenXM_contrib2 | 0968df8 | asir2018/engine/PUM.c | C | www.github.com/openxm-org/OpenXM_contrib2/tree/main/asir2018/engine/PUM.c | https://raw.githubusercontent.com/openxm-org/OpenXM_contrib2/0968df8/asir2018/engine/PUM.c | openxm-org/OpenXM_contrib2 0968df8 asir2018/engine/PUM.c | true | 200 | 16,837 | /*
* Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED
* All rights reserved.
*
* FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited,
* non-exclusive and royalty-free license to use, copy, modify and
* redistribute, solely for non-commercial and non-profit purposes, the
* computer program, "Ri... | 3 |
hugobouy/Prose2023-A1 | 34e60af | c/Test/testEmployeeManager/testEmployeeManager.c | C | www.github.com/hugobouy/Prose2023-A1/tree/main/c/Test/testEmployeeManager/testEmployeeManager.c | https://raw.githubusercontent.com/hugobouy/Prose2023-A1/34e60af/c/Test/testEmployeeManager/testEmployeeManager.c | hugobouy/Prose2023-A1 34e60af c/Test/testEmployeeManager/testEmployeeManager.c | true | 200 | 11,729 | #include <pthread.h>
pthread_mutex_t employee_mutex;
#include "../../production/softSonnette/employeeManager.c"
#include <stdarg.h>
#include <stddef.h>
#include <setjmp.h>
#include "../cmocka/cmocka-x86_64/include/cmocka.h"
#define ONEDAY 1 //définit un jour fixe pour les tests, supposant que les heures de travai... | 7 |
Akwesi-bonah/alx-low_level_programming | 1ff3bfc | 0x13-more_singly_linked_lists/3-add_nodeint_end.c | C | www.github.com/Akwesi-bonah/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/3-add_nodeint_end.c | https://raw.githubusercontent.com/Akwesi-bonah/alx-low_level_programming/1ff3bfc/0x13-more_singly_linked_lists/3-add_nodeint_end.c | Akwesi-bonah/alx-low_level_programming 1ff3bfc 0x13-more_singly_linked_lists/3-add_nodeint_end.c | true | 200 | 535 | #include "lists.h"
/**
* add_nodeint_end - is a function that adds a new node at the end of a list.
* @head: where to add the node.
* @n: int to add
* Return: the adress of new head node.
*/
listint_t *add_nodeint_end(listint_t **head, const int n)
{
listint_t *list, *help;
help = *head;
list = malloc(sizeof(... | 5 |
vedant-agarwal-08/C-and-C- | 2a03826 | hackerrank/sumdiff.c | C | www.github.com/vedant-agarwal-08/C-and-C-/tree/main/hackerrank/sumdiff.c | https://raw.githubusercontent.com/vedant-agarwal-08/C-and-C-/2a03826/hackerrank/sumdiff.c | vedant-agarwal-08/C-and-C- 2a03826 hackerrank/sumdiff.c | true | 200 | 288 | #include<stdio.h>
int main()
{
int sum,diff;
float sum1,diff1;
int a,b;
float c,d;
scanf("%d%d",&a,&b);
scanf("%f%f",&c,&d);
sum=a+b;
diff=a-b;
sum1=c+d;
diff1=c-d;
printf("%d %d\n",sum,diff);
printf("%.2f %.2f",sum1,diff1);
return 0;
} | 0 |
stefania-grecu/BitTorrent_Protocol | fbc9eba | src/tema2_eroarebuna.c | C | www.github.com/stefania-grecu/BitTorrent_Protocol/tree/main/src/tema2_eroarebuna.c | https://raw.githubusercontent.com/stefania-grecu/BitTorrent_Protocol/fbc9eba/src/tema2_eroarebuna.c | stefania-grecu/BitTorrent_Protocol fbc9eba src/tema2_eroarebuna.c | true | 200 | 20,691 | #include <mpi.h>
#include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define TRACKER_RANK 0
#define MAX_FILES 10
#define MAX_FILENAME 15
#define HASH_SIZE 32
#define MAX_CHUNKS 100
#define MAX_CLIENTS 100
// structura pentru un fisier
typedef struct {
char filename[MAX_FILENAME];
... | 2 |
tefsis/alx-low_level_programming | ec1f873 | 0x06-pointers_arrays_strings/0-strcat.c | C | www.github.com/tefsis/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/0-strcat.c | https://raw.githubusercontent.com/tefsis/alx-low_level_programming/ec1f873/0x06-pointers_arrays_strings/0-strcat.c | tefsis/alx-low_level_programming ec1f873 0x06-pointers_arrays_strings/0-strcat.c | true | 200 | 305 | #include "main.h"
/**
*_strcat - concatenates two strings
*@src: string one
*@dest: string two
*Return: dest
*/
char *_strcat(char *dest, char *src)
{
int i = 0;
int j = 0;
while (dest[i] != '\0')
{
i++;
}
for (j = 0; src[j] != '\0'; j++, i++)
{
dest[i] = src[j];
}
dest[i] = '\0';
return (dest);
}
| 4 |
obedydaka/alx-low_level_programming | 2aeb99c | 0x02-functions_nested_loops/10-add.c | C | www.github.com/obedydaka/alx-low_level_programming/tree/main/0x02-functions_nested_loops/10-add.c | https://raw.githubusercontent.com/obedydaka/alx-low_level_programming/2aeb99c/0x02-functions_nested_loops/10-add.c | obedydaka/alx-low_level_programming 2aeb99c 0x02-functions_nested_loops/10-add.c | true | 200 | 281 | #include "main.h"
/**
* add - Check main
* @a: integer a
* @b: integer b
* Description: This function adds two integers and returns the result
* Return: The addition of a and b
*/
int add(int a, int b)
{
int result;
result = 0;
result += (a + b);
return (result);
}
| 3 |
Matheus-Cahu/AED-Arlindo | a68daf2 | carro.c | C | www.github.com/Matheus-Cahu/AED-Arlindo/tree/main/carro.c | https://raw.githubusercontent.com/Matheus-Cahu/AED-Arlindo/a68daf2/carro.c | Matheus-Cahu/AED-Arlindo a68daf2 carro.c | true | 200 | 2,872 | #include <stdio.h>
#include <stdlib.h>
typedef struct Carro {
int chegada;
int saida;
struct Carro *next;
} Carro;
Carro* createCarro(int chegada, int saida) {
Carro *newCarro = (Carro*)malloc(sizeof(Carro));
newCarro->chegada = chegada;
newCarro->saida = saida;
newCarro->next... | 7 |
Joshua2-12/alx-low_level_programming | 26e51a3 | 0x04-more_functions_nested_loops/8-print_square.c | C | www.github.com/Joshua2-12/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/8-print_square.c | https://raw.githubusercontent.com/Joshua2-12/alx-low_level_programming/26e51a3/0x04-more_functions_nested_loops/8-print_square.c | Joshua2-12/alx-low_level_programming 26e51a3 0x04-more_functions_nested_loops/8-print_square.c | true | 200 | 273 | #include "main.h"
/**
* * print_square -> printing line
* * @size: integer params
*
*/
void print_square(int size)
{
int x, y;
if (size <= 0)
_putchar('\n');
else
{
for (x = 0; x < size; x++)
{
for (y = 0; y < size; y++)
{
_putchar(35);
}
_putchar('\n');
}
}
}
| 0 |
irshad9881/C-ASSIGNMENTS | 96e91b9 | Assigenment 14/A149.c | C | www.github.com/irshad9881/C-ASSIGNMENTS/tree/main/Assigenment 14/A149.c | https://raw.githubusercontent.com/irshad9881/C-ASSIGNMENTS/96e91b9/Assigenment%2014/A149.c | irshad9881/C-ASSIGNMENTS 96e91b9 Assigenment 14/A149.c | true | 200 | 327 | #include<stdio.h>
int main()
{
int a[10],i,n;
printf("Enter the size of array:");
scanf("%d",&n);
printf("Enter array elements");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("reverse elemrnts:");
for(i=n;i>=0;i--)
{
printf("%d ",a[i]);
}
retur... | 2 |
HassanZali/alx-low_level_programming | 13d0713 | 0x13-more_singly_linked_lists/101-print_listint_safe.c | C | www.github.com/HassanZali/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/101-print_listint_safe.c | https://raw.githubusercontent.com/HassanZali/alx-low_level_programming/13d0713/0x13-more_singly_linked_lists/101-print_listint_safe.c | HassanZali/alx-low_level_programming 13d0713 0x13-more_singly_linked_lists/101-print_listint_safe.c | true | 200 | 1,421 | #include "lists.h"
#include <stdio.h>
size_t looped_listint_len(const listint_t *head);
size_t print_listint_safe(const listint_t *head);
/**
* looped_listint_len - Counts the number of unique nodes
* in a looped listint_t linked list.
* @head: A pointer to the head of the listint_t to check.
*
* Return: If the list ... | 3 |
tlaronde/nix | 417a727 | sys/src/nix/port/edf.c | C | www.github.com/tlaronde/nix/tree/main/sys/src/nix/port/edf.c | https://raw.githubusercontent.com/tlaronde/nix/417a727/sys/src/nix/port/edf.c | tlaronde/nix 417a727 sys/src/nix/port/edf.c | true | 200 | 13,354 | /* EDF scheduling */
#include "u.h"
#include "../port/lib.h"
#include "mem.h"
#include "dat.h"
#include "fns.h"
#include "../port/error.h"
#include "../port/edf.h"
#include <trace.h>
/* debugging */
enum {
Dontprint = 1,
};
#define DPRINT if(Dontprint){}else print
static long now; /* Low order 32 bits of time in µ... | 4 |
Riccaraccio/basilisk-sandbox-rcaraccio | 4eaf8c5 | run/test2.c | C | www.github.com/Riccaraccio/basilisk-sandbox-rcaraccio/tree/main/run/test2.c | https://raw.githubusercontent.com/Riccaraccio/basilisk-sandbox-rcaraccio/4eaf8c5/run/test2.c | Riccaraccio/basilisk-sandbox-rcaraccio 4eaf8c5 run/test2.c | true | 200 | 2,589 | #define NO_ADVECTION_DIV 1
#define FSOLVE_ABSTOL 1.e-3
#define SOLVE_TEMPERATURE 1
#define MULTICOMPONENT 1
// #include "axi.h"
#include "navier-stokes/centered-phasechange.h"
// #include "opensmoke-properties.h"
#include "const-prop.h"
#include "two-phase.h"
#include "shrinking.h"
#include "multicomponent... | 7 |
code-help-tutor/COMP9201-COMP9201-asst3 | d38a30b | kern/fs/sfs/sfs_io.c | C | www.github.com/code-help-tutor/COMP9201-COMP9201-asst3/tree/main/kern/fs/sfs/sfs_io.c | https://raw.githubusercontent.com/code-help-tutor/COMP9201-COMP9201-asst3/d38a30b/kern/fs/sfs/sfs_io.c | code-help-tutor/COMP9201-COMP9201-asst3 d38a30b kern/fs/sfs/sfs_io.c | true | 200 | 11,913 | WeChat: cstutorcs
QQ: 749389476
Email: tutorcs@163.com
/*
* Copyright (c) 2000, 2001, 2002, 2003, 2004, 2005, 2008, 2009, 2014
* The President and Fellows of Harvard College.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
... | 0 |
amrmohsen1/2.Fan_Controller_System | ccf9f4a | Eclipse_Mini_Project3/Mini_Project3/lm35.c | C | www.github.com/amrmohsen1/2.Fan_Controller_System/tree/main/Eclipse_Mini_Project3/Mini_Project3/lm35.c | https://raw.githubusercontent.com/amrmohsen1/2.Fan_Controller_System/ccf9f4a/Eclipse_Mini_Project3/Mini_Project3/lm35.c | amrmohsen1/2.Fan_Controller_System ccf9f4a Eclipse_Mini_Project3/Mini_Project3/lm35.c | true | 200 | 783 | /**************************************
* Module: Temperature Sensor
* File name: lm35.h
* Description: Source file for the AVR LM35 Temperature Sensor driver
* Author: amr mohsen
*************************************/
#include "lm35.h"
#include "adc.h"
/**********************************************************... | 2 |
HichamBC/alx-low_level_programming | 3efa5a3 | 0x12-singly_linked_lists/3-add_node_end.c | C | www.github.com/HichamBC/alx-low_level_programming/tree/main/0x12-singly_linked_lists/3-add_node_end.c | https://raw.githubusercontent.com/HichamBC/alx-low_level_programming/3efa5a3/0x12-singly_linked_lists/3-add_node_end.c | HichamBC/alx-low_level_programming 3efa5a3 0x12-singly_linked_lists/3-add_node_end.c | true | 200 | 925 | #include <stdlib.h>
#include <string.h>
#include "lists.h"
/**
* add_node_end - adds a new node at the end of a list_t list.
* @head: double pointer to the head of a linked list.
* @str: string to be duplicated.
*
* Return: the address of the new node, or NULL if it failed.
*/
list_t *add_node_end(list_t **head... | 4 |
ecehasankemal/-full-repetition-challenge-activity | 1871d82 | example_piscine_c07/ex00/my_strdup.c | C | www.github.com/ecehasankemal/-full-repetition-challenge-activity/tree/main/example_piscine_c07/ex00/my_strdup.c | https://raw.githubusercontent.com/ecehasankemal/-full-repetition-challenge-activity/1871d82/example_piscine_c07/ex00/my_strdup.c | ecehasankemal/-full-repetition-challenge-activity 1871d82 example_piscine_c07/ex00/my_strdup.c | true | 200 | 407 | #include <stdlib.h>
int
my_strlen(char *str)
{
int i = 0;
while (str[i])
i++;
return (i);
}
char
*my_strdup(char *src)
{
char *result;
int len;
len = my_strlen(src);
result = (char *)malloc(sizeof(char) * len) + 1;
if (result == NULL)
return (NULL);
wh... | 5 |
omroot/DataStructuresAndAlgorithms | dc80baa | dsa/5_graphs/bfs.c | C | www.github.com/omroot/DataStructuresAndAlgorithms/tree/main/dsa/5_graphs/bfs.c | https://raw.githubusercontent.com/omroot/DataStructuresAndAlgorithms/dc80baa/dsa/5_graphs/bfs.c | omroot/DataStructuresAndAlgorithms dc80baa dsa/5_graphs/bfs.c | true | 200 | 3,696 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#define MAX_VERTICES 100
// Structure to represent a node in the adjacency list
struct ListNode {
int dest;
struct ListNode* next;
};
// Structure to represent an adjacency list
struct List {
struct ListNode* head;
};
// Structure to represent ... | 7 |
Kess4obehi/kess-low_level_programming | d0a9fc0 | 0x04-more_functions_nested_loops/0-isupper.c | C | www.github.com/Kess4obehi/kess-low_level_programming/tree/main/0x04-more_functions_nested_loops/0-isupper.c | https://raw.githubusercontent.com/Kess4obehi/kess-low_level_programming/d0a9fc0/0x04-more_functions_nested_loops/0-isupper.c | Kess4obehi/kess-low_level_programming d0a9fc0 0x04-more_functions_nested_loops/0-isupper.c | true | 200 | 263 | #include "main.h"
/**
* _isupper - A function that checks for uppercase character.
* @c: the character to be checked
* Return: 1 for upper character or 0 for anything else
*/
int _isupper(int c)
{
if (c >= 65 && c <= 90)
{
return (1);
}
return (0);
}
| 3 |
Nileshonar077/Ltts-C--Programming-Set-2 | 1e43ce4 | Leap.c | C | www.github.com/Nileshonar077/Ltts-C--Programming-Set-2/tree/main/Leap.c | https://raw.githubusercontent.com/Nileshonar077/Ltts-C--Programming-Set-2/1e43ce4/Leap.c | Nileshonar077/Ltts-C--Programming-Set-2 1e43ce4 Leap.c | true | 200 | 296 | #include<stdio.h>
int main()
{
int yy;
printf("Enter a year: ");
scanf("%d", &yy);
if ((yy % 4 == 0 && yy % 100 != 0) || yy % 400 == 0)
{
printf("%d is a leap year\n", yy);
}
else
{
printf("%d is not a leap year", yy);
}
return 0;
}
| 0 |
odiaivie1/alx-low_level_programming | ac27ee7 | 0x15-file_io/0-read_textfile.c | C | www.github.com/odiaivie1/alx-low_level_programming/tree/main/0x15-file_io/0-read_textfile.c | https://raw.githubusercontent.com/odiaivie1/alx-low_level_programming/ac27ee7/0x15-file_io/0-read_textfile.c | odiaivie1/alx-low_level_programming ac27ee7 0x15-file_io/0-read_textfile.c | true | 200 | 574 | #include "main.h"
#include <stdlib.h>
/**
* read_textfile - It reads text file print to stdout.
* @filename: The textfile thats being read.
* @letters: The number of letters being read.
* Return: the actual number of letters it could read and print
*/
ssize_t read_textfile(const char *filename, size_t letters)
{
... | 2 |
ejtmaravillas/minitalk | 8843486 | lib/libft/get_next_line_bonus.c | C | www.github.com/ejtmaravillas/minitalk/tree/main/lib/libft/get_next_line_bonus.c | https://raw.githubusercontent.com/ejtmaravillas/minitalk/8843486/lib/libft/get_next_line_bonus.c | ejtmaravillas/minitalk 8843486 lib/libft/get_next_line_bonus.c | true | 200 | 3,076 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* get_next_line_bonus.c :+: :+: :+: ... | 1 |
Nicoskin/OFDM_transceiver | ff683ed | config.h | C | www.github.com/Nicoskin/OFDM_transceiver/tree/main/config.h | https://raw.githubusercontent.com/Nicoskin/OFDM_transceiver/ff683ed/config.h | Nicoskin/OFDM_transceiver ff683ed config.h | true | 200 | 582 | #ifndef CONFIG_H
#define CONFIG_H
// Параметры OFDM
#define N_FFT 128
#define G_SUBCAR 55
#define N_PILOTS 12
#define CP_LEN 0 // Normal 0, Extended 1
#define IQ_MODULATION 2 // BPSK 1, QPSK 2, 16QAM 4, 64QAM 6
#define OFDM_SYM_IN_SLOT (CP_LEN == 0 ? 6 : 5)
// Параметры сегментера
#define MAX_LEN_LINE... | 6 |
aybdee/stingray | 88ffd69 | C/hittable_list.c | C | www.github.com/aybdee/stingray/tree/main/C/hittable_list.c | https://raw.githubusercontent.com/aybdee/stingray/88ffd69/C/hittable_list.c | aybdee/stingray 88ffd69 C/hittable_list.c | true | 200 | 1,240 | #include <stdbool.h>
#include "sphere.h"
#include "hittable.h"
#include "hittable_list.h"
#include "hit_rec.h"
bool pool_hits(HittableList list, Ray r, float t_min, float t_max, HitRecord *rec)
{
HitRecord temp_rec;
HitRecord *temp_rec_p = &temp_rec;
bool hit_anything = false;
double closest_so_far = ... | 4 |
Anant-K-Gupta/CS50 | 04c6d46 | migration/pset1/credit.c | C | www.github.com/Anant-K-Gupta/CS50/tree/main/migration/pset1/credit.c | https://raw.githubusercontent.com/Anant-K-Gupta/CS50/04c6d46/migration/pset1/credit.c | Anant-K-Gupta/CS50 04c6d46 migration/pset1/credit.c | true | 200 | 1,012 | #include <cs50.h>
#include <stdio.h>
int (main)void
{
long long num;
do
{
num = get_long("Number: ");
}
while (num<0);
if valid(num)
{
printcomp(num)
}
else
{
printf("INVALID\n");
}
}
bool valid(long long num)
{
int length = numlen(... | 5 |
1manasseh23/alx-low_level_programming | 4caf495 | 0x0C-more_malloc_free/0-malloc_checked.c | C | www.github.com/1manasseh23/alx-low_level_programming/tree/main/0x0C-more_malloc_free/0-malloc_checked.c | https://raw.githubusercontent.com/1manasseh23/alx-low_level_programming/4caf495/0x0C-more_malloc_free/0-malloc_checked.c | 1manasseh23/alx-low_level_programming 4caf495 0x0C-more_malloc_free/0-malloc_checked.c | true | 200 | 357 | #include <stdio.h>
#include <stdlib.h>
#include "main.h"
/**
* malloc_checked - A function that allocates memory using malloc
* @b: Character to check
*
* Return: Pointer
* an error or terminate the process with staus 98
*/
void *malloc_checked(unsigned int b)
{
void *alt;
alt = malloc(b);
if (alt == NULL... | 7 |
JENILP07/C-programs | 4ea22e9 | x24.c | C | www.github.com/JENILP07/C-programs/tree/main/x24.c | https://raw.githubusercontent.com/JENILP07/C-programs/4ea22e9/x24.c | JENILP07/C-programs 4ea22e9 x24.c | true | 200 | 622 | /*structure*/
#include <stdio.h>
struct book
{
char book_name[30];
int page_no;
float price;
};
int main(){
int n;
printf("Enter Array Size : ");
scanf("%d",&n);
struct book b[100];
for(int i=0; i<2; i++){
printf("Enter Book Name : ");
scanf("%s",b[i].book_name);
... | 3 |
DYXX-X/Library_zh | 4aed9d0 | ESP32_API_zh/soc/esp32s3/include/soc/lcd_cam_struct.h | C | www.github.com/DYXX-X/Library_zh/tree/main/ESP32_API_zh/soc/esp32s3/include/soc/lcd_cam_struct.h | https://raw.githubusercontent.com/DYXX-X/Library_zh/4aed9d0/ESP32_API_zh/soc/esp32s3/include/soc/lcd_cam_struct.h | DYXX-X/Library_zh 4aed9d0 ESP32_API_zh/soc/esp32s3/include/soc/lcd_cam_struct.h | true | 200 | 28,418 | /*
* SPDX文件版权文本：2021浓缩咖啡系统（上海）有限公司
*
* SPDX许可证标识符：Apache-2.0
*/
#pragma once
#include <stdint.h>
#ifdef __cplusplus
extern "C" {
#endif
/**组：LCD配置寄存器*/
/** lcd_clock寄存器类型lcd时钟寄存器
*/
typedef union {
struct {
/** lcd_clkcnt_n:R/W；比特位置：[5:0]；默认值：3；当reg_CLK_equ_sysclk为0时，f_LCD_PCLK=f_LCD_CLK/（reg_clkcnt_... | 0 |
zhengyang92/loops | bfcabb6 | srcs.iaca/361.c | C | www.github.com/zhengyang92/loops/tree/main/srcs.iaca/361.c | https://raw.githubusercontent.com/zhengyang92/loops/bfcabb6/srcs.iaca/361.c | zhengyang92/loops bfcabb6 srcs.iaca/361.c | true | 200 | 438 | #include "../iacaMarks.h"
#include <stdint.h>
#include <stdio.h>
typedef __uint8_t uint8_t;
int
fn (int i, int mask, uint8_t * p, char buf[128], const uint8_t * font,
const uint8_t * color, int font_height, int char_y)
{
for (mask = 0x80; mask; mask >>= 1)
{ IACA_START
if (font[buf[i] * font_heigh... | 4 |
Nzau1/alx-low_level_programming | 3adb347 | 0x01-variables_if_else_while/3-print_alphabets.c | C | www.github.com/Nzau1/alx-low_level_programming/tree/main/0x01-variables_if_else_while/3-print_alphabets.c | https://raw.githubusercontent.com/Nzau1/alx-low_level_programming/3adb347/0x01-variables_if_else_while/3-print_alphabets.c | Nzau1/alx-low_level_programming 3adb347 0x01-variables_if_else_while/3-print_alphabets.c | true | 200 | 330 | #include <stdlib.h>
#include <time.h>
#include <stdio.h>
/**
* main - this program prints the alphabets in lowercase and in uppercase
* Return:0 (success)
*/
int main(void)
{
char lc;
for (lc = 'a'; lc <= 'z'; lc++)
{
putchar(lc);
}
for (lc = 'A'; lc <= 'Z'; lc++)
{
putchar(lc);
}
putchar('\n');
retu... | 1 |
nabto/nabto-embedded-sdk | b1f2c9d | src/modules/iam/nm_iam_to_json.c | C | www.github.com/nabto/nabto-embedded-sdk/tree/main/src/modules/iam/nm_iam_to_json.c | https://raw.githubusercontent.com/nabto/nabto-embedded-sdk/b1f2c9d/src/modules/iam/nm_iam_to_json.c | nabto/nabto-embedded-sdk b1f2c9d src/modules/iam/nm_iam_to_json.c | true | 200 | 2,741 | #include "nm_iam_to_json.h"
#include "nm_iam_role.h"
#include "nm_iam_user.h"
#include <cjson/cJSON.h>
cJSON* nm_iam_role_to_json(struct nm_iam_role* role)
{
cJSON* root = cJSON_CreateObject();
cJSON_AddItemToObject(root, "Id", cJSON_CreateString(role->id));
cJSON* policies = cJSON_CreateArray();
co... | 2 |
zhihaoevans/basic_learn | 47775cd | linux/c/queue/list_test.c | C | www.github.com/zhihaoevans/basic_learn/tree/main/linux/c/queue/list_test.c | https://raw.githubusercontent.com/zhihaoevans/basic_learn/47775cd/linux/c/queue/list_test.c | zhihaoevans/basic_learn 47775cd linux/c/queue/list_test.c | true | 200 | 1,219 | #include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <sys/queue.h>
struct entry
{
int data;
LIST_ENTRY(entry) entries; /* List */
};
LIST_HEAD(listhead, entry);
int main(void)
{
struct entry *n1, *n2, *n3, *np;
struct listhead head; /* List head */
int i;
LIST_INIT(&head); /* ... | 6 |
yhtzd/skyloft | a7f4e9c | microbench/thread.c | C | www.github.com/yhtzd/skyloft/tree/main/microbench/thread.c | https://raw.githubusercontent.com/yhtzd/skyloft/a7f4e9c/microbench/thread.c | yhtzd/skyloft a7f4e9c microbench/thread.c | true | 200 | 2,017 | #include <stdatomic.h>
#include <stdio.h>
#include <skyloft/sync.h>
#include <skyloft/task.h>
#include <skyloft/uapi/task.h>
#include <utils/time.h>
#include "common.h"
#include "skyloft/sync/sync.h"
#define ROUNDS 10000000
#define ROUNDS2 10000
static atomic_int counter = 0;
static void null_fn(void *)
{
at... | 5 |
Uellei/materias-faculdade | 7e7508e | Estrutura de Dados/ListaExercicios/Exercicio1/Ex1.c | C | www.github.com/Uellei/materias-faculdade/tree/main/Estrutura de Dados/ListaExercicios/Exercicio1/Ex1.c | https://raw.githubusercontent.com/Uellei/materias-faculdade/7e7508e/Estrutura%20de%20Dados/ListaExercicios/Exercicio1/Ex1.c | Uellei/materias-faculdade 7e7508e Estrutura de Dados/ListaExercicios/Exercicio1/Ex1.c | true | 200 | 559 | #include <stdlib.h>
#include <stdio.h>
void hm(int mnts, int *h, int *m){
*h = mnts/60;
*m = mnts%60;
// printf("Horas: %i\n", *h);
// printf("Minutos: %i", *m);
}
void main(){
int tempomin, horas, minutos;
printf("Digite o tempo em minutos\n");
scanf("%i", &tempomin);
// Como a função... | 7 |
gupta-siddhartha/PLUTOv4.2-CRHD | 1e863a1 | Src/States/plm_states.c | C | www.github.com/gupta-siddhartha/PLUTOv4.2-CRHD/tree/main/Src/States/plm_states.c | https://raw.githubusercontent.com/gupta-siddhartha/PLUTOv4.2-CRHD/1e863a1/Src/States/plm_states.c | gupta-siddhartha/PLUTOv4.2-CRHD 1e863a1 Src/States/plm_states.c | true | 200 | 23,111 | /* ///////////////////////////////////////////////////////////////////// */
/*!
\file
\brief Piecewise linear reconstruction.
Compute interface states using piecewise linear reconstruction
inside each zone.
Reconstruction is performed in primitive variable when
<tt> CHAR_LIMITING == NO </tt>) or charact... | 3 |
Seo-Faper/Data_Structure_with_C | 1d85ce4 | chap08/ch08_5/ex8_5.c | C | www.github.com/Seo-Faper/Data_Structure_with_C/tree/main/chap08/ch08_5/ex8_5.c | https://raw.githubusercontent.com/Seo-Faper/Data_Structure_with_C/1d85ce4/chap08/ch08_5/ex8_5.c | Seo-Faper/Data_Structure_with_C 1d85ce4 chap08/ch08_5/ex8_5.c | true | 200 | 2,152 | #include <stdio.h>
#include "dijkstra.h"
#include <stdio.h>
#include "dijkstra.h"
#include "graphG.h"
// 최소 거리를 갖는 다음 정점을 찾는 연산
int nextVertex(int n)
{
int i, min, minPos;
min = INF;
minPos = -1;
for (i = 0; i < n; i++)
if ((distance[i] < min) && !S[i])
{
min = distance[i];
minPos = i;
}
return minPos... | 4 |
alvaroorbegoso/Identificador-de-billetes-peruanos | c0f38b1 | game2/game2.c | C | www.github.com/alvaroorbegoso/Identificador-de-billetes-peruanos/tree/main/game2/game2.c | https://raw.githubusercontent.com/alvaroorbegoso/Identificador-de-billetes-peruanos/c0f38b1/game2/game2.c | alvaroorbegoso/Identificador-de-billetes-peruanos c0f38b1 game2/game2.c | true | 200 | 1,270 | #include <stdio.h>
// Función para acreditar los créditos según el valor del billete ingresado
int acreditarCreditos(int valorBillete, int creditosAcumulados) {
// Arreglo que contiene los valores de billetes aceptados
int billetesAceptados[] = {10, 20, 50, 100};
// Arreglo que contiene la cant... | 2 |
Joram21/alx-low_level_programming | 3dfd8b4 | 0x10-variadic_functions/0-sum_them_all.c | C | www.github.com/Joram21/alx-low_level_programming/tree/main/0x10-variadic_functions/0-sum_them_all.c | https://raw.githubusercontent.com/Joram21/alx-low_level_programming/3dfd8b4/0x10-variadic_functions/0-sum_them_all.c | Joram21/alx-low_level_programming 3dfd8b4 0x10-variadic_functions/0-sum_them_all.c | true | 200 | 458 | #include <stdarg.h>
#include "variadic_functions.h"
#include <stdlib.h>
#include <stdio.h>
/**
* sum_them_all -returns the sum of all its parameters
* @n: Mandatory parameter
* Return: the sum, otherwise 0 (success)
*/
int sum_them_all(const unsigned int n, ...)
{
va_list ap;
unsigned int j, nSum;
if (n == 0)... | 1 |
mcaglarsaglam/c-workshop | 1ad9d62 | character-series/example2.c | C | www.github.com/mcaglarsaglam/c-workshop/tree/main/character-series/example2.c | https://raw.githubusercontent.com/mcaglarsaglam/c-workshop/1ad9d62/character-series/example2.c | mcaglarsaglam/c-workshop 1ad9d62 character-series/example2.c | true | 200 | 225 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
main()
{
// example.2
char caglar[100][100] = {"bir", "iki", "uç", "dort", "bes"};
printf("%s\n", caglar[3]);
printf("%c", caglar[3][2]);
return 0;
} | 5 |
swapnadeepmohapatra/dsa-college-assignments | d28f973 | assignments/1.c | C | www.github.com/swapnadeepmohapatra/dsa-college-assignments/tree/main/assignments/1.c | https://raw.githubusercontent.com/swapnadeepmohapatra/dsa-college-assignments/d28f973/assignments/1.c | swapnadeepmohapatra/dsa-college-assignments d28f973 assignments/1.c | true | 200 | 2,809 | #include <stdio.h>
// Function to input a sparse matrix
void inputSparseMatrix(int matrix[][3], int *terms, int rows, int cols)
{
*terms = 0;
printf("Enter the elements of the matrix:\n");
for (int i = 0; i < rows; i++)
{
for (int j = 0; j < cols; j++)
{
int element;
... | 6 |
alexis801/my_top | a5f5761 | main.c | C | www.github.com/alexis801/my_top/tree/main/main.c | https://raw.githubusercontent.com/alexis801/my_top/a5f5761/main.c | alexis801/my_top a5f5761 main.c | true | 200 | 871 | /*
** EPITECH PROJECT, 2024
** main
** File description:
** main
*/
#include "my.h"
int header(void)
{
my_get_time();
printw("\n");
task();
printw("\n");
mem_file();
printw("\n");
mem_swap_file();
return 0;
}
void wait(int count, int last)
{
if (count != last) {
move(0, 0)... | 3 |
ASUKA39/TinyOS | d7413ca | 09_userprog/device/ioqueue.c | C | www.github.com/ASUKA39/TinyOS/tree/main/09_userprog/device/ioqueue.c | https://raw.githubusercontent.com/ASUKA39/TinyOS/d7413ca/09_userprog/device/ioqueue.c | ASUKA39/TinyOS d7413ca 09_userprog/device/ioqueue.c | true | 200 | 1,568 | #include "ioqueue.h"
#include "interrupt.h"
#include "global.h"
#include "debug.h"
void ioqueue_init(struct ioqueue* ioq) {
lock_init(&ioq->lock);
ioq->producer = ioq->consumer = NULL;
ioq->head = ioq->tail = 0;
}
static int32_t next_pos(int32_t pos) {
return (pos + 1) % bufsize;
}
bool ioq_full(struct i... | 0 |
alexanderKus/Lang-custom-language | 1a8005f | c/memory.c | C | www.github.com/alexanderKus/Lang-custom-language/tree/main/c/memory.c | https://raw.githubusercontent.com/alexanderKus/Lang-custom-language/1a8005f/c/memory.c | alexanderKus/Lang-custom-language 1a8005f c/memory.c | true | 200 | 270 | #include <stdlib.h>
#include "include/memory.h"
void* reallocate(void* pointer, size_t oldSize, size_t newSize) {
if (newSize == 0){
free(pointer);
return NULL;
}
void* result = realloc(pointer, newSize);
if (result == NULL) exit(1);
return result;
}
| 4 |
Mehdibe04/simple_shell | 3d2feec | vars.c | C | www.github.com/Mehdibe04/simple_shell/tree/main/vars.c | https://raw.githubusercontent.com/Mehdibe04/simple_shell/3d2feec/vars.c | Mehdibe04/simple_shell 3d2feec vars.c | true | 200 | 3,772 | #include "shell.h"
/* CREATED BY Amina El Hakik, Mehdi Belaazri */
/**
* replace_string_fnc_shll - str changing
* @olddSh: @ old str
* @newSh: str input
*
* Return: 1 (Success), 0 (Failure)
*/
int replace_string_fnc_shll(char **olddSh, char *newSh)
{
free(*olddSh);
*olddSh = newSh;
return... | 1 |
laycoon001/simple_shell | 3784356 | builtins_functions.c | C | www.github.com/laycoon001/simple_shell/tree/main/builtins_functions.c | https://raw.githubusercontent.com/laycoon001/simple_shell/3784356/builtins_functions.c | laycoon001/simple_shell 3784356 builtins_functions.c | true | 200 | 2,257 | #include "main.h"
struct alias aliasee[100];
int num_alias = 0;
/**
* handle_alias - handling of aliases
* @args: argument
* Return:
*/
void handle_alias(char **args)
{
int v;
if (args[1] == NULL)
{
list_aliases();
}
else
{
for (v = 1; args[v] != NULL; v++)
{
if (_strchr(args[v], '=') != NULL)
... | 2 |
MrtnOmwenga/alx-low_level_programming | 19c7d7d | 0x02-functions_nested_loops/104-fibonacci.c | C | www.github.com/MrtnOmwenga/alx-low_level_programming/tree/main/0x02-functions_nested_loops/104-fibonacci.c | https://raw.githubusercontent.com/MrtnOmwenga/alx-low_level_programming/19c7d7d/0x02-functions_nested_loops/104-fibonacci.c | MrtnOmwenga/alx-low_level_programming 19c7d7d 0x02-functions_nested_loops/104-fibonacci.c | true | 200 | 386 | #include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
/**
* main - Prints a times table
*
* Return: Always 0 (Success)
*
*/
int main(void)
{
int c;
int64_t d;
int64_t e;
int64_t f;
d = 1;
e = 2;
f = e + d;
printf("%ld, ", d);
printf("%ld, ", e);
for (c = 0; c < 96; c++)
{
printf("%ld", f);
if (c < 95)
{
print... | 5 |
volanddo/Projet-OS | 72de6e9 | conception-os-voland/start.c | C | www.github.com/volanddo/Projet-OS/tree/main/conception-os-voland/start.c | https://raw.githubusercontent.com/volanddo/Projet-OS/72de6e9/conception-os-voland/start.c | volanddo/Projet-OS 72de6e9 conception-os-voland/start.c | true | 200 | 957 | #include "cpu.h"
#include <inttypes.h>
#include <stdio.h>
#include "console.h"
#include "traitants_.h"
#include "processus.h"
#include <stdio.h>
#include "clock_print.h"
// on peut s'entrainer a utiliser GDB avec ce code de base
// par exemple afficher les valeurs de x, n et res avec la commande display
// une fonctio... | 6 |
tongyf2333/my-os-kernel | bfc4f5a | fsrecov/fsrecov.c | C | www.github.com/tongyf2333/my-os-kernel/tree/main/fsrecov/fsrecov.c | https://raw.githubusercontent.com/tongyf2333/my-os-kernel/bfc4f5a/fsrecov/fsrecov.c | tongyf2333/my-os-kernel bfc4f5a fsrecov/fsrecov.c | true | 200 | 6,381 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <fcntl.h>
#include <unistd.h>
#include <limits.h>
#include <sys/mman.h>
#include "fat32.h"
struct fat32hdr *hdr;
wchar_t long_name[4096];
LFNEntry *names[256];
int clussiz;
char buffer[16*1024*1024],buf[128];
int abs(int x){
i... | 3 |
OlaTarig/alx-low_level_programming | 6c1a4f0 | 0x09-static_libraries/3-islower.c | C | www.github.com/OlaTarig/alx-low_level_programming/tree/main/0x09-static_libraries/3-islower.c | https://raw.githubusercontent.com/OlaTarig/alx-low_level_programming/6c1a4f0/0x09-static_libraries/3-islower.c | OlaTarig/alx-low_level_programming 6c1a4f0 0x09-static_libraries/3-islower.c | true | 200 | 240 | #include "main.h"
/**
* _islower - check whether a char is a lowercase or not
* @c: an argument for the function
* Return: Always 0.
*/
int _islower(int c)
{
if ((c >= 97) && (c <= 122))
{
return (1);
}
else
{
return (0);
}
}
| 4 |
Shrimptempura/all | 0185f78 | Programming/express3/Chapter12/lab6.c | C | www.github.com/Shrimptempura/all/tree/main/Programming/express3/Chapter12/lab6.c | https://raw.githubusercontent.com/Shrimptempura/all/0185f78/Programming/express3/Chapter12/lab6.c | Shrimptempura/all 0185f78 Programming/express3/Chapter12/lab6.c | true | 200 | 562 | // 키보드에 입력된 문자를 검사하여 소문자이면 대문자로 변환 프로그램 예제
#include <stdio.h>
#include <ctype.h>
int main(void)
{
int c;
while ((c = getchar()) != EOF)
{
if (islower(c))
{
c = toupper(c); // islower()를 사용해 소문자인지 검사하고, 소문자이면
// toupper()를 이용하여 대문자로 변환
... | 0 |
Pamela1023/git-ejemplo | 7ce9f08 | codigo 4_TP1.c | C | www.github.com/Pamela1023/git-ejemplo/tree/main/codigo 4_TP1.c | https://raw.githubusercontent.com/Pamela1023/git-ejemplo/7ce9f08/codigo%204_TP1.c | Pamela1023/git-ejemplo 7ce9f08 codigo 4_TP1.c | true | 200 | 607 | #include<stdio.h>
int main()
{
float angulo;
int n = 0, potencia = 0, factorial = 0, Factorialn = 1, producto = 0;
printf("Ingrese el angulo: ");
scanf("%f", &angulo);
n = 4;
if (n % 2 == 0)
{
potencia = 1;
}
else
{
potencia = -1;
}
for ... | 1 |
eddiemws/alx-low_level_programming | 0be15a5 | 0x1E-search_algorithms/106-linear_skip.c | C | www.github.com/eddiemws/alx-low_level_programming/tree/main/0x1E-search_algorithms/106-linear_skip.c | https://raw.githubusercontent.com/eddiemws/alx-low_level_programming/0be15a5/0x1E-search_algorithms/106-linear_skip.c | eddiemws/alx-low_level_programming 0be15a5 0x1E-search_algorithms/106-linear_skip.c | true | 200 | 1,197 | #include "search_algos.h"
/**
* linear_skip - Searches for a value in a sorted skip list of integers.
*
* @list: A pointer to the head of the skip list to search in.
* @value: The value to search for.
*
* Return: A pointer on the first node where value is located.
* If value is not present in l... | 5 |
prnjl99/Bare_metal_embedded_development | cbcc07a | test_applications/scratch/stm/heap_stack/main.c | C | www.github.com/prnjl99/Bare_metal_embedded_development/tree/main/test_applications/scratch/stm/heap_stack/main.c | https://raw.githubusercontent.com/prnjl99/Bare_metal_embedded_development/cbcc07a/test_applications/scratch/stm/heap_stack/main.c | prnjl99/Bare_metal_embedded_development cbcc07a test_applications/scratch/stm/heap_stack/main.c | true | 200 | 713 | #include <stddef.h>
#include <stdlib.h>
#include <errno.h>
#include "startup.h"
#include "common.h"
#include "gpio.h"
void *_sbrk(size_t incr)
{
extern uint8_t _heap_start;
extern uint8_t _heap_limit;
static uint8_t *heap_end;
uint8_t *temp;
if(heap_end == 0)
{
heap_end = &_heap_start;
}
temp ... | 6 |
WanjiruKinyua/alx-low_level_programming1 | c25ed0c | 0x09-static_libraries/4-strpbrk.c | C | www.github.com/WanjiruKinyua/alx-low_level_programming1/tree/main/0x09-static_libraries/4-strpbrk.c | https://raw.githubusercontent.com/WanjiruKinyua/alx-low_level_programming1/c25ed0c/0x09-static_libraries/4-strpbrk.c | WanjiruKinyua/alx-low_level_programming1 c25ed0c 0x09-static_libraries/4-strpbrk.c | true | 200 | 286 | #include "main.h"
/**
* _strpbrk - Entry point
* @s: input
* @accept: input
* Return: 0 on Success
*/
char *_strpbrk(char *s, char *accept)
{
int r;
while (*s)
{
for (r = 0; accept[r]; r++)
{
if (*s == accept[r])
{
return (s);
}
}
s++;
}
return ('\0');
}
| 3 |
flaviomarcilio/course-information-systems | 746b2e9 | PDSI/pratica4/pratica4.c | C | www.github.com/flaviomarcilio/course-information-systems/tree/main/PDSI/pratica4/pratica4.c | https://raw.githubusercontent.com/flaviomarcilio/course-information-systems/746b2e9/PDSI/pratica4/pratica4.c | flaviomarcilio/course-information-systems 746b2e9 PDSI/pratica4/pratica4.c | true | 200 | 9,640 | #include <math.h>
#include "pratica4.h"
/*================================= Exercício 1 =====================================
Implementar uma função que recebe como parâmetro uma velocidade em km/h (quilômetros
por hora) e retorne a mesma convertida para m/s (metros por segundo). A fórmula de
conversão é M = K/3.6, se... | 0 |
assu-2000/alx-low_level_programming | 2a19628 | 0x13-more_singly_linked_lists/0-print_listint.c | C | www.github.com/assu-2000/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/0-print_listint.c | https://raw.githubusercontent.com/assu-2000/alx-low_level_programming/2a19628/0x13-more_singly_linked_lists/0-print_listint.c | assu-2000/alx-low_level_programming 2a19628 0x13-more_singly_linked_lists/0-print_listint.c | true | 200 | 353 | #include <stdio.h>
#include "lists.h"
/**
* print_listint - Prints all the elements of a linked list
* @h: The head of the linked list
*
* Return: The number of nodes of the linked list
*/
size_t print_listint(const listint_t *h)
{
int count = 0;
if (h != NULL)
{
while (h)
{
printf("%d\n", h->n);
h = h->next;... | 4 |
HoganMok/IPC | 178b239 | socket.c | C | www.github.com/HoganMok/IPC/tree/main/socket.c | https://raw.githubusercontent.com/HoganMok/IPC/178b239/socket.c | HoganMok/IPC 178b239 socket.c | true | 200 | 2,937 | #include "socket.h"
static int socketDescriptor;
static struct addrinfo *res;
List* list;
static pthread_cond_t s_syncOkToShutdownCondVar = PTHREAD_COND_INITIALIZER;
static pthread_mutex_t s_syncOkToShutdownMutex = PTHREAD_MUTEX_INITIALIZER;
static pthread_mutex_t s_syncOkToAppendMutex = PTHREAD_MUTEX_INITIALIZER;
sta... | 5 |
cheimabou/alx-low_level_programming | b2a4a6a | 0x0E-structures_typedef/1-init_dog.c | C | www.github.com/cheimabou/alx-low_level_programming/tree/main/0x0E-structures_typedef/1-init_dog.c | https://raw.githubusercontent.com/cheimabou/alx-low_level_programming/b2a4a6a/0x0E-structures_typedef/1-init_dog.c | cheimabou/alx-low_level_programming b2a4a6a 0x0E-structures_typedef/1-init_dog.c | true | 200 | 294 | #include "dog.h"
/**
* init_dog - a function that initializes a struct dog
* @name: dog's name
* @age: dog's age
* @owner: dog's owner
* @d: the dog
*/
void init_dog(struct dog *d, char *name, float age, char *owner)
{
if (d)
{
d->name = name;
d->age = age;
d->owner = owner;
}
}
| 0 |
Anteneh-W/alx-low_level_programming | 9761a29 | 0x02-functions_nested_loops/101-natural.c | C | www.github.com/Anteneh-W/alx-low_level_programming/tree/main/0x02-functions_nested_loops/101-natural.c | https://raw.githubusercontent.com/Anteneh-W/alx-low_level_programming/9761a29/0x02-functions_nested_loops/101-natural.c | Anteneh-W/alx-low_level_programming 9761a29 0x02-functions_nested_loops/101-natural.c | true | 200 | 272 | #include <stdio.h>
/**
* main - entry
* prints the sum of all multiples of 3 or 5 up to 102
* Return: Always 0
*/
int main(void)
{
int i, z = 0;
while (i < 1024)
{
if ((i % 3 == 0) || (i % 5 == 0))
{
z += i;
}
i++;
}
printf("%d\n", z);
return (0);
}
| 4 |
Chingau/linux_c_program | 4a452fb | socket/UNIX/echo_server.c | C | www.github.com/Chingau/linux_c_program/tree/main/socket/UNIX/echo_server.c | https://raw.githubusercontent.com/Chingau/linux_c_program/4a452fb/socket/UNIX/echo_server.c | Chingau/linux_c_program 4a452fb socket/UNIX/echo_server.c | true | 200 | 2,933 | // 服务器
#include <assert.h>
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/socket.h>
#include <sys/un.h>
#include <unistd.h>
#define UNIX_SOCKET_PATH "/tmp/echo_unix_socket"
#define BACKLOG 5
#define MSG_MAX_LENGTH 100
void echo(int client_fd);
vo... | 5 |
Wos2610/C_PTIT | b283405 | C07016.c | C | www.github.com/Wos2610/C_PTIT/tree/main/C07016.c | https://raw.githubusercontent.com/Wos2610/C_PTIT/b283405/C07016.c | Wos2610/C_PTIT b283405 C07016.c | true | 200 | 1,713 | #include<stdio.h>
#include<string.h>
struct Student {
int num;
char name[100006];
char date[100006];
double mark1;
double mark2;
double mark3;
double marksum;
};
struct Student f[100];
void compare(struct Student f1, struct Student f2) {
if (f1.marksum < f2.marksum) {
struct Student tmp;
tmp.num = f2.... | 0 |
rilemko/42-philosophers | 218fb2a | philo/sources/utils/ft_philo.c | C | www.github.com/rilemko/42-philosophers/tree/main/philo/sources/utils/ft_philo.c | https://raw.githubusercontent.com/rilemko/42-philosophers/218fb2a/philo/sources/utils/ft_philo.c | rilemko/42-philosophers 218fb2a philo/sources/utils/ft_philo.c | true | 200 | 3,047 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_philo.c :+: :+: :+: ... | 4 |
Belkasy/ARM-STM32F103C8T6_COTS | e2df15f | 02-MCAL/I2C/I2C_Private.h | C | www.github.com/Belkasy/ARM-STM32F103C8T6_COTS/tree/main/02-MCAL/I2C/I2C_Private.h | https://raw.githubusercontent.com/Belkasy/ARM-STM32F103C8T6_COTS/e2df15f/02-MCAL/I2C/I2C_Private.h | Belkasy/ARM-STM32F103C8T6_COTS e2df15f 02-MCAL/I2C/I2C_Private.h | true | 200 | 3,881 | /**
* @name I2C_Private.h
* @version v1.0
* @authors Abdelrahman Belkasy, Wx
* @date 19 Aug 2022
* @copyright Belkasy, Wx
*/
/** @def Header Guard */
#ifndef _I2C_PRIVATE_H
#define _I2C_PRIVATE_H
/*
------------------------------------------------------------------------------------------... | 5 |
crcsrobotics/2023-IncisionDecision | ec8a6ee | main.c | C | www.github.com/crcsrobotics/2023-IncisionDecision/tree/main/main.c | https://raw.githubusercontent.com/crcsrobotics/2023-IncisionDecision/ec8a6ee/main.c | crcsrobotics/2023-IncisionDecision ec8a6ee main.c | true | 200 | 8,178 | #pragma config(Sensor, dgtl1, stopSensor, sensorDigitalIn)
#pragma config(Sensor, dgtl3, leftSensor, sensorDigitalIn)
#pragma config(Sensor, dgtl4, rightSensor, sensorDigitalIn)
#pragma config(Sensor, dgtl6, upperLimitSensor, sensorDigitalIn)
#pragma config(Sensor, dgtl7, lowerLimitSensor, sensorDigital... | 0 |
nuoen/LinuxLearn | 6f95ede | test8_2/test82.c | C | www.github.com/nuoen/LinuxLearn/tree/main/test8_2/test82.c | https://raw.githubusercontent.com/nuoen/LinuxLearn/6f95ede/test8_2/test82.c | nuoen/LinuxLearn 6f95ede test8_2/test82.c | true | 200 | 2,310 | #include <linux/init.h>
#include <linux/module.h>
#include <linux/kthread.h>
#include <linux/delay.h>
static int debug =1;
module_param(debug,int,0644);
MODULE_PARM_DESC(debug,"enable debugging information");
#define dprintk(args...) \
if(debug){ \
printk(KERN_DEBUG args);\
}
static int mytest =100;
module_param(... | 4 |
Milhouse20/apc1 | eacf636 | praticas/pratica2/questao06.c | C | www.github.com/Milhouse20/apc1/tree/main/praticas/pratica2/questao06.c | https://raw.githubusercontent.com/Milhouse20/apc1/eacf636/praticas/pratica2/questao06.c | Milhouse20/apc1 eacf636 praticas/pratica2/questao06.c | true | 200 | 808 | /* 6. Faça um programa em C que leia o valor de compra, o ano de fabricação e o ano de depreciação e calcule o valor depreciado de um veículo (depreciação = (ano de depreciação - ano de fabricação) x 0,01 x valor de compra). */
#include <stdio.h>
int main() {
float valor_de_compra;
int ano_de_fabricacao;
int a... | 5 |
Adetops/_simpleshell | eea2cbc | err_inputs.c | C | www.github.com/Adetops/_simpleshell/tree/main/err_inputs.c | https://raw.githubusercontent.com/Adetops/_simpleshell/eea2cbc/err_inputs.c | Adetops/_simpleshell eea2cbc err_inputs.c | true | 200 | 2,459 | #include "shell.h"
/**
* err_atoi - converts a string to an integer
* @str: the string to convert
* Return: 0 if no string, converted number if there is, -1 on error
*/
int err_atoi(char *str)
{
unsigned long int res = 0;
int i = 0;
if (*str == '+')
str++; /* TODO: why does this make main return 255? */
for... | 0 |
xinove1/push_swap | d1b0f7a | src/operations2.c | C | www.github.com/xinove1/push_swap/tree/main/src/operations2.c | https://raw.githubusercontent.com/xinove1/push_swap/d1b0f7a/src/operations2.c | xinove1/push_swap d1b0f7a src/operations2.c | true | 200 | 1,935 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* operations2.c :+: :+: :+: ... | 4 |
abdalhalem-alfakhrany/alx-low_level_programming | 020f552 | 0x0A-argc_argv/2-args.c | C | www.github.com/abdalhalem-alfakhrany/alx-low_level_programming/tree/main/0x0A-argc_argv/2-args.c | https://raw.githubusercontent.com/abdalhalem-alfakhrany/alx-low_level_programming/020f552/0x0A-argc_argv/2-args.c | abdalhalem-alfakhrany/alx-low_level_programming 020f552 0x0A-argc_argv/2-args.c | true | 200 | 244 | #include "stdio.h"
/**
* main - Entry point
* @argc: argument count
* @argv: argument vector
* Return: Always (0) Succses
*/
int main(int argc, char **argv)
{
int i;
for (i = 0; i < argc; i++)
printf("%s\n", argv[i]);
return (0);
}
| 5 |
fabeklou/alx-low_level_programming | d8a1903 | 0x12-singly_linked_lists/100-first.c | C | www.github.com/fabeklou/alx-low_level_programming/tree/main/0x12-singly_linked_lists/100-first.c | https://raw.githubusercontent.com/fabeklou/alx-low_level_programming/d8a1903/0x12-singly_linked_lists/100-first.c | fabeklou/alx-low_level_programming d8a1903 0x12-singly_linked_lists/100-first.c | true | 200 | 262 | #include <stdio.h>
/**
* before_main - execute a few lines of code before the main function
*
* Return: nothing
*/
void __attribute__ ((constructor)) before_main()
{
printf("You're beat! and yet, you must allow,\n"
"I bore my house upon my back!\n");
}
| 0 |
stivemok/binary_trees | cb2db3c | 1-binary_tree_insert_left.c | C | www.github.com/stivemok/binary_trees/tree/main/1-binary_tree_insert_left.c | https://raw.githubusercontent.com/stivemok/binary_trees/cb2db3c/1-binary_tree_insert_left.c | stivemok/binary_trees cb2db3c 1-binary_tree_insert_left.c | true | 200 | 595 | #include "binary_trees.h"
/**
* binary_tree_insert_left - Inserts a node as the left child
* @parent: a pointer to the node to insert the left-child in
* @value: the value to store in the new node
* Return: pointer to the created node, or NULL on failure or if parent is NULL
*/
binary_tree_t *binary_tree_insert_l... | 4 |
25sp-351/05-memofib-dannyphantomSS | ed7bea5 | fib_func.c | C | www.github.com/25sp-351/05-memofib-dannyphantomSS/tree/main/fib_func.c | https://raw.githubusercontent.com/25sp-351/05-memofib-dannyphantomSS/ed7bea5/fib_func.c | 25sp-351/05-memofib-dannyphantomSS ed7bea5 fib_func.c | true | 200 | 612 | #include "fib.h"
long long memo[MAX_FIB] = {0};
/*
* fibonacci - Computes Fibonacci sequence using memoization.
* @index: Fibonacci index (must be between 0 and MAX_FIB).
*
* Return: Fibonacci number at index, or -1 if index is out of bounds.
*/
long long fibonacci(int index) {
if (index < 0) {
retur... | 5 |
ryanfantus/clans-src | dabefa6 | reg.c | C | www.github.com/ryanfantus/clans-src/tree/main/reg.c | https://raw.githubusercontent.com/ryanfantus/clans-src/dabefa6/reg.c | ryanfantus/clans-src dabefa6 reg.c | true | 200 | 11,076 | /*
The Clans BBS Door Game
Copyright (C) 1997-2002 Allen Ussher
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
This program ... | 0 |
tim61114/c-shell | 39bde8a | shell.c | C | www.github.com/tim61114/c-shell/tree/main/shell.c | https://raw.githubusercontent.com/tim61114/c-shell/39bde8a/shell.c | tim61114/c-shell 39bde8a shell.c | true | 200 | 8,656 | #include <fcntl.h>
#include <pwd.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/param.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <unistd.h>
#include "history.h"
#include "elist.h"
#include "logger.h"
#include "ui.h"
struct cmd_struct {
struct elist*... | 4 |
Sriram-Krishnamurthi/RockPaperScissor | 817f201 | miniproject.c | C | www.github.com/Sriram-Krishnamurthi/RockPaperScissor/tree/main/miniproject.c | https://raw.githubusercontent.com/Sriram-Krishnamurthi/RockPaperScissor/817f201/miniproject.c | Sriram-Krishnamurthi/RockPaperScissor 817f201 miniproject.c | true | 200 | 1,804 | #include<stdio.h>
#include<stdlib.h>
#include<time.h>
void rps(int x, int y);
void rps2(int x, int y);
void main()
{
char password[10], username[10], ch;
int i;
printf("Enter User name: ");
gets(username);
printf("Enter the password < any 8 characters>: ");
for (i = 0; i < 8; i++)
{
... | 5 |
RastyFullStaxx/C-Programming | 5dbaf5e | Practice Exercises/Count Vowels and Consonants.c | C | www.github.com/RastyFullStaxx/C-Programming/tree/main/Practice Exercises/Count Vowels and Consonants.c | https://raw.githubusercontent.com/RastyFullStaxx/C-Programming/5dbaf5e/Practice%20Exercises/Count%20Vowels%20and%20Consonants.c | RastyFullStaxx/C-Programming 5dbaf5e Practice Exercises/Count Vowels and Consonants.c | true | 200 | 561 | #include <stdio.h>
#include <ctype.h>
int main() {
char sentence[1000];
int vowels = 0, consonants = 0;
printf("Enter a sentence: ");
gets(sentence);
for (int i = 0; sentence[i] != '\0'; i++) {
char ch = tolower(sentence[i]);
if (ch >= 'a' && ch <= 'z') {
if (c... | 0 |
DragonYH/STM32_Cmake_Project | 5a096e8 | CP_Single_Phase_Rectifier_H743IIT6_Hollies_Provincial/Core/Src/freertos.c | C | www.github.com/DragonYH/STM32_Cmake_Project/tree/main/CP_Single_Phase_Rectifier_H743IIT6_Hollies_Provincial/Core/Src/freertos.c | https://raw.githubusercontent.com/DragonYH/STM32_Cmake_Project/5a096e8/CP_Single_Phase_Rectifier_H743IIT6_Hollies_Provincial/Core/Src/freertos.c | DragonYH/STM32_Cmake_Project 5a096e8 CP_Single_Phase_Rectifier_H743IIT6_Hollies_Provincial/Core/Src/freertos.c | true | 200 | 7,417 | /* USER CODE BEGIN Header */
/**
******************************************************************************
* File Name : freertos.c
* Description : Code for freertos applications
******************************************************************************
* @attention
*
* Copyright (c) 202... | 7 |
KetAveryH/lab-4-hmc-e155 | 2923f9c | lib/STM32L432KC_TIM.c | C | www.github.com/KetAveryH/lab-4-hmc-e155/tree/main/lib/STM32L432KC_TIM.c | https://raw.githubusercontent.com/KetAveryH/lab-4-hmc-e155/2923f9c/lib/STM32L432KC_TIM.c | KetAveryH/lab-4-hmc-e155 2923f9c lib/STM32L432KC_TIM.c | true | 200 | 7,125 | #include "STM32L432KC_TIM.h"
#include <stdint.h>
void initTIM6() {
/*
To read out the UIF (update interrupt flag), which turns itself on and stays on whenever
the timer overflows, you access TIM6_SR[0]. This is 0 if no recent overflow, or 1 if there
has been an overflow since the last time this bit wa... | 4 |
deryaxacar/42-Minishell | f0b237a | minishell/expander.c | C | www.github.com/deryaxacar/42-Minishell/tree/main/minishell/expander.c | https://raw.githubusercontent.com/deryaxacar/42-Minishell/f0b237a/minishell/expander.c | deryaxacar/42-Minishell f0b237a minishell/expander.c | true | 200 | 3,417 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* expander.c :+: :+: :+: ... | 2 |
Jaewonkim11/alx-low_level_programming | aac5633 | 0x09-static_libraries/2-strncpy.c | C | www.github.com/Jaewonkim11/alx-low_level_programming/tree/main/0x09-static_libraries/2-strncpy.c | https://raw.githubusercontent.com/Jaewonkim11/alx-low_level_programming/aac5633/0x09-static_libraries/2-strncpy.c | Jaewonkim11/alx-low_level_programming aac5633 0x09-static_libraries/2-strncpy.c | true | 200 | 447 | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include "main.h"
/**
* _strncpy - Copy a string
* @dest: The destination value
* @src: The source value
* @n: The copy limit
*
* Return: char value
*/
char *_strncpy(char *dest, char *src, int n)
{
int a = 0, b = 0;
while (src[b])
{
b++;
... | 5 |
Stevovenom/sorting_algorithms | 3b3ce11 | 0-bubble_sort.c | C | www.github.com/Stevovenom/sorting_algorithms/tree/main/0-bubble_sort.c | https://raw.githubusercontent.com/Stevovenom/sorting_algorithms/3b3ce11/0-bubble_sort.c | Stevovenom/sorting_algorithms 3b3ce11 0-bubble_sort.c | true | 200 | 548 | #include "sort.h"
/**
* bubble_sort - function arranges the arrays in ascending using bubble sort
* @array: the pointer to the arrays to be sorted
* @size: The size of the array to be sorted
* Return: null or void
*/
void bubble_sort(int *array, size_t size)
{
size_t i, j;
int temp;
if (size < 2)
return;
... | 0 |
CassiusBlackX/HUST-CS-DataStructure-homework | eec3e74 | 源程序/4/8_DeleteVex.h | C | www.github.com/CassiusBlackX/HUST-CS-DataStructure-homework/tree/main/源程序/4/8_DeleteVex.h | https://raw.githubusercontent.com/CassiusBlackX/HUST-CS-DataStructure-homework/eec3e74/%E6%BA%90%E7%A8%8B%E5%BA%8F/4/8_DeleteVex.h | CassiusBlackX/HUST-CS-DataStructure-homework eec3e74 源程序/4/8_DeleteVex.h | true | 200 | 2,080 | ///*
// * 删弧分为两种类型
// * 第一种是从要删除的顶点v开始删除，这种弧度特别好删除，指着v删除就可以了
// * 另一种是从图的其它点里面找到v然后删除相关的弧，这种时候再调用deletearc函数就可以了（？）
// */
status DeleteVex(ALGraph &G, KeyType v) {
int i, j;
// 查找顶点v在顶点数组中的位置
for (i = 0; i < G.vexnum; i++) {
if (G.vertices[i].data.key == v)
break;
}
if(G.arcnum... | 7 |
DM2525/raspiSpacon2 | 36ed5a9 | pi_montecalro.c | C | www.github.com/DM2525/raspiSpacon2/tree/main/pi_montecalro.c | https://raw.githubusercontent.com/DM2525/raspiSpacon2/36ed5a9/pi_montecalro.c | DM2525/raspiSpacon2 36ed5a9 pi_montecalro.c | true | 200 | 1,465 | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <mpi.h>
int main(int argc, char **argv) {
int rank, size;
int local_count = 0;
int global_count = 0;
double x, y;
// MPIの初期化
MPI_Init(&argc, &argv);
MPI_Comm_rank(MPI_COMM_WORLD, &rank); // プロセスのランクを取得
MPI_Comm_size(MPI... | 4 |
Aditir06/Program-Exercise-2 | 4cda842 | 26_.c | C | www.github.com/Aditir06/Program-Exercise-2/tree/main/26_.c | https://raw.githubusercontent.com/Aditir06/Program-Exercise-2/4cda842/26_.c | Aditir06/Program-Exercise-2 4cda842 26_.c | true | 200 | 266 | #include<stdio.h>
int main()
{
int i,j,rows;
printf("enter the number of rows:");
scanf("%d",&rows);
for(i=1; i<=rows; ++i){
for(j=1; j<=i; ++j){
printf("* ");
}
printf("\n");
}
return 0;
}
| 2 |
Misalethien/baitap | cc6309b | nv3/Src/main.c | C | www.github.com/Misalethien/baitap/tree/main/nv3/Src/main.c | https://raw.githubusercontent.com/Misalethien/baitap/cc6309b/nv3/Src/main.c | Misalethien/baitap cc6309b nv3/Src/main.c | true | 200 | 18,023 | /*******************************************************************************
*
* Description: Assignment1
* Project name: TS_CURTAIN_MCU_V1.0.0
*
*
* Last Changed By: $Author: TrungNT $
* Revision: $Revision: 1.0 $
* Last Changed: $Date: 9/12/2021 $
*
*******************************... | 5 |
EduardoRoquete/pratica1-TC-C | 6a3edd0 | questoes/Pratica3.C | C | www.github.com/EduardoRoquete/pratica1-TC-C/tree/main/questoes/Pratica3.C | https://raw.githubusercontent.com/EduardoRoquete/pratica1-TC-C/6a3edd0/questoes/Pratica3.C | EduardoRoquete/pratica1-TC-C 6a3edd0 questoes/Pratica3.C | true | 200 | 525 | #include <stdio.h>//Questão 3
int main() {
float cotacaoDolar, valorDolar, valorReal;
// Solicita ao usuário que insira a cotação do dólar
printf("Digite a cotação do dólar em reais: ");
scanf("%f", &cotacaoDolar);
// Solicita ao usuário que insira o valor em dólares
printf("Digite o valor em... | 3 |
Njiraini23/learning_tests | 1b1777a | sum.c | C | www.github.com/Njiraini23/learning_tests/tree/main/sum.c | https://raw.githubusercontent.com/Njiraini23/learning_tests/1b1777a/sum.c | Njiraini23/learning_tests 1b1777a sum.c | true | 200 | 226 | #include <stdio.h>
#include <stdlib.h>
int main(int argc, char *argv[])
{
int sum = 0;
if (argc < 3)
{
printf("Error\n");
return 1;
}
sum = atoi(argv[1]) +atoi(argv[2]);
printf("The sum is %d\n",sum);
return 0;
}
| 6 |
brysonwaisi/alx-low_level_programming | 0fa5397 | 0x01-variables_if_else_while/101-print_comb4.c | C | www.github.com/brysonwaisi/alx-low_level_programming/tree/main/0x01-variables_if_else_while/101-print_comb4.c | https://raw.githubusercontent.com/brysonwaisi/alx-low_level_programming/0fa5397/0x01-variables_if_else_while/101-print_comb4.c | brysonwaisi/alx-low_level_programming 0fa5397 0x01-variables_if_else_while/101-print_comb4.c | true | 200 | 509 | #include <stdio.h>
#include <stdlib.h>
/**
* main - Entry point
* Description: prints all possible different combinations of three digits
* Return:0
*/
int main(void)
{
int a, b, c;
for (a = 0; a < 8; a++)
{
for (b = a + 1; b < 9; b++)
{
for (c = b + 1; c < 10; c++)
{
putchar((a % 10) + '0');
... | 0 |
EskindirH/alx-low_level_programming | 347cbbe | 0x12-singly_linked_lists/100-first.c | C | www.github.com/EskindirH/alx-low_level_programming/tree/main/0x12-singly_linked_lists/100-first.c | https://raw.githubusercontent.com/EskindirH/alx-low_level_programming/347cbbe/0x12-singly_linked_lists/100-first.c | EskindirH/alx-low_level_programming 347cbbe 0x12-singly_linked_lists/100-first.c | true | 200 | 225 | #include <stdio.h>
/**
* ctor - function executed before main.
* Return: void
*/
void __attribute__((constructor)) ctor()
{
printf("You're beat! and yet, you must allow,");
printf("\nI bore my house upon my back!\n");
}
| 4 |
SeunAkanji/alx-low_level_programming | e0ff9bb | 0x07-pointers_arrays_strings/_putchar.c | C | www.github.com/SeunAkanji/alx-low_level_programming/tree/main/0x07-pointers_arrays_strings/_putchar.c | https://raw.githubusercontent.com/SeunAkanji/alx-low_level_programming/e0ff9bb/0x07-pointers_arrays_strings/_putchar.c | SeunAkanji/alx-low_level_programming e0ff9bb 0x07-pointers_arrays_strings/_putchar.c | true | 200 | 233 | #include <unistd.h>
/**
*
* _putchar - writes c to stdout
* @c: The character to print
*
* Return: On success 1
* On error, -1 is returned and errno is set appropriately
*/
int _putchar(char c)
{
return (write(1, &c, 1));
}
| 1 |
jayudoye/alx-low_level_programming | f3d4154 | 0x02-functions_nested_loops/3-islower.c | C | www.github.com/jayudoye/alx-low_level_programming/tree/main/0x02-functions_nested_loops/3-islower.c | https://raw.githubusercontent.com/jayudoye/alx-low_level_programming/f3d4154/0x02-functions_nested_loops/3-islower.c | jayudoye/alx-low_level_programming f3d4154 0x02-functions_nested_loops/3-islower.c | true | 200 | 255 | #include "main.h"
/**
* _islower - Function to print lower case alphabets
*
* @c: parameter to be printed
*
* Return: 1 if it is lower case
* 0 if it is not
*
*/
int _islower(int c)
{
if (c >= 97 && c <= 122)
return (1);
else
return (0);
}
| 7 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.