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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
moonshot7/alx-low_level_programming | fc79407 | 0x06-pointers_arrays_strings/1-strncat.c | C | www.github.com/moonshot7/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/1-strncat.c | https://raw.githubusercontent.com/moonshot7/alx-low_level_programming/fc79407/0x06-pointers_arrays_strings/1-strncat.c | moonshot7/alx-low_level_programming fc79407 0x06-pointers_arrays_strings/1-strncat.c | true | 200 | 483 | #include "main.h"
/**
* * _strncat - the main function
* *
* * @n: Function parameter
* *
* * @src: Function parameter
* *
* * @dest: Function parammeter
* *
* * Return: dest
*/
char *_strncat(char *dest, char *src, in... | 4 |
GraffJoco/MSZO-IPA-2024 | 536a3a1 | gyakorlo feladatok/feladat5.c | C | www.github.com/GraffJoco/MSZO-IPA-2024/tree/main/gyakorlo feladatok/feladat5.c | https://raw.githubusercontent.com/GraffJoco/MSZO-IPA-2024/536a3a1/gyakorlo%20feladatok/feladat5.c | GraffJoco/MSZO-IPA-2024 536a3a1 gyakorlo feladatok/feladat5.c | true | 200 | 2,501 | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <math.h>
// a) komplex szám struktúra létrehozása
struct komplex {
double re, im;
};
// függvények
struct komplex k_osszead(struct komplex k1, struct komplex k2) {
struct komplex k; // összeg változója
k.re = k1.re + k2.re;
k.im = k1.i... | 6 |
Creisoss/C-codes | e592e12 | Caesar-cipher/CaesarCrack.c | C | www.github.com/Creisoss/C-codes/tree/main/Caesar-cipher/CaesarCrack.c | https://raw.githubusercontent.com/Creisoss/C-codes/e592e12/Caesar-cipher/CaesarCrack.c | Creisoss/C-codes e592e12 Caesar-cipher/CaesarCrack.c | true | 200 | 1,771 | #include <stdio.h>
int main(){
void readFile();
readFile();
return 0;
}
//decrypt char by char the string
char decrypt(char msg, int dir)
{
char lower[]="abcdefghijklmnopqrstuvwxyz";
char upper[]="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
char letter;
int pointer = 0;
int place = 0;
if(msg >= 'A' && msg <= 'Z'){
for(i... | 7 |
Mansithakur2001/c-programming- | d2ffb07 | 4.c | C | www.github.com/Mansithakur2001/c-programming-/tree/main/4.c | https://raw.githubusercontent.com/Mansithakur2001/c-programming-/d2ffb07/4.c | Mansithakur2001/c-programming- d2ffb07 4.c | true | 200 | 275 | #include<stdio.h>
int main()
{
int a;
printf("Enter the value");
scanf("%d",&a);
if (a%5==0 && a%11==0)
{
printf("%d is divisible ny 5 and 11",a);
}
else
{
printf("%d is not divisible by 5 and 11",a);
}
return 0;
} | 5 |
kiber11/c-tilidagi-dastlabki-kodlarim | 7273cb5 | 2-oy/10-uy ishi/8.c | C | www.github.com/kiber11/c-tilidagi-dastlabki-kodlarim/tree/main/2-oy/10-uy ishi/8.c | https://raw.githubusercontent.com/kiber11/c-tilidagi-dastlabki-kodlarim/7273cb5/2-oy/10-uy%20ishi/8.c | kiber11/c-tilidagi-dastlabki-kodlarim 7273cb5 2-oy/10-uy ishi/8.c | true | 200 | 379 | #include<stdio.h>
#include<stdlib.h>
int main(){
int a,n; printf("a indeksi:"); scanf("%d",&a);
printf("n ta element:"); scanf("%d",&n);
int A[100],B[n];
srand(time(NULL));
for(int i=0;i<n;i++){
A[i]=rand()%100;
B[i]=A[i];
printf("B[%d]=%d\n",i,B[i]);
}
for(int i=0;i<n;i++){
if(i==a){
... | 2 |
sahar-hamdy/employees-profile-management-system-using-C-t | c685106 | upper and lower with ascii/main.c | C | www.github.com/sahar-hamdy/employees-profile-management-system-using-C-t/tree/main/upper and lower with ascii/main.c | https://raw.githubusercontent.com/sahar-hamdy/employees-profile-management-system-using-C-t/c685106/upper%20and%20lower%20with%20ascii/main.c | sahar-hamdy/employees-profile-management-system-using-C-t c685106 upper and lower with ascii/main.c | true | 200 | 872 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
char text[10];
int i;
char choice;
puts("enter your text");
gets(text);
printf("\n a- upper case \n");
printf("\n b- lower case \n");
choice=getch();
switch(choice)
{
//convert to upper case
cas... | 4 |
unwogidi/alx-low_level_programming | 57b8881 | 0x0F-function_pointers/100-main_opcodes.c | C | www.github.com/unwogidi/alx-low_level_programming/tree/main/0x0F-function_pointers/100-main_opcodes.c | https://raw.githubusercontent.com/unwogidi/alx-low_level_programming/57b8881/0x0F-function_pointers/100-main_opcodes.c | unwogidi/alx-low_level_programming 57b8881 0x0F-function_pointers/100-main_opcodes.c | true | 200 | 590 | #include <stdio.h>
#include <stdlib.h>
/**
* main - prints the opcodes of its own main function
* @argc: number of arguments passed to program
* @argv: array of arguments
* Return: 0 Success, 1 0r 2 on error
*/
int main(int argc, char *argv[])
{
int bytes, i;
char *addr;
if (argc != 2)
{
printf("Error\n");... | 6 |
frederic42paris/push_swap | 5876770 | sort_large_lib.c | C | www.github.com/frederic42paris/push_swap/tree/main/sort_large_lib.c | https://raw.githubusercontent.com/frederic42paris/push_swap/5876770/sort_large_lib.c | frederic42paris/push_swap 5876770 sort_large_lib.c | true | 200 | 1,923 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* sort_large_lib.c :+: :+: :+: ... | 7 |
Ram-eez/DSA-C | 0b6d76d | queue/main.c | C | www.github.com/Ram-eez/DSA-C/tree/main/queue/main.c | https://raw.githubusercontent.com/Ram-eez/DSA-C/0b6d76d/queue/main.c | Ram-eez/DSA-C 0b6d76d queue/main.c | true | 200 | 1,031 | #include <stdio.h>
#include <stdlib.h>
struct node
{
int data;
struct node *next;
}*front = NULL, *rear = NULL;
void LLtraversal(struct node *ptr)
{
while (ptr != NULL)
{
printf("Element : %d \n", ptr->data);
ptr = ptr->next;
}
}
void Enqueue(int value)
{
s... | 5 |
CarlitoJuarez/so_long | e583448 | utils/flood_fill.c | C | www.github.com/CarlitoJuarez/so_long/tree/main/utils/flood_fill.c | https://raw.githubusercontent.com/CarlitoJuarez/so_long/e583448/utils/flood_fill.c | CarlitoJuarez/so_long e583448 utils/flood_fill.c | true | 200 | 2,985 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* flood_fill.c :+: :+: :+: ... | 2 |
vandenbroele/adventofcode-2023 | 45b0fa5 | day 21/levimigom - C/part1.c | C | www.github.com/vandenbroele/adventofcode-2023/tree/main/day 21/levimigom - C/part1.c | https://raw.githubusercontent.com/vandenbroele/adventofcode-2023/45b0fa5/day%2021/levimigom%20-%20C/part1.c | vandenbroele/adventofcode-2023 45b0fa5 day 21/levimigom - C/part1.c | true | 200 | 3,726 | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdbool.h>
#define STEPS 64
#define START_PLOT 'S'
#define GARDEN_PLOT '.'
#define ROCK_PLOT '#'
#define DIRECTIONS 4
int row_directions[] = { 0, 0, 1, -1 };
int col_directions[] = { 1, -1, 0, 0 };
char *read_line(){
int c, size, capacity;
char *l... | 4 |
Gerold103/leetcode | e896470 | 0006-zigzag-conversion/main1.c | C | www.github.com/Gerold103/leetcode/tree/main/0006-zigzag-conversion/main1.c | https://raw.githubusercontent.com/Gerold103/leetcode/e896470/0006-zigzag-conversion/main1.c | Gerold103/leetcode e896470 0006-zigzag-conversion/main1.c | true | 200 | 1,225 | #include <stdlib.h>
#include <stdio.h>
#include <assert.h>
#include <string.h>
char *
convert(const char *s, int row_count)
{
assert(row_count >= 1);
if (row_count == 1)
return strdup(s);
int len = strlen(s);
char *res = malloc(len + 1);
res[len] = 0;
char *out = res;
/* First row. */
int row_count_1 = row... | 6 |
parthishere/UEFI-drivers | f60bc87 | SimpleShellApp/SimpleShellApp.c | C | www.github.com/parthishere/UEFI-drivers/tree/main/SimpleShellApp/SimpleShellApp.c | https://raw.githubusercontent.com/parthishere/UEFI-drivers/f60bc87/SimpleShellApp/SimpleShellApp.c | parthishere/UEFI-drivers f60bc87 SimpleShellApp/SimpleShellApp.c | true | 200 | 374 | [Defines]
INF_VERSION = 0x00010006
BASE_NAME = SimpleShellApp
FILE_GUID = 35c3ac36-4d6f-45c6-a3f9-d89ec1a02995
MODULE_TYPE = UEFI_APPLICATION
VERSION_STRING = 1.0
ENTRY_POINT = ShellCEntryLib
[Sources]
SimpleShellApp.c
[Packages]
MdeP... | 7 |
nikhilsaraswat2605/Networks-Lab-CS39202 | e260096 | Assgn_3/server.c | C | www.github.com/nikhilsaraswat2605/Networks-Lab-CS39202/tree/main/Assgn_3/server.c | https://raw.githubusercontent.com/nikhilsaraswat2605/Networks-Lab-CS39202/e260096/Assgn_3/server.c | nikhilsaraswat2605/Networks-Lab-CS39202 e260096 Assgn_3/server.c | true | 200 | 4,206 | #include <stdio.h>
#include <string.h>
#include <time.h>
#include <stdlib.h>
#include <sys/socket.h>
#include <arpa/inet.h>
#include <poll.h>
#include <unistd.h>
#define IP "127.0.0.1"
#define CHUNK_SIZE 10
// function to send the output to the client in packets
void send_output(int sock, char *output)
... | 5 |
rjkat/advent-2022 | a47a345 | advent-2022-day06.c | C | www.github.com/rjkat/advent-2022/tree/main/advent-2022-day06.c | https://raw.githubusercontent.com/rjkat/advent-2022/a47a345/advent-2022-day06.c | rjkat/advent-2022 a47a345 advent-2022-day06.c | true | 200 | 714 | #include <stdio.h>
#define HISTORY_LEN 14
int main() {
char history[HISTORY_LEN];
char ch;
char n = 0;
int i = 0;
char started = 0;
char found = 0;
while ((ch = getchar()) != -1) {
if (i >= HISTORY_LEN) {
started = 1;
}
if (started) {
char unique = 1;
char m;
c... | 4 |
mathieurobert1/MyTeams | 3a2b14e | server/src/commands/create/create_team.c | C | www.github.com/mathieurobert1/MyTeams/tree/main/server/src/commands/create/create_team.c | https://raw.githubusercontent.com/mathieurobert1/MyTeams/3a2b14e/server/src/commands/create/create_team.c | mathieurobert1/MyTeams 3a2b14e server/src/commands/create/create_team.c | true | 200 | 2,843 | /*
** EPITECH PROJECT, 2024
** MyTeams
** File description:
** create Teams
*/
#include "types.h"
#include "protocol.h"
#include "utils.h"
#include "lists.h"
#include "commands.h"
#include "logging_server.h"
#include <unistd.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
char *int_to_char(int nb)
{
... | 2 |
jeete121/Coding | 9e73934 | Programs/Practice/Prac/GraphAlgorithms/remove_space_in_string.c | C | www.github.com/jeete121/Coding/tree/main/Programs/Practice/Prac/GraphAlgorithms/remove_space_in_string.c | https://raw.githubusercontent.com/jeete121/Coding/9e73934/Programs/Practice/Prac/GraphAlgorithms/remove_space_in_string.c | jeete121/Coding 9e73934 Programs/Practice/Prac/GraphAlgorithms/remove_space_in_string.c | true | 200 | 437 | #include <stdio.h>
int main()
{
char str[] = "Hello World";
int n = sizeof(str) / sizeof(str[0]);
int l = 0;
for (int i = 0; i < n; i++)
{
if (str[i] == ' ')
{
continue;
}
else
{
str[l] = str[i];
l++;
}
}
p... | 6 |
Arijitttt/competitive-programming | 0a0be78 | for_AMI/armstrong_number_prac.c | C | www.github.com/Arijitttt/competitive-programming/tree/main/for_AMI/armstrong_number_prac.c | https://raw.githubusercontent.com/Arijitttt/competitive-programming/0a0be78/for_AMI/armstrong_number_prac.c | Arijitttt/competitive-programming 0a0be78 for_AMI/armstrong_number_prac.c | true | 200 | 359 | #include <stdio.h>
#include <math.h>
int armstrong_number(int num){
int d,t,s=0,i,p;
p = num;
while(num>0){
d = d+1;
num = num /10;
}
num =p;
while(num>0){
t = num %10;
s = s+pow(t,d);
num=num/10;
}
return s;
}
int main(){
int n = 153;
int res = armstrong_number(n);
if(n==res){
printf("yes");
}
... | 7 |
ChrismalyEscarfuller/Bizcocho- | a959281 | tareavol2/cap3.3/main.c | C | www.github.com/ChrismalyEscarfuller/Bizcocho-/tree/main/tareavol2/cap3.3/main.c | https://raw.githubusercontent.com/ChrismalyEscarfuller/Bizcocho-/a959281/tareavol2/cap3.3/main.c | ChrismalyEscarfuller/Bizcocho- a959281 tareavol2/cap3.3/main.c | true | 200 | 1,297 | #include <stdio.h>
#include <stdlib.h>//Se incluye la biblioteca est�ndar stdlib.h para utilizar funciones como scanf y printf.
void main(void)//Se declara la funci�n main como void, lo que significa que no devuelve un valor.
{
float PAG, SPA;//e declaran las variables PAG y SPA como flotantes (float).
S... | 5 |
ShenoudaMikhael/simple_shell | 51e88c1 | _strcpy.c | C | www.github.com/ShenoudaMikhael/simple_shell/tree/main/_strcpy.c | https://raw.githubusercontent.com/ShenoudaMikhael/simple_shell/51e88c1/_strcpy.c | ShenoudaMikhael/simple_shell 51e88c1 _strcpy.c | true | 200 | 286 | #include "main.h"
#include <stdio.h>
/**
* *_strcpy - copystring
* @dest: to copy to
* @src: source vlaue
* Return: dest
*/
char *_strcpy(char *dest, char *src)
{
int i;
i = 0;
while (src[i] != '\0')
{
*(dest + i) = *(src + i);
i++;
}
dest[i] = '\0';
return (dest);
}
| 4 |
Kachizih/alx-low_level_programming | 14133f9 | 0x0C-more_malloc_free/100-realloc.c | C | www.github.com/Kachizih/alx-low_level_programming/tree/main/0x0C-more_malloc_free/100-realloc.c | https://raw.githubusercontent.com/Kachizih/alx-low_level_programming/14133f9/0x0C-more_malloc_free/100-realloc.c | Kachizih/alx-low_level_programming 14133f9 0x0C-more_malloc_free/100-realloc.c | true | 200 | 865 | #include "main.h"
#include <stdlib.h>
/**
* _realloc - A function that reallocates a memory block using malloc and free
* @ptr: points to the memory previously allocated
* @old_size: old size allocated (byts)
* @new_size: new size allocated (byts)
* Return: void pointer to new memory location
*/
void *_realloc(... | 2 |
CSG-HDR/miniRT | a286071 | src/ft/cstring/ft_cstring_strnlen.c | C | www.github.com/CSG-HDR/miniRT/tree/main/src/ft/cstring/ft_cstring_strnlen.c | https://raw.githubusercontent.com/CSG-HDR/miniRT/a286071/src/ft/cstring/ft_cstring_strnlen.c | CSG-HDR/miniRT a286071 src/ft/cstring/ft_cstring_strnlen.c | true | 200 | 1,593 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* fake_file_name (file name is useless too) :+: :+: :+: ... | 6 |
Parth-G27/Algorithms-Lab | 7cf91f9 | Program4/merge_sort.c | C | www.github.com/Parth-G27/Algorithms-Lab/tree/main/Program4/merge_sort.c | https://raw.githubusercontent.com/Parth-G27/Algorithms-Lab/7cf91f9/Program4/merge_sort.c | Parth-G27/Algorithms-Lab 7cf91f9 Program4/merge_sort.c | true | 200 | 1,435 | #include <stdio.h>
#include <stdlib.h>
#include<time.h>
void merge(int arr[], int l, int m, int r)
{
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
// Create temp arrays
int* L = (int*)malloc(n1*sizeof(int));
int* R = (int*)malloc(n2*sizeof(int));
// int R[n2];
// Copy data to temp arr... | 7 |
mendy-tech/alx-low_level_programming | 4922406 | 0x12-singly_linked_lists/4-free_list.c | C | www.github.com/mendy-tech/alx-low_level_programming/tree/main/0x12-singly_linked_lists/4-free_list.c | https://raw.githubusercontent.com/mendy-tech/alx-low_level_programming/4922406/0x12-singly_linked_lists/4-free_list.c | mendy-tech/alx-low_level_programming 4922406 0x12-singly_linked_lists/4-free_list.c | true | 200 | 278 | #include "lists.h"
/**
* free_list - frees a list from memory
* @head: head of the linked list.
* Return: no return.
*/
void free_list(list_t *head)
{
list_t *present;
while ((present = head) != NULL)
{
head = head->next;
free(present->str);
free(present);
}
}
| 5 |
YoussefELALAMI/Plantagon | f8cac95 | capteur/temperature/WiringPi/WiringPi/wiringPi/test/wiringpi_i2c_test1_pcf8574.c | C | www.github.com/YoussefELALAMI/Plantagon/tree/main/capteur/temperature/WiringPi/WiringPi/wiringPi/test/wiringpi_i2c_test1_pcf8574.c | https://raw.githubusercontent.com/YoussefELALAMI/Plantagon/f8cac95/capteur/temperature/WiringPi/WiringPi/wiringPi/test/wiringpi_i2c_test1_pcf8574.c | YoussefELALAMI/Plantagon f8cac95 capteur/temperature/WiringPi/WiringPi/wiringPi/test/wiringpi_i2c_test1_pcf8574.c | true | 200 | 2,936 | // WiringPi test program: I2C functions (need PCF8574)
// Compile: gcc -Wall wiringpi_i2c_test1.c -o wiringpi_i2c_test1 -lwiringPi
#include "wpi_test.h"
#include "pcf8574.h"
#include "wiringPiI2C.h"
const int pinBase = 1020;
const int i2cAdress = 0x20;
int ShowAll() {
int in;
int value = 0;
printf("pin: 0 1... | 4 |
pdpdds/sdldualsystem | d0261ee | sdl1/theclue/present/present.c | C | www.github.com/pdpdds/sdldualsystem/tree/main/sdl1/theclue/present/present.c | https://raw.githubusercontent.com/pdpdds/sdldualsystem/d0261ee/sdl1/theclue/present/present.c | pdpdds/sdldualsystem d0261ee sdl1/theclue/present/present.c | true | 200 | 6,613 | /* _________ _______
/ ___/ __ \/ __/ _ \ Der Clou!
/ /__/ /_/ /\ \/ ___/ Open Source Project
\___/\____/___/_/ http://cosp.sourceforge.net
Based on the original by neo Software GmbH
*/
#include "present\present.h"
#include "present\present_p.h"
#include "present\presenta.h"
struct PresentControl Pres... | 2 |
srilakshmi2006/C-program | 04a08ad | hollow square.c | C | www.github.com/srilakshmi2006/C-program/tree/main/hollow square.c | https://raw.githubusercontent.com/srilakshmi2006/C-program/04a08ad/hollow%20square.c | srilakshmi2006/C-program 04a08ad hollow square.c | true | 200 | 735 | #include <stdio.h>
int main() {
int rows, i, j;
// Set the number of rows for the hollow square
rows = 5; // You can change this value as needed
for (i = 1; i <= rows; ++i) {
// Print asterisks for the first and last rows
if (i == 1 || i == rows) {
for (j = 1; ... | 5 |
biswajit862002/C_Practical_Assignment_for_MCA_1st_Sem | 13e6599 | Q1.c | C | www.github.com/biswajit862002/C_Practical_Assignment_for_MCA_1st_Sem/tree/main/Q1.c | https://raw.githubusercontent.com/biswajit862002/C_Practical_Assignment_for_MCA_1st_Sem/13e6599/Q1.c | biswajit862002/C_Practical_Assignment_for_MCA_1st_Sem 13e6599 Q1.c | true | 200 | 714 | // 1. Write a program to calculate simple and compound interest.
#include<stdio.h>
#include<math.h>
double simple_interest(double,double,double);
double compound_interest(double,double,double);
int main()
{
double p,r,t,si=0,ci=0;
printf("Enter Principal,Rate & Time : ");
scanf("%lf %lf %lf",&p,&r,&t);
... | 6 |
zbostock56/3DChess | 0bdde45 | src/frontend.c | C | www.github.com/zbostock56/3DChess/tree/main/src/frontend.c | https://raw.githubusercontent.com/zbostock56/3DChess/0bdde45/src/frontend.c | zbostock56/3DChess 0bdde45 src/frontend.c | true | 200 | 28,762 | #include <frontend.h>
// GRAPHICS MECHANICS
vec3 col_point = { 0.0, 0.0, 0.0 };
int enable_gravity;
vec3 cam_front = { -0.72, -0.68, 0.0 };
// {forward/back, up/down, left/right}
vec3 cam_pos = { 1.3, 2.35, -1.0 };
vec3 cam_up = { 0.0, 1.0, 0.0 };
float pitch = -45.0;
float yaw = -180.0;
int firstMouse = 1;
float de... | 3 |
Edward-163/MyC | 0cca0a7 | src/study_strcat.c | C | www.github.com/Edward-163/MyC/tree/main/src/study_strcat.c | https://raw.githubusercontent.com/Edward-163/MyC/0cca0a7/src/study_strcat.c | Edward-163/MyC 0cca0a7 src/study_strcat.c | true | 200 | 1,259 | #include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <ctype.h>
#include <stdbool.h>
#include "securec.h"
/*
*/
int main()
{
// @formatter:off
char dest[20]="abc\0efg\0";
char src[]="hij";
strcat(dest,src);
printf("%s \n",dest);fflush(stdout); // abchij
/**
... | 7 |
2855749222/Linux- | a91d45b | Snake/fun/show_font.c | C | www.github.com/2855749222/Linux-/tree/main/Snake/fun/show_font.c | https://raw.githubusercontent.com/2855749222/Linux-/a91d45b/Snake/fun/show_font.c | 2855749222/Linux- a91d45b Snake/fun/show_font.c | true | 200 | 5,896 | #include "../include/font.h"
// // lcd设备结构体
// struct LcdDevice
// {
// int fd;
// unsigned int *mp; // 保存映射首地址
// };
// 1.初始化字库
// font *fontLoad(char *fontPath);
// //2.设置字体的大小
// void fontSetSize(font *f, s32 pixels);
// //3.设置字体输出框的大小
// bitmap *createBitmap(u32 width, u32 height, u32 byteperpixel);
// //可以... | 4 |
mhingan/pcl_h_s1_utcn | bfd2081 | lab6/pb7.c | C | www.github.com/mhingan/pcl_h_s1_utcn/tree/main/lab6/pb7.c | https://raw.githubusercontent.com/mhingan/pcl_h_s1_utcn/bfd2081/lab6/pb7.c | mhingan/pcl_h_s1_utcn bfd2081 lab6/pb7.c | true | 200 | 501 | //Program care afiseaza divizorii unui numar
#include <stdio.h>
int main() {
int numar;
printf("Introduceti un numar: ");
scanf("%d", &numar);
printf("Divizorii numarului sunt: ", numar);
for (int i = 1; i <= numar; i++) {
if (numar % i == 0) {
printf("%d ", i);
}
... | 2 |
WiccaCrow/soLong | 2e94e8c | project/soLong/graphics/graphics_1_render.c | C | www.github.com/WiccaCrow/soLong/tree/main/project/soLong/graphics/graphics_1_render.c | https://raw.githubusercontent.com/WiccaCrow/soLong/2e94e8c/project/soLong/graphics/graphics_1_render.c | WiccaCrow/soLong 2e94e8c project/soLong/graphics/graphics_1_render.c | true | 200 | 4,235 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* graphics_1_render.c :+: :+: :+: ... | 6 |
AadarshS9/Operating-Systems | 3375520 | Exp7 - Pipes/pipes.c | C | www.github.com/AadarshS9/Operating-Systems/tree/main/Exp7 - Pipes/pipes.c | https://raw.githubusercontent.com/AadarshS9/Operating-Systems/3375520/Exp7%20-%20Pipes/pipes.c | AadarshS9/Operating-Systems 3375520 Exp7 - Pipes/pipes.c | true | 200 | 409 | #include<stdio.h>
#include<sys/types.h>
#include<sys/wait.h>
#include<unistd.h>
int main()
{
int fd[2],n;
char buffer[100],as[100];
pid_t p;
pipe(fd);
p=fork();
if(p>0)
{
printf("Parent pass value to child\n");
printf("Enter Data: ");
fgets(as,100,stdin);
write(fd[1],as,100);
//wait(NULL);
}
re... | 3 |
Tesh2714/alx-low_level_programming | 926ee9f | 0x0F-function_pointers/0-print_name.c | C | www.github.com/Tesh2714/alx-low_level_programming/tree/main/0x0F-function_pointers/0-print_name.c | https://raw.githubusercontent.com/Tesh2714/alx-low_level_programming/926ee9f/0x0F-function_pointers/0-print_name.c | Tesh2714/alx-low_level_programming 926ee9f 0x0F-function_pointers/0-print_name.c | true | 200 | 302 | #include <stddef.h>
#ifndef FUN_POINTER
#include "function_pointers.h"
#endif
/**
* print_name - print a name using pointer function
* @name: the name to print
* @f: the function to call to print the name
*
*/
void print_name(char *name, void (*f)(char *))
{
if (f == NULL)
return;
f(name);
}
| 7 |
henriquesebastiao/CS50x | 301d917 | semana_2/length.c | C | www.github.com/henriquesebastiao/CS50x/tree/main/semana_2/length.c | https://raw.githubusercontent.com/henriquesebastiao/CS50x/301d917/semana_2/length.c | henriquesebastiao/CS50x 301d917 semana_2/length.c | true | 200 | 246 | #include "cs50.h"
#include "stdio.h"
int main(void) {
string name = get_string("Qual é seu nome? ");
int index = 0;
while (name[index] != '\0') {
index += 1;
}
printf("O tamanho do nome %s é: %i", name, index);
} | 4 |
Julian-Hwang/Operating-System | 81f8883 | Operating System/shell.c | C | www.github.com/Julian-Hwang/Operating-System/tree/main/Operating System/shell.c | https://raw.githubusercontent.com/Julian-Hwang/Operating-System/81f8883/Operating%20System/shell.c | Julian-Hwang/Operating-System 81f8883 Operating System/shell.c | true | 200 | 584 | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/wait.h>
#include <sys/types.h>
#include <string.h>
#define MAX 64
void* get_next_command(char buf[]);
int main(int argc, char* argv[])
{
char buf[MAX];
while (get_next_command(buf)) {
int child_pid = fork();
if (child_pid < 0) {
perror("... | 2 |
mohamedwalidghlwash/alx-low_level_programming | 73fb01a | 0x04-more_functions_nested_loops/0-isupper.c | C | www.github.com/mohamedwalidghlwash/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/0-isupper.c | https://raw.githubusercontent.com/mohamedwalidghlwash/alx-low_level_programming/73fb01a/0x04-more_functions_nested_loops/0-isupper.c | mohamedwalidghlwash/alx-low_level_programming 73fb01a 0x04-more_functions_nested_loops/0-isupper.c | true | 200 | 220 | include "main.h"
/**
* _isupper - check if a letter is upper
* @x: the number to be checked
* Return: 1 for upper letter or 0 for any else
*/
int _isupper(int x)
{
if (x >= 65 && <= 90)
{
return(1);
}
return(0);
}
| 5 |
makwalam/alx-low_level_programming | fa614e2 | 0x05-pointers_arrays_strings/0-reset_to_98.c | C | www.github.com/makwalam/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/0-reset_to_98.c | https://raw.githubusercontent.com/makwalam/alx-low_level_programming/fa614e2/0x05-pointers_arrays_strings/0-reset_to_98.c | makwalam/alx-low_level_programming fa614e2 0x05-pointers_arrays_strings/0-reset_to_98.c | true | 200 | 205 | #include "main.h"
/**
* reset_to_98 - function that takes a pointer to an int as parameter
* and updated the value it points to 98
* @n: input
* Return: void
*/
void reset_to_98(int *n)
{
*n = 98;
}
| 6 |
ghizlanemalyana/Philo | 3fe42c5 | philo/init.c | C | www.github.com/ghizlanemalyana/Philo/tree/main/philo/init.c | https://raw.githubusercontent.com/ghizlanemalyana/Philo/3fe42c5/philo/init.c | ghizlanemalyana/Philo 3fe42c5 philo/init.c | true | 200 | 2,696 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* init.c :+: :+: :+: ... | 3 |
ifpb-disciplinas-2022-1/controle-algoritmos-repeticao | 08f876f | respostas/1113.c | C | www.github.com/ifpb-disciplinas-2022-1/controle-algoritmos-repeticao/tree/main/respostas/1113.c | https://raw.githubusercontent.com/ifpb-disciplinas-2022-1/controle-algoritmos-repeticao/08f876f/respostas/1113.c | ifpb-disciplinas-2022-1/controle-algoritmos-repeticao 08f876f respostas/1113.c | true | 200 | 786 | /*
Leia uma quantidade indeterminada de duplas de valores inteiros X e Y.
Escreva para cada X e Y uma mensagem que indique se estes valores foram digitados em ordem crescente
ou decrescente.
Entrada
A entrada contém vários casos de teste. Cada caso contém dois valores inteiros X e Y.
A leitura deve ser encerrada ao ... | 7 |
Cypherock/starknetPOC | 6816869 | x1_wallet_firmware/apps/btc_family/btc/btc_app.c | C | www.github.com/Cypherock/starknetPOC/tree/main/x1_wallet_firmware/apps/btc_family/btc/btc_app.c | https://raw.githubusercontent.com/Cypherock/starknetPOC/6816869/x1_wallet_firmware/apps/btc_family/btc/btc_app.c | Cypherock/starknetPOC 6816869 x1_wallet_firmware/apps/btc_family/btc/btc_app.c | true | 200 | 6,241 | /**
* @file btc_app.c
* @author Cypherock X1 Team
* @brief Bitcoin app configuration
* @copyright Copyright (c) 2023 HODL TECH PTE LTD
* <br/> You may obtain a copy of license at <a href="https://mitcc.org/"
*target=_blank>https://mitcc.org/</a>
*
**********************************************************... | 4 |
pickles976/SDLForth | 1465448 | string_array.c | C | www.github.com/pickles976/SDLForth/tree/main/string_array.c | https://raw.githubusercontent.com/pickles976/SDLForth/1465448/string_array.c | pickles976/SDLForth 1465448 string_array.c | true | 200 | 1,231 | #include "string_array.h"
StringArray *new_string_array(size_t capacity) {
StringArray *array = malloc(sizeof(StringArray));
array->count = 0;
array->capacity = capacity;
array->tokens = malloc(sizeof(char*) * capacity);
}
StringArray *get_subarray(StringArray* array, int begin, int end) {
int new... | 2 |
Darsana-Ramesh/OperatingSystem-NetworkProgramming | 5e04f7c | 01.systemCalls/stat.c | C | www.github.com/Darsana-Ramesh/OperatingSystem-NetworkProgramming/tree/main/01.systemCalls/stat.c | https://raw.githubusercontent.com/Darsana-Ramesh/OperatingSystem-NetworkProgramming/5e04f7c/01.systemCalls/stat.c | Darsana-Ramesh/OperatingSystem-NetworkProgramming 5e04f7c 01.systemCalls/stat.c | true | 200 | 315 | #include <stdio.h>
#include <unistd.h>
#include<sys/stat.h>
void main()
{
struct stat buf;
stat("./waits.c",&buf);
printf("size of the file is %ld\n",buf.st_size);
}
/*
darsana@user-HP-280-G3-MT:~/Desktop/OSLab$ gcc stat.c
darsana@user-HP-280-G3-MT:~/Desktop/OSLab$ ./a.out
Total size of the file is 776
*/
| 0 |
christopherfifo/Faculdade-Estrutura-de-dados | de17f9e | aula9/exemplos/exemplo_my-lib/exemplo1.c | C | www.github.com/christopherfifo/Faculdade-Estrutura-de-dados/tree/main/aula9/exemplos/exemplo_my-lib/exemplo1.c | https://raw.githubusercontent.com/christopherfifo/Faculdade-Estrutura-de-dados/de17f9e/aula9/exemplos/exemplo_my-lib/exemplo1.c | christopherfifo/Faculdade-Estrutura-de-dados de17f9e aula9/exemplos/exemplo_my-lib/exemplo1.c | true | 200 | 493 | #include <stdio.h>
#include <stdlib.h>
#include "my_lib.h" // Inclusão da biblioteca criada
int main() {
int n;
printf("Entre com um numero inteiro: ");
scanf("%d", &n);
printf("Versao iterativa:\n");
funcao_iterativa(n); // Chamada da função iterativa
printf("\n\n");
printf("Versao rec... | 1 |
mghio/unpv13e-solutions | 72c3ad4 | example_programs/bcast_dgclibcast6.c | C | www.github.com/mghio/unpv13e-solutions/tree/main/example_programs/bcast_dgclibcast6.c | https://raw.githubusercontent.com/mghio/unpv13e-solutions/72c3ad4/example_programs/bcast_dgclibcast6.c | mghio/unpv13e-solutions 72c3ad4 example_programs/bcast_dgclibcast6.c | true | 200 | 1,705 | #include <unp.h>
static void recvfrom_alarm(int);
static int pipefd[2];
void dg_cli(FILE *fp, int sockfd, const SA *pservaddr, socklen_t servlen)
{
int n, maxfdp1;
const int on = 1;
char sendline[MAXLINE], recvline[MAXLINE + 1];
fd_set rset;
socklen_t len;
struct sockdaddr *reply_addr;
re... | 5 |
UltramicroscopicWIMP/alx-low_level_programming | b52608c | 0x0C-more_malloc_free/2-calloc.c | C | www.github.com/UltramicroscopicWIMP/alx-low_level_programming/tree/main/0x0C-more_malloc_free/2-calloc.c | https://raw.githubusercontent.com/UltramicroscopicWIMP/alx-low_level_programming/b52608c/0x0C-more_malloc_free/2-calloc.c | UltramicroscopicWIMP/alx-low_level_programming b52608c 0x0C-more_malloc_free/2-calloc.c | true | 200 | 527 | #include "main.h"
#include <stdlib.h>
/**
*_calloc - allocates memory for an array using malloc
*@nmemb: unsigned int. number of array elements
*@size: unsigned int. size of array in bytes
*
*Return: pointer to void. Returns a pointer to the allocated memory
*/
void *_calloc(unsigned int nmemb, unsigned int size)
{
v... | 6 |
faseehfawaz/CS50x-2024 | a4a673b | recover/recover.c | C | www.github.com/faseehfawaz/CS50x-2024/tree/main/recover/recover.c | https://raw.githubusercontent.com/faseehfawaz/CS50x-2024/a4a673b/recover/recover.c | faseehfawaz/CS50x-2024 a4a673b recover/recover.c | true | 200 | 1,419 | #include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
const int BLOCK_SIZE = 512;
int main(int argc, char *argv[])
{
if (argc != 2)
{
printf("Usage: ./recover filename.raw\n");
return 1;
}
FILE *file = fopen(argv[1], "r");
if (file == NULL)
{
printf("Could not o... | 7 |
meutraa/project-euler-c | 2ba6725 | problem29.c | C | www.github.com/meutraa/project-euler-c/tree/main/problem29.c | https://raw.githubusercontent.com/meutraa/project-euler-c/2ba6725/problem29.c | meutraa/project-euler-c 2ba6725 problem29.c | true | 200 | 876 | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define min 2
#define max 100
const int n = max - min + 1;
int size = n*n;
int comp(const void * a, const void * b)
{
if( *(double*)a < *(double*)b) return -1;
if( *(double*)a == *(double*)b) return 0;
if( *(double*)a > *(double*)b) return 1;
r... | 3 |
SDmodding/PseudoSource | 8265198 | jenkins/workspace/wwise_2013.2/wwise/sdk/source/soundengine/akaudiolib/softwarepipeline/akvplpitchnode.h | C | www.github.com/SDmodding/PseudoSource/tree/main/jenkins/workspace/wwise_2013.2/wwise/sdk/source/soundengine/akaudiolib/softwarepipeline/akvplpitchnode.h | https://raw.githubusercontent.com/SDmodding/PseudoSource/8265198/jenkins/workspace/wwise_2013.2/wwise/sdk/source/soundengine/akaudiolib/softwarepipeline/akvplpitchnode.h | SDmodding/PseudoSource 8265198 jenkins/workspace/wwise_2013.2/wwise/sdk/source/soundengine/akaudiolib/softwarepipeline/akvplpitchnode.h | true | 200 | 968 | // File Line: 31
// RVA: 0xA65070
void __fastcall CAkVPLPitchNode::CAkVPLPitchNode(CAkVPLPitchNode *this, CAkVPLSrcCbxNode *in_pCbx)
{
this->vfptr = (CAkVPLNodeVtbl *)&CAkVPLPitchNode::`vftable;
this->m_pInput = 0i64;
Assembly::GetRCX(&this->m_Pitch);
this->m_pCbx = in_pCbx;
this->m_pPBI = 0i64;
this->m_Buf... | 4 |
zebangeth/C_and_Cpp_Basics | d1b55fc | 041_reverse_str/reverse.c | C | www.github.com/zebangeth/C_and_Cpp_Basics/tree/main/041_reverse_str/reverse.c | https://raw.githubusercontent.com/zebangeth/C_and_Cpp_Basics/d1b55fc/041_reverse_str/reverse.c | zebangeth/C_and_Cpp_Basics d1b55fc 041_reverse_str/reverse.c | true | 200 | 853 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
void reverse(char * str) {
//WRITE ME!
if (str == NULL) {
return;
}
int n = strlen(str);
int left = 0, right = n - 1;
while (left < right) {
char temp = str[left];
str[left] = str[right];
str[right] = temp;
left ++;
r... | 2 |
awe76/algorithms | b990c49 | c/primes.c | C | www.github.com/awe76/algorithms/tree/main/c/primes.c | https://raw.githubusercontent.com/awe76/algorithms/b990c49/c/primes.c | awe76/algorithms b990c49 c/primes.c | true | 200 | 636 | #include <stdio.h>
void primes_step(int n, int m, int res[], int max) {
if (m < max) {
int i = 0;
while (n % res[i++] != 0 && i < m) {}
if (i < m) {
primes_step(n + 2, m, res, max);
} else {
res[m] = n;
primes_step(n + 2, m + 1, res, max);
... | 0 |
sifat26/Random-C-Programming-Practise | 3d231bc | UVa/UVa10055.c | C | www.github.com/sifat26/Random-C-Programming-Practise/tree/main/UVa/UVa10055.c | https://raw.githubusercontent.com/sifat26/Random-C-Programming-Practise/3d231bc/UVa/UVa10055.c | sifat26/Random-C-Programming-Practise 3d231bc UVa/UVa10055.c | true | 200 | 240 | #include<stdio.h>
int main()
{
long long a,b,s;
while(scanf("%lld%lld",&a,&b)!=EOF)
{
if(a==b)
s=0;
else if(b>a)
s=b-a;
else if(a>b)
s=a-b;
printf("%lld\n",s);
}
return 0;
}
| 6 |
obadoraibu/csa-task-2 | 34abf7b | c-source/main.c | C | www.github.com/obadoraibu/csa-task-2/tree/main/c-source/main.c | https://raw.githubusercontent.com/obadoraibu/csa-task-2/34abf7b/c-source/main.c | obadoraibu/csa-task-2 34abf7b c-source/main.c | true | 200 | 794 | #include <stdio.h>
#include <stdlib.h>
extern char* logic(char* str, int N1, int N2);
int main(int argc, char *argv[]) {
int N1, N2;
char str[256];
if (argc == 3) {
FILE *input = fopen(argv[1], "r");
if (input == NULL) {
printf("Error");
return 0;
}... | 5 |
ZelenovVV/Home_C | d19398c | HW8/taskE7.c | C | www.github.com/ZelenovVV/Home_C/tree/main/HW8/taskE7.c | https://raw.githubusercontent.com/ZelenovVV/Home_C/d19398c/HW8/taskE7.c | ZelenovVV/Home_C d19398c HW8/taskE7.c | true | 200 | 777 | #include <stdio.h>
int Input(int arr[], int n)
{
int i;
for (i = 0; i < n; i++ )
{
scanf("%d", &arr[i]);
}
return i;
}
void PrintArr(int arr[],int n)
{
for (int i = 0; i < n; i++)
{
printf("%d ", arr[i]);
}
}
void swap(int arr[], int size) {
for (int i = 0; ... | 1 |
johnkonstantin/Bootloader | 6609f93 | FATFS/Target/user_diskio.c | C | www.github.com/johnkonstantin/Bootloader/tree/main/FATFS/Target/user_diskio.c | https://raw.githubusercontent.com/johnkonstantin/Bootloader/6609f93/FATFS/Target/user_diskio.c | johnkonstantin/Bootloader 6609f93 FATFS/Target/user_diskio.c | true | 200 | 6,139 | /* USER CODE BEGIN Header */
/**
******************************************************************************
* @file user_diskio.c
* @brief This file includes a diskio driver skeleton to be completed by the user.
******************************************************************************
* @attentio... | 3 |
Kodai-study/IC_Checker.X | a8f65c2 | 3reg.c | C | www.github.com/Kodai-study/IC_Checker.X/tree/main/3reg.c | https://raw.githubusercontent.com/Kodai-study/IC_Checker.X/a8f65c2/3reg.c | Kodai-study/IC_Checker.X a8f65c2 3reg.c | true | 200 | 1,425 | /*
* File: 3reg.c
* Author: kouda
*
* Created on 2022/08/25, 21:24
*/
#define V_SOURCE LAT(B,1)
#define V_TRIS TRIS(B,1)
#define R_CHANGE LAT(A,2)
#define R_CH_TRIS TRIS(A,2)
#define CHECK_VOLT if(ADRESH <= 50 || ADRESH >= 200) {V_SOURCE = 0; R_CHANGE = 0; return NG; }
#include "datas.h"
void convert(int ... | 4 |
yididiabera/alx-low_level_programming | 21812df | 0x04-more_functions_nested_loops/10-print_triangle.c | C | www.github.com/yididiabera/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/10-print_triangle.c | https://raw.githubusercontent.com/yididiabera/alx-low_level_programming/21812df/0x04-more_functions_nested_loops/10-print_triangle.c | yididiabera/alx-low_level_programming 21812df 0x04-more_functions_nested_loops/10-print_triangle.c | true | 200 | 394 | #include "main.h"
/**
* print_triangle - prints a triangle
* @size: size of the triangle
* Return: void
*/
void print_triangle(int size)
{
int i, j, space;
if (size > 0)
{
for (i = 0; i < size; i++)
{
for (space = size - 1 - i; space > 0; space--)
{
_putchar(' ');
}
for (j = 0; j <= i; j++)
... | 0 |
zleihao/gcc_stm32 | 60a4c70 | Template/STM32F103/User/Src/main.c | C | www.github.com/zleihao/gcc_stm32/tree/main/Template/STM32F103/User/Src/main.c | https://raw.githubusercontent.com/zleihao/gcc_stm32/60a4c70/Template/STM32F103/User/Src/main.c | zleihao/gcc_stm32 60a4c70 Template/STM32F103/User/Src/main.c | true | 200 | 471 | /**
* @Date: 2022.3.16
* @Revision: V1.0
* @author: 点灯大师
* @Affiliated unit： 黄河科技学院
* @Description: 基于STM32F103的固件库工程模板
* @Email: im_leihao@163.com
* @github: https://github.com/zleihao
*/
#include "bsp_debug_usart.h"
int main... | 2 |
the1Riddle/printf | a5c22e3 | print_bin.c | C | www.github.com/the1Riddle/printf/tree/main/print_bin.c | https://raw.githubusercontent.com/the1Riddle/printf/a5c22e3/print_bin.c | the1Riddle/printf a5c22e3 print_bin.c | true | 200 | 326 | #include "main.h"
/**
* print_bin - function that prints the binary representation of a number
* @n: number to be printed in binary
* @prin: hold the number of characters printed
*/
void print_bin(unsigned int n, unsigned int *prin)
{
if (n > 1)
{
*prin += 1;
print_bin(n >> 1, prin);
}
_putchar((n & 1) + '0... | 1 |
Thegamerman50/RTR105 | e5d63ae | Programmesanas_uzd/40miljardi.c | C | www.github.com/Thegamerman50/RTR105/tree/main/Programmesanas_uzd/40miljardi.c | https://raw.githubusercontent.com/Thegamerman50/RTR105/e5d63ae/Programmesanas_uzd/40miljardi.c | Thegamerman50/RTR105 e5d63ae Programmesanas_uzd/40miljardi.c | true | 200 | 259 | #include <stdio.h>
int main (){
unsigned long long int a, b, result;
printf(" Lūdzu ievadi divus skaitļus! \n" );
scanf("%llu %llu" , &a , &b);
result = a * b ;
printf("Ievadīto skaitļu reizinājums = %llu \n ", result );
return 0;
}
| 5 |
FatemahKm/alx-low_level_programming | 7ae2bd6 | 0x02-functions_nested_loops/5-sign.c | C | www.github.com/FatemahKm/alx-low_level_programming/tree/main/0x02-functions_nested_loops/5-sign.c | https://raw.githubusercontent.com/FatemahKm/alx-low_level_programming/7ae2bd6/0x02-functions_nested_loops/5-sign.c | FatemahKm/alx-low_level_programming 7ae2bd6 0x02-functions_nested_loops/5-sign.c | true | 200 | 411 | #include "main.h"
/**
* print_sign - print + if n is greater than zero.
* 0 if n is zero and - if n is less
* than zero.
*
* @n: takes integer type input for function.
*
* Return: 1 if +. 0 if 0 and -1 if -
*/
int print_sign(int n)
{
if (n > 0)
{
_putchar(43);
return (1);
}
els... | 6 |
cbdeboef/CprE424 | 38e5dfe | CFuncs/MontyHall.c | C | www.github.com/cbdeboef/CprE424/tree/main/CFuncs/MontyHall.c | https://raw.githubusercontent.com/cbdeboef/CprE424/38e5dfe/CFuncs/MontyHall.c | cbdeboef/CprE424 38e5dfe CFuncs/MontyHall.c | true | 200 | 1,026 | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
int main(){
srand( time(NULL) );
char options[3];
int prize = rand()%3;
int notPrize1 = (prize + 1)%3;
int notPrize2 = (prize + 2)%3;
int guess = 0;
char changeDoor = 0;
options[prize] = 1;
options[notPrize1] = 0;
options[notPrize2] = 0;
printf("\n... | 3 |
poe125/UCSC-CSE13S | 36b86e1 | asgn6/stack.c | C | www.github.com/poe125/UCSC-CSE13S/tree/main/asgn6/stack.c | https://raw.githubusercontent.com/poe125/UCSC-CSE13S/36b86e1/asgn6/stack.c | poe125/UCSC-CSE13S 36b86e1 asgn6/stack.c | true | 200 | 2,084 | #include "stack.h"
#include <stdio.h>
#include <stdbool.h>
#include <fcntl.h>
#include <unistd.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
typedef struct stack{
uint32_t *items;
uint32_t capacity;
uint32_t top;
} Stack;
Stack *stack_create(uint32_t capacity){
Stack *s = (Stack *) ma... | 4 |
renesas/ble-sdk10-da1470x-examples | 7b035c6 | features/vad_demo_lvgl/utilities/gdi/inc/nhd43480272efasxn.h | C | www.github.com/renesas/ble-sdk10-da1470x-examples/tree/main/features/vad_demo_lvgl/utilities/gdi/inc/nhd43480272efasxn.h | https://raw.githubusercontent.com/renesas/ble-sdk10-da1470x-examples/7b035c6/features/vad_demo_lvgl/utilities/gdi/inc/nhd43480272efasxn.h | renesas/ble-sdk10-da1470x-examples 7b035c6 features/vad_demo_lvgl/utilities/gdi/inc/nhd43480272efasxn.h | true | 200 | 7,091 | /**
****************************************************************************************
*
* @file nhd43480272efasxn.h
*
* @brief LCD configuration for NHD-4.3-480272EF-ASXN# LCD with IC ST7282T2
*
* Copyright (c) 2022 Dialog Semiconductor. All rights reserved.
*
* This software ("Software") is owned by Di... | 7 |
yuriccosta/Controle_estufa | 8e102cf | controle_estufa.c | C | www.github.com/yuriccosta/Controle_estufa/tree/main/controle_estufa.c | https://raw.githubusercontent.com/yuriccosta/Controle_estufa/8e102cf/controle_estufa.c | yuriccosta/Controle_estufa 8e102cf controle_estufa.c | true | 200 | 13,159 | #include <stdio.h>
#include "pico/stdlib.h"
#include "hardware/i2c.h"
#include "inc/ssd1306.h"
#include "inc/font.h"
#include <stdio.h>
#include <hardware/pio.h>
#include "hardware/clocks.h"
#include "hardware/gpio.h"
#include "hardware/pwm.h"
#include "hardware/adc.h"
#include "pico/bootrom.h"
#in... | 0 |
mohamadhoseinmarvi/Calculator-Eclipse-and-Proteus-Software-were-used.-AVR-GCC-Toolchain-was-used | 2cb53a4 | Display_MCU/HAL/KEYPAD/KEYPAD_program.c | C | www.github.com/mohamadhoseinmarvi/Calculator-Eclipse-and-Proteus-Software-were-used.-AVR-GCC-Toolchain-was-used/tree/main/Display_MCU/HAL/KEYPAD/KEYPAD_program.c | https://raw.githubusercontent.com/mohamadhoseinmarvi/Calculator-Eclipse-and-Proteus-Software-were-used.-AVR-GCC-Toolchain-was-used/2cb53a4/Display_MCU/HAL/KEYPAD/KEYPAD_program.c | mohamadhoseinmarvi/Calculator-Eclipse-and-Proteus-Software-were-used.-AVR-GCC-Toolchain-was-used 2cb53a4 Display_MCU/HAL/KEYPAD/KEYPAD_program.c | true | 200 | 1,180 |
#include "KEYPAD_interface.h"
#include "../../MCAL/DIO/DIO_interface.h"
#include "../../MCAL/TMR1/TMR1_interface.h"
const u8 Pressed_Key[4][4] = {
{'7','4','1','A'},
{'8','5','2','0'},
{'9','6','3','='},
{'/','x','-','+'},
};
STD_ERROR KEYPAD_INIT(void) {
STD_ERROR LOC_ERROR = OK;
DIO_SetPo... | 2 |
dholanamrata/C | 9d04e52 | c_work_home/6. looping/krishnamurti no.c | C | www.github.com/dholanamrata/C/tree/main/c_work_home/6. looping/krishnamurti no.c | https://raw.githubusercontent.com/dholanamrata/C/9d04e52/c_work_home/6.%20looping/krishnamurti%20no.c | dholanamrata/C 9d04e52 c_work_home/6. looping/krishnamurti no.c | true | 200 | 324 | #include<stdio.h>
main()
{
int n,cn,f=1,r,s=0;
printf("enter the value");
scanf("%d",&n);
cn=n;
while(n>0)
{
f=1;
r=n%10;
while(r>=1)
{
f=f*r;
r--;
}
s=s+f;
n=n/10;
}
if(s==cn)
{
printf("number is krishnamurthy number\n");
}
else
{
printf("number is not krishnamurthy number\n");
... | 6 |
Mathema2/alx-low_level_programming | 876831c | 0x04-more_functions_nested_loops/101-print_number.c | C | www.github.com/Mathema2/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/101-print_number.c | https://raw.githubusercontent.com/Mathema2/alx-low_level_programming/876831c/0x04-more_functions_nested_loops/101-print_number.c | Mathema2/alx-low_level_programming 876831c 0x04-more_functions_nested_loops/101-print_number.c | true | 200 | 357 | #include"main.h"
/**
* print_number - Prints an integer.
* @n: The integer to be printed.
*/
void print_number(int n)
{
unsigned int num = n;
/*first check if its negative*/
if (n < 0)
{
_putchar('-');
num = -num;
}
/*print the first few integers*/
if ((num / 10) > 0)
print_number(num / 10);
/*prints the last d... | 1 |
GKitavi/alx-low_level_programming | b11e46b | 0x05-pointers_arrays_strings/0-reset_to_98.c | C | www.github.com/GKitavi/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/0-reset_to_98.c | https://raw.githubusercontent.com/GKitavi/alx-low_level_programming/b11e46b/0x05-pointers_arrays_strings/0-reset_to_98.c | GKitavi/alx-low_level_programming b11e46b 0x05-pointers_arrays_strings/0-reset_to_98.c | true | 200 | 185 | #include "main.h"
/**
* reset_to_98 - Takes pointer to an int and updates the value to 98
* @n: int to be pointed
*
* Return: 0 (Always)
*/
void reset_to_98(int *n)
{
*n = 98;
}
| 3 |
nairbh/holbertonschool-low_level_programming | df76030 | structures_typedef/1-init_dog.c | C | www.github.com/nairbh/holbertonschool-low_level_programming/tree/main/structures_typedef/1-init_dog.c | https://raw.githubusercontent.com/nairbh/holbertonschool-low_level_programming/df76030/structures_typedef/1-init_dog.c | nairbh/holbertonschool-low_level_programming df76030 structures_typedef/1-init_dog.c | true | 200 | 277 | #include <stdio.h>
#include "dog.h"
/**
* init_dog - function
* @d: struct dog ptr
* @name: char ptr
* @age: float
* @owner: char ptr
*/
void init_dog(struct dog *d, char *name, float age, char *owner)
{
if (d)
{
d->name = name;
d->age = age;
d->owner = owner;
};
}
| 4 |
madhav-singla/Code-Radar-Solutions | 4fb5801 | Check Triangle Type@@6788dd63490637cfc44e1b97/code.c | C | www.github.com/madhav-singla/Code-Radar-Solutions/tree/main/Check Triangle Type@@6788dd63490637cfc44e1b97/code.c | https://raw.githubusercontent.com/madhav-singla/Code-Radar-Solutions/4fb5801/Check%20Triangle%20Type%40%406788dd63490637cfc44e1b97/code.c | madhav-singla/Code-Radar-Solutions 4fb5801 Check Triangle Type@@6788dd63490637cfc44e1b97/code.c | true | 200 | 441 | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a + b > c && a + c > b && b + c > a) {
if (a == b && b == c) {
printf("Equilateral ");
} else if (a == b || b == c || a == c) {
printf("Isosceles ");
} else {
... | 7 |
EOH0/testRepo | 6d6b4d9 | day4/file2.c | C | www.github.com/EOH0/testRepo/tree/main/day4/file2.c | https://raw.githubusercontent.com/EOH0/testRepo/6d6b4d9/day4/file2.c | EOH0/testRepo 6d6b4d9 day4/file2.c | true | 200 | 303 | #include <stdio.h>
int main() {
FILE* fp = fopen("out.txt", "r");
FILE* fp1 = fopen("out.txt", "w");
int n;
fscanf(fp, "%d", &n);
int temp;
fscanf(fp1, "%d", &temp);
for (int i = 0; i < n; i++) {
fscanf(fp, "%d", &temp);
fprintf(fp1, "%d ", temp);
}
} | 5 |
Rio6/bone | ef8c18d | test/parser.c | C | www.github.com/Rio6/bone/tree/main/test/parser.c | https://raw.githubusercontent.com/Rio6/bone/ef8c18d/test/parser.c | Rio6/bone ef8c18d test/parser.c | true | 200 | 530 | #include "lexer/lexer.h"
#include "parser/ast.h"
#include "parser/parser.h"
#include "utils/stream.h"
#include "utils/oop.h"
#include <stdio.h>
#define TEST_FILE "../idea.bone"
int main(void) {
FILE *file = fopen(TEST_FILE, "r");
if(!file) {
perror("error open file");
return 1;
}
Stream s... | 0 |
TPoe25/holbertonschool-low_level_programming | 7294269 | more_functions_nested_loops/9-fizz_buzz.c | C | www.github.com/TPoe25/holbertonschool-low_level_programming/tree/main/more_functions_nested_loops/9-fizz_buzz.c | https://raw.githubusercontent.com/TPoe25/holbertonschool-low_level_programming/7294269/more_functions_nested_loops/9-fizz_buzz.c | TPoe25/holbertonschool-low_level_programming 7294269 more_functions_nested_loops/9-fizz_buzz.c | true | 200 | 540 | #include "main.h"
/**
* main - entry point
* fizbuzz - code that is used to test coders
* number: interger
* Return: 0
*/
int main(void)
{
int number;
for (number = 1; number < 101; number++)
{
if (number % 3 == 0 && number % 5 == 0)
{
printf("Fizzbuzz ");
}
else if ((number % 3) == 0)
{
pri... | 2 |
andrewokes/alx-low_level_programming | 48c8f7b | 0x13-more_singly_linked_lists/10-delete_nodeint.c | C | www.github.com/andrewokes/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/10-delete_nodeint.c | https://raw.githubusercontent.com/andrewokes/alx-low_level_programming/48c8f7b/0x13-more_singly_linked_lists/10-delete_nodeint.c | andrewokes/alx-low_level_programming 48c8f7b 0x13-more_singly_linked_lists/10-delete_nodeint.c | true | 200 | 738 | #include "lists.h"
/**
* delete_nodeint_at_index - a function that deletes the node,
* at index index of a listint_t linked list.
* @head: A pointer to the first element in the list
* @index: An index of the node to delete
*
* Return: 1 (Success), or -1 (Fail)
*/
int delete_nodeint_at_index(listint_t **head, unsigned ... | 6 |
IchiiDev/my_lib | f13487d | lib/printf/src/str/padding.c | C | www.github.com/IchiiDev/my_lib/tree/main/lib/printf/src/str/padding.c | https://raw.githubusercontent.com/IchiiDev/my_lib/f13487d/lib/printf/src/str/padding.c | IchiiDev/my_lib f13487d lib/printf/src/str/padding.c | true | 200 | 659 | /*
** EPITECH PROJECT, 2022
** my_printf
** File description:
** padding
*/
#include "my_string.h"
#include "internal/str.h"
void add_padding(l_string *string, int size, char pad_char, int right)
{
int pad_size = (size - string->length);
if (pad_size <= 0)
return;
l_string *pad_string = l_string... | 3 |
Sacred106/alx-low_level_programming | c59f6fb | 0x01-variables_if_else_while/1-last_digit.c | C | www.github.com/Sacred106/alx-low_level_programming/tree/main/0x01-variables_if_else_while/1-last_digit.c | https://raw.githubusercontent.com/Sacred106/alx-low_level_programming/c59f6fb/0x01-variables_if_else_while/1-last_digit.c | Sacred106/alx-low_level_programming c59f6fb 0x01-variables_if_else_while/1-last_digit.c | true | 200 | 600 | #include <stdlib.h>
#include <time.h>
#include <stdio.h>
/**
* main - print if the number is postive, zero, or negative
*
* Description- using the main function
*
* this program prints "Programming is positive, zero, or negative
*
* Return: 0
*/
int main(void)
{
int n;
int l;
srand(time(0));
n = rand()... | 1 |
AlexDelei/TEST | 938a6f9 | strlen.c | C | www.github.com/AlexDelei/TEST/tree/main/strlen.c | https://raw.githubusercontent.com/AlexDelei/TEST/938a6f9/strlen.c | AlexDelei/TEST 938a6f9 strlen.c | true | 200 | 312 | #include "main.h"
/**
* _strlen - Sizes the length of a string
* @string: String to be sized
* Return: The length of the string
*/
size_t _strlen(const char *string)
{
const char *str = string;
if (str == NULL)
return 0;
while (*str)
str++;
return (size_t)(str - string);
} | 4 |
Mohit1baghel/C | f6dc493 | wprime.c | C | www.github.com/Mohit1baghel/C/tree/main/wprime.c | https://raw.githubusercontent.com/Mohit1baghel/C/f6dc493/wprime.c | Mohit1baghel/C f6dc493 wprime.c | true | 200 | 377 | // to check if a no. is prime or not:
#include<stdio.h>
int main()
{
int i,k=0;
printf("enter no: ");
scanf("%d",&i);
for(int j=2;j<i/2;j++)
{
if (i%j==0)
{
printf("%d is a composite no",i);
k+=1;
break;
}
... | 7 |
Hilina16/alx-low_level_programming | 6f4504e | 0x10-variadic_functions/0-sum_them_all.c | C | www.github.com/Hilina16/alx-low_level_programming/tree/main/0x10-variadic_functions/0-sum_them_all.c | https://raw.githubusercontent.com/Hilina16/alx-low_level_programming/6f4504e/0x10-variadic_functions/0-sum_them_all.c | Hilina16/alx-low_level_programming 6f4504e 0x10-variadic_functions/0-sum_them_all.c | true | 200 | 427 | #include "variadic_functions.h"
#include <stdio.h>
/**
* sum_them_all - returns the sum of all its parameters.
* @n: the numberof arguments to bepassed
* Return: the sum of all its parameters
*/
int sum_them_all(const unsigned int n, ...)
{
va_list args;
unsigned int x;
int sum;
if (n == 0)
return (0);
va_s... | 5 |
mhshitol/C_practice | 7c6cd24 | SE121/prob-3.c | C | www.github.com/mhshitol/C_practice/tree/main/SE121/prob-3.c | https://raw.githubusercontent.com/mhshitol/C_practice/7c6cd24/SE121/prob-3.c | mhshitol/C_practice 7c6cd24 SE121/prob-3.c | true | 200 | 212 | #include <stdio.h>
int main()
{
int i,j,rows;
printf("Input number of rows : ");
scanf("%d",&rows);
for(i=1;i<=rows;i++)
{
for(j=1;j<=i;j++)
printf("%d",j);
printf("\n");
}
return 0;
}
| 0 |
xknower/jdk21u-study | 2f6be85 | jdk.jpackage/linux/native/applauncher/LinuxPackage.c | C | www.github.com/xknower/jdk21u-study/tree/main/jdk.jpackage/linux/native/applauncher/LinuxPackage.c | https://raw.githubusercontent.com/xknower/jdk21u-study/2f6be85/jdk.jpackage/linux/native/applauncher/LinuxPackage.c | xknower/jdk21u-study 2f6be85 jdk.jpackage/linux/native/applauncher/LinuxPackage.c | true | 200 | 7,661 | #include <stdio.h>
#include <string.h>
#include <stddef.h>
#include <stdlib.h>
#include <errno.h>
#include <linux/limits.h>
#include <unistd.h>
#include <libgen.h>
#include "JvmLauncher.h"
#include "LinuxPackage.h"
static char* getModulePath(void) {
char modulePath[PATH_MAX] = { 0 };
ssize_t modulePathLen = 0... | 2 |
yg2334/data_structures-algorithms | 9a6d175 | data_structures/queue/simple queue/simple_queue_array_implementation.c | C | www.github.com/yg2334/data_structures-algorithms/tree/main/data_structures/queue/simple queue/simple_queue_array_implementation.c | https://raw.githubusercontent.com/yg2334/data_structures-algorithms/9a6d175/data_structures/queue/simple%20queue/simple_queue_array_implementation.c | yg2334/data_structures-algorithms 9a6d175 data_structures/queue/simple queue/simple_queue_array_implementation.c | true | 200 | 1,053 | // Array Implementation of Queue
#include <stdlib.h>
#include <stdio.h>
#define MAX 10
int queue[MAX];
int front = -1;
int rear = -1;
int isFull(){
if(rear == MAX-1){
return 1;
}
else{
return 0;
}
}
int isEmpty(){
if(front == -1 && rear == -1){
return 1;
}
else{
... | 4 |
Rukkizy/alx-low_level_programming | 18ce534 | 0x06-pointers_arrays_strings/1-strncat.c | C | www.github.com/Rukkizy/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/1-strncat.c | https://raw.githubusercontent.com/Rukkizy/alx-low_level_programming/18ce534/0x06-pointers_arrays_strings/1-strncat.c | Rukkizy/alx-low_level_programming 18ce534 0x06-pointers_arrays_strings/1-strncat.c | true | 200 | 386 | #include "main.h"
/**
* _strncat - joins two strings with n bytes
* @dest: copy to
* @src: copy from
* @n: number of char to be copied
* Return: dest
*/
char *_strncat(char *dest, char *src, int n)
{
int f;
int g;
f = 0;
while (dest[f] != '\0')
{
f++;
}
g = 0;
while (g < n && src[g] != '\0')
{
dest... | 3 |
FelipeSutter/Beecrowd | 834192b | 1177 - Cadastro de Disciplina 2.c | C | www.github.com/FelipeSutter/Beecrowd/tree/main/1177 - Cadastro de Disciplina 2.c | https://raw.githubusercontent.com/FelipeSutter/Beecrowd/834192b/1177%20-%20Cadastro%20de%20Disciplina%202.c | FelipeSutter/Beecrowd 834192b 1177 - Cadastro de Disciplina 2.c | true | 200 | 1,833 | #include<stdio.h>
#include<string.h>
#include <stdlib.h>
typedef struct{
int codigo, creditos, ano, semestre;
char nome[30], professor[30];
double nota1, nota2;
} Disciplina;
void ler(Disciplina *d)
{
scanf("%d%*c",&(*d).codigo);
scanf("%[^\n]%*c",(*d).nome);
scanf("%[^\... | 6 |
Mayuri-Chan/MTK_kernel_device_modules_6.6 | 3b31307 | drivers/misc/mediatek/include/leakage_table_v2/mtk_static_power_6853.h | C | www.github.com/Mayuri-Chan/MTK_kernel_device_modules_6.6/tree/main/drivers/misc/mediatek/include/leakage_table_v2/mtk_static_power_6853.h | https://raw.githubusercontent.com/Mayuri-Chan/MTK_kernel_device_modules_6.6/3b31307/drivers/misc/mediatek/include/leakage_table_v2/mtk_static_power_6853.h | Mayuri-Chan/MTK_kernel_device_modules_6.6 3b31307 drivers/misc/mediatek/include/leakage_table_v2/mtk_static_power_6853.h | true | 200 | 5,053 | /* SPDX-License-Identifier: GPL-2.0+ */
/*
* Copyright (c) 2019 MediaTek Inc.
*/
#ifndef __MTK_STATIC_POWER_MTK6853_H__
#define __MTK_STATIC_POWER_MTK6853_H__
/* #define SPOWER_NOT_READY 1 */
/* #define WITHOUT_LKG_EFUSE */
#define PRECISE_NODE
/* mv, "Leakage domain" */
#define V_OF_FUSE_CPU 900 /* BCPU/LCPU/M... | 1 |
PRIEST099/alx-low_level_programming | fed94da | 0x12-singly_linked_lists/4-free_list.c | C | www.github.com/PRIEST099/alx-low_level_programming/tree/main/0x12-singly_linked_lists/4-free_list.c | https://raw.githubusercontent.com/PRIEST099/alx-low_level_programming/fed94da/0x12-singly_linked_lists/4-free_list.c | PRIEST099/alx-low_level_programming fed94da 0x12-singly_linked_lists/4-free_list.c | true | 200 | 280 | #include <stdlib.h>
#include "lists.h"
/**
* free_list - frees a singly linked list
* @head: head of the list
* Return: null
*/
void free_list(list_t *head)
{
list_t *temp;
while (head != NULL)
{
temp = head;
head = head->next;
free(temp->str);
free(temp);
}
}
| 5 |
redaoui97/pipex | 1347306 | bonus/src/parsing_bonus.c | C | www.github.com/redaoui97/pipex/tree/main/bonus/src/parsing_bonus.c | https://raw.githubusercontent.com/redaoui97/pipex/1347306/bonus/src/parsing_bonus.c | redaoui97/pipex 1347306 bonus/src/parsing_bonus.c | true | 200 | 1,739 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* parsing_bonus.c :+: :+: :+: ... | 0 |
boutferdout20/alx-low_level_programming | ef5b787 | 0x0C-more_malloc_free/101-mul.c | C | www.github.com/boutferdout20/alx-low_level_programming/tree/main/0x0C-more_malloc_free/101-mul.c | https://raw.githubusercontent.com/boutferdout20/alx-low_level_programming/ef5b787/0x0C-more_malloc_free/101-mul.c | boutferdout20/alx-low_level_programming ef5b787 0x0C-more_malloc_free/101-mul.c | true | 200 | 1,413 | #include "main.h"
#include <stdlib.h>
#include <stdio.h>
/**
* is_digit - checking the countains
* @s: ligne pour evaluer
* Return: 0 or 1
*/
int is_digit(char *s)
{
int a = 0;
while (s[a])
{
if (s[a] < '0' || s[a] > '9')
return (0);
a++;
}
return (1);
}
/**
* _strlen - reteurn a l'incrementation
* @s: ligne eval... | 2 |
gCorrect/C-From-Theory-to-Practice-G.Tselikis-N.Tselikas | 4b3bcbf | Chapter10/A.10.14/main.c | C | www.github.com/gCorrect/C-From-Theory-to-Practice-G.Tselikis-N.Tselikas/tree/main/Chapter10/A.10.14/main.c | https://raw.githubusercontent.com/gCorrect/C-From-Theory-to-Practice-G.Tselikis-N.Tselikas/4b3bcbf/Chapter10/A.10.14/main.c | gCorrect/C-From-Theory-to-Practice-G.Tselikis-N.Tselikas 4b3bcbf Chapter10/A.10.14/main.c | true | 200 | 1,079 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
char ch,a[100],b[100];/*douleyei me to paradeigma tou bibliou kai me
alla paradeigmata.alla an grapseis some something some kai some.8a bgalei arloumpes*/
int i=0,j,k,lena,lenb,found,end=0;
gets(a);
lena=strlen(a);
gets(b);... | 4 |
akabrunao/Maratona-de-programacao | 02ce7d7 | Aula 5 - Busca Binária/SushiForTwo.c | C | www.github.com/akabrunao/Maratona-de-programacao/tree/main/Aula 5 - Busca Binária/SushiForTwo.c | https://raw.githubusercontent.com/akabrunao/Maratona-de-programacao/02ce7d7/Aula%205%20-%20Busca%20Bin%C3%A1ria/SushiForTwo.c | akabrunao/Maratona-de-programacao 02ce7d7 Aula 5 - Busca Binária/SushiForTwo.c | true | 200 | 1,167 | #include <stdio.h>
int min(int a, int b) {
return a < b ? a : b;
}
int main() {
int n;
scanf("%d", &n);
int sushi[n];
for (int i = 0; i < n; i++) {
scanf("%d", &sushi[i]);
}
if (n == 0) {
printf("0\n");
return 0;
}
int max_length = 0;
int prev_count =... | 6 |
nifadyev/os-labs | 210e26a | lab5(Shared memory in UNix)/server.c | C | www.github.com/nifadyev/os-labs/tree/main/lab5(Shared memory in UNix)/server.c | https://raw.githubusercontent.com/nifadyev/os-labs/210e26a/lab5%28Shared%20memory%20in%20UNix%29/server.c | nifadyev/os-labs 210e26a lab5(Shared memory in UNix)/server.c | true | 200 | 1,926 | #include <sys/types.h>
#include <sys/ipc.h>
#include <sys/shm.h>
#include <stdio.h>
#include <errno.h>
#include <stdlib.h>
int main()
{
const int sharedMemorySize = 4096;
int sharedMemoryDescriptor;
char filename[] = "server.c";
key_t serverKey;
int i = 0, previousSize = 0;
char* pSharedMemory;... | 1 |
JehoOgbo/alx-low_level_programming | 1567a51 | 0x01-variables_if_else_while/100-print_comb3.c | C | www.github.com/JehoOgbo/alx-low_level_programming/tree/main/0x01-variables_if_else_while/100-print_comb3.c | https://raw.githubusercontent.com/JehoOgbo/alx-low_level_programming/1567a51/0x01-variables_if_else_while/100-print_comb3.c | JehoOgbo/alx-low_level_programming 1567a51 0x01-variables_if_else_while/100-print_comb3.c | true | 200 | 458 | #include <stdio.h>
/**
* main - Entry point
*
* program to print all possible combinations of two digit numbers
*
* Return: always 0 (success)
*/
int main(void)
{
int tens = 0;
int units;
while (tens < 10)
{
units = tens + 1;
while (units < 10)
{
putchar(tens + '0');
putchar(units + '0');
if... | 5 |
manbirbriar/PIC24F-alarm-clock | a21060c | IOs.c | C | www.github.com/manbirbriar/PIC24F-alarm-clock/tree/main/IOs.c | https://raw.githubusercontent.com/manbirbriar/PIC24F-alarm-clock/a21060c/IOs.c | manbirbriar/PIC24F-alarm-clock a21060c IOs.c | true | 200 | 9,143 | #include "TimeDelay.h"
#include "IOs.h"
#include <stdio.h>
uint16_t PB3_event; // PB3 event flag
uint16_t PB2_event; // PB2 event flag
uint16_t PB1_event; // PB1 event flag
uint16_t minutes = 0; // minutes counter
uint16_t seconds = 0; // seconds counter
int go = 0; // flag to check if minutes button has been held f... | 3 |
LudmilaGomes/URI | c1644fc | C/1043.c | C | www.github.com/LudmilaGomes/URI/tree/main/C/1043.c | https://raw.githubusercontent.com/LudmilaGomes/URI/c1644fc/C/1043.c | LudmilaGomes/URI c1644fc C/1043.c | true | 200 | 296 | #include <stdio.h>
int main()
{
double a, b, c;
scanf("%lf %lf %lf", &a, &b, &c);
if ((a + b > c) && (b + c > a) && (a + c > b))
{
printf("Perimetro = %.1f\n", (a + b + c));
}
else
{
printf("Area = %.1f\n", ((a + b) * c / 2));
}
return 0;
} | 4 |
DuyThaiNgx/Network_Programming | 7c7666c | BT.TrenLop_20230418/Bai3/udp_file_receiver.c | C | www.github.com/DuyThaiNgx/Network_Programming/tree/main/BT.TrenLop_20230418/Bai3/udp_file_receiver.c | https://raw.githubusercontent.com/DuyThaiNgx/Network_Programming/7c7666c/BT.TrenLop_20230418/Bai3/udp_file_receiver.c | DuyThaiNgx/Network_Programming 7c7666c BT.TrenLop_20230418/Bai3/udp_file_receiver.c | true | 200 | 1,011 | #include <stdio.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <unistd.h>
#include <netdb.h>
#include <string.h>
#include <arpa/inet.h>
#include <stdlib.h>
#include <netinet/in.h>
#include <time.h>
int main(){
int receiver = socket(AF_INET, SOCK_DGRAM, IPPROTO_UDP);
if (receiver < 0)
{
... | 6 |
Baig75980/c-programs | 35485b5 | basic program/pattern/pyramidStars.c | C | www.github.com/Baig75980/c-programs/tree/main/basic program/pattern/pyramidStars.c | https://raw.githubusercontent.com/Baig75980/c-programs/35485b5/basic%20program/pattern/pyramidStars.c | Baig75980/c-programs 35485b5 basic program/pattern/pyramidStars.c | true | 200 | 646 | /*copied code from video lecture explaining pattern ques
still not working,it's not taking the value properly,
and else condition is getting true so it's keep on printing blank space*/
#include<stdio.h>
int main(){
int n;
printf("\nEnter the size of matrix=");
scanf("%d",&n);
for (int i = 1; i <= n;... | 1 |
AbhishiktMohanty/DSA-LAB | 09772af | Final_Submmision/Lab-9_Q3.c | C | www.github.com/AbhishiktMohanty/DSA-LAB/tree/main/Final_Submmision/Lab-9_Q3.c | https://raw.githubusercontent.com/AbhishiktMohanty/DSA-LAB/09772af/Final_Submmision/Lab-9_Q3.c | AbhishiktMohanty/DSA-LAB 09772af Final_Submmision/Lab-9_Q3.c | true | 200 | 842 | /*3. Given an array “container[]” and integer “hunt”. WAP to find whether “hunt” is present in
container[] or not. If present, then triple the value of “hunt” and search again. Repeat these
steps until “hunt” is not found. Finally return the value of “hunt”.*/
#include<stdio.h>
int main(void)
{
int Container[50],siz... | 5 |
FernandaAM/programacao-sistemas-automatizados | cd0acce | lista-2-exercicio-2.c | C | www.github.com/FernandaAM/programacao-sistemas-automatizados/tree/main/lista-2-exercicio-2.c | https://raw.githubusercontent.com/FernandaAM/programacao-sistemas-automatizados/cd0acce/lista-2-exercicio-2.c | FernandaAM/programacao-sistemas-automatizados cd0acce lista-2-exercicio-2.c | true | 200 | 522 | /* 2) Crie um programa que desenhe um tabuleiro de xadrez na tela (utilizando laços e tomada de decisão).
Você pode escolher que caracteres devem ser usados para representar as casas brancas e pretas a partir da tabela ASCII.*/
#include <stdio.h>
main()
{
int branco, preto;
for(branco = 1; branco < 9; b... | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.