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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
magnusbpt/Modbus-wireless | 4a58040 | Wireless modbus/Programmering/Fugtighed ting/zmod4xxx_raspi_example/HAL/rpi.c | C | www.github.com/magnusbpt/Modbus-wireless/tree/main/Wireless modbus/Programmering/Fugtighed ting/zmod4xxx_raspi_example/HAL/rpi.c | https://raw.githubusercontent.com/magnusbpt/Modbus-wireless/4a58040/Wireless%20modbus/Programmering/Fugtighed%20ting/zmod4xxx_raspi_example/HAL/rpi.c | magnusbpt/Modbus-wireless 4a58040 Wireless modbus/Programmering/Fugtighed ting/zmod4xxx_raspi_example/HAL/rpi.c | true | 200 | 5,169 | /*******************************************************************************
* Copyright (c) 2023 Renesas Electronics Corporation
* All Rights Reserved.
*
* This code is proprietary to Renesas, and is license pursuant to the terms and
* conditions that may be accessed at:
* https://www.renesas.com/eu/en/docum... | 6 |
Jumai01/alx-low_level_programming | 23c05da | 0x01-variables_if_else_while/6-print_numberz.c | C | www.github.com/Jumai01/alx-low_level_programming/tree/main/0x01-variables_if_else_while/6-print_numberz.c | https://raw.githubusercontent.com/Jumai01/alx-low_level_programming/23c05da/0x01-variables_if_else_while/6-print_numberz.c | Jumai01/alx-low_level_programming 23c05da 0x01-variables_if_else_while/6-print_numberz.c | true | 200 | 237 | #include <stdio.h>
/**
* main - Entry Level
* Description - Prints number from 0 to 10
* Return: Returns 0 Always
*/
int main(void)
{
int i;
for (i = 0; i < 10; i++)
{
putchar(i + '0');
}
{
putchar('\n');
}
return (0);
}
| 0 |
Xinze-Zheng-playground/test_student | 16645a2 | mp1/emoji-translate.c | C | www.github.com/Xinze-Zheng-playground/test_student/tree/main/mp1/emoji-translate.c | https://raw.githubusercontent.com/Xinze-Zheng-playground/test_student/16645a2/mp1/emoji-translate.c | Xinze-Zheng-playground/test_student 16645a2 mp1/emoji-translate.c | true | 200 | 3,836 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "emoji-translate.h"
#include "emoji.h"
#define EMOJI_LOW 0x1F000
#define EMOJI_HIGH 0x1FAFF
int is_emoji(unsigned char *str) {
if (!str || (str[0] & 0b11110000) != 0b11110000)
return 0;
int utf_code = str_to_utf(str);
if (utf_code >= EMOJI_... | 7 |
sabrinahelena/AEDS-I-EngComp | 465138b | Teste4/Atividade7Lista4/main.c | C | www.github.com/sabrinahelena/AEDS-I-EngComp/tree/main/Teste4/Atividade7Lista4/main.c | https://raw.githubusercontent.com/sabrinahelena/AEDS-I-EngComp/465138b/Teste4/Atividade7Lista4/main.c | sabrinahelena/AEDS-I-EngComp 465138b Teste4/Atividade7Lista4/main.c | true | 200 | 1,466 | #include <stdio.h>
#include <stdlib.h>
int main()
{
int x = 1, genero, idade, peso, mediaPesoH, mediaIdadeM, mediaPeso, mediaIdades;
int contadorM = 0, contadorH = 0, somaIdadeMulher = 0, somaIdadeHomem =0;
int somaPesoHomem = 0, somaPesoMulher = 0;
while( x <= 2){
printf("\nDigite o seu gener... | 2 |
Syed-Hammad-Haider/24K-0634 | 4017f88 | Lab 7/Q1 (shift right).c | C | www.github.com/Syed-Hammad-Haider/24K-0634/tree/main/Lab 7/Q1 (shift right).c | https://raw.githubusercontent.com/Syed-Hammad-Haider/24K-0634/4017f88/Lab%207/Q1%20%28shift%20right%29.c | Syed-Hammad-Haider/24K-0634 4017f88 Lab 7/Q1 (shift right).c | true | 200 | 372 | #include <stdio.h>
int main() {
int arr[6] = {1, 2, 3, 4, 5, 6};
printf("\n");
int last = arr[5];
for (int i = 5; i > 0; i--) {
arr[i] = arr[i - 1];
}
arr[0] = last;
printf("Shifted array: ");
for (int i = 0; i < 6; i++) {
printf("%d ", arr[i]);... | 3 |
wkalai/mq135 | bb467b3 | remote.c | C | www.github.com/wkalai/mq135/tree/main/remote.c | https://raw.githubusercontent.com/wkalai/mq135/bb467b3/remote.c | wkalai/mq135 bb467b3 remote.c | true | 200 | 3,898 | #include "remote.h"
#include "delay.h"
#include "usart.h"
//PB9
//����ң�س�ʼ��
//����IO�Լ���ʱ��4�����벶��
void Remote_Init(void)
{
GPIO_InitTypeDef GPIO_InitStructure;
TIM_TimeBaseInitTypeDef TIM_TimeBaseInitStructure;
TIM_ICInitTypeDef TIM_ICInitStructure;
NVIC_InitTypeDef NVIC_InitStructure... | 4 |
kaushikvaliya/software_engineering | 58dcca1 | Module-3/p5.c | C | www.github.com/kaushikvaliya/software_engineering/tree/main/Module-3/p5.c | https://raw.githubusercontent.com/kaushikvaliya/software_engineering/58dcca1/Module-3/p5.c | kaushikvaliya/software_engineering 58dcca1 Module-3/p5.c | true | 200 | 256 | // 5. Write a program to find the Area of Triangle
#include <stdio.h>
int main()
{
float h,b,area;
printf("Enter Hight :");
scanf("%f",&h);
printf("Enter base :");
scanf("%f",&b);
area=h*b*0.5;
printf("Triangle erea = %.2f\n",area);
return 0;
} | 5 |
Mitche98/WorkToDo | 7056d65 | 0x0A-argc_argv/_putchar.c | C | www.github.com/Mitche98/WorkToDo/tree/main/0x0A-argc_argv/_putchar.c | https://raw.githubusercontent.com/Mitche98/WorkToDo/7056d65/0x0A-argc_argv/_putchar.c | Mitche98/WorkToDo 7056d65 0x0A-argc_argv/_putchar.c | true | 200 | 210 | #include <stdio.h>
#include "main.h"
/**
* _putchar - writes char to stdout
* @c: char to print
*
* Return: on success 1,
* on error -1 is returned
*/
int _putchar(char c)
{
return (write(1, &c, 1));
}
| 7 |
QuixoticVision/YK | 2361258 | packages/FlexibleButton-latest/flexible_button.h | C | www.github.com/QuixoticVision/YK/tree/main/packages/FlexibleButton-latest/flexible_button.h | https://raw.githubusercontent.com/QuixoticVision/YK/2361258/packages/FlexibleButton-latest/flexible_button.h | QuixoticVision/YK 2361258 packages/FlexibleButton-latest/flexible_button.h | true | 200 | 4,904 | /**
* @File: flexible_button.h
* @Author: MurphyZhao
* @Date: 2018-09-29
*
* Copyright (c) 2018-2019 MurphyZhao <d2014zjt@163.com>
* https://github.com/murphyzhao
* All rights reserved.
* License-Identifier: Apache-2.0
*
* Licensed under the Apache License, Version 2.0 (the "Li... | 2 |
Electro593/Platform | 6ff0f8e | src/util/vector.c | C | www.github.com/Electro593/Platform/tree/main/src/util/vector.c | https://raw.githubusercontent.com/Electro593/Platform/6ff0f8e/src/util/vector.c | Electro593/Platform 6ff0f8e src/util/vector.c | true | 200 | 21,957 | /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *\
** **
** Author: Aria Seiler **
** **
** This... | 0 |
u201314147/rep17 | 1164b7e | mods/Modules/Mario-Fueled/src/main.c | C | www.github.com/u201314147/rep17/tree/main/mods/Modules/Mario-Fueled/src/main.c | https://raw.githubusercontent.com/u201314147/rep17/1164b7e/mods/Modules/Mario-Fueled/src/main.c | u201314147/rep17 1164b7e mods/Modules/Mario-Fueled/src/main.c | true | 200 | 455 | #include <common.h>
void VehFire_Audio(struct Driver *driver, int param_2);
void Mini_Turbo()
{
struct GameTracker *gGT = sdata->gGT;
for (char i = 0; i < gGT->numPlyrCurrGame; i++)
{
struct Driver* d = gGT->drivers[i];
short meterLeft = d->turbo_MeterRoomLeft;
if ((meterLeft < 100) && (meterLeft > 1))
... | 6 |
Paola26tg/alx-low_level_programming | 19c7321 | 0x01-variables_if_else_while/7-print_tebahpla.c | C | www.github.com/Paola26tg/alx-low_level_programming/tree/main/0x01-variables_if_else_while/7-print_tebahpla.c | https://raw.githubusercontent.com/Paola26tg/alx-low_level_programming/19c7321/0x01-variables_if_else_while/7-print_tebahpla.c | Paola26tg/alx-low_level_programming 19c7321 0x01-variables_if_else_while/7-print_tebahpla.c | true | 200 | 219 | #include <stdio.h>
/**
* main - Entry point print alphabet in reverse
*
* Return: Always 0 (success)
*
*/
int main(void)
{
char ch;
for (ch = 'z'; ch >= 'a'; ch--)
putchar(ch);
putchar('\n');
return (0);
}
| 3 |
ProgrammerShahJalal/strucute_C | 6b54bf8 | problem1.c | C | www.github.com/ProgrammerShahJalal/strucute_C/tree/main/problem1.c | https://raw.githubusercontent.com/ProgrammerShahJalal/strucute_C/6b54bf8/problem1.c | ProgrammerShahJalal/strucute_C 6b54bf8 problem1.c | true | 200 | 390 | #include<stdio.h>
#include<math.h>
struct Point
{
int x;
int y;
};
double manhattonDistance(struct Point p, struct Point q){
return(abs(p.x-q.x)+abs(p.y-q.y));
}
int main()
{
struct Point p1, p2;
scanf("(%d, %d)\n", &p1.x, &p1.y);
scanf("(%d, %d)", &p2.x, &p2.y);
printf("Manhatton Distanc... | 1 |
Abhishek-V-Dalvi/LSP | cec9968 | Assignment 9/A9Q1.c | C | www.github.com/Abhishek-V-Dalvi/LSP/tree/main/Assignment 9/A9Q1.c | https://raw.githubusercontent.com/Abhishek-V-Dalvi/LSP/cec9968/Assignment%209/A9Q1.c | Abhishek-V-Dalvi/LSP cec9968 Assignment 9/A9Q1.c | true | 200 | 502 | #include<stdio.h>
#include<stdlib.h>
#include<unistd.h>
int main()
{
int iRet = 0;
int Child_PID = 0;
int Exit_Status = 0;
iRet = fork();
if(iRet == 0) // Child
{
execl("./ChildProcess","NULL",NULL);
}
else // Parent
{
printf("Parent is running with PID :... | 4 |
Darrengn/Text-Functions | afbea14 | indexOf.c | C | www.github.com/Darrengn/Text-Functions/tree/main/indexOf.c | https://raw.githubusercontent.com/Darrengn/Text-Functions/afbea14/indexOf.c | Darrengn/Text-Functions afbea14 indexOf.c | true | 200 | 1,285 | #include <stdio.h>
#include <stdlib.h>
#include "const.h"
/**
* finds the first instance of fstr in sstr and returns the index of the
* first character
* @param fstr find string, the string to search for
* @param sstr search string, the string that is looked through
* @param startInd the index to start at (inclus... | 5 |
nicoalvarezz/Sudoku | 80d0ac1 | C/sudoku.c | C | www.github.com/nicoalvarezz/Sudoku/tree/main/C/sudoku.c | https://raw.githubusercontent.com/nicoalvarezz/Sudoku/80d0ac1/C/sudoku.c | nicoalvarezz/Sudoku 80d0ac1 C/sudoku.c | true | 200 | 1,947 | /*SUDOKU*/
#include <stdio.h>
#include <stdbool.h>
#define ROW_COL 9
#define S_ROW_COL 3
//GLOBAL VARIABLES
int grid[ROW_COL][ROW_COL]={{5,3,0,0,7,0,0,0,0},
{6,0,0,1,9,5,0,0,0},
{0,9,8,0,0,0,0,6,0},
{8,0,0,0,6,0,0,0,3},
{4,0,0,8,0,3,0,0,1},
{7,0,0,0,2,0,0,0,6},
{0,6,0,0,0,0,... | 7 |
GideonAmhaG/Test | a2f56a7 | simpleshell/strcmp.c | C | www.github.com/GideonAmhaG/Test/tree/main/simpleshell/strcmp.c | https://raw.githubusercontent.com/GideonAmhaG/Test/a2f56a7/simpleshell/strcmp.c | GideonAmhaG/Test a2f56a7 simpleshell/strcmp.c | true | 200 | 261 | #include "sshell.h"
/**
* _strcmp - compares 2 strings
* @s1: 1st string
* @s2: 2nd string
*
* Return: difference between the 2 strings
*/
int _strcmp(char *s1, char *s2)
{
while (*s1 && *s2 && *s1 == *s2)
{
s1++;
s2++;
}
return (*s1 - *s2);
}
| 0 |
malakehab2003/alx-low_level_programming | d39f135 | 0x06-pointers_arrays_strings/3-strcmp.c | C | www.github.com/malakehab2003/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/3-strcmp.c | https://raw.githubusercontent.com/malakehab2003/alx-low_level_programming/d39f135/0x06-pointers_arrays_strings/3-strcmp.c | malakehab2003/alx-low_level_programming d39f135 0x06-pointers_arrays_strings/3-strcmp.c | true | 200 | 404 | #include "main.h"
/**
* _strcmp - copare two strings
*
* Return: 0 if the string is the same
*
* @s1: first string to compare
*
* @s2: second string to compare
*
*/
int _strcmp(char *s1, char *s2)
{
int i = 0, j = 0, r;
while (s2[j] != '\0' || s1[i] != '\0')
{
if (s1[i] == s2[j])
{
i++;
j++;
... | 2 |
mtalhaaygen/RayCasting | e4388c4 | utils2.c | C | www.github.com/mtalhaaygen/RayCasting/tree/main/utils2.c | https://raw.githubusercontent.com/mtalhaaygen/RayCasting/e4388c4/utils2.c | mtalhaaygen/RayCasting e4388c4 utils2.c | true | 200 | 2,698 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* utils2.c :+: :+: :+: ... | 3 |
itzsinox/alx-low_level_programming | 2c992aa | 0x05-pointers_arrays_strings/5-rev_string.c | C | www.github.com/itzsinox/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/5-rev_string.c | https://raw.githubusercontent.com/itzsinox/alx-low_level_programming/2c992aa/0x05-pointers_arrays_strings/5-rev_string.c | itzsinox/alx-low_level_programming 2c992aa 0x05-pointers_arrays_strings/5-rev_string.c | true | 200 | 322 | #include "main.h"
/**
* rev_string - reverses a str
* @s: input str
* Return: string in reverse
*/
void rev_string(char *s)
{
char rev = s[0];
int counter = 0;
int i;
while (s[counter] != '\0')
counter++;
for (i = 0; i < counter; i++)
{
counter--;
rev = s[i];
s[i] = s[counter];
s[counter] = rev;
}
... | 6 |
bhuvankachhadiya/arrays | 583cd4d | 1d3.c | C | www.github.com/bhuvankachhadiya/arrays/tree/main/1d3.c | https://raw.githubusercontent.com/bhuvankachhadiya/arrays/583cd4d/1d3.c | bhuvankachhadiya/arrays 583cd4d 1d3.c | true | 200 | 236 | #include<stdio.h>
main()
{
int a[5],i,sum=0;
printf("enter array elements=\n");
for(i=0;i<5;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<5;i++)
{
sum=sum+a[i];
}
printf("sum of elements=%d",sum);
} | 1 |
rajesh-1920/C_programming_all | 231defd | W3 resource/P-67.c | C | www.github.com/rajesh-1920/C_programming_all/tree/main/W3 resource/P-67.c | https://raw.githubusercontent.com/rajesh-1920/C_programming_all/231defd/W3%20resource/P-67.c | rajesh-1920/C_programming_all 231defd W3 resource/P-67.c | true | 200 | 506 | /*p-67*/
/*evaluate the equation y=x^n */
#include<stdio.h>
int main() /*main function start*/
{
double x,n,i,y=1; /*variable*/
printf("Enter the value of x and n:\n"); /*prompt*/
scanf("%lf%lf",&x,&n); /*taking value*/
if(n==0)
{
printf("y = %lf\n",y); /*showing result*/
}
else
... | 5 |
Pavi1on-Mk-Git/Card_game | 6b9ea9e | include/error_code.h | C | www.github.com/Pavi1on-Mk-Git/Card_game/tree/main/include/error_code.h | https://raw.githubusercontent.com/Pavi1on-Mk-Git/Card_game/6b9ea9e/include/error_code.h | Pavi1on-Mk-Git/Card_game 6b9ea9e include/error_code.h | true | 200 | 261 | #ifndef ERROR_CODE_H
#define ERROR_CODE_H
#include "constants.h"
typedef enum ErrorCode
{
ERR_OK,
ERR_INIT,
ERR_FILE_FORMAT,
ERR_SDL,
ERR_CARD_DUP,
ERR_NULL,
ERR_TEXTURE,
ERR_MEM,
}
ErrorCode;
extern char* error_msg;
#endif
| 4 |
AlexDominguez18/Curso-Programacion-TSU-UDG | 93812ee | Unidad 5 - Archivos/4 - Lectura en acceso secuencial/C/main.c | C | www.github.com/AlexDominguez18/Curso-Programacion-TSU-UDG/tree/main/Unidad 5 - Archivos/4 - Lectura en acceso secuencial/C/main.c | https://raw.githubusercontent.com/AlexDominguez18/Curso-Programacion-TSU-UDG/93812ee/Unidad%205%20-%20Archivos/4%20-%20Lectura%20en%20acceso%20secuencial/C/main.c | AlexDominguez18/Curso-Programacion-TSU-UDG 93812ee Unidad 5 - Archivos/4 - Lectura en acceso secuencial/C/main.c | true | 200 | 842 | #include <stdio.h>
#define NOMBRE_ARCHIVO "../../3 - Escritura en acceso secuencial/C/alumnos.txt"
#define TAMANIO_NOMBRE 30
#define CANTIDAD_ALUMNOS 5
typedef struct {
int codigo;
char nombre[TAMANIO_NOMBRE];
} Alumno;
int main()
{
Alumno alumno[CANTIDAD_ALUMNOS];
FILE *archivo;
archivo = fopen... | 7 |
oskarwilms1/ZadaniaKolosC | 9f94173 | Lab1/Zad6/Zad6.c | C | www.github.com/oskarwilms1/ZadaniaKolosC/tree/main/Lab1/Zad6/Zad6.c | https://raw.githubusercontent.com/oskarwilms1/ZadaniaKolosC/9f94173/Lab1/Zad6/Zad6.c | oskarwilms1/ZadaniaKolosC 9f94173 Lab1/Zad6/Zad6.c | true | 200 | 956 | #include <stdlib.h>
#include <stdio.h>
int main() {
int wybor;
char komenda[256];
printf("Wybierz typ archiwum do utworzenia:\n");
printf("1. Tar (.tar)\n");
printf("2. Zip (.zip)\n");
printf("Wybierz opcję (1 lub 2): ");
scanf("%d", &wybor);
switch (wybor) {
case 1:
... | 0 |
Srilakshmi2122/codemind-c | 1b1a10b | Gross_Salary.c | C | www.github.com/Srilakshmi2122/codemind-c/tree/main/Gross_Salary.c | https://raw.githubusercontent.com/Srilakshmi2122/codemind-c/1b1a10b/Gross_Salary.c | Srilakshmi2122/codemind-c 1b1a10b Gross_Salary.c | true | 200 | 342 | #include<stdio.h>
int main()
{
float bs,hra,da,gs;
scanf("%f",&bs);
if(bs<=10000)
{
da=0.8*bs;
hra=0.2*bs;
}
else if(bs<=20000)
{
da=0.9*bs;
hra=0.25*bs;
}
else if(bs>20000)
{
da=0.95*bs;
hra=0.3*bs;
}
gs=bs+da+hra;
prin... | 3 |
Skyline7760/Embedded | 2847651 | 15_buffer_size.c | C | www.github.com/Skyline7760/Embedded/tree/main/15_buffer_size.c | https://raw.githubusercontent.com/Skyline7760/Embedded/2847651/15_buffer_size.c | Skyline7760/Embedded 2847651 15_buffer_size.c | true | 200 | 808 | /*
----------------------------------------------------------------------------------------------------------------
------------------------
Function Name: buffer_size
Function Description: Get Size of Data Buffer
Function Input: FIL Pointer
Function Return: File Size
Function Author: APS
----------------------... | 1 |
AdrianWeaver/rush_connect4 | af655ec | srcs/input.c | C | www.github.com/AdrianWeaver/rush_connect4/tree/main/srcs/input.c | https://raw.githubusercontent.com/AdrianWeaver/rush_connect4/af655ec/srcs/input.c | AdrianWeaver/rush_connect4 af655ec srcs/input.c | true | 200 | 2,115 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* input.c :+: :+: :+: ... | 6 |
Ilyassebou/alx-higher_level_programming | 4e63bfc | 0x03-python-data_structures/13-is_palindrome.c | C | www.github.com/Ilyassebou/alx-higher_level_programming/tree/main/0x03-python-data_structures/13-is_palindrome.c | https://raw.githubusercontent.com/Ilyassebou/alx-higher_level_programming/4e63bfc/0x03-python-data_structures/13-is_palindrome.c | Ilyassebou/alx-higher_level_programming 4e63bfc 0x03-python-data_structures/13-is_palindrome.c | true | 200 | 703 | #include "lists.h"
/**
* is_palindrome - check if a singly linked list is a palindrome
* @head: pointer to a pointer to a singly linked list
*
* Return: integer, 1 if list is a palindrome else 0
*/
int is_palindrome(listint_t **head)
{
return palindrome(head, *head);
}
/**
* palindrome - utility for is_pali... | 2 |
alckanso/c_language_studies | 9392773 | dayoftheyear.c | C | www.github.com/alckanso/c_language_studies/tree/main/dayoftheyear.c | https://raw.githubusercontent.com/alckanso/c_language_studies/9392773/dayoftheyear.c | alckanso/c_language_studies 9392773 dayoftheyear.c | true | 200 | 1,234 | /* Simple exercise that gets two inputs, being the first the day of the month and the second being the month.
I sums up the days of the months before the current and then with the day of the current month, printing the current day.
Exercise done while studying C in http://www.edube.org - 2.1.5.16 LAB
I added array and ... | 4 |
Liss-11/42_exam_rank2 | 6679c54 | last_word.c | C | www.github.com/Liss-11/42_exam_rank2/tree/main/last_word.c | https://raw.githubusercontent.com/Liss-11/42_exam_rank2/6679c54/last_word.c | Liss-11/42_exam_rank2 6679c54 last_word.c | true | 200 | 1,115 | #include <unistd.h>
void last_word(char *str);
int main(int argc, char **argv)
{
if(argc == 2)
{
last_word(argv[1]);
}
write(1, "\n", 1);
return(0);
}
int ft_strlen(char *str)
{
int len;
len = 0;
while(str[len] != '\0')
len++;
return (len - 1);
}
void last_word(char *str)
{
int len;
int end;
int st... | 5 |
VloneMe/alx-low_level_programming | 33e2797 | 0x01-variables_if_else_while/4-print_alphabt.c | C | www.github.com/VloneMe/alx-low_level_programming/tree/main/0x01-variables_if_else_while/4-print_alphabt.c | https://raw.githubusercontent.com/VloneMe/alx-low_level_programming/33e2797/0x01-variables_if_else_while/4-print_alphabt.c | VloneMe/alx-low_level_programming 33e2797 0x01-variables_if_else_while/4-print_alphabt.c | true | 200 | 245 | #include <stdio.h>
/**
* main - The entry point of the program
*
* Return: Always 0 (success)
*
*/
int main(void)
{
char A;
for (A = 'a'; A <= 'z'; A++)
{
if (A != 'q' && A != 'e')
putchar(A);
}
putchar('\n');
return (0);
}
| 7 |
roman1100011/Matlab_git | 08e9cb7 | ALT/Lineare algebra/codegen/lib/Cholenski/Cholenski_terminate.h | C | www.github.com/roman1100011/Matlab_git/tree/main/ALT/Lineare algebra/codegen/lib/Cholenski/Cholenski_terminate.h | https://raw.githubusercontent.com/roman1100011/Matlab_git/08e9cb7/ALT/Lineare%20algebra/codegen/lib/Cholenski/Cholenski_terminate.h | roman1100011/Matlab_git 08e9cb7 ALT/Lineare algebra/codegen/lib/Cholenski/Cholenski_terminate.h | true | 200 | 690 | /*
* 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: Cholenski_terminate.h
*
* MATLAB Coder version : 5.5
* C/C++ source code generated on : 11-Ma... | 0 |
largenumberhere/libc2 | 2886833 | examples/length_of_string/main.c | C | www.github.com/largenumberhere/libc2/tree/main/examples/length_of_string/main.c | https://raw.githubusercontent.com/largenumberhere/libc2/2886833/examples/length_of_string/main.c | largenumberhere/libc2 2886833 examples/length_of_string/main.c | true | 200 | 371 | // https://www.geeksforgeeks.org/c-program-to-find-the-length-of-a-string/
// C program to find the length of
// string using strlen function
#include <stdio.h>
#include <string.h>
int main()
{
char str[1000] = "GeeksforGeeks";
// Calling strlen with Str as argument
int len = strlen(str);
printf("Le... | 3 |
Harsh-D-2004/LB | 8f6cc2f | Practice/program15.c | C | www.github.com/Harsh-D-2004/LB/tree/main/Practice/program15.c | https://raw.githubusercontent.com/Harsh-D-2004/LB/8f6cc2f/Practice/program15.c | Harsh-D-2004/LB 8f6cc2f Practice/program15.c | true | 200 | 650 | #include<stdio.h>
#include<stdbool.h>
bool CheckCapital(char *str ,char cValue)
{
bool bFlag = false;
while(*str != 0)
{
if(*str == cValue)
{
bFlag = true;
}
str++;
}
return bFlag;
}
int main()
{
char Arr[20];
char ch = '\0';
bool bRet = fal... | 2 |
aattak/minitalk | fd28d06 | mandatory/client.c | C | www.github.com/aattak/minitalk/tree/main/mandatory/client.c | https://raw.githubusercontent.com/aattak/minitalk/fd28d06/mandatory/client.c | aattak/minitalk fd28d06 mandatory/client.c | true | 200 | 2,330 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* client.c :+: :+: :+: ... | 1 |
kellsmurray/alx-low_level_programming | 573b10d | 0x07-pointers_arrays_strings/3-strspn.c | C | www.github.com/kellsmurray/alx-low_level_programming/tree/main/0x07-pointers_arrays_strings/3-strspn.c | https://raw.githubusercontent.com/kellsmurray/alx-low_level_programming/573b10d/0x07-pointers_arrays_strings/3-strspn.c | kellsmurray/alx-low_level_programming 573b10d 0x07-pointers_arrays_strings/3-strspn.c | true | 200 | 595 | #include "main.h"
#include <stdio.h>
#include <string.h>
/**
* _strspn - Function that gets length of a prefix string.
* @s: Pointer to the null-terminated byte string to be analyzed.
* @accept: Pointer to the null-terminated byte string that contains characters.
* Return: Number of bytes in theinitial segment of ... | 6 |
N-Endy/alx-low_level_programming | 4833eb3 | 0x02-functions_nested_loops/5-sign.c | C | www.github.com/N-Endy/alx-low_level_programming/tree/main/0x02-functions_nested_loops/5-sign.c | https://raw.githubusercontent.com/N-Endy/alx-low_level_programming/4833eb3/0x02-functions_nested_loops/5-sign.c | N-Endy/alx-low_level_programming 4833eb3 0x02-functions_nested_loops/5-sign.c | true | 200 | 373 | #include "main.h"
/**
* print_sign - Prints the sign of a number
*@c: Takes an argument of type int
*
* Description: Print 1 if greater than 0, -1 if less than 0, else 0
* Return: Returns an integer value
*/
int print_sign(int c)
{
if (c > 0)
{
_putchar('+');
return (1);
} else if (c < 0)
{
_putchar('... | 5 |
MaximTraf/250505-1 | 84001b3 | Казаков Данила Лабораторная работа 2/ЛАБОРАТОРНАЯ РАБОТА №2 ЗАДАНИЕ 3.c | C | www.github.com/MaximTraf/250505-1/tree/main/Казаков Данила Лабораторная работа 2/ЛАБОРАТОРНАЯ РАБОТА №2 ЗАДАНИЕ 3.c | https://raw.githubusercontent.com/MaximTraf/250505-1/84001b3/%D0%9A%D0%B0%D0%B7%D0%B0%D0%BA%D0%BE%D0%B2%20%D0%94%D0%B0%D0%BD%D0%B8%D0%BB%D0%B0%20%D0%9B%D0%B0%D0%B1%D0%BE%D1%80%D0%B0%D1%82%D0%BE%D1%80%D0%BD%D0%B0%D1%8F%20%D1%80%D0%B0%D0%B1%D0%BE%D1%82%D0%B0%202/%D0%9B%D0%90%D0%91%D0%9E%D0%A0%D0%90%D0%A2%D0%9E%D0%A0%D0%9... | MaximTraf/250505-1 84001b3 Казаков Данила Лабораторная работа 2/ЛАБОРАТОРНАЯ РАБОТА №2 ЗАДАНИЕ 3.c | true | 200 | 293 | #include <stdio.h>
int main(void)
{
int n;
printf("Number: \n");
scanf_s("%i", &n);
int f1 = 1, f2 = 1, f = 0;
while (f < n)
{
f = f2 + f1;
f2 = f1;
f1 = f;
}
printf("%s\n", f == n ? "True" : "False");
return 0;
} | 4 |
bielabs/BOLD-ROAD | fea552e | src/timer.c | C | www.github.com/bielabs/BOLD-ROAD/tree/main/src/timer.c | https://raw.githubusercontent.com/bielabs/BOLD-ROAD/fea552e/src/timer.c | bielabs/BOLD-ROAD fea552e src/timer.c | true | 200 | 1,066 | /**
* timer.c
* Created on Aug, 23th 2023
* Author: Tiago Barros
* Based on "From C to C++ course - 2002"
*/
#include "timer.h"
#include <sys/time.h>
#include <stdio.h>
static struct timeval timer, now;
static int delay = -1;
void timerInit(int valueMilliSec)
{
delay = valueMilliSec;
gettimeofday(&tim... | 0 |
OddEer0/string | 8f32320 | sprintf/sprintf.c | C | www.github.com/OddEer0/string/tree/main/sprintf/sprintf.c | https://raw.githubusercontent.com/OddEer0/string/8f32320/sprintf/sprintf.c | OddEer0/string 8f32320 sprintf/sprintf.c | true | 200 | 3,950 | #include <stdlib.h>
#include "../s21_string.h"
#include "../shared/utils.h"
#include "./sprintf_strategy.h"
int isNum(char specifier) { return !!s21_strchr("douxXp", specifier); }
int isFloat(char specifier) { return !!s21_strchr("eEfgG", specifier); }
void precisionInit(TStrFormatParse *PFormat, va_list *args) {
... | 3 |
dudgus197493/studyNote | 647b813 | DataStructure/Graph/main_Graph.c | C | www.github.com/dudgus197493/studyNote/tree/main/DataStructure/Graph/main_Graph.c | https://raw.githubusercontent.com/dudgus197493/studyNote/647b813/DataStructure/Graph/main_Graph.c | dudgus197493/studyNote 647b813 DataStructure/Graph/main_Graph.c | true | 200 | 936 | #include "Graph.h"
int main() {
Graph* G = createGraph();
Vertex* V1 = createVertex('1');
Vertex* V2 = createVertex('2');
Vertex* V3 = createVertex('3');
Vertex* V4 = createVertex('4');
Vertex* V5 = createVertex('5');
addVertex(G, V1);
addVertex(G, V2);
addVertex(G, V3);
addVertex(G, V4);
addVertex(G, ... | 2 |
Nrupal-w/PX4-Autopilot | 651675f | boards/nxp/tropic-community/src/imxrt_flexspi_nor_flash.h | C | www.github.com/Nrupal-w/PX4-Autopilot/tree/main/boards/nxp/tropic-community/src/imxrt_flexspi_nor_flash.h | https://raw.githubusercontent.com/Nrupal-w/PX4-Autopilot/651675f/boards/nxp/tropic-community/src/imxrt_flexspi_nor_flash.h | Nrupal-w/PX4-Autopilot 651675f boards/nxp/tropic-community/src/imxrt_flexspi_nor_flash.h | true | 200 | 13,346 | /****************************************************************************
* boards/arm/imxrt/teensy-4.x/src/imxrt_flexspi_nor_flash.h
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional informa... | 7 |
emabondi/so_long | 1f38a81 | mylib/gnl/get_next_line_utils.c | C | www.github.com/emabondi/so_long/tree/main/mylib/gnl/get_next_line_utils.c | https://raw.githubusercontent.com/emabondi/so_long/1f38a81/mylib/gnl/get_next_line_utils.c | emabondi/so_long 1f38a81 mylib/gnl/get_next_line_utils.c | true | 200 | 2,349 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* get_next_line_utils.c :+: :+: :+: ... | 1 |
Oleesae/alx-low_level_programming | b943559 | 0x04-more_functions_nested_loops/9-fizz_buzz.c | C | www.github.com/Oleesae/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/9-fizz_buzz.c | https://raw.githubusercontent.com/Oleesae/alx-low_level_programming/b943559/0x04-more_functions_nested_loops/9-fizz_buzz.c | Oleesae/alx-low_level_programming b943559 0x04-more_functions_nested_loops/9-fizz_buzz.c | true | 200 | 660 | #include "main.h"
#include <stdio.h>
/**
* main - Entry point
*
* Return: Always 0
*/
int main(void)
{
int c;
/* initiate and iterate to print 1 to 100 */
for (c = 1; c <= 100; c++)
{
/* check if number is a multiple of 3 & 5 */
if ((c % 3) == 0 && (c % 5) == 0)
{
printf("FizzBuzz");
}
else if (... | 3 |
MinimoMassimo/alx-low_level_programming | b409ef8 | 0x09-static_libraries/10-print_triangle.c | C | www.github.com/MinimoMassimo/alx-low_level_programming/tree/main/0x09-static_libraries/10-print_triangle.c | https://raw.githubusercontent.com/MinimoMassimo/alx-low_level_programming/b409ef8/0x09-static_libraries/10-print_triangle.c | MinimoMassimo/alx-low_level_programming b409ef8 0x09-static_libraries/10-print_triangle.c | true | 200 | 336 | #include "main.h"
/**
* print_triangle - prints a triangle
* @size: size of triangle
* Return: null
*/
void print_triangle(int size)
{
int i, j;
for (i = 1; i <= size; i++)
{
for (j = 0; j < size - i; j++)
_putchar(' ');
for (j = 0; j < i; j++)
_putchar('#');
_putchar('\n');
}
if (size <= 0)
_p... | 7 |
clodbrasilino/chatgpt-codesec-analysis | 517ed6c | collected_code/zero_shot/problem-441.c | C | www.github.com/clodbrasilino/chatgpt-codesec-analysis/tree/main/collected_code/zero_shot/problem-441.c | https://raw.githubusercontent.com/clodbrasilino/chatgpt-codesec-analysis/517ed6c/collected_code/zero_shot/problem-441.c | clodbrasilino/chatgpt-codesec-analysis 517ed6c collected_code/zero_shot/problem-441.c | true | 200 | 330 | #include <stdio.h>
double surfaceAreaOfCube(double side) {
return 6 * side * side;
}
int main() {
double side;
printf("Enter the side length of the cube: ");
scanf("%lf", &side);
double surfaceArea = surfaceAreaOfCube(side);
printf("The surface area of the cube is: %.2lf", surfaceArea);
r... | 3 |
kotappa19/Basic-Programs | e42e57a | C-C++/Cocubes2.c | C | www.github.com/kotappa19/Basic-Programs/tree/main/C-C++/Cocubes2.c | https://raw.githubusercontent.com/kotappa19/Basic-Programs/e42e57a/C-C%2B%2B/Cocubes2.c | kotappa19/Basic-Programs e42e57a C-C++/Cocubes2.c | true | 200 | 351 | #include<stdio.h>
int main()
{
int r,unit,sum=0,count=0;
scanf("%d %d",&r,&unit);
int arr[r];
for(int i=0;i<r;i++)
scanf("%d",&arr[i]);
for(int i=0;i<=r;i++)
{
if((r*unit)<=sum)
break;
else
{
sum+=arr[i];
count+=1;
}
... | 7 |
HuaDavide/esercizi_C_4E | 5cf9edf | Read - Write - Open - Close/stringaLungaFile/stringaLunga.c | C | www.github.com/HuaDavide/esercizi_C_4E/tree/main/Read - Write - Open - Close/stringaLungaFile/stringaLunga.c | https://raw.githubusercontent.com/HuaDavide/esercizi_C_4E/5cf9edf/Read%20-%20Write%20-%20Open%20-%20Close/stringaLungaFile/stringaLunga.c | HuaDavide/esercizi_C_4E 5cf9edf Read - Write - Open - Close/stringaLungaFile/stringaLunga.c | true | 200 | 802 | #include <stdio.h>
#include <string.h>
int main()
{
FILE *f1, *f2;
char stringa[100], stringaPrecedente[100];
int volta = 0;
f1 = fopen("FILE.txt", "r");
f2 = fopen("risultato.txt", "w");
if(f1 == NULL || f2 == NULL)
{
printf("errore apertura file");
return -1;
}
w... | 3 |
EveBaker/atlas-low_level_programming | 005b718 | search_algorithms/0-linear.c | C | www.github.com/EveBaker/atlas-low_level_programming/tree/main/search_algorithms/0-linear.c | https://raw.githubusercontent.com/EveBaker/atlas-low_level_programming/005b718/search_algorithms/0-linear.c | EveBaker/atlas-low_level_programming 005b718 search_algorithms/0-linear.c | true | 200 | 466 | #include "search_algos.h"
/*
* linear_search - Searches for a value in an array of integers
* using the Linear search algorithm.
*/
int linear_search(int *array, size_t size, int value) {
size_t i;
if (array == NULL) {
return -1;
}
for (i = 0; i < size; i++) {
print... | 3 |
RonBenDavid/Mini-projects | 395e719 | C - Advanced/AVL trees/avltree.c | C | www.github.com/RonBenDavid/Mini-projects/tree/main/C - Advanced/AVL trees/avltree.c | https://raw.githubusercontent.com/RonBenDavid/Mini-projects/395e719/C%20-%20Advanced/AVL%20trees/avltree.c | RonBenDavid/Mini-projects 395e719 C - Advanced/AVL trees/avltree.c | true | 200 | 8,254 | /*
Assigned by:
Ron ben david
*/
#define _CRT_SECURE_NO_DEPRECATE
#include<stdlib.h>
#include<stdio.h>
#include<stdbool.h>
#define COUNT 10
typedef int tree_type;
typedef struct tree {
tree_type data;
struct tree* right, * left, * parent;
int height;
}tree;
/*create a new node*/
tree* create_no... | 7 |
Calembe/alx-low_level_programming | e6bff6d | 0x01-variables_if_else_while/9-times_table.c | C | www.github.com/Calembe/alx-low_level_programming/tree/main/0x01-variables_if_else_while/9-times_table.c | https://raw.githubusercontent.com/Calembe/alx-low_level_programming/e6bff6d/0x01-variables_if_else_while/9-times_table.c | Calembe/alx-low_level_programming e6bff6d 0x01-variables_if_else_while/9-times_table.c | true | 200 | 315 | #include "main.h"
#include <stdio.h>
void times_table(void)
{
int i, j, result;
for (i = 0 ; i < 10 ; i++)
{
for (j = 0 ; j < 10 ; j++)
{
result = i * j;
if (j == 0)
printf("%d, ", result);
else
{
printf("%2d" , result);
if (j != 9)
printf(", ");
}
}
printf("\n");
}
}
| 3 |
Abdul17rahman/alx-low_level_programming | bb43db4 | 0x18-dynamic_libraries/9-strcpy.c | C | www.github.com/Abdul17rahman/alx-low_level_programming/tree/main/0x18-dynamic_libraries/9-strcpy.c | https://raw.githubusercontent.com/Abdul17rahman/alx-low_level_programming/bb43db4/0x18-dynamic_libraries/9-strcpy.c | Abdul17rahman/alx-low_level_programming bb43db4 0x18-dynamic_libraries/9-strcpy.c | true | 200 | 269 | #include "main.h"
/**
* _strncpy - copies a string
* @dest: destination string
* @src: Source string
*
* Description: This function copies a string
* Return: a pointer to the destination
*/
char *_strcpy(char *dest, char *src)
{
return (strcpy(dest, src));
}
| 3 |
Muhammad-Umar26/PfFall23 | da4717f | Labs/06/q03.c | C | www.github.com/Muhammad-Umar26/PfFall23/tree/main/Labs/06/q03.c | https://raw.githubusercontent.com/Muhammad-Umar26/PfFall23/da4717f/Labs/06/q03.c | Muhammad-Umar26/PfFall23 da4717f Labs/06/q03.c | true | 200 | 604 | /*
* Programmer: Muhammad Umar
* Date: 3/10/2023
* Description: Compute the LCM and GCD of two numbers.
*/
#include <stdio.h>
void main(){
int num1, num2, num, greater, i;
printf("\nEnter first and second number : "); //taking user's input
scanf("%d %d", &num1, &num2);
//checking which number is smaller from b... | 7 |
mollanuramin130/Kishor_Sir | 034058a | Complete Task/Qset2/AnsQ3/Calculator.c | C | www.github.com/mollanuramin130/Kishor_Sir/tree/main/Complete Task/Qset2/AnsQ3/Calculator.c | https://raw.githubusercontent.com/mollanuramin130/Kishor_Sir/034058a/Complete%20Task/Qset2/AnsQ3/Calculator.c | mollanuramin130/Kishor_Sir 034058a Complete Task/Qset2/AnsQ3/Calculator.c | true | 200 | 272 | #include<stdio.h>
int main(){
int a=20,b=10;
int add=a+b;
int sub=a-b;
int mul=a*b;
int div=a/b;
int mod=a%b;
printf("Addition is : %d\nSubtraction is : %d\nMultiplication is : %d\nDivition is : %d\nModulation is : %d\n",add,sub,mul,div,mod);
} | 3 |
engkamakia/alx-low_level_programming | 46640c1 | 0x15-file_io/0-read_textfile.c | C | www.github.com/engkamakia/alx-low_level_programming/tree/main/0x15-file_io/0-read_textfile.c | https://raw.githubusercontent.com/engkamakia/alx-low_level_programming/46640c1/0x15-file_io/0-read_textfile.c | engkamakia/alx-low_level_programming 46640c1 0x15-file_io/0-read_textfile.c | true | 200 | 929 | #include "main.h"
/**
* read_textfile -A function that reads a text file and prints the letters.
* @filename: filename.
* @letters: numbers of letters printed.
*
* Return: numbers of letters printed. It fails, returns 0.
*/
ssize_t read_textfile(const char *filename, size_t letters)
{
int f_desc, info, output... | 7 |
Oduo24/alx-low_level_programming | 2dd6016 | 0x06-pointers_arrays_strings/2-strncpy.c | C | www.github.com/Oduo24/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/2-strncpy.c | https://raw.githubusercontent.com/Oduo24/alx-low_level_programming/2dd6016/0x06-pointers_arrays_strings/2-strncpy.c | Oduo24/alx-low_level_programming 2dd6016 0x06-pointers_arrays_strings/2-strncpy.c | true | 200 | 340 | #include "main.h"
/**
* _strncpy - copies from src to dest
* @dest: destination
* @src: source
* @n: number of characters/bytes
* Return: pointer to dest
*/
char *_strncpy(char *dest, char *src, int n)
{
int i;
for (i = 0; i < n && src[i] != '\0'; i++)
dest[i] = src[i];
for (; i < n; i++)
dest[i] = '\0';... | 3 |
Mathwk/alx-low_level_programming | 71db37a | 0x04-more_functions_nested_loops/101-print_number.c | C | www.github.com/Mathwk/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/101-print_number.c | https://raw.githubusercontent.com/Mathwk/alx-low_level_programming/71db37a/0x04-more_functions_nested_loops/101-print_number.c | Mathwk/alx-low_level_programming 71db37a 0x04-more_functions_nested_loops/101-print_number.c | true | 200 | 471 | #include "main.h"
#include <math.h>
/**
* print_number - displays numbers back
* @n: an input
* Return: Always 0
*/
void print_number(int n)
{
unsigned int i, d;
int c, r;
if (n < 0)
{
_putchar('-');
n *= -1;
}
i = n;
for (c = 0; ; c++)
{
if (i / 10 == 0)
break;
i /= 10;
}
for (; c >= 0; c--)
... | 7 |
ArcobalenoX/LINUX | 694069f | net/TCP/tcp_muliti/server.c | C | www.github.com/ArcobalenoX/LINUX/tree/main/net/TCP/tcp_muliti/server.c | https://raw.githubusercontent.com/ArcobalenoX/LINUX/694069f/net/TCP/tcp_muliti/server.c | ArcobalenoX/LINUX 694069f net/TCP/tcp_muliti/server.c | true | 200 | 3,337 | /*server*/
#include "net.h"
#define PORT 50000
#define BUFFER_SIZE 1024
struct msg
{
int fd;
in_port_t port; /* port in network byte order */
struct in_addr addr; /* internet address */
};
void display_time()
{
time_t t;
t = time(NULL);
struct tm *p = localtime(&t);
printf("%d-",190... | 6 |
AbhishekAsht/C-Language- | e4a0337 | Pattern Code/Pattern11/programe2.c | C | www.github.com/AbhishekAsht/C-Language-/tree/main/Pattern Code/Pattern11/programe2.c | https://raw.githubusercontent.com/AbhishekAsht/C-Language-/e4a0337/Pattern%20Code/Pattern11/programe2.c | AbhishekAsht/C-Language- e4a0337 Pattern Code/Pattern11/programe2.c | true | 200 | 195 | #include<stdio.h>
void main(){
int num,count = 0;
printf("Enter a number\n");
scanf("%d",&num);
while(num != 0){
count++;
num = num/10;
}
printf("digit count is %d\n",count);
}
| 4 |
Elshait/Tamara24 | 330eadb | ipc_mem.c | C | www.github.com/Elshait/Tamara24/tree/main/ipc_mem.c | https://raw.githubusercontent.com/Elshait/Tamara24/330eadb/ipc_mem.c | Elshait/Tamara24 330eadb ipc_mem.c | true | 200 | 2,971 | #include<sys/types.h>
#include<sys/ipc.h>
#include<sys/shm.h>
#include<stdio.h>
#include<stdlib.h>
#include<errno.h>
int main(){
int *array; // указатель на массив расположенный в разделённой памяти
int shmid;//идентификатор области разделимой памяти
int new = 1;//признак необходимости создания нового массива
char... | 5 |
kpatsakis/primevul6 | c987217 | 11157.c | C | www.github.com/kpatsakis/primevul6/tree/main/11157.c | https://raw.githubusercontent.com/kpatsakis/primevul6/c987217/11157.c | kpatsakis/primevul6 c987217 11157.c | true | 200 | 365 | read_string(uschar *s, uschar *name)
{
uschar *yield;
uschar *ss;
if (*s != '\"') return string_copy(s);
ss = s;
yield = string_dequote(&s);
if (s == ss+1 || s[-1] != '\"')
log_write(0, LOG_PANIC_DIE|LOG_CONFIG_IN,
"missing quote at end of string value for %s", name);
if (*s != 0) extra_chars_error(s, US"stri... | 3 |
Lucasdeo1/Lista-estatica | ea9ec06 | main.c | C | www.github.com/Lucasdeo1/Lista-estatica/tree/main/main.c | https://raw.githubusercontent.com/Lucasdeo1/Lista-estatica/ea9ec06/main.c | Lucasdeo1/Lista-estatica ea9ec06 main.c | true | 200 | 4,288 | #include <stdio.h>
#include <stdlib.h>
#define MAX 10
//Lucas Deodato
typedef struct {
int fim;
int vetor [MAX];
} lista;
void libera ( lista*l ) {
free(l);
}
lista*cria () {
lista*l;
l = ( lista* ) malloc ( sizeof ( lista ) );
l->fim = 0;
return l;
}
int vazia ( lista *l ) {
if(l->... | 0 |
aradn97/SwervesCMB | 9343061 | createdata.c | C | www.github.com/aradn97/SwervesCMB/tree/main/createdata.c | https://raw.githubusercontent.com/aradn97/SwervesCMB/9343061/createdata.c | aradn97/SwervesCMB 9343061 createdata.c | true | 200 | 511 | #include<stdio.h>
#include<math.h>
#include "doubleinflation.h"
#include "initval.h"
int main()
{
FILE *fpcreatedata;
double klotwo,khitwo,ksteptwo;
double ktwo;
klotwo = 1.0e-5;
khitwo = 1.0;
ksteptwo = log(khitwo/klotwo)/10000;
fpcreatedata = fopen("powers.d","w");
for(int i=0;i<10000;i+... | 2 |
Deltilla/42cursus | f94989b | philosophers/srcs/parse.c | C | www.github.com/Deltilla/42cursus/tree/main/philosophers/srcs/parse.c | https://raw.githubusercontent.com/Deltilla/42cursus/f94989b/philosophers/srcs/parse.c | Deltilla/42cursus f94989b philosophers/srcs/parse.c | true | 200 | 2,741 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* parse.c :+: :+: :+: ... | 7 |
michael-betz/esp32_crt | dc70bf2 | test_draw/http_client_extra.c | C | www.github.com/michael-betz/esp32_crt/tree/main/test_draw/http_client_extra.c | https://raw.githubusercontent.com/michael-betz/esp32_crt/dc70bf2/test_draw/http_client_extra.c | michael-betz/esp32_crt dc70bf2 test_draw/http_client_extra.c | true | 200 | 1,290 | #include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "http_client.h"
#if defined(__EMSCRIPTEN__)
// using emscripten async_wget. No good for fetching from external APIs as it gets blocked by CORS :(
#include "emscripten.h"
static void async_wget_data(void *user_data, void *data, in... | 6 |
srikanthpragada/c_24_sep_2024 | f968482 | chars/pin.c | C | www.github.com/srikanthpragada/c_24_sep_2024/tree/main/chars/pin.c | https://raw.githubusercontent.com/srikanthpragada/c_24_sep_2024/f968482/chars/pin.c | srikanthpragada/c_24_sep_2024 f968482 chars/pin.c | true | 200 | 387 | // Program to accept 4 char and display whether it is a valid pin
#include <stdio.h>
void main()
{
char ch;
int i, count = 0;
printf("Enter PIN :");
for(i = 1; i <= 4; i ++)
{
ch = getch();
putch('*');
if(isdigit(ch))
count ++;
}
if(count == 4)
pri... | 1 |
CalderStaude/C-Programs | ae5849d | PracticeProblems/PassByReference.c | C | www.github.com/CalderStaude/C-Programs/tree/main/PracticeProblems/PassByReference.c | https://raw.githubusercontent.com/CalderStaude/C-Programs/ae5849d/PracticeProblems/PassByReference.c | CalderStaude/C-Programs ae5849d PracticeProblems/PassByReference.c | true | 200 | 2,172 | /*
* This program aims to show how objects may be passed
* by reference rather than by value. This allows multiple
* objects to be returned from a function.
*/
#include <stdio.h>
void printIntArr(int *arr, int arrSize)
{
for (int i = 0; i < arrSize; i++)
{
if (i == arrSize - 1)
{
... | 5 |
0owangjingo0/WZU-OJ | db14849 | chengxushejijichu (2023-2024)/Test 2/1894 jisuanliangdianjiandejuli.c | C | www.github.com/0owangjingo0/WZU-OJ/tree/main/chengxushejijichu (2023-2024)/Test 2/1894 jisuanliangdianjiandejuli.c | https://raw.githubusercontent.com/0owangjingo0/WZU-OJ/db14849/chengxushejijichu%20%282023-2024%29/Test%202/1894%20jisuanliangdianjiandejuli.c | 0owangjingo0/WZU-OJ db14849 chengxushejijichu (2023-2024)/Test 2/1894 jisuanliangdianjiandejuli.c | true | 200 | 197 | #include <stdio.h>
#include <math.h>
int main(void)
{
int x1, y1, x2, y2;
scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
printf("%.2lf\n", sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)));
return 0;
} | 4 |
joseareia/ctemplate | dbd7710 | template_s/server.c | C | www.github.com/joseareia/ctemplate/tree/main/template_s/server.c | https://raw.githubusercontent.com/joseareia/ctemplate/dbd7710/template_s/server.c | joseareia/ctemplate dbd7710 template_s/server.c | true | 200 | 3,055 | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <limits.h>
#include <unistd.h>
#include <time.h>
#include <sys/types.h>
#include <arpa/inet.h>
#include <sys/socket.h>
#include "debug.h"
#include "common.h"
#include "server_opt.h"
int bind_udp_server(unsigned short port);
struct sockaddr_in get_add... | 3 |
Mateusz0W/AGH-PP2022 | 0b59842 | lab4/zad2.c | C | www.github.com/Mateusz0W/AGH-PP2022/tree/main/lab4/zad2.c | https://raw.githubusercontent.com/Mateusz0W/AGH-PP2022/0b59842/lab4/zad2.c | Mateusz0W/AGH-PP2022 0b59842 lab4/zad2.c | true | 200 | 1,210 | #include <stdio.h>
#include<stdlib.h>
#include <time.h>
//generowanie liczb losowych calkowitych z przedziału (min, max)
int i_rand(int min, int max){
return rand() % (max-min+1) + min;
}
void wypisz_i (int *poczatek, int *koniec) {
while (poczatek < koniec)
printf ("%4d ", *poczatek++); ... | 0 |
c8ef/CS61C | e94b657 | labs/lab05a/transpose.c | C | www.github.com/c8ef/CS61C/tree/main/labs/lab05a/transpose.c | https://raw.githubusercontent.com/c8ef/CS61C/e94b657/labs/lab05a/transpose.c | c8ef/CS61C e94b657 labs/lab05a/transpose.c | true | 200 | 871 | #include "transpose.h"
/* The naive transpose function as a reference. */
void transpose_naive(int n, int blocksize, int *dst, int *src) {
for (int x = 0; x < n; x++) {
for (int y = 0; y < n; y++) {
dst[y + x * n] = src[x + y * n];
}
}
}
/* Implement cache blocking below. You should NOT assume that ... | 2 |
Muawia24/binary_trees | bb20b33 | 16-binary_tree_is_perfect.c | C | www.github.com/Muawia24/binary_trees/tree/main/16-binary_tree_is_perfect.c | https://raw.githubusercontent.com/Muawia24/binary_trees/bb20b33/16-binary_tree_is_perfect.c | Muawia24/binary_trees bb20b33 16-binary_tree_is_perfect.c | true | 200 | 1,339 | #include "binary_trees.h"
/**
* tree_height - measures the height of a binary tree
* @tree: is a pointer to the root node of the tree to measure
* the height.
* Return: number of tree height or 0 if empty tree
*/
int tree_height(const binary_tree_t *tree)
{
int a, b;
if (tree == NULL)
return (0);
{
if (tre... | 7 |
iddle254/alx-low_level_programming | 9a50aeb | 0x02-functions_nested_loops/103-fibonacci.c | C | www.github.com/iddle254/alx-low_level_programming/tree/main/0x02-functions_nested_loops/103-fibonacci.c | https://raw.githubusercontent.com/iddle254/alx-low_level_programming/9a50aeb/0x02-functions_nested_loops/103-fibonacci.c | iddle254/alx-low_level_programming 9a50aeb 0x02-functions_nested_loops/103-fibonacci.c | true | 200 | 607 | #include "main.h"
#include <stdio.h>
/**
* fibonacci_even - find even fibonacci
* Description: gets the sum of even fibonacci numbers
* Return: null
*/
void fibonacci_even(void)
{
long int first = 1, second = 2, next = first + second, even_sum = 0;
while (second <= 4000000)
{
if ((first % 2) == 0)
even_sum... | 6 |
mmarinel/42-minishell | 0242a7d | read/parser/parse_cases/parse_statement.c | C | www.github.com/mmarinel/42-minishell/tree/main/read/parser/parse_cases/parse_statement.c | https://raw.githubusercontent.com/mmarinel/42-minishell/0242a7d/read/parser/parse_cases/parse_statement.c | mmarinel/42-minishell 0242a7d read/parser/parse_cases/parse_statement.c | true | 200 | 2,526 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* parse_statement.c :+: :+: :+: ... | 5 |
nathanlo99/c_compiler | c7b6acf | tests/turnt/run_program/array/merge_sort.c | C | www.github.com/nathanlo99/c_compiler/tree/main/tests/turnt/run_program/array/merge_sort.c | https://raw.githubusercontent.com/nathanlo99/c_compiler/c7b6acf/tests/turnt/run_program/array/merge_sort.c | nathanlo99/c_compiler c7b6acf tests/turnt/run_program/array/merge_sort.c | true | 200 | 1,440 |
int merge(int *arr, int left, int mid, int right) {
int i = 0;
int j = 0;
int k = 0;
int n1 = 0;
int n2 = 0;
int *L = NULL;
int *R = NULL;
int cont = 1;
n1 = mid - left + 1;
n2 = right - mid;
L = new int[n1];
R = new int[n2];
i = 0;
while (i < n1) {
*(L + i) = *(arr + left + i);
i =... | 1 |
yishap/DSA-Classes | b01feee | 25 july assign/q25_vowel_e.c | C | www.github.com/yishap/DSA-Classes/tree/main/25 july assign/q25_vowel_e.c | https://raw.githubusercontent.com/yishap/DSA-Classes/b01feee/25%20july%20assign/q25_vowel_e.c | yishap/DSA-Classes b01feee 25 july assign/q25_vowel_e.c | true | 200 | 834 | // Write a program in c to display name and cgpa where the name contains only one vowel "E".
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
struct student{
int rollno;
char name[20];
float cgpa;
}s[5];
int vowel_e(struct student s[]){
int i;
printf("\nStudents whose name contains only on... | 4 |
Nimrod02/holbertonschool-binary_trees | f844729 | 1-binary_tree_insert_left.c | C | www.github.com/Nimrod02/holbertonschool-binary_trees/tree/main/1-binary_tree_insert_left.c | https://raw.githubusercontent.com/Nimrod02/holbertonschool-binary_trees/f844729/1-binary_tree_insert_left.c | Nimrod02/holbertonschool-binary_trees f844729 1-binary_tree_insert_left.c | true | 200 | 681 | #include "binary_trees.h"
/**
* binary_tree_insert_left - main function that add a node to the left branch
* @parent: parent node.
* @value: store the data for the new nodes.
*
* Return: the new node
*/
binary_tree_t *binary_tree_insert_left(binary_tree_t *parent, int value)
{
binary_tree_t *newNode;
if (par... | 3 |
tuong194/RD_mini_hub | 04be37a | main/app_wifi.c | C | www.github.com/tuong194/RD_mini_hub/tree/main/main/app_wifi.c | https://raw.githubusercontent.com/tuong194/RD_mini_hub/04be37a/main/app_wifi.c | tuong194/RD_mini_hub 04be37a main/app_wifi.c | true | 200 | 15,304 | /*
* app_wifi.c
*
* Created on: Aug 16, 2022
* Author: tongv
*/
#include "app_udp_server.h"
#include "app_wifi.h"
#include "mongoose.h"
#include "mqtt_subscriber.h"
#include "mqtt_publisher.h"
// #include "subscribe_publish_sample.h"
#include "app_ble_mesh_provi.h"
#include "app_storage.h"
#include "app_ble_... | 0 |
SarahB0307/Projet-ecosys | cc37fe7 | main_tests2.c | C | www.github.com/SarahB0307/Projet-ecosys/tree/main/main_tests2.c | https://raw.githubusercontent.com/SarahB0307/Projet-ecosys/cc37fe7/main_tests2.c | SarahB0307/Projet-ecosys cc37fe7 main_tests2.c | true | 200 | 3,000 | #include <stdlib.h>
#include <unistd.h>
#include <stdio.h>
#include <assert.h>
#include <time.h>
#include <string.h>
#include "ecosys.h"
int main(void){
srand(time(NULL));
int i;
/* création de listes liste_proies et liste_predateurs */
Animal* liste_proies=NULL;
Animal* liste_predateurs=NULL;
for(i=0;i<20;i+... | 2 |
FURKANDURAN60/C-Dili-Calismalar-ve-Basit-Projeler | 9c0bcf0 | C ve C++/fonksiyonlar/YapisalProgramlama-9/YapisalProgramlama-1/9.c | C | www.github.com/FURKANDURAN60/C-Dili-Calismalar-ve-Basit-Projeler/tree/main/C ve C++/fonksiyonlar/YapisalProgramlama-9/YapisalProgramlama-1/9.c | https://raw.githubusercontent.com/FURKANDURAN60/C-Dili-Calismalar-ve-Basit-Projeler/9c0bcf0/C%20ve%20C%2B%2B/fonksiyonlar/YapisalProgramlama-9/YapisalProgramlama-1/9.c | FURKANDURAN60/C-Dili-Calismalar-ve-Basit-Projeler 9c0bcf0 C ve C++/fonksiyonlar/YapisalProgramlama-9/YapisalProgramlama-1/9.c | true | 200 | 655 | //Suleyman UZUN
//Yapısal Programlama - Hesap Makinesi
// ******* Bir oncekinden Farklar *******
//Yazma islemi farkli sayfaya aliniyor
#include <stdio.h>
#include <stdlib.h>
#include "Header.h"
float main() {
float sayi1, sayi2;
float toplam = 0, fark = 0, carpim = 0;
printf("\t ******* Hesaplanacak Verilerin G... | 7 |
kimminhyeon1/DoublyCircularLinkedList | c85764c | 0604_5701580.c | C | www.github.com/kimminhyeon1/DoublyCircularLinkedList/tree/main/0604_5701580.c | https://raw.githubusercontent.com/kimminhyeon1/DoublyCircularLinkedList/c85764c/0604_5701580.c | kimminhyeon1/DoublyCircularLinkedList c85764c 0604_5701580.c | true | 200 | 2,140 | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
typedef int element;
typedef struct DListNode{
element data;
struct DListNode* llink;
struct DListNode* rlink;
}DListNode;
void init(DListNode* phead) {
phead->llink = phead;
phead->rlink = phead;
}
void print_dlist(DListNode* phead) {
DLi... | 5 |
RaunakKumar-byte/C-programme | 3168dbe | 3qch3.c | C | www.github.com/RaunakKumar-byte/C-programme/tree/main/3qch3.c | https://raw.githubusercontent.com/RaunakKumar-byte/C-programme/3168dbe/3qch3.c | RaunakKumar-byte/C-programme 3168dbe 3qch3.c | true | 200 | 324 | # include<stdio.h>
#include<math.h>
int main(int argc, char const *argv[])
{
int marks;
printf("enter marks");
scanf("%d", &marks);
if(marks >= 90) {
printf("a++");
}
else if(marks > 80 && marks < 70) {
printf("b++");
}
else {
printf("c++");
}
return 0;
... | 1 |
khadas/android_common_driver_modules_gpu | a809f98 | bifrost/r9p0/kernel/drivers/gpu/arm/midgard/mali_kbase_defs.h | C | www.github.com/khadas/android_common_driver_modules_gpu/tree/main/bifrost/r9p0/kernel/drivers/gpu/arm/midgard/mali_kbase_defs.h | https://raw.githubusercontent.com/khadas/android_common_driver_modules_gpu/a809f98/bifrost/r9p0/kernel/drivers/gpu/arm/midgard/mali_kbase_defs.h | khadas/android_common_driver_modules_gpu a809f98 bifrost/r9p0/kernel/drivers/gpu/arm/midgard/mali_kbase_defs.h | true | 200 | 48,946 | /*
*
* (C) COPYRIGHT 2011-2017 ARM Limited. All rights reserved.
*
* This program is free software and is provided to you under the terms of the
* GNU General Public License version 2 as published by the Free Software
* Foundation, and any use by you of this program is subject to the terms
* of such GNU licence.... | 6 |
liujf69/Socket-Programming | e3cec25 | Chapter16/seq_clnt.c | C | www.github.com/liujf69/Socket-Programming/tree/main/Chapter16/seq_clnt.c | https://raw.githubusercontent.com/liujf69/Socket-Programming/e3cec25/Chapter16/seq_clnt.c | liujf69/Socket-Programming e3cec25 Chapter16/seq_clnt.c | true | 200 | 1,162 | // gcc seq_clnt.c -o seq_clnt
// ./seq_clnt 127.0.0.1 9190
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <arpa/inet.h>
#include <sys/socket.h>
#define BUF_SIZE 1024
int main(int argc, char *argv[]){
int sock;
char buf[BUF_SIZE];
struct sockaddr_in serv_adr;
... | 3 |
osw00817/PNU-HATERS | bcecf5b | Nayeeun5/week04/BOJ_1021_회전하는큐.c | C | www.github.com/osw00817/PNU-HATERS/tree/main/Nayeeun5/week04/BOJ_1021_회전하는큐.c | https://raw.githubusercontent.com/osw00817/PNU-HATERS/bcecf5b/Nayeeun5/week04/BOJ_1021_%ED%9A%8C%EC%A0%84%ED%95%98%EB%8A%94%ED%81%90.c | osw00817/PNU-HATERS bcecf5b Nayeeun5/week04/BOJ_1021_회전하는큐.c | true | 200 | 1,853 | #include <stdio.h>
#include <stdlib.h>
#define MAX 1000
typedef struct {
int data[MAX];
int front, rear, size;
} Queue;
void initQueue(Queue* q) {
q->front = q->rear = 0;
q->size = 0;
}
void add(Queue* q, int value) {
q->data[q->rear] = value;
q->rear = (q->rear + 1) % MAX;
q->size++;
}
... | 0 |
kpatsakis/primevul10 | 0e7c7c0 | 209289.c | C | www.github.com/kpatsakis/primevul10/tree/main/209289.c | https://raw.githubusercontent.com/kpatsakis/primevul10/0e7c7c0/209289.c | kpatsakis/primevul10 0e7c7c0 209289.c | true | 200 | 569 | static Jsi_TreeEntry *OneWordCreate( Jsi_Tree *treePtr, const void *key, bool *newPtr)
{
Jsi_TreeEntry *hPtr;
size_t size;
if ((hPtr = Jsi_TreeEntryFind(treePtr, key))) {
if (newPtr)
*newPtr = 0;
return hPtr;
}
if (newPtr)
*newPtr = 1;
size = sizeof(Jsi_TreeEn... | 2 |
fckaye/3d-renderer | 7ea4157 | src/camera.c | C | www.github.com/fckaye/3d-renderer/tree/main/src/camera.c | https://raw.githubusercontent.com/fckaye/3d-renderer/7ea4157/src/camera.c | fckaye/3d-renderer 7ea4157 src/camera.c | true | 200 | 1,882 | #include "camera.h"
static camera_t camera;
void init_camera(vec3_t position, vec3_t direction)
{
camera.position = position;
camera.direction = direction;
camera.forward_velocity = vec3_new(0, 0, 0);
camera.yaw = 0.0;
camera.pitch = 0.0;
}
vec3_t get_camera_position(void)
{
return camera.pos... | 7 |
olelong/42_minishell | 4953121 | srcs/utils/cmd_list_utils.c | C | www.github.com/olelong/42_minishell/tree/main/srcs/utils/cmd_list_utils.c | https://raw.githubusercontent.com/olelong/42_minishell/4953121/srcs/utils/cmd_list_utils.c | olelong/42_minishell 4953121 srcs/utils/cmd_list_utils.c | true | 200 | 2,383 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* cmd_list_utils.c :+: :+: :+: ... | 5 |
emrysben/alx-low_level_programming | 2d73527 | 0x04-more_functions_nested_loops/1-isdigit.c | C | www.github.com/emrysben/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/1-isdigit.c | https://raw.githubusercontent.com/emrysben/alx-low_level_programming/2d73527/0x04-more_functions_nested_loops/1-isdigit.c | emrysben/alx-low_level_programming 2d73527 0x04-more_functions_nested_loops/1-isdigit.c | true | 200 | 244 | #include "main.h"
/**
* _isdigit - checks for a digit
* @c: character to determine
* Return: 1 if c is a digit otherwise 0
*/
int _isdigit(__attribute__((unused))int c)
{
if (("c >= '0') && (c <= '9'"))
{
return (1);
}
return (0);
}
| 1 |
jordanmefujie/alx-low_level_programming | 767baa4 | 0x01-variables_if_else_while/101-print_comb4.c | C | www.github.com/jordanmefujie/alx-low_level_programming/tree/main/0x01-variables_if_else_while/101-print_comb4.c | https://raw.githubusercontent.com/jordanmefujie/alx-low_level_programming/767baa4/0x01-variables_if_else_while/101-print_comb4.c | jordanmefujie/alx-low_level_programming 767baa4 0x01-variables_if_else_while/101-print_comb4.c | true | 200 | 432 | #include <stdio.h>
/**
* main -main function
* Return: 0
*/
int main(void)
{
int i;
int j;
int k;
for (i = 0 ; i < 10 ; i++)
{
for (j = 0 ; j < 10 ; j++)
{
for (k = 0 ; k < 10 ; k++)
{
if (i < j && j < k)
{
putchar(i + '0');
putchar(j + '0');
putchar(k + '0');
if (i + j + ... | 6 |
Loser-Lii/AMS | f45998a | AMS1/model.h | C | www.github.com/Loser-Lii/AMS/tree/main/AMS1/model.h | https://raw.githubusercontent.com/Loser-Lii/AMS/f45998a/AMS1/model.h | Loser-Lii/AMS f45998a AMS1/model.h | true | 200 | 1,705 | #ifndef MODEL_H
#define MODEL_H
#include <time.h>
typedef struct Card
{
char aName[18]; //����
char aPwd[8]; //������
int nStatus; //��״̬��0-δ�ϻ���1-�����ϻ���2-��ע����3-ʧЧ��
float fAmount; //�ۼƽ��
int nUseCount; //ʹ�ô���
float fBalance; //���
float exBalance; //��Ա��ֵ�������
f... | 3 |
Mub2023/alx-low_level_programming | 8611d3b | 0x0C-more_malloc_free/3-array_range.c | C | www.github.com/Mub2023/alx-low_level_programming/tree/main/0x0C-more_malloc_free/3-array_range.c | https://raw.githubusercontent.com/Mub2023/alx-low_level_programming/8611d3b/0x0C-more_malloc_free/3-array_range.c | Mub2023/alx-low_level_programming 8611d3b 0x0C-more_malloc_free/3-array_range.c | true | 200 | 504 | #include "main.h"
#include <stdio.h>
#include <stdlib.h>
/**
* array_range - that creates an array of integers.
* @min:an array to sort and change
* @max: and array to sort and change
* Return: the pointer to the newly created array
*/
int *array_range(int min, int max)
{
int *myp;
int a, size;
if (min > max)
... | 4 |
lednikita0481/Differenciator | edc90b6 | Tree.h | C | www.github.com/lednikita0481/Differenciator/tree/main/Tree.h | https://raw.githubusercontent.com/lednikita0481/Differenciator/edc90b6/Tree.h | lednikita0481/Differenciator edc90b6 Tree.h | true | 200 | 959 | #include <stdio.h>
enum Node_Types
{
NUMBER,
VARIABLE,
OPERATOR,
};
enum Operators
{
PLUS,
MINUS,
MUL,
DIV,
SIN,
COS,
TG,
CTG,
EXP,
POW,
UNKNOWN_OPERATOR
};
union Node_Value
{
int int_value;
double double_value;
};
struct Node
{
Node_Types type;
... | 2 |
kpatsakis/primevul6 | c987217 | 125405.c | C | www.github.com/kpatsakis/primevul6/tree/main/125405.c | https://raw.githubusercontent.com/kpatsakis/primevul6/c987217/125405.c | kpatsakis/primevul6 c987217 125405.c | true | 200 | 1,063 | xfs_fill_fsxattr(
struct xfs_inode *ip,
int whichfork,
struct fileattr *fa)
{
struct xfs_mount *mp = ip->i_mount;
struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork);
fileattr_fill_xflags(fa, xfs_ip2xflags(ip));
if (ip->i_diflags & XFS_DIFLAG_EXTSIZE) {
fa->fsx_extsize = XFS_FSB_TO_B(mp, ip->i_extsize);
... | 7 |
Thabisile97/alx-low_level_programming | 62e77fb | 0x01-variables_if_else_while/2-print_alphabet.c | C | www.github.com/Thabisile97/alx-low_level_programming/tree/main/0x01-variables_if_else_while/2-print_alphabet.c | https://raw.githubusercontent.com/Thabisile97/alx-low_level_programming/62e77fb/0x01-variables_if_else_while/2-print_alphabet.c | Thabisile97/alx-low_level_programming 62e77fb 0x01-variables_if_else_while/2-print_alphabet.c | true | 200 | 397 | #include <stdio.h>
#include <ctype.h>
/**
* main - main is entry point of the program
*
* Return: returns 0 (zero)
*/
int main(void)
{
char alphabet[] = "abcdefghijklmnopqrstuvwxyz";
int x;
int y =0
for (x = 0; x < 2; x++)
{
while (y <= 25)
{
if (x == 0)
putchar(alphabet[y]);
else
putchar(t... | 0 |
kwakye02/alx-low_level_programming | f46da69 | 0x14-bit_manipulation/4-clear_bit.c | C | www.github.com/kwakye02/alx-low_level_programming/tree/main/0x14-bit_manipulation/4-clear_bit.c | https://raw.githubusercontent.com/kwakye02/alx-low_level_programming/f46da69/0x14-bit_manipulation/4-clear_bit.c | kwakye02/alx-low_level_programming f46da69 0x14-bit_manipulation/4-clear_bit.c | true | 200 | 320 | #include "main.h"
/**
*clear_bit - sets the value of a bit to 0 at a given index
*@n: pointer to the binary digits
*@index: index to be used
*Return: -1 or 0
*/
int clear_bit(unsigned long int *n, unsigned int index)
{
if (index >= (sizeof(unsigned long int) * 8))
return (-1);
*n &= ~(1 << index);
return (1);
}
| 5 |
Dobromilov/lab-on-prog | c4bdd25 | One-dimensional arrays/l.c | C | www.github.com/Dobromilov/lab-on-prog/tree/main/One-dimensional arrays/l.c | https://raw.githubusercontent.com/Dobromilov/lab-on-prog/c4bdd25/One-dimensional%20arrays/l.c | Dobromilov/lab-on-prog c4bdd25 One-dimensional arrays/l.c | true | 200 | 2,972 | // //4
// #define N 5
// #include <stdio.h>
// void print_array(int n, int array[n]) {
// printf("mas: ");
// for (int i = 0; i < n; i++) {
// printf("%d ", array[i]);
// }
// printf("\n");
// }
// int mx_array(int n, int array[]) {
// int mx = array[0];
// for (int i = 1; i < n; i++)... | 6 |
Stremps/Codigos-da-Maratona | 53e24b1 | Maratona/cses/Permutations.c | C | www.github.com/Stremps/Codigos-da-Maratona/tree/main/Maratona/cses/Permutations.c | https://raw.githubusercontent.com/Stremps/Codigos-da-Maratona/53e24b1/Maratona/cses/Permutations.c | Stremps/Codigos-da-Maratona 53e24b1 Maratona/cses/Permutations.c | true | 200 | 648 | #include <stdio.h>
#define MAX 1000000
void print_vet(long int vetor[], long int tamanho){
int i;
for(i = 0; i < tamanho; i++)
printf("%ld ", vetor[i]);
}
int main(){
long int n, vp[MAX/2], vi[MAX/2], i, im, pa;
scanf("%ld", &n);
if(n < 4 && n != 1)
printf("NO SOLUTION\n");
el... | 1 |
gabrielalb5/ESDD | 668de0e | ex_avaliativo2/BuscaSemIndex/main.c | C | www.github.com/gabrielalb5/ESDD/tree/main/ex_avaliativo2/BuscaSemIndex/main.c | https://raw.githubusercontent.com/gabrielalb5/ESDD/668de0e/ex_avaliativo2/BuscaSemIndex/main.c | gabrielalb5/ESDD 668de0e ex_avaliativo2/BuscaSemIndex/main.c | true | 200 | 685 | #include "lib.h"
int main(){
int procurado;
int v[TAM];
int posicao;
clock_t start, end;
double cpu_time_used;
srand(1);
gerarCrescente(1, v);
printf("Digite o número procurado: ");
scanf("%d",&procurado);
start = clock();
posicao = buscaSequencial(v,procurado);
... | 3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.