blob_id large_stringlengths 40 40 | language large_stringclasses 1
value | repo_name large_stringlengths 4 124 | path large_stringlengths 2 969 | src_encoding large_stringclasses 35
values | length_bytes int64 6 2.95M | score float64 2.52 5.44 | int_score int64 3 5 | detected_licenses large listlengths 0 58 | license_type large_stringclasses 2
values | text stringlengths 9 2.95M | download_success bool 1
class |
|---|---|---|---|---|---|---|---|---|---|---|---|
84ccfbf0bdfe8f3ad7e45fd58ea8a18bcc6c46c3 | C | arg-min-x/2048mcdt | /c/lib2048.c | UTF-8 | 14,413 | 3.09375 | 3 | [] | no_license | //
// lib2048.c
// 2048-AI
//
// Created by Adam Rich on 4/11/16.
// Copyright © 2016 Adam Rich. All rights reserved.
//
#include "lib2048.h"
#include <stdlib.h>
#include <time.h>
#include <math.h>
#include <omp.h>
#include <stdio.h>
#include <stdint.h>
#include <string.h>
#include <unistd.h>
// ================... | true |
6ce093d7d6fb7706d6058273760bc915ca28c3a8 | C | Cfearghost/shiny-pset2 | /m.c | UTF-8 | 3,763 | 3.140625 | 3 | [] | no_license | #include <stdio.h>
#include <time.h>
#include <stdlib.h>
#include "m.h"
#define CROSS_OVER 1
matrix newmatrix(int n) {
matrix a;
a = (matrix)malloc(sizeof(*a));
if (n <= CROSS_OVER) {
int i;
a->d = (double **)calloc(n, sizeof(double *));
for (i = 0; i < n; i++) {
a->d[i] = ... | true |
4cb3fe06beb0ca705a0ca73ff9a98b4cf8eaf49d | C | ToverPomelo/Fast_C_Learning | /solve_19/fib/3.c | UTF-8 | 381 | 3.421875 | 3 | [] | no_license | #include <stdio.h>
int buffer[100] = {1,1};
int count = 1;
// start with 0 ...
unsigned int fib(unsigned int n){
if(n>count){
for(int i=count+1;i<=n;i++){
buffer[i] = buffer[i-1]+buffer[i-2];
}
count = n;
}
return buffer[n];
}
int main(){
for(int i=0;i<10;i++)
... | true |
4e694ae9fd4ea54fa1a733ffa9a5ff4e409a2be5 | C | Gege7177/Dot2dot | /Dot-1.0.p4/fileManager.c | UTF-8 | 6,828 | 2.671875 | 3 | [] | no_license | #include "fileManager.h"
void __filemanager_read_id (char *filename, char *id_buff) {
int i, j, fn_len, start_pos, end_pos;
fn_len = strlen (filename);
start_pos = 0;
/* Skip the possiblw path in the filename */
for (i = 0; i < fn_len; i ++) {
if (filename[i] == '/' || filename[i] == '\'') { /* Both ... | true |
f0137c4b086fe3ade83f93ec794e9bc18cdba56a | C | nilium/snow-palm | /src/threads/thread.h | UTF-8 | 1,669 | 2.890625 | 3 | [
"Zlib",
"MIT"
] | permissive | /*
Threading routines
Written by Noel Cower
See LICENSE.md for license information
*/
#ifndef __SNOW__THREAD_H__
#define __SNOW__THREAD_H__
#include <snow-config.h>
#ifdef __SNOW__THREAD_C__
#define S_INLINE
#else
#define S_INLINE inline
#endif
#if defined(__cplusplus)
extern "C"
{
#endif /* __cplusplus */
... | true |
a0a7fe11ac34a7403f8268ad2c34e24efbc90eaa | C | enesbilik/C-Programming-Examples | /Number Triangle.c | UTF-8 | 436 | 3.265625 | 3 | [] | no_license | /*
n = 4 için şekildeki gibi çıktı veren kod
1
2 3
4 5 6
7 8 9 10
*/
#include <stdio.h>
int main() {
int i,j,n;
int sayi = 1;
printf("satir sayisi giriniz: ");
scanf("%d",&n);
int b = n-1;
for (i=1; i<=n; i++) {
for (j=0; j<b; j++)
printf... | true |
a3d5c39380ae4b56bb8ef70c8eeb2b5660dae1dc | C | vksahu399/C-programming | /1.b.c | UTF-8 | 162 | 3.5 | 4 | [] | no_license | #include<stdio.h>
void main ()
{
int a;
float b,c;
printf("enter the values of a&b");
scanf("%d%f",&a,&b);
c=a+b;
printf("addition is %f",c);
}
| true |
33ba87232ae5ae3551ea9e16003aecde3153f6c5 | C | abinaya-it19/python | /sum.c | UTF-8 | 157 | 3.1875 | 3 | [] | no_license | #include<stdio.h>
int main()
{
int a,b,c,d,e,sum;
printf("enter a number");
scanf("%d%d%d%d%d",&a&b&c&d&e);
{
sum=a+b+c+d+e;
}
printf("%d",sum);
return 0;
}
| true |
47b2d87d69f72d7c7622f0eb5d8328c537f81f7e | C | ericdjavid/printf | /ft_treat_string.c | UTF-8 | 1,430 | 2.8125 | 3 | [] | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_treat_string.c :+: :+: :+: ... | true |
af1ee2c332860426b495af627a355eccc1cc68f8 | C | Rj777pain/SSLAB | /E11/bin.c | UTF-8 | 236 | 2.6875 | 3 | [] | no_license | #include<stdio.h>
#include<string.h>
void main(){
char c1[5]="abc",c2;
int a,val=0,i;
for ( i = 0; c1[i]!='\0'; i++)
{
val=val*128;
a=(int)c1[i];
val+=a;
}
printf("%d",val);
} | true |
f0339020ffee69a78a8cc6ac142b13e240ff9a2f | C | swand0g/uvm-operating-systems | /Assignment1/Program Files/warmup.aswanso2.c | UTF-8 | 933 | 3.421875 | 3 | [] | no_license | //
// Created by Alexander Swanson on 2019-01-23.
// alexanderjswanson@icloud.com
//
#include <stdio.h>
#include <stdlib.h>
#include <memory.h>
#include "warmup.aswanso2.h"
// Calculates the sum from "sum" to "n".
int calculateSum(int n, int *sum) {
if (n >= 0) {
// Calculate the sum
*sum = (n ... | true |
9721fb05103a4ebcc8c15aadae62fece783f6552 | C | RichardBaczur00/cserver | /command_utils.c | UTF-8 | 3,848 | 3.03125 | 3 | [] | no_license | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <sys/types.h>
#include <sys/socket.h>
#include "command_utils.h"
#include "requests/get.h"
void log_request(command request) {
printf("Request received: \nMethod: \t %d\nURL: \t %s\nData type: \t %d\nData: \t %s\n",
requ... | true |
1da59b5248ddd058e54c6f7fee5056e7ddf77a2b | C | jicruz96/holbertonschool-low_level_programming | /0x1A-hash_tables/4-hash_table_get.c | UTF-8 | 569 | 3.546875 | 4 | [] | no_license | #include "hash_tables.h"
/**
* hash_table_get - gets the value associated with a key in a hash table
* @ht: pointer to hash table
* @key: key, string
* Return: description
**/
char *hash_table_get(const hash_table_t *ht, const char *key)
{
unsigned long int i;
hash_node_t *node;
if (ht == NULL || strlen(key) ... | true |
fa36cd712f8d9012be4f091c979dbbf4f8135cbe | C | Hasibull/CSE_Lab | /Data Structure and Algorithm/Basic using CPP and C/link_list_using_array.c | UTF-8 | 474 | 3.078125 | 3 | [] | no_license | #include<stdio.h>
int main()
{
int link[100],data[100],head=0,size=1,i=0;
memset(data,0,sizeof(data));
printf("Enter the link of head node\n");
scanf("%d",&head);
link[0]=head;
while(scanf("%d",&data[link[i]])!=EOF){
printf("Enter the link of the next element\n");
i++;
... | true |
3aad55c0ff83913306bf29a9a5b1dff358eb49bd | C | QasimAbbas/RU-CS214-Malloc | /mymalloc.h | UTF-8 | 152 | 2.5625 | 3 | [] | no_license | //node struct
typedef struct Node{
int size;
int addr;
Node* nxt;
}Node;
typedef struct LinkedList{
Node *head;
}LinkedList;
| true |
2126f2c9ee05ff299b1960970b58166c5d8ecc87 | C | blastrock/libkc | /include/math.h | UTF-8 | 7,074 | 2.875 | 3 | [
"BSD-2-Clause-Views"
] | permissive | #ifndef MATH_H
#define MATH_H
#ifdef __cplusplus
extern "C" {
#endif
typedef float float_t;
typedef double double_t;
// C90
int abs(int x);
double acos (double x);
float acosf(float x);
long double acosl(long double x);
double asin (double x);
float asinf(float x);
... | true |
9f27d6fffece5a7bd8368bd137ff6c5cff49200f | C | AteCastillo/sorting_algorithms | /100-shell_sort.c | UTF-8 | 618 | 4.125 | 4 | [] | no_license | #include "sort.h"
/**
*shell_sort - sorts an array of integers in ascending order
*using the Shell sort algorithm, using the Knuth sequence
*@array: the array
*@size: the size
*Return: Nothing
*/
void shell_sort(int *array, size_t size)
{
size_t h = 1, i, n;
int number;
if (array == NULL || size < 2)
return;
... | true |
d34ee5cadd290c890515323cb0557d1cda0bfd06 | C | xiaoxiaoh16/c-examples | /exp-6-52.c | UTF-8 | 11,989 | 3.265625 | 3 | [] | no_license | /*************************************************************************
> File Name: exp-6-52.c
> Author: xiaoxiaoh
> Mail: xiaoxxhao@gmail.com
> Created Time: Tue Aug 1 11:53:10 2017
************************************************************************/
/*
* Star pattern programs - Write a C... | true |
2e39670dfcacc341359541ed241cdb70ca2b2dc9 | C | tsvvetkov/ft_ls | /lib/libft/src/ft_numlen.c | UTF-8 | 1,553 | 3.296875 | 3 | [] | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_numlen.c :+: :+: :+: ... | true |
221757e31b8a94fa0145015bbcfe8f3db7f96b6f | C | Rishavjain232/lsmtree | /src/lsmtree.c | UTF-8 | 22,163 | 3.203125 | 3 | [] | no_license | #include "lsmtree.h"
/*
SECTION 1: functions for initializing, creating, loading, maintaining, and saving the LSM tree.
*/
lsmtree *new_lsmtree(void) {
/*
Initializes new LSM tree.
*/
lsmtree *tree = malloc(sizeof(lsmtree));
return tree;
}
int empty_lsmtree(lsmtree *tree, char *name) {
/*
Creates new empty ... | true |
6254e4bec87e20899ea3e9d2ba7fe417ff7bbf11 | C | arthurqchu/Systems_Class | /lab3.c | UTF-8 | 3,444 | 3.609375 | 4 | [] | no_license | // Arthur Chu
#include <unistd.h>
#include <stdlib.h>
#include <stdio.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/wait.h>
#include <fcntl.h>
#include <string.h>
void birth(int* x) {
int process = fork();
if(process < 0) {
//fork didn't fork
fprintf(stderr, "You forked up\n");
exit(1);
} else... | true |
8e8d112cbba6a3f75a077fa3a7023d91531806e8 | C | pluigi0/9-numero-de-cifras | /Cifras.c | UTF-8 | 485 | 3.59375 | 4 | [] | no_license | #include <stdio.h>
int calculo(int numero);
int main(){
int numero, cifras;
printf("Ingrese un numero: ");
scanf("%i",&numero);
cifras = calculo(numero);
printf("El numero introducido es: %i.\n",numero);
printf("El numero introducido %i tiene %i cifra(s).\n",numero,cifras);
system("pause");
return... | true |
ac1a44e65b58e889f685dd0c44f9e4d761edec1e | C | JParrales/holbertonschool-low_level_programming | /0x09-static_libraries/1-strncat.c | UTF-8 | 556 | 3.640625 | 4 | [] | no_license | #include "holberton.h"
/**
* _strlen - Length of a string
* @s: String
* Return: Length
*/
int _strlen(char *s)
{
int i;
for (i = 0; s[i] != '\0'; i++)
{
}
return (i);
}
/**
* _strncat - Concatenate two strings
* @dest: String stored
* @src: Source
* @n: Numbers of bytes
* Return: Return dest
*/
char... | true |
daac55ea5dfe773a706f5fcb8cf4f42176f8eb99 | C | akhahaha/socketCS | /client.c | UTF-8 | 1,951 | 3.4375 | 3 | [] | no_license | /*
A simple client in the internet domain using TCP
Usage: ./client hostname port (./client 192.168.0.151 10000)
*/
#include <stdio.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <netdb.h> // define structures like hostent
#include <stdlib.h>
#include <strings.h>
void error(cha... | true |
8554406a13b6d0ad832b97f6faee9af5bf63b187 | C | sudo-wang/jiepu | /2018_4_11_snake/src/data.c | UTF-8 | 780 | 2.71875 | 3 | [] | no_license | #include"data.h"
#include<stdlib.h>
#include<time.h>
int gameArea[20][30]={0};
int fruit_x,fruit_y;
Snake snake;
static int checkFruitCoordinate();
void initData()
{
srand(time(NULL));
int x,y;
for(x=0;x<20;x++)
{
for(y=0;y<30;y++)
{
if(x==0||x==19||y==0||y==29)
gameArea[x][y]=1;
else
gameArea[x][y]=0;
}... | true |
19db132ef11815c9908e1466b38ea683a717c6d8 | C | asokaDev/holbertonschool-low_level_programming | /0x04-more_functions_nested_loops/3-print_numbers.c | UTF-8 | 234 | 3.390625 | 3 | [] | no_license | #include "holberton.h"
/**
* print_numbers - Prints the numbers, from 0 to 9.
* Return: Alwais 0 (susses)
*/
void print_numbers(void)
{
int digit;
for (digit = '0'; digit <= '9'; digit++)
_putchar(digit);
_putchar('\n');
}
| true |
275763f51c867b3e0aa5c62ecf423482919fbb9f | C | alinamihut/food-ordering | /drinks.c | UTF-8 | 451 | 3.3125 | 3 | [] | no_license | //
// Created by Alina Mihut on 12/22/19.
//
#include "drinks.h"
void displayTypesOfDrinks (foodType *foodTypes, int noOfDrinks, drink *drinks ){
printf("Please choose a drink to go with your %s\n", foodTypes);
for (int i = 0; i < noOfDrinks; i++) {
putchar('a' + i);
printf(") %s (%.2f) \n", d... | true |
1b0f0cbf813a93f30744941039ed1bf9905f3f5f | C | cbsd/cbsd | /misc/src/conv2human.c | UTF-8 | 2,195 | 3 | 3 | [
"BSD-2-Clause"
] | permissive | // Part of the CBSD Project
// Convert and out bytes to human readable form
#include <stdio.h>
#include <libutil.h>
#include <stdlib.h>
#include <ctype.h>
#include <libutil.h>
#include <string.h>
#ifdef __DragonFly__
#include "expand_number.c"
#endif
#define MAX_VAL_LEN 1024
int
prthumanval(uint64_t bytes)
{
char b... | true |
3e24b562049a1383173db0e3fb0f2110f7b88cea | C | rdghenrique94/Open-C-projests | /rdg/Struct.c | UTF-8 | 1,325 | 3.5 | 4 | [] | no_license | #include <stdio.h>
#include <locale.h>
#include <stdlib.h>
/*truct horario
{
int horas;
int minutos;
int segundos;
};*/
int main (void){
setlocale(LC_ALL,"portuguese");
//DEFININDO ESTRUTURA
struct horario //tipo da estrutura, nome da estrutura
{
int horas;
int minutos;
int segundo... | true |
fff1b3175b9e9d7e28106212faac327a0b60919a | C | lijwxg/C-learn | /20200708/不同的数据类型.c | UTF-8 | 164 | 3.03125 | 3 | [] | no_license | # include <stdio.h>
/*
* 定义不同类型的变量
* short
* int
* long
* float
* double
* char
*
*/
int main(void)
{
printf("%d", sizeof(int));
} | true |
4c58b615fd40a1a18b571369c140feae4b5464c2 | C | isabella232/AnghaBench | /source/freebsd/contrib/subversion/subversion/libsvn_client/extr_deprecated.c_store_dirent.c | UTF-8 | 2,413 | 2.578125 | 3 | [] | no_license | #define NULL ((void*)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t; typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1
/* Forward d... | true |
d23ff5411df5caa0d8ec04a1b722d3eda0b81a84 | C | builtforhjk/mfcc_c | /wav.c | UTF-8 | 2,637 | 2.8125 | 3 | [] | no_license | #include "wav.h"
void wavStructInit(WAV_STRUCT * wavFileEg){
wavFileEg->numSamples = 0;
wavFileEg->dataSize = 0;
wavFileEg->data = NULL;
}
Boolean isDataChunk(WAV_DATASubchunk wd){
if(wd.subchunk2ID[0] == 'd' && wd.subchunk2ID[1] == 'a' &&
wd.subchunk2ID[2] == 't' && wd.subchunk2ID[3] == 'a')
return TRUE;
el... | true |
fac0afea62614929e7fe3ebff43e460e320c7af3 | C | lyuehh/algorithms-note-js | /src/t23.c | UTF-8 | 699 | 3.53125 | 4 | [] | no_license | #include <stdio.h>
int htoi(char s[]);
int hctoi(char c);
int main(int argc, const char *argv[])
{
char str[]= "0x1fa9";
printf("%d\n", htoi(str));
return 0;
}
int hctoi(char c) {
char str[] = "aAbBcCdDeEfF";
int i;
int ret;
for (i = 0; str[i] != '\0'; i++) {
if(c == str[i]) {
ret = 10 + (i ... | true |
82db5a90d02043836629760b71d497be1d39e0da | C | ChrisZMF/tcpkit | /src/log.c | UTF-8 | 2,246 | 2.703125 | 3 | [
"MIT"
] | permissive | /**
* tcpkit -- toolkit to analyze tcp packet
* Copyright (C) 2018 @git-hulk
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your... | true |
9d5f04e79beff2839a9ea268f5b36e36013fba34 | C | SarahMac11/CS4520-Operating_Systems | /a2_c_refresher_skm9b3/system_programming/include/sys_prog.h | UTF-8 | 2,254 | 2.875 | 3 | [] | no_license | #ifndef SYS_PROG_H
#define SYS_PROG_H
#include <stdbool.h>
#include <stddef.h>
#include <sys/types.h>
#include <stdint.h>
#include <unistd.h>
//
// NOTE THE FILE I/O MUST USE OPEN, READ, WRITE, CLOSE, SEEK, STAT with file descriptors (NO FILE*)
// Make sure to uint8_t or uint32_t, you are dealing with system dependent... | true |
2c5a9bfb127d5156df90921ea444d9e979009d2b | C | cxcorp/stm8-dce-test | /src/main.c | UTF-8 | 1,745 | 2.53125 | 3 | [] | no_license | #include "osconfig.h"
#include "stm8s.h"
#include <IntrOS/kernel/os.h>
static void initialize_clock();
//static void initialize_tim1();
static inline void led_init(void);
static inline void led_set(void);
static inline void led_clear(void);
static inline void led_toggle(void);
/*void tim1_interrupt(void) __interrup... | true |
b18c8bc33051030f2f0c5e89572c9755059da93f | C | PDP-10/panda | /files/kcc-6/lib/test/pmlx16.c | UTF-8 | 1,155 | 3.078125 | 3 | [] | no_license | #include <stdio.h>
int power = 16;
union dbl { int i[2]; double d; }
x, tot;
int bit;
double saved;
void normalize(ad)
double *ad;
{
asm( "SETZB 1,2\n"
"DFAD 1,@-1(17)\n"
"DMOVEM 1,@-1(17)\n" );
}
main()
{
int i;
x.d = 1.0;
bit = 26+35;
while (bit >= 0) {
/* Apply current bit ... | true |
ded5e21ef113164ec1233a169dd78af31b315aa9 | C | embox/embox | /src/tests/stdlib/bsearch_test.c | UTF-8 | 1,462 | 3.65625 | 4 | [
"BSD-2-Clause"
] | permissive | /**
* @file
* @brief Test unit for stdlib/bsearch.
*
* @date Nov 19, 2011
* @author Avdyukhin Dmitry
*/
#include <embox/test.h>
#include <stdlib.h>
#include <stdio.h>
EMBOX_TEST_SUITE("stdlib/qsort test");
/**
* Compare pointers to integer numbers
*/
static int int_comp(const void *fst, const void *snd) {
r... | true |
ee26a18bd1e2832eeebd76db4e50b729ff9434b0 | C | Memory-Scheduling-Optimization/Memory-Management-Team | /etan.dir/sbin/symlink.c | UTF-8 | 1,983 | 2.859375 | 3 | [
"MIT"
] | permissive | #include "libc.h"
int main(int argc, char** argv) {
const char* tn = argv[1];
printf("*** [%s] argc = %d\n", tn, argc);
for (int i = 0; i < argc; i++)
printf("*** [%s] argv[%d] = %s\n", tn, i, argv[i]);
if (argv[argc] != 0)
printf("*** [%s] failed to null-terminate, argv[%d] = ... | true |
3c6a9d1a671761f180c0270a9af381da06f0d3b6 | C | tonnac/Study_0 | /00_src/Strstr_01/Strstr_01.c | UHC | 766 | 3.5625 | 4 | [] | no_license | #include <stdio.h>
#include <string.h>
char* Strstr(char*ch, char*sr)
{
int a;
int iCnt = 0;
int iCount = 0;
while (ch[iCnt++] != 0);
while (sr[iCount++] != 0);
iCnt--; iCount--;
for (int i = 0; i < iCnt;i++)
{
a = 0;
if (*(ch + i) == *(sr+0))
{
for (int j = 1; j < iCount; j++)
{
if (*(ch + i +... | true |
4b20e56687ec317dfa53e91865aed6331cd68db8 | C | davidbragat/C-Lang | /MAPA_paradigmas.c | ISO-8859-1 | 882 | 2.96875 | 3 | [
"MIT"
] | permissive | #include <stdio.h>
#include <stdlib.h>
#include <locale.h>
void main(){
setlocale(LC_ALL, "Portuguese");
int vecRa[5], i=0; //store the ra number (15119)
vecRa[0] = 1;
vecRa[1] = 5;
vecRa[2] = 1;
vecRa[3] = 1;
vecRa[4] = 9;
int vecKey[5]; //store the input number
printf("========... | true |
e75e2f6ff068f786a39432aefec0cbfd60e636e9 | C | toto112358/scripts | /mkdir.c | UTF-8 | 285 | 2.6875 | 3 | [
"Unlicense"
] | permissive | #!/usr/bin/tcc -run -w
#include <stdio.h>
main(argc, argv)
int argc;
char **argv;
{
int err = 0;
if (argc <= 1) {
fprintf(stderr, "usage: %s dir ...\n", argv[0]);
exit(1);
}
while (--argc > 0)
if (mkdir(*++argv, 0777) < 0) {
perror(*argv);
err = 1;
}
exit(err);
}
| true |
59b09e8c51190dc5891455c111e8f5299a934496 | C | G4mingEdition/Blockchain | /blockchain project/tests/essaie/main.c | ISO-8859-1 | 2,580 | 2.84375 | 3 | [] | no_license | #include <stdio.h>
#include <myconio.h>
#include <string.h>
#include "..\blockChain\blockChain.h"
/** CONSTANTES **/
#define DIM 3
int main(void)
{
/** VARIABLES **/
int i, j, nb_blocs, valideChain;
char *contenu = NULL;
char *chaine = NULL;
char *transactions[9] = {"Transaction 1","... | true |
585170e7d1c123234edc7ff42075393cc364803d | C | furkankamer/Assignments-C | /Assignment2/assignment2.c | UTF-8 | 3,117 | 3.625 | 4 | [] | no_license | #include <stdio.h>
#include <stdlib.h>
/**
computes points for every throwing
@return the point of throwing
*/
int calculation_function_first(int throwing_point_2, char type_of_place_2)
{
if (type_of_place_2 == 'I') {
throwing_point_2 = 50;
} else if (type_of_place_2 == 'S') {
... | true |
21309571e2076158e65ba8420747b5b5b0f36990 | C | kirakirakira/tiny | /include/tiny_list.h | UTF-8 | 2,702 | 3.53125 | 4 | [
"MIT"
] | permissive | /*!
* @file
* @brief Linked list that contains nodes allocated by clients.
*
* Nodes can contain arbitrary data by defining a type that contains
* a tiny_list_node_t:
*
* typedef struct client_node_t {
* tiny_list_node_t node;
* int data;
* }
*
* This type must be cast to a tiny_list_node_t to be added ... | true |
34659cf40a93ed05524e1add24fed3713f18d6bc | C | hj005zy/c-programming-a-modern-approach | /chp19/06_queueADT.h | UTF-8 | 346 | 2.546875 | 3 | [] | no_license | #ifndef QUEUE_H
#define QUEUE_H
#include <stdbool.h>
typedef int Item;
typedef struct queue_type *Queue;
Queue create(int size);
void destroy(Queue q);
void make_empty(Queue q);
bool is_empty(Queue q);
bool is_full(Queue q);
void add_last(Queue q, Item i);
Item remove_first(Queue q);
Item get_first(Queue q);
Item g... | true |
7aff2f1aa2571ebe7fc4993ea087c85994bb6110 | C | xinqiaozhang/CS264A | /code/sat_solver/include/sat_api.h | UTF-8 | 3,416 | 2.546875 | 3 | [] | no_license | #ifndef SATAPI_H_
#define SATAPI_H_
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
/******************************************************************************
* typedefs
******************************************************************************/
typedef char BOOLEAN; //signe... | true |
d26cb1840075159dd5e1dce53085c0e999e799d2 | C | rahulthapar15/Algorithms-CSD-302 | /LAB8/lab8.c | UTF-8 | 2,285 | 3.953125 | 4 | [] | no_license | /*
@author : Rahul Thapar
ID : 1410110321
Problem : Implement Fractional Knapscak Problem
Algorithm
__________
1. Calculate DENSITY : value per weight for each item
2. Sort the items as per the value density in descending order
3. Take as much item as possible not already taken in the knapsack
*/
#in... | true |
4e77dea68600fa293697c6e35c8e653ca6277dcc | C | SamScherer1/CSE-474 | /Group2-master/p2/lcdScreen.c | UTF-8 | 5,220 | 3.515625 | 4 | [] | no_license | /* lcdScreen.c
* Samuel Scherer
* 4/5/17
*
* Sets up LCD screen
*/
#include <fcntl.h>
#include <stdio.h> // for File IO and printf
#include <string.h> //for strcat
#include <time.h> // for usleep
#include <sys/stat.h>
#include <unistd.h>
#define GPIO_PIN9 27 // LED pin unused
#define GPIO_PI... | true |
dbc394dba35924f94d7469797d51ddeea294618e | C | olzone/OORA | /lab5/chol_dense_org.c | UTF-8 | 941 | 3.265625 | 3 | [] | no_license | #include <assert.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
/* for Fortran - j*n + i */
//#define IDX(i, j, n) (((i) * (n)) + (j))
#define IDX(i, j, n) (((j)+ (i)*(n)))
int
chol(double *A, unsigned int n)
{
unsigned int i;
unsigned int j;
unsigned int k;
for (j = 0; j < n; j++) {
for (i = j; i... | true |
4a426e37504175eb7f647637fb3cd7f8ad5ba50f | C | kail/EmbeddedSystems | /Projects/BubbleSort/src/main.c | UTF-8 | 3,333 | 2.796875 | 3 | [] | no_license | /*******************************************************************************
FILE NAME : main.c
DESCRIPTION : Generic main file
*******************************************************************************/
/* Includes ------------------------------------------------------------------*/
#include "main.h"
#inc... | true |
cb31bc1bc479025f88311d5d68a5452067139a5e | C | tonabarrera/algoritmos | /fibonacci.c | UTF-8 | 481 | 3.328125 | 3 | [] | no_license | #include <stdio.h>
int v[50];
int fibo(int n){
if (n==0)
return 0;
else if (n==1)
return 1;
else
return fibo(n-1)+fibo(n-2);
}
int fibo_memoria(int n) {
if (v[n]!=0)
return v[n];
if (n==0)
return 0;
if (n==1)
return 1;
v[n] = fibo_memoria(n-1)+... | true |
7cc6ce58437074bb621a45c34bbd6dbb301d550c | C | melvinvarkey/CompetitiveProgramming | /Programs/DSC/linkedlist.c | UTF-8 | 2,204 | 3.53125 | 4 | [] | no_license | #include<stdio.h>
#include<stdlib.h>
struct node
{
int info;
struct node *next;
};
typedef struct node *np;
np getnode()
{
np p;
p=(np)malloc(sizeof(struct node));
return p;
}
void ins(np p,int x)
{
np q;
q=getnode();
q->info=x;
q->next=p->next;
p->next=q;
}
void del(np p)
{... | true |
f044c59a1ffd6e0db167e03110ead19281d65332 | C | lyfcsdo2011/OS-Work | /mission1/crt/src/__main.c | GB18030 | 793 | 2.609375 | 3 | [] | no_license | /***
Copyright (c) 2008 ӢʱƼ˾Ȩ
ֻ EOS ԴЭ飨μ License.txtеʹЩ롣
ܣʹЩ롣
ļ: __main.c
: ȫֱ캯ĵߡ
*******************************************************************************/
typedef void (*func_ptr) (void);
extern func_ptr __CTOR_LIST__[];
void __main(void)
{
unsigned long i;
i = (unsigned long) __CTOR_LIST__[0];
... | true |
47061a57a2ce1ea9e5b60d3c5a0561d3057d2580 | C | 9080701209/even | /set3/108.c | UTF-8 | 303 | 3.375 | 3 | [] | no_license | #include <stdio.h>
int main()
{
int n,f,d,i,sum=0;
printf("enter the first term\n");
scanf("%d",&f);
printf("enter the difference\n");
scanf("%d",&d);
printf("enter the no of terms\n");
scanf("%d",&n);
for(i=0;i<n;i++)
{
sum=sum+(f+i*d);
}
printf("%d",sum);
return 0;
}
| true |
ce229cbcc0989422891ba9b69d7fee4100c2ab5d | C | Davidzy/UVa-Online-Judge | /src/kent-623.c | UTF-8 | 1,536 | 3.25 | 3 | [
"CC0-1.0"
] | permissive | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct Big_num{
char value[3000];
int length;
};
struct Big_num answer[1001];
void Multiplication( struct Big_num *target , int num )
{
struct Big_num *temp;
temp = (struct Big_num*)calloc( 1 , sizeof(struct Big_num) );
int i , j , k ;
k = 0;
temp->le... | true |
c421f2f95d827bfedf2a8ab8965d19a48478a20a | C | Donz1e/HW4-1 | /P30/source/Source.c | UTF-8 | 469 | 3.171875 | 3 | [] | no_license | #include<stdio.h>
#include<stdlib.h>
void qwer(int *q[]);
int main(void)
{
int i;
int a[3] = { 3,5,7 };
for (i = 0; i <= 2; i++)
{
printf("%d ",a[i]);
}
printf("\n");
qwer(&a);
for (i = 0; i <= 2; i++)
{
printf("%d ", a[i]);
}
printf("\n");
system("pause");
return 0;
}
void qwer(int *q[])
{
int k,j,... | true |
946e1e5a05fb6ae4732c5ab653f6b26c451aa8bc | C | aanchalsh/ADA-in-C | /ADA LAB/BFS.c | UTF-8 | 1,709 | 3.765625 | 4 | [] | no_license | //Print all the nodes reachable from a given starting node in a digraph using BFS method.
#include<stdio.h>
#include<stdlib.h>
int a[20][20], n, vis[20];
int q[20],front=-1,rear=-1;
int s[20],top=-1;
void bfs(int v)
{
int i,curr;
vis[v] = 1;
q[++rear] = v;
while(front!=rea... | true |
15d92124f77c59645b8c04b48003913b1e4ed712 | C | caiodadauto/MAC122-Algorithms | /Listas/Lista2/Ex1.c | UTF-8 | 3,199 | 3.484375 | 3 | [] | no_license | #include<stdio.h>
#include<stdlib.h>
#include<math.h>
typedef struct _Monomio{
float
coef;
int
exp;
struct _Monomio
*prox;
} Monomio;
typedef Monomio * Polinomio;
Polinomio AlocaMonomio(){
Polinomio
p;
p = (Polinomio)malloc(sizeof(Monomio));
if(p == NULL){
... | true |
8887c11a577d273953cec06d75a06a41f557d79c | C | Irokanade/hw0202 | /hw0202/hw0202.c | UTF-8 | 1,010 | 3.515625 | 4 | [] | no_license | //
// hw0202.c
// hw0202
//
// Created by Michael Leong on 2021/3/18.
//
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include "longtobinary.h"
int main() {
char floatingPointStr[65];
char *pEnd = NULL;
doubleFP floatingPointNum;
char exponentStr[11] = {0};
char mantissaStr[53] =... | true |
cc2cbc53792c4a3109a61b4d420e5a682d801e10 | C | ruinned/Master_001 | /platform/dio.c | UTF-8 | 12,435 | 2.546875 | 3 | [] | no_license | /**
* @file
*
* Digital I/O driver
*
* $Id: dio.c 11351 2013-11-19 17:41:32Z pr4 $
*/
/**
* @ingroup dio
* @{
* @file
* @}
*/
#include "hardware.h"
#include "basic_types.h"
#include "dio.h"
/** PUPAE bit mask in PUCR register */
#define PUCR_PUPAE 0x01u
/** PUPBE bit mask in PUCR register */
#define PUCR_... | true |
7fced5eb015572b2905d9e26039777494faaef23 | C | Naruto-Zhao/Arm_Convey | /HARDWARE/encode.c | GB18030 | 638 | 3.328125 | 3 | [] | no_license | #include "stm32f10x.h"
#include "string.h"
#include "stdio.h"
char carry[50];
/* ݴʽ */
void data_encode(char *data){
unsigned char length = strlen(data);
unsigned char sum = 0x00;
unsigned char i;
carry[0] = 0x3C; //ʼλ
carry[1] = 0x02; //λ
carry[2] = length; //͵λ
/* ͵ */
for... | true |
a7f6a3a064cec24e05e74d039c46d6404afd0622 | C | klaussilveira/yeti3d-sdl | /src/y3d/y3d_entity.c | UTF-8 | 3,586 | 2.828125 | 3 | [] | no_license | /*
** Name: Yeti3D PRO
** Desc: Portable GameBoy Advanced 3D Engine
** Auth: Derek J. Evans <derek@theteahouse.com.au>
**
** Copyright (C) 2003-2004 Derek J. Evans. All Rights Reserved.
**
** YY YY EEEEEE TTTTTT IIIIII 33333 DDDDD
** YY YY EE TT II 33 DD DD
** YYYY EEEE TT II 333 DD ... | true |
8cc6d7d91d478097ea5010d75bd4a3818fb5125d | C | gabriel-duque/data_structures | /map/tests/map_remove_non_existant.c | UTF-8 | 324 | 2.8125 | 3 | [] | no_license | #include <stdlib.h>
#include "map.h"
int main(void)
{
size_t n1 = 42;
size_t n2 = 43;
struct map *map = map_init(10);
map_add(map, "toto", &n1, NULL);
map_add(map, "tata", &n2, NULL);
map_remove(map, "tyty", NULL);
if (map->size != 2)
return EXIT_FAILURE;
return EXIT_SUCCESS... | true |
8cf5e1e320c6c30623d238c2894ebb8a07177ce0 | C | C-Begley/university_work | /third_year/Systems/Lab3/function_pointers.c | UTF-8 | 1,201 | 4.125 | 4 | [] | no_license | #include <stdlib.h>
#include <string.h>
#include <stdio.h>
#define COUNT 4
enum sorting {first, second};
struct name {
const char * first_name;
const char * last_name;
};
typedef struct name name;
int sort_first (const void * a, const void * b) {
name * n1 = (name *) a;
name * n2 = (name *) b;
return s... | true |
94243a5d6ac58562065226f5c8e42b082643409d | C | sieunlee97/C_Lang | /multi.c | UTF-8 | 490 | 3.65625 | 4 | [] | no_license | #include <stdio.h> //라이브러리 임포트
int multi(int x, int y); //함수 명세 표시= 스프링의 인터페이스와 같은 역할
void main() {
int a, b, c; // 정수형 변수 a,b,c 선언
printf("곱하기 할 첫번째 수를 입력하세요 : ");
scanf("%d", &a);
printf("곱하기 할 두번째 수를 입력하세요 : ");
scanf("%d", &b);
c=multi(a,b); //함수호출
printf("실행결과 : %d X %d = %d\n", a, b, c);
}
int multi(int... | true |
733b1e4ac51bb817e16304881f4992c163911178 | C | kazuedo/paiza_POH8 | /mizugi.c | UTF-8 | 2,678 | 3 | 3 | [] | no_license | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
//#define D_DEBUG
//#define D_TEST
#ifdef D_DEBUG
#define D_OK (0)
#define D_NG (1)
#define D_LOG(...) fprintf( stderr, "%s(%d):", __func__, __LINE__ ); printf( __VA_ARGS__ ); printf( "\n" );
#else
#define D_LOG(...)
#endif
#define D_OUT_MAX_L... | true |
25141b896ae5f5041a45933606e253992fc46497 | C | xcyivan/CS111_OperatingSystem | /project1/stack.h | UTF-8 | 303 | 2.828125 | 3 | [] | no_license | #ifndef _STACK_H
#define _STACK_H
struct node;
typedef struct node *node_t;
typedef node_t stack;
int is_empty(stack s);
stack create_stack();
void make_empty(stack s);
void push(void* element, stack s);
void* pop(stack s);
void* peer(stack s);
struct node{
void* element;
node_t next;
};
#endif | true |
0398e77e812c7522952df0d6b25af11282418f97 | C | MS5682/Legacy-SW | /XEP/xtXEP_source-3/xtXEP/src/System/task_monitor.h | UTF-8 | 1,780 | 2.828125 | 3 | [
"MIT"
] | permissive | /**
* @file
*
* @brief System monitor task
*
* Monitors system health, e.g. tasks alive/messages. Resets watchdog if all seems OK.
*/
#ifndef TASK_MONITOR_H
#define TASK_MONITOR_H
#include "xep_dispatch.h"
#include <stdbool.h>
#define MAX_TASKS 10
typedef struct monitor_task_t_ {
int id;
void* task_ha... | true |
6b99fdaee05c241305bb9ea23ae07676dc55a38a | C | SryanJ/Bistro-matic | /lib/my/my_is_prime.c | UTF-8 | 538 | 3.296875 | 3 | [] | no_license | /*
** my_is_prime.c for my_is_prime in /home/thomas.couacault/CPool_Day05
**
** Made by Thomas Couacault
** Login <thomas.couacault@epitech.net>
**
** Started on Fri Oct 7 16:09:03 2016 Thomas Couacault
** Last update Wed Oct 12 10:13:48 2016 Thomas Couacault
*/
int my_is_prime(int nb)
{
int divider;
divider ... | true |
0149fe7323541ef58c5e80ed9720c20bf15c20a4 | C | mikeakohn/easy_match | /src/generate.c | UTF-8 | 687 | 2.625 | 3 | [] | no_license | /**
* Easy Match
* Author: Michael Kohn
* Email: mike@mikekohn.net
* Web: http://www.mikekohn.net/
* License: GPLv3
*
* Copyright 2016-2019 by Michael Kohn
*
*/
#include "generate.h"
int generate_code(struct _generate *generate, uint8_t len, ...)
{
va_list argp;
int i, data;
va_start(argp, ... | true |
a0ec07beea1fd9eacdd457c51187d25b2b55609b | C | luongli/Cprograming | /sorting/psu-heapSort.c | UTF-8 | 562 | 3.40625 | 3 | [] | no_license | void max_heapify(int *A, int i, int len)
left = 2*i;
right = 2*i+1;
if( (left <= len-1) && (A[i] < A[left]) ) largest = left;
else largest = i;
if( (right <= len-1) && (A[largest] < A[right]) ) largest = right;
if(largest != i)
tmp = A[largest];
A[largest] = A[i];
A[i] = tmp;
max_heapify(A, largest, le... | true |
d79405be81135a815291ef7926b6c6e566ce0692 | C | sprotzek/psieve | /queue.c | UTF-8 | 954 | 3.140625 | 3 | [] | no_license | #include <pthread.h>
#include <stdlib.h>
#include "queue.h"
queue_t* qinit(int max_size)
{
queue_t* q = (queue_t*)malloc(sizeof(queue_t));
q->max_size = max_size;
q->head = 0;
q->tail = 0;
q->empty = 1;
q->not_empty = (pthread_cond_t*)malloc(sizeof(pthread_cond_t));
pthread_cond_init(q->no... | true |
2b77316a679a9a70b2065c07696fae35e19e48eb | C | besellem/so_long | /srcs/engine/map.c | UTF-8 | 2,573 | 2.78125 | 3 | [] | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* map.c :+: :+: :+: ... | true |
e419ae5e63ac64542f046cb61468ebc6474a376f | C | lyyyuna/usb_lyy | /usbmouse/key.c | GB18030 | 3,056 | 2.84375 | 3 | [] | no_license | #include "key.h"
#include "config.h"
volatile uint8 idata KeyCurrent,KeyOld,KeyNoChangedTime;
volatile uint8 idata KeyPress;
volatile uint8 idata KeyDown,KeyUp,KeyLast;
volatile uint8 KeyCanChange;
/********************************************************************
ܣʱ0ʼɨ衣
ڲޡ
أޡ
עޡ
*************************... | true |
efe1bc89907268f646c4e8dfece7fa3798df2964 | C | plasticuproject/C-Programming-For-Beginners | /4_Basic_Concepts/SampleApp/Sources/test.c | UTF-8 | 380 | 3.671875 | 4 | [] | no_license | /*
* Author: plasticuproject
* Purpose: This program prints out my name to the screen.
* Date: June 23, 2021
*/
#include <stdio.h>
int main(void) {
// this code is displaying my name
char name[100];
int number;
printf("What is your name and number: ");
scanf("%s %d", name, &number);
printf... | true |
266f888f6aafd19ee8f5bdf1196d4624eb4fee1b | C | mikedlowis/alib | /tests/utf8.c | UTF-8 | 2,187 | 3.0625 | 3 | [
"ISC"
] | permissive | // Unit Test Framework Includes
#include "atf.h"
// File To Test
#include <stdc.h>
#include <utf8.h>
static bool is_rejected(char* seq) {
Rune rune = 0;
size_t length = 0;
while (*seq && !utf8decode(&rune, &length, *seq))
seq++;
return (rune == RUNE_ERR);
}
//---------------------------------... | true |
47113371d84e6cb3c6a71d944e31e8b5832e69e7 | C | BeatrizGR/7_ProyectoEstructurada | /pitagoras.c | UTF-8 | 539 | 3.515625 | 4 | [] | no_license | #include <stdio.h>
#include <math.h>
int distanciadospuntos(float x1, float x2, float y1, float y2, float distancia);
int main(void)
{
float x1=5;
float x2=6.7;
float y1=8.3;
float y2=4.5;
float distancia=8;
float distancias = distanciadospuntos(x1,x2,y1,y2,distancia);
printf("\nLa dist... | true |
87d7a8a9a92c17080a0c63e85ee6559c6b935b91 | C | loversmile/mytest | /free.c | UTF-8 | 334 | 2.65625 | 3 | [] | no_license | /*************************************************************************
> File Name: free.c
> Author:
> Mail:
> Created Time: 2015年07月22日 星期三 11时13分40秒
************************************************************************/
#include <stdio.h>
#include <stdlib.h>
int main()
{
int a;
free(a);
}
| true |
2a484232bc96ccb043153092ab0d7ca05ae1e610 | C | eingaeph/pip.imbue.hood | /libk/EDAL/chin.c | UTF-8 | 645 | 2.53125 | 3 | [
"BSD-2-Clause"
] | permissive | // chin set insertion point after one byte character insert
#include "../libk.h"
void chin(char c, int fetch) //fetch text[fetch].row
{
assert(glob.iy == fetch); possibleLine; possibleIxIy;
int limit = text[fetch].size + 1 ;
char *new = malloc((limit)*sizeof(char));
char *orig = text[fetch].row;
int n... | true |
c689c2ea0992f531facc12f169fd9772a5e0687c | C | ihssanehatim/GTK-XML | /gtk_xml_last/message.h | UTF-8 | 1,313 | 2.734375 | 3 | [] | no_license | #include "biblio.h"
typedef struct msg
{
GtkWidget *mg;
int type;
char *txt;
}msg;
msg *init_msg(xmlNode *root)
{
msg *m;
m = (msg*)malloc(sizeof(msg));
if(!m) EXIT_FAILURE;
xmlChar *propertyContent;
propertyContent = xmlGetProp(root,"type");
if(propertyContent)
... | true |
aa2a9cc2db6c16b609574ba000ed6d8b4c09168b | C | April01xxx/LeetCode | /findSubstring.c | UTF-8 | 2,379 | 3.859375 | 4 | [] | no_license | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
/**
* 计算一个字符串的唯一hash值.
*/
unsigned int
hash(char *s) {
unsigned int h = 0;
size_t i;
for (i = 0; s[i] != 0; ++i) {
if ('a' <= s[i] && s[i] <= 'z')
h = (h << 6) + 2 * (s[i] - 'a' + 1) - 1;
else if ('A' <= s[i] && s[i] <= 'Z')
h = (h... | true |
63f0a5e916c3610be18e5a83915f4dc701dd7222 | C | olee12/uva_onlinejudge_solutions | /Codes/11185 - Ternary.c | UTF-8 | 357 | 3.171875 | 3 | [] | no_license | #include<stdio.h>
void ter(long long int a);
int main()
{
long long int a;
while(scanf("%lld",&a)==1)
{
if(a<0) break;
else if(a==0)
printf("0");
ter(a);
printf("\n");
}
return 0;
}
void ter(long long int a)
{
if(a==0)
return;
ter(a/3);
... | true |
a9d07f63673a1ac7436824c24422614468f03859 | C | pchote/tsreduce | /aperture.c | UTF-8 | 14,805 | 3.09375 | 3 | [] | no_license | /*
* Copyright 2010, 2011, 2012 Paul Chote
* This file is part of Puoko-nui, which is free software. It is made available
* to you under the terms of version 3 of the GNU General Public License, as
* published by the Free Software Foundation. For more information, see LICENSE.
*/
#include <stdio.h>
#include <stdl... | true |
ade3510dd036869bb33a2d83c12e3f73e1eb232d | C | OpenVnmrJ/OpenVnmrJ | /src/bin/tape_main.c | UTF-8 | 2,042 | 2.984375 | 3 | [
"LicenseRef-scancode-proprietary-license",
"Apache-2.0",
"GPL-3.0-only"
] | permissive | /*
* Copyright (C) 2015 University of Oregon
*
* You may distribute under the terms of either the GNU General Public
* License or the Apache License, as specified in the LICENSE file.
*
* For more information, see the LICENSE file.
*/
/*
*/
#include <stdio.h>
#define NINETRACK 1
#define STREAMER 2
main( arg... | true |
ad25da3edd0ad6049c7d4be9b321241d6848be5c | C | GDokmetas/Ileri-AVR-Uygulamalari | /AVRADV34_ACileADC/AVRADV34_ACileADC/main.c | ISO-8859-9 | 869 | 2.5625 | 3 | [
"MIT"
] | permissive | /*
* AVRADV34_ACileADC.c
*
* Created: 21.3.2021 09:39:07
* Author : GDokmetas
*/
#include <avr/io.h>
#include "bitfieldarduino.h"
#define F_CPU 16000000UL
#include <util/delay.h>
#include <avr/interrupt.h>
#include <stdio.h>
#include "uart.h"
void adc_oku();
unsigned int analog_deger;
int main(void)
{
D2_dir... | true |
6330f8e5c177719bf6581d42d18150bb6397ed11 | C | lumax/cap | /iniParser.c | UTF-8 | 2,651 | 3.3125 | 3 | [] | no_license | /*
Bastian Ruppert
*/
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include "iniParser.h"
/*
* trim: get rid of trailing and leading whitespace...
* ...including the annoying "\n" from fgets()
*/
static char * trim (char * s)
{
// Initialize start, end pointers
char *s1 = s, *s2 = &s[strl... | true |
bdfd331a843b6ea17ac5df78d7fc428a2f1d554c | C | bmeurer/emscripten | /tests/core/test_emscripten_math.c | UTF-8 | 1,253 | 2.859375 | 3 | [
"NCSA",
"MIT"
] | permissive | #include <stdio.h>
#include <emscripten/em_math.h>
int main()
{
printf("%f\n", emscripten_math_cbrt(8.0));
printf("%f\n", emscripten_math_pow(2.0, 4.0));
printf("%d\n", (int)(emscripten_math_random() >= 0 && emscripten_math_random() <= 1));
printf("%f\n", emscripten_math_sign(-42.0));
printf("%f\n", emscripten_ma... | true |
bb742449e76095301c48b12870a4f9315d9c099f | C | Gyanesh-Mahto/Data_Structure_Algorithm_C | /Binary_Search_Tree/Binary_Tree.c | UTF-8 | 4,401 | 3.84375 | 4 | [] | no_license | #include "myHeader.h"
struct Node //Node of Binary Search Tree
{
struct Node *Left_Smaller;
int data;
struct Node *Right_Greater;
}*Root=NULL;
void display_Inorder(struct Node *Root) //Display-->Inorder
{
if(Root)
{
/* first recur on left child */
display_Inord... | true |
b574a4a8e9f921ca52fd522ff9373300d3dab9e2 | C | Gravemind/wine-playground | /test-perf-counter/win-query-perf-counter.c | UTF-8 | 367 | 2.671875 | 3 | [] | no_license |
#include <windows.h>
#include <stdio.h>
#include "utils.h"
int main(int argc, char **argv)
{
intlong times = atol(argv[1]);
uintlong sum = 0;
LARGE_INTEGER c;
for (long i = 0; i < times; ++i)
{
QueryPerformanceCounter(&c);
sum += c.QuadPart;
}
... | true |
d834141fe15a38bc4d082c4cb1a66fc1e6aefcfe | C | Kunal352000/c_program | /repetarray.c | UTF-8 | 265 | 2.890625 | 3 | [] | no_license | #include<stdio.h>
void main(){
int seen[10]={0},n,rem;
printf("Enter the numbers:");
scanf("%d",&n);
while(n>0){
rem=n%10;
if(seen[rem]==1)
break;
seen[rem]=1;
n=n/10;
}
if(n>0){
printf("yes");
}
else
printf("No");
}
| true |
75632cd31fb858f2ba6fe860cbf7a6cb33b2964b | C | aysf/c-programming | /C-by_Dicanio/iterating/underline.c | UTF-8 | 521 | 4.09375 | 4 | [] | no_license | // demo using forloop to underline string
#include<stdio.h>
#include<string.h>
int main(void)
{
/* string to underline */
char str[] = "Connie is learning C.";
/* print the upper underline */
int len = strlen(str);
for(int i = 0;i<len;i++){
putchar('-');
}
putchar('... | true |
8e21bc641b53b5a3d0538834c5db68b981c9bd8b | C | BalrogMithrandir/Pre_Research | /algorithm/quickSort.c | UTF-8 | 959 | 3.578125 | 4 | [] | no_license | #include <stdio.h>
#include "Sort.h"
int SplitArray(TYPE *A, int l, int r)
{
int Index = l;
int End = r;
int Ruler = A[r];
int RulerIndex = l;
if (l == r)
{
return l;
}
while(Index != End)
{
if (A[Index] < Ruler)
{
A[End] = A[In... | true |
0dc4d186943125e6ef72d2be5ed6180ccfdda1d1 | C | steven0610/KroucisVM | /ObjectVM/memory_manager.c | UTF-8 | 2,524 | 2.734375 | 3 | [] | no_license | //
// memory_manager.c
// ObjectVM
//
// Created by Kyle Roucis on 14-4-2.
// Copyright (c) 2014 Kyle Roucis. All rights reserved.
//
#include "memory_manager.h"
#ifdef CLKWK_DEBUG_MEMORY
#include <stdio.h>
#endif
#include <memory.h>
struct mem_block
{
size_t size;
void* memory;
};
#ifdef CLKWK_TRA... | true |
259d5f5a586a7c28d994e9067311dfa2b3a3b080 | C | Evolph/ISPT-UTN-Programacion | /Funciones Ejercicio 08.c | UTF-8 | 533 | 3.734375 | 4 | [] | no_license | #include<stdio.h>
void FaC(int f)
{
float celcius=((f-32)*5)/9;
printf("\nTemp. Fahrenheit Temp. Celcius");
printf("\n%16.d %14.f", f, celcius);
}
int main()
{
int fahr;
char salir;
do
{
printf("Ingrese una temperatura en Fahrenheint: ");
sc... | true |
026cd1ff7cf3b86850fe21827cacca0ad5a5bff6 | C | Zippee0709/Tek2-Project | /C++/Malloc/src/free.c | UTF-8 | 945 | 3.359375 | 3 | [] | no_license | /*
** EPITECH PROJECT, 2020
** PSU_2019_malloc
** File description:
** free
*/
#include "../include/malloc.h"
void free(void *ptr)
{
block_t *free = NULL;
if (ptr == NULL)
return;
free = (block_t *)ptr - 1;
free->avaible = 1;
}
void *calloc(size_t nmemb, size_t size)
{
size_t new_size = ... | true |
b8f866def94a447a240e8bcbd8dbf91798245cd3 | C | Jin-SukKim/Hack_Study | /dreamhack/Reversing/x64dbg/실습/dbg_usage_easy_crackme_2/easy_crackme1_source.c | UTF-8 | 1,767 | 3.4375 | 3 | [] | no_license | // 컴파일은 visual studio 2019를 통해 하였으며 x64 릴리즈 모드의 옵션은 다음과 같습니다.
// C/C++
// 최적화: 사용 안 함(/Od)
// SDL 검사: 아니요(/sdl-)
// 링커
// 임의 기준 주소: 아니요(/DYNAMICBASE:NO)
// 이외의 옵션은 기본값을 사용하였습니다.
#include <stdio.h>
int numberConvert(char in) {
int ret = 0;
switch(in){
case 'q': ret = 1; break;
case 'w': ret = ... | true |
c3d878017cb6f126470b0c5b9ca274c9666d96ae | C | Daniel-Nordin/Sensor_Project | /Core/Src/Time.c | UTF-8 | 1,694 | 3.109375 | 3 | [] | no_license | /**
* Time.c
*
* Created on: Dec 9, 2019
* Author: Daniel
*/
#include <Time.h>
/**
* @breif Gets the time from the rtc and sends it to the display
* @param none
* @retval none
*/
void update_time(){
uint8_t temp;
RTC_TimeTypeDef real_time;
clear_display();
real_time = get_time();
temp = real_time.H... | true |
8494fe0d015f6fb566d75fe544cec01eb966035d | C | Abiduddin/Competitive-Programming-Codes | /All ACM Codes/important topics/swap pinter.c | UTF-8 | 481 | 3.703125 | 4 | [] | no_license | #include <stdio.h>
void swap(int *a,int *b);
int main()
{
int x=10,y=20;
printf("x is %i\n",x);
printf("y is %i\n",y);
printf("swapping......\n");
swap(&x,&y);
printf("swapped.\n");
printf("x is %i\n",x);
printf("y is %i\n",y);
}
void swap(int *a,int *b)
{
int temp=*a;
printf... | true |
e04438634b6f14345b566692ad40d8bbafefb5de | C | s3666874/cpt220 | /ass2b/startup/tile_list.h | UTF-8 | 1,322 | 2.765625 | 3 | [] | no_license | /******************************************************************************
* Student Name : Federick Kwok
* RMIT Student ID : s3666874
* COURSE CODE : CPT220
*
* Startup code provided by Paul Miller for use in "Programming in C",
* study period 2, 2018.
***********************************************... | true |