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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
benanredzhebov/Philosophers | 6a7b35a | philo/main.c | C | www.github.com/benanredzhebov/Philosophers/tree/main/philo/main.c | https://raw.githubusercontent.com/benanredzhebov/Philosophers/6a7b35a/philo/main.c | benanredzhebov/Philosophers 6a7b35a philo/main.c | true | 200 | 1,730 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* main.c :+: :+: :+: ... | 6 |
adebsa2401/alx-low_level_programming | 7b5e79a | 0x07-pointers_arrays_strings/2-strchr.c | C | www.github.com/adebsa2401/alx-low_level_programming/tree/main/0x07-pointers_arrays_strings/2-strchr.c | https://raw.githubusercontent.com/adebsa2401/alx-low_level_programming/7b5e79a/0x07-pointers_arrays_strings/2-strchr.c | adebsa2401/alx-low_level_programming 7b5e79a 0x07-pointers_arrays_strings/2-strchr.c | true | 200 | 241 | #include "main.h"
#include <stdio.h>
/**
* *_strchr - strchr
* @s: char*
* @c: char
*
* Return: char*
*/
char *_strchr(char *s, char c)
{
int a;
while (1)
{
a = *s++;
if (a == c)
{
return (s - 1);
}
if (a == 0)
{
return (NULL);
}
}
}
| 3 |
Bopobywek/OS-IHW1 | 3a7e9cb | grade5/reader.c | C | www.github.com/Bopobywek/OS-IHW1/tree/main/grade5/reader.c | https://raw.githubusercontent.com/Bopobywek/OS-IHW1/3a7e9cb/grade5/reader.c | Bopobywek/OS-IHW1 3a7e9cb grade5/reader.c | true | 200 | 1,205 | #include <stdio.h>
#include <sys/types.h>
#include <unistd.h>
#include <stdlib.h>
#include <string.h>
#include <sys/wait.h>
#include <fcntl.h>
#include <sys/stat.h>
#include "constants.h"
char buffer[BUFFER_SIZE];
char sent_bytes[INDICATOR_SIZE];
int main(int argc, char *argv[]) {
if (argc != 3) {
... | 1 |
seantan02/xv6-memory-mapping | 1189bb2 | xv6-public/trap.c | C | www.github.com/seantan02/xv6-memory-mapping/tree/main/xv6-public/trap.c | https://raw.githubusercontent.com/seantan02/xv6-memory-mapping/1189bb2/xv6-public/trap.c | seantan02/xv6-memory-mapping 1189bb2 xv6-public/trap.c | true | 200 | 3,865 | #include "types.h"
#include "defs.h"
#include "param.h"
#include "memlayout.h"
#include "mmu.h"
#include "proc.h"
#include "x86.h"
#include "traps.h"
#include "spinlock.h"
// Interrupt descriptor table (shared by all CPUs).
struct gatedesc idt[256];
extern uint vectors[]; // in vectors.S: array of 256 entry pointers
... | 5 |
Ampofoaban/alx-low_level_programming | e697890 | 0x01-variables_if_else_while/100-print_comb3.c | C | www.github.com/Ampofoaban/alx-low_level_programming/tree/main/0x01-variables_if_else_while/100-print_comb3.c | https://raw.githubusercontent.com/Ampofoaban/alx-low_level_programming/e697890/0x01-variables_if_else_while/100-print_comb3.c | Ampofoaban/alx-low_level_programming e697890 0x01-variables_if_else_while/100-print_comb3.c | true | 200 | 397 | #include <stdlib.h>
#include <time.h>
#include <stdio.h>
/**
* main - entry point
* Return: 0
*/
int main(void)
{
int i, j, k;
i = 0;
while (i < 100)
{
j = i % 10; /* singles digit */
k = i / 10; /* doubles digit */
if (k < j)
{
putchar(k + '0');
putchar(j + '0');
if (i < 89)
{
putch... | 4 |
frefolli/MOS6502 | fd5521c | src/vm/ASL_zpg.c | C | www.github.com/frefolli/MOS6502/tree/main/src/vm/ASL_zpg.c | https://raw.githubusercontent.com/frefolli/MOS6502/fd5521c/src/vm/ASL_zpg.c | frefolli/MOS6502 fd5521c src/vm/ASL_zpg.c | true | 200 | 265 | #include <vm/ASL_zpg.h>
#include <vm/macros.h>
#include <vm/addressing.h>
void VM__ASL_zpg(struct VM* vm) {
uint16_t addr = VM__address__zpg(vm);
vm->SR.C = vm->mem[addr] >> 7;
uint8_t res = vm->mem[addr] << 1;
VM__setNZ(vm, res);
vm->mem[addr] = res;
}
| 6 |
BrownCSCI1230/lab03_convolution_template | 31ef25f | src/settings.h | C | www.github.com/BrownCSCI1230/lab03_convolution_template/tree/main/src/settings.h | https://raw.githubusercontent.com/BrownCSCI1230/lab03_convolution_template/31ef25f/src/settings.h | BrownCSCI1230/lab03_convolution_template 31ef25f src/settings.h | true | 200 | 1,001 | #pragma once
#include <QObject>
#include "RGBA.h"
// Enumeration values for the Filters that the user can select in the GUI.
enum FilterType {
FILTER_INVERT,
FILTER_GRAYSCALE,
FILTER_BRIGHTEN,
FILTER_IDENTITY,
FILTER_SHIFT_LEFT,
FILTER_SHIFT_RIGHT,
FILTER_NONE /// Ignore this when impleme... | 3 |
coale/42cursus | 977f4db | 06_push_swap/main2.c | C | www.github.com/coale/42cursus/tree/main/06_push_swap/main2.c | https://raw.githubusercontent.com/coale/42cursus/977f4db/06_push_swap/main2.c | coale/42cursus 977f4db 06_push_swap/main2.c | true | 200 | 2,617 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* main2.c :+: :+: :+: ... | 1 |
igor-pavkov/honours-2024 | a41fa4c | Code Examples/DiverseVul Filtered/Secure/fb73974172ffaaf57a7c42f35424d9aece1a5af6-65.cpp | C | www.github.com/igor-pavkov/honours-2024/tree/main/Code Examples/DiverseVul Filtered/Secure/fb73974172ffaaf57a7c42f35424d9aece1a5af6-65.cpp | https://raw.githubusercontent.com/igor-pavkov/honours-2024/a41fa4c/Code%20Examples/DiverseVul%20Filtered/Secure/fb73974172ffaaf57a7c42f35424d9aece1a5af6-65.cpp | igor-pavkov/honours-2024 a41fa4c Code Examples/DiverseVul Filtered/Secure/fb73974172ffaaf57a7c42f35424d9aece1a5af6-65.cpp | true | 200 | 3,967 | static int selinux_setprocattr(const char *name, void *value, size_t size)
{
struct task_security_struct *tsec;
struct cred *new;
u32 mysid = current_sid(), sid = 0, ptsid;
int error;
char *str = value;
/*
* Basic control over ability to set these attributes at all.
*/
if (!strcmp(name, "exec"))
error = a... | 5 |
stdlib-js/math-base-special-fmodf | 9c24dfb | src/main.c | C | www.github.com/stdlib-js/math-base-special-fmodf/tree/main/src/main.c | https://raw.githubusercontent.com/stdlib-js/math-base-special-fmodf/9c24dfb/src/main.c | stdlib-js/math-base-special-fmodf 9c24dfb src/main.c | true | 200 | 4,814 | /**
* @license Apache-2.0
*
* Copyright (c) 2024 The Stdlib Authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by a... | 4 |
faizananis/Fifteenth-Assignment-C | cac9a90 | Question 10.c | C | www.github.com/faizananis/Fifteenth-Assignment-C/tree/main/Question 10.c | https://raw.githubusercontent.com/faizananis/Fifteenth-Assignment-C/cac9a90/Question%2010.c | faizananis/Fifteenth-Assignment-C cac9a90 Question 10.c | true | 200 | 997 | #include <stdio.h>
void frequency(int [],int);
int main()
{
int i=0;
int size=0;
printf("Please Enter the size of an Array that you want: ");
scanf("%d",&size);
int arr[size];
printf("\nNow Enter %d Integers in an Array: \n\n",size);
for(i=0;i<size;i++)
{
scanf("%d",&... | 3 |
Seo-Faper/Data_Structure_with_C | 1d85ce4 | chapt04/ch04_1/ex4_1.c | C | www.github.com/Seo-Faper/Data_Structure_with_C/tree/main/chapt04/ch04_1/ex4_1.c | https://raw.githubusercontent.com/Seo-Faper/Data_Structure_with_C/1d85ce4/chapt04/ch04_1/ex4_1.c | Seo-Faper/Data_Structure_with_C 1d85ce4 chapt04/ch04_1/ex4_1.c | true | 200 | 3,085 | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include "InsertLinkedList.h"
#include <string.h>
#include <stdlib.h>
// 공백 연결 리스트를 생성하는 연산
linkedList_h *createLinkedList_h(void)
{
linkedList_h *L;
L = (linkedList_h *)malloc(sizeof(linkedList_h));
L->head = NULL; // 공백 리스트이므로 NULL로 설정
return L;
}
// 연결 리스트의 전체... | 1 |
maababubakr1/alx-low_level_programming | d602f7c | 0x10-variadic_functions/3-print_all.c | C | www.github.com/maababubakr1/alx-low_level_programming/tree/main/0x10-variadic_functions/3-print_all.c | https://raw.githubusercontent.com/maababubakr1/alx-low_level_programming/d602f7c/0x10-variadic_functions/3-print_all.c | maababubakr1/alx-low_level_programming d602f7c 0x10-variadic_functions/3-print_all.c | true | 200 | 794 | #include "variadic_functions.h"
/**
*print_all - A function that prints anything
*@format: A list of types of arguments passed to the function.
*/
void print_all(const char * const format, ...)
{
int i;
char *tmp, *sep = "";
va_list list;
va_start(list, format);
while (format == NULL)
{
printf("\n");
ret... | 5 |
Mailune/holbertonschool-printf | 21336d3 | printf_func.c | C | www.github.com/Mailune/holbertonschool-printf/tree/main/printf_func.c | https://raw.githubusercontent.com/Mailune/holbertonschool-printf/21336d3/printf_func.c | Mailune/holbertonschool-printf 21336d3 printf_func.c | true | 200 | 829 | #include "main.h"
/**
* printf_func - check and verif the specifier to send it
* to the right function to use
* specif: structure of the function
* @ptr_specifier: pointer of element
* Return: function associate or NULL if not found
*/
int (*printf_func(const char *ptr_specifier))(va_list)
{
specif function[] ... | 6 |
ttawfiqobeid/alx-low_level_programming | 7a7f2c3 | 0x04-more_functions_nested_loops/1-isdigit.c | C | www.github.com/ttawfiqobeid/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/1-isdigit.c | https://raw.githubusercontent.com/ttawfiqobeid/alx-low_level_programming/7a7f2c3/0x04-more_functions_nested_loops/1-isdigit.c | ttawfiqobeid/alx-low_level_programming 7a7f2c3 0x04-more_functions_nested_loops/1-isdigit.c | true | 200 | 222 | #include "main.h"
/**
* _isdigit - checks for a digit (0 through 9)
* @c: character to check
* Return: 1 if c is a digit, 0 otherwise
*/
int _isdigit(int c)
{
char result = (c >= '0' && c <= '9');
return (result);
}
| 4 |
TheGreatWaves/C-base | 80cca94 | examples/example_1.c | C | www.github.com/TheGreatWaves/C-base/tree/main/examples/example_1.c | https://raw.githubusercontent.com/TheGreatWaves/C-base/80cca94/examples/example_1.c | TheGreatWaves/C-base 80cca94 examples/example_1.c | true | 200 | 5,161 | #include <stdio.h> // Will remove this later.
#include "../array.h"
#include "../base.h"
#include "../hashtable.h"
#include "../mem_malloc.h"
#include "../utils.h"
#define EVAL_PRINT(x) printf("%s = %d\n", #x, ( s32 ) (x))
#define EVAL_PRINT_LL(x) printf("%s = %ld\n", #x, ( s64 ) (x))
#define EVAL_PRINT_u(x) pr... | 3 |
aishwaryabhalerao97/Logic-Building-Codes | 8b9631a | Program462.c | C | www.github.com/aishwaryabhalerao97/Logic-Building-Codes/tree/main/Program462.c | https://raw.githubusercontent.com/aishwaryabhalerao97/Logic-Building-Codes/8b9631a/Program462.c | aishwaryabhalerao97/Logic-Building-Codes 8b9631a Program462.c | true | 200 | 2,158 | #include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *lchild;
struct node *rchild;
};
typedef struct node NODE;
typedef struct node *PNODE;
typedef struct node **PPNODE;
void Insert(PPNODE Root, int No)
{
PNODE newn = NULL;
PNODE temp = NULL;
newn= (PNODE... | 1 |
brenki1/labs-praticas | 37bc24e | labs1/lab001_21.c | C | www.github.com/brenki1/labs-praticas/tree/main/labs1/lab001_21.c | https://raw.githubusercontent.com/brenki1/labs-praticas/37bc24e/labs1/lab001_21.c | brenki1/labs-praticas 37bc24e labs1/lab001_21.c | true | 200 | 288 | #include <stdlib.h>
#include <stdio.h>
int main(){
float mk; //massa em kilos
float ml; //massa em libras
printf("Insira um valor de massa em libras: ");
scanf("%f", &ml);
mk = ml*0.45;
printf("Essa massa, em quilogramas, equivale a %f", mk);
return 0;
} | 5 |
Gmeriq/alx-low_level_programming | b942118 | 0x04-more_functions_nested_loops/101-print_number.c | C | www.github.com/Gmeriq/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/101-print_number.c | https://raw.githubusercontent.com/Gmeriq/alx-low_level_programming/b942118/0x04-more_functions_nested_loops/101-print_number.c | Gmeriq/alx-low_level_programming b942118 0x04-more_functions_nested_loops/101-print_number.c | true | 200 | 391 | #include "main.h"
/**
* print_number - prints a number
* @n: Input number
*/
void print_number(int n)
{
long len, res, i, temp, expo;
res = n;
expo = len = 1;
if (res < 0)
{
res *= -1;
putchar('-');
}
temp = res;
while (temp >= 10)
{
len++;
temp /= 10;
}
for (i = 1; i < len; i++)
expo *= 10;
while (expo > 1)
{
putc... | 6 |
aTfure/alx-low_level_programming | 9b47f3f | 0x02-functions_nested_loops/6-abs.c | C | www.github.com/aTfure/alx-low_level_programming/tree/main/0x02-functions_nested_loops/6-abs.c | https://raw.githubusercontent.com/aTfure/alx-low_level_programming/9b47f3f/0x02-functions_nested_loops/6-abs.c | aTfure/alx-low_level_programming 9b47f3f 0x02-functions_nested_loops/6-abs.c | true | 200 | 219 | #include "main.h"
/**
* _abs - computes the absolute value of an integer
* @n: check the character
*
* Return: 0 Always(Success)
*/
int _abs(int n)
{
if (n < 0)
{
return (-n);
}
else
{
return (n);
}
}
| 4 |
QiqaQue/alx-low_level_programming | 17ac86f | 0x09-static_libraries/4-isalpha.c | C | www.github.com/QiqaQue/alx-low_level_programming/tree/main/0x09-static_libraries/4-isalpha.c | https://raw.githubusercontent.com/QiqaQue/alx-low_level_programming/17ac86f/0x09-static_libraries/4-isalpha.c | QiqaQue/alx-low_level_programming 17ac86f 0x09-static_libraries/4-isalpha.c | true | 200 | 244 | #include "main.h"
/**
* _isalpha - checks for alphabetic character
*
* @c: the character to be checked
*
* Return: 1 if c is a letter, 0 otherwise
*/
int _isalpha(int c)
{
return ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'));
}
| 3 |
TIny-Hacker/Advent-of-Code-2024 | 39ea6d0 | Day7/Part1/src/main.c | C | www.github.com/TIny-Hacker/Advent-of-Code-2024/tree/main/Day7/Part1/src/main.c | https://raw.githubusercontent.com/TIny-Hacker/Advent-of-Code-2024/39ea6d0/Day7/Part1/src/main.c | TIny-Hacker/Advent-of-Code-2024 39ea6d0 Day7/Part1/src/main.c | true | 200 | 1,345 | #include <fileioc.h>
#include <stdint.h>
#include <graphx.h>
#include <keypadc.h>
#include <string.h>
#include <stdio.h>
bool checkRow(char *tok, char *endOfFile) {
unsigned long long target = strtoull(tok, &tok, 10);
tok++;
char *backup = tok;
bool lastrun = false;
for (unsigned int operations = ... | 5 |
ArenKae/minishell | 1bbfb02 | src/pipex/heredoc_2.c | C | www.github.com/ArenKae/minishell/tree/main/src/pipex/heredoc_2.c | https://raw.githubusercontent.com/ArenKae/minishell/1bbfb02/src/pipex/heredoc_2.c | ArenKae/minishell 1bbfb02 src/pipex/heredoc_2.c | true | 200 | 3,350 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* heredoc_2.c :+: :+: :+: ... | 1 |
Andhiki/andre-SKJ-Lab | 955d753 | Assignment5/deadlock.c | C | www.github.com/Andhiki/andre-SKJ-Lab/tree/main/Assignment5/deadlock.c | https://raw.githubusercontent.com/Andhiki/andre-SKJ-Lab/955d753/Assignment5/deadlock.c | Andhiki/andre-SKJ-Lab 955d753 Assignment5/deadlock.c | true | 200 | 1,130 | #include<stdio.h>
#include<pthread.h>
#include<unistd.h>
void *function1();
void *function2();
pthread_mutex_t res_a;
pthread_mutex_t res_b;
int main() {
pthread_mutex_init(&res_a, NULL);
pthread_mutex_init(&res_b, NULL);
pthread_t one, two;
pthread_create(&one, NULL, function1, NULL);
pthre... | 6 |
PatrickSantos-ghub/C-Codes | 54db8a8 | SomaPar.C | C | www.github.com/PatrickSantos-ghub/C-Codes/tree/main/SomaPar.C | https://raw.githubusercontent.com/PatrickSantos-ghub/C-Codes/54db8a8/SomaPar.C | PatrickSantos-ghub/C-Codes 54db8a8 SomaPar.C | true | 200 | 683 | #include <stdio.h>
int main() {
int numero, somaPares = 0, somaImpares = 0;
char continuar;
do {
printf("Digite um número: ");
scanf("%d", &numero);
if (numero % 2 == 0) {
somaPares += numero;
} else {
somaImpares += numero;
}
... | 4 |
RushikeshKhare/LB_C_RushikeshKhare | e68504e | program185.c | C | www.github.com/RushikeshKhare/LB_C_RushikeshKhare/tree/main/program185.c | https://raw.githubusercontent.com/RushikeshKhare/LB_C_RushikeshKhare/e68504e/program185.c | RushikeshKhare/LB_C_RushikeshKhare e68504e program185.c | true | 200 | 429 | #include<stdio.h>
#include<stdbool.h>
int UpdateString(char *str)
{
int iCnt = 1, iPos = -1;
bool bflag = false;
while(*str != '\0')
{
str++;
}
}
int main()
{
char Arr[100];
char cValue;
int iRet = false;
printf("Enter String : \n");
scanf("%[^'... | 3 |
ld0205/INFO2001_Cosolaptrinh | 7dcc7c2 | main.c | C | www.github.com/ld0205/INFO2001_Cosolaptrinh/tree/main/main.c | https://raw.githubusercontent.com/ld0205/INFO2001_Cosolaptrinh/7dcc7c2/main.c | ld0205/INFO2001_Cosolaptrinh 7dcc7c2 main.c | true | 200 | 446 | #include <stdio.h>
#include <stdlib.h>
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
int main(int argc, char *argv[]) {
int year;
printf("Nhap nam: ");
scanf("%d", &year);
if (year <= 0) {
printf("INVALID\n");
} else if ((year % 400 ==... | 5 |
MoAsaduzzaman/Probelm_Solving_beecrowd | 11a27f4 | 1143.c | C | www.github.com/MoAsaduzzaman/Probelm_Solving_beecrowd/tree/main/1143.c | https://raw.githubusercontent.com/MoAsaduzzaman/Probelm_Solving_beecrowd/11a27f4/1143.c | MoAsaduzzaman/Probelm_Solving_beecrowd 11a27f4 1143.c | true | 200 | 239 | //Problem no-1143
//https://www.beecrowd.com.br/judge/en/problems/view/1143
#include<stdio.h>
int main(){
int N;
scanf("%d",&N);
for(int i=1; i<=N; i++){
printf("%d %d %d\n",(i),(i*i),(i*i*i));
}
return 0;
}
| 1 |
oldcast1e/C | ef67093 | Cprograming/Code Up/기초2. 입출력과 연산자/1023v2.c | C | www.github.com/oldcast1e/C/tree/main/Cprograming/Code Up/기초2. 입출력과 연산자/1023v2.c | https://raw.githubusercontent.com/oldcast1e/C/ef67093/Cprograming/Code%20Up/%EA%B8%B0%EC%B4%882.%20%EC%9E%85%EC%B6%9C%EB%A0%A5%EA%B3%BC%20%EC%97%B0%EC%82%B0%EC%9E%90/1023v2.c | oldcast1e/C ef67093 Cprograming/Code Up/기초2. 입출력과 연산자/1023v2.c | true | 200 | 212 | #include <stdio.h>
#include <string.h>
int main()
{
char arr[50];
scanf("%s",arr);
for(int i=0;i<(int)strlen(arr);i++){
if(arr[i]=='.')printf("\n");
else printf("%c",arr[i]);
}
}
| 7 |
Mahdi10shaimi/alx-low_level_programming | 380414a | 0x14-bit_manipulation/5-flip_bits.c | C | www.github.com/Mahdi10shaimi/alx-low_level_programming/tree/main/0x14-bit_manipulation/5-flip_bits.c | https://raw.githubusercontent.com/Mahdi10shaimi/alx-low_level_programming/380414a/0x14-bit_manipulation/5-flip_bits.c | Mahdi10shaimi/alx-low_level_programming 380414a 0x14-bit_manipulation/5-flip_bits.c | true | 200 | 403 | #include "main.h"
/**
* flip_bits - a function that returns the number of bits
* you would need to flip to get from one number to another.
*@n: first number.
*@m: second number>
*Return: the number of bits.
*/
unsigned int flip_bits(unsigned long int n, unsigned long int m)
{
unsigned int count = 0;
n =... | 6 |
iamkosy/alx-low_level_programming | dfcdc92 | 0x12-singly_linked_lists/0-print_list.c | C | www.github.com/iamkosy/alx-low_level_programming/tree/main/0x12-singly_linked_lists/0-print_list.c | https://raw.githubusercontent.com/iamkosy/alx-low_level_programming/dfcdc92/0x12-singly_linked_lists/0-print_list.c | iamkosy/alx-low_level_programming dfcdc92 0x12-singly_linked_lists/0-print_list.c | true | 200 | 418 | #include <stdio.h>
#include "lists.h"
/**
* print_list - this prints all the elements of a linked list.
* @h: represents pointer to the list_t list to print.
*
* Return:this signifies the number of nodes printed.
*/
size_t print_list(const list_t *h)
{
size_t s = 0;
while (h)
{
if (!h->str)
printf("[0] (... | 3 |
jonatasstark/senaiprogramacao | afdf276 | programa23.c | C | www.github.com/jonatasstark/senaiprogramacao/tree/main/programa23.c | https://raw.githubusercontent.com/jonatasstark/senaiprogramacao/afdf276/programa23.c | jonatasstark/senaiprogramacao afdf276 programa23.c | true | 200 | 905 | #include <stdio.h>
int soma(int a, int b){
return a + b;
}
int subtracao(int a, int b){
return a - b;
}
int multiplicacao(int a, int b){
return a * b;
}
float divisao(int a, int b){
return (float) a / b;
}
int main(){
int resultadosoma;
int resultadosub;
int resultadomult;
... | 5 |
M0ugou-club/42SH | 84512ff | src/builtin_management/setenv/remove_env.c | C | www.github.com/M0ugou-club/42SH/tree/main/src/builtin_management/setenv/remove_env.c | https://raw.githubusercontent.com/M0ugou-club/42SH/84512ff/src/builtin_management/setenv/remove_env.c | M0ugou-club/42SH 84512ff src/builtin_management/setenv/remove_env.c | true | 200 | 1,532 | /*
** EPITECH PROJECT, 2023
** 42SH
** File description:
** remove_env
*/
#include <stdlib.h>
#include <string.h>
#include "env.h"
static void free_line(env_t *to_free)
{
free(to_free->env_line);
free(to_free);
}
static env_t *node_to_free(env_t *env, char *var)
{
env_t *tmp = NULL;
env_t *to_free = ... | 1 |
DuenitasA/TareaSemana3 | 424d800 | Ejercicio31.c | C | www.github.com/DuenitasA/TareaSemana3/tree/main/Ejercicio31.c | https://raw.githubusercontent.com/DuenitasA/TareaSemana3/424d800/Ejercicio31.c | DuenitasA/TareaSemana3 424d800 Ejercicio31.c | true | 200 | 520 | #include <stdio.h>
int main(void)
{
int numero;
int contador =1 ;
float suma = 0;
do
{
printf("Ingrese los numeros que quiera y cuando quiera parar de escribir numeros escriba el 0.\n");
scanf("%d", &numero);
if (numero % 5 == 0 && numero % 10 != 0)
{
co... | 7 |
TG199/Code_challenges | 461c4d1 | C/ccwc/word_count.c | C | www.github.com/TG199/Code_challenges/tree/main/C/ccwc/word_count.c | https://raw.githubusercontent.com/TG199/Code_challenges/461c4d1/C/ccwc/word_count.c | TG199/Code_challenges 461c4d1 C/ccwc/word_count.c | true | 200 | 1,052 | #include "main.h"
/**
* word_count - count words in a file
* @file: File to count words
*
* Return: Number of words counted
*/
ssize_t word_count(char *file)
{
ssize_t bufsize = 100, bytes_read, space_count;
char *buffer;
int fd, in_word;
char c;
if (file == NULL)
{
perror("ERROR: empty file");
return ... | 6 |
Avwerosuo25/alx-low_level_programming | 935a3f7 | 0x0D-preprocessor/1-pi.h | C | www.github.com/Avwerosuo25/alx-low_level_programming/tree/main/0x0D-preprocessor/1-pi.h | https://raw.githubusercontent.com/Avwerosuo25/alx-low_level_programming/935a3f7/0x0D-preprocessor/1-pi.h | Avwerosuo25/alx-low_level_programming 935a3f7 0x0D-preprocessor/1-pi.h | true | 200 | 195 | #ifndef PI_H
#define PI_H
/**
* file- 1-pi.h
* Description: header file that defines a macro named PI
* as an abbreviation for the token 3.14159265359
*/
#define PI (3.14159265359)
#endif
| 4 |
Ginathebeloved/alx-low_level_programming | e5c8a4f | 0x01-variables_if_else_while/9-print_comb.c | C | www.github.com/Ginathebeloved/alx-low_level_programming/tree/main/0x01-variables_if_else_while/9-print_comb.c | https://raw.githubusercontent.com/Ginathebeloved/alx-low_level_programming/e5c8a4f/0x01-variables_if_else_while/9-print_comb.c | Ginathebeloved/alx-low_level_programming e5c8a4f 0x01-variables_if_else_while/9-print_comb.c | true | 200 | 333 | #include <stdio.h>
/**
* main - Determines if a number is positive, negative or zero.
*Description: 'get the last difit of a number'
* Return: Always 0
*/
int main(void)
{
int n;
for (n = 48; n <= 57; n++)
{
putchar(n);
if (n == 57)
{
continue;
}
putchar(',');
putchar(' ');
}
putchar('\n');
r... | 2 |
Delon-Perry-Repo/Coding-Assignments | cd31c4e | rns.c | C | www.github.com/Delon-Perry-Repo/Coding-Assignments/tree/main/rns.c | https://raw.githubusercontent.com/Delon-Perry-Repo/Coding-Assignments/cd31c4e/rns.c | Delon-Perry-Repo/Coding-Assignments cd31c4e rns.c | true | 200 | 2,148 | #include "node.h"
#include "rns.h"
#include "utility.h"
char stripComment(char* tempString){
char *ptr;
char *newLine = "\n";
ptr = strchr(tempString, MARKER);
if(ptr != NULL){
*ptr = '\0';
}
if(strchr(tempString, '\n') == NULL)
if(*tempString != '\0')
strncat(tempString, ... | 3 |
GiuliaZd/HIVE | 2a118ae | C07incorrect/ex00/ft_strdup.c | C | www.github.com/GiuliaZd/HIVE/tree/main/ C07incorrect/ex00/ft_strdup.c | https://raw.githubusercontent.com/GiuliaZd/HIVE/2a118ae/%20C07incorrect/ex00/ft_strdup.c | GiuliaZd/HIVE 2a118ae C07incorrect/ex00/ft_strdup.c | true | 200 | 360 | #include <stdlib.h>
int ft_str_length(char *str)
{
int i;
i = 0;
while (str[i])
i++;
return (i);
}
char *ft_strdup(char *src)
{
int i;
char *dest;
char *d;
i = 0;
d = ((dest = (char *)malloc(ft_str_length(src) * sizeof(char) + 1)));
if (!d)
{
return (0);
}
while (src[i])
{
dest[i] = src[i];
i++... | 5 |
MHI-Embedded-Dev/STM32withRaspberryPiCommunication-UART- | 1938d35 | stm32_with_rasberry_pi_uart/Core/Src/main.c | C | www.github.com/MHI-Embedded-Dev/STM32withRaspberryPiCommunication-UART-/tree/main/stm32_with_rasberry_pi_uart/Core/Src/main.c | https://raw.githubusercontent.com/MHI-Embedded-Dev/STM32withRaspberryPiCommunication-UART-/1938d35/stm32_with_rasberry_pi_uart/Core/Src/main.c | MHI-Embedded-Dev/STM32withRaspberryPiCommunication-UART- 1938d35 stm32_with_rasberry_pi_uart/Core/Src/main.c | true | 200 | 11,487 | /* USER CODE BEGIN Header */
/**
******************************************************************************
* @file : main.c
* @brief : Main program body
******************************************************************************
* @attention
*
* Copyright (c) 2023 STMicroelectro... | 7 |
a-vor/String.h-and-printf-implementation | eb386f7 | s21_string.c | C | www.github.com/a-vor/String.h-and-printf-implementation/tree/main/s21_string.c | https://raw.githubusercontent.com/a-vor/String.h-and-printf-implementation/eb386f7/s21_string.c | a-vor/String.h-and-printf-implementation eb386f7 s21_string.c | true | 200 | 17,702 | #include "s21_string.h"
#include <stdio.h>
#include <stdlib.h>
#include "s21_sprintf.h"
void* s21_memchr(const void* str, int c, s21_size_t n) {
const char* cur = (const char*)str;
s21_size_t pos = 0;
while (pos < n) {
if (cur[pos] == c) break;
pos++;
}
return (pos < n ? (void*)&cur[pos] : s21_NULL... | 4 |
spnch1/assignments | ca8a454 | pr6/main.c | C | www.github.com/spnch1/assignments/tree/main/pr6/main.c | https://raw.githubusercontent.com/spnch1/assignments/ca8a454/pr6/main.c | spnch1/assignments ca8a454 pr6/main.c | true | 200 | 1,039 | #include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#include "function.h"
// WIP
int main(void) {
printf("=== SLAE solver ===\n");
do {
int n = get_int("\nEnter the SLAE size (number of equations)", 2, 10);
double epsilon = get_epsilon("\nEnter the root calculation accuracy", 1... | 0 |
VeloPayments/v-c-it | ff29f52 | src/helpers/get_and_verify_artifact_last_txn_id.c | C | www.github.com/VeloPayments/v-c-it/tree/main/src/helpers/get_and_verify_artifact_last_txn_id.c | https://raw.githubusercontent.com/VeloPayments/v-c-it/ff29f52/src/helpers/get_and_verify_artifact_last_txn_id.c | VeloPayments/v-c-it ff29f52 src/helpers/get_and_verify_artifact_last_txn_id.c | true | 200 | 4,852 | /**
* \file helpers/get_and_verify_artifact_last_txn_id.c
*
* \brief Request the last txn id of a given artifact from agentd.
*
* \copyright 2021-2022 Velo Payments, Inc. All rights reserved.
*/
#include <helpers/conn_helpers.h>
#include <helpers/status_codes.h>
#include <stdio.h>
#include <string.h>
#include <... | 1 |
nasreenrpx01/C-prog | 21dcb13 | memoryrealloc.c | C | www.github.com/nasreenrpx01/C-prog/tree/main/memoryrealloc.c | https://raw.githubusercontent.com/nasreenrpx01/C-prog/21dcb13/memoryrealloc.c | nasreenrpx01/C-prog 21dcb13 memoryrealloc.c | true | 200 | 399 | #include<stdio.h>
#include<stdlib.h>
int main(){
int *ptr=(int *)calloc(5,sizeof(int));
for(int i=0;i<5;i++){
ptr[i]=i*2+1;
printf("%d\t",ptr[i]);
}
printf("\n");
printf("Reassigning even values and increasing its size\n");
ptr=realloc(ptr,6);
for(int i=1;i<7;i++){
p... | 5 |
suprajpulluru/HPC-Codes | 5598964 | 21CSB0A45_Assignment1/Graphs/Connected Components/P2.c | C | www.github.com/suprajpulluru/HPC-Codes/tree/main/21CSB0A45_Assignment1/Graphs/Connected Components/P2.c | https://raw.githubusercontent.com/suprajpulluru/HPC-Codes/5598964/21CSB0A45_Assignment1/Graphs/Connected%20Components/P2.c | suprajpulluru/HPC-Codes 5598964 21CSB0A45_Assignment1/Graphs/Connected Components/P2.c | true | 200 | 2,011 | #include <stdio.h>
#include <stdlib.h>
#include <pthread.h>
#define V 5
int** G;
int* parent;
int* rank;
pthread_mutex_t* mutex;
void makeSet(int i){
parent[i]=i;
rank[i]=0;
}
int find(int i){
if(parent[i]!=i)parent[i]=find(parent[i]);
return parent[i];
}
void unionSets(int u,int v){
int pu=find... | 3 |
hailemichael-ayana/alx-low_level_programming | 16b0c0c | 0x14-bit_manipulation/0-binary_to_uint.c | C | www.github.com/hailemichael-ayana/alx-low_level_programming/tree/main/0x14-bit_manipulation/0-binary_to_uint.c | https://raw.githubusercontent.com/hailemichael-ayana/alx-low_level_programming/16b0c0c/0x14-bit_manipulation/0-binary_to_uint.c | hailemichael-ayana/alx-low_level_programming 16b0c0c 0x14-bit_manipulation/0-binary_to_uint.c | true | 200 | 414 | #include "main.h"
/**
*binary_to_uint -convert binary to integer
*
*@b: pointer
*
*Return: unsigned integer
*/
unsigned int binary_to_uint(const char *b)
{
unsigned int uint;
int i;
uint = i = 0;
if (b == NULL)
return (0);
while (b[i] != '\0')
{
if (b[i] == '0' || b[i] == '1')
i++;
else
return (0);
}
for (i =... | 2 |
Suyash-Marathe/C_FILES | be0af7a | fabonacci.c | C | www.github.com/Suyash-Marathe/C_FILES/tree/main/fabonacci.c | https://raw.githubusercontent.com/Suyash-Marathe/C_FILES/be0af7a/fabonacci.c | Suyash-Marathe/C_FILES be0af7a fabonacci.c | true | 200 | 252 | #include<stdio.h>
int main()
{
int a=0,b=1,c=0,level,i;
printf("\nEnter the Level Number:");
scanf("%d",&level);
printf("\n%d\n%d",a,b);
for(i=1;i<=level;i++)
{
c=a+b;
printf("\n%d",c);
a=b;
b=c;
}
return 0;
} | 6 |
Lalith-github/SkillRack-Solutions | d5ed1e3 | Learning C/Common/Head Count - Birds and Animals.c | C | www.github.com/Lalith-github/SkillRack-Solutions/tree/main/Learning C/Common/Head Count - Birds and Animals.c | https://raw.githubusercontent.com/Lalith-github/SkillRack-Solutions/d5ed1e3/Learning%20C/Common/Head%20Count%20-%20Birds%20and%20Animals.c | Lalith-github/SkillRack-Solutions d5ed1e3 Learning C/Common/Head Count - Birds and Animals.c | true | 200 | 454 | #include<stdio.h>
#include <stdlib.h>
int main()
{
int headcount,legcount;
scanf("%d\n%d",&headcount,&legcount);
printf("%d\n",abs((legcount-(4*headcount))/2));
printf("%d\n",abs(legcount-((2*headcount))/2));
}
// Sample Input/Output:
// Example 1:
// Input:
// 27
// 84
// Output:
// 12 15
// Explanation:
// There... | 0 |
MariaAguiar/Philosophers | aff7748 | philo.c | C | www.github.com/MariaAguiar/Philosophers/tree/main/philo.c | https://raw.githubusercontent.com/MariaAguiar/Philosophers/aff7748/philo.c | MariaAguiar/Philosophers aff7748 philo.c | true | 200 | 2,800 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* philo.c :+: :+: :+: ... | 7 |
cuculetz11/SocialMedia-Graph_Trees | e54cdb4 | posts.c | C | www.github.com/cuculetz11/SocialMedia-Graph_Trees/tree/main/posts.c | https://raw.githubusercontent.com/cuculetz11/SocialMedia-Graph_Trees/e54cdb4/posts.c | cuculetz11/SocialMedia-Graph_Trees e54cdb4 posts.c | true | 200 | 21,824 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "posts.h"
#include "users.h"
linked_list_t *
ll_create(unsigned int data_size)
{
linked_list_t *ll;
ll = malloc(sizeof(*ll));
ll->head = NULL;
ll->data_size = data_size;
ll->size = 0;
return ll;
}
void ll_add_nth_node(linked_list_t *list, i... | 4 |
Void-Individual/alx-low_level_programming | 6bda064 | 0x0A-argc_argv/100-change.c | C | www.github.com/Void-Individual/alx-low_level_programming/tree/main/0x0A-argc_argv/100-change.c | https://raw.githubusercontent.com/Void-Individual/alx-low_level_programming/6bda064/0x0A-argc_argv/100-change.c | Void-Individual/alx-low_level_programming 6bda064 0x0A-argc_argv/100-change.c | true | 200 | 373 | #include <stdio.h>
#include <stdlib.h>
/**
* main - program to dispense minimum change
* @argc: argument count
* @argv: argument string
* Return: 1 if it cant run, else o
*/
int main(int argc, char *argv[])
{
int x = 0;
if (argc != 2)
{
printf("Error\n");
return (1);
}
x = atoi(argv[1]);
if (x == 0)
... | 5 |
infopkrajput/c | 338e14e | Class/Vanshika/chapter19/exBe.c | C | www.github.com/infopkrajput/c/tree/main/Class/Vanshika/chapter19/exBe.c | https://raw.githubusercontent.com/infopkrajput/c/338e14e/Class/Vanshika/chapter19/exBe.c | infopkrajput/c 338e14e Class/Vanshika/chapter19/exBe.c | true | 200 | 6,145 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct customer
{
int accno;
char name[50];
float balance;
};
struct transaction
{
int accno;
char type[10];
float amount;
};
int main()
{
FILE *p, *q, *r;
struct customer c, d;
struct transaction t;
int n;
int x;
... | 3 |
ishandutta2007/codeforces-l | fb4b845 | laycurse/normal/87/D.c | C | www.github.com/ishandutta2007/codeforces-l/tree/main/laycurse/normal/87/D.c | https://raw.githubusercontent.com/ishandutta2007/codeforces-l/fb4b845/laycurse/normal/87/D.c | ishandutta2007/codeforces-l fb4b845 laycurse/normal/87/D.c | true | 200 | 4,363 | #include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define ll long long
void intIntSort(int d[],int m[],int s){int i=-1,j=s,k,t;if(s<=1)return;k=(d[0]+d[s-1])/2;for(;;){while(d[++i]<k);while(d[--j]>k);if(i>=j)break;t=d[i];d[i]=d[j];d[j]=t;t=m[i];m[i]=... | 2 |
Armina101/alx-low_level_programming | ad7ed65 | 0x06-pointers_arrays_strings/4-rev_array.c | C | www.github.com/Armina101/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/4-rev_array.c | https://raw.githubusercontent.com/Armina101/alx-low_level_programming/ad7ed65/0x06-pointers_arrays_strings/4-rev_array.c | Armina101/alx-low_level_programming ad7ed65 0x06-pointers_arrays_strings/4-rev_array.c | true | 200 | 285 | #include "main.h"
/**
* reverse_array - reverses the content of an array of integers
* @n: number of elements of the array
* @a: array
*
* Return: void
*/
void reverse_array(int *a, int n)
{
int b, c;
for (b = 0; b < n--; b++)
{
c = a[b];
a[b] = a[n];
a[n] = c;
}
}
| 1 |
nmep/minishell | eead7f0 | src/binary_tree/ft_interpret_token_1.c | C | www.github.com/nmep/minishell/tree/main/src/binary_tree/ft_interpret_token_1.c | https://raw.githubusercontent.com/nmep/minishell/eead7f0/src/binary_tree/ft_interpret_token_1.c | nmep/minishell eead7f0 src/binary_tree/ft_interpret_token_1.c | true | 200 | 2,594 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_interpret_token_1.c :+: :+: :+: ... | 6 |
RajkumarGapat/C-Projects-and-Programs | 5322b45 | 3 Flow Control/if else/if3.c | C | www.github.com/RajkumarGapat/C-Projects-and-Programs/tree/main/3 Flow Control/if else/if3.c | https://raw.githubusercontent.com/RajkumarGapat/C-Projects-and-Programs/5322b45/3%20Flow%20Control/if%20else/if3.c | RajkumarGapat/C-Projects-and-Programs 5322b45 3 Flow Control/if else/if3.c | true | 200 | 228 | #include<stdio.h>
void main()
{
int age;
printf("Enter Your age = ");
scanf("%d",&age);
if(age>18)
{
printf("Yes dear Congratulation you can apply for your voter card to vote in Election 2022 !!");
}
} | 0 |
BancRoland/Python | 5a0cfa7 | Physics/Radar/Noise/document/KML/slice.c | C | www.github.com/BancRoland/Python/tree/main/Physics/Radar/Noise/document/KML/slice.c | https://raw.githubusercontent.com/BancRoland/Python/5a0cfa7/Physics/Radar/Noise/document/KML/slice.c | BancRoland/Python 5a0cfa7 Physics/Radar/Noise/document/KML/slice.c | true | 200 | 2,577 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define RES 10
#define PI 3.141592653
int main()
{
FILE *out;
FILE *head;
FILE *coord;
coord=fopen("coordSlice.txt","rt");
char puffer[1024];
int cnt=0;
float circ[RES+1][3]={0};
float R_0=6371000;
float ... | 4 |
ArthurAWong/ECG_Chest_Patch | b75cf3f | src/main.c | C | www.github.com/ArthurAWong/ECG_Chest_Patch/tree/main/src/main.c | https://raw.githubusercontent.com/ArthurAWong/ECG_Chest_Patch/b75cf3f/src/main.c | ArthurAWong/ECG_Chest_Patch b75cf3f src/main.c | true | 200 | 5,314 | /* main.c - Application main entry point */
/*
* Copyright (c) 2015-2016 Intel Corporation
*
* SPDX-License-Identifier: Apache-2.0
*/
#include <zephyr/types.h>
#include <stddef.h>
#include <string.h>
#include <errno.h>
#include <zephyr/sys/printk.h>
#include <zephyr/sys/byteorder.h>
#include <zephyr/kernel.h>
#i... | 3 |
Nikitapatil2005/c-codes | c1df899 | dfs.c | C | www.github.com/Nikitapatil2005/c-codes/tree/main/dfs.c | https://raw.githubusercontent.com/Nikitapatil2005/c-codes/c1df899/dfs.c | Nikitapatil2005/c-codes c1df899 dfs.c | true | 200 | 388 | #include<stdio.h>
void DFS(int);
int G[10][10],visited[10],n;
void main()
{
int i,j;
printf("Enter the number of vertices:");
scanf("%d",&n);
printf("adjancy matrix of a graph is");
for(i=0;i<n;i++)
for(j=0;j<n;j++)
scanf("%d",&G[i][j]);
for(i=0;i<n;i++)
visited[i]=0;
DFS(0);
}
void DFS(int i)
{
int j;
printf("%d",i);
... | 2 |
welbur/LKHM840_PowerBoard | ec893d9 | lib/LKIOCtrlBox_MSP/ISO1I813T_DI.h | C | www.github.com/welbur/LKHM840_PowerBoard/tree/main/lib/LKIOCtrlBox_MSP/ISO1I813T_DI.h | https://raw.githubusercontent.com/welbur/LKHM840_PowerBoard/ec893d9/lib/LKIOCtrlBox_MSP/ISO1I813T_DI.h | welbur/LKHM840_PowerBoard ec893d9 lib/LKIOCtrlBox_MSP/ISO1I813T_DI.h | true | 200 | 2,740 | #ifndef __ISO1I813T_DI_H_
#define __ISO1I813T_DI_H_
#ifdef __cplusplus
extern "C" {
#endif
#include "stm32f4xx_hal.h"
#include "LOG.h"
/* Register Bit Type Definition
*_______________________________________________________________________________________________________________________
* Type ... | 7 |
ox-tillzs/alx-low_level_programming | 172be20 | 0x0A-argc_argv/100-change.c | C | www.github.com/ox-tillzs/alx-low_level_programming/tree/main/0x0A-argc_argv/100-change.c | https://raw.githubusercontent.com/ox-tillzs/alx-low_level_programming/172be20/0x0A-argc_argv/100-change.c | ox-tillzs/alx-low_level_programming 172be20 0x0A-argc_argv/100-change.c | true | 200 | 809 | #include <stdio.h>
#include <stdlib.h>
/**
* main - Prints the minimum number of coins to
* make change for an amount of money.
* @argc: The number of arguments supplied to the program
* @argv: An array of pointers to the arguments.
* Return: If argc not exactly two - 1
* Otherwise - 0.
*/
int ma... | 1 |
Bobcharliee/alx-low_level_programming | fd99f7f | 0x02-functions_nested_loops/3-islower.c | C | www.github.com/Bobcharliee/alx-low_level_programming/tree/main/0x02-functions_nested_loops/3-islower.c | https://raw.githubusercontent.com/Bobcharliee/alx-low_level_programming/fd99f7f/0x02-functions_nested_loops/3-islower.c | Bobcharliee/alx-low_level_programming fd99f7f 0x02-functions_nested_loops/3-islower.c | true | 200 | 229 | #include "main.h"
/**
* _islower - a function that checks for lowercase character
* Return: returns 1 if lower and 0 if otherwise
* @c: argument
*/
int _islower(int c)
{
if (c >= 97 && c <= 122)
return (1);
return (0);
}
| 5 |
BartlomiejFronc/Wyswietlacz | 9b211c6 | program do odczytu ramek can.c | C | www.github.com/BartlomiejFronc/Wyswietlacz/tree/main/program do odczytu ramek can.c | https://raw.githubusercontent.com/BartlomiejFronc/Wyswietlacz/9b211c6/program%20do%20odczytu%20ramek%20can.c | BartlomiejFronc/Wyswietlacz 9b211c6 program do odczytu ramek can.c | true | 200 | 1,716 | //Uruchomienie Can sockect
int s;
if ((s = socket(PF_CAN, SOCK_RAW, CAN_RAW)) < 0) {
perror("Socket");
return 1;
}
//
//
//
struct ifreq ifr;
strcpy(ifr.ifr_name, "vcan0" );
ioctl(s, SIOCGIFINDEX, &ifr);
//
//
//
struct sockaddr_can addr;
memset(&addr, 0, sizeof(addr));
addr.can_family = AF_CAN;
addr.can_... | 6 |
PariharAnil/C_assignment | 87bc534 | binary series.c | C | www.github.com/PariharAnil/C_assignment/tree/main/binary series.c | https://raw.githubusercontent.com/PariharAnil/C_assignment/87bc534/binary%20series.c | PariharAnil/C_assignment 87bc534 binary series.c | true | 200 | 199 | #include<stdio.h>
int main()
{
int r,c;
for(r=1;r<=5;r++)
{
for(c=1;c<=r;c++)
{
if(c%2!=0)
{
printf("1");
}
else
{
printf("0");
}
}
printf("\n");
}
}
| 4 |
smryouma/report7 | 68ede8e | report7.c | C | www.github.com/smryouma/report7/tree/main/report7.c | https://raw.githubusercontent.com/smryouma/report7/68ede8e/report7.c | smryouma/report7 68ede8e report7.c | true | 200 | 1,014 | #include <stdio.h>
#include <assert.h>
void array_check_print(int array[], int size);
void sort_result_print(int array[], int size);
void array_check_print(int array[], int size){
assert(size>=2);
for(int i = 0; i<size; i++){
assert(0 <= array[i] && array[i] <= 100);
}
printf("scores = ");
... | 0 |
RobertRobern/alx-low_level_programming | 7202bdd | 0x01-variables_if_else_while/100-print_comb3.c | C | www.github.com/RobertRobern/alx-low_level_programming/tree/main/0x01-variables_if_else_while/100-print_comb3.c | https://raw.githubusercontent.com/RobertRobern/alx-low_level_programming/7202bdd/0x01-variables_if_else_while/100-print_comb3.c | RobertRobern/alx-low_level_programming 7202bdd 0x01-variables_if_else_while/100-print_comb3.c | true | 200 | 422 | #include <stdio.h>
/**
* main - Print numbers from 00 to 90
*
* Return: 0 if success
*/
int main(void)
{
int l = '0';
int n = '0';
while (l <= '9')
{
while (n <= '9')
{
if (!(l > n || l == n))
{
putchar(l);
putchar(n);
if (l == '8' && n == '9')
{
putchar('\n');
}
else
... | 2 |
LDtheGHOST/holbertonschool-low_level_programming | 61d1849 | bit_manipulation/2-get_bit.c | C | www.github.com/LDtheGHOST/holbertonschool-low_level_programming/tree/main/bit_manipulation/2-get_bit.c | https://raw.githubusercontent.com/LDtheGHOST/holbertonschool-low_level_programming/61d1849/bit_manipulation/2-get_bit.c | LDtheGHOST/holbertonschool-low_level_programming 61d1849 bit_manipulation/2-get_bit.c | true | 200 | 434 | #include "main.h"
#include <stdio.h>
/**
* get_bit - function that returns the value of a bit at a given index.
* @n: integer
* @index: is the index, starting from 0 of the bit you want to get
*
* Return: the value of the bit at index index or -1 if an error occured
**/
int get_bit(unsigned long int n, unsigned i... | 7 |
hongjunliao/libhp | 0456a01 | src/hp_cjson.c | C | www.github.com/hongjunliao/libhp/tree/main/src/hp_cjson.c | https://raw.githubusercontent.com/hongjunliao/libhp/0456a01/src/hp_cjson.c | hongjunliao/libhp 0456a01 src/hp_cjson.c | true | 200 | 21,370 |
/*!
* This file is PART of libhp project
* @author hongjun.liao <docici@126.com>, @date 2019/11/14
*
* cjson utils
*
* */
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif /* HAVE_CONFIG_H */
#ifdef LIBHP_WITH_CJSON
#include <stdio.h>
#include <stdlib.h> /* malloc */
#include <errno.h> /* errno */... | 1 |
MitchNine/Dynamic | fa88caa | src/Container/DLinkList.c | C | www.github.com/MitchNine/Dynamic/tree/main/src/Container/DLinkList.c | https://raw.githubusercontent.com/MitchNine/Dynamic/fa88caa/src/Container/DLinkList.c | MitchNine/Dynamic fa88caa src/Container/DLinkList.c | true | 200 | 3,291 | #include "DLinkList.internal.h"
#include "../Core/DMemory.h"
#include <string.h>
DLinkList* DLinkList_create(uint32_t in_stride) {
DLinkList* ll = DMalloc(sizeof(DLinkList));
ll->_size = 0;
ll->_head = NULL;
ll->_tail = NULL;
ll->_stride = in_stride;
return ll;
}
void DLinkList_free(DLinkList* in_ll) {
f... | 3 |
Mayur1043/cs | 97c40f3 | C_Assg/assignment1/Q6.c | C | www.github.com/Mayur1043/cs/tree/main/C_Assg/assignment1/Q6.c | https://raw.githubusercontent.com/Mayur1043/cs/97c40f3/C_Assg/assignment1/Q6.c | Mayur1043/cs 97c40f3 C_Assg/assignment1/Q6.c | true | 200 | 230 | #include<stdio.h>
int main()
{
int i,avg,sum=0,n;
printf("Enter how many no you want : ");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
sum = sum + i;
avg=sum/n;
}
printf("Sum = %d\n",sum);
printf("AVG = %d\n",avg);
return 0;
}
| 6 |
Jamaika1/plugins_ffmpeg_vvc_evc_htj2k | 695fd4f | libavcodec/librsvg/libxml2/xmlversion.h | C | www.github.com/Jamaika1/plugins_ffmpeg_vvc_evc_htj2k/tree/main/libavcodec/librsvg/libxml2/xmlversion.h | https://raw.githubusercontent.com/Jamaika1/plugins_ffmpeg_vvc_evc_htj2k/695fd4f/libavcodec/librsvg/libxml2/xmlversion.h | Jamaika1/plugins_ffmpeg_vvc_evc_htj2k 695fd4f libavcodec/librsvg/libxml2/xmlversion.h | true | 200 | 9,058 | /*
* Summary: compile-time version information
* Description: compile-time version information for the XML library
*
* Copy: See Copyright for the status of this software.
*
* Author: Daniel Veillard
*/
#ifndef __XML_VERSION_H__
#define __XML_VERSION_H__
#include "xmlexports.h"
#ifdef __cplusplus
extern "C" ... | 0 |
PreciousIfeaka/alx-low_level_programming | ff576f4 | 0x0A-argc_argv/2-args.c | C | www.github.com/PreciousIfeaka/alx-low_level_programming/tree/main/0x0A-argc_argv/2-args.c | https://raw.githubusercontent.com/PreciousIfeaka/alx-low_level_programming/ff576f4/0x0A-argc_argv/2-args.c | PreciousIfeaka/alx-low_level_programming ff576f4 0x0A-argc_argv/2-args.c | true | 200 | 352 | #include <stdio.h>
#include "main.h"
/**
* main - a function that prints the number of arguments
* @argc: argumemt count variable
* @argv: argument vector variable
* Return: Always 0 (successful)
*/
int main(int argc, char *argv[])
{
if (argc > 0)
{
int i;
for (i = 0; i < argc; i++)
{
printf("%s\n", ... | 5 |
bbento-a/ProjectMinishell | db05a2e | src/builtins/builtin_exit.c | C | www.github.com/bbento-a/ProjectMinishell/tree/main/src/builtins/builtin_exit.c | https://raw.githubusercontent.com/bbento-a/ProjectMinishell/db05a2e/src/builtins/builtin_exit.c | bbento-a/ProjectMinishell db05a2e src/builtins/builtin_exit.c | true | 200 | 3,308 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* builtin_exit.c :+: :+: :+: ... | 2 |
emankware/alx-low_level_programming | 61dc0fd | 0x0A-argc_argv/4-add.c | C | www.github.com/emankware/alx-low_level_programming/tree/main/0x0A-argc_argv/4-add.c | https://raw.githubusercontent.com/emankware/alx-low_level_programming/61dc0fd/0x0A-argc_argv/4-add.c | emankware/alx-low_level_programming 61dc0fd 0x0A-argc_argv/4-add.c | true | 200 | 519 | #include <stdio.h>
#include <stdlib.h>
/**
* main - a program that adds positive numbers.
* @argc: argument count
* @argv: argument vector
* Return: Always 0 (success)
*/
int main(int argc, char *argv[])
{
int k;
int j;
int a = 0;
if (argc == 1)
{
printf("0\n");
return (0);
}
for (k = 1; k < argc; k+... | 1 |
michalwrpo/pwr | 3e273ae | 3rdSemester/akiso/lab/list4/zad3-5/lsh.c | C | www.github.com/michalwrpo/pwr/tree/main/3rdSemester/akiso/lab/list4/zad3-5/lsh.c | https://raw.githubusercontent.com/michalwrpo/pwr/3e273ae/3rdSemester/akiso/lab/list4/zad3-5/lsh.c | michalwrpo/pwr 3e273ae 3rdSemester/akiso/lab/list4/zad3-5/lsh.c | true | 200 | 8,154 | #include <stdlib.h>
#include <stdio.h>
#include <unistd.h>
#include <sys/wait.h>
#include <string.h>
#include <linux/limits.h>
#include <signal.h>
#include <fcntl.h>
#define LSH_RL_BUFSIZE 1024
#define LSH_TOK_BUFSIZE 64
#define LSH_TOK_DELIM " \t\n\r\a"
#define LSH_MAX_JOBS 255
void remove_element(char **array, int ... | 7 |
knotted48/BOJ | f3426fe | 0616/11729.c | C | www.github.com/knotted48/BOJ/tree/main/0616/11729.c | https://raw.githubusercontent.com/knotted48/BOJ/f3426fe/0616/11729.c | knotted48/BOJ f3426fe 0616/11729.c | true | 200 | 432 | #include <stdio.h>
int pow2(int power) {
if (power == 0)
return 1;
if (power == 1)
return 2;
else
return 2 * pow2(power - 1);
}
void hanoi(int n, int p1, int p2, int p3) {
if (n == 1)
printf("%d %d\n", p1, p3);
else {
hanoi(n - 1, p1, p3, p2);
printf("%d %d\n", p1, p3);
hanoi(n - 1, p2, p1, p3);
}... | 3 |
opegol/alx-low_level_programming | db6d7a4 | 0x14-bit_manipulation/100-get_endianness.c | C | www.github.com/opegol/alx-low_level_programming/tree/main/0x14-bit_manipulation/100-get_endianness.c | https://raw.githubusercontent.com/opegol/alx-low_level_programming/db6d7a4/0x14-bit_manipulation/100-get_endianness.c | opegol/alx-low_level_programming db6d7a4 0x14-bit_manipulation/100-get_endianness.c | true | 200 | 226 | #include <stdlib.h>
#include "main.h"
/**
* get_endianness - checks the endianness.
* Return: 0 if big endian, 1 if little endian
*/
int get_endianness(void)
{
unsigned int i = 1;
char *c = (char *)&i;
return (*c);
}
| 6 |
Pintonzobia1/alx-low_level_programming | f5539c0 | 0x09-static_libraries/4-isalpha.c | C | www.github.com/Pintonzobia1/alx-low_level_programming/tree/main/0x09-static_libraries/4-isalpha.c | https://raw.githubusercontent.com/Pintonzobia1/alx-low_level_programming/f5539c0/0x09-static_libraries/4-isalpha.c | Pintonzobia1/alx-low_level_programming f5539c0 0x09-static_libraries/4-isalpha.c | true | 200 | 261 | #include "main.h"
/**
* _isalpha - print alphabets
* @c: variable
*
* Return: 1 for letters. Returns 0 otherwise
*/
int _isalpha(int c)
{
if ((c >= 97 && c <= 122) || (c >= 65 && c <= 90))
{
return (1);
}
else
{
return (0);
}
_putchar('\n');
}
| 0 |
amirdhami/SimpleSQL | 74ecee1 | ast.h | C | www.github.com/amirdhami/SimpleSQL/tree/main/ast.h | https://raw.githubusercontent.com/amirdhami/SimpleSQL/74ecee1/ast.h | amirdhami/SimpleSQL 74ecee1 ast.h | true | 200 | 2,151 | /*ast.h*/
#pragma once
#include <stdbool.h> // true, false
#include "tokenqueue.h"
//
// SQL Query
//
enum AST_QUERY_TYPES
{
SELECT_QUERY = 0,
INSERT_QUERY,
UPDATE_QUERY,
DELETE_QUERY
};
struct QUERY
{
union
{
struct SELECT* select;
struct INSERT* insert;
struct U... | 1 |
ACELARIA/CPrograms | 2aef0af | Q23.c | C | www.github.com/ACELARIA/CPrograms/tree/main/Q23.c | https://raw.githubusercontent.com/ACELARIA/CPrograms/2aef0af/Q23.c | ACELARIA/CPrograms 2aef0af Q23.c | true | 200 | 361 | #include <stdio.h>
int main() {
int base, exponent, i,result = 1;
printf("Enter the base number: ");
scanf("%d", &base);
printf("Enter the exponent: ");
scanf("%d", &exponent);
for (i = 0; i < exponent; i++) {
result *= base;
}
printf("%d raised to the power of %d is %d\n", ... | 2 |
ternovskiyegor/OS | 364734c | pr7/task2/server.c | C | www.github.com/ternovskiyegor/OS/tree/main/pr7/task2/server.c | https://raw.githubusercontent.com/ternovskiyegor/OS/364734c/pr7/task2/server.c | ternovskiyegor/OS 364734c pr7/task2/server.c | true | 200 | 2,393 | #include <stdio.h>
#include <stdlib.h>
#include <sys/ipc.h>
#include <sys/shm.h>
#include <sys/sem.h>
#include <unistd.h>
#include <signal.h>
#include <string.h>
#define SHM_SIZE 1024
#define SHM_KEY 2023
#define SEM_KEY 2023
union semnum {
int val;
struct semid_ds *buf;
unsigned short * array;
} sem_arg;... | 4 |
nada445/alx-low_level_programming | f2cbca4 | 0x0B-malloc_free/0-create_array.c | C | www.github.com/nada445/alx-low_level_programming/tree/main/0x0B-malloc_free/0-create_array.c | https://raw.githubusercontent.com/nada445/alx-low_level_programming/f2cbca4/0x0B-malloc_free/0-create_array.c | nada445/alx-low_level_programming f2cbca4 0x0B-malloc_free/0-create_array.c | true | 200 | 405 | #include "main.h"
#include <stdio.h>
#include <stdlib.h>
/**
* create_array - creating an array
* @size: size of array
* @c: char to initiallize
* Return: array
*/
char *create_array(unsigned int size, char c)
{
char *arr = (char *)malloc(size);
unsigned int i;
if (size == 0)
return (NULL);
if (arr == NULL... | 6 |
Confishua/alx-low_level_programming | ca27cfb | 0x0A-argc_argv/4-add.c | C | www.github.com/Confishua/alx-low_level_programming/tree/main/0x0A-argc_argv/4-add.c | https://raw.githubusercontent.com/Confishua/alx-low_level_programming/ca27cfb/0x0A-argc_argv/4-add.c | Confishua/alx-low_level_programming ca27cfb 0x0A-argc_argv/4-add.c | true | 200 | 426 | #include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
/**
* main - entry point
* @argc: count the items
* @argv: check for positvie values
* Return: sum all positive values
*/
int main(int argc, char *argv[])
{
int i, j, sum = 0;
for (i = 1; i < argc; i++)
{
for (j = 0; argv[i][j] != '\0'; j++)
{
if (!isdigit(arg... | 3 |
l1c4s/Exercicios_C | c7a511b | Lista_Vetores-M/24.c | C | www.github.com/l1c4s/Exercicios_C/tree/main/Lista_Vetores-M/24.c | https://raw.githubusercontent.com/l1c4s/Exercicios_C/c7a511b/Lista_Vetores-M/24.c | l1c4s/Exercicios_C c7a511b Lista_Vetores-M/24.c | true | 200 | 490 | #include <stdio.h>
int main()
{
int i,aluno[10],maior,menor;
float altura[10];
for(i=0;i<10;i++){
scanf("%d",&aluno[i]);
scanf("%f",&altura[i]);
}
maior=0;
menor=0;
for(i=0;i<10;i++){
if(aluno[i]>altura[maior]){
maior = i;
}
if(aluno[i]<a... | 0 |
moshexx/C-linux-DS | fc231ee | ds/test/test_circular_buffer.c | C | www.github.com/moshexx/C-linux-DS/tree/main/ds/test/test_circular_buffer.c | https://raw.githubusercontent.com/moshexx/C-linux-DS/fc231ee/ds/test/test_circular_buffer.c | moshexx/C-linux-DS fc231ee ds/test/test_circular_buffer.c | true | 200 | 2,751 | /*****************************************************************************
*
* Worksheet: test_circular_buffer.c
* Author: Moshe Cohen
* Reviewer:
* Date: 4.11.2020
*
*****************************************************************************/
#include <stdio.h>
#include <string.h>
#include "circular_buffer.... | 2 |
Soid23/printf | 2efb22c | print_rot.c | C | www.github.com/Soid23/printf/tree/main/print_rot.c | https://raw.githubusercontent.com/Soid23/printf/2efb22c/print_rot.c | Soid23/printf 2efb22c print_rot.c | true | 200 | 602 | #include "main.h"
/**
* print_rot - function that encodes a string rot13
* @arg: the string to be encoded
* Return: the encoded string
*/
int print_rot(va_list arg)
{
int a, b;
int h = 0;
char *str = va_arg(arg, char *);
char c[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
char d[] = "NOPQRSTU... | 4 |
ClementDaguenet/SNIR2 | 31a7f19 | IPCs/C/TD3/signaux/td3/exo2.c | C | www.github.com/ClementDaguenet/SNIR2/tree/main/IPCs/C/TD3/signaux/td3/exo2.c | https://raw.githubusercontent.com/ClementDaguenet/SNIR2/31a7f19/IPCs/C/TD3/signaux/td3/exo2.c | ClementDaguenet/SNIR2 31a7f19 IPCs/C/TD3/signaux/td3/exo2.c | true | 200 | 1,055 | // td3 exo 2
#include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include <signal.h>
#include <unistd.h>
#include <string.h>
#include <errno.h>
// fonction de traitement du signal SIGUSR1
void traitement(int sig) {
(void) signal(SIGUSR1, traitement);
printf("un signal SIGUSR1 je suis pid :%d\n", get... | 3 |
gulmezzeynep/C | 47496e1 | muratyucedag/ders14/ornek1.c | C | www.github.com/gulmezzeynep/C/tree/main/muratyucedag/ders14/ornek1.c | https://raw.githubusercontent.com/gulmezzeynep/C/47496e1/muratyucedag/ders14/ornek1.c | gulmezzeynep/C 47496e1 muratyucedag/ders14/ornek1.c | true | 200 | 236 | //1 ile 10 arasındaki sayıları while döngüsü ile listeleyen c kodları.
#include <stdio.h>
#include<stdlib.h>
int main()
{
int i;
i=1;
while(i<=10)
{
printf("%d\n", i);
i++;
}
return 0;
} | 6 |
ajay9381/DSC-Projects | 1336da1 | lab8/trap_omp1_critical.c | C | www.github.com/ajay9381/DSC-Projects/tree/main/lab8/trap_omp1_critical.c | https://raw.githubusercontent.com/ajay9381/DSC-Projects/1336da1/lab8/trap_omp1_critical.c | ajay9381/DSC-Projects 1336da1 lab8/trap_omp1_critical.c | true | 200 | 1,340 | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <omp.h>
int main(int argc, char **argv) {
if (argc != 2) {
fprintf(stderr, "Usage: %s <N>\n", argv[0]);
return 1;
}
int N = atoi(argv[1]); // convert command-line input to N = number of points
if (N <= 1) {
fprin... | 0 |
rokid-cd/RKExpert_Foton | b4ff368 | RKExpert_Foton/Classes/Include/lemon/mtc/mtc_sgw.h | C | www.github.com/rokid-cd/RKExpert_Foton/tree/main/RKExpert_Foton/Classes/Include/lemon/mtc/mtc_sgw.h | https://raw.githubusercontent.com/rokid-cd/RKExpert_Foton/b4ff368/RKExpert_Foton/Classes/Include/lemon/mtc/mtc_sgw.h | rokid-cd/RKExpert_Foton b4ff368 RKExpert_Foton/Classes/Include/lemon/mtc/mtc_sgw.h | true | 200 | 13,079 | /************************************************************************
Copyright (c) 2005-2011 by Juphoon System Software, Inc.
All rights reserved.
This software is confidential and proprietary to Juphoon System,
Inc. No part of this software may be reproduced, stored, tra... | 1 |
smart9205/EmotionDetectionBoard | b87611d | imp-t40/samples/libimp-samples/sample-Encoder-h264-jpeg.c | C | www.github.com/smart9205/EmotionDetectionBoard/tree/main/imp-t40/samples/libimp-samples/sample-Encoder-h264-jpeg.c | https://raw.githubusercontent.com/smart9205/EmotionDetectionBoard/b87611d/imp-t40/samples/libimp-samples/sample-Encoder-h264-jpeg.c | smart9205/EmotionDetectionBoard b87611d imp-t40/samples/libimp-samples/sample-Encoder-h264-jpeg.c | true | 200 | 8,173 | /*
* sample-Encoder-h264-jpeg.c
*
* Copyright (C) 2014 Ingenic Semiconductor Co.,Ltd
*
* The specific description of all APIs called in this file can be viewed in the header file in the proj/sdk-lv3/include/api/cn/imp/ directory
*
* Step.1 System init System initialization
* @code
* memset(&sensor_info, 0, ... | 2 |
tanim1823/cse-lap | 7c40f92 | lab 6/4.c | C | www.github.com/tanim1823/cse-lap/tree/main/lab 6/4.c | https://raw.githubusercontent.com/tanim1823/cse-lap/7c40f92/lab%206/4.c | tanim1823/cse-lap 7c40f92 lab 6/4.c | true | 200 | 695 | #include <stdio.h>
#include <math.h>
int main()
{
int n, count = 0;
float sum = 0, mean = 0;
printf("How many elements you want to insert: ");
scanf("%d", &n);
int elements[n];
for (int i = 0; i < n; i++)
{
printf("Enter %d no index element: ", i);
/** takes input from user ... | 4 |
abhisvvv/ch-2.c | 4fe7bcd | 4-associativity.c | C | www.github.com/abhisvvv/ch-2.c/tree/main/4-associativity.c | https://raw.githubusercontent.com/abhisvvv/ch-2.c/4fe7bcd/4-associativity.c | abhisvvv/ch-2.c 4fe7bcd 4-associativity.c | true | 200 | 359 | #include <stdio.h>
int main()
{
int a = 3;
int b = 6;
int c = 9;
printf("the value is %d\n", a * b / c + 7);
printf("the value is %d\n", 3 * b / 2 * c + 7 * a);
// 3 * b / 2 * c + 7 * a
// 3 * b / 2 * c + 21
// 18/2*c + 21
// 9*c + 21
// 81*21
//... | 3 |
russpv/solong | 1b202ff | utils2.c | C | www.github.com/russpv/solong/tree/main/utils2.c | https://raw.githubusercontent.com/russpv/solong/1b202ff/utils2.c | russpv/solong 1b202ff utils2.c | true | 200 | 1,912 | #include "solong.h"
t_img new_sprite(void *a, char *b);
int on_a_loot(t_app *a, t_pos b);
int remove_loot(t_app *a, int b, int c);
void init_sprites(t_app *a);
int check_map_walled(t_app*a);
t_img new_sprite(void *ptr, char *filename)
{
t_img img;
img.xpm_ptr = mlx_xpm_file_to_image(ptr, filename, &img.x, ... | 6 |
adilsond/palpite-megasena-chatgpt | db9c601 | palpite.c | C | www.github.com/adilsond/palpite-megasena-chatgpt/tree/main/palpite.c | https://raw.githubusercontent.com/adilsond/palpite-megasena-chatgpt/db9c601/palpite.c | adilsond/palpite-megasena-chatgpt db9c601 palpite.c | true | 200 | 1,288 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <time.h>
int main() {
int i, j, temp, numeros[6];
bool ja_sorteado;
srand(time(0));
printf("Palpite para Mega Sena\n\n");
printf("As dezenas sorteadas são: ");
// Gerando e imprimindo números aleatórios
for (i = 0; i < 6... | 0 |
slap-flop/slap-artifacts | d588f69 | slap/training-window.c | C | www.github.com/slap-flop/slap-artifacts/tree/main/slap/training-window.c | https://raw.githubusercontent.com/slap-flop/slap-artifacts/d588f69/slap/training-window.c | slap-flop/slap-artifacts d588f69 slap/training-window.c | true | 200 | 9,556 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/mman.h>
#include <time.h>
#include <sys/sysctl.h>
inline __attribute__((always_inline)) void serialized_flush(void *ptr)
{
asm volatile("dc civac, %0" : : "r"(ptr) : "memory");
asm volatile("isb");
asm volatile("dsb ish");
}
inline _... | 1 |
reyzmerly/alx-low_level_programming | 86eb39e | 0x17-doubly_linked_lists/5-get_dnodeint.c | C | www.github.com/reyzmerly/alx-low_level_programming/tree/main/0x17-doubly_linked_lists/5-get_dnodeint.c | https://raw.githubusercontent.com/reyzmerly/alx-low_level_programming/86eb39e/0x17-doubly_linked_lists/5-get_dnodeint.c | reyzmerly/alx-low_level_programming 86eb39e 0x17-doubly_linked_lists/5-get_dnodeint.c | true | 200 | 505 | #include "lists.h"
/**
* get_dnodeint_at_index - do Returns the
* nth node of a dlistint_t linked list
*
* @head: TAKE A Head of the List
* @index: PUT THE index of the nth node
* Return: nting to node
*/
dlistint_t *get_dnodeint_at_index(dlistint_t *head, unsigned int index)
{
unsigned int i;
if (head == N... | 2 |
simranjit20001/posix | 4972ec0 | merge_files_alternativo.c | C | www.github.com/simranjit20001/posix/tree/main/merge_files_alternativo.c | https://raw.githubusercontent.com/simranjit20001/posix/4972ec0/merge_files_alternativo.c | simranjit20001/posix 4972ec0 merge_files_alternativo.c | true | 200 | 7,730 | #define _POSIX_C_SOURCE 200809L
#define _POSIX_C_SOURCE 200809L
#include <stdlib.h>
#include <stdio.h>
#include <assert.h>
#include <fcntl.h>
#include <unistd.h>
#include <sys/mman.h>
#include <sys/stat.h>
#include <string.h>
#include <unistd.h>
#define true 1
#define false 0
#define max(a, b) ((a) > (b) ? (a) : (b))... | 4 |
Annihilater/C-Primer-Plus-Exercises-By-Myself | a06f41d | chapter_10/10_13_6.c | C | www.github.com/Annihilater/C-Primer-Plus-Exercises-By-Myself/tree/main/chapter_10/10_13_6.c | https://raw.githubusercontent.com/Annihilater/C-Primer-Plus-Exercises-By-Myself/a06f41d/chapter_10/10_13_6.c | Annihilater/C-Primer-Plus-Exercises-By-Myself a06f41d chapter_10/10_13_6.c | true | 200 | 1,097 | //
// Created by klause on 2020/6/27.
//
#include <stdio.h>
void helper(double [], int);
int main(void) {
double ar[] = {1, 2, 20, 4, 5, 6};
printf("The old array is:\n");
for (int i = 0; i < 6; ++i) {
printf("%.2f ", ar[i]);
}
helper(ar, 6);
printf("\nThe new array is:\n");
fo... | 3 |
Akpo1705/WS | 83f986b | module.c | C | www.github.com/Akpo1705/WS/tree/main/module.c | https://raw.githubusercontent.com/Akpo1705/WS/83f986b/module.c | Akpo1705/WS 83f986b module.c | true | 200 | 6,300 | #include "module.h"
void module_clear(struct SERVER_STATE *ss)
{
memset(ss, 0, sizeof(*ss));
}
int module_start(struct SERVER_STATE *ss){
INFO(NOTIFY, 0, "запуск "MODULE_INFO"...");
INFO(IMPORTANT, CODE_COMMON_INFO_VERSION, "Версия %s %d", MODULE_VERSION, MODULE_RELEASE);
INFO(NOTIFY, 0, "Интервал обработки собы... | 6 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.