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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
MahmadHadi/C | 1fded50 | arrays/1DArray/checkGreaterEle.c | C | www.github.com/MahmadHadi/C/tree/main/arrays/1DArray/checkGreaterEle.c | https://raw.githubusercontent.com/MahmadHadi/C/1fded50/arrays/1DArray/checkGreaterEle.c | MahmadHadi/C 1fded50 arrays/1DArray/checkGreaterEle.c | true | 200 | 467 | //count the number of elements in given array greater than a given number x
#include<stdio.h>
int main()
{
int x;
printf("Enter value of x: ");
scanf("%d",&x);
int arr[]={1,2,3,4,5};
int size,check;
size=sizeof(arr)/sizeof(arr[0]);
for(int i=0;i<size;i++)
... | 4 |
felchion/sjever-ts | 3b2f643 | d/baituo/shidui.c | C | www.github.com/felchion/sjever-ts/tree/main/d/baituo/shidui.c | https://raw.githubusercontent.com/felchion/sjever-ts/3b2f643/d/baituo/shidui.c | felchion/sjever-ts 3b2f643 d/baituo/shidui.c | true | 200 | 4,304 | #include <ansi.h>
inherit ROOM;
void create()
{
set("short", "乱石堆");
set("long", @LONG
这里四周所围全是巨石，地上铺满了凌乱的碎石子，象是被人击打巨
石所打下来的碎块。正中一块平滑的青石板上蹲着一只雪白的蛤蟆。
LONG);
set("objects", ([
__DIR__"npc/chanchu" : 1,
BINGQI_D("gs-zhang") : 1,
]));
set("item_desc", ([
"stone": "\n这些巨石都有凹面，看得出是被人拿来练掌力用的。\n",
])... | 2 |
roor48/Only_Online-Judge | a37676e | 백준/Silver/2503. 숫자 야구/숫자 야구.c | C | www.github.com/roor48/Only_Online-Judge/tree/main/백준/Silver/2503. 숫자 야구/숫자 야구.c | https://raw.githubusercontent.com/roor48/Only_Online-Judge/a37676e/%EB%B0%B1%EC%A4%80/Silver/2503.%E2%80%85%EC%88%AB%EC%9E%90%E2%80%85%EC%95%BC%EA%B5%AC/%EC%88%AB%EC%9E%90%E2%80%85%EC%95%BC%EA%B5%AC.c | roor48/Only_Online-Judge a37676e 백준/Silver/2503. 숫자 야구/숫자 야구.c | true | 200 | 1,361 | #include <stdio.h>
#include <memory.h>
#include <stdlib.h>
int possible[504][3];
int len, cnt = 504;
int *checkVal(int *answer, int *input)
{
int *val = (int*)malloc(sizeof(int) * 2);
val[0] = val[1] = 0;
for (int i = 0; i < 3; i++)
{
if (answer[i] == input[i])
{
val[0]++;
}
else
... | 6 |
Sayar-212/My_Leetcodes | d2bf75e | 2171-second-minimum-time-to-reach-destination/second-minimum-time-to-reach-destination.c | C | www.github.com/Sayar-212/My_Leetcodes/tree/main/2171-second-minimum-time-to-reach-destination/second-minimum-time-to-reach-destination.c | https://raw.githubusercontent.com/Sayar-212/My_Leetcodes/d2bf75e/2171-second-minimum-time-to-reach-destination/second-minimum-time-to-reach-destination.c | Sayar-212/My_Leetcodes d2bf75e 2171-second-minimum-time-to-reach-destination/second-minimum-time-to-reach-destination.c | true | 200 | 4,525 | typedef struct {
int node;
int time;
} State;
typedef struct {
State* data;
int size;
int capacity;
} MinHeap;
void swap(State* a, State* b) {
State temp = *a;
*a = *b;
*b = temp;
}
MinHeap* createMinHeap(int capacity) {
MinHeap* heap = (MinHeap*)malloc(sizeof(MinHeap));
heap-... | 1 |
SebastianSerranoB/tp_laboratorio_1 | f57481e | TP_1/src/TP_1.c | C | www.github.com/SebastianSerranoB/tp_laboratorio_1/tree/main/TP_1/src/TP_1.c | https://raw.githubusercontent.com/SebastianSerranoB/tp_laboratorio_1/f57481e/TP_1/src/TP_1.c | SebastianSerranoB/tp_laboratorio_1 f57481e TP_1/src/TP_1.c | true | 200 | 3,227 | /*
============================================================================
Name : TP_1.c
Autor : Serrano Belloso Sebastian
Division : k-1
UTN FRA 2022 - Laboratorio de Programacion 1- Trabajo practico 1.
Fecha de entrega: 16/04/2022.
==========================================================... | 0 |
SachinTripathi56/GCC | e7499ba | charquestion.c | C | www.github.com/SachinTripathi56/GCC/tree/main/charquestion.c | https://raw.githubusercontent.com/SachinTripathi56/GCC/e7499ba/charquestion.c | SachinTripathi56/GCC e7499ba charquestion.c | true | 200 | 363 | #include <stdio.h>
int main()
{
char a;
printf("enter your character");
scanf("%c",&a);
if(65<=a&&a<=90){
printf("its is uppercase");
}
else if(97<=a&&a<=122){
printf("its is lowercase");
}
else if(48<=a&&a<=57){
printf("its num");
}
else{
printf("conditi... | 5 |
arundeegutla/cpjudge | dfd24a1 | locals/solutions/soccer/soccerTimothy.c | C | www.github.com/arundeegutla/cpjudge/tree/main/locals/solutions/soccer/soccerTimothy.c | https://raw.githubusercontent.com/arundeegutla/cpjudge/dfd24a1/locals/solutions/soccer/soccerTimothy.c | arundeegutla/cpjudge dfd24a1 locals/solutions/soccer/soccerTimothy.c | true | 200 | 1,246 | #include <stdio.h>
int xs[22];
int ys[22];
int n;
int min(int a, int b) {
return a < b ? a : b;
}
int max(int a, int b) {
return a > b ? a : b;
}
int isBetween(int ai, int bi, int ci) {
int ax = xs[ai], ay = ys[ai];
int bx = xs[bi], by = ys[bi];
int cx = xs[ci], cy = ys[ci];
if (bx < min(ax,... | 2 |
ludiane-tr/holbertonschool-low_level_programming | c91c75d | variadic_functions/1-print_numbers.c | C | www.github.com/ludiane-tr/holbertonschool-low_level_programming/tree/main/variadic_functions/1-print_numbers.c | https://raw.githubusercontent.com/ludiane-tr/holbertonschool-low_level_programming/c91c75d/variadic_functions/1-print_numbers.c | ludiane-tr/holbertonschool-low_level_programming c91c75d variadic_functions/1-print_numbers.c | true | 200 | 567 | #include "variadic_functions.h"
#include <stdarg.h>
#include <stdio.h>
/**
* print_numbers - prints numbers followed by a new line
* @separator: String to be printed between numbers
* @n: number of variadic arguments
* @...: Arguments Variadic
*
* Return: No return
*/
void print_numbers(const char *separator, c... | 3 |
EshwarChawda/Software-Systems | fbbc7f4 | Hands-On-2/7/7.c | C | www.github.com/EshwarChawda/Software-Systems/tree/main/Hands-On-2/7/7.c | https://raw.githubusercontent.com/EshwarChawda/Software-Systems/fbbc7f4/Hands-On-2/7/7.c | EshwarChawda/Software-Systems fbbc7f4 Hands-On-2/7/7.c | true | 200 | 1,429 | /*
============================================================================
Name : 7.c
Author : Eshwar Chawda
Description : Write a simple program to print the created thread ids.
Date: 14th Sep, 2024.
============================================================================
*/
#include <pthread.h>
#include <std... | 6 |
cpmoore0317/holbertonschool-binary_trees | f9171d9 | 16-binary_tree_is_perfect.c | C | www.github.com/cpmoore0317/holbertonschool-binary_trees/tree/main/16-binary_tree_is_perfect.c | https://raw.githubusercontent.com/cpmoore0317/holbertonschool-binary_trees/f9171d9/16-binary_tree_is_perfect.c | cpmoore0317/holbertonschool-binary_trees f9171d9 16-binary_tree_is_perfect.c | true | 200 | 1,093 | #include "binary_trees.h"
/**
* binary_tree_height - Calculates the height of a binary tree.
* @tree: A pointer to the root node of the tree.
*
* Return: The height of the tree.
*/
size_t binary_tree_height(const binary_tree_t *tree)
{
size_t left_height, right_height;
if (tree == NULL)
return (0);
left_h... | 7 |
jimd1989/delay | eb9107e | src/test/interpreter.c | C | www.github.com/jimd1989/delay/tree/main/src/test/interpreter.c | https://raw.githubusercontent.com/jimd1989/delay/eb9107e/src/test/interpreter.c | jimd1989/delay eb9107e src/test/interpreter.c | true | 200 | 1,780 | #include <err.h>
#include <stdbool.h>
#include "../audio/audio_settings.h"
#include "../input/parameters.h"
#include "../vm/compiler.h"
#include "../vm/interpreter.h"
#include "../vm/program.h"
#include "interpreter.h"
void testInterpreter(void) {
AudioSettings a = {0};
Parameters par = parameters();
Variables ... | 1 |
tazy-dev/alx-low_level_programming | 2541707 | 0x02-functions_nested_loops/1-alphabet.c | C | www.github.com/tazy-dev/alx-low_level_programming/tree/main/0x02-functions_nested_loops/1-alphabet.c | https://raw.githubusercontent.com/tazy-dev/alx-low_level_programming/2541707/0x02-functions_nested_loops/1-alphabet.c | tazy-dev/alx-low_level_programming 2541707 0x02-functions_nested_loops/1-alphabet.c | true | 200 | 234 | #include "main.h"
/**
* print_alphabet - prints the alphabet in lowercase, followed by a new line.
*/
void print_alphabet(void)
{
char alpha;
for (alpha = 'a'; alpha <= 'z'; alpha++)
{
_putchar(alpha);
}
_putchar('\n');
}
| 0 |
AbdalrhmanOmar-2002/alx-low_level_programming | 990ecce | 0x06-pointers_arrays_strings/6-cap_string.c | C | www.github.com/AbdalrhmanOmar-2002/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/6-cap_string.c | https://raw.githubusercontent.com/AbdalrhmanOmar-2002/alx-low_level_programming/990ecce/0x06-pointers_arrays_strings/6-cap_string.c | AbdalrhmanOmar-2002/alx-low_level_programming 990ecce 0x06-pointers_arrays_strings/6-cap_string.c | true | 200 | 768 | #include "main.h"
/**
* isLower - determines whether ascii is lowercase .
*
* @c: char
*
* Return: 1 if true, 0 if false
*/
int isLower(char c)
{
return (c >= 97 && c <= 122);
}
/**
* isDelimiter - determines whether ascii is a Delimiter.
*
* @c: char
*
* Return: 1 if true, 0 if false
*/
int isDelimiter(... | 5 |
Viimayonnaise/ing1-quoridor-2024-1-6 | e22d21b | florian/main.c | C | www.github.com/Viimayonnaise/ing1-quoridor-2024-1-6/tree/main/florian/main.c | https://raw.githubusercontent.com/Viimayonnaise/ing1-quoridor-2024-1-6/e22d21b/florian/main.c | Viimayonnaise/ing1-quoridor-2024-1-6 e22d21b florian/main.c | true | 200 | 2,684 | #include <stdio.h>
#include <stdlib.h>
#include <windows.h>
void Color(int couleurDuTexte,int couleurDeFond) // fonction d'affichage de couleurs
{
HANDLE H=GetStdHandle(STD_OUTPUT_HANDLE);
SetConsoleTextAttribute(H,couleurDeFond*16+couleurDuTexte);
}
void couleur1(){
Color(0,0);
printf("%c",0xDC);
}
v... | 2 |
YALDZJC/old_Infantry_Gimbal | 48ddd47 | FreeRTOS_infantry_gimbal_IT/Application/Src/app_CH110.c | C | www.github.com/YALDZJC/old_Infantry_Gimbal/tree/main/FreeRTOS_infantry_gimbal_IT/Application/Src/app_CH110.c | https://raw.githubusercontent.com/YALDZJC/old_Infantry_Gimbal/48ddd47/FreeRTOS_infantry_gimbal_IT/Application/Src/app_CH110.c | YALDZJC/old_Infantry_Gimbal 48ddd47 FreeRTOS_infantry_gimbal_IT/Application/Src/app_CH110.c | true | 200 | 3,644 | #define APP_CH110_GLOBALS
#include "includes.h"
void CH110_task( void *pvParameters )
{
uint8_t rx_buf[CH110_data_size];
uint32_t StdId;
uint8_t first_received = false;
float roll_offset = 0;
float pitch_offset = 0;
float yaw_offset = 0;
float roll_previous = 0;
float pitch_previous = 0;
float yaw_previous ... | 3 |
indoming/42 | 47af37f | philo/time.c | C | www.github.com/indoming/42/tree/main/philo/time.c | https://raw.githubusercontent.com/indoming/42/47af37f/philo/time.c | indoming/42 47af37f philo/time.c | true | 200 | 1,738 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* time.c :+: :+: :+: ... | 6 |
Samuel25100/alx-low_level_programming | 034153e | 0x13-more_singly_linked_lists/9-insert_nodeint.c | C | www.github.com/Samuel25100/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/9-insert_nodeint.c | https://raw.githubusercontent.com/Samuel25100/alx-low_level_programming/034153e/0x13-more_singly_linked_lists/9-insert_nodeint.c | Samuel25100/alx-low_level_programming 034153e 0x13-more_singly_linked_lists/9-insert_nodeint.c | true | 200 | 960 | #include "lists.h"
/**
* insert_nodeint_at_index - inserts a new node at a given position
* @head: the pointer of head node
* @idx: the index of linked list where new node add
* @n: the data the new node will held
* Return: address of the new node, or NULL if it failed
*/
listint_t *insert_nodeint_at_index(listin... | 7 |
Han-Joon-Hyeok/42seoul_inner_circle | c2ba1d7 | exam/exam04/microshell.c | C | www.github.com/Han-Joon-Hyeok/42seoul_inner_circle/tree/main/exam/exam04/microshell.c | https://raw.githubusercontent.com/Han-Joon-Hyeok/42seoul_inner_circle/c2ba1d7/exam/exam04/microshell.c | Han-Joon-Hyeok/42seoul_inner_circle c2ba1d7 exam/exam04/microshell.c | true | 200 | 6,752 | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/wait.h>
#include <signal.h>
#include <string.h>
#define ERROR -1
#define CHILD_PROCESS 0
#define PARENT_PROCESS 1
#define CD_BAD_ARGUMENTS "error: cd: bad arguments"
#define CD_CHANGE_DIR_FAILED "error: cd: cannot change directory to "
#def... | 1 |
VianaSamuel/Learning-C | 79fda56 | 06EstruturasHomogeneas/Ex07DiagonalPrincipal.c | C | www.github.com/VianaSamuel/Learning-C/tree/main/06EstruturasHomogeneas/Ex07DiagonalPrincipal.c | https://raw.githubusercontent.com/VianaSamuel/Learning-C/79fda56/06EstruturasHomogeneas/Ex07DiagonalPrincipal.c | VianaSamuel/Learning-C 79fda56 06EstruturasHomogeneas/Ex07DiagonalPrincipal.c | true | 200 | 1,031 | /*
Faça um programa para preencher uma matriz 4 x 4, em seguida apresentar na tela a
soma dos elementos abaixo da diagonal principal. Mostre na tela os elementos da
diagonal principal também.
*/
#include <stdio.h>
void linha(){
printf("\n-------------------\n");
}
int main(void) {
int m[4][4];
linha();
prin... | 0 |
Davidgr11/C_Programming_Sequential_and_conditional_Exercises | fd5aba4 | 0 Sum.c | C | www.github.com/Davidgr11/C_Programming_Sequential_and_conditional_Exercises/tree/main/0 Sum.c | https://raw.githubusercontent.com/Davidgr11/C_Programming_Sequential_and_conditional_Exercises/fd5aba4/0%20Sum.c | Davidgr11/C_Programming_Sequential_and_conditional_Exercises fd5aba4 0 Sum.c | true | 200 | 243 | #include <stdio.h>
#include <stdlib.h>
int main()
{
float a, b, suma;
printf("Dame dos valores\n");
scanf("%f %f", &a, &b);
suma=a+b;
printf("El resultado de sumar %f + %f es\n%f", a, b, suma);
return 0;
}
| 5 |
GabrielMaurinaAmaral/C | dd92a81 | Fundamentos da Programaçâo/Funções/Funções-Lista-1/Funções-Lista-1-1.c | C | www.github.com/GabrielMaurinaAmaral/C/tree/main/Fundamentos da Programaçâo/Funções/Funções-Lista-1/Funções-Lista-1-1.c | https://raw.githubusercontent.com/GabrielMaurinaAmaral/C/dd92a81/Fundamentos%20da%20Programa%C3%A7%C3%A2o/Fun%C3%A7%C3%B5es/Fun%C3%A7%C3%B5es-Lista-1/Fun%C3%A7%C3%B5es-Lista-1-1.c | GabrielMaurinaAmaral/C dd92a81 Fundamentos da Programaçâo/Funções/Funções-Lista-1/Funções-Lista-1-1.c | true | 200 | 1,996 | /*1) Fazer um programa que permite aplicar as operações de soma, subtração, multiplicação, divisão e resto em dois números fornecidos pelo usuário. Cada operação é uma função e deve ser acessada a partir de um menu (use switch case). As funções são implementadas no próprio programa.
a) Soma sem parâmetros e sem retorn... | 2 |
buyekeobare/monty | 0f46e58 | bujo-pop.c | C | www.github.com/buyekeobare/monty/tree/main/bujo-pop.c | https://raw.githubusercontent.com/buyekeobare/monty/0f46e58/bujo-pop.c | buyekeobare/monty 0f46e58 bujo-pop.c | true | 200 | 793 | #include "monty.h"
/**
* bujo_pop - removes the top element of the stack
* @stack: head of linkedlist
* @line_number: instruction line_number
*
* Return: void
*/
void bujo_pop(stack_t **stack, unsigned int line_number)
{
stack_t *top = NULL;
stack_t *top2 = NULL;
int j = 0, k = 0, indicatorFlag = 0;
if (st... | 3 |
Marionette-yixuan/408_Data_Structure | f16fe5d | Stack/3_31Q&S/3_31Q&SMain.c | C | www.github.com/Marionette-yixuan/408_Data_Structure/tree/main/Stack/3_31Q&S/3_31Q&SMain.c | https://raw.githubusercontent.com/Marionette-yixuan/408_Data_Structure/f16fe5d/Stack/3_31Q%26S/3_31Q%26SMain.c | Marionette-yixuan/408_Data_Structure f16fe5d Stack/3_31Q&S/3_31Q&SMain.c | true | 200 | 762 | //
// Created by マリオネット on 2021/1/15.
//
#include "LkStack.h"
#include "LkQueue.h"
bool test3_31();
int main() {
printf(test3_31() ? "true" : "false");
return 0;
}
bool test3_31() {
char inc, outqc, outsc;
LinkQueue Q;
InitQueue(&Q);
LinkList S;
InitStack(&S);
while ((inc = getchar()) != '\n') {
Push(S, i... | 6 |
acsamendes/IP | 1cdde79 | lista1a/p6.c | C | www.github.com/acsamendes/IP/tree/main/lista1a/p6.c | https://raw.githubusercontent.com/acsamendes/IP/1cdde79/lista1a/p6.c | acsamendes/IP 1cdde79 lista1a/p6.c | true | 200 | 209 | #include <stdio.h>
int main(){
int h, m, s;
scanf("%d", &h);
scanf("%d", &m);
scanf("%d", &s);
int tempo = ((h*3600)+(m*60)+ s);
printf("O TEMPO EM SEGUNDOS E = %d\n", tempo);
} | 7 |
baanmk/practice | 332e27c | practice4.c | C | www.github.com/baanmk/practice/tree/main/practice4.c | https://raw.githubusercontent.com/baanmk/practice/332e27c/practice4.c | baanmk/practice 332e27c practice4.c | true | 200 | 535 | #include <stdio.h>
int findEqualDivisors(int n) {
int count = 0;
for (int m = 1; m < n; m++) {
int quotient = n / m;
int remainder = n % m;
if (quotient == remainder) {
count++;
}
}
return count;
}
int main() {
int n;
printf("Введіть натуральне число... | 1 |
coxy-code/alx-low_level_programming | 03e5132 | 0x01-variables_if_else_while/100-print_comb3.c | C | www.github.com/coxy-code/alx-low_level_programming/tree/main/0x01-variables_if_else_while/100-print_comb3.c | https://raw.githubusercontent.com/coxy-code/alx-low_level_programming/03e5132/0x01-variables_if_else_while/100-print_comb3.c | coxy-code/alx-low_level_programming 03e5132 0x01-variables_if_else_while/100-print_comb3.c | true | 200 | 672 | #include <stdio.h>
/**
* main - Entry point of the program
*
* Description: This function prints all possible different combinations
* of two digits in ascending order, separated by ", ".
* The two digits must be different.
* Return: Always 0 (SUCCESS)
*/
int main(void)
{
int first_di... | 5 |
jothipriya01/Orange.project | 43c01ea | c program/array/binary search 2.c | C | www.github.com/jothipriya01/Orange.project/tree/main/c program/array/binary search 2.c | https://raw.githubusercontent.com/jothipriya01/Orange.project/43c01ea/c%20program/array/binary%20search%202.c | jothipriya01/Orange.project 43c01ea c program/array/binary search 2.c | true | 200 | 701 | #include<stdio.h>
int main()
{
int i,n,high,low,mid,key;
printf("enter the size of the array:\n");
scanf("%d",&n);
int arr[n];
printf("enter the elements of the array:\n");
for(i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
printf("enter the value to find:\n");
scanf("%d",&key);
... | 1 |
Lotf1400/alx-low_level_programming | df1327a | 0x0B-malloc_free/3-alloc_grid.c | C | www.github.com/Lotf1400/alx-low_level_programming/tree/main/0x0B-malloc_free/3-alloc_grid.c | https://raw.githubusercontent.com/Lotf1400/alx-low_level_programming/df1327a/0x0B-malloc_free/3-alloc_grid.c | Lotf1400/alx-low_level_programming df1327a 0x0B-malloc_free/3-alloc_grid.c | true | 200 | 688 | #include "main.h"
#include <stdlib.h>
/**
* alloc_grid - returns a pointer to a 2 dimensional array of integers
* @width: first input
* @height: second input
* Return: a pointer to 2 dimen array
*/
int **alloc_grid(int width, int height)
{
int **abc;
int i, j;
if (width <= 0 || height <= 0)
return (NULL);
... | 5 |
Vitorhbv/c-codes | d3753ea | lab 7 arquivos/ex2.c | C | www.github.com/Vitorhbv/c-codes/tree/main/lab 7 arquivos/ex2.c | https://raw.githubusercontent.com/Vitorhbv/c-codes/d3753ea/lab%207%20arquivos/ex2.c | Vitorhbv/c-codes d3753ea lab 7 arquivos/ex2.c | true | 200 | 416 | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int count = 0;
char c;
scanf("%s",nome);
FILE * arq;
char nome;
arq = fopen(nome,"rb");
if (arq == NULL){
printf("Erro na abertura de arquivo\n");
system("pause");
exit(1);
}
int i;
while (c!= EOF){
c = fgetc... | 1 |
facundodelga/programacion-2 | ba13f65 | Progra 2 1C (2022)/TDAs/PilasD/PilasD.c | C | www.github.com/facundodelga/programacion-2/tree/main/Progra 2 1C (2022)/TDAs/PilasD/PilasD.c | https://raw.githubusercontent.com/facundodelga/programacion-2/ba13f65/Progra%202%201C%20%282022%29/TDAs/PilasD/PilasD.c | facundodelga/programacion-2 ba13f65 Progra 2 1C (2022)/TDAs/PilasD/PilasD.c | true | 200 | 1,310 | #include <stdio.h>
#include <stdlib.h>
#include "PilasD.h"
void iniciaP (TPila *P) //Devuelve en P una pila vac�a
{
*P = NULL; //NULL valor de referencia
}
int vaciaP (TPila P) //Devuelve Verdadero si la pila P est� vac�a, y Falso en caso contrario
{
return (P == NULL); //analizo valor de referencia
}
TEle... | 5 |
filipereis17/Laboratorio-de-Programacao | 2da70e2 | Comandos de Repetição e Condição/Lista 3 - 1ª ARE/19) 10 primeiros na sequência de RICCI.c | C | www.github.com/filipereis17/Laboratorio-de-Programacao/tree/main/Comandos de Repetição e Condição/Lista 3 - 1ª ARE/19) 10 primeiros na sequência de RICCI.c | https://raw.githubusercontent.com/filipereis17/Laboratorio-de-Programacao/2da70e2/Comandos%20de%20Repeti%C3%A7%C3%A3o%20e%20Condi%C3%A7%C3%A3o/Lista%203%20-%201%C2%AA%20ARE/19%29%2010%20primeiros%20na%20sequ%C3%AAncia%20de%20RICCI.c | filipereis17/Laboratorio-de-Programacao 2da70e2 Comandos de Repetição e Condição/Lista 3 - 1ª ARE/19) 10 primeiros na sequência de RICCI.c | true | 200 | 614 | /*19) Escreva um algoritmo que imprima os 10 primeiros termos da s�rie de RICCI. A
s�rie de RICCI difere da s�rie de FIBONACCI porque os dois primeiros termos da s�rie s�o
fornecidos pelo usu�rio.*/
#include<stdio.h>
main()
{
int n, m, i;
printf("Digite um numero: ");
scanf("%d", &n);
m = n - 1;
while (m<n)
{... | 1 |
Kingdomwhisky/RTD-Scaler-TEST | 3d38340 | Pcb/RL6449/LQFP_216/RL6449_PCB_EXAMPLE_216_PIN.h | C | www.github.com/Kingdomwhisky/RTD-Scaler-TEST/tree/main/Pcb/RL6449/LQFP_216/RL6449_PCB_EXAMPLE_216_PIN.h | https://raw.githubusercontent.com/Kingdomwhisky/RTD-Scaler-TEST/3d38340/Pcb/RL6449/LQFP_216/RL6449_PCB_EXAMPLE_216_PIN.h | Kingdomwhisky/RTD-Scaler-TEST 3d38340 Pcb/RL6449/LQFP_216/RL6449_PCB_EXAMPLE_216_PIN.h | true | 200 | 51,884 | /********************************************************************************/
/* The Software is proprietary, confidential, and valuable to Realtek */
/* Semiconductor Corporation ("Realtek"). All rights, including but not */
/* limited to copyrights, patents, trademarks, trade secrets, mas... | 5 |
beyxnd3r/ProgC | 6d2ad75 | lb3/14.c | C | www.github.com/beyxnd3r/ProgC/tree/main/lb3/14.c | https://raw.githubusercontent.com/beyxnd3r/ProgC/6d2ad75/lb3/14.c | beyxnd3r/ProgC 6d2ad75 lb3/14.c | true | 200 | 199 | #include <stdio.h>
void main() {
int n;
int a;
printf("Input a: \n");
scanf("%d", &a);
for (n=2; n<a; n++)
{
if (a%n==0)
{
break;
}
}
if (n==a)
{
puts("Good");
}
}
| 1 |
Naina-rc2k1/C-bootcamp | 883651d | A5/Q9.C | C | www.github.com/Naina-rc2k1/C-bootcamp/tree/main/A5/Q9.C | https://raw.githubusercontent.com/Naina-rc2k1/C-bootcamp/883651d/A5/Q9.C | Naina-rc2k1/C-bootcamp 883651d A5/Q9.C | true | 200 | 244 | // Write a program to print CUBE of the first N natural numbers
#include <stdio.h>
int main()
{
int n;
printf("Enter a number");
scanf("%d",&n);
for (int i=1;i<=n;i++)
printf("%d ",i*i* i);
printf("\n");
} | 5 |
OliverGeisel/Vala-Snippets | ea341d7 | bench/bench-c.c | C | www.github.com/OliverGeisel/Vala-Snippets/tree/main/bench/bench-c.c | https://raw.githubusercontent.com/OliverGeisel/Vala-Snippets/ea341d7/bench/bench-c.c | OliverGeisel/Vala-Snippets ea341d7 bench/bench-c.c | true | 200 | 5,973 | #include <sys/time.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define FEHLER -1
#define BESONDERER_FEHLER 0
#define KEIN_FEHLER 1
#define WARMUP 10000
#define MEASURE 10000000
const int A_All( const int i );
const int B_All( const int i );
const int C_All( const int ... | 1 |
BettinaMubiligi/Projet_Biblioth-que_L2 | c31e6ae | main2.c | C | www.github.com/BettinaMubiligi/Projet_Biblioth-que_L2/tree/main/main2.c | https://raw.githubusercontent.com/BettinaMubiligi/Projet_Biblioth-que_L2/c31e6ae/main2.c | BettinaMubiligi/Projet_Biblioth-que_L2 c31e6ae main2.c | true | 200 | 4,912 | //par Beeverly Gourdette et Bettina Mubiligi
#include <stdlib.h>
#include <stdio.h>
#include "entreeSortieLC.h"
#include "biblioLC.h"
#include "biblioH.h"
#include <time.h>
#define MAX_LENGTH 256
int main(int argc, char** argv){
//Excercice 3 : Mesure du temps de calcul
//Question 1 et 2
srand(... | 5 |
Piotr123CC/Moving-Window | c43cb1f | Src/file.c | C | www.github.com/Piotr123CC/Moving-Window/tree/main/Src/file.c | https://raw.githubusercontent.com/Piotr123CC/Moving-Window/c43cb1f/Src/file.c | Piotr123CC/Moving-Window c43cb1f Src/file.c | true | 200 | 4,287 | #include "file.h"
#include "queue.h"
#include "algorithms.h"
#include "errno.h"
#define PRINTF 0 //set to 1 if you want print data
/**
* @brief This function creates a .csv file with random data
*
* @param name
* @param dataLength
* @return fileState_t
*/
fileState_t generateRandomData(const char *name, siz... | 4 |
SoorajTomar/Important-Algorithms | 73653df | LinearVsBinarySearch.c | C | www.github.com/SoorajTomar/Important-Algorithms/tree/main/LinearVsBinarySearch.c | https://raw.githubusercontent.com/SoorajTomar/Important-Algorithms/73653df/LinearVsBinarySearch.c | SoorajTomar/Important-Algorithms 73653df LinearVsBinarySearch.c | true | 200 | 1,352 | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
int lins(int n,int x,int a[])
{
int i;
for(i=0;i<n;i++)
if(a[i]==x)
return i;
return -1;
}
int bins(int a[],int st,int e,int x)
{
int i,j;
for(i=0;i<e-1;i++)
for(j=0;j<e-i-1;j++)
if(a[j]>a[j+1])
{
int t=a[j];
... | 1 |
JTAOG/alx-low_level_programming | 921d6fa | 0x0C-more_malloc_free/100-realloc.c | C | www.github.com/JTAOG/alx-low_level_programming/tree/main/0x0C-more_malloc_free/100-realloc.c | https://raw.githubusercontent.com/JTAOG/alx-low_level_programming/921d6fa/0x0C-more_malloc_free/100-realloc.c | JTAOG/alx-low_level_programming 921d6fa 0x0C-more_malloc_free/100-realloc.c | true | 200 | 692 | #include "main.h"
#include <stdlib.h>
#include <stdio.h>
/**
* _realloc - a function that reallocates a memory block
* @ptr: 1
* @old_size: 2
* @new_size: 3
*
* Return: 0
*/
void *_realloc(void *ptr, unsigned int old_size, unsigned int new_size)
{
char *nptr;
unsigned int i;
if (new_size == old_size)
retu... | 5 |
BugFixDotExe/alx-low_level_programming | 263a4a4 | 0x02-functions_nested_loops/101-natural.c | C | www.github.com/BugFixDotExe/alx-low_level_programming/tree/main/0x02-functions_nested_loops/101-natural.c | https://raw.githubusercontent.com/BugFixDotExe/alx-low_level_programming/263a4a4/0x02-functions_nested_loops/101-natural.c | BugFixDotExe/alx-low_level_programming 263a4a4 0x02-functions_nested_loops/101-natural.c | true | 200 | 225 | #include <stdio.h>
/**
* main - entry point
* Return: 0
*/
int main(void)
{
int i;
int sum;
for (i = 1; i < 1024; i++)
{
if (i % 3 == 0 || i % 5 == 0)
{
sum += i;
}
}
printf("%d\n", sum);
return (0);
}
| 4 |
antobazir/src | 8fc9822 | full_study.c | C | www.github.com/antobazir/src/tree/main/full_study.c | https://raw.githubusercontent.com/antobazir/src/8fc9822/full_study.c | antobazir/src 8fc9822 full_study.c | true | 200 | 1,302 | #include <stdio.h>
#include <errno.h>
#include <stdlib.h>
#include "metvar_f.h"
#include <unistd.h>
#include <sys/stat.h>
int full_study(char* folder, char* behavior)
{
/*consumption values and vector*/
float kS_ = 0.2;
float kO_ = 1.6;
/*float kS_ = 1.5;
float kO_ = 12.0;*/
printf("full_study\n\... | 5 |
luna7111/garbage_control | 7a37294 | src/lib_functs/allocation.c | C | www.github.com/luna7111/garbage_control/tree/main/src/lib_functs/allocation.c | https://raw.githubusercontent.com/luna7111/garbage_control/7a37294/src/lib_functs/allocation.c | luna7111/garbage_control 7a37294 src/lib_functs/allocation.c | true | 200 | 1,526 | /* ************************************************************************** */
/* */
/* _.._ . . */
/* allocation.c .' .-'` * ... | 4 |
carvanino/alx-low_level_programming | ec8877c | 0x05-pointers_arrays_strings/2-strlen.c | C | www.github.com/carvanino/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/2-strlen.c | https://raw.githubusercontent.com/carvanino/alx-low_level_programming/ec8877c/0x05-pointers_arrays_strings/2-strlen.c | carvanino/alx-low_level_programming ec8877c 0x05-pointers_arrays_strings/2-strlen.c | true | 200 | 249 | #include "main.h"
/**
* _strlen - returns the length of a string
*
* @s: Character length to return
*
* Return: 0 Always
*/
int _strlen(char *s)
{
int len;
for (len = 0; s[len]; len++)
{
if (s[len] == '\0')
{
}
}
return (len);
}
| 1 |
Vispic2/mud | c097c29 | d/emei/qianfoan.c | C | www.github.com/Vispic2/mud/tree/main/d/emei/qianfoan.c | https://raw.githubusercontent.com/Vispic2/mud/c097c29/d/emei/qianfoan.c | Vispic2/mud c097c29 d/emei/qianfoan.c | true | 200 | 1,484 | //Room: qianfoan.c 千佛庵
//Date: Oct. 2 1997 by That
inherit ROOM;
void create()
{
set("short","千佛庵");
set("long",@LONG
此处是洪椿坪千佛庵。山间小坪坝，四面层峦叠障，峰环岭护；两侧深谷
幽岚，溪涧玲叮。坪上古木扶疏，亭亭如盖，山阴沁透，白雾飘游，极为幽静
清凉。此处常见雨雾霏霏，林中迷迷蒙蒙，乃山中雾气所为。正所谓「山行本
无雨，空翠湿人衣」。这就是誉为奇观的「洪椿晓雨」。此处殿美景幽，气象
新异，令人心醉。沿途南上是「九十九道拐」，北下经黑龙江栈道至清音阁。
LONG);
se... | 0 |
Khoghiee/alx-low_level_programming | 4057957 | 0x00-hello_world/101-quote.c | C | www.github.com/Khoghiee/alx-low_level_programming/tree/main/0x00-hello_world/101-quote.c | https://raw.githubusercontent.com/Khoghiee/alx-low_level_programming/4057957/0x00-hello_world/101-quote.c | Khoghiee/alx-low_level_programming 4057957 0x00-hello_world/101-quote.c | true | 200 | 206 | #include <stdio.h>
/**
* main - Entry point
*
* Return: 1
*/
int main(void)
{
fprintf(stderr, "and that piece of art is useful\"");
fprintf(stderr, " - Dora Korpar, 2015-10-19\n");
return (1);
}
| 5 |
ThatoMotha/alx-low_level_programming | d4c768a | 0x04-more_functions_nested_loops/2-mul.c | C | www.github.com/ThatoMotha/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/2-mul.c | https://raw.githubusercontent.com/ThatoMotha/alx-low_level_programming/d4c768a/0x04-more_functions_nested_loops/2-mul.c | ThatoMotha/alx-low_level_programming d4c768a 0x04-more_functions_nested_loops/2-mul.c | true | 200 | 199 | #include <stdio.h>
#include "main.h"
/**
* mul - multiplies two integers
* @a: first integer
* @b: second integer
* Return: addition of a and b
*/
int mul(int a, int b)
{
return (a * b);
}
| 4 |
quentin-drsy/Final_Assignement_Quentin_Derossy | 1b25a1f | task2.c | C | www.github.com/quentin-drsy/Final_Assignement_Quentin_Derossy/tree/main/task2.c | https://raw.githubusercontent.com/quentin-drsy/Final_Assignement_Quentin_Derossy/1b25a1f/task2.c | quentin-drsy/Final_Assignement_Quentin_Derossy 1b25a1f task2.c | true | 200 | 193 | #include <stdio.h>
int main(void)
{
const float temp_f = 90.2;
float temp_c;
temp_c = (temp_f - 32)/1.8;
printf("%f Fahrenheit = %f Celsius\n",temp_f, temp_c);
return 0;
} | 2 |
MintInaw/codetree-TILs | 21398de | 231114/문자열 정렬/string-sort.c | C | www.github.com/MintInaw/codetree-TILs/tree/main/231114/문자열 정렬/string-sort.c | https://raw.githubusercontent.com/MintInaw/codetree-TILs/21398de/231114/%EB%AC%B8%EC%9E%90%EC%97%B4%20%EC%A0%95%EB%A0%AC/string-sort.c | MintInaw/codetree-TILs 21398de 231114/문자열 정렬/string-sort.c | true | 200 | 417 | #include <stdio.h>
#include <string.h>
int main() {
char a[100],temp;
int i,j,c,n;
scanf("%s",a);
n=strlen(a);
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
... | 1 |
eujoshSE/alx-low_level_programming | 58618b6 | 0x06-pointers_arrays_strings/2-strncpy.c | C | www.github.com/eujoshSE/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/2-strncpy.c | https://raw.githubusercontent.com/eujoshSE/alx-low_level_programming/58618b6/0x06-pointers_arrays_strings/2-strncpy.c | eujoshSE/alx-low_level_programming 58618b6 0x06-pointers_arrays_strings/2-strncpy.c | true | 200 | 460 | #include "main.h"
/**
* _strncpy - Copies a string
* @dest: The buffer storing the string copy.
* @src: The source string.
* @n: The maximum number of bytes to copied from src.
* Return: A pointer to the resulting string dest.
*/
char *_strncpy(char *dest, char *src, int n)
{
int i = 0, src_len = 0;
while (src[i++]... | 3 |
AYO-YUSSUF/alx-low_level_programming | f64ba39 | 0x13-more_singly_linked_lists/4-free_listint.c | C | www.github.com/AYO-YUSSUF/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/4-free_listint.c | https://raw.githubusercontent.com/AYO-YUSSUF/alx-low_level_programming/f64ba39/0x13-more_singly_linked_lists/4-free_listint.c | AYO-YUSSUF/alx-low_level_programming f64ba39 0x13-more_singly_linked_lists/4-free_listint.c | true | 200 | 268 | #include "lists.h"
#include <stdlib.h>
/**
* free_listint - frees list
* *
* @head: the head
* *
* Return: NULL if error
*/
void free_listint(listint_t *head)
{
listint_t *next;
while (head != NULL)
{
next = head->next;
free(head);
head = next;
}
}
| 7 |
irwenjust/42_miniRT | 2f3086d | bonus/src/color/color_utils_bonus.c | C | www.github.com/irwenjust/42_miniRT/tree/main/bonus/src/color/color_utils_bonus.c | https://raw.githubusercontent.com/irwenjust/42_miniRT/2f3086d/bonus/src/color/color_utils_bonus.c | irwenjust/42_miniRT 2f3086d bonus/src/color/color_utils_bonus.c | true | 200 | 2,462 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* color_utils_bonus.c :+: :+: :+: ... | 6 |
Achraflaalalma/push_swap | b5a5117 | utils2.c | C | www.github.com/Achraflaalalma/push_swap/tree/main/utils2.c | https://raw.githubusercontent.com/Achraflaalalma/push_swap/b5a5117/utils2.c | Achraflaalalma/push_swap b5a5117 utils2.c | true | 200 | 2,625 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* utils2.c :+: :+: :+: ... | 5 |
jpinkstone/Invoice-Generator | 8a712b4 | a1.c | C | www.github.com/jpinkstone/Invoice-Generator/tree/main/a1.c | https://raw.githubusercontent.com/jpinkstone/Invoice-Generator/8a712b4/a1.c | jpinkstone/Invoice-Generator 8a712b4 a1.c | true | 200 | 5,192 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
// CS265 Assignment 1 - Jack Pinkstone
// Functions written after main()
void trim_str(char *str);
int round_tax(float num);
int main(int argc, char *argv[]) {
// Variables to be used throughout the program
char *order_file, *tax_rate_file, *invoice... | 0 |
samahm02/IN2140 | 5867ef7 | Oblig1/oppgave2/stringoperations.c | C | www.github.com/samahm02/IN2140/tree/main/Oblig1/oppgave2/stringoperations.c | https://raw.githubusercontent.com/samahm02/IN2140/5867ef7/Oblig1/oppgave2/stringoperations.c | samahm02/IN2140 5867ef7 Oblig1/oppgave2/stringoperations.c | true | 200 | 1,681 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
int stringsum(char *s)
{
// Vi tar med 1 verdi eksta på starten, slik at vi kan finne hvilket nummer bokstven er i alfabetet
int BokstavVerdiStart = 96;
int BokstavVerdiSlutt = 122;
int sum = 0;
int lengde = strlen(s);
... | 4 |
JosephKovacs/CLUMPY_utilities | bfc1234 | convert_clumpy_draw_annih_rs_to_root.C | C | www.github.com/JosephKovacs/CLUMPY_utilities/tree/main/convert_clumpy_draw_annih_rs_to_root.C | https://raw.githubusercontent.com/JosephKovacs/CLUMPY_utilities/bfc1234/convert_clumpy_draw_annih_rs_to_root.C | JosephKovacs/CLUMPY_utilities bfc1234 convert_clumpy_draw_annih_rs_to_root.C | true | 200 | 72,302 | #include <iostream> // std::cout
#include <fstream> // std::ifstream
#include <sstream>
#include <cstdio>
#include <string>
#include <math.h>
#include <algorithm>
#include <iterator>
#include "TH1D.h"
#include "TCanvas.h"
#include "TTree.h"
#include "/path/to/MyUtility_func.h"
char *PLOT_PATH = (char*)"/... | 1 |
Amira-S-Abdelaziz/alx-low_level_programming_cohort10 | 80a9f46 | 0x0A-argc_argv/_putchar.c | C | www.github.com/Amira-S-Abdelaziz/alx-low_level_programming_cohort10/tree/main/0x0A-argc_argv/_putchar.c | https://raw.githubusercontent.com/Amira-S-Abdelaziz/alx-low_level_programming_cohort10/80a9f46/0x0A-argc_argv/_putchar.c | Amira-S-Abdelaziz/alx-low_level_programming_cohort10 80a9f46 0x0A-argc_argv/_putchar.c | true | 200 | 328 | #include <unistd.h>
/**
* _putchar - writes the character c to stdout
* @c: The character to print
*
* Return: On success 1.
* On error, -1 is returned, and errno is set appropriately.
*/
int _putchar(char c)
{
return (write(1, &c, 1)... | 2 |
alex63rm/push_swap | a541b6f | push_swap_main/srcs/ft_sort_three.c | C | www.github.com/alex63rm/push_swap/tree/main/push_swap_main/srcs/ft_sort_three.c | https://raw.githubusercontent.com/alex63rm/push_swap/a541b6f/push_swap_main/srcs/ft_sort_three.c | alex63rm/push_swap a541b6f push_swap_main/srcs/ft_sort_three.c | true | 200 | 1,713 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_sort_three.c :+: :+: :+: ... | 7 |
Amogha-k/All_codes | 378d907 | C program/C_PROGRAMS/transposeofmatrix.c | C | www.github.com/Amogha-k/All_codes/tree/main/C program/C_PROGRAMS/transposeofmatrix.c | https://raw.githubusercontent.com/Amogha-k/All_codes/378d907/C%20program/C_PROGRAMS/transposeofmatrix.c | Amogha-k/All_codes 378d907 C program/C_PROGRAMS/transposeofmatrix.c | true | 200 | 492 | #include<stdio.h>
int main(){
int a[2][3],i,j;
printf("enter elements of matrix=");
for(i=0;i<2;i++){
for(j=0;j<3;j++){
scanf("%d",&a[i][j]);
}
}
printf("the matrix is=\n");
for(i=0;i<2;i++){
for(j=0;j<3;j++){
printf("%d\t",a[i][j]);
}printf... | 3 |
02teedd/alx-low_level_programming | 7de6e02 | 0x18-dynamic_libraries/0-memset.c | C | www.github.com/02teedd/alx-low_level_programming/tree/main/0x18-dynamic_libraries/0-memset.c | https://raw.githubusercontent.com/02teedd/alx-low_level_programming/7de6e02/0x18-dynamic_libraries/0-memset.c | 02teedd/alx-low_level_programming 7de6e02 0x18-dynamic_libraries/0-memset.c | true | 200 | 250 | #include "main.h"
/**
* _memset - funtion name
* @s: parameter s
* @b: parameter b
* @n: parameter n
* return: s
*/
char *_memset(char *s, char b, unsigned int n)
{
unsigned int i;
for (i = 0; i < n; i++)
{
s[i] = b;
}
return (s);
}
| 6 |
SAYAN-DAN/C_Complete_Tutorial | 693b565 | 8__2D_Array/Q2.c | C | www.github.com/SAYAN-DAN/C_Complete_Tutorial/tree/main/8__2D_Array/Q2.c | https://raw.githubusercontent.com/SAYAN-DAN/C_Complete_Tutorial/693b565/8__2D_Array/Q2.c | SAYAN-DAN/C_Complete_Tutorial 693b565 8__2D_Array/Q2.c | true | 200 | 1,575 |
// Enter the number of rows: 3
// Enter the number of columns: 3
// 1 2 3
// 4 5 6
// 7 8 9
// 1 2 3
// 4 5 6
// 7 8 9
#include<stdio.h>
int main() {
int r;
printf("Enter the number of rows: ");
scanf("%d",&r);
int c;
printf("Enter the number of columns: ");
scanf("%d",&c);
... | 5 |
slemanz/DMA_BARE_METAL | 89375b1 | Drivers/Inc/dma.h | C | www.github.com/slemanz/DMA_BARE_METAL/tree/main/Drivers/Inc/dma.h | https://raw.githubusercontent.com/slemanz/DMA_BARE_METAL/89375b1/Drivers/Inc/dma.h | slemanz/DMA_BARE_METAL 89375b1 Drivers/Inc/dma.h | true | 200 | 714 | #ifndef INC_DMA_H_
#define INC_DMA_H_
#include "stm32f401xx.h"
#define DMA1EN (1U << 21)
#define DMA2EN (1U << 22)
// symbolic names
#define DMA_S_EN (1U << 0)
#define CHSEL4 (1U << 27)
#define DMA_MEM_INC (1U << 10)
... | 4 |
Smit334/106A-DART | 1140d2f | firmware/vehicle/flightController.c | C | www.github.com/Smit334/106A-DART/tree/main/firmware/vehicle/flightController.c | https://raw.githubusercontent.com/Smit334/106A-DART/1140d2f/firmware/vehicle/flightController.c | Smit334/106A-DART 1140d2f firmware/vehicle/flightController.c | true | 200 | 7,669 | #include "flightController.h"
/* Quaternion for Madgwick filter */
float q0;
float q1;
float q2;
float q3;
/* Normalized desired state constants */
float thro_des;
float roll_des;
float pitch_des;
float yaw_des;
float roll_passthru;
float pitch_passthru;
float yaw_passthru;
/* PID controller previous values */
flo... | 1 |
Praveenpadidapu/C-computing | 539e70c | AVERAGE.C | C | www.github.com/Praveenpadidapu/C-computing/tree/main/AVERAGE.C | https://raw.githubusercontent.com/Praveenpadidapu/C-computing/539e70c/AVERAGE.C | Praveenpadidapu/C-computing 539e70c AVERAGE.C | true | 200 | 208 | #include<stdio.h>
int main() {
float a,b,c,d,e,sum,avg;
printf("Enter any 5 values:");
scanf("%f%f%f%f%f",&a,&b,&c,&d,&e);
sum=a+b+c+d+e;
avg=sum/5.0;
printf("sum:%f average:%f ",sum,avg);
return 0;
}
| 2 |
Michelozzi2/L3 | b6c23c7 | S2/Paradigmes_de_prop/td1/stat_de_rand/rand.c | C | www.github.com/Michelozzi2/L3/tree/main/S2/Paradigmes_de_prop/td1/stat_de_rand/rand.c | https://raw.githubusercontent.com/Michelozzi2/L3/b6c23c7/S2/Paradigmes_de_prop/td1/stat_de_rand/rand.c | Michelozzi2/L3 b6c23c7 S2/Paradigmes_de_prop/td1/stat_de_rand/rand.c | true | 200 | 827 | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
void tirageAleatoire();
void tirageAleatoire() {
int occurrences[6] = {0}; // Tableau pour stocker les occurrences de chaque résultat
// Effectuer 100000 tirages aléatoires
for (int i = 0; i < 100000; i++) {
int valeur = rand() % 6;... | 7 |
doabayomi/alx-low_level_programming | e9910a0 | 0x13-more_singly_linked_lists/5-free_listint2.c | C | www.github.com/doabayomi/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/5-free_listint2.c | https://raw.githubusercontent.com/doabayomi/alx-low_level_programming/e9910a0/0x13-more_singly_linked_lists/5-free_listint2.c | doabayomi/alx-low_level_programming e9910a0 0x13-more_singly_linked_lists/5-free_listint2.c | true | 200 | 316 | #include <stdlib.h>
#include <stdio.h>
#include "lists.h"
/**
* free_listint2 - frees a linked list
* @head: Head of the linked list.
*
* Return: void
*/
void free_listint2(listint_t **head)
{
listint_t *tmp = (*head);
while ((*head) != NULL)
{
tmp = (*head);
(*head) = (*head)->next;
free(tmp);
}
}
| 3 |
fe1w0/VulnInfoSearch | 1fec859 | DataSet/MethodSet/NoVulnSet/C/CWE-476/CVE-2011-4081/ghash_update.c | C | www.github.com/fe1w0/VulnInfoSearch/tree/main/DataSet/MethodSet/NoVulnSet/C/CWE-476/CVE-2011-4081/ghash_update.c | https://raw.githubusercontent.com/fe1w0/VulnInfoSearch/1fec859/DataSet/MethodSet/NoVulnSet/C/CWE-476/CVE-2011-4081/ghash_update.c | fe1w0/VulnInfoSearch 1fec859 DataSet/MethodSet/NoVulnSet/C/CWE-476/CVE-2011-4081/ghash_update.c | true | 200 | 812 | static int ghash_update(struct shash_desc *desc,
const u8 *src, unsigned int srclen)
{
struct ghash_desc_ctx *dctx = shash_desc_ctx(desc);
struct ghash_ctx *ctx = crypto_shash_ctx(desc->tfm);
u8 *dst = dctx->buffer;
if (!ctx->gf128)
return -ENOKEY;
if (dctx->bytes) {
int n = min(srclen, dctx->bytes);
u... | 0 |
oumayma-tech/alx-low_level_programming | 23c308a | 0x01-variables_if_else_while/9-print_comb.c | C | www.github.com/oumayma-tech/alx-low_level_programming/tree/main/0x01-variables_if_else_while/9-print_comb.c | https://raw.githubusercontent.com/oumayma-tech/alx-low_level_programming/23c308a/0x01-variables_if_else_while/9-print_comb.c | oumayma-tech/alx-low_level_programming 23c308a 0x01-variables_if_else_while/9-print_comb.c | true | 200 | 332 | #include <stdio.h>
/**
* main - prints all possible combinations of single-digit numbers
* Return: Always 0 (Success)
*/
int main(void)
{
int n;
for (n = 48; n < 58; n++)
{
putchar(n);
if (n != 57)
{
putchar(',');
putchar(' ');
}
}
putchar('\n');
re... | 6 |
wiperi/CSAPP | f3b95c8 | ch7_linking/lib_interpositioning/mymalloc.c | C | www.github.com/wiperi/CSAPP/tree/main/ch7_linking/lib_interpositioning/mymalloc.c | https://raw.githubusercontent.com/wiperi/CSAPP/f3b95c8/ch7_linking/lib_interpositioning/mymalloc.c | wiperi/CSAPP f3b95c8 ch7_linking/lib_interpositioning/mymalloc.c | true | 200 | 2,784 | /*
* mymalloc.c - Examples of run-time, link-time, and compile-time
* library interpositioning.
*/
/*
* Run-time interpositioning of malloc and free based
* on the dynamic linker's (ld-linux.so) LD_PRELOAD mechanism
*
* Example (Assume a.out calls malloc and free):
* linux> gcc -Wall -DRUNTIME -... | 5 |
arman-ataei-edu/DSA | 13b8a84 | C/1-Arrays/array_util.c | C | www.github.com/arman-ataei-edu/DSA/tree/main/C/1-Arrays/array_util.c | https://raw.githubusercontent.com/arman-ataei-edu/DSA/13b8a84/C/1-Arrays/array_util.c | arman-ataei-edu/DSA 13b8a84 C/1-Arrays/array_util.c | true | 200 | 3,508 | #include "array_util.h"
#include<stdio.h>
#include<stdarg.h>
#include<string.h>
#include<stdlib.h>
#include <stdbool.h> //bool type
// supporting sorts for arrays
typedef enum sotrings {
buble,
insertion,
merge,
q_sort,
selection
}Sorting;
typedef enum orders{
increasing,
decreasing
}Orde... | 2 |
Obanisola1/alx-low_level_programming | d0c5038 | 0x07-pointers_arrays_strings/0-memset.c | C | www.github.com/Obanisola1/alx-low_level_programming/tree/main/0x07-pointers_arrays_strings/0-memset.c | https://raw.githubusercontent.com/Obanisola1/alx-low_level_programming/d0c5038/0x07-pointers_arrays_strings/0-memset.c | Obanisola1/alx-low_level_programming d0c5038 0x07-pointers_arrays_strings/0-memset.c | true | 200 | 370 | #include "main.h"
/**
* _memset - fill a block of memory with a specific value
* @s: Starting address of memory to be filled
* @b: The desired value
* @n: Number of bytes to be changed
*
* Return: Changed array with new value for n bytes
*/
char *_memset(char *s, char b, unsigned int n);
{
unsigned int i;
fo... | 7 |
almondisnutty/alx-low_level_programming | eec13cb | 0x0F-function_pointers/1-array_iterator.c | C | www.github.com/almondisnutty/alx-low_level_programming/tree/main/0x0F-function_pointers/1-array_iterator.c | https://raw.githubusercontent.com/almondisnutty/alx-low_level_programming/eec13cb/0x0F-function_pointers/1-array_iterator.c | almondisnutty/alx-low_level_programming eec13cb 0x0F-function_pointers/1-array_iterator.c | true | 200 | 372 | #include "function_pointers.h"
/**
* array_iterator - executes a function on each element of an array
* @array: array to be targete
* @size: size of array
* @action: function to be executed
*/
void array_iterator(int *array, size_t size, void (*action)(int))
{
if (array == NULL || action == NULL)
return;
whil... | 1 |
N1C0-P4Z/Portafolio | 949fff5 | ejercicios de punteros/ejer 31 ptr.c | C | www.github.com/N1C0-P4Z/Portafolio/tree/main/ejercicios de punteros/ejer 31 ptr.c | https://raw.githubusercontent.com/N1C0-P4Z/Portafolio/949fff5/ejercicios%20de%20punteros/ejer%2031%20ptr.c | N1C0-P4Z/Portafolio 949fff5 ejercicios de punteros/ejer 31 ptr.c | true | 200 | 1,976 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct
{
char nombre[15];
int edad;
}persona;
void cargarPersonas(persona *p, int n);
persona* ordenarPorNombre(persona *p, int *n);
persona* ordenarPorEdad(persona *p, int *n);
int main()
{
int n;
printf("Ingrese el numero de per... | 4 |
maxrmax/push_swap | 23603ed | src/helper.c | C | www.github.com/maxrmax/push_swap/tree/main/src/helper.c | https://raw.githubusercontent.com/maxrmax/push_swap/23603ed/src/helper.c | maxrmax/push_swap 23603ed src/helper.c | true | 200 | 2,021 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* helper.c :+: :+: :+: ... | 3 |
STee868/alx-low_level_programming | 65603c5 | 0x05-pointers_arrays_strings/101-keygen.c | C | www.github.com/STee868/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/101-keygen.c | https://raw.githubusercontent.com/STee868/alx-low_level_programming/65603c5/0x05-pointers_arrays_strings/101-keygen.c | STee868/alx-low_level_programming 65603c5 0x05-pointers_arrays_strings/101-keygen.c | true | 200 | 480 | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <string.h>
int main(void)
{
const char *charset = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
const int len_charset = strlen(charset);
const int len_password = 12;
char password[len_password + 1];
srand(time(NULL));
for (in... | 0 |
JSriVirinchi/C-Programs | 77ad2eb | matrices.c | C | www.github.com/JSriVirinchi/C-Programs/tree/main/matrices.c | https://raw.githubusercontent.com/JSriVirinchi/C-Programs/77ad2eb/matrices.c | JSriVirinchi/C-Programs 77ad2eb matrices.c | true | 200 | 275 | main()
{
int a[3][3],i,j;
printf("Enter 9 numbers for 3*3 matrix and its determinant.\n");
for (i=0;i<=2;i++)
{
for (j=0;j<=2;j++)
scanf("%d",&a[i][j]);
}
for (i=0;i<=2;i++)
{
for (j=0;j<=2;j++)
printf("%d ",a[i][j]);
printf("\n");
}
}
| 6 |
ochenugarno/MSU-CS-1-semestr | 00d3b09 | ex4.c | C | www.github.com/ochenugarno/MSU-CS-1-semestr/tree/main/ex4.c | https://raw.githubusercontent.com/ochenugarno/MSU-CS-1-semestr/00d3b09/ex4.c | ochenugarno/MSU-CS-1-semestr 00d3b09 ex4.c | true | 200 | 600 | //ИНТЕГРАЛ МЕТОДОМ ПРЯМОУГОЛЬНИКОВ
#include <stdio.h>
#include <math.h>
int main(){
double a, b, E, dx, integral1, integral2;
scanf("%lf %lf %lf", &a, &b, &E);
dx = b-a;
integral1 = 0;
integral2 = dx*b*b;
int i, n = 1;
while (fabs(integral1 - integral2) >= E) {
dx /= 2;
n <<=... | 5 |
jonathanlin0/JVM | c0e6368 | jvm.c | C | www.github.com/jonathanlin0/JVM/tree/main/jvm.c | https://raw.githubusercontent.com/jonathanlin0/JVM/c0e6368/jvm.c | jonathanlin0/JVM c0e6368 jvm.c | true | 200 | 3,259 | #include "jvm.h"
#include <assert.h>
#include <inttypes.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
#include "heap.h"
#include "read_class.h"
/** The name of the method to invoke to run the class file */
const char MAIN_METHOD[] = "main";
/**
* The "descriptor" string for main(). Th... | 2 |
sottosanti/Programming | 2123676 | C/C_Programming_Examples/Pointers/dynamic_memory.c | C | www.github.com/sottosanti/Programming/tree/main/C/C_Programming_Examples/Pointers/dynamic_memory.c | https://raw.githubusercontent.com/sottosanti/Programming/2123676/C/C_Programming_Examples/Pointers/dynamic_memory.c | sottosanti/Programming 2123676 C/C_Programming_Examples/Pointers/dynamic_memory.c | true | 200 | 437 | #include <stdio.h>
#include <stdlib.h>
int main()
{
int size;
char * text = NULL;
printf("Enter limit of the text: ");
scanf("%d", &size);
text = (char *) malloc(size * sizeof(char));
// if (text != NULL)
if(!text)
{
printf("Enter some text: \n");
scanf(" ");
... | 7 |
Akkun716/Shell-Simulator | ad036f7 | ui.c | C | www.github.com/Akkun716/Shell-Simulator/tree/main/ui.c | https://raw.githubusercontent.com/Akkun716/Shell-Simulator/ad036f7/ui.c | Akkun716/Shell-Simulator ad036f7 ui.c | true | 200 | 8,301 | #include <stdio.h>
#include <signal.h>
#include <readline/readline.h>
#include <locale.h>
#include <limits.h>
#include <stdlib.h>
#include <unistd.h>
//UNSURE IF THIS CAN BE INCLUDED, BUT REQUIRED DIRECTORY ACCESS
#include <dirent.h>
#include "history.h"
#include "logger.h"
#include "ui.h"
#include "util.h"
#define P... | 1 |
rafaelmorad3/AVR | d63d4af | GccApplication1/main.c | C | www.github.com/rafaelmorad3/AVR/tree/main/GccApplication1/main.c | https://raw.githubusercontent.com/rafaelmorad3/AVR/d63d4af/GccApplication1/main.c | rafaelmorad3/AVR d63d4af GccApplication1/main.c | true | 200 | 485 | #define F_CPU 16000000
#include "DIO.h"
#include "LCD.h"
#include "PushButton.h"
int main(void)
{
INIT();
LCD_Init();
PushButton_INIT();
u8 x=0;
//u8 * ptr = " Rapheal Mourad";
//LCD_SendString(0, (u8*)" Rapheal Mourad");
/*SetPinDirection(PORTB,PIN0,OUTPUT);
SetPinValue(PORTB,PIN0,HIGH);
SetPinDirection... | 4 |
Sena-H/-kuromi- | d3745ec | hjkg/hjkg/dk_lib/include/Core/GlobalDef.h | C | www.github.com/Sena-H/-kuromi-/tree/main/hjkg/hjkg/dk_lib/include/Core/GlobalDef.h | https://raw.githubusercontent.com/Sena-H/-kuromi-/d3745ec/hjkg/hjkg/dk_lib/include/Core/GlobalDef.h | Sena-H/-kuromi- d3745ec hjkg/hjkg/dk_lib/include/Core/GlobalDef.h | true | 200 | 374 | #ifndef GLOBALDEF_H_
#define GLOBALDEF_H_
#include<stdint.h>
#include<stdbool.h>
#include<malloc.h>
typedef void* general; //通用类型定义
typedef bool (*CompareCallBack)(general, general); //比较回调
#define VALUE(val) (general)(val)
#define _Break _i=INT32_MAX;break //跳出foreach
#define _Continue break //继续foreach
#... | 3 |
scallyw4g/bonsai | d838c7d | generated/asyncify_render_function_h_RenderToTexture.h | C | www.github.com/scallyw4g/bonsai/tree/main/generated/asyncify_render_function_h_RenderToTexture.h | https://raw.githubusercontent.com/scallyw4g/bonsai/d838c7d/generated/asyncify_render_function_h_RenderToTexture.h | scallyw4g/bonsai d838c7d generated/asyncify_render_function_h_RenderToTexture.h | true | 200 | 212 | // src/engine/work_queue.h:237:0
struct render_to_texture_async_params poof(@async_function_params)
{
engine_resources *Engine;
asset_thumbnail *Thumb;
lod_element_buffer *Meshes;
v3 Offset;
camera *Camera;
};
| 6 |
vishakhanpillai/Data-Structures-Using-C | fc5145b | 13. infix to postfix converter.c | C | www.github.com/vishakhanpillai/Data-Structures-Using-C/tree/main/13. infix to postfix converter.c | https://raw.githubusercontent.com/vishakhanpillai/Data-Structures-Using-C/fc5145b/13.%20infix%20to%20postfix%20converter.c | vishakhanpillai/Data-Structures-Using-C fc5145b 13. infix to postfix converter.c | true | 200 | 1,331 | #include <stdio.h>
#include <ctype.h>
int priority(char ch){
switch(ch){
case '^':
return 3;
case '*':
case '/':
return 2;
case '+':
case '-':
return 1;
default :
return 0;
}
}
int main(){
char stack[50], infix[50], postfix[50];
int top = -1, i, j = -1;
printf("Enter... | 5 |
Youssef-Mafa/alx-low_level_programming | a817b06 | 0x0C-more_malloc_free/1-string_nconcat.c | C | www.github.com/Youssef-Mafa/alx-low_level_programming/tree/main/0x0C-more_malloc_free/1-string_nconcat.c | https://raw.githubusercontent.com/Youssef-Mafa/alx-low_level_programming/a817b06/0x0C-more_malloc_free/1-string_nconcat.c | Youssef-Mafa/alx-low_level_programming a817b06 0x0C-more_malloc_free/1-string_nconcat.c | true | 200 | 646 | #include "main.h"
#include <stdlib.h>
/**
* string_nconcat - function concatenates two strings
* @s1:pointer to mem contain string 1
* @s2:pointer to mem contain strin 2
* @n:number of byets s2 that we need
* Return:NULL or string
*/
char *string_nconcat(char *s1, char *s2, unsigned int n)
{
char *x;
unsigned ... | 0 |
AhmedTarekYoussif/ARM-Projects | 4476003 | SPI_project1/Src/SPI_prg.c | C | www.github.com/AhmedTarekYoussif/ARM-Projects/tree/main/SPI_project1/Src/SPI_prg.c | https://raw.githubusercontent.com/AhmedTarekYoussif/ARM-Projects/4476003/SPI_project1/Src/SPI_prg.c | AhmedTarekYoussif/ARM-Projects 4476003 SPI_project1/Src/SPI_prg.c | true | 200 | 1,262 | /*
* SPI_prg.c
*
* Created on: Feb 21, 2023
* Author: Ahmed Tarek
*/
#include"STD_TYPES.h"
#include"BIT_MATH.h"
#include"SPI_pri.h"
#include"SPI_config.h"
#include"SPI_int.h"
#include"DIO_interface.h"
void MSPI_void_initMaster(void)
{
SPI_CR1 = 0x0347 ;
}
void MSPI_void_initSlave(v... | 2 |
kpatsakis/linevul | 12b2e3c | 11898.c | C | www.github.com/kpatsakis/linevul/tree/main/11898.c | https://raw.githubusercontent.com/kpatsakis/linevul/12b2e3c/11898.c | kpatsakis/linevul 12b2e3c 11898.c | true | 200 | 1,348 | mountpoint_last(struct nameidata *nd, struct path *path)
{
int error = 0;
struct dentry *dentry;
struct dentry *dir = nd->path.dentry;
/* If we're in rcuwalk, drop out of it to handle last component */
if (nd->flags & LOOKUP_RCU) {
if (unlazy_walk(nd, NULL)) {
error = -ECHILD;
goto out;
}
}
nd->flags &= ~LOOKUP_PAREN... | 4 |
denisgruiax/programming-techniques | c7b7008 | lab9-algorithm-analysis-simply-chained-lists/app3.c | C | www.github.com/denisgruiax/programming-techniques/tree/main/lab9-algorithm-analysis-simply-chained-lists/app3.c | https://raw.githubusercontent.com/denisgruiax/programming-techniques/c7b7008/lab9-algorithm-analysis-simply-chained-lists/app3.c | denisgruiax/programming-techniques c7b7008 lab9-algorithm-analysis-simply-chained-lists/app3.c | true | 200 | 2,171 | /*
Aplicația 9.3: Să se scrie o funcție care primește ca parametri două liste și returnează o
listă care reprezintă reuniunea elementelor lor, fiecare element apărând o singură dată,
chiar dacă în listele originare el este duplicat.
*/
#include <stdio.h>
#include <stdlib.h>
typedef struct Node
{
int n... | 1 |
aTomWeaver/learning-c | 6d511ab | 1/print_longest_line/119.c | C | www.github.com/aTomWeaver/learning-c/tree/main/1/print_longest_line/119.c | https://raw.githubusercontent.com/aTomWeaver/learning-c/6d511ab/1/print_longest_line/119.c | aTomWeaver/learning-c 6d511ab 1/print_longest_line/119.c | true | 200 | 1,048 | #include <stdio.h>
#define MAXLENGTH 100
int getLine(char line[], int maxline);
void reverseLine(char forwardLine[], char backwardLine[], int len);
void clearLine(char line[], int len);
int main()
{
int len;
char line[MAXLENGTH];
char reversed[MAXLENGTH];
/* while ((len = getLine(line, MAXLENGTH) ... | 3 |
fadliSaber/pascalCompiler | 3bd131f | analyseur_semantique.c | C | www.github.com/fadliSaber/pascalCompiler/tree/main/analyseur_semantique.c | https://raw.githubusercontent.com/fadliSaber/pascalCompiler/3bd131f/analyseur_semantique.c | fadliSaber/pascalCompiler 3bd131f analyseur_semantique.c | true | 200 | 17,387 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#define NbrIDFS 100
typedef enum {
ID_TOKEN, PROGRAM_TOKEN, CONST_TOKEN, VAR_TOKEN,
BEGIN_TOKEN, END_TOKEN, IF_TOKEN, THEN_TOKEN,
WHILE_TOKEN, DO_TOKEN, READ_TOKEN, WRITE_TOKEN,
PV_TOKEN, PT_TOKEN, PLUS_TOKEN, MOINS_TOKEN,
... | 0 |
ArkadebMisra/jadavpur | aa6e823 | sem2/os/a4/q2.c | C | www.github.com/ArkadebMisra/jadavpur/tree/main/sem2/os/a4/q2.c | https://raw.githubusercontent.com/ArkadebMisra/jadavpur/aa6e823/sem2/os/a4/q2.c | ArkadebMisra/jadavpur aa6e823 sem2/os/a4/q2.c | true | 200 | 1,110 | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/wait.h>
#define NUM_CHILDREN 10
#define RANGE_SIZE 100
int is_prime(int n) {
if (n <= 1)
return 0;
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0)
return 0;
}
return 1;
}
void... | 6 |
Atmosic/openair | 6be47b1 | drivers/pwm/pwm_atm.c | C | www.github.com/Atmosic/openair/tree/main/drivers/pwm/pwm_atm.c | https://raw.githubusercontent.com/Atmosic/openair/6be47b1/drivers/pwm/pwm_atm.c | Atmosic/openair 6be47b1 drivers/pwm/pwm_atm.c | true | 200 | 11,573 | /*
* Copyright (c) 2021-2024, Atmosic
*
* SPDX-License-Identifier: Apache-2.0
*/
#include <zephyr/logging/log.h>
LOG_MODULE_REGISTER(pwm_atm, CONFIG_PWM_LOG_LEVEL);
#include <errno.h>
#include <zephyr/drivers/pwm.h>
#ifdef CONFIG_PM
#include <zephyr/pm/policy.h>
#endif
#include <soc.h>
#include "arch.h"
#include... | 5 |
texttoart/biblio_J6 | 49994c1 | ex01/ft_print_params.c | C | www.github.com/texttoart/biblio_J6/tree/main/ex01/ft_print_params.c | https://raw.githubusercontent.com/texttoart/biblio_J6/49994c1/ex01/ft_print_params.c | texttoart/biblio_J6 49994c1 ex01/ft_print_params.c | true | 200 | 294 | #include <unistd.h>
void ft_putchar(char c)
{
write(STDOUT_FILENO, &c, 1);
}
int main(int argc, char **argv)
{
int i;
int j;
i = 1;
while (i < argc)
{
j = 0;
while (argv[i][j] != '\0')
{
ft_putchar(argv[i][j]);
j = j + 1;
}
ft_putchar('\n');
i = i +1;
}
return (0);
}
| 7 |
assouari1/alx-low_level_programming | c742d05 | 0x14-bit_manipulation/2-get_bit.c | C | www.github.com/assouari1/alx-low_level_programming/tree/main/0x14-bit_manipulation/2-get_bit.c | https://raw.githubusercontent.com/assouari1/alx-low_level_programming/c742d05/0x14-bit_manipulation/2-get_bit.c | assouari1/alx-low_level_programming c742d05 0x14-bit_manipulation/2-get_bit.c | true | 200 | 354 | #include "main.h"
/**
* get_bit - returns the value of a bit at a given index in a decimal form.
* @n: number to search.
* @index: index of the bit.
*
* Return: value of the bit at index, or -1 if fail.
*/
int get_bit(unsigned long int n, unsigned int index)
{
int bitvalue;
if (index > 63)
return (-1);
bitvalue = (n >>... | 2 |
DhruvVekariya05/College_Assignment | efa614a | Assignment 5/4.c | C | www.github.com/DhruvVekariya05/College_Assignment/tree/main/Assignment 5/4.c | https://raw.githubusercontent.com/DhruvVekariya05/College_Assignment/efa614a/Assignment%205/4.c | DhruvVekariya05/College_Assignment efa614a Assignment 5/4.c | true | 200 | 293 | #include <stdio.h>
#include <stdlib.h>
int factorial(int num) {
int fact = 1;
for (int i = 1; i <= num; i++) {
fact = fact * i;
}
return fact;
}
int main(int argc,char* argv[]){
int num = atoi(argv[1]);
printf("Factorial of %d is %d", num, factorial(num));
return 0;
} | 4 |
SeifSeooud/HackerRank_Solutions | 4e46056 | Hacker_Rank_Solution/Sum_and_Difference_of_Two_Numbers.c | C | www.github.com/SeifSeooud/HackerRank_Solutions/tree/main/Hacker_Rank_Solution/Sum_and_Difference_of_Two_Numbers.c | https://raw.githubusercontent.com/SeifSeooud/HackerRank_Solutions/4e46056/Hacker_Rank_Solution/Sum_and_Difference_of_Two_Numbers.c | SeifSeooud/HackerRank_Solutions 4e46056 Hacker_Rank_Solution/Sum_and_Difference_of_Two_Numbers.c | true | 200 | 279 | /* Sum and Difference of Two Numbers in C */
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main()
{
int i,j;
float n,m;
scanf("%d %d %f %f\n", &i, &j, &n, &m);
printf("%d %d\n%.1f %.1f\n", i+j, i-j, n+m, n-m);
return 0;
} | 1 |
Franky55/Template | ca9c6be | include/main.h | C | www.github.com/Franky55/Template/tree/main/include/main.h | https://raw.githubusercontent.com/Franky55/Template/ca9c6be/include/main.h | Franky55/Template ca9c6be include/main.h | true | 200 | 2,200 | /**
* @file xmain.h
* @author Francis Gratton
*
* @brief Le fichier xmain.h est nécessaire pour les includions global qui
* contien les defines essentiel au fonctionnement. Le processeur utilisé
* pour la gestion du véhicule est un ESP32-S3. Voir le document de projet
* pour plus d'information sur le fonct... | 3 |
OuidadNassife/alx-low_level_programming | fd013d9 | 0x02-functions_nested_loops/11-print_to_98.c | C | www.github.com/OuidadNassife/alx-low_level_programming/tree/main/0x02-functions_nested_loops/11-print_to_98.c | https://raw.githubusercontent.com/OuidadNassife/alx-low_level_programming/fd013d9/0x02-functions_nested_loops/11-print_to_98.c | OuidadNassife/alx-low_level_programming fd013d9 0x02-functions_nested_loops/11-print_to_98.c | true | 200 | 433 | #include "main.h"
#include <stdio.h>
/**
*print_to_98 -Prints all natural numbers from n to 98
*@n:The number to strat printing from
*Return:Always 0.
*/
void print_to_98(int n)
{
if (n <= 98)
{
for (; n <= 98; n++)
{
if (n == 98)
{
printf("%d", n);
printf("\n");
break;
}
else
{
printf("%d, ", n);
}
}
}
else
{
... | 0 |
CodedJay672/alx-low_level_programming | f24f074 | 0x04-more_functions_nested_loops/0-isupper.c | C | www.github.com/CodedJay672/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/0-isupper.c | https://raw.githubusercontent.com/CodedJay672/alx-low_level_programming/f24f074/0x04-more_functions_nested_loops/0-isupper.c | CodedJay672/alx-low_level_programming f24f074 0x04-more_functions_nested_loops/0-isupper.c | true | 200 | 252 | #include "main.h"
/**
* _isupper - checks if an arguement is uppercase
* @c: function argument
* Return: - return 1 (true) or 0 (false)
*/
int _isupper(int c)
{
int a;
if (c >= 65 && c <= 90)
{
a = 1;
}
else
{
a = 0;
}
return (a);
}
| 5 |
Randy0607/alx-low_level_programming | cf6b49e | 0x05-pointers_arrays_strings/1-swap.c | C | www.github.com/Randy0607/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/1-swap.c | https://raw.githubusercontent.com/Randy0607/alx-low_level_programming/cf6b49e/0x05-pointers_arrays_strings/1-swap.c | Randy0607/alx-low_level_programming cf6b49e 0x05-pointers_arrays_strings/1-swap.c | true | 200 | 177 | #include "main.h"
/**
* swap_int - swap variable values
* @a: pointer 1
* @b: pointer 2
* Return: void
*/
void swap_int(int *a, int *b)
{
int n;
n = *a;
*a = *b;
*b = n;
}
| 6 |
itallo894/Projeto-APc1 | 82a5862 | .ccls-cache/@home@runner@Projeto-APc1/Projeto@teste.c | C | www.github.com/itallo894/Projeto-APc1/tree/main/.ccls-cache/@home@runner@Projeto-APc1/Projeto@teste.c | https://raw.githubusercontent.com/itallo894/Projeto-APc1/82a5862/.ccls-cache/%40home%40runner%40Projeto-APc1/Projeto%40teste.c | itallo894/Projeto-APc1 82a5862 .ccls-cache/@home@runner@Projeto-APc1/Projeto@teste.c | true | 200 | 4,073 | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
void roleta(){
int opcao = 0;
int na;
int n1;
int saldo = 0;
int deposito;
int deu_certo;
char nome[31];
deu_certo = system("clear");
printf("Qual o seu nome? ");
deu_certo = scanf("%[^\n]s", nome);
while (getchar() != '\n')
;... | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.