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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
russiankikorik/StructProg | d16acdd | parentheses_balance/check_parentheses.c | C | www.github.com/russiankikorik/StructProg/tree/main/parentheses_balance/check_parentheses.c | https://raw.githubusercontent.com/russiankikorik/StructProg/d16acdd/parentheses_balance/check_parentheses.c | russiankikorik/StructProg d16acdd parentheses_balance/check_parentheses.c | true | 200 | 2,174 | #include <string.h>
#include <stdlib.h>
int is_parentheses(char sym, char parentheses[]) {
int is = 0;
if (strchr(parentheses, sym) != NULL) {
is = 1;
}
return is;
}
int is_opening(char sym, char parentheses[]) {
int is = 1;
int ind = strchr(parentheses, sym) - parentheses;
if (ind... | 1 |
yukiCodesStuff/LLM-Code-Vuln-Detection | c146e14 | data_samples/use/wild_samples_shorter/linux_samples/1eff70a9abd46f175defafd29bc17ad456f398a7/kvm_main_before.c | C | www.github.com/yukiCodesStuff/LLM-Code-Vuln-Detection/tree/main/data_samples/use/wild_samples_shorter/linux_samples/1eff70a9abd46f175defafd29bc17ad456f398a7/kvm_main_before.c | https://raw.githubusercontent.com/yukiCodesStuff/LLM-Code-Vuln-Detection/c146e14/data_samples/use/wild_samples_shorter/linux_samples/1eff70a9abd46f175defafd29bc17ad456f398a7/kvm_main_before.c | yukiCodesStuff/LLM-Code-Vuln-Detection c146e14 data_samples/use/wild_samples_shorter/linux_samples/1eff70a9abd46f175defafd29bc17ad456f398a7/kvm_main_before.c | true | 200 | 841 | }
EXPORT_SYMBOL_GPL(gfn_to_page);
static int __kvm_map_gfn(struct kvm_memory_slot *slot, gfn_t gfn,
struct kvm_host_map *map)
{
kvm_pfn_t pfn;
void *hva = NULL;
struct page *page = KVM_UNMAPPED_PAGE;
if (!map)
return -EINVAL;
return 0;
}
int kvm_vcpu_map(struct kvm_vcpu *vcpu, gfn_t gfn, struct kvm_host_... | 6 |
moifore/alx-low_level_programming | 4786255 | 0x13-more_singly_linked_lists/2-add_nodeint.c | C | www.github.com/moifore/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/2-add_nodeint.c | https://raw.githubusercontent.com/moifore/alx-low_level_programming/4786255/0x13-more_singly_linked_lists/2-add_nodeint.c | moifore/alx-low_level_programming 4786255 0x13-more_singly_linked_lists/2-add_nodeint.c | true | 200 | 449 | #include "lists.h"
/**
* add_nodeint - Adds a new node at the beginning of a listint_t list
*
* @head: A pointer to the address of the head of linked list
* @n: Integer for the new node
* Return: The value of the new node added
*/
listint_t *add_nodeint(listint_t **head, const int n)
{
listint_t *new;
new = ... | 0 |
portegys/GrammaticalChannels | 55ea3d8 | chtst1.c | C | www.github.com/portegys/GrammaticalChannels/tree/main/chtst1.c | https://raw.githubusercontent.com/portegys/GrammaticalChannels/55ea3d8/chtst1.c | portegys/GrammaticalChannels 55ea3d8 chtst1.c | true | 200 | 1,207 | #include "chdefs.h"
#include "callp.h"
#include "route.h"
main() {
int i;
char chan[STRSIZE],pr[STRSIZE],msg[STRSIZE];
int chend;
int func,pstat,mtype;
printf("pid=%d\n",getpid());
i = chcreat(ROUTCH);
printf("route chcreat=%d\n",i);
sleep(15);
i = chcreat(ORIGCH);
printf("orig chcreat=%d\n",i);
sleep(15);
i = system(... | 3 |
flatwaze/Lessons | 26b38f5 | Lesson6/21.c | C | www.github.com/flatwaze/Lessons/tree/main/Lesson6/21.c | https://raw.githubusercontent.com/flatwaze/Lessons/26b38f5/Lesson6/21.c | flatwaze/Lessons 26b38f5 Lesson6/21.c | true | 200 | 719 | #include <stdio.h>
#include <stdlib.h>
#define MAX 100
int main(void){
int num, len, q, count, tmp;
int arr[MAX];
FILE *in;
in = fopen("data/input.txt", "r");
len = 0;
while((q = fscanf(in, "%d", &num)) == 1){
arr[len] = num;
len++;
}
if(q == 0) return -1;
/*Возм... | 7 |
sekne18/42-Common-Core | 9bd1b4d | miniRT/src/raytracer/camera_translations.c | C | www.github.com/sekne18/42-Common-Core/tree/main/miniRT/src/raytracer/camera_translations.c | https://raw.githubusercontent.com/sekne18/42-Common-Core/9bd1b4d/miniRT/src/raytracer/camera_translations.c | sekne18/42-Common-Core 9bd1b4d miniRT/src/raytracer/camera_translations.c | true | 200 | 1,435 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* camera_translations.c :+: :+: :+: ... | 5 |
chizuchizu/ee_3j | 9a7ceb7 | i2c/bmp180.c | C | www.github.com/chizuchizu/ee_3j/tree/main/i2c/bmp180.c | https://raw.githubusercontent.com/chizuchizu/ee_3j/9a7ceb7/i2c/bmp180.c | chizuchizu/ee_3j 9a7ceb7 i2c/bmp180.c | true | 200 | 13,745 | #include <pigpiod_if2.h>
#include <stdio.h>
#include <pthread.h>
#include <stdlib.h>
#include <string.h>
// コンパイル方法（bmp180.c をコンパイルして bmp180 を生成する例）
// gcc -Wall -pthread -o bmp180 bmp180.c -lpigpiod_if2 -lrt
// I2C バス番号
#define I2CBUS 1
// BMP180 のI2C インタフェースのアドレス
// 確認方法：i2cdetect -y 1
#define BMP180ADDR 0x77
// レジスタ... | 2 |
lteixeira93/embedded | 6aac6a0 | data_structures/hackerhank/Basic/xx-binary_search_tree.c | C | www.github.com/lteixeira93/embedded/tree/main/data_structures/hackerhank/Basic/xx-binary_search_tree.c | https://raw.githubusercontent.com/lteixeira93/embedded/6aac6a0/data_structures/hackerhank/Basic/xx-binary_search_tree.c | lteixeira93/embedded 6aac6a0 data_structures/hackerhank/Basic/xx-binary_search_tree.c | true | 200 | 4,713 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
typedef struct treenode
{
int value;
struct treenode *left, *right;
} treenode;
/* Print functions */
void printInorder(treenode* node);
void printPreorder(treenode* node);
void printPostorder(treenode* node);
void print_tree(treenode *root);
void pr... | 4 |
andresantos110/pokeristars-prog | 73203ce | Poker - Project and Tests/game.c.save | C | www.github.com/andresantos110/pokeristars-prog/tree/main/Poker - Project and Tests/game.c.save | https://raw.githubusercontent.com/andresantos110/pokeristars-prog/73203ce/Poker%20-%20Project%20and%20Tests/game.c.save | andresantos110/pokeristars-prog 73203ce Poker - Project and Tests/game.c.save | true | 200 | 1,113 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "global.h"
#include "game.h"
void game(char *filename)
{
int i,j;
char deck[19],abc[3];
FILE *fp;
player player[2];
if ((fp = fopen(filename,"r")) == NULL )
{
fprintf(stdout,"-1");
return;
... | 1 |
Asuma9/alx-low_level_programming | 282eaaf | 0x14-bit_manipulation/3-set_bit.c | C | www.github.com/Asuma9/alx-low_level_programming/tree/main/0x14-bit_manipulation/3-set_bit.c | https://raw.githubusercontent.com/Asuma9/alx-low_level_programming/282eaaf/0x14-bit_manipulation/3-set_bit.c | Asuma9/alx-low_level_programming 282eaaf 0x14-bit_manipulation/3-set_bit.c | true | 200 | 391 | #include "main.h"
/**
**set_bit - sets value of bit to 1 at given index
**@n: int pointer to bit to be set to 1
**@index: index position of bit to be set to 1
**Return: 1 if success, -1 if error
*/
int set_bit(unsigned long int *n, unsigned int index)
{
unsigned long int bit;
if (index >= (sizeof(*n) * 8))
{
... | 6 |
Vitorlas-Devs/notes | d9c5b0f | 1/1 Imp Prog/3/kötelezők/1.c | C | www.github.com/Vitorlas-Devs/notes/tree/main/1/1 Imp Prog/3/kötelezők/1.c | https://raw.githubusercontent.com/Vitorlas-Devs/notes/d9c5b0f/1/1%20Imp%20Prog/3/k%C3%B6telez%C5%91k/1.c | Vitorlas-Devs/notes d9c5b0f 1/1 Imp Prog/3/kötelezők/1.c | true | 200 | 589 | #include <stdio.h>
void printSize(char *typeName, size_t size)
{
printf("type: %s\t\tsize: %d\n", typeName, size);
}
int main()
{
char *types[] = {"int", "long int", "unsigned int", "unsigned long int", "char", "_Bool", "float", "double", "long double"};
size_t sizes[] = {sizeof(int), sizeof(long int), sizeof(u... | 0 |
rayankb92/holbertonschool-low_level_programming | 313a55d | functions_nested_loops/9-times_table.c | C | www.github.com/rayankb92/holbertonschool-low_level_programming/tree/main/functions_nested_loops/9-times_table.c | https://raw.githubusercontent.com/rayankb92/holbertonschool-low_level_programming/313a55d/functions_nested_loops/9-times_table.c | rayankb92/holbertonschool-low_level_programming 313a55d functions_nested_loops/9-times_table.c | true | 200 | 445 | #include "main.h"
#include <unistd.h>
/**
* times_table - prints multiple of 1 to 10
* Return: void
*/
void times_table(void)
{
int i, b, c;
for (i = 0; i < 10; i++)
{
_putchar('0');
for (b = 1; b < 10; b++)
{
c = i * b;
_putchar(',');
_putchar(' ');
if (c < 10)
{
_putchar(' ');
_put... | 3 |
firewbel33/alx-low_level_programming | b161631 | 0x02-functions_nested_loops/4-isalpha.c | C | www.github.com/firewbel33/alx-low_level_programming/tree/main/0x02-functions_nested_loops/4-isalpha.c | https://raw.githubusercontent.com/firewbel33/alx-low_level_programming/b161631/0x02-functions_nested_loops/4-isalpha.c | firewbel33/alx-low_level_programming b161631 0x02-functions_nested_loops/4-isalpha.c | true | 200 | 263 | #include "main.h"
/**
* _isalpha - checks for alphabetic chracters
*
* @c: The character to be checked
* Return: 1 if c is a letter, 0 character
*/
int _isalpha(int c)
{
if ((c >= 65 && c <= 97) || (c >= 97 && c <= 122))
{
return (1);
}
return (0);
}
| 7 |
Arthvrr/Bank-Manager | f6540e2 | main.c | C | www.github.com/Arthvrr/Bank-Manager/tree/main/main.c | https://raw.githubusercontent.com/Arthvrr/Bank-Manager/f6540e2/main.c | Arthvrr/Bank-Manager f6540e2 main.c | true | 200 | 7,364 | #include "main.h"
int transactions_num = 0;
int num_accounts = 0;
BankAccount *accounts = NULL; //liste des comptes avec leur montant
void open_account(int account_id){
//si id du compte incorrect
if (account_id < 0 || account_id >= num_accounts) {
fprintf(stderr, "Erreur : ID de compte invalide ... | 5 |
Antsukemmytech/monty | ae44378 | main.c | C | www.github.com/Antsukemmytech/monty/tree/main/main.c | https://raw.githubusercontent.com/Antsukemmytech/monty/ae44378/main.c | Antsukemmytech/monty ae44378 main.c | true | 200 | 1,636 | #include "monty.h"
global_t vglo;
/**
* ovgloVide - frees the global variables
*
* Return: void
*/
void ovgloVide(void)
{
linkedVide(vglo.head);
free(vglo.bfr);
fclose(vglo.fd);
}
/**
* start_vglo - int global varibal
* @fd: file descriptor
* Return: void
*/
void start_vglo(FILE *fd)
{
vglo.ourLf = 1;
v... | 2 |
kpatsakis/primevul6 | c987217 | 126434.c | C | www.github.com/kpatsakis/primevul6/tree/main/126434.c | https://raw.githubusercontent.com/kpatsakis/primevul6/c987217/126434.c | kpatsakis/primevul6 c987217 126434.c | true | 200 | 5,222 | void CLASS parse_exif (int base)
{
unsigned kodak, entries, tag, type, len, save, c;
double expo,ape;
kodak = !strncmp(make,"EASTMAN",7) && tiff_nifds < 3;
entries = get2();
if(!strncmp(make,"Hasselblad",10) && (tiff_nifds > 3) && (entries > 512)) return;
#ifdef LIBRAW_LIBRARY_BUILD
INT64 fsize = ifp->size... | 4 |
LauraVrkmp/king-c-programming | 3eff075 | Chapter 09/9.3.10.c | C | www.github.com/LauraVrkmp/king-c-programming/tree/main/Chapter 09/9.3.10.c | https://raw.githubusercontent.com/LauraVrkmp/king-c-programming/3eff075/Chapter%2009/9.3.10.c | LauraVrkmp/king-c-programming 3eff075 Chapter 09/9.3.10.c | true | 200 | 450 | int largest(int a[], int n)
{
int large = 0, i;
for (i = 0; i < n; i++) {
if (a[i] > large)
large = a[i];
}
return large;
}
float average(int a[], int n)
{
int sum = 0, i;
for (i = 0; i < n; i++) {
sum += a[i];
}
return sum / n;
}
int positive(int a[], i... | 1 |
ClipsLemon/Eltex_-_1 | 814fb6f | Task_9/2/src/ChangePath.c | C | www.github.com/ClipsLemon/Eltex_-_1/tree/main/Task_9/2/src/ChangePath.c | https://raw.githubusercontent.com/ClipsLemon/Eltex_-_1/814fb6f/Task_9/2/src/ChangePath.c | ClipsLemon/Eltex_-_1 814fb6f Task_9/2/src/ChangePath.c | true | 200 | 729 | #include "../main.h"
void PathDeleteDir(char *path) {
if (strcmp(path, "/")) {
int last_slash = 0;
for (int i = 0; path[i]; i++) {
if (path[i] == '/') {
last_slash = i;
}
}
// если мы стоим на папке /home к примеру, то надо перейти в /, значит / не
// должно быть затерто
i... | 6 |
vgfree/libkv | 6a60a08 | test/ut_set.c | C | www.github.com/vgfree/libkv/tree/main/test/ut_set.c | https://raw.githubusercontent.com/vgfree/libkv/6a60a08/test/ut_set.c | vgfree/libkv 6a60a08 test/ut_set.c | true | 200 | 5,480 | #include "ut_public.h"
void case_cmd_set_normal()
{
kv_handler_t *handler;
char cmd[1024];
kv_answer_t *ans;
handler = kv_create(NULL);
_case_answer_string_equal(handler, "set key value", "OK");
_case_answer_string_equal(handler, "set key value", "OK");
_case_answer_string_equal(handler, "se... | 0 |
kunalll123/C-CPP | 00832b8 | NumberSystemProblems/StrongNum.c | C | www.github.com/kunalll123/C-CPP/tree/main/NumberSystemProblems/StrongNum.c | https://raw.githubusercontent.com/kunalll123/C-CPP/00832b8/NumberSystemProblems/StrongNum.c | kunalll123/C-CPP 00832b8 NumberSystemProblems/StrongNum.c | true | 200 | 392 | #include<stdio.h>
void main(){
int num;
int sum=0,temp,digit,fact;
printf("Enter the number:\n");
scanf("%d",&num);
temp = num;
while(temp != 0){
digit = temp % 10;
fact = 1;
for(int i=1; i<=digit; i++){
fact *= i;
}
sum += fact;
temp /= 10;
}
if(sum == num){
printf("%d is a strong numb... | 3 |
Redemta/alx-low_level_programming | 8af8b8d | 0x13-more_singly_linked_lists/9-insert_nodeint.c | C | www.github.com/Redemta/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/9-insert_nodeint.c | https://raw.githubusercontent.com/Redemta/alx-low_level_programming/8af8b8d/0x13-more_singly_linked_lists/9-insert_nodeint.c | Redemta/alx-low_level_programming 8af8b8d 0x13-more_singly_linked_lists/9-insert_nodeint.c | true | 200 | 850 | #include "lists.h"
/**
* insert_nodeint_at_index - function to insert new node at a given position.
* @head: pointer to the pointer to the head of the list.
* @idx: index where new node is added, start from 0.
* @n: data to be stored at new node.
* Return: Address of new node, if fails, NULL.
*/
listint_t *inse... | 5 |
Leoric0730/UCLA_CS33 | fca918f | ParellelLab/parallel_phase3.c | C | www.github.com/Leoric0730/UCLA_CS33/tree/main/ParellelLab/parallel_phase3.c | https://raw.githubusercontent.com/Leoric0730/UCLA_CS33/fca918f/ParellelLab/parallel_phase3.c | Leoric0730/UCLA_CS33 fca918f ParellelLab/parallel_phase3.c | true | 200 | 1,138 | #include <stdlib.h>
#include <stdio.h>
#include <omp.h>
#include "utils.h"
//This code is NOT buggy, just sequential. Speed it up.
void parallel_convolution(long img[DIM_ROW+PAD][DIM_COL+PAD][DIM_RGB], long kernel[DIM_KERNEL][DIM_KERNEL], long ***convolved_img) {
int row, col, pixel, kernel_row, kernel_col;
... | 4 |
Calleaum/Piscine42 | 82c9485 | entrainement exam/max.c | C | www.github.com/Calleaum/Piscine42/tree/main/entrainement exam/max.c | https://raw.githubusercontent.com/Calleaum/Piscine42/82c9485/entrainement%20exam/max.c | Calleaum/Piscine42 82c9485 entrainement exam/max.c | true | 200 | 500 | int max(int *tab, unsigned int len)
{
int result;
unsigned int i = 0;
if (len == 0)
return (0);
result = tab[i];
while(i < len)
{
if (result < tab[i])
result = tab[i];
i++;
}
return result;
}
// Write the following function:
// int max(int* tab, unsigned int len);
// The first parameter is an ar... | 6 |
MorpKnight/Pemrograman-Lanjutan | 4a61ff6 | Modul 7/TP6.c | C | www.github.com/MorpKnight/Pemrograman-Lanjutan/tree/main/Modul 7/TP6.c | https://raw.githubusercontent.com/MorpKnight/Pemrograman-Lanjutan/4a61ff6/Modul%207/TP6.c | MorpKnight/Pemrograman-Lanjutan 4a61ff6 Modul 7/TP6.c | true | 200 | 2,635 | #include <stdio.h>
#include <stdlib.h>
typedef struct node {
int data;
struct node *next;
} Node;
void sortNode(Node *head){
Node *current = head;
Node *next = NULL;
int temp;
if(head == NULL){
return;
} else {
while(current != NULL){
next = current->next;
... | 0 |
oladim/alx-low_level_programming | 12ce66d | 0x00-hello_world/4-puts.c | C | www.github.com/oladim/alx-low_level_programming/tree/main/0x00-hello_world/4-puts.c | https://raw.githubusercontent.com/oladim/alx-low_level_programming/12ce66d/0x00-hello_world/4-puts.c | oladim/alx-low_level_programming 12ce66d 0x00-hello_world/4-puts.c | true | 200 | 258 | #include <stdio.h>
/**
* main - Program to print a string using puts
*
* Return: Always 0 Success
*/
int main(void)
{
/* the program store string value */
char str1[] = "\"Programming is like building a multilingual puzzle";
puts(str1);
return (0);
}
| 1 |
SohOjiambo/alx-low_level_programming | 168ac51 | 0x12-singly_linked_lists/2-add_node.c | C | www.github.com/SohOjiambo/alx-low_level_programming/tree/main/0x12-singly_linked_lists/2-add_node.c | https://raw.githubusercontent.com/SohOjiambo/alx-low_level_programming/168ac51/0x12-singly_linked_lists/2-add_node.c | SohOjiambo/alx-low_level_programming 168ac51 0x12-singly_linked_lists/2-add_node.c | true | 200 | 555 | #include "lists.h"
/**
* add_node - adds a new node at the beginning of a list_t list.
* @head: head of the linked list
* @str: string saved in the new node
*
*Return: address of the new head, NULL on failure
*/
list_t *add_node(list_t **head, const char *str)
{
list_t *new_node;
size_t str_len;
new_node = ... | 3 |
eskadmase/alx-low_level_programming | 930e233 | 0x0A-argc_argv/3-mul.c | C | www.github.com/eskadmase/alx-low_level_programming/tree/main/0x0A-argc_argv/3-mul.c | https://raw.githubusercontent.com/eskadmase/alx-low_level_programming/930e233/0x0A-argc_argv/3-mul.c | eskadmase/alx-low_level_programming 930e233 0x0A-argc_argv/3-mul.c | true | 200 | 416 | #include "main.h"
#include <stdio.h>
#include <stdlib.h>
/**
* main - function that multiplies two numbers
* @argc: number of arguments
* @argv: array with size of argc
*
* Return: 0
*/
int main(int argc, char* argv[])
{
int i, mul;
if (argc > 1)
{
for (i = 1; i < argc; i++)
{
mul = atoi(argv[i-1]) * atoi(... | 2 |
ndsiiecas/NVD-CLONE | 44d93bc | Density-Varied Dataset/vuln_2_2/CVE_2010_1083_VULN_proc_reapurb_new_new.c | C | www.github.com/ndsiiecas/NVD-CLONE/tree/main/Density-Varied Dataset/vuln_2_2/CVE_2010_1083_VULN_proc_reapurb_new_new.c | https://raw.githubusercontent.com/ndsiiecas/NVD-CLONE/44d93bc/Density-Varied%20Dataset/vuln_2_2/CVE_2010_1083_VULN_proc_reapurb_new_new.c | ndsiiecas/NVD-CLONE 44d93bc Density-Varied Dataset/vuln_2_2/CVE_2010_1083_VULN_proc_reapurb_new_new.c | true | 200 | 618 | static int CVE_2010_1083_VULN_proc_reapurb(struct dev_state *ps, void __user *arg)
{
int judge_para1 = 3;
int judge_para = 3;
struct async *as = reap_as(ps);
if (as)
return processcompl(as, (void __user * __user *)arg);
if (signal_pending(current))
if(judge_para1 * 3 < 0) {printf("math doesn't exist!"); }
if(judg... | 7 |
Kaarmouch/Pipex | 25f4098 | info.c | C | www.github.com/Kaarmouch/Pipex/tree/main/info.c | https://raw.githubusercontent.com/Kaarmouch/Pipex/25f4098/info.c | Kaarmouch/Pipex 25f4098 info.c | true | 200 | 2,105 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* info.c :+: :+: :+: ... | 5 |
Sonny-Rameaux/Zappy | 7840c0a | src/server/file.c | C | www.github.com/Sonny-Rameaux/Zappy/tree/main/src/server/file.c | https://raw.githubusercontent.com/Sonny-Rameaux/Zappy/7840c0a/src/server/file.c | Sonny-Rameaux/Zappy 7840c0a src/server/file.c | true | 200 | 754 | /*
** EPITECH PROJECT, 2024
** B-NWP-400-MAR-4-1-myftp-vincent.montero-fontaine
** File description:
** file
*/
#include "server.h"
FILE *open_file(char *file_path)
{
FILE *file = fopen(file_path, "r");
if (file == NULL) {
exit(1);
}
return file;
}
void transfer_file(FILE *file, int data_sock... | 4 |
carlos-sancho-ramirez/struct-doc-elf-sample | e036e1d | src/elf_sample.c | C | www.github.com/carlos-sancho-ramirez/struct-doc-elf-sample/tree/main/src/elf_sample.c | https://raw.githubusercontent.com/carlos-sancho-ramirez/struct-doc-elf-sample/e036e1d/src/elf_sample.c | carlos-sancho-ramirez/struct-doc-elf-sample e036e1d src/elf_sample.c | true | 200 | 33,820 | #include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include "sections.h"
#include "program.h"
#include "symbols.h"
#include "parsers.h"
#include "readers.h"
#define HEADER_FILE_SIZE 16
#define HEADERX_FILE_SIZE 48
#define PROGRAM_HEADER_TABLE_ENTRY_FILE_SIZE 56
#define SECTION_HEADER_TABLE_... | 6 |
khadas/npu-nanoq | b945e6f | hal/inc/shared/gc_hal_base_shared.h | C | www.github.com/khadas/npu-nanoq/tree/main/hal/inc/shared/gc_hal_base_shared.h | https://raw.githubusercontent.com/khadas/npu-nanoq/b945e6f/hal/inc/shared/gc_hal_base_shared.h | khadas/npu-nanoq b945e6f hal/inc/shared/gc_hal_base_shared.h | true | 200 | 1,226 | /****************************************************************************
*
* Copyright (c) 2005 - 2022 by Vivante Corp. All rights reserved.
*
* The material in this file is confidential and contains trade secrets
* of Vivante Corporation. This is proprietary information owned by
* Vivante Corporation... | 3 |
brunolucy2023x/monty | 6399b39 | pop.c | C | www.github.com/brunolucy2023x/monty/tree/main/pop.c | https://raw.githubusercontent.com/brunolucy2023x/monty/6399b39/pop.c | brunolucy2023x/monty 6399b39 pop.c | true | 200 | 595 | #include "monty.h"
#include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include <unistd.h>
#include <fcntl.h>
#include <string.h>
#include <ctype.h>
/**
* f_pop - prints the top
* @head: stack head
* @counter: line_number
* creator: Bruno Owino
* email: brunookoth44@gmail.com
* Return: Solution
*/
void ... | 0 |
Albedots/First-Projects | f033e43 | C/calculadora.c | C | www.github.com/Albedots/First-Projects/tree/main/C/calculadora.c | https://raw.githubusercontent.com/Albedots/First-Projects/f033e43/C/calculadora.c | Albedots/First-Projects f033e43 C/calculadora.c | true | 200 | 1,288 | #include <stdio.h>//biblioteca para usar os comandos de entrada e saída.
#include <conio.h>//biblioteca conio, para funcionar o getch.
/* esse programa é uma calculadora basica com capacidade para calcular operações aritméticas simples
de 2 valores */
int main()
{
//declaração das variaveis
char operador;
f... | 1 |
gabikummel/apc1 | 4b1aa96 | praticas/praticas3/08.c | C | www.github.com/gabikummel/apc1/tree/main/praticas/praticas3/08.c | https://raw.githubusercontent.com/gabikummel/apc1/4b1aa96/praticas/praticas3/08.c | gabikummel/apc1 4b1aa96 praticas/praticas3/08.c | true | 200 | 606 | //8. Faça um programa em C que calcule o fatorial de um número inteiro.
#include <stdio.h>
int calcularFatorial(int n) {
if (n == 0 || n == 1)
return 1;
else
return n * calcularFatorial(n - 1);
}
int main() {
int numero, fatorial;
printf("Digite um número inteiro positivo: ");... | 2 |
iamsyedzahid/24K-0015 | 084acd4 | PF LAB/Lab10/task10.c | C | www.github.com/iamsyedzahid/24K-0015/tree/main/PF LAB/Lab10/task10.c | https://raw.githubusercontent.com/iamsyedzahid/24K-0015/084acd4/PF%20LAB/Lab10/task10.c | iamsyedzahid/24K-0015 084acd4 PF LAB/Lab10/task10.c | true | 200 | 2,131 | #include <stdio.h>
#include <string.h>
#define MAX_PACKAGES 100
typedef struct
{
char name[50], destination[50];
int duration, cost, seats_available;
} Package;
void add_package(Package packages[], int *num_packages)
{
printf("Enter Package Name: ");
scanf("%s", packages[*num_packages].name);
pri... | 7 |
dbuturu/alx-low_level_programming | 55d3979 | 0x10-variadic_functions/2-print_strings.c | C | www.github.com/dbuturu/alx-low_level_programming/tree/main/0x10-variadic_functions/2-print_strings.c | https://raw.githubusercontent.com/dbuturu/alx-low_level_programming/55d3979/0x10-variadic_functions/2-print_strings.c | dbuturu/alx-low_level_programming 55d3979 0x10-variadic_functions/2-print_strings.c | true | 200 | 558 | #include "variadic_functions.h"
/**
* print_strings - Prints strings.
* @separator: The string to be printed between the strings.
* @n: The number of strings passed to the function.
*/
void print_strings(const char *separator, const unsigned int n, ...)
{
va_list valist;
int i;
char *str;
va_start(valist, n)... | 5 |
adenlexar/vpp_ip6_ioam_integrity | d8efd6e | src/vnet/gso/gso.h | C | www.github.com/adenlexar/vpp_ip6_ioam_integrity/tree/main/src/vnet/gso/gso.h | https://raw.githubusercontent.com/adenlexar/vpp_ip6_ioam_integrity/d8efd6e/src/vnet/gso/gso.h | adenlexar/vpp_ip6_ioam_integrity d8efd6e src/vnet/gso/gso.h | true | 200 | 10,500 | /*
* Copyright (c) 2019 Cisco and/or its affiliates.
* 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 applicabl... | 4 |
Oldhorse008/leetcode | b895925 | LeetCode_C/409_最长回文数/409.c | C | www.github.com/Oldhorse008/leetcode/tree/main/LeetCode_C/409_最长回文数/409.c | https://raw.githubusercontent.com/Oldhorse008/leetcode/b895925/LeetCode_C/409_%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E6%95%B0/409.c | Oldhorse008/leetcode b895925 LeetCode_C/409_最长回文数/409.c | true | 200 | 655 | #include <stdio.h>
#include <string.h>
int longestPalindrome(char *s) {
int ans = 0;
int leng = strlen(s);
int count[128]; // 有128个字符
for (int i = 0; i < 128; i++) {
count[i] = 0;
}
for (int i = 0; i < leng; i++) {
count[(int)s[i]]++; // 直接使用ASCLL码的位数计数
}
for (int i =... | 6 |
QuentinThierry/embedded_pool | 8a40cab | day09/ex01/uart.c | C | www.github.com/QuentinThierry/embedded_pool/tree/main/day09/ex01/uart.c | https://raw.githubusercontent.com/QuentinThierry/embedded_pool/8a40cab/day09/ex01/uart.c | QuentinThierry/embedded_pool 8a40cab day09/ex01/uart.c | true | 200 | 1,444 | #include "main.h"
void uart_init()
{
const uint16_t baud = F_CPU / (UART_BAUDRATE * 16);
UBRR0H = (baud & 0xff00) >> 8; // set baudrate
UBRR0L = baud & 0xff;
SET(UCSR0B, TXEN0); // set USART mode to transmit
SET(UCSR0B, RXEN0); // set USART mode to recieve
RESET(UCSR0C, UMSEL01); // set asynchronous USART mode
... | 0 |
I-AmDead/Secret-Trails | b7b4e4c | gamedata/shaders/r3/models_weapon_overheat.h | C | www.github.com/I-AmDead/Secret-Trails/tree/main/gamedata/shaders/r3/models_weapon_overheat.h | https://raw.githubusercontent.com/I-AmDead/Secret-Trails/b7b4e4c/gamedata/shaders/r3/models_weapon_overheat.h | I-AmDead/Secret-Trails b7b4e4c gamedata/shaders/r3/models_weapon_overheat.h | true | 200 | 3,214 | uniform float4 L_glowing;
float ra(float2 n) { return frac(sin(dot(n.xy, float2(12.9898, 78.233))) * 43758.5453); }
float4 overheat(float2 uv)
{
// Normalized pixel coordinates (from -1 to 1)
// float2 uv = fragCoord / iResolution.xy * 2.0 - 1.0;
// uv.y *= iResolution.y / iResolution.x;
// Colours w... | 3 |
renesas/iot-reference-rx | accf243 | Projects/test_aws_ether_ck_rx65n_v2/e2studio_ccrx/src/smc_gen/r_tsip_rx/src/targets/rx65n/ip/r_tsip_rx_p63.c | C | www.github.com/renesas/iot-reference-rx/tree/main/Projects/test_aws_ether_ck_rx65n_v2/e2studio_ccrx/src/smc_gen/r_tsip_rx/src/targets/rx65n/ip/r_tsip_rx_p63.c | https://raw.githubusercontent.com/renesas/iot-reference-rx/accf243/Projects/test_aws_ether_ck_rx65n_v2/e2studio_ccrx/src/smc_gen/r_tsip_rx/src/targets/rx65n/ip/r_tsip_rx_p63.c | renesas/iot-reference-rx accf243 Projects/test_aws_ether_ck_rx65n_v2/e2studio_ccrx/src/smc_gen/r_tsip_rx/src/targets/rx65n/ip/r_tsip_rx_p63.c | true | 200 | 22,074 | /**********************************************************************************************************************
* DISCLAIMER
* This software is supplied by Renesas Electronics Corporation and is only intended for use with Renesas products. No
* other uses are authorized. This software is owned by Renesas Ele... | 1 |
jaydenlin231/car-park-simulator | ce7a5ec | carpark_details.h | C | www.github.com/jaydenlin231/car-park-simulator/tree/main/carpark_details.h | https://raw.githubusercontent.com/jaydenlin231/car-park-simulator/ce7a5ec/carpark_details.h | jaydenlin231/car-park-simulator ce7a5ec carpark_details.h | true | 200 | 912 | #pragma once
#include <pthread.h>
// Car Park Configuration
#define LEVELS 5
#define ENTRANCES 5
#define EXITS 5
#define NUM_SPOTS_LVL 10
// Boom Gate States
#define BG_RAISING ('R')
#define BG_OPENED ('O')
#define BG_LOWERING ('L')
#define BG_CLOSED ('C')
#define BG_QUIT ('Q')
// Car Park Component Types
typedef st... | 2 |
iseladeetc/PG1_LEIRT12D_2024_2025 | 5be5ce7 | 2024-12-02_gui/guiExample.c | C | www.github.com/iseladeetc/PG1_LEIRT12D_2024_2025/tree/main/2024-12-02_gui/guiExample.c | https://raw.githubusercontent.com/iseladeetc/PG1_LEIRT12D_2024_2025/5be5ce7/2024-12-02_gui/guiExample.c | iseladeetc/PG1_LEIRT12D_2024_2025 5be5ce7 2024-12-02_gui/guiExample.c | true | 200 | 3,233 | #include <pg/pglib.h>
#define WINDOW_WIDTH 600
#define WINDOW_HEIGHT 400
typedef struct
{
int x;
int y;
int radius;
int dx;
int dy;
RGB color;
} ball_t;
#define MAX_BALLS 32
// ball_t b1;
// ball_t b2;
// ball_t b3;
ball_t balls[MAX_BALLS];
int n_balls;
void ball_init (ball_t *b, int x, ... | 7 |
Tix0n/AdvancedCalculatorGTK | 023be15 | src/backend/stack/stack_sym.c | C | www.github.com/Tix0n/AdvancedCalculatorGTK/tree/main/src/backend/stack/stack_sym.c | https://raw.githubusercontent.com/Tix0n/AdvancedCalculatorGTK/023be15/src/backend/stack/stack_sym.c | Tix0n/AdvancedCalculatorGTK 023be15 src/backend/stack/stack_sym.c | true | 200 | 878 | #include "stack_sym.h"
stack_sym *create_sym() {
stack_sym *head = malloc(sizeof(stack_sym));
head->ptr = NULL;
head->symbol = '\0';
return head;
}
void destroy_sym(stack_sym *stack) {
while (stack->ptr) pop_sym(stack);
free(stack);
stack = NULL;
}
void push_sym(stack_sym *stack, char symbol) {
stack... | 4 |
pavanik29/Day-6-Assignment | d3be56f | Day 6 Assignment.c | C | www.github.com/pavanik29/Day-6-Assignment/tree/main/Day 6 Assignment.c | https://raw.githubusercontent.com/pavanik29/Day-6-Assignment/d3be56f/Day%206%20Assignment.c | pavanik29/Day-6-Assignment d3be56f Day 6 Assignment.c | true | 200 | 898 | #include<stdio.h>
#include<conio.h>
#define MAX_SIZE 5
void binary_search(int[],int);
int main() {
int arr_search[MAX_SIZE], i,element;
printf("\nEnter %d Elements for Searching : \n", MAX_SIZE);
for (i = 0; i < MAX_SIZE; i++)
scanf("%d", &arr_search[i]);
printf("Enter Element to S... | 5 |
chancerose1/wiot-s24-g10 | 14ada2b | lab_5_record_and_text_code/main.c | C | www.github.com/chancerose1/wiot-s24-g10/tree/main/lab_5_record_and_text_code/main.c | https://raw.githubusercontent.com/chancerose1/wiot-s24-g10/14ada2b/lab_5_record_and_text_code/main.c | chancerose1/wiot-s24-g10 14ada2b lab_5_record_and_text_code/main.c | true | 200 | 3,991 | /*
* Copyright (c) 2018 Nordic Semiconductor ASA
*
* SPDX-License-Identifier: LicenseRef-Nordic-5-Clause
*/
#include <zephyr/kernel.h>
#include <zephyr/sys/reboot.h>
#include <nfc_t2t_lib.h>
#include <nfc/ndef/msg.h>
#include <nfc/ndef/text_rec.h>
#include <dk_buttons_and_leds.h>
#define MAX_REC_COUNT 3
#define... | 3 |
jobren95/alx-low_level_programming | ca78749 | 0x0A-argc_argv/4-add.c | C | www.github.com/jobren95/alx-low_level_programming/tree/main/0x0A-argc_argv/4-add.c | https://raw.githubusercontent.com/jobren95/alx-low_level_programming/ca78749/0x0A-argc_argv/4-add.c | jobren95/alx-low_level_programming ca78749 0x0A-argc_argv/4-add.c | true | 200 | 1,060 | #include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include <string.h>
/**
* check_num - check - String there are digit
* @str: array string
* Return: Always 0 (success)
*/
int check_num(char *str)
{
/*Declaring variables*/
unsigned int number;
number = 0;
while (number < strlen(str)) /*number string*/
... | 0 |
CarolineMaritim/alx-low_level_programming | b3ba351 | 0x15-file_io/100-elf_header.c | C | www.github.com/CarolineMaritim/alx-low_level_programming/tree/main/0x15-file_io/100-elf_header.c | https://raw.githubusercontent.com/CarolineMaritim/alx-low_level_programming/b3ba351/0x15-file_io/100-elf_header.c | CarolineMaritim/alx-low_level_programming b3ba351 0x15-file_io/100-elf_header.c | true | 200 | 6,415 | #include <elf.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
#include <stdio.h>
#include <stdlib.h>
void elf_checker(unsigned char *e_ident);
void write_magic(unsigned char *e_ident);
void write_class(unsigned char *e_ident);
void write_data(unsigned char *e_ident);
void write_ve... | 1 |
rshark93/DrawFunctions | 3d5c099 | headers/plot_graph.h | C | www.github.com/rshark93/DrawFunctions/tree/main/headers/plot_graph.h | https://raw.githubusercontent.com/rshark93/DrawFunctions/3d5c099/headers/plot_graph.h | rshark93/DrawFunctions 3d5c099 headers/plot_graph.h | true | 200 | 1,741 | #pragma once
#include "SDL_ttf.h"
#include "linked_list.h"
enum {
dot_radius = 4,
caption_offset_circle_to_text = 10,
caption_offset_delimiter = 40,
graduation_height = 10,
caption_y_label_offset = 30,
caption_margin = 30
};
typedef struct plot_settings_struct {
int screen_width;
int screen_height;
char *pl... | 2 |
agaberr/alx-low_level_programming | fa9765e | 0x08-recursion/3-factorial.c | C | www.github.com/agaberr/alx-low_level_programming/tree/main/0x08-recursion/3-factorial.c | https://raw.githubusercontent.com/agaberr/alx-low_level_programming/fa9765e/0x08-recursion/3-factorial.c | agaberr/alx-low_level_programming fa9765e 0x08-recursion/3-factorial.c | true | 200 | 262 | #include "main.h"
/**
* factorial - factorial of a number
* @n: given number
*
* Return: factorial of the number;
*/
int factorial(int n)
{
if (n < 0)
{
return (-1);
}
else if (n == 0)
{
return (1);
}
else
{
return (n * factorial(n - 1));
}
}
| 7 |
brogsterski/BE-Trottinette | 8731125 | ControleurP_HallEtShuntSensor/src/Main_User.c | C | www.github.com/brogsterski/BE-Trottinette/tree/main/ControleurP_HallEtShuntSensor/src/Main_User.c | https://raw.githubusercontent.com/brogsterski/BE-Trottinette/8731125/ControleurP_HallEtShuntSensor/src/Main_User.c | brogsterski/BE-Trottinette 8731125 ControleurP_HallEtShuntSensor/src/Main_User.c | true | 200 | 4,923 |
/*
!!!! NB : ALIMENTER LA CARTE AVANT DE CONNECTER L'USB !!!
==== Nouvelle version de projet compatible avec Compilateur 6 ===
==== 2024 ===
*/
/*
STRUCTURE DES FICHIERS
COUCHE APPLI :
Main_User.c : programme principal à modifier.
Par défaut le pgm utilise la PWM1 e... | 5 |
JoaoRod03/Stack_Oriented_Interpretor | 01ac273 | code/Main.c | C | www.github.com/JoaoRod03/Stack_Oriented_Interpretor/tree/main/code/Main.c | https://raw.githubusercontent.com/JoaoRod03/Stack_Oriented_Interpretor/01ac273/code/Main.c | JoaoRod03/Stack_Oriented_Interpretor 01ac273 code/Main.c | true | 200 | 2,134 | /*!
* \mainpage Pagina Inicial
*
* \section intro_sec Projeto LI2 (stack)
*
* \subsection 1 Ficheiros:
*
* \include <main.c>
* \include <funcoes.c>
* \include <tipos.h>
*/
/**
* @file main.c
* Contém a função main e importa os restantes modulos.
*/
// Bibliotecas
#include <stdio.h>
#include <stdlib.h>
#inc... | 6 |
whyaaronbailey/adafruit_rp2040_usbh | aba03dd | c1_usbh.c | C | www.github.com/whyaaronbailey/adafruit_rp2040_usbh/tree/main/c1_usbh.c | https://raw.githubusercontent.com/whyaaronbailey/adafruit_rp2040_usbh/aba03dd/c1_usbh.c | whyaaronbailey/adafruit_rp2040_usbh aba03dd c1_usbh.c | true | 200 | 997 | // Copyright 2023 sekigon-gonnoc
// SPDX-License-Identifier: GPL-2.0-or-later
#include "c1.h"
#include "tusb.h"
#include "pio_usb.h"
#include "pio_usb_ll.h"
#include "hardware/sync.h"
// Correct pin definitions for Adafruit Feather RP2040 with USB Host
#define PIO_USB_PIN_DP 16 // D+ on GPIO 16
#define PIN_VBUS ... | 3 |
AbuEyad/42-projects | c9b3ee1 | so_long/game/utils.c | C | www.github.com/AbuEyad/42-projects/tree/main/so_long/game/utils.c | https://raw.githubusercontent.com/AbuEyad/42-projects/c9b3ee1/so_long/game/utils.c | AbuEyad/42-projects c9b3ee1 so_long/game/utils.c | true | 200 | 2,487 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* utils.c :+: :+: :+: ... | 2 |
agungnugrahaid/alpro | af69ade | guided/701.arrayOfADT.c | C | www.github.com/agungnugrahaid/alpro/tree/main/guided/701.arrayOfADT.c | https://raw.githubusercontent.com/agungnugrahaid/alpro/af69ade/guided/701.arrayOfADT.c | agungnugrahaid/alpro af69ade guided/701.arrayOfADT.c | true | 200 | 12,080 | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define MAX_P 5
#define MAX_R 3
typedef char string[255];
typedef struct{
int tgl;
int bln;
int thn;
}Date;
typedef struct{
float tinggi;
float berat;
int umur;
int systole;
int diastole;
}Medcheckup;
typedef struct{
Medcheckup checkup;
int id;
... | 0 |
Rick97h/Programacao-Avancada | d53f553 | Programação avançada/exercício 8.c | C | www.github.com/Rick97h/Programacao-Avancada/tree/main/Programação avançada/exercício 8.c | https://raw.githubusercontent.com/Rick97h/Programacao-Avancada/d53f553/Programa%C3%A7%C3%A3o%20avan%C3%A7ada/exerc%C3%ADcio%208.c | Rick97h/Programacao-Avancada d53f553 Programação avançada/exercício 8.c | true | 200 | 413 | // Ler 6 vetores inteiros e imprimir os valores lidos de forma inversa.
int main() {
int v[TAMANHO];
printf ("(ENTRADA) Digite %d valores\n", TAMANHO);
for (int i=0; i< TAMANHO ;i++) {
printf ("v[%d]: ", i);
scanf ("%d", &v[i]);
}
printf ("\n(SAÍDA) Em ordem inversa:");
for (int... | 7 |
justin-marian/avl-treemap | 391071c | src/include/Cipher.h | C | www.github.com/justin-marian/avl-treemap/tree/main/src/include/Cipher.h | https://raw.githubusercontent.com/justin-marian/avl-treemap/391071c/src/include/Cipher.h | justin-marian/avl-treemap 391071c src/include/Cipher.h | true | 200 | 1,214 | #pragma once
#ifndef _CIPHER_H_
#define _CIPHER_H_
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "AVLTree.h"
#include "Range.h"
// Vigenere keys E(0) / D(26)
#define ENCRYPT 0
#define DECRYPT 26
#define BUFFER_LEN 1024
#define WORD_SEPARATOR ",.? \n\r"
#define TO_UPPER(c) ((c >= 'a' && c <= '... | 4 |
vendor-mtk-sources/Amazon-Fire_HD8_12th_Gen | 00eb737 | src/kernel/mediatek/mt8169/5.4/drivers/misc/mediatek/imgsensor/src/common/v1_1/imgsensor_hw.c | C | www.github.com/vendor-mtk-sources/Amazon-Fire_HD8_12th_Gen/tree/main/src/kernel/mediatek/mt8169/5.4/drivers/misc/mediatek/imgsensor/src/common/v1_1/imgsensor_hw.c | https://raw.githubusercontent.com/vendor-mtk-sources/Amazon-Fire_HD8_12th_Gen/00eb737/src/kernel/mediatek/mt8169/5.4/drivers/misc/mediatek/imgsensor/src/common/v1_1/imgsensor_hw.c | vendor-mtk-sources/Amazon-Fire_HD8_12th_Gen 00eb737 src/kernel/mediatek/mt8169/5.4/drivers/misc/mediatek/imgsensor/src/common/v1_1/imgsensor_hw.c | true | 200 | 5,988 | // SPDX-License-Identifier: GPL-2.0
/*
* Copyright (c) 2019 MediaTek Inc.
*/
#include <linux/delay.h>
#include <linux/string.h>
#include "kd_camera_typedef.h"
#include "kd_camera_feature.h"
#include "imgsensor_sensor.h"
#include "imgsensor_hw.h"
enum IMGSENSOR_RETURN imgsensor_hw_init(struct IMGSENSOR_HW *phw)
{
... | 5 |
wierton/c-preprocessed-testsuite | 43fea1c | gcc.c-torture/compile#pr32355.c | C | www.github.com/wierton/c-preprocessed-testsuite/tree/main/gcc.c-torture/compile#pr32355.c | https://raw.githubusercontent.com/wierton/c-preprocessed-testsuite/43fea1c/gcc.c-torture/compile%23pr32355.c | wierton/c-preprocessed-testsuite 43fea1c gcc.c-torture/compile#pr32355.c | true | 200 | 546 |
typedef struct
{
}
__sigset_t;
typedef struct
{
char coredump;
}
EMode;
extern EMode Mode;
struct sigaction
{
__sigset_t sa_mask;
int sa_flags;
};
doSignalsSetup (void)
{
static const int signals[] = {
1, 2 , 3, 4, 6, 8, 11, 13, 14, 15, 10, 12, 17, 7
};
unsigned int i, sig;
struct sigaction sa;
f... | 6 |
neasher1/C-Programming | 8a51264 | Array/2D or Matrix array/introduction 2d.c | C | www.github.com/neasher1/C-Programming/tree/main/Array/2D or Matrix array/introduction 2d.c | https://raw.githubusercontent.com/neasher1/C-Programming/8a51264/Array/2D%20or%20Matrix%20array/introduction%202d.c | neasher1/C-Programming 8a51264 Array/2D or Matrix array/introduction 2d.c | true | 200 | 318 | #include<stdio.h>
int main()
{
int A[3][4] = { {5,6,7,8},{15,25,35,45},{55,75,85,95} }; //declare & initilization
int row,col;
//printing
for(row=0; row<3; row++)
{
for(col=0; col<4; col++)
{
printf("%d ",A[row][col]);
}
printf("\n");
}
}
| 1 |
Victorjoseph93/alx-low_level_programming | 6133106 | 0x13-more_singly_linked_lists/8-sum_listint.c | C | www.github.com/Victorjoseph93/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/8-sum_listint.c | https://raw.githubusercontent.com/Victorjoseph93/alx-low_level_programming/6133106/0x13-more_singly_linked_lists/8-sum_listint.c | Victorjoseph93/alx-low_level_programming 6133106 0x13-more_singly_linked_lists/8-sum_listint.c | true | 200 | 304 | #include <stdlib.h>
#include "lists.h"
/**
* sum_listint - function that sum all the data
* @head: node
*
* Return: returns nothing
*/
int sum_listint(listint_t *head)
{
int amount = 0;
if (head)
{
while (head)
{
amount += head->n;
head = head->next;
}
}
return (amount);
}
| 2 |
jihyun0105/C_language | 1c95415 | 과제3-기본 입출력과 라이브러리 함수.c | C | www.github.com/jihyun0105/C_language/tree/main/과제3-기본 입출력과 라이브러리 함수.c | https://raw.githubusercontent.com/jihyun0105/C_language/1c95415/%EA%B3%BC%EC%A0%9C3-%EA%B8%B0%EB%B3%B8%20%EC%9E%85%EC%B6%9C%EB%A0%A5%EA%B3%BC%20%EB%9D%BC%EC%9D%B4%EB%B8%8C%EB%9F%AC%EB%A6%AC%20%ED%95%A8%EC%88%98.c | jihyun0105/C_language 1c95415 과제3-기본 입출력과 라이브러리 함수.c | true | 200 | 1,256 | #include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <time.h>
#define PI 3.141592
#pragma warning(disable: 4996) // scanf�� ������ �����ϱ� ����
int main(void)
{
printf(" << 1. �� �� ������ �Ÿ�>>\n");
printf("�� ���� ��ǥ�� �Է�>>");
double x1, y1, x2, y2;
scanf("%lf %lf %lf %lf", &x1, &y... | 7 |
Marrion65/alx-low_level_programming | c38ce87 | 0x00-hello_world/5-printf.c | C | www.github.com/Marrion65/alx-low_level_programming/tree/main/0x00-hello_world/5-printf.c | https://raw.githubusercontent.com/Marrion65/alx-low_level_programming/c38ce87/0x00-hello_world/5-printf.c | Marrion65/alx-low_level_programming c38ce87 0x00-hello_world/5-printf.c | true | 200 | 219 | #include <stdio.h>
/**
* main - A program that prints the size of various computer types
* Return: 0 (sucess)
*/
int main(void)
{
printf("with proper grammar, but the outcome is a piece of art,\n");
return (0);
}
| 3 |
CP-Nelson/IE.2301-Electronique_Signal_Project | a404caf | Mission2/Task3/filter2/temp/codegen/lib/filter2/firls.c | C | www.github.com/CP-Nelson/IE.2301-Electronique_Signal_Project/tree/main/Mission2/Task3/filter2/temp/codegen/lib/filter2/firls.c | https://raw.githubusercontent.com/CP-Nelson/IE.2301-Electronique_Signal_Project/a404caf/Mission2/Task3/filter2/temp/codegen/lib/filter2/firls.c | CP-Nelson/IE.2301-Electronique_Signal_Project a404caf Mission2/Task3/filter2/temp/codegen/lib/filter2/firls.c | true | 200 | 8,467 | /*
* Academic License - for use in teaching, academic research, and meeting
* course requirements at degree granting institutions only. Not for
* government, commercial, or other organizational use.
* File: firls.c
*
* MATLAB Coder version : 23.2
* C/C++ source code generated on : 24-Jan-2024 01:20:... | 0 |
TrizFrogel/C-Codes | ebd3b06 | Cadastro.c | C | www.github.com/TrizFrogel/C-Codes/tree/main/Cadastro.c | https://raw.githubusercontent.com/TrizFrogel/C-Codes/ebd3b06/Cadastro.c | TrizFrogel/C-Codes ebd3b06 Cadastro.c | true | 200 | 1,655 | #include <stdio.h>
#include <stdlib.h>
#include <locale.h>
struct ender{
int cep;
char rua[50];
char bairro[50];
};
struct no{
int cod;
int tel;
char nome[50];
struct ender end;
struct no *anterior;
};
struct no *topo;
void empilhar(){
struct no *novo;
novo=(struct no*)malloc(sizeof(s... | 4 |
VinyC29/TP1TecProg | f09c088 | src/main.c | C | www.github.com/VinyC29/TP1TecProg/tree/main/src/main.c | https://raw.githubusercontent.com/VinyC29/TP1TecProg/f09c088/src/main.c | VinyC29/TP1TecProg f09c088 src/main.c | true | 200 | 1,709 | //Bonne pratique, pour les includes systemes toujours utiliser <> et "" pour les includes de votre projet.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include "definition.h"
#include "inventaire.h"
#define HEAP_SIZE 2048 * 2048 * 4
static uint8_t* heap = NULL;
static size_t heap_top... | 5 |
DineshPanicker/Embedded-C-CPP | bf7f90a | practize_C/Pthread.c | C | www.github.com/DineshPanicker/Embedded-C-CPP/tree/main/practize_C/Pthread.c | https://raw.githubusercontent.com/DineshPanicker/Embedded-C-CPP/bf7f90a/practize_C/Pthread.c | DineshPanicker/Embedded-C-CPP bf7f90a practize_C/Pthread.c | true | 200 | 773 | #include <stdio.h>
#include <pthread.h>
#include <stdlib.h>
#include <unistd.h>
static void *
thread_fn_callback(void *arg)
{
char *input = (char *)arg;
while (1)
{
printf("input string = %s\n", input);
sleep(1);
}
}
void thread1_create()
{
pthread_t pthread1;
static char *thr... | 6 |
Community-PIO-CH32V/framework-zephyr | 2778dcd | include/zephyrboards/drivers/lin.h | C | www.github.com/Community-PIO-CH32V/framework-zephyr/tree/main/include/zephyrboards/drivers/lin.h | https://raw.githubusercontent.com/Community-PIO-CH32V/framework-zephyr/2778dcd/include/zephyrboards/drivers/lin.h | Community-PIO-CH32V/framework-zephyr 2778dcd include/zephyrboards/drivers/lin.h | true | 200 | 11,599 | #ifndef ZEPHYRBOARDS_INCLUDE_DRIVERS_LIN_H_
#define ZEPHYRBOARDS_INCLUDE_DRIVERS_LIN_H_
#include <zephyr/kernel.h>
#include <zephyr/types.h>
#include <zephyr/device.h>
#include <zephyr/sys/util.h>
#ifdef __cplusplus
extern "C" {
#endif
/** @cond INTERNAL_HIDDEN */
#define LIN_ID_MASK 0x3FU
#define LIN_NUM_ID 64U
... | 1 |
nursyazana22/nursyazana22 | a9fb9e1 | PartCQuestion(b).c | C | www.github.com/nursyazana22/nursyazana22/tree/main/PartCQuestion(b).c | https://raw.githubusercontent.com/nursyazana22/nursyazana22/a9fb9e1/PartCQuestion%28b%29.c | nursyazana22/nursyazana22 a9fb9e1 PartCQuestion(b).c | true | 200 | 1,509 | #include <iostream>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <cstring>
int main() {
int clientSocket = socket(AF_INET, SOCK_STREAM, 0);
if (clientSocket == -1) {
std::cerr << "Failed to create socket" << std::endl;
return 1;
}
sockaddr_in serverAdd... | 2 |
gabodinho/minishell | 3905910 | src/parser/parse_pipe.c | C | www.github.com/gabodinho/minishell/tree/main/src/parser/parse_pipe.c | https://raw.githubusercontent.com/gabodinho/minishell/3905910/src/parser/parse_pipe.c | gabodinho/minishell 3905910 src/parser/parse_pipe.c | true | 200 | 1,577 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* parse_pipe.c :+: :+: :+: ... | 7 |
purviharpalani/DSA | e9c15ff | XOR LINKED LIST.c | C | www.github.com/purviharpalani/DSA/tree/main/XOR LINKED LIST.c | https://raw.githubusercontent.com/purviharpalani/DSA/e9c15ff/XOR%20LINKED%20LIST.c | purviharpalani/DSA e9c15ff XOR LINKED LIST.c | true | 200 | 1,028 | #include<stdio.h>
#include<conio.h>
#include<inttypes.h>
#include<stdlib.h>
struct node{
int data;
struct node *npx;
};
struct node *header,*last;
struct node *XOR(struct node *prev,struct node *next)
{
return (struct node *)((uintptr_t)(prev)^(uintptr_t)(next));
}
void create(int val)
{
struct nod... | 0 |
khadas/libencoder | bfee62d | multiEnc/vpuapi/vpuapi.c | C | www.github.com/khadas/libencoder/tree/main/multiEnc/vpuapi/vpuapi.c | https://raw.githubusercontent.com/khadas/libencoder/bfee62d/multiEnc/vpuapi/vpuapi.c | khadas/libencoder bfee62d multiEnc/vpuapi/vpuapi.c | true | 200 | 51,026 |
/*
* Copyright (c) 2019 Amlogic, Inc. All rights reserved.
*
* This source code is subject to the terms and conditions defined in below
* which is part of this source code package.
*
* Description:
*/
// Copyright (C) 2019 Amlogic, Inc. All rights reserved.
//
// All information contained herein is Amlogic confidenti... | 3 |
Hegeldirkk/alx-low_level_programming | 5c04dce | 0x13-more_singly_linked_lists/8-sum_listint.c | C | www.github.com/Hegeldirkk/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/8-sum_listint.c | https://raw.githubusercontent.com/Hegeldirkk/alx-low_level_programming/5c04dce/0x13-more_singly_linked_lists/8-sum_listint.c | Hegeldirkk/alx-low_level_programming 5c04dce 0x13-more_singly_linked_lists/8-sum_listint.c | true | 200 | 266 | #include "lists.h"
#include <stdlib.h>
/**
* sum_listint - Sum
* @head: Addres node of the list.
* Return: Integer.
**/
int sum_listint(listint_t *head)
{
int total = 0;
while (head != NULL)
{
total += head->n;
head = head->next;
}
return (total);
}
| 4 |
adeneye02/alx-low_level_programming | 713247a | 0x06-pointers_arrays_strings/1-strncat.c | C | www.github.com/adeneye02/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/1-strncat.c | https://raw.githubusercontent.com/adeneye02/alx-low_level_programming/713247a/0x06-pointers_arrays_strings/1-strncat.c | adeneye02/alx-low_level_programming 713247a 0x06-pointers_arrays_strings/1-strncat.c | true | 200 | 496 | #include "main.h"
/**
*_strncat - concatenate two strings but add inputted number of bytes
*@dest: string to be appended upon
*@src: string to be completed at end of dest
*@n:integer parameter to compare index to
*Return: returns new concatenated string
*/
char *_strncat(char *dest, char *src, int n)
{
in... | 6 |
evalldore/so_long | ff195e3 | src/game.c | C | www.github.com/evalldore/so_long/tree/main/src/game.c | https://raw.githubusercontent.com/evalldore/so_long/ff195e3/src/game.c | evalldore/so_long ff195e3 src/game.c | true | 200 | 2,384 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* game.c :+: :+: :+: ... | 5 |
Gaetandrt/Sokoban | 6bb3706 | src/main.c | C | www.github.com/Gaetandrt/Sokoban/tree/main/src/main.c | https://raw.githubusercontent.com/Gaetandrt/Sokoban/6bb3706/src/main.c | Gaetandrt/Sokoban 6bb3706 src/main.c | true | 200 | 1,932 | /*
** EPITECH PROJECT, 2022
** fejisdnlkfee
** File description:
** main
*/
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <stdlib.h>
#include <unistd.h>
#include <stdio.h>
#include <ncurses.h>
#include "my_sokoban.h"
char *map_copy_bis(char *buf, map_info_t *map_info, int n)
{
int cpt =... | 1 |
VYMNN47/alx-low_level_programming | e02dcd8 | 0x07-pointers_arrays_strings/3-strspn.c | C | www.github.com/VYMNN47/alx-low_level_programming/tree/main/0x07-pointers_arrays_strings/3-strspn.c | https://raw.githubusercontent.com/VYMNN47/alx-low_level_programming/e02dcd8/0x07-pointers_arrays_strings/3-strspn.c | VYMNN47/alx-low_level_programming e02dcd8 0x07-pointers_arrays_strings/3-strspn.c | true | 200 | 383 | #include "main.h"
/**
* _strspn - a function that gets the length
* of a prefix substring
*
* @s: string
* @accept: bytes
* Return: unsigned int
*/
unsigned int _strspn(char *s, char *accept)
{
unsigned int ert, io;
for (ert = 0; s[ert] != '\0'; ert++)
{
for (io = 0; accept[io] != s[ert]; io++)
{
if ... | 2 |
mdincer34/Libft | b572eab | ft_memmove.c | C | www.github.com/mdincer34/Libft/tree/main/ft_memmove.c | https://raw.githubusercontent.com/mdincer34/Libft/b572eab/ft_memmove.c | mdincer34/Libft b572eab ft_memmove.c | true | 200 | 1,642 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_memmove.c :+: :+: :+: ... | 7 |
med-skyied/alx-low_level_programming | b25d218 | 0x04-more_functions_nested_loops/8-print_square.c | C | www.github.com/med-skyied/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/8-print_square.c | https://raw.githubusercontent.com/med-skyied/alx-low_level_programming/b25d218/0x04-more_functions_nested_loops/8-print_square.c | med-skyied/alx-low_level_programming b25d218 0x04-more_functions_nested_loops/8-print_square.c | true | 200 | 344 | #include "main.h"
/**
* print_square - printing a square.
* @size: the size of the square.
*
* Return: it returns nothing.
*/
void print_square(int size)
{
if (size > 0)
{
int i, j;
for (i = 0; i < size; i++)
{
for (j = 0; j < size; j++)
{
_putchar('#');
}
_putchar('\n');
}
}
else
{
... | 0 |
ndsiiecas/NVD-CLONE | 44d93bc | Grammar-Confused Datset/vuln_suited1/CVE_2012_4184_VULN_ChromeObjectWrapper__get.c | C | www.github.com/ndsiiecas/NVD-CLONE/tree/main/Grammar-Confused Datset/vuln_suited1/CVE_2012_4184_VULN_ChromeObjectWrapper__get.c | https://raw.githubusercontent.com/ndsiiecas/NVD-CLONE/44d93bc/Grammar-Confused%20Datset/vuln_suited1/CVE_2012_4184_VULN_ChromeObjectWrapper__get.c | ndsiiecas/NVD-CLONE 44d93bc Grammar-Confused Datset/vuln_suited1/CVE_2012_4184_VULN_ChromeObjectWrapper__get.c | true | 200 | 776 | bool
CVE_2012_4184_VULN_ChromeObjectWrapper::get(JSContext *cx, JSObject *wrapper, JSObject *receiver,
jsid id, js::Value *vp)
{
// Try the lookup on the base wrapper.
if (!ChromeObjectWrapperBase::get(cx, wrapper, receiver, id, vp))
return false;
// If we found something o... | 4 |
vimalbhoutekar/Data-Structure-Program-Using-C- | c3c0868 | 39_PowerFunction.c | C | www.github.com/vimalbhoutekar/Data-Structure-Program-Using-C-/tree/main/39_PowerFunction.c | https://raw.githubusercontent.com/vimalbhoutekar/Data-Structure-Program-Using-C-/c3c0868/39_PowerFunction.c | vimalbhoutekar/Data-Structure-Program-Using-C- c3c0868 39_PowerFunction.c | true | 200 | 495 | #include <stdio.h>
double power(double a, int b)
{
double result = 1.0;
int i;
if (b < 0)
{
a = 1.0 / a;
b = -b;
}
for (i = 0; i < b; i++)
{
result =result * a;
}
return result;
}
int main()
{
double a, result;
int b;
printf("Enter a number: ... | 6 |
eshant7505/Lab-Practicals | b21884a | Program14.c | C | www.github.com/eshant7505/Lab-Practicals/tree/main/Program14.c | https://raw.githubusercontent.com/eshant7505/Lab-Practicals/b21884a/Program14.c | eshant7505/Lab-Practicals b21884a Program14.c | true | 200 | 597 | #include <stdio.h>
void bubbleSort(int arr[], int n);
int main() {
int arr[] = {64, 34, 25, 12, 22, 11, 90};
int n = sizeof(arr) / sizeof(arr[0]);
bubbleSort(arr, n);
printf("Sorted array: \n");
for (int i = 0; i < n; i++)
printf("%d ", arr[i]);
printf("\n");
return 0;
}
void bubb... | 5 |
Arcidea0/Philosophers | 81a4d2a | init.c | C | www.github.com/Arcidea0/Philosophers/tree/main/init.c | https://raw.githubusercontent.com/Arcidea0/Philosophers/81a4d2a/init.c | Arcidea0/Philosophers 81a4d2a init.c | true | 200 | 2,698 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* init.c :+: :+: :+: ... | 1 |
Srilu16/C-Programs | ef25645 | time.c | C | www.github.com/Srilu16/C-Programs/tree/main/time.c | https://raw.githubusercontent.com/Srilu16/C-Programs/ef25645/time.c | Srilu16/C-Programs ef25645 time.c | true | 200 | 383 | #include<stdio.h>
#include<math.h>
int main()
{
int seconds,hours,minutes,total;// we need only int because no decimals only integer value will be there
printf("Enter the total number of seconds:");
scanf("%d",&total);
hours=total/3600;
minutes=(total%3600)/60;
seconds=(total%3600)%60;
printf("The given time ... | 2 |
aishamidris/Thecjourney | 44fb88b | loops/factorial.c | C | www.github.com/aishamidris/Thecjourney/tree/main/loops/factorial.c | https://raw.githubusercontent.com/aishamidris/Thecjourney/44fb88b/loops/factorial.c | aishamidris/Thecjourney 44fb88b loops/factorial.c | true | 200 | 217 | #include <stdio.h>
int main()
{
int i, c, fact;
printf("Enter a number: ");
scanf("%d", &i);
for (c = 1; c <= i; c--)
fact = i * (i - 1);i--;
{ printf("%d factorial is %d\n", i, fact);
}
return 0;
}
| 7 |
mrobayoba/robotSTM32 | 4568cd0 | PeripheralsDrivers/Src/SysTick_driver_hal.c | C | www.github.com/mrobayoba/robotSTM32/tree/main/PeripheralsDrivers/Src/SysTick_driver_hal.c | https://raw.githubusercontent.com/mrobayoba/robotSTM32/4568cd0/PeripheralsDrivers/Src/SysTick_driver_hal.c | mrobayoba/robotSTM32 4568cd0 PeripheralsDrivers/Src/SysTick_driver_hal.c | true | 200 | 2,769 | /*
* systick_driver_hal.c
*
* Created on: Oct 20, 2023
* Author: mrobayoba
*/
#include "../Inc/SysTick_driver_hal.h"
#include <stm32f4xx.h>
uint64_t ticks = 0;
uint64_t ticks_start = 0;
uint64_t ticks_counting = 0;
static void SysTick_interrupt(Systick_Handler_t *SysTick_Handler);
void SysTick_config_ms... | 0 |
igozdemir/Karabuk_university | c16ffeb | Second Term Programing/lab 5 pointers/dizi elemanlarını değiştirme.c | C | www.github.com/igozdemir/Karabuk_university/tree/main/Second Term Programing/lab 5 pointers/dizi elemanlarını değiştirme.c | https://raw.githubusercontent.com/igozdemir/Karabuk_university/c16ffeb/Second%20Term%20Programing/lab%205%20pointers/dizi%20elemanlar%C4%B1n%C4%B1%20de%C4%9Fi%C5%9Ftirme.c | igozdemir/Karabuk_university c16ffeb Second Term Programing/lab 5 pointers/dizi elemanlarını değiştirme.c | true | 200 | 445 | #include<stdio.h>
int main(){
int array[3];
int *ptr;
int i,a,temp;
printf("lutfen 3 elemanli bir dizi giriniz\n");
for(i=0;i<3;i++){
scanf("%d",&a);
array[i]=a;
}
ptr=array;
printf("\nBEFORE\n");
for(i=0;i<3;i++){
printf("element %d = %d\n",i,*(ptr+i));
}
temp=*ptr;
for(i=0;i<2;i++){
*(ptr+i)=*(ptr... | 4 |
kpatsakis/primevul8 | 48df1b0 | 153173.c | C | www.github.com/kpatsakis/primevul8/tree/main/153173.c | https://raw.githubusercontent.com/kpatsakis/primevul8/48df1b0/153173.c | kpatsakis/primevul8 48df1b0 153173.c | true | 200 | 615 | tar_type_find (GstTypeFind * tf, gpointer unused)
{
const guint8 *data = gst_type_find_peek (tf, 257, 8);
/* of course we are not certain, but we don't want other typefind funcs
* to detect formats of files within the tar archive, e.g. mp3s */
if (data) {
if (memcmp (data, OLDGNU_MAGIC, 8) == 0) { /* sic... | 6 |
GamerNoTitle/Anyview-Programming2024-Reference | a732b60 | Chapter6/CP06EX634.c | C | www.github.com/GamerNoTitle/Anyview-Programming2024-Reference/tree/main/Chapter6/CP06EX634.c | https://raw.githubusercontent.com/GamerNoTitle/Anyview-Programming2024-Reference/a732b60/Chapter6/CP06EX634.c | GamerNoTitle/Anyview-Programming2024-Reference a732b60 Chapter6/CP06EX634.c | true | 200 | 460 | #include "allinclude.h"
int main(int n, int max, int a[6][6])
{ // Add your code here
for (int line = 0; line < n; line++)
{
for (int col = 0; col < n; col++)
{
if (line == 0 && col == 0)
{
max = a[line][col];
continue;
}
... | 5 |
hemant467/C-Projects | c282722 | C 👨💻 /ATM 🏧 Banking System 1 🏦/ATM Banking System Project.c | C | www.github.com/hemant467/C-Projects/tree/main/C 👨💻 /ATM 🏧 Banking System 1 🏦/ATM Banking System Project.c | https://raw.githubusercontent.com/hemant467/C-Projects/c282722/C%20%F0%9F%91%A8%E2%80%8D%F0%9F%92%BB%20/ATM%20%F0%9F%8F%A7%20Banking%20System%201%20%F0%9F%8F%A6/ATM%20Banking%20System%20Project.c | hemant467/C-Projects c282722 C 👨💻 /ATM 🏧 Banking System 1 🏦/ATM Banking System Project.c | true | 200 | 10,862 | /*ATM Banking System Project Using C*/
#include<stdio.h>
#include<windows.h>
#include<time.h>
#include<string.h>
#define MAX_TRANSACTIONS 100 // Maximum number of transactions to store
// Structure to store transaction details
struct Transaction {
char type[10]; // Type of transaction (Withdraw... | 1 |
Enes-berke/Programming-Languages | 076c3dc | C-Programlama-Turkish/AB 19.2 (#ifdef--#else--#endif kullanımı)/main.c | C | www.github.com/Enes-berke/Programming-Languages/tree/main/C-Programlama-Turkish/AB 19.2 (#ifdef--#else--#endif kullanımı)/main.c | https://raw.githubusercontent.com/Enes-berke/Programming-Languages/076c3dc/C-Programlama-Turkish/AB%2019.2%20%28%23ifdef--%23else--%23endif%20kullan%C4%B1m%C4%B1%29/main.c | Enes-berke/Programming-Languages 076c3dc C-Programlama-Turkish/AB 19.2 (#ifdef--#else--#endif kullanımı)/main.c | true | 200 | 638 | #include <stdio.h>
#include <stdlib.h>
#define PI 3.14
#define VARMI
/*#ifdef PII
//successful code
#else
//else code
#endif
#ifdef PI
printf("C harika gidiyor");
#else
printf("C muthis gidiyor");
#endif*/
int main()
{
int sayi;
#ifdef VARMIIIIII
sayi=2;
#... | 7 |
Arranic/ics_labs | bae7d49 | gflib/gfclient.c | C | www.github.com/Arranic/ics_labs/tree/main/gflib/gfclient.c | https://raw.githubusercontent.com/Arranic/ics_labs/bae7d49/gflib/gfclient.c | Arranic/ics_labs bae7d49 gflib/gfclient.c | true | 200 | 21,838 | #define _GNU_SOURCE
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <pthread.h>
#include <errno.h>
#include <netinet/in.h>
#include <string.h>
#include <ctype.h>
#include <sys/socket.h>
#include <netdb.h>
#include "gfclient.h"
#define BUFSIZE 4096
// global variables
// char *respBuf;
const char ... | 0 |
lai-hue/-LiteOS- | 2ce8fe4 | Hardware/screen/core/hmi_driver.c | C | www.github.com/lai-hue/-LiteOS-/tree/main/Hardware/screen/core/hmi_driver.c | https://raw.githubusercontent.com/lai-hue/-LiteOS-/2ce8fe4/Hardware/screen/core/hmi_driver.c | lai-hue/-LiteOS- 2ce8fe4 Hardware/screen/core/hmi_driver.c | true | 200 | 43,259 | /************************************版权申明********************************************
** 广州大彩光电科技有限公司
** http://www.gz-dc.com
**-----------------------------------文件信息--------------------------------------------
** 文件名称: hmi_driver.c
** 修改时间: 2018-05-18
... | 6 |
SRamakrishna1999/LSP_practice | 7763287 | pipe/pipe_write.c | C | www.github.com/SRamakrishna1999/LSP_practice/tree/main/pipe/pipe_write.c | https://raw.githubusercontent.com/SRamakrishna1999/LSP_practice/7763287/pipe/pipe_write.c | SRamakrishna1999/LSP_practice 7763287 pipe/pipe_write.c | true | 200 | 334 | #include <unistd.h>
#include<stdio.h>
#include<string.h>
int main()
{
int piperet,arr[2];
char buff[20];
piperet=pipe(arr);
if(piperet==0)
{
printf("pipe is successsfully created\n");
printf("please enter string\n");
scanf("%s",buff);
write(arr[1],buff,strlen(buff)+1);
}
else
printf("pipe is not crea... | 5 |
abdulrahmonbb/alx-low_level_programming | 166af87 | 0x04-more_functions_nested_loops/3-print_numbers.c | C | www.github.com/abdulrahmonbb/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/3-print_numbers.c | https://raw.githubusercontent.com/abdulrahmonbb/alx-low_level_programming/166af87/0x04-more_functions_nested_loops/3-print_numbers.c | abdulrahmonbb/alx-low_level_programming 166af87 0x04-more_functions_nested_loops/3-print_numbers.c | true | 200 | 245 | #include <stdio.h>
#include "main.h"
/**
* print_numbers - prints the numbers from 0 to 9 followed by a new line
* Return: void
*/
void print_numbers(void)
{
int c;
c = 48;
while (c <= 57)
{
_putchar(c);
c++;
}
_putchar('\n');
}
| 7 |
HaimOzer123/City-Simulation-using-FreeRTOS-STM32F756ZG | aa99331 | project_defines.h | C | www.github.com/HaimOzer123/City-Simulation-using-FreeRTOS-STM32F756ZG/tree/main/project_defines.h | https://raw.githubusercontent.com/HaimOzer123/City-Simulation-using-FreeRTOS-STM32F756ZG/aa99331/project_defines.h | HaimOzer123/City-Simulation-using-FreeRTOS-STM32F756ZG aa99331 project_defines.h | true | 200 | 1,187 | /*
* project_defines.h
*
* Created on: Dec 29, 2024
* Author: Haim
*/
/// @file project_defines.h
/// @brief Defines for project-wide configurations.
#ifndef INC_PROJECT_DEFINES_H_
#define INC_PROJECT_DEFINES_H_
#include <stdint.h>
// Task priorities
#define POLICE_TASK_PRIORITY 3
#define ... | 0 |
warundev/C-Programming | 72fab8e | PRACTICAL SESSIONS/08-Ex01.c | C | www.github.com/warundev/C-Programming/tree/main/PRACTICAL SESSIONS/08-Ex01.c | https://raw.githubusercontent.com/warundev/C-Programming/72fab8e/PRACTICAL%20SESSIONS/08-Ex01.c | warundev/C-Programming 72fab8e PRACTICAL SESSIONS/08-Ex01.c | true | 200 | 1,436 | //Practical Number : 08
//Problem Specification : Get the two numbers from the user and apply them to different operators.
//Code :
#include <stdio.h>
int main()
{
int num1,num2,sum,sub,mul;
printf("Enter the number1 : ");
scanf("%i",&num1);
printf("Enter the number2 : ");
scanf("%i",&n... | 5 |
IgorCRH/ExerciciosC-LinguagemdeProgramacaoII-SIUFRRJ | bfdcc85 | Lista 9/banco.h | C | www.github.com/IgorCRH/ExerciciosC-LinguagemdeProgramacaoII-SIUFRRJ/tree/main/Lista 9/banco.h | https://raw.githubusercontent.com/IgorCRH/ExerciciosC-LinguagemdeProgramacaoII-SIUFRRJ/bfdcc85/Lista%209/banco.h | IgorCRH/ExerciciosC-LinguagemdeProgramacaoII-SIUFRRJ bfdcc85 Lista 9/banco.h | true | 200 | 5,290 | typedef struct {
int numconta;
char cpf[13];
int saldo;
} cliente;
typedef struct {
cliente totalclientes[100];
} sistema;
void lerdados (FILE *entrada){
int i, opc;
cliente registra;
entrada = fopen("contas.dat", "ab");
if (entrada == NULL){
printf("\nO arquivo tem de ser criado!");
} else {
for(i... | 7 |
Capella87/dstr-implementations | fe49b22 | src/sorting/shellSort.c | C | www.github.com/Capella87/dstr-implementations/tree/main/src/sorting/shellSort.c | https://raw.githubusercontent.com/Capella87/dstr-implementations/fe49b22/src/sorting/shellSort.c | Capella87/dstr-implementations fe49b22 src/sorting/shellSort.c | true | 200 | 807 | #include <stdio.h>
#include <stdlib.h>
#include "./_common_/common.h"
void shell_sort(int* arr, const int size)
{
for (int interval = size / 2; interval > 0; interval /= 2)
{
for (int i = interval; i < size; i++)
{
int temp = arr[i];
int j;
for (j = i; j >= i... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.