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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
bottle2/aqueduct1 | 251be37 | batch2.c | C | www.github.com/bottle2/aqueduct1/tree/main/batch2.c | https://raw.githubusercontent.com/bottle2/aqueduct1/251be37/batch2.c | bottle2/aqueduct1 251be37 batch2.c | true | 200 | 2,160 | #include <assert.h>
#include <ctype.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
#include "code.h"
#include "parse.h"
static size_t length = 0;
static int cprintf(void *data, char const *fmt, ...)
{
size_t *len = data;
va_list ap;
va_start(ap, fmt);
int code = v... | 4 |
outofink/dwm | ff605c0 | config.h | C | www.github.com/outofink/dwm/tree/main/config.h | https://raw.githubusercontent.com/outofink/dwm/ff605c0/config.h | outofink/dwm ff605c0 config.h | true | 200 | 9,834 | /* See LICENSE file for copyright and license details. */
/* appearance */
static const unsigned int borderpx = 0; /* border pixel of windows */
static const unsigned int snap = 16; /* snap pixel */
static const int swallowfloating = 0; /* 1 means swallow floating windows by default */
static... | 2 |
baltej223/learning_c | 9c2fec1 | patterns/numberSquare.c | C | www.github.com/baltej223/learning_c/tree/main/patterns/numberSquare.c | https://raw.githubusercontent.com/baltej223/learning_c/9c2fec1/patterns/numberSquare.c | baltej223/learning_c 9c2fec1 patterns/numberSquare.c | true | 200 | 245 | #include <stdio.h>
int main() {
int i;
printf("Enter number: "); int n; scanf("%d", &n);
for (i = 0; i < n; i++) {
for (int j=1;j<=n;j++){
printf("%d ", j);
}
printf("\n");
}
return 0;
} | 7 |
GabriAssiss/puc-aeds-1 | da097d9 | Lista 07/Ex.4/main.c | C | www.github.com/GabriAssiss/puc-aeds-1/tree/main/Lista 07/Ex.4/main.c | https://raw.githubusercontent.com/GabriAssiss/puc-aeds-1/da097d9/Lista%2007/Ex.4/main.c | GabriAssiss/puc-aeds-1 da097d9 Lista 07/Ex.4/main.c | true | 200 | 333 | #include <stdio.h>
#include <stdlib.h>
int funcaoRecursiva(int n){
printf("%d ", n);
if(n != 0){
n--;
funcaoRecursiva(n);
}
else{
return n;
}
}
int main()
{
int n;
printf("Digite um numero: ");
scanf("%d", &n);
funcaoRecursiva(n);
r... | 0 |
nicolascaliari/utn | e934166 | eje4.2/src/eje4.2.c | C | www.github.com/nicolascaliari/utn/tree/main/eje4.2/src/eje4.2.c | https://raw.githubusercontent.com/nicolascaliari/utn/e934166/eje4.2/src/eje4.2.c | nicolascaliari/utn e934166 eje4.2/src/eje4.2.c | true | 200 | 1,527 | /*
============================================================================
Name : 2.c
Author :
Version :
Copyright : Your copyright notice
Description : Hello World in C, Ansi-style
============================================================================
*/
#include <stdio.h>
#inclu... | 3 |
MinGu-Jeong/Algorithm | 524b287 | 백준/Bronze/2839. 설탕 배달/설탕 배달.c | C | www.github.com/MinGu-Jeong/Algorithm/tree/main/백준/Bronze/2839. 설탕 배달/설탕 배달.c | https://raw.githubusercontent.com/MinGu-Jeong/Algorithm/524b287/%EB%B0%B1%EC%A4%80/Bronze/2839.%E2%80%85%EC%84%A4%ED%83%95%E2%80%85%EB%B0%B0%EB%8B%AC/%EC%84%A4%ED%83%95%E2%80%85%EB%B0%B0%EB%8B%AC.c | MinGu-Jeong/Algorithm 524b287 백준/Bronze/2839. 설탕 배달/설탕 배달.c | true | 200 | 481 | #include <stdio.h>
int main(){
int x=0, y=0, sugar=0;
scanf("%d",&sugar);
while(sugar>=5){
sugar=sugar-5;
y++;
}
if (sugar==0)
printf("%d",x+y);
else{
if (sugar==3){
x++;
printf("%d",x+y);
}
else{
while((y>0)&&(sugar%3!=0)){
sugar=sugar+5;
y--;
if(sugar%3==0){
while(su... | 6 |
igreat/c-notes-pt | 4038eea | week3/experiment.c | C | www.github.com/igreat/c-notes-pt/tree/main/week3/experiment.c | https://raw.githubusercontent.com/igreat/c-notes-pt/4038eea/week3/experiment.c | igreat/c-notes-pt 4038eea week3/experiment.c | true | 200 | 460 | #include <stdio.h>
int main() {
double arr[5] = {1., 2., 3., 4., 5.};
int* ptr = arr;
for (int i = 0; i < 5; i++) {
// jumps in double are 8 bytes
printf("ptr = %p, value = %f\n", arr + i, *(arr + i));
// int pointers are 4 bytes, hence I need to double the jump
printf("ptr ... | 1 |
bsantosh-kumar/personal-projects | 4d82b5e | sash/test.c | C | www.github.com/bsantosh-kumar/personal-projects/tree/main/sash/test.c | https://raw.githubusercontent.com/bsantosh-kumar/personal-projects/4d82b5e/sash/test.c | bsantosh-kumar/personal-projects 4d82b5e sash/test.c | true | 200 | 3,864 | #include <fcntl.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/wait.h>
#include <unistd.h>
void checkAndPrintAbsolutePath(char *path) {
char absolute_path[256];
realpath(path, absolute_path);
if (strcmp(absolute_path, path) != 0) { //if provided path is not absolute path, print... | 5 |
elghaf/sorting_algorithms | 0f1073b | 3-quick_sort.c | C | www.github.com/elghaf/sorting_algorithms/tree/main/3-quick_sort.c | https://raw.githubusercontent.com/elghaf/sorting_algorithms/0f1073b/3-quick_sort.c | elghaf/sorting_algorithms 0f1073b 3-quick_sort.c | true | 200 | 1,316 | #include "sort.h"
/**
* swap_ints - Swap two integers in an array.
* @a: The first integer to swap.
* @b: The second integer to swap.
*/
void swap_ints(int *a, int *b)
{
int tmp;
tmp = *a;
*a = *b;
*b = tmp;
}
/**
* quick_sort - Sort an array of integers in ascending order
* ... | 4 |
mudduprasadv/MudduPrasad | 2aaa3e1 | recipes-radio/wireless-mod/files/fb_terragraph/fb_tgd_route_pfe.c | C | www.github.com/mudduprasadv/MudduPrasad/tree/main/recipes-radio/wireless-mod/files/fb_terragraph/fb_tgd_route_pfe.c | https://raw.githubusercontent.com/mudduprasadv/MudduPrasad/2aaa3e1/recipes-radio/wireless-mod/files/fb_terragraph/fb_tgd_route_pfe.c | mudduprasadv/MudduPrasad 2aaa3e1 recipes-radio/wireless-mod/files/fb_terragraph/fb_tgd_route_pfe.c | true | 200 | 8,465 | /*
* Copyright (c) Meta Platforms, Inc. and affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
/* Terragraph NSS routing backend */
#define pr_fmt(fmt) "fb_tgd_route_pfe: " fmt
#include <linux/kernel.h>
#include <linux/sla... | 2 |
JoseMPaz/SO_pazPortillajoseMiguel | 53efdc5 | TP_SISTEMA_DISTRIBUIDO/kernel/src/main.c | C | www.github.com/JoseMPaz/SO_pazPortillajoseMiguel/tree/main/TP_SISTEMA_DISTRIBUIDO/kernel/src/main.c | https://raw.githubusercontent.com/JoseMPaz/SO_pazPortillajoseMiguel/53efdc5/TP_SISTEMA_DISTRIBUIDO/kernel/src/main.c | JoseMPaz/SO_pazPortillajoseMiguel 53efdc5 TP_SISTEMA_DISTRIBUIDO/kernel/src/main.c | true | 200 | 2,999 | #include "main.h"
void * enviar_saludo (void * socket_kernel);
int main (void)
{
t_log * log = NULL;
t_config * config = NULL;
char * puerto_escucha_kernel, * ip_memoria, * puerto_memoria, * ip_cpu, * puerto_cpu_dispatch, * puerto_cpu_interrupt;
int * socket_kernel_a_memoria = (int *) malloc (sizeof (int));
int ... | 7 |
eclipse-openxilenv/openxilenv | d624abb | Src/Global/IniFileDontExist.c | C | www.github.com/eclipse-openxilenv/openxilenv/tree/main/Src/Global/IniFileDontExist.c | https://raw.githubusercontent.com/eclipse-openxilenv/openxilenv/d624abb/Src/Global/IniFileDontExist.c | eclipse-openxilenv/openxilenv d624abb Src/Global/IniFileDontExist.c | true | 200 | 5,292 | /*
* Copyright 2023 ZF Friedrichshafen AG
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or a... | 0 |
Katscan-static/alx-low_level_programming | ef14668 | 0x06-pointers_arrays_strings/4-rev_array.c | C | www.github.com/Katscan-static/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/4-rev_array.c | https://raw.githubusercontent.com/Katscan-static/alx-low_level_programming/ef14668/0x06-pointers_arrays_strings/4-rev_array.c | Katscan-static/alx-low_level_programming ef14668 0x06-pointers_arrays_strings/4-rev_array.c | true | 200 | 306 | #include "main.h"
#include <stdio.h>
/**
* reverse_array - reverse the content of an array
* @a: array to be reversed
* @n: size of array
*/
void reverse_array(int *a, int n)
{
int i;
int temp1;
n -= 1;
for (i = 0; i < n / 2; i++)
{
temp1 = a[i];
a[i] = a[n - i];
a[n - i] = temp1;
}
}
| 3 |
Rayaan-khan428/Data-Structures-II | fd1cb44 | Trees/A7_3/bst.c | C | www.github.com/Rayaan-khan428/Data-Structures-II/tree/main/Trees/A7_3/bst.c | https://raw.githubusercontent.com/Rayaan-khan428/Data-Structures-II/fd1cb44/Trees/A7_3/bst.c | Rayaan-khan428/Data-Structures-II fd1cb44 Trees/A7_3/bst.c | true | 200 | 3,855 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "bst.h"
TNODE *search(TNODE *root, char *name) {
// your implementation | Binary Search Option, recursive
// recursive method
// check if the root is a match
if (strcmp(root->data.name,name) == 0) {
return root;
}
... | 6 |
falguni8/network-lab | 8d3147b | endsem/mserver.c | C | www.github.com/falguni8/network-lab/tree/main/endsem/mserver.c | https://raw.githubusercontent.com/falguni8/network-lab/8d3147b/endsem/mserver.c | falguni8/network-lab 8d3147b endsem/mserver.c | true | 200 | 1,422 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
typedef struct files {
char name[20];
int count;
char filename[100][20];
}fserver;
fserver f[4];
int main()
{
// create a socket
int server_socket;
server_socket =... | 1 |
RezaRahemtola/Zappy | ec5071e | server/src/commands/gui/events/events.c | C | www.github.com/RezaRahemtola/Zappy/tree/main/server/src/commands/gui/events/events.c | https://raw.githubusercontent.com/RezaRahemtola/Zappy/ec5071e/server/src/commands/gui/events/events.c | RezaRahemtola/Zappy ec5071e server/src/commands/gui/events/events.c | true | 200 | 551 | /*
** EPITECH PROJECT, 2023
** Zappy Server
** File description:
** events
*/
#include <string.h>
#include <malloc.h>
#include "types.h"
#include "parameters.h"
void send_event(list_t *clients, char *message, bool free_msg)
{
client_t *client = NULL;
for (; clients != NULL; clients = clients->next) {
... | 5 |
pallavirajeev/CSE101-Programming-Assignments | 5ae0f02 | pa3/GraphTest.c | C | www.github.com/pallavirajeev/CSE101-Programming-Assignments/tree/main/pa3/GraphTest.c | https://raw.githubusercontent.com/pallavirajeev/CSE101-Programming-Assignments/5ae0f02/pa3/GraphTest.c | pallavirajeev/CSE101-Programming-Assignments 5ae0f02 pa3/GraphTest.c | true | 200 | 2,453 | //-----------------------------------------------------------------------------
// Pallavi Rajeev
// prajeev
// pa3
// GraphTest.c
// Testing File for Graph ADT
//-----------------------------------------------------------------------------
#include<stdio.h>
#include<stdlib.h>
#include"List.h"
#include"Graph.h"
int m... | 4 |
Ghostmodeslim/alx-low_level_programming | 8e07311 | 0x13-more_singly_linked_lists/1-listint_len.c | C | www.github.com/Ghostmodeslim/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/1-listint_len.c | https://raw.githubusercontent.com/Ghostmodeslim/alx-low_level_programming/8e07311/0x13-more_singly_linked_lists/1-listint_len.c | Ghostmodeslim/alx-low_level_programming 8e07311 0x13-more_singly_linked_lists/1-listint_len.c | true | 200 | 284 | #include "lists.h"
/**
* listint_len - prints the number of elements in a linked list
* @h: pointer to the start of the list
* Return: number of items in the list
**/
size_t listint_len(const listint_t *h)
{
int count = 0;
while (h)
{
count++;
h = h->next;
}
return (count);
}
| 2 |
deeplex/concrete | 93c78ca | external/predef/include/dplx/predef/compiler/ibm.h | C | www.github.com/deeplex/concrete/tree/main/external/predef/include/dplx/predef/compiler/ibm.h | https://raw.githubusercontent.com/deeplex/concrete/93c78ca/external/predef/include/dplx/predef/compiler/ibm.h | deeplex/concrete 93c78ca external/predef/include/dplx/predef/compiler/ibm.h | true | 200 | 2,118 | /*
Copyright Rene Rivera 2008-2015
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or copy at
http://www.boost.org/LICENSE_1_0.txt)
*/
#ifndef DPLX_PREDEF_COMPILER_IBM_H
#define DPLX_PREDEF_COMPILER_IBM_H
#include <dplx/predef/version_number.h>
#include <dplx/predef/m... | 7 |
AyaAlahdl/alx-low_level_programming | 07c4b5c | 0x0A-argc_argv/100-change.c | C | www.github.com/AyaAlahdl/alx-low_level_programming/tree/main/0x0A-argc_argv/100-change.c | https://raw.githubusercontent.com/AyaAlahdl/alx-low_level_programming/07c4b5c/0x0A-argc_argv/100-change.c | AyaAlahdl/alx-low_level_programming 07c4b5c 0x0A-argc_argv/100-change.c | true | 200 | 710 | #include <stdio.h>
#include <stdlib.h>
/**
* main - Prints the minimum number of coins to
* make change for an amount of money.
* @argc: The number of arguments supplied to the program.
* @argv: An array of pointers to the arguments.
*
* Return: If the number of arguments is not exactly one - 1.
* ... | 3 |
desiartem/freerdp | 6dcc4a3 | libfreerdp/cache/persistent.c | C | www.github.com/desiartem/freerdp/tree/main/libfreerdp/cache/persistent.c | https://raw.githubusercontent.com/desiartem/freerdp/6dcc4a3/libfreerdp/cache/persistent.c | desiartem/freerdp 6dcc4a3 libfreerdp/cache/persistent.c | true | 200 | 8,381 | /**
* FreeRDP: A Remote Desktop Protocol Implementation
* Persistent Bitmap Cache
*
* Copyright 2016 Marc-Andre Moreau <marcandre.moreau@gmail.com>
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of th... | 1 |
zahra-hr/alx-low_level_programming123 | ec631f1 | 0x04-more_functions_nested_loops/10-print_triangle.c | C | www.github.com/zahra-hr/alx-low_level_programming123/tree/main/0x04-more_functions_nested_loops/10-print_triangle.c | https://raw.githubusercontent.com/zahra-hr/alx-low_level_programming123/ec631f1/0x04-more_functions_nested_loops/10-print_triangle.c | zahra-hr/alx-low_level_programming123 ec631f1 0x04-more_functions_nested_loops/10-print_triangle.c | true | 200 | 390 | #include "main.h"
/**
* print_triangle - function that prints a triangle
* @size: parameter
*/
void print_triangle(int size)
{
int i = 1;
int j, d;
if (size <= 0)
_putchar('\n');
else
{
while (i <= size)
{
j = size - i;
d = 1;
while (d <= size)
{
if (d <= j)
_putchar(' ');
else
... | 4 |
vaxfpga/cmicro2 | 3e5f1f5 | cmicro2.c | C | www.github.com/vaxfpga/cmicro2/tree/main/cmicro2.c | https://raw.githubusercontent.com/vaxfpga/cmicro2/3e5f1f5/cmicro2.c | vaxfpga/cmicro2 3e5f1f5 cmicro2.c | true | 200 | 6,969 | // SPDX-License-Identifier: MIT
// SPDX-FileCopyrightText: 2023 vaxfpga <vaxfpga@users.noreply.github.com>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "constraints.h"
#include "fields.h"
#include "hashtable.h"
#include "io.h"
#include "macros.h"
#include "parser.h"
#includ... | 2 |
KayaHalilibrahim/C_notes | 31fa5c9 | 0.Good examples/09.Create square with star.c | C | www.github.com/KayaHalilibrahim/C_notes/tree/main/0.Good examples/09.Create square with star.c | https://raw.githubusercontent.com/KayaHalilibrahim/C_notes/31fa5c9/0.Good%20examples/09.Create%20square%20with%20star.c | KayaHalilibrahim/C_notes 31fa5c9 0.Good examples/09.Create square with star.c | true | 200 | 420 | #include <stdio.h>
#include <stdlib.h>
int main() {
int i,j,n,space;
printf("Enter a number:");
scanf("%d",&n);
for(i=0; i<n; i++)
{
printf("* ");
}
printf("\n");
for(i=0; i<(n-2); i++)
{
printf("*");
for(j=0; j<(2*n-3); j++)
{
printf(" ");
}
printf("*\n");
}
for(i=0; i<n; i++)
{
printf("* ");
... | 0 |
haid-er/C-Language | 3f0d93d | Labs_BSIT_Semester_02/Lab_13/Task 02 Nested Structures to get Date of Birth.c | C | www.github.com/haid-er/C-Language/tree/main/Labs_BSIT_Semester_02/Lab_13/Task 02 Nested Structures to get Date of Birth.c | https://raw.githubusercontent.com/haid-er/C-Language/3f0d93d/Labs_BSIT_Semester_02/Lab_13/Task%2002%20Nested%20Structures%20to%20get%20Date%20of%20Birth.c | haid-er/C-Language 3f0d93d Labs_BSIT_Semester_02/Lab_13/Task 02 Nested Structures to get Date of Birth.c | true | 200 | 1,353 | // Program to take data of student and display it using nested structures
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
struct DateOfBirth
{
int date;
int month;
int year;
};
struct Student
{
int age;
char name[30];
struct DateOfBirth datebrth;
float gpa;
};
void getStudentData(struct Student* s);
struct Dat... | 7 |
wirelune/PipBuck | b1eca64 | src/c/PipBuck.c | C | www.github.com/wirelune/PipBuck/tree/main/src/c/PipBuck.c | https://raw.githubusercontent.com/wirelune/PipBuck/b1eca64/src/c/PipBuck.c | wirelune/PipBuck b1eca64 src/c/PipBuck.c | true | 200 | 10,237 | #include <pebble.h>
//!!!
//CONTENT WARNING - TONS OF SHITCODE!!! YOU'VE BEEN WARNED!!!
//!!!
// UI
static int s_battery_level;
static char battery_text[] = "100";
static GBitmap *s_connect_icon, *s_dsconnect_icon;
static BitmapLayer *s_connect_layer, *s_dsconnect_layer;
static Window *s_main_window;
static TextLaye... | 3 |
Godfrey96/alx-low_level_programming | c530de5 | 0x08-recursion/100-is_palindrome.c | C | www.github.com/Godfrey96/alx-low_level_programming/tree/main/0x08-recursion/100-is_palindrome.c | https://raw.githubusercontent.com/Godfrey96/alx-low_level_programming/c530de5/0x08-recursion/100-is_palindrome.c | Godfrey96/alx-low_level_programming c530de5 0x08-recursion/100-is_palindrome.c | true | 200 | 790 | #include "main.h"
/**
* get_length - get the palindrome length
* @s: the string
* Return: 0 on succesful
*/
int get_length(char *s)
{
int len = 0;
if (*(s + len))
{
len++;
len += get_length(s + len);
}
return (len);
}
/**
* check_palindrome - function to check palindrome
* @s: the string
* @len: the... | 1 |
kareemcoretech/C-repo | 5aca700 | Toqa Elraey/C/Day4/Assignments/Assignment5_func.c | C | www.github.com/kareemcoretech/C-repo/tree/main/Toqa Elraey/C/Day4/Assignments/Assignment5_func.c | https://raw.githubusercontent.com/kareemcoretech/C-repo/5aca700/Toqa%20Elraey/C/Day4/Assignments/Assignment5_func.c | kareemcoretech/C-repo 5aca700 Toqa Elraey/C/Day4/Assignments/Assignment5_func.c | true | 200 | 279 | #include <math.h>
int roots(float x){
int flag = 0;
float num = x;
float i = 1;
while(num > 0){
num = num - i;
i = i + 2;
}
if(num == 0){
flag = 1;
}
else{
if(cbrt(x) == truncf(cbrt(x))){
flag = 0;
}
else{
flag = -1;
}
}
return flag;
} | 4 |
SandipYadav18/My-Codes | 006948a | Program19_2.c | C | www.github.com/SandipYadav18/My-Codes/tree/main/Program19_2.c | https://raw.githubusercontent.com/SandipYadav18/My-Codes/006948a/Program19_2.c | SandipYadav18/My-Codes 006948a Program19_2.c | true | 200 | 889 | // 2. Accept N numbers from user and display all such elements which are divisible by 5.
#include<stdio.h>
#include<stdlib.h>
void Display(int Arr[], int iLength)
{
int i = 0;
for ( i = 0; i < iLength; i++)
{
if (Arr[i] % 5 == 0)
{
printf("%d\n",Arr[i]);
... | 2 |
aaravjn/oslab | d4bfb21 | 2021ucs0080_Aarav_Asgn_7/q1.c | C | www.github.com/aaravjn/oslab/tree/main/2021ucs0080_Aarav_Asgn_7/q1.c | https://raw.githubusercontent.com/aaravjn/oslab/d4bfb21/2021ucs0080_Aarav_Asgn_7/q1.c | aaravjn/oslab d4bfb21 2021ucs0080_Aarav_Asgn_7/q1.c | true | 200 | 994 | #include <stdio.h>
#include <pthread.h>
#include <unistd.h>
static volatile int counter = 0;
void* myThread(void* arg) {
int i;
for(int i = 0;i < 10; i++) {
sleep(1);
counter++;
}
}
int main() {
pthread_t p1, p2;
pthread_create(&p1, NULL, myThread, NULL);
pthread_create(... | 7 |
Kystar012/alx-low_level_programming | 520c2db | 0x05-pointers_arrays_strings/7-puts_half.c | C | www.github.com/Kystar012/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/7-puts_half.c | https://raw.githubusercontent.com/Kystar012/alx-low_level_programming/520c2db/0x05-pointers_arrays_strings/7-puts_half.c | Kystar012/alx-low_level_programming 520c2db 0x05-pointers_arrays_strings/7-puts_half.c | true | 200 | 323 | #include "main.h"
/**
* puts_half- prints half of string followed by new line
* @str:pointer to string to be printed
*
* Return:void 0
*/
void puts_half(char *str)
{
int length = 0;
while (*str != '\0')
{
length++;
str++;
}
str -= (length / 2);
while (*str != '\0')
{
_putchar(*str);
str++;
}
_putchar('\n');
... | 0 |
RJSakariya/C-Language | 190c04d | UDF 2/pr 3.c | C | www.github.com/RJSakariya/C-Language/tree/main/UDF 2/pr 3.c | https://raw.githubusercontent.com/RJSakariya/C-Language/190c04d/UDF%202/pr%203.c | RJSakariya/C-Language 190c04d UDF 2/pr 3.c | true | 200 | 236 | #include <stdio.h>
int fact(int f) {
if(f <= 1){
return f;
}else{
return f *= fact(f-1);
}
}
int main() {
int fac;
printf("Enter fact size: ");
scanf("%d", &fac);
printf("%d",fact(fac));
}
| 3 |
mxvements/ft_exam_rank_02 | 534aea8 | 1130-01/rendu/ft_itoa/ft_itoa.c | C | www.github.com/mxvements/ft_exam_rank_02/tree/main/1130-01/rendu/ft_itoa/ft_itoa.c | https://raw.githubusercontent.com/mxvements/ft_exam_rank_02/534aea8/1130-01/rendu/ft_itoa/ft_itoa.c | mxvements/ft_exam_rank_02 534aea8 1130-01/rendu/ft_itoa/ft_itoa.c | true | 200 | 998 | #include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
/* ft_itoa
* write a function that takes an int and converts it a to a null-termmianted string.
* the function returns the result in a char array that you must allocate.
*/
size_t countdigits(int nbr)
{
size_t len;
len = 0;
if (nbr == 0)
return (1);
... | 1 |
dzhssg/LearnimgCode | 124fb8e | 2024/Test1_11/Project1/Heap.c | C | www.github.com/dzhssg/LearnimgCode/tree/main/2024/Test1_11/Project1/Heap.c | https://raw.githubusercontent.com/dzhssg/LearnimgCode/124fb8e/2024/Test1_11/Project1/Heap.c | dzhssg/LearnimgCode 124fb8e 2024/Test1_11/Project1/Heap.c | true | 200 | 2,659 | #define _CRT_SECURE_NO_WARNINGS 1
#include"Heap.h"
// ��ʼ����
void HeapInit(Hp* hp)
{
assert(hp); // ȷ����ָ����Ч
hp->a = NULL; // ������ָ���ÿ�
hp->size = 0; // ��ʼ���Ѵ�СΪ0
hp->capacity = 0; // ��ʼ��������Ϊ0
}
// ���ٶ�
void HeapDestroy(Hp* hp)
{
assert(hp); // ȷ����ָ����Ч
free(hp->a); // �ͷŶ������ڴ�
... | 2 |
2A5F/mm_longcheng_mm-vulkan | 05177e5 | vkApp/src/al/mmALDevice.c | C | www.github.com/2A5F/mm_longcheng_mm-vulkan/tree/main/vkApp/src/al/mmALDevice.c | https://raw.githubusercontent.com/2A5F/mm_longcheng_mm-vulkan/05177e5/vkApp/src/al/mmALDevice.c | 2A5F/mm_longcheng_mm-vulkan 05177e5 vkApp/src/al/mmALDevice.c | true | 200 | 6,171 | /*
-----------------------------------------------------------------------------
MIT License
Copyright (c) 2022-2022 mm_longcheng@icloud.com
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software withou... | 7 |
lvgl/lv_stm | b6bd0ed | lv_port_stm32mp135f_disco_bm/Drivers/CMSIS/Device/ST/STM32MP13xx/Source/Templates/mmu_stm32mp13xx.c | C | www.github.com/lvgl/lv_stm/tree/main/lv_port_stm32mp135f_disco_bm/Drivers/CMSIS/Device/ST/STM32MP13xx/Source/Templates/mmu_stm32mp13xx.c | https://raw.githubusercontent.com/lvgl/lv_stm/b6bd0ed/lv_port_stm32mp135f_disco_bm/Drivers/CMSIS/Device/ST/STM32MP13xx/Source/Templates/mmu_stm32mp13xx.c | lvgl/lv_stm b6bd0ed lv_port_stm32mp135f_disco_bm/Drivers/CMSIS/Device/ST/STM32MP13xx/Source/Templates/mmu_stm32mp13xx.c | true | 200 | 17,051 | /**
******************************************************************************
* @file mmu_stm32mp13xx.c
* @author MCD Application Team
* @brief CMSIS Cortex-A7 Device Peripheral Access Layer MMU Setup source file.
*
* This file provides one function called from SystemInit
* - MMU_CreateT... | 0 |
okidoki-jpg/alx-low_level_programming | 3c5c66a | 0x13-more_singly_linked_lists/1-listint_len.c | C | www.github.com/okidoki-jpg/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/1-listint_len.c | https://raw.githubusercontent.com/okidoki-jpg/alx-low_level_programming/3c5c66a/0x13-more_singly_linked_lists/1-listint_len.c | okidoki-jpg/alx-low_level_programming 3c5c66a 0x13-more_singly_linked_lists/1-listint_len.c | true | 200 | 293 | #include "lists.h"
/**
* listint_len - determine length of listint linked list
* @h: entry node into the linked list
*
* Return: size_t (number of elements in list)
*/
size_t listint_len(const listint_t *h)
{
size_t res = 0;
while (h)
{
res++;
h = h->next;
}
return (res);
}
| 4 |
kode-trek/game | e047a55 | bug/conio-header-linux.c | C | www.github.com/kode-trek/game/tree/main/bug/conio-header-linux.c | https://raw.githubusercontent.com/kode-trek/game/e047a55/bug/conio-header-linux.c | kode-trek/game e047a55 bug/conio-header-linux.c | true | 200 | 912 | //https://stackoverflow.com/questions/8792317/where-is-the-conio-h-header-file-on-linux-why-cant-i-find-conio-h
//sudo apt-get install libncursesw5-dev
//gcc this.c -lncurses
#include <ncurses.h>
int main(){
initscr(); /* Start curses mode */
raw(); /* pre... | 2 |
Rusticus1999/C-Tutorium | 8809a0b | Klausurvorbereitung/switch.c | C | www.github.com/Rusticus1999/C-Tutorium/tree/main/Klausurvorbereitung/switch.c | https://raw.githubusercontent.com/Rusticus1999/C-Tutorium/8809a0b/Klausurvorbereitung/switch.c | Rusticus1999/C-Tutorium 8809a0b Klausurvorbereitung/switch.c | true | 200 | 315 | #include<stdio.h>
#define mode 2
int main(int argc, char *argv[])
{
#if mode == 1
char a = 34;
char b = 114;
printf("a:%d b:%d\n",a,b);
a = a^b;
b = a^b;
a = a^b;
printf("a:%d b:%d\n",a,b);
#endif
#if mode == 2
int a = 741;
for (int i = 0; i<4; i++){
a = (a + i) << (~i|1);
}
printf("a:%d\n", a);
#endif
}
| 0 |
uofu-emb/lab06_corey_miguel | 6f0eaaa | src/hello_freertos.c | C | www.github.com/uofu-emb/lab06_corey_miguel/tree/main/src/hello_freertos.c | https://raw.githubusercontent.com/uofu-emb/lab06_corey_miguel/6f0eaaa/src/hello_freertos.c | uofu-emb/lab06_corey_miguel 6f0eaaa src/hello_freertos.c | true | 200 | 3,335 | /**
* Copyright (c) 2022 Raspberry Pi (Trading) Ltd.
*
* SPDX-License-Identifier: BSD-3-Clause
*/
#include <stdio.h>
#include <FreeRTOS.h>
#include <semphr.h>
#include "task.h"
#include "pico/stdlib.h"
#include "pico/multicore.h"
#include "pico/cyw43_arch.h"
int count = 0;
bool on = false;
SemaphoreHandle_t sema... | 4 |
dentamuhajir/B28-Computer_Science | 3eacdd5 | Semester-1/Period-1/Algorithm-and-Programming/LPCA-LEC/9-Pointers-and-Array/mystery-code.c | C | www.github.com/dentamuhajir/B28-Computer_Science/tree/main/Semester-1/Period-1/Algorithm-and-Programming/LPCA-LEC/9-Pointers-and-Array/mystery-code.c | https://raw.githubusercontent.com/dentamuhajir/B28-Computer_Science/3eacdd5/Semester-1/Period-1/Algorithm-and-Programming/LPCA-LEC/9-Pointers-and-Array/mystery-code.c | dentamuhajir/B28-Computer_Science 3eacdd5 Semester-1/Period-1/Algorithm-and-Programming/LPCA-LEC/9-Pointers-and-Array/mystery-code.c | true | 200 | 528 |
#include<stdio.h>
#include<string.h>
#define SIZE 80
int mystery(const char *s1, const char *s2); // prototype
int main(void) {
char string1[SIZE];
char string2[SIZE];
puts("Enter two strings: ");
scanf("%79s%79s", string1, string2);
printf("The result is %d\n", mystery(string1, string2));
... | 3 |
Yashsoni-1/unix-domain-sockets-c | bb9a52f | multiplex_server.c | C | www.github.com/Yashsoni-1/unix-domain-sockets-c/tree/main/multiplex_server.c | https://raw.githubusercontent.com/Yashsoni-1/unix-domain-sockets-c/bb9a52f/multiplex_server.c | Yashsoni-1/unix-domain-sockets-c bb9a52f multiplex_server.c | true | 200 | 5,042 | #include <stdio.h>
#include <sys/socket.h>
#include <stdlib.h>
#include <sys/un.h>
#include <unistd.h>
#include <string.h>
#define SOCKET_NAME "/tmp/DemoSocket"
#define BUFFER_SIZE 128
#define MAX_CLIENT_SUPPORTED 20
int monitored_set[MAX_CLIENT_SUPPORTED];
int client_data[MAX_CLIENT_SUPPORTED] = {0};
static void
i... | 7 |
hiral-barsiya/assignment_c | 118bd53 | 3-looping_stat_pro/9.c | C | www.github.com/hiral-barsiya/assignment_c/tree/main/3-looping_stat_pro/9.c | https://raw.githubusercontent.com/hiral-barsiya/assignment_c/118bd53/3-looping_stat_pro/9.c | hiral-barsiya/assignment_c 118bd53 3-looping_stat_pro/9.c | true | 200 | 403 | //Write a program make a summation of given number (E.g., 1523 Ans: -11)
#include <stdio.h>
void main()
{
int n, sum = 0, digit;
printf("Enter a number: ");
scanf("%d", &n);
int temp = n < 0 ? -n : n;
while (temp > 0)
{
digit = temp % 10;
sum += digit;
... | 2 |
zhadavla/ft_minishell | 2194d4f | src/parser/validate_cmds2.c | C | www.github.com/zhadavla/ft_minishell/tree/main/src/parser/validate_cmds2.c | https://raw.githubusercontent.com/zhadavla/ft_minishell/2194d4f/src/parser/validate_cmds2.c | zhadavla/ft_minishell 2194d4f src/parser/validate_cmds2.c | true | 200 | 2,108 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* validate_cmds2.c :+: :+: :+: ... | 4 |
suetology/Procedural-Programming | 33a2cfa | Sav_6/Uzd_6.2/Uzd6.2.c | C | www.github.com/suetology/Procedural-Programming/tree/main/Sav_6/Uzd_6.2/Uzd6.2.c | https://raw.githubusercontent.com/suetology/Procedural-Programming/33a2cfa/Sav_6/Uzd_6.2/Uzd6.2.c | suetology/Procedural-Programming 33a2cfa Sav_6/Uzd_6.2/Uzd6.2.c | true | 200 | 2,465 | #include <stdio.h>
#define CAPACITY 10
int power(int n, int p);
int toNumber(char n);
int main() {
printf("The program finds the length of the number in file \nThe number should be in range [10; 1000] and it should have no more than 3 digits after comma\n");
printf("Checking file \"in.txt\"...\n");
char... | 0 |
Danstan-O/alx-low_level_programming | a080ba2 | 0x13-more_singly_linked_lists/5-free_listint2.c | C | www.github.com/Danstan-O/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/5-free_listint2.c | https://raw.githubusercontent.com/Danstan-O/alx-low_level_programming/a080ba2/0x13-more_singly_linked_lists/5-free_listint2.c | Danstan-O/alx-low_level_programming a080ba2 0x13-more_singly_linked_lists/5-free_listint2.c | true | 200 | 319 | #include "lists.h"
#include <stdlib.h>
#include <stdio.h>
/**
* free_listint2 - adds a node
* @head: our input
* Return: returns a size_t.
*/
void free_listint2(listint_t **head)
{
listint_t *temp;
if (head == NULL)
{
return;
}
while (*head)
{
temp = (*head)->next;
free(*head);
*head = temp;
}
*head = NULL;
}
| 3 |
naresh0969/c-and-java | 5748d3c | C/assignment 3/q6.c | C | www.github.com/naresh0969/c-and-java/tree/main/C/assignment 3/q6.c | https://raw.githubusercontent.com/naresh0969/c-and-java/5748d3c/C/assignment%203/q6.c | naresh0969/c-and-java 5748d3c C/assignment 3/q6.c | true | 200 | 353 | //write a C program to check whether the entered character is digit or alphabet
#include<stdio.h>
#include<ctype.h>
void main(){
char alp;
printf("Enter Character :");
scanf("%c",&alp);
alp=tolower(alp);
if(alp>='a' && alp<='z'){
printf("Character ");
}
else if(alp>='0' && alp<='9'){... | 7 |
ted-thuraa/alx-low_level_programming | 640443c | 0x06-pointers_arrays_strings/6-cap_string.c | C | www.github.com/ted-thuraa/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/6-cap_string.c | https://raw.githubusercontent.com/ted-thuraa/alx-low_level_programming/640443c/0x06-pointers_arrays_strings/6-cap_string.c | ted-thuraa/alx-low_level_programming 640443c 0x06-pointers_arrays_strings/6-cap_string.c | true | 200 | 713 | #include "main.h"
/**
* cap_string - capitalizes all words of a string
* @s: a pointer i made that is passed by main
* Return: returns the pointer
*/
char *cap_string(char *s)
{
int i = 0;
if (s[0] >= 'a' && s[0] <= 'z')
{
s[0] -= 32;
}
while (s[i] != '\0')
{
if (is_separator(s[i]) && (s[i + ... | 4 |
hacaothu03/Code_Cintro | 30a407a | openerp/ex4.c | C | www.github.com/hacaothu03/Code_Cintro/tree/main/openerp/ex4.c | https://raw.githubusercontent.com/hacaothu03/Code_Cintro/30a407a/openerp/ex4.c | hacaothu03/Code_Cintro 30a407a openerp/ex4.c | true | 200 | 1,396 | /*Cho đầu vào là hai thời điểm giờ:phút:giây theo chuẩn, đều là 2 chữ số không âm (hh:mm:ss).
Nếu cả hai thời điểm là hợp lệ thì so sánh giữa chúng,
nếu hh1:mm1:ss1 < hh2:mm2:ss2 thì hiện ra -1,
nếu hh1:mm1:ss1 = hh2:mm2:ss2 thì hiện ra 0,
còn hh1:mm1:ss1 > hh2:mm2:ss2 thì hiện ra 1
Ngược lại,
thì hiện ra 00:00... | 0 |
Sparky1743/Algorithmic-Game-Projects-in-C-and-CPP | 2ffde55 | connect4.c | C | www.github.com/Sparky1743/Algorithmic-Game-Projects-in-C-and-CPP/tree/main/connect4.c | https://raw.githubusercontent.com/Sparky1743/Algorithmic-Game-Projects-in-C-and-CPP/2ffde55/connect4.c | Sparky1743/Algorithmic-Game-Projects-in-C-and-CPP 2ffde55 connect4.c | true | 200 | 6,258 | /*
Team members:
Birudugadda Srivibhav - 22110050
Bhoumik Patidar - 22110049
Praveen Rathod - 22110206
*/
#include <stdio.h>
#include <assert.h>
/* Implement connect 4 on a 5 (columns) x 4 (rows) board. */
enum {
EMPTY = 0,
RED = 1,
BLUE = 2,
};
typedef char board_t[4][5];
typedef char player_t;
void in... | 3 |
RealLionelMuhire/alx-low_level_programming | fb983ae | 0x0C-more_malloc_free/1-string_nconcat.c | C | www.github.com/RealLionelMuhire/alx-low_level_programming/tree/main/0x0C-more_malloc_free/1-string_nconcat.c | https://raw.githubusercontent.com/RealLionelMuhire/alx-low_level_programming/fb983ae/0x0C-more_malloc_free/1-string_nconcat.c | RealLionelMuhire/alx-low_level_programming fb983ae 0x0C-more_malloc_free/1-string_nconcat.c | true | 200 | 683 | #include "main.h"
#include <stdlib.h>
#include <string.h>
/**
* *string_nconcat - concatenates 2 strings
* @s1: first string
* @s2: 2nd string
* @n: number of bytes
* Return: concatenated string, otherwise NULL
*/
char *string_nconcat(char *s1, char *s2, unsigned int n)
{
unsigned int l1, l2, p;
char *str;
... | 7 |
motiz007/monty | 348807f | _div.c | C | www.github.com/motiz007/monty/tree/main/_div.c | https://raw.githubusercontent.com/motiz007/monty/348807f/_div.c | motiz007/monty 348807f _div.c | true | 200 | 637 | #include "monty.h"
/**
* _div - divides the top two items in stack
* @stack: the stack
* @line_number: the line
* Return: void
*/
void _div(stack_t **stack, unsigned int line_number)
{
int div = 0;
if (*stack == NULL || (*stack)->next == NULL)
{
fprintf(stderr, "L%d: can't div, stack too short\n", line_numbe... | 2 |
Altria-110/homework | b03565c | rain.c | C | www.github.com/Altria-110/homework/tree/main/rain.c | https://raw.githubusercontent.com/Altria-110/homework/b03565c/rain.c | Altria-110/homework b03565c rain.c | true | 200 | 2,278 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <time.h>
#include <stdbool.h>
#include <signal.h>
#define WIDTH 80
#define HEIGHT 24
#define DELAY 100000 // 微秒
char screen[HEIGHT][WIDTH + 1]; // +1 是为了存储字符串结束符 '\0'
bool running = true;
// 初始化屏幕的函数
void init_screen() {
for ... | 0 |
ArturRegadas/Programming_Logic-1 | b6e7d82 | _IFSP/LP1/Lista_2/Exercicios_SALA-lista-2/EX1-3Notas-s/EX1-s.c | C | www.github.com/ArturRegadas/Programming_Logic-1/tree/main/_IFSP/LP1/Lista_2/Exercicios_SALA-lista-2/EX1-3Notas-s/EX1-s.c | https://raw.githubusercontent.com/ArturRegadas/Programming_Logic-1/b6e7d82/_IFSP/LP1/Lista_2/Exercicios_SALA-lista-2/EX1-3Notas-s/EX1-s.c | ArturRegadas/Programming_Logic-1 b6e7d82 _IFSP/LP1/Lista_2/Exercicios_SALA-lista-2/EX1-3Notas-s/EX1-s.c | true | 200 | 361 | #include <stdio.h>
int main() {
float n1, n2, n3;
scanf("%f", &n1);
scanf("%f", &n2);
scanf("%f", &n3);
if ((n1 + n2 + n3) / 3 >= 6){
printf("O aluno foi Aprovado com a média %.2f\n",(n1 + n2 + n3) / 3);
}
else{
printf("O aluno foi Reprovado com a média %.2f\n",(n1... | 4 |
kerito-cl/minishell | 40ce42d | src/execution/utils/exe_wait_children.c | C | www.github.com/kerito-cl/minishell/tree/main/src/execution/utils/exe_wait_children.c | https://raw.githubusercontent.com/kerito-cl/minishell/40ce42d/src/execution/utils/exe_wait_children.c | kerito-cl/minishell 40ce42d src/execution/utils/exe_wait_children.c | true | 200 | 2,987 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* exe_wait_children.c :+: :+: :+: ... | 2 |
herbeeg/hg-advent-code | 90e92d9 | 2022/1/one.c | C | www.github.com/herbeeg/hg-advent-code/tree/main/2022/1/one.c | https://raw.githubusercontent.com/herbeeg/hg-advent-code/90e92d9/2022/1/one.c | herbeeg/hg-advent-code 90e92d9 2022/1/one.c | true | 200 | 2,044 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
FILE *f = fopen("input.txt", "r");
// Terminate if file is invalid.
if (NULL == f) {
exit(0);
}
// Line storage.
char buffer[2245];
long current = 0;
long top_three[3] = { 0, 0, 0 };
while (NULL != fgets(buffer, 2245, f))... | 0 |
pp20u1515/c99 | 7c746e5 | lab_08_13_21/src/io_funcs.c | C | www.github.com/pp20u1515/c99/tree/main/lab_08_13_21/src/io_funcs.c | https://raw.githubusercontent.com/pp20u1515/c99/7c746e5/lab_08_13_21/src/io_funcs.c | pp20u1515/c99 7c746e5 lab_08_13_21/src/io_funcs.c | true | 200 | 2,310 | #include "io_funcs.h"
#include "return_codes.h"
#include "struct.h"
#include "matrix_operations.h"
#define EPS 0.00000001
int read_dimension(matrix_t *matrix, FILE *f_open, size_t *number_nonzero_elems)
{
int rc = OK;
if (fscanf(f_open, "%zu", &matrix->rows) == 1 && matrix->rows > 0)
{
if (fscanf... | 4 |
HSHKZ/holbertonschool-low_level_programming | 292b6ee | more_functions_nested_loops/8-print_square.c | C | www.github.com/HSHKZ/holbertonschool-low_level_programming/tree/main/more_functions_nested_loops/8-print_square.c | https://raw.githubusercontent.com/HSHKZ/holbertonschool-low_level_programming/292b6ee/more_functions_nested_loops/8-print_square.c | HSHKZ/holbertonschool-low_level_programming 292b6ee more_functions_nested_loops/8-print_square.c | true | 200 | 336 | #include <stdio.h>
#include "main.h"
/**
* print_square - check the code
*
* Description: print
*
* @size: input
*
* Return: Always 0.
*/
void print_square(int size)
{
int i, j;
for (i = 0 ; i < size ; i++)
{
for (j = 0 ; j < size ; j++)
_putchar('#');
if (i != (size - 1))
_putchar('\n');
}
_p... | 3 |
Gradi/listvolumes | f98fb20 | src/tests.c | C | www.github.com/Gradi/listvolumes/tree/main/src/tests.c | https://raw.githubusercontent.com/Gradi/listvolumes/f98fb20/src/tests.c | Gradi/listvolumes f98fb20 src/tests.c | true | 200 | 4,873 | #include "console.h"
#include "debug.h"
#include "string.h"
#include <windows.h>
bool AssertMemoryFilledWith(const LPVOID left, SIZE_T length, const BYTE expectedValue);
/* Just check console prints something & application doesn't crash. */
void TestConsole()
{
ConsoleWrite(TEXT("ConsoleWrite works?\r\n"));
C... | 7 |
Bocchio01/Connect_4_Game | 9bcec79 | src/setup/setup.c | C | www.github.com/Bocchio01/Connect_4_Game/tree/main/src/setup/setup.c | https://raw.githubusercontent.com/Bocchio01/Connect_4_Game/9bcec79/src/setup/setup.c | Bocchio01/Connect_4_Game 9bcec79 src/setup/setup.c | true | 200 | 1,587 | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include "setup.h"
#include "../definitions.h"
#include "default.h"
#include "cmd.h"
#include "../utils.h"
void C4G_Setup(game_t *game, int argc, char *argv[])
{
if (argc == 1)
{
C4G_Setup_Default(game);
C4G_Setup_Prompting(game);
... | 2 |
kiran-745/Code-Radar-Solutions | ad59ef4 | Calculate and Print the Area of a Circle@@6788d5012db25efec946f943/code.c | C | www.github.com/kiran-745/Code-Radar-Solutions/tree/main/Calculate and Print the Area of a Circle@@6788d5012db25efec946f943/code.c | https://raw.githubusercontent.com/kiran-745/Code-Radar-Solutions/ad59ef4/Calculate%20and%20Print%20the%20Area%20of%20a%20Circle%40%406788d5012db25efec946f943/code.c | kiran-745/Code-Radar-Solutions ad59ef4 Calculate and Print the Area of a Circle@@6788d5012db25efec946f943/code.c | true | 200 | 327 | #include <stdio.h>
int main() {
float radius, area;
const float PI = 3.14; // Define PI as a constant
scanf("%f", &radius); // Read the radius
area = PI * radius * radius; // Calculate the area
printf("%.2f\n", area); // Print the area with two decimal places and a newline
retur... | 6 |
Polarthebear/alx-low_level_programming | 3fb6e9f | 0x17-doubly_linked_lists/1-dlistint_len.c | C | www.github.com/Polarthebear/alx-low_level_programming/tree/main/0x17-doubly_linked_lists/1-dlistint_len.c | https://raw.githubusercontent.com/Polarthebear/alx-low_level_programming/3fb6e9f/0x17-doubly_linked_lists/1-dlistint_len.c | Polarthebear/alx-low_level_programming 3fb6e9f 0x17-doubly_linked_lists/1-dlistint_len.c | true | 200 | 355 | #include "lists.h"
/**
* dlistint_len - Main entry point
* Description: Return number of
* elements in a linked list
* @h: head
* Return: number of nodes
*/
size_t dlistint_len(const dlistint_t *h)
{
int n = 0;
if (h == NULL)
return (n);
while (h->prev != NULL)
h = h->prev;
while (h != NULL)
{
n++;... | 5 |
themrsgod/alx-low_level_programming | a442131 | 0x01-variables_if_else_while/4-print_alphabt.c | C | www.github.com/themrsgod/alx-low_level_programming/tree/main/0x01-variables_if_else_while/4-print_alphabt.c | https://raw.githubusercontent.com/themrsgod/alx-low_level_programming/a442131/0x01-variables_if_else_while/4-print_alphabt.c | themrsgod/alx-low_level_programming a442131 0x01-variables_if_else_while/4-print_alphabt.c | true | 200 | 238 | #include <stdio.h>
/**
*main - prints in lowercase, followed by a new line
*Return: 0
*/
int main(void)
{
char y = 'a';
while (y <= 'z')
{
if (y != 'q' && y != 'e')
{
putchar(y);
}
y++;
}
putchar('\n');
return (0);
}
| 4 |
TychiqueKadi2/alx-low_level_programming | adc6fc8 | 0x13-more_singly_linked_lists/102-free_listint_safe.c | C | www.github.com/TychiqueKadi2/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/102-free_listint_safe.c | https://raw.githubusercontent.com/TychiqueKadi2/alx-low_level_programming/adc6fc8/0x13-more_singly_linked_lists/102-free_listint_safe.c | TychiqueKadi2/alx-low_level_programming adc6fc8 0x13-more_singly_linked_lists/102-free_listint_safe.c | true | 200 | 519 | #include "lists.h"
/**
* free_listint_safe - frees linked list
* @h: pointer to the first node in linked list
*
* Return: n of elements in the freed list
*/
size_t free_listint_safe(listint_t **h)
{
size_t length = 0;
int excess;
listint_t *temp;
if (!h || !*h)
return (0);
while (*h)
{
excess = *h - (... | 3 |
nonQualities/dump | 9b089f0 | SD Lab/AverageOfThreeNumbers.c | C | www.github.com/nonQualities/dump/tree/main/SD Lab/AverageOfThreeNumbers.c | https://raw.githubusercontent.com/nonQualities/dump/9b089f0/SD%20Lab/AverageOfThreeNumbers.c | nonQualities/dump 9b089f0 SD Lab/AverageOfThreeNumbers.c | true | 200 | 283 | #include <stdio.h>
int main(){
float x,y,z,avg;
printf("Enter the three number, avg of which are needed: ");
scanf("%f %f %f", &x, &y, &z);
avg = (float)((x+y+z)/3);
printf("The required avg of the three numbers entered is: %0.3f", avg);
return 0;
} | 7 |
Okoromercyeberechukwu/alx-low_level_programming | a952181 | 0x13-more_singly_linked_lists/9-insert_nodeint.c | C | www.github.com/Okoromercyeberechukwu/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/9-insert_nodeint.c | https://raw.githubusercontent.com/Okoromercyeberechukwu/alx-low_level_programming/a952181/0x13-more_singly_linked_lists/9-insert_nodeint.c | Okoromercyeberechukwu/alx-low_level_programming a952181 0x13-more_singly_linked_lists/9-insert_nodeint.c | true | 200 | 750 | #include "lists.h"
/**
* insert_nodeint_at_index - inserts a new node in a linked list,
*
* at a given position
*
* @head: pointer to the first node in the list
*
* @idx: index where the new node is added
*
* @n: data to insert in the new node
*
* Return: pointer to the new node, or NULL
*/
listint_t *insert_nodeint_... | 2 |
NikunjTrueline/C_PROGRAMMING | 4b89cc7 | simple_compound_inters.c | C | www.github.com/NikunjTrueline/C_PROGRAMMING/tree/main/simple_compound_inters.c | https://raw.githubusercontent.com/NikunjTrueline/C_PROGRAMMING/4b89cc7/simple_compound_inters.c | NikunjTrueline/C_PROGRAMMING 4b89cc7 simple_compound_inters.c | true | 200 | 841 | #include <stdio.h>
#include <math.h>
int main()
{
float principle, rate, time, simple_interest, compound_interest;
int n;
printf("Enter principle amount: ");
scanf("%f", &principle);
printf("Enter rate of interest: ");
scanf("%f", &rate);
printf("Enter time in years: ");
... | 6 |
renanjustino/Linguagem-C | f08d132 | Lab04 - Loops/ex10/ex10.c | C | www.github.com/renanjustino/Linguagem-C/tree/main/Lab04 - Loops/ex10/ex10.c | https://raw.githubusercontent.com/renanjustino/Linguagem-C/f08d132/Lab04%20-%20Loops/ex10/ex10.c | renanjustino/Linguagem-C f08d132 Lab04 - Loops/ex10/ex10.c | true | 200 | 403 | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
int main()
{
int x, n, s;
s = 0;
printf("<<Soma de n valores naturais>>\n");
printf("Quantos numeros deseja somar?: ");
scanf("%d", &n);
x=n;
while(n>=0)
{
s=s+n;
n--;
}
printf("\nA so... | 0 |
Cquintana001/Shared | b1528ff | src/expansor.c | C | www.github.com/Cquintana001/Shared/tree/main/src/expansor.c | https://raw.githubusercontent.com/Cquintana001/Shared/b1528ff/src/expansor.c | Cquintana001/Shared b1528ff src/expansor.c | true | 200 | 2,600 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* expansor.c :+: :+: :+: ... | 3 |
abrarhasan3/Compiler-Project-for-3-2 | de6a7c2 | a.tab.h | C | www.github.com/abrarhasan3/Compiler-Project-for-3-2/tree/main/a.tab.h | https://raw.githubusercontent.com/abrarhasan3/Compiler-Project-for-3-2/de6a7c2/a.tab.h | abrarhasan3/Compiler-Project-for-3-2 de6a7c2 a.tab.h | true | 200 | 3,058 |
/* A Bison parser, made by GNU Bison 2.4.1. */
/* Skeleton interface for Bison's Yacc-like parsers in C
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006
Free Software Foundation, Inc.
This program is free software: you can redistribute it and/or modify
it under the term... | 4 |
berylmewisen/alx-low_level_programming | 77827e7 | 0x14-bit_manipulation/3-set_bit.c | C | www.github.com/berylmewisen/alx-low_level_programming/tree/main/0x14-bit_manipulation/3-set_bit.c | https://raw.githubusercontent.com/berylmewisen/alx-low_level_programming/77827e7/0x14-bit_manipulation/3-set_bit.c | berylmewisen/alx-low_level_programming 77827e7 0x14-bit_manipulation/3-set_bit.c | true | 200 | 387 | #include "main.h"
/**
* set_bit - Sets bit value at a given index to 1
* @n: A pointer to the bit.
* @index: The index to set the value at - indices start at 0.
*
* Return: If an error occurs - -1.
* otherwise - 1.
*/
int set_bit(unsigned long int *n, unsigned int index)
{
if (index >= (sizeof(unsigned lo... | 7 |
jesuslovesyoutoday/mpi-openmp | 13f4780 | life2d_columns.c | C | www.github.com/jesuslovesyoutoday/mpi-openmp/tree/main/life2d_columns.c | https://raw.githubusercontent.com/jesuslovesyoutoday/mpi-openmp/13f4780/life2d_columns.c | jesuslovesyoutoday/mpi-openmp 13f4780 life2d_columns.c | true | 200 | 5,637 | /*
* Author: Nikolay Khokhlov <k_h@inbox.ru>, 2016
*/
#include <stdio.h>
#include <assert.h>
#include <stdlib.h>
#include <mpi.h>
#define ind(i, j) (((i + l->nx) % l->nx) + ((j + l->ny) % l->ny) * (l->nx))
typedef struct {
int nx, ny;
int *u0;
int *u1;
int steps;
int save_steps;
MPI_Datatype column;
} lif... | 2 |
ArcobalenoX/LINUX | 694069f | video/main.c | C | www.github.com/ArcobalenoX/LINUX/tree/main/video/main.c | https://raw.githubusercontent.com/ArcobalenoX/LINUX/694069f/video/main.c | ArcobalenoX/LINUX 694069f video/main.c | true | 200 | 780 |
/********std header**********/
#define _PG_std
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <strings.h>
#include <math.h>
#include <linux/mman.h>
#include <sys/mman.h>
#include <errno.h>
#include <stdarg.h>
int main(int argc,char **argv)
{
system("./camera.out 50001 192.168.11.111 50000 ... | 5 |
actonlang/acton | 0905c98 | base/builtin/complx.h | C | www.github.com/actonlang/acton/tree/main/base/builtin/complx.h | https://raw.githubusercontent.com/actonlang/acton/0905c98/base/builtin/complx.h | actonlang/acton 0905c98 base/builtin/complx.h | true | 200 | 364 | /*
* This file is deliberately named complx.h to avoid collisions under gcc or
* clang. Details are murky, is it with the standard complex.h? (Path should be
* different, no?) Björn should know the details..
*/
#include <complex.h>
struct B_complex {
struct B_complexG_class *$class;
complex double val;
};
... | 0 |
RedarsHubi/alx-low_level_programming | b8f8495 | 0x0A-argc_argv/1-args.c | C | www.github.com/RedarsHubi/alx-low_level_programming/tree/main/0x0A-argc_argv/1-args.c | https://raw.githubusercontent.com/RedarsHubi/alx-low_level_programming/b8f8495/0x0A-argc_argv/1-args.c | RedarsHubi/alx-low_level_programming b8f8495 0x0A-argc_argv/1-args.c | true | 200 | 267 | #include <stdio.h>
#include "main.h"
/**
* main - main function
* @argc: integer that that counts args.
* @argv: pointer to argument strings
* Return: no return
**/
int main(int argc, char *argv[])
{
printf("%d\n", argc - 1);
(void)argv;
return (0);
}
| 6 |
ntatrishvili/C-problem-solving | 95744b2 | 9_DynamicStrings/Copy.c | C | www.github.com/ntatrishvili/C-problem-solving/tree/main/9_DynamicStrings/Copy.c | https://raw.githubusercontent.com/ntatrishvili/C-problem-solving/95744b2/9_DynamicStrings/Copy.c | ntatrishvili/C-problem-solving 95744b2 9_DynamicStrings/Copy.c | true | 200 | 401 | #include<stdio.h>
#include<string.h>
char* copystring(char str[]){
char *ans=(char*)(malloc((strlen(str) +1) * sizeof(char)));
int i=0;
while(str[i] != '\0'){
ans[i]=str[i];
i++;
}
ans[i] = '\0';
return ans;
}
int main(){
char *str;
char original[]="cool?\n";
st... | 3 |
gglin001/mesa | b0c4787 | src/intel/compiler/brw_eu_validate.c | C | www.github.com/gglin001/mesa/tree/main/src/intel/compiler/brw_eu_validate.c | https://raw.githubusercontent.com/gglin001/mesa/b0c4787/src/intel/compiler/brw_eu_validate.c | gglin001/mesa b0c4787 src/intel/compiler/brw_eu_validate.c | true | 200 | 106,222 | /*
* Copyright © 2015-2019 Intel Corporation
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge... | 4 |
EBI-Metagenomics/h3c | 984ca9d | src/hit.h | C | www.github.com/EBI-Metagenomics/h3c/tree/main/src/hit.h | https://raw.githubusercontent.com/EBI-Metagenomics/h3c/984ca9d/src/hit.h | EBI-Metagenomics/h3c 984ca9d src/hit.h | true | 200 | 849 | #ifndef HIT_H
#define HIT_H
#include "compiler.h"
#include <stdint.h>
struct lip_file;
struct domain;
struct hit
{
char *name;
char *acc;
char *desc;
double sortkey;
float score;
float pre_score;
float sum_score;
double lnP;
double pre_lnP;
double sum_lnP;
float nexpect... | 2 |
codewithS1/C_codes | 6f442a4 | Assignment/u6_factorial.c | C | www.github.com/codewithS1/C_codes/tree/main/Assignment/u6_factorial.c | https://raw.githubusercontent.com/codewithS1/C_codes/6f442a4/Assignment/u6_factorial.c | codewithS1/C_codes 6f442a4 Assignment/u6_factorial.c | true | 200 | 242 | #include<stdio.h>
int main(){
float a=1,num,fac=1;
printf("Enter a number\n");
scanf("%f",&num);
for(a;a<=num;a++){
printf("Value is %f\n",a);
fac=fac*a;
}
printf("Factorial is %f",fac);
return 0;
} | 5 |
lkx-dw/happy-li | 8cd8455 | .c-test/first-week/2.c | C | www.github.com/lkx-dw/happy-li/tree/main/.c-test/first-week/2.c | https://raw.githubusercontent.com/lkx-dw/happy-li/8cd8455/.c-test/first-week/2.c | lkx-dw/happy-li 8cd8455 .c-test/first-week/2.c | true | 200 | 352 | // 编写一个程序，运行时输入a，b，c三个值，输出其中值最大者。
#include <stdio.h>
int main()
{
int a, b, c, max;
printf("请输入三个整数:\n");
scanf("%d,%d,%d", &a, &b, &c);
max = a;
if (b > max)
max = b;
if (c > max)
max = c;
printf("最大值是: %d\n", max);
return 0;
} | 1 |
Abraham1729/RandomWalker | cacc6b4 | v3_threaded/src/thread_test.c | C | www.github.com/Abraham1729/RandomWalker/tree/main/v3_threaded/src/thread_test.c | https://raw.githubusercontent.com/Abraham1729/RandomWalker/cacc6b4/v3_threaded/src/thread_test.c | Abraham1729/RandomWalker cacc6b4 v3_threaded/src/thread_test.c | true | 200 | 1,874 | #include <stdio.h>
#include <stdlib.h>
#include <pthread.h>
// int NUM_THREADS = 10;
#define NUM_THREADS 10
// You'll need a custom object to pass thread arguments (single values *or* pointers)
typedef struct {
int id;
int* result_array;
} thread_arg_t;
static void* thread_main(void* p_arg) {
// cast voi... | 6 |
gonzalolopez01/tp_laboratorio_1 | a5593fe | tp_3/Passenger.c | C | www.github.com/gonzalolopez01/tp_laboratorio_1/tree/main/tp_3/Passenger.c | https://raw.githubusercontent.com/gonzalolopez01/tp_laboratorio_1/a5593fe/tp_3/Passenger.c | gonzalolopez01/tp_laboratorio_1 a5593fe tp_3/Passenger.c | true | 200 | 12,191 | /*
* Passenger.c
*
* Created on: 19 may. 2022
* Author: Maru
*/
#include "Passenger.h"
/**reserve space in the dynamic memory for a passanger type struct
*
* @return pointer to the reserved space
* Null: failed to reserve space
*/
sPassenger* Passenger_new(){
sPassenger* newPassenger = NULL;
ret... | 3 |
circlesharp/algorithm-learning | 16f02f0 | cLangAgain/part06_string/test06_strcmp.c | C | www.github.com/circlesharp/algorithm-learning/tree/main/cLangAgain/part06_string/test06_strcmp.c | https://raw.githubusercontent.com/circlesharp/algorithm-learning/16f02f0/cLangAgain/part06_string/test06_strcmp.c | circlesharp/algorithm-learning 16f02f0 cLangAgain/part06_string/test06_strcmp.c | true | 200 | 655 | #include <stdio.h>
#include <string.h>
void useStrcmp()
{
char s1[] = "abc";
char s2[] = "abc";
printf("%d\n", strcmp(s1, s2));
}
int myStrCmp(const char* s1, const char* s2)
{
int idx = 0;
while (s1[idx] == s2[idx] && s1[idx] != '\0')
idx++;
return s1[idx] - s2[idx];
}
int myStrC... | 0 |
csyyyyyyyyyyyyyyyyyyyyyy/Simple-FTP-CIient-and-Server-Based-on-C | 09535ab | myftpd.c | C | www.github.com/csyyyyyyyyyyyyyyyyyyyyyy/Simple-FTP-CIient-and-Server-Based-on-C/tree/main/myftpd.c | https://raw.githubusercontent.com/csyyyyyyyyyyyyyyyyyyyyyy/Simple-FTP-CIient-and-Server-Based-on-C/09535ab/myftpd.c | csyyyyyyyyyyyyyyyyyyyyyy/Simple-FTP-CIient-and-Server-Based-on-C 09535ab myftpd.c | true | 200 | 9,247 | #include "server.h"
#include <sqlite3.h>
#include <openssl/sha.h>
//int authenticate(const char *username, const char *password);
int authenticate_or_register(const char *username, const char *password, int is_register);
int add_user(const char *username, const char *password);
int user_exists(const char *username);
v... | 7 |
QuentinMonthe/alx-low_level_programming | 07f6170 | 0x06-pointers_arrays_strings/5-string_toupper.c | C | www.github.com/QuentinMonthe/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/5-string_toupper.c | https://raw.githubusercontent.com/QuentinMonthe/alx-low_level_programming/07f6170/0x06-pointers_arrays_strings/5-string_toupper.c | QuentinMonthe/alx-low_level_programming 07f6170 0x06-pointers_arrays_strings/5-string_toupper.c | true | 200 | 394 | #include "main.h"
#include <unistd.h>
#include <stdlib.h>
/**
* string_toupper - This function changes all lowercase letters
* of a string to uppercas
* @str: string to change case
*
* Return: String in uppercase
*/
char *string_toupper(char *str)
{
int i = 0;
while (str[i] != '\0')
{
if (str[i] > 96 && s... | 3 |
kottess/Vector_C | a135934 | C_Project/assignment/assn2/a5.c | C | www.github.com/kottess/Vector_C/tree/main/C_Project/assignment/assn2/a5.c | https://raw.githubusercontent.com/kottess/Vector_C/a135934/C_Project/assignment/assn2/a5.c | kottess/Vector_C a135934 C_Project/assignment/assn2/a5.c | true | 200 | 300 | #include<stdio.h>
int main()
{
char ch,a[30];
int i,j;
printf("Enter the string\n");
scanf("%[^\n]",a);
printf("Enter the character to remove\n");
scanf(" %c",&ch);
for(i=0;a[i];i++)
{
if(a[i]==ch)
{
j=i;
while(a[j])
{
a[j]=a[j+1];
j++;
}
a[j]='\0';
i--;
}
}
printf("%s\n",a);
}
| 6 |
iam-afk/leet-code | 8e6b2f1 | 1356.sort-integers-by-the-number-of-1-bits.c | C | www.github.com/iam-afk/leet-code/tree/main/1356.sort-integers-by-the-number-of-1-bits.c | https://raw.githubusercontent.com/iam-afk/leet-code/8e6b2f1/1356.sort-integers-by-the-number-of-1-bits.c | iam-afk/leet-code 8e6b2f1 1356.sort-integers-by-the-number-of-1-bits.c | true | 200 | 520 | int
compareInts(void const* a, void const* b)
{
return *(int*)a - *(int*)b;
}
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
int*
sortByBits(int* arr, int arrSize, int* returnSize)
{
for (int i = 0; i < arrSize; ++i) {
int c = 0, n = arr[i];
while (n > 0) {
++c;
... | 5 |
912267428/Petal_clock | 6576a12 | User/main.c | C | www.github.com/912267428/Petal_clock/tree/main/User/main.c | https://raw.githubusercontent.com/912267428/Petal_clock/6576a12/User/main.c | 912267428/Petal_clock 6576a12 User/main.c | true | 200 | 7,397 | #include "system.h"
#include "SysTick.h"
#include "usart.h"
#include "FreeRTOS.h"
#include "semphr.h"
#include "task.h"
#include "OLED.h"
#include "YCKey.h"
#include "MyRTC.h"
#define GET_BIT(x, bit) ((x & (1 << bit)) >> bit) /* ��ȡ��bitλ */
#define CAL_ANGLE ((MyRTC_Time[3]%12)*30+(MyRTC_Time[5]*0.5))
//�������ȼ�... | 0 |
msqc-goethe/gaspi-benchmark-suite | 56dbab2 | micro-benchmarks/util/util_memory.c | C | www.github.com/msqc-goethe/gaspi-benchmark-suite/tree/main/micro-benchmarks/util/util_memory.c | https://raw.githubusercontent.com/msqc-goethe/gaspi-benchmark-suite/56dbab2/micro-benchmarks/util/util_memory.c | msqc-goethe/gaspi-benchmark-suite 56dbab2 micro-benchmarks/util/util_memory.c | true | 200 | 1,190 | #include "util_memory.h"
#include "check.h"
void allocate_gaspi_memory(const gaspi_segment_id_t id,
const size_t size,
const char c) {
GASPI_CHECK(gaspi_segment_create(
id, size, GASPI_GROUP_ALL, GASPI_BLOCK, GASPI_MEM_UNINITIALIZED));
void* ptr;
GASPI_CHEC... | 1 |
Nicole2512/alx-low_level_programming | 75f5878 | 0x10-variadic_functions/2-print_strings.c | C | www.github.com/Nicole2512/alx-low_level_programming/tree/main/0x10-variadic_functions/2-print_strings.c | https://raw.githubusercontent.com/Nicole2512/alx-low_level_programming/75f5878/0x10-variadic_functions/2-print_strings.c | Nicole2512/alx-low_level_programming 75f5878 0x10-variadic_functions/2-print_strings.c | true | 200 | 669 | #include "variadic_functions.h"
#include <stdio.h>
#include <stdarg.h>
/**
* print_strings - prints string followed by a new line
* @separator: string to be printed between strings
* @n: number of strings passed
* @...: variable number of strings to be printed
*/
void print_strings(const char *separator, const uns... | 4 |
Edmund15/alx-low_level_programming | d83272c | 0x0F-function_pointers/0-print_name.c | C | www.github.com/Edmund15/alx-low_level_programming/tree/main/0x0F-function_pointers/0-print_name.c | https://raw.githubusercontent.com/Edmund15/alx-low_level_programming/d83272c/0x0F-function_pointers/0-print_name.c | Edmund15/alx-low_level_programming d83272c 0x0F-function_pointers/0-print_name.c | true | 200 | 267 | #include "function_pointers.h"
/**
* print_name - prints a name using a given printing function
* @name: name to print
* @f: pointer to the printing function
*/
void print_name(char *name, void (*f)(char *))
{
if (name != NULL && f != NULL)
{
f(name);
}
}
| 7 |
omAbhi/problems | b1c7316 | lb-assign18/5.c | C | www.github.com/omAbhi/problems/tree/main/lb-assign18/5.c | https://raw.githubusercontent.com/omAbhi/problems/b1c7316/lb-assign18/5.c | omAbhi/problems b1c7316 lb-assign18/5.c | true | 200 | 718 | /* input irow:4 icol:4
output 1 2 3 4 5
1 2 5
1 3 5
1 4 5
1 2 3 4 5
*/
# include<stdio.h>
void Pattern(int iRow, int iCol)
{
int i=0,j=0;
for(i=1;i<=(iRow+1);i++)
{
for(j=1;j<=(iCol+1);j++)
{
if(j==1 || j==(iCol+1) |... | 6 |
DarkJyn/Code_C_PTIT | 61bb444 | C03004.c | C | www.github.com/DarkJyn/Code_C_PTIT/tree/main/C03004.c | https://raw.githubusercontent.com/DarkJyn/Code_C_PTIT/61bb444/C03004.c | DarkJyn/Code_C_PTIT 61bb444 C03004.c | true | 200 | 309 | #include <stdio.h>
#include <math.h>
int ucln(int a,int b){
while(b!= 0){
int tmp = a % b;
a = b;
b = tmp;
}
return a;
}
int main() {
int a,b;
scanf("%d%d",&a,&b);
long long bcnn = 1ll*(a / ucln(a,b))*b;
printf("%d\n%lld",ucln(a,b),bcnn);
return 0;
} | 0 |
minhduc5a15/utc_code | c19d7c0 | C/thuthach.c | C | www.github.com/minhduc5a15/utc_code/tree/main/C/thuthach.c | https://raw.githubusercontent.com/minhduc5a15/utc_code/c19d7c0/C/thuthach.c | minhduc5a15/utc_code c19d7c0 C/thuthach.c | true | 200 | 903 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
typedef long long ll;
bool check(ll mid, const ll *arr, int n, int k) {
int count = 0;
ll sum = 0;
for (int i = 0; i < n; ++i) {
if (arr[i] > mid) return false;
sum += arr[i];
if (sum > mid) {
sum = arr[i];
... | 4 |
Kavin-Charles/SNS-1st-Year-PPS-Practicals | eb5c828 | Matrix Multiplication.c | C | www.github.com/Kavin-Charles/SNS-1st-Year-PPS-Practicals/tree/main/Matrix Multiplication.c | https://raw.githubusercontent.com/Kavin-Charles/SNS-1st-Year-PPS-Practicals/eb5c828/Matrix%20Multiplication.c | Kavin-Charles/SNS-1st-Year-PPS-Practicals eb5c828 Matrix Multiplication.c | true | 200 | 1,050 | #include <stdio.h>
#include <conio.h>
int main(void)
{
int c, d, p, q, m, n, k, tot = 0;
int fst[10][10], sec[10][10], mul[10][10];
printf(" Please insert the number of rows and columns for first matrix \n ");
scanf("%d%d", &m, &n);
printf(" Insert your matrix elements : \n ");
for (c = 0; c < m; c++)
... | 2 |
Herrfalco/woody-woodpacker | 0138055 | includes.h | C | www.github.com/Herrfalco/woody-woodpacker/tree/main/includes.h | https://raw.githubusercontent.com/Herrfalco/woody-woodpacker/0138055/includes.h | Herrfalco/woody-woodpacker 0138055 includes.h | true | 200 | 2,169 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* includes.h :+: :+: :+: ... | 1 |
Ngochanako/MD04-C | d65af99 | bai tap 3.c | C | www.github.com/Ngochanako/MD04-C/tree/main/bai tap 3.c | https://raw.githubusercontent.com/Ngochanako/MD04-C/d65af99/bai%20tap%203.c | Ngochanako/MD04-C d65af99 bai tap 3.c | true | 200 | 387 | #include<stdio.h>
int main()
{
int input,output,price,money;
scanf("%d %d",&input,&output);
int num=output-input;
if(num<50){
price=10000;
}
else if (num<100){
price=15000;
}
else if(num<150){
price=20000;
}
else if(num<200){
price=25000;
}
else {
price=30000;
}
money=nu... | 7 |
kpatsakis/linevul | 12b2e3c | 454.c | C | www.github.com/kpatsakis/linevul/tree/main/454.c | https://raw.githubusercontent.com/kpatsakis/linevul/12b2e3c/454.c | kpatsakis/linevul 12b2e3c 454.c | true | 200 | 670 | alloc_value_block(void (*alloc_func) (vector_t *), const char *block_type)
{
char *buf;
char *str = NULL;
vector_t *vec = NULL;
bool first_line = true;
buf = (char *) MALLOC(MAXBUF);
while (read_line(buf, MAXBUF)) {
if (!(vec = alloc_strvec(buf)))
continue;
if (first_line) {
first_line = false;
if... | 3 |
ayaahmedsamir/Bootloader_Project | 4e1ba59 | Bootloader V3/include/MCAL/Flash/FLASH_Private.h | C | www.github.com/ayaahmedsamir/Bootloader_Project/tree/main/Bootloader V3/include/MCAL/Flash/FLASH_Private.h | https://raw.githubusercontent.com/ayaahmedsamir/Bootloader_Project/4e1ba59/Bootloader%20V3/include/MCAL/Flash/FLASH_Private.h | ayaahmedsamir/Bootloader_Project 4e1ba59 Bootloader V3/include/MCAL/Flash/FLASH_Private.h | true | 200 | 1,541 | /*************************************************************************************************************************************************************
*
* File Name: Flash_Private.h
*
* Description: Private header file for the Flash memory.
*
* Author: Abdulrahman El-Neshwy, Abdulrahman Khalaf, Aya Samir... | 5 |
ebininoroniex/alx-low_level_programming | dacf237 | 0x12-singly_linked_lists/1-list_len.c | C | www.github.com/ebininoroniex/alx-low_level_programming/tree/main/0x12-singly_linked_lists/1-list_len.c | https://raw.githubusercontent.com/ebininoroniex/alx-low_level_programming/dacf237/0x12-singly_linked_lists/1-list_len.c | ebininoroniex/alx-low_level_programming dacf237 0x12-singly_linked_lists/1-list_len.c | true | 200 | 298 | #include "lists.h"
#include <stdio.h>
/**
* list_len- function that returns the No: of elements in a list
*@h: head of linked list
*Return: number of nodes as size_t
*/
size_t list_len(const list_t *h)
{
size_t count = 0;
while (h != NULL)
{
count++;
h = h->next;
}
return (count);
}
| 6 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.