blob_id large_string | language large_string | repo_name large_string | path large_string | src_encoding large_string | length_bytes int64 | score float64 | int_score int64 | detected_licenses large list | license_type large_string | text string | download_success bool |
|---|---|---|---|---|---|---|---|---|---|---|---|
77fd021c7ccfd148371c00ceac76a03684d63696 | C | AbdallahDaaboul/HUFFMAN_COMPRESS_C | /huffman_build.c | UTF-8 | 2,380 | 2.84375 | 3 | [] | no_license | #include "huffman_node.h"
#include "heap.h"
#include <assert.h>
huffmanTree construire_arbre_codes(unsigned int *distrib)
{
Heap* tas=createEmptyHeap();
for (int i = 0; i < 257; i++)
if (distrib[i]!=0)
insert(tas,createLeaf(distrib[i],i));
while(tas->size!=1){
if (tas->size==2)
return addT... | true |
bb91622f5b2b24e3f88cb5779218976e6b45ce77 | C | github-viki/data_str | /graph/graph.c | UTF-8 | 4,608 | 3.328125 | 3 | [] | no_license | #include "graph.h"
/*
* 按行输入 第一行输入 0 2 3 0 0
* 就是说第一个节点和第二个节点边的权重为2
* 第三个之间的边权重为3
* 其他无边
*
*/
GRAPH* init_graph(int num)
{
GRAPH *g = (GRAPH *)malloc(sizeof(GRAPH));
g->node_num = num;
g->edge_num = 0;
g->n = (NODE *)malloc(sizeof(NODE)*num);
int tmp = 0;
for(tmp;tmp < num;tmp++)
{
g->n[tmp].vi = tmp+1... | true |
3aa3cae11a4d175dfb1e8580e27da812629868be | C | elhilaliahmed/lpi | /chap40/getlogin.c | UTF-8 | 2,404 | 3.1875 | 3 | [
"MIT"
] | permissive | /* getlogin.c - an implementation of the `getlogin(3)` library function.
*
* The `getlogin(3)` function returns the username of the user currently
* logged in in the controller terminal of the calling process. Therefore,
* it fails for daemon processes.
*
* This is accomplished by checking the name of the termina... | true |
bc38229ac6a7ceb87fe5b2b3e99dbe006cdcab07 | C | oh4645/CProjects | /10-1.c | UTF-8 | 1,728 | 3.71875 | 4 | [] | no_license | #include <stdio.h>
#include <stdbool.h>
#define STACK_SIZE 100
/* external variables */
char contents[STACK_SIZE];
int top = 0;
bool underflow = false, overflow = false;
void make_empty(void);
bool is_empty(void);
bool is_full(void);
void push(char ch);
char pop(void);
void stack_overflow(void);
void stack_underflow... | true |
18fae82ac63a6f28037eae3d2d5ec5711fb51a1b | C | lindenzed/CSC230 | /excercises/excer_16/bitField.c | UTF-8 | 1,203 | 4.71875 | 5 | [] | no_license | /** Demonstration of how to use a bit field, accessing just selected bits in a larger
value, as if they are a little integer. */
#include <stdio.h>
#include <stdlib.h>
// Increment just bits 8 - 11, returning the resut, with the
// remaining bits left unchanged.
unsigned short increment8to11( unsigned short s )
{... | true |
d5c3757f18d4ece2742427f9846ff391ce8f35db | C | purvi-j-desai/CL-2 | /SHM/atm/shm/atm2.c | UTF-8 | 786 | 2.90625 | 3 | [] | no_license | #include<stdio.h>
#include<stdlib.h>
#include<sys/types.h>
#include<sys/ipc.h>
#include<sys/shm.h>
#include<string.h>
#define SHMSZ 100
int main()
{
int shmid;
key_t key;
key=1234;
char *shm,*s;
if((shmid=shmget(key,SHMSZ,IPC_CREAT|0660))<0)
{
perror("shget");
exit(1);
}
//attach the process2 to this shm
if((shm=shmat(... | true |
7c4af3df06fb8189fec7686059fe72615ebc3cf8 | C | fabestine1/MyThing | /C-Programming-Exercises-master/Code/Linked list/ch_list.c | UTF-8 | 1,183 | 3.65625 | 4 | [
"MIT"
] | permissive | #include <stdio.h>
#include <stdlib.h>
struct node_t {
int data;
struct node_t *next;
};
struct list_t {
struct node_t *head;
};
struct list_t init_list() {
struct list_t result = { NULL };
return result;
}
struct node_t* init_node(int item) {
struct node_t *result = malloc(
sizeof(s... | true |
288d9417afcd793dab56b9a6cd78d2936634eea7 | C | Markaccount123/Linux_pthread | /file/mythread.c | UTF-8 | 530 | 3.140625 | 3 | [] | no_license | #include<stdio.h>
#include<unistd.h>
#include<sys/types.h>
#include<pthread.h>
void *thread_run(void *arg)
{
while(1){
printf("I am %s, pid : %d ,my thread id is %p\n",(char*)arg,getpid(),pthread_self());
sleep(1);
int a = 1 / 0;
}
}
int main()
{
pthread_t tid;
//你新创建的线程id就会放在tid中
pthread_creat... | true |
9c9376dcff3ed5ba01e9cf1c6e9f8ad01da00eb0 | C | dariot/socket-tests | /tcp/receiver_control_bytes1N.c | UTF-8 | 6,060 | 2.703125 | 3 | [] | no_license | /*********************
* TCP SOCKET TEST 3
* ******************/
#include <sys/ioctl.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <sys/time.h>
#include <netinet/in.h>
#include <netinet/tcp.h>
#include <math.h>
#include <netdb.h>
#include <arpa/inet.h>
#include <stdio.h>
#include <stdlib.h>
#include <er... | true |
0752ae2f360cfe4da1b0db8f9b2a1622edf64434 | C | Checkam/WorldOfDungeons | /include/json.h | UTF-8 | 1,631 | 3.28125 | 3 | [] | no_license | #ifndef __JSON_H__
#define __JSON_H__
/**
* \file json.h
* \brief Module contenant les primitives et les structures permettant l'écriture et la lecture de fichier JSON.
* \author GALBRUN Tibane
* \version 0.3
* \date 5 Mars 2019
*/
#include <stdio.h>
#include <stdlib.h>
#include <erreur.h>
/* Primitives de créat... | true |
9d732d80f7ccdf713c5eb417eb03e5e59069eed3 | C | projjal1/Data-Structures-and-Algorithm-Codes | /dfs.c | UTF-8 | 1,042 | 4.03125 | 4 | [] | no_license | //Program for DFS using C
#include<stdio.h>
#include<stdlib.h>
//Array to store visited nodes
int v[7]={0,0,0,0,0,0,0}; //7 denotes the no. of vertex
void dfs(int arr[][7],int cur)
{
//Print the visited node
printf("\n%d",cur+1);
//Update visited count
v[cur]=1;
//Find adjacent unvisited nodes
... | true |
98ae787ff48714eaf797f69a1da4d2f426dae6e0 | C | juniosalome/Estruturas-Basicas | /arvbb.c | UTF-8 | 2,184 | 3.125 | 3 | [] | no_license | #include "arvbb.h"
Arv* arvore_cria(void) {
return NULL;
}
Arv* arvore_insere(Arv* a, tipoItem v) {
if (arvore_busca(a, v) == 1)
return a;
if (a == NULL) {
a = (Arv*) malloc(sizeof (Arv));
strcpy(a->palavra.nome, v.nome);
a->esq = a->dir = NULL;
} else if (strcmp(v.no... | true |
18b94979c2ecf1c994048471aad9b899ae85febd | C | anmol1455/C | /sssss.c | UTF-8 | 298 | 3.3125 | 3 | [] | no_license | #include "stdio.h"
void main()
{
int a,i,b,c[10]={10,20,30,40,50};
printf("\nEnter number position");
scanf("%d",&a);
printf("\nEnter number to insert");
scanf("%d",&b);
for(i=4;i>=a-1;i--)
{
c[i+1]=c[i];
}
c[a-1]=b;
printf("All numbers are\n");
for(i=0;i<6;i++)
{
printf("%d\t",c[i]);
}
}
| true |
f9881034b9f9589f134ab438cb59d03dfaed2d24 | C | Angstelk/WDP_list3 | /lista3/stack/stack.c | UTF-8 | 1,498 | 3.75 | 4 | [] | no_license | #include <stdio.h>
#include "stack.h"
#include <stdlib.h>
#include <assert.h>
int empty( struct node** top)
{
return(*top== NULL); // jesli pusta true
}
void push(char i, struct node ** top)
{
struct node *new_node = malloc (sizeof (struct node));
new_node->val=i;
new_node->next=*top;
*top=new_node;
}
int pop(st... | true |
500927c15eb4ff06f730f7921df8f4a95e1eac23 | C | onlinedj/native_test | /test/size.c | UTF-8 | 427 | 3.15625 | 3 | [] | no_license | #include <stdio.h>
int main(int argc, char** argv)
{
printf("the char size is %ld\n",sizeof(char));
printf("the short size is %ld\n",sizeof(short));
printf("the int size is %ld\n",sizeof(int));
printf("the long size is %ld\n",sizeof(long));
printf("the float size is %ld\n",sizeof(float));
print... | true |
027817addcf71ef22a62bbb31190b369d4f4fa56 | C | jackskiss/jack-fancycode-samples | /usbdetect/usbdetect.c | UTF-8 | 530 | 3 | 3 | [] | no_license | #include <stdio.h>
#include <sys/stat.h>
#include <string.h>
#include <dirent.h>
//#define NULL 0
#define PROC_DEV_PATH "/proc/dev"
int main(int argc, char ** argv)
{
DIR *pDir;
struct dirent *pEnt;
struct stat fstat;
pDir = opendir (PROC_DEV_PATH);
if(!pDir) {
fprintf(stdo... | true |
e59ccb4007675f62289bb4e05324ec1f25b3c534 | C | muthusamymukesh/mmr1 | /mm43.c | UTF-8 | 222 | 2.71875 | 3 | [] | no_license | #include<stdio.h>
#include<string.h>
void main()
{
char b[100],a[100];
printf("Enter the string 1");
scanf("%s\n",&a);
printf("\nEnter the string 2");
scanf("\n%s",&b);
printf("\n%s%s",a,b);
}
| true |
769d2334457ec8912b6b418a0b8946a9ec8b7622 | C | cding2/f21-cse20312 | /Lec02_Ex/void.c | UTF-8 | 254 | 2.8125 | 3 | [] | no_license | #include <stdio.h>
#include <stdlib.h>
int main( void ){
// fprintf( stdout, "Hello, World %p\n", stdout );
int size = -13 * sizeof( char );
void* hello = malloc( size );
fprintf( stdout, "%p %p\n", &hello, hello );
free( hello );
return 0;
}
| true |
ddf3b2c5b9ecc356bf9dd6730a96d7d1f74ef70e | C | Iniesta8/dsp_stuff | /main.c | UTF-8 | 1,182 | 2.84375 | 3 | [] | no_license | #include <stdio.h>
#include "kiss_fft.h"
#include "kiss_fftr.h"
kiss_fft_cpx *copycpx(float *mat, int nframe) {
int i;
kiss_fft_cpx *mat2;
mat2 = (kiss_fft_cpx *) KISS_FFT_MALLOC(sizeof(kiss_fft_cpx) * nframe);
kiss_fft_scalar zero;
memset(&zero, 0, sizeof(zero));
for (i = 0; i < nframe; i++) {... | true |
672f8fa77d20d504c638fede6dedb0aabe20cee4 | C | Shrutig0411/Analysis-of-Page-Replacement-Algorithms | /LRU.c | UTF-8 | 2,221 | 3.421875 | 3 | [] | no_license | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
static bool hash[101]={false};
struct Node {
int data;
struct Node* next;
};
struct Queue {
struct Node *front;
struct Node *rear;
struct Node *curr;
int capacity,size;
};
struct Node* newNode(int value)
{
struct Node* temp = (st... | true |
a4082a7319a3622fa2129c3d8843c67e56e434f2 | C | Banezi/ProgSys | /tp4/blur.c | UTF-8 | 1,865 | 3.015625 | 3 | [] | no_license | #include "image.h"
#include <unistd.h>
#include <string.h>
#include <sys/types.h>
#include <sys/wait.h>
int main(int arg_count, char **args)
{
if(arg_count == 4)
{
pid_t wpid;
int status = 0;
struct image input = make_image_from_file(args[1]);
struct image output = make_image(input.type, input.row_count, inp... | true |
47b04cbc9ff31b1d770125bd9938128093e95682 | C | Conhan93/Disco-Shield | /src/main.c | UTF-8 | 1,073 | 2.515625 | 3 | [] | no_license | #include "serial.h"
#include "schedule.h"
#include "state.h"
#include <timer.h>
#include <peripherals\switches\switch.h>
#include <peripherals\potentiometer\pot.h>
#include <peripherals\rgb_led\rgb_led.h>
#include <shell.h>
void init_shell();
void check_peripherals();
void init_peripherals();
int main(void) {
in... | true |
b2b565f3af065fa5ecd362c5faab96435768a10c | C | Prashant171/Projects | /dsa_and_dma/DSA FINAL/home.c | UTF-8 | 53,420 | 2.9375 | 3 | [] | no_license | #include "computer.h"
#include "online.c"
///Function Name : selec
///Description : To select mode of shopping
///Input Params : start,order,soft,wake
///Return : void
void selec(COMPUTER* start,ORDER* order,SOFTWARE* soft,QUEUE* wake)
{
int choice,chh;
system("cls");
printf(" ... | true |
325344852dbc0726814581d303a9a1c5479e80d6 | C | honigwald/nos | /driver/uart.c | UTF-8 | 2,494 | 2.53125 | 3 | [] | no_license | #include "uart.h"
// +=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
// flag register bits
#define TXFE (1 << 7)
#define RXFF (1 << 6)
#define TXFF (1 << 5)
#define RXFE (1 << 4)
#define BUSY (1 << 3)
#define CTS (1 << 0)
// dr register bits
#define OE (1 << 11)
#define BE (1 << 10)
#defin... | true |
40e74b2fae486015fd37d38427c8c88dd8aa93f4 | C | savio-matheus/exercicios | /IP/Lista Strings/ex09.c | UTF-8 | 560 | 3.609375 | 4 | [
"MIT"
] | permissive | // Sequência espelho
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
main()
{
int num1, num2, testes, i, j = 0;
char numChar[5];
scanf(" %d", &testes);
for(testes; testes > 0; testes--)
{
scanf(" %d%d", &num1, &num2);
for(i = num1; i <= num2; i++)
{
sprintf(numChar, "%d", ... | true |
18b03f37d268398c2e4a181a35dc973dc8ce153b | C | onemid/DS-PROGRAM-IN-C | /DS_HW2_Dijkstra/DS_HW2_Dijkstra/main.c | UTF-8 | 3,073 | 2.953125 | 3 | [] | no_license | //
// main.c
// DS_HW2_Dijkstra
//
// Created by GONG, YI-JHONG on 2015/11/20.
// Copyright © 2015年 GONG, YI-JHONG. All rights reserved.
// NOTE: There is a known issue for reading large input.
#include <stdio.h>
#define MAX_GRAPH 2048
#define INF MAX_GRAPH * MAX_GRAPH
#define TRUE 1
#define FALSE 0
int cost[MA... | true |
f61ca5f06d4bd2b69d6dec8e50a328b3c6a41634 | C | mtreviso/university | /Estrutura de Dados I/Arquivos/ex1.c | UTF-8 | 567 | 3.671875 | 4 | [] | no_license | #include <stdio.h>
int main(int argc, char *argv[]){
FILE * myarquivo;
char texto;
if(argc < 2){
printf("Por favor, informe o nome de arquivo que deseja ler como parametro do programa.");
exit(1);
}
myarquivo = fopen(argv[1], "r");
if(myarquivo == NULL){
pri... | true |
ad9b502784445ea16a1632f4c48171cb565d105b | C | cansou/msvcrt | /src/time.c | UTF-8 | 2,121 | 2.859375 | 3 | [] | no_license | /***
*time.c - get current system time
*
* Copyright (c) Microsoft Corporation. All rights reserved.
*
*Purpose:
* defines _time32() - gets the current system time and converts it to
* internal (__time32_t) format time.
*
***********************************************************************... | true |
0b4af41892823c694016a254cf2b10bb679a957b | C | samlee916/Learn-C-Programming-Language-And-Become-A-Pro-C-Programmer | /C15.c | UTF-8 | 331 | 3.25 | 3 | [] | no_license | #include <stdio.h>
#include <stdlib.h>
//A C example about or statements
int main() {
char answer;
printf("Do you like bagels? (Y/N)?: \n");
scanf(" %c", &answer);
if((answer == 'Y') || (answer == 'N')) {
printf("Great me too!");
} else{
printf("Aww you suck.");
}
re... | true |
3291cfb9068224e2f18d454d0aa2f05d0abf71a1 | C | rhp7rholype/OOPC | /source/include/type.h | UTF-8 | 10,074 | 2.5625 | 3 | [
"Apache-2.0"
] | permissive | //
// Created by kenhuang on 19-10-20.
//
#ifndef type_H
#define type_H
typedef long (* Function)();
typedef unsigned char boolean; /* Boolean value type. */
typedef unsigned long int uint32; /* Unsigned 32 bit value */
typedef unsigned short uint16; /* Unsigned 16 bit value */
typedef uns... | true |
b7953a75d7779d995bdeac05c0ac7422cfcd1007 | C | palmharbortech/water_level_monitor | /pht_water_level_lte/adc.c | UTF-8 | 1,438 | 2.859375 | 3 | [
"MIT"
] | permissive | #include "adc.h"
#include <avr/io.h>
void adc_setup(void) {
// No interrupts (should be already off)
// The ADC voltage reference is selected by writing the REFS[1:0] bits in the ADMUX register
//ADMUX &= ~(1 << REFS1) & ~(1 << REFS0); // VCC (3.4v) used as analog reference, disconnected from PA0 (AREF)
... | true |
7d69abe19422c21fa6432389356c64beedde81a3 | C | SabrinaCavalheiro/LP2020-1 | /SEMANA01_q06.c | UTF-8 | 903 | 3.984375 | 4 | [] | no_license | // Questão 6) [SEMANA01_q06.c] Escreva um programa em C que receba um número inteiro o imprima por
// extenso em inglês.
// Entrada: um número inteiro de 0 a 9.
// Saída: Uma linha contendo o número por extenso no idioma inglês
// #include <stdio.h>
// int main(){
// int num;
// scanf("%i",&num);
// switch(num){... | true |
424a27f51234d6f657dafe23ea81bc17e02134e7 | C | hirvi-woof/OS-course | /10_task/task.c | UTF-8 | 725 | 3.296875 | 3 | [] | no_license | #include <stdio.h>
#include <sys/types.h>
#include <unistd.h>
#include <wait.h>
#include <stdlib.h>
int main(int argc, char **argv) {
pid_t pid, werr;
int err;
int status = 0;
if (argc < 2) {
err = printf("error - not enough arguments; usage: %s prog_name\n", argv[0]);
exit(-1);
}
... | true |
03562d8fce5bfd27cc72ddf80b8542aba8fe8868 | C | OpenVnmrJ/OpenVnmrJ | /src/IMAGE/user_templates/ib_initdir/math/functions/src/circ.c | UTF-8 | 1,811 | 2.65625 | 3 | [
"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.
*/
/*
*/
/* circ: Approximates object with circle */
#include "imagemath.h"
... | true |
674e666ea0e1e9e7bad654c0bae8a7fcc6e4fb62 | C | dilanderin/deitelchtp | /chapter2/ex_2_17.c | UTF-8 | 533 | 4.375 | 4 | [] | no_license | #include <stdio.h>
#include <stdlib.h>
/*
Write a program that prints the numbers 1 to 4 on the same line.
Write the program using the following methods.
a) Using one printf statement with no conversion specifiers.
b) Using one printf statement with four conversion specifiers.
c) Using four printf statements.
Exercis... | true |
a0135b6eabce17103951b2d71ee41a463bdb9029 | C | kunata928/fdf | /srcs/fdf_color.c | UTF-8 | 2,016 | 2.671875 | 3 | [] | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* fdf_color.c :+: :+: :+: ... | true |
d8b6d9b21e85270e8fccefa72c18f13055bef511 | C | sravani-kaza/Linux_shell | /pinfo.c | UTF-8 | 1,425 | 2.546875 | 3 | [] | no_license | #include<stdio.h>
#include<stdlib.h>
#include<unistd.h>
#include<pwd.h>
#include<sys/stat.h>
#include<sys/types.h>
#include<dirent.h>
#include<errno.h>
#include<string.h>
#include <netdb.h>
#include <sys/param.h>
#include <sys/wait.h>
#include <sys/dir.h>
#include <grp.h>
#include <time.h>
#include <locale.h>
#include ... | true |
89b72082af16d9ed0b559a4868f61366cc69bdf7 | C | h404j/c-test1 | /test/day1/lab2-4.c | UTF-8 | 1,335 | 3.390625 | 3 | [] | no_license | #include <stdio.h>
int main()
{
int a = 2;
int b = 0;
int tic1 = 0;
int tic2 = 0;
int fi[6] = {0, 0, 0, 0, 0, 6};
int ec[7] = {0, 0, 0, 0, 0, 0, 6};
while (a != 0)
{
/* code */
printf("Please type 1 for “first class”\n");
printf("Please type 2 for “economy”\n");
... | true |
ea6913de846b992112a4c2f5758a8c925f45fe44 | C | 44652499/embedded | /mycode/c/SchoolGuideMap.c | UTF-8 | 19,013 | 2.828125 | 3 | [] | no_license | #define VexNum 10 //顶点个数
#define MAX 36
#define MAXedg 30
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
//linux下的清屏函数,windows下是system("clr")
void clrscr()
{
system("clear");
}
typedef enum
{
DG,DN,UDG,UDN
}GaphKind;//{有向图,有向网,无向网}
typedef int AdjMatrix[MAX][MAX]; //邻接矩阵数组
//矩阵图结构体
typede... | true |
b4763e9a8b08f25c041475b231ca62b601ee8128 | C | tiancaiamao/leetcode | /11.c | UTF-8 | 321 | 3.453125 | 3 | [] | no_license | int maxArea(int* height, int heightSize) {
int i, j, max, tmp;
i = 0;
j = heightSize - 1;
max = 0;
while(i<j) {
tmp = (height[i]<height[j]?height[i]:height[j]) * (j-i);
if (tmp > max) {
max = tmp;
}
if (height[i] < height[j]) {
i++;
} else {
j--;
}
}
return max;
}... | true |
3e38707a717f5ca9f5246346e436f2c41f96dcb8 | C | LacErnest/College-Courses | /code/abhay.c | UTF-8 | 540 | 3.765625 | 4 | [] | no_license | #include<stdio.h>
#include<math.h>
int decimaltooctal(int decimalnumber);
int main()
{
int decimalnumber,R;
printf("\nenter a decimal no.");
scanf("%d",&decimalnumber);
R=decimaltooctal(decimalnumber);
printf("\noctal of %d =%d",decimalnumber,R);
return 0;
}
int decimaltooctal(int decimal... | true |
b5ae3573250fd370fd74f11aad01a3319c66edd0 | C | isabella232/clock-1 | /firmware/main.c | UTF-8 | 6,770 | 2.703125 | 3 | [] | no_license | /* Name: main.c
* Author: <insert your name here>
* Copyright: <insert your copyright message here>
* License: <insert your license reference here>
*/
#include <avr/io.h>
#include <avr/interrupt.h>
#include <util/delay.h>
#include <util/twi.h>
#include "button.h"
#include "i2cmaster.h"
#include "rtc.h"
// Ports ... | true |
ef80242091d6f7f69f07401815e184d064399702 | C | lkesteloot/alice | /alice4/software/libgl/gyro_test.c | UTF-8 | 497 | 2.875 | 3 | [
"Apache-2.0"
] | permissive |
#include <stdio.h>
#include "gyro.h"
int main()
{
int success = gyro_init();
if (!success) {
return 1;
}
int dx, dy, dz;
int count = 0;
while (1) {
if (gyro_ready()) {
gyro_read(&dx, &dy, &dz);
count++;
if (1) {
printf("%8d %8d %8d %s\n", dx, dy, dz,
gyro_overrun() ? ... | true |
0cd91de55bebc4f92fb0996d6db3b5b32cddd01a | C | richzw/CodeHome | /Maths/x_more_y_array.c | UTF-8 | 2,704 | 3.953125 | 4 | [] | no_license | /*
Q:给定两个数组X和Y，元素都是正数。请找出满足如下条件的数对的数目：
1. x^y > y^x，即x的y次方>y的x次方
2. x来自X数组，y来自Y数组
假设数组X的长度为m，数组Y的长度为n，最直接的暴力法，时间复杂度为O(m*n)，但这样的话，并不需要都是正数这个条件的。
那么，我们该如何优化呢？x^y>y^x，对于x和y来讲，有什么规律呢？该如何发现呢？
这里其实有规律的，大多数的条件下，当y>x的时候，x^y>y^x，但是有一些例外，1，2，3，4几个数，需要特殊的考虑，
比如2^4=4^2。这个大家可以通过在纸上写写画画来得到，相对繁琐，我们就不进一步分析了。
我们可否对... | true |
51d32654bfabca83ad4a54593943a859f2571fe9 | C | ginpei/cclass2017 | /Apr07/ex5-checkbook.c | UTF-8 | 604 | 3.78125 | 4 | [] | no_license | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include "getline2.h"
int main() {
const int max = 8;
char line[max];
float balance = 0;
while (1) {
printf("Type deposit, check or exit > ");
getline2(line, max);
if (strcmp(line, "deposit") == 0) {
printf("How much? > ");
getline2(line, max);... | true |
48b619fc13ec02decba0765a4faeaa2e7678dba0 | C | fkante/libft | /darray/darray_create.c | UTF-8 | 1,504 | 2.578125 | 3 | [] | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* darray_create.c :+: :+: :+: ... | true |
120fddca1736b32a100034a1f61895f7832c2b5d | C | jds0102/osp3 | /main.c | UTF-8 | 20,004 | 3.21875 | 3 | [] | no_license | #include "disk.h"
#include "disk-array.h"
#include <unistd.h>
#include <stdio.h>
#include <stdlib.h>
#include <getopt.h>
#include <string.h>
// Global variables
int verbose = 0;
int level, strip, disks, blockSize; //strip is strip size
struct disk_array * diskArray;
// Error Message for input
void err... | true |
e7c073682c2abaac1ef15bd5b0e54c3b15a7457b | C | himanshushukla254/BugFreeCodes | /Spoj/Arithmetic Progression.c | UTF-8 | 490 | 2.984375 | 3 | [] | no_license | #include<stdio.h>
int main()
{
int t;
long long int x,y,z,a,n,d,i,term;
scanf("%d",&t);
while(t--)
{
scanf("%lld%lld%lld",&x,&y,&z);
n = (2*z)/(x+y);
d = (y-x)/(n-5);
a = x - (2*d);
printf("%lld\n",n);
for(i=0;i<n;i++)
{
... | true |
1c56a2d6198bc918c1e97a5ac89e8d1873c55d23 | C | Laoup/ArchiveTek | /CPE_2014_corewar/asm/func_hexa_tab.c | UTF-8 | 921 | 2.703125 | 3 | [] | no_license | /*
** func_hexa_tab.c for corewar asm in /home/meuric_a/CPE_2014_corewar_ODD/asm
**
** Made by Alban Meurice
** Login <meuric_a@epitech.net>
**
** Started on Tue Apr 7 12:04:16 2015 Alban Meurice
** Last update Sun Apr 12 21:51:23 2015 Moisset Raphael
*/
#include <stdlib.h>
#include "my.h"
#include "asm.h"
int **... | true |
ea329915dd86ea4cbffa2c31cee2eb19e827951b | C | germanoa/compiladores | /src/iks_types.c | UTF-8 | 4,463 | 2.5625 | 3 | [] | no_license | #include <stdio.h>
#include <stdlib.h>
//#include "iks_grammar.h"
#include "iks_tree.h"
#include "iks_stack.h"
#include "iks_ast.h"
#include "iks_types.h"
static inline void __scope_init(scope_t *scope) {
//scope->st = new_iks_stack();
scope->st = new_iks_dict();
scope->next_addr = 0;
}
scope_t *new_scope() {
sco... | true |
322384bdb31b513d7f1f879d49974e2f8d59becd | C | aylwarde/symbolic-integration-project | /trivariate_poly.h | UTF-8 | 8,617 | 2.75 | 3 | [] | no_license | #ifndef TRIVARIATE_POLY_H
#define TRIVARIATE_POLY_H
#include "biv_rationalfns.h"
//AS AN IMPORTANT STRAY FROM THE USUAL:
//trivariate polynomials will be defined with coeffs that are !!rational!! bivariate polys...
//wrt to this arctan stuff we're working in K(a,b)[x] so K(a,b) a field should have quotients...
//when... | true |
b5b7dcd4bfff99b7ed906316995e214712e58bef | C | Jongtek-23/bbbbbbb | /main.c | UTF-8 | 1,985 | 2.734375 | 3 | [] | no_license | #include "philo.h"
void free_clean_mutex(t_all *all, t_philo *philos)
{
int i;
i = 0;
while (i < all->nb_of_philos)
{
pthread_join(philos[i].philo_thread, NULL);
i++;
}
i = 0;
while (i < all->nb_of_philos)
{
pthread_mutex_destroy(&all->forks[i]);
i++;
}
pthread_mutex_destroy(&all->... | true |
779e1e8d13857d65b75f0e6c70095b1a7fcd07f6 | C | GabeOchieng/ggnn.tensorflow | /program_data/PKU_raw/50/2050.c | UTF-8 | 376 | 2.734375 | 3 | [] | no_license | int main()
{
int n,i;
int m[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
scanf("%d",&n);
for(i=0;i<7;i++)
{
if((n+i)%7==5)
{
n=(1+i)%7;//??????
break;
}
}
//printf("first Friday=%d\n",n);
int e=13;
for(i=0;i<12;i++)
{
e=e+m[i];
//printf("%d\n",e);
if(e%7==n)
... | true |
141b495bfc58e3301a63695d64df6bc4a70bb7af | C | ashiqmdx/CS101 | /Week 9/q2.c | UTF-8 | 2,123 | 3.578125 | 4 | [] | no_license | #include <stdio.h>
void print_largest_two(int *array,int size){
int largest01 = 0;
int largest02 = 0;
for (int i = 0 ; i < size; i++){
if(array[i] > array[i+1]){
largest01 = array[i];
}
if(array[i+1] > array[i]){
largest01 = array[i+1];
}... | true |
b9731d77fc9b64fbd43bbb5afb78ab90acb55ca3 | C | wg88719/zybo_samples | /Consolidated_330_SW/src/Clock/clockDisplay.h | UTF-8 | 4,534 | 2.71875 | 3 | [
"MIT"
] | permissive | //*****************************************************************************
// Luke Hsiao
// 4 May 2015
// Interface for displaying the clock
//
// Details:
// Note that the area of the touchscreen will be displayed and scaled usering
// these regions:
// +--+---+---+---+---+---+---+---+---+--+
// | | | ... | true |
e48f7a8859d40cfd460b4086d45109bd513c2652 | C | zwpdbh/cosc242_code | /lab11/lab11/quicksort.h | UTF-8 | 349 | 2.578125 | 3 | [] | no_license | //
// quicksort.h
// lab11
//
// Created by zwpdbh on 8/16/16.
// Copyright © 2016 Otago. All rights reserved.
//
#ifndef quicksort_h
#define quicksort_h
#include <stdio.h>
extern void quicksort(int *arr, int lowIndex, int highIndex);
int partition(int *arr, int lowIndex, int hightIndex);
void swap(int *x, int *y... | true |
ec3f38a864e383898443d586d70114e193f6a3de | C | VinidhaMoorthi/c-program | /INTEREST.C | UTF-8 | 327 | 3.1875 | 3 | [] | no_license | #include<stdio.h>
#include<conio.h>
void main()
{
int inter;
float p,r,n;
clrscr();
printf("Enter principle amount:\n");
scanf("%f",&p);
printf("Enter no.of years:\n");
scanf("%f",&n);
printf("Enter rate of interest:\n");
scanf("%f",&r);
inter=(p*n*r)/100;
printf("Simple Interest=%d",inter);
getch();
}
... | true |
c938bcf1bd4180f6b1b3d4c4cc0bab0fab2e292e | C | supratik-bhattacharya-2020/Compiler-Construction | /token.c | UTF-8 | 550 | 2.921875 | 3 | [] | no_license | /*
BATCH NO. 27
Mayank Agarwal (2014A7PS111P)
Karan Deep Batra(2014A7PS160P)
*/
#include <stdlib.h>
#include <string.h>
#include "token.h"
tokeninfo* makeToken(char* tokenname, char* lexeme, int linenumber)
{
tokeninfo* temp = (tokeninfo*)malloc(sizeof(tokeninfo));
int l = strlen(tokenname);
temp->tokenname = (cha... | true |
720473a06e3aa0cc29f0600012560d398d4d2c13 | C | liupanpan/ZD | /src/xsal_i_pend_message_timeout.c | UTF-8 | 1,759 | 2.5625 | 3 | [] | no_license | #include "xsal.h"
#include "xsal_i_assert.h"
#include "xsal_i_time.h"
#include "xsal_i_message_queue.h"
SAL_Message_T* SAL_I_Pend_Message_Timeout(
SAL_Message_Queue_T* queue,
uint32_t timeout_ms)
{
SAL_I_Time_Spec_T time1;
bool wait_for_msg = true;
SAL_Message_Queue_Node_T* msg;
SAL_Message_Queue_No... | true |
ea05553691f8a71590264433f3eb9705f4ca5c61 | C | hcs64/vgm_ripping | /etc/strip_wav/add_silence.c | UTF-8 | 3,930 | 3.109375 | 3 | [
"MIT"
] | permissive | #include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>
#include <stdint.h>
#include <string.h>
#define CHECK_ERROR(condition,message) \
do {if (condition) { \
fprintf(stderr, "%s:%d:%s: %s\n",__FILE__,__LINE__,__func__,message); \
exit(EXIT_FAILURE); \
}}while(0)
#define CHECK_ERRNO(condition, message) ... | true |
4183c5049147c4f94531d4a716381e53205c3e7f | C | Ikhsanhaw/tisigram2017 | /public_html/2015/secret-2e44fac40ce121fc2afdc4cd9bbfe607/2811/source/source.c | UTF-8 | 399 | 3.125 | 3 | [
"MIT"
] | permissive | #include <stdio.h>
#include <string.h>
int main() {
char A[101], B[201];
int i, j;
gets(A);
for (j = 0,i = 0; i < strlen(A); ++i) {
putchar(A[i]);
switch(A[i]) {
case 'a' : { printf("pa"); } break;
case 'i' : { printf("pi"); } break;
case 'u' : { printf("pu"); } break;
case 'e' : { printf("pe"); }... | true |
1da0b75998e0867c5ae769676da502315afd456c | C | SmokyTail/OldProjects | /Other labs/Объектно-ориентированное программирование. Язык Си/Вариант 9/Lab01/Lab01.3.c | UTF-8 | 253 | 3.03125 | 3 | [] | no_license | #include <stdio.h>
#include <conio.h>
#include <math.h>
int main()
{
int n, sum;
printf("n = ");
scanf("%d",&n);
while (n>0)
{
sum+=n%10;
n=n/10;
}
printf("sum = %d", sum);
return 0;
} | true |
aa7e964d51e6acd35c88be3f2ccb1ec701dfc332 | C | RomanPay/fractol | /src/workshop.c | UTF-8 | 3,568 | 2.5625 | 3 | [] | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* workshop.c :+: :+: :+: ... | true |
3bb88d68ebe76faf55c3f4dd9c133d21f3e08814 | C | kishima/mrubyc | /src/c_numeric.c | UTF-8 | 8,003 | 2.8125 | 3 | [
"BSD-3-Clause"
] | permissive | /*! @file
@brief
mruby/c Fixnum and Float class
<pre>
Copyright (C) 2015-2018 Kyushu Institute of Technology.
Copyright (C) 2015-2018 Shimane IT Open-Innovation Center.
This file is distributed under BSD 3-Clause License.
</pre>
*/
#include "vm_config.h"
#include "opcode.h"
#include <stdio.h>
#includ... | true |
d3d3e418994f8265844beb8de018c5c4f09d825c | C | lucasedng/data-structures-and-algorithms-II | /radixsort.c | ISO-8859-1 | 3,694 | 4 | 4 | [] | no_license | //Lucas Eduardo Nogueira Gonalves, 122055 (Integral)
#include <stdio.h>
#include <stdlib.h>
void Imprimevetor(int n, int *vet) /* funo de impresso */
{
int i;
for (i = 0; i < n; i++)
printf("%d ", vet[i]);
printf("\n"); /* pula uma linha */
}
int EncontraMaior(int n, int *vet) /* funo ... | true |
926995674817390558ace9ce0440a573cbcc5836 | C | Hari851/Storage-Manager | /Database_implementations/Btree_manager/expr.c | UTF-8 | 6,293 | 2.828125 | 3 | [] | no_license | #include <string.h>
#include <stdlib.h>
#include "dberror.h"
#include "expr.h"
#include "tables.h"
// implementations
RC
valueEquals (Value *left, Value *right, Value *result)
{
if(left->dt != right->dt)
THROW(RC_RM_COMPARE_VALUE_OF_DIFFERENT_DATATYPE, "equality comparison only supported for values... | true |
2f84d4e803210bf95514920f7dc3b057de1d581a | C | chuckmasucci/spacegame | /src/sprite.c | UTF-8 | 2,368 | 2.78125 | 3 | [] | no_license | #include <SDL2/SDL.h>
#include <SDL2/SDL_image.h>
#include <stdio.h>
#include <list.h>
#include "animate.h"
#include "dbg.h"
#include "flags.h"
#include "sprite.h"
#include "gfx.h"
Sprite *create_sprite(char *id, char *path, int frames, SDL_Rect *size, SDL_Rect *mask, void *animation)
{
Sprite *sprite = malloc(siz... | true |
fbe76bf6bab06f5b2e12ac432a9dcff919d83838 | C | StasKarpov/SOI | /Producer–consumer problem/main.c | UTF-8 | 6,120 | 3.046875 | 3 | [] | no_license | /* version where reders can read all items in a row
/* they dont wait for consumer */
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/wait.h>
#include <sys/shm.h>
#include <time.h>
#include <errno.h>
#include <sys/types.h>
#include <signal.h>
#include <semaphore.h>
#include <pthread.h>
#defin... | true |
147e2795b998772c74438fb44ce8c1e1e27abc7e | C | isabella232/AnghaBench | /source/Craft/src/extr_sign.c_sign_list_remove.c | UTF-8 | 1,088 | 2.671875 | 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 |
3509f061458fd8ad78628887897a2a5e78ce6b0d | C | brainail/.happy-coooding | /AlgoKit (3rdp)/Code-store v1.0/code-jam/lib/code2/Parsing/infix_eval.cpp | UTF-8 | 4,728 | 3.640625 | 4 | [] | no_license | /* Parsing: Evaluating Arithmetic Expressions
=================================================================
Description: Given a infix expression in a string, the parser
evaluates the string and reports errors if the
parsing fails or the evaluation causes a division by
... | true |
66298aab3957503bd49c5c674e2b61fc85251736 | C | liaoyouhua1990/OOPC | /OOPC/源码/Chap-17/cx17-ap6/CX17-AP6.C | UTF-8 | 1,305 | 3.390625 | 3 | [] | no_license | /* cx17-ap6.c */
#include "stdio.h"
#include "malloc.h"
#define CLASS(type)\
typedef struct type type; \
struct type
#define CTOR(type) \
void* type##New() \
{ \
struct type *t; \
t = (struct type *)malloc(sizeof(struct type));
#define FUNCTION_SETTING(f1, f2) t->f1 = f2;
#define END_CTOR return (void*)t; };... | true |
c0a6e3339350adfe270a2e4cc3cfe84680a4d0f3 | C | azhuoinfogs/gs | /pthread/rw_pthread.c | UTF-8 | 1,226 | 3.46875 | 3 | [] | no_license | #include <stdio.h>
/**
* 两个读线程读取数据，一个写线程更新数据
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <pthread.h>
#define READ_THREAD 0
#define WRITE_THREAD 1
int g_data = 0;
pthread_rwlock_t g_rwlock;
void *func(void *pdata)
{
int data = (int)pdata;
while (1) {
if (READ_THREAD == d... | true |
bcd66c026348b38b07828ff0f5a64392159e5972 | C | yandl5/C_Scripts | /scripts/questao.c | ISO-8859-1 | 813 | 3.734375 | 4 | [] | no_license | #include <stdio.h>
#include "math.h"
int main()
{
int v[20], i, j, maiorIndice;
int maiorDiferenca, auxiliar;
for(i=0;i<20;i++)
{
printf("Digite um valor para o vetor:\n");
scanf("%d",&v[i]);
}
for(i=0;i<20;i++)
{
printf("%d\n",v[i]);
}
maiorInd... | true |
922f565b32476de036abd5a111aca9e2136ab445 | C | edward-wu-19/05-That-way-madness-lies | /work05.c | UTF-8 | 1,574 | 3.34375 | 3 | [] | no_license | #include <stdio.h>
int main(){
char c = 'g';
int i = 10;
long l = 1;
char *cp = &c;
int *ip = &i;
long *lp = &l;
printf("*cp (oct): %o\t*cp (hex): %x\n", cp, cp);
printf("*ip (oct): %o\t*ip (hex): %x\n", ip, ip);
printf("*lp (oct): %o\t*lp (hex): %x\n", lp, lp);
printf("The a... | true |
849a8495b9991a8b76c8f68308e67803e01b4ebb | C | awm/loglib | /source/port/mswin/gettime.h | UTF-8 | 1,240 | 2.84375 | 3 | [
"BSD-2-Clause"
] | permissive | /**
* @file port/mswin/gettime.h
* @copyright 2021 Andrew MacIsaac
* @remark
* SPDX-License-Identifier: BSD-2-Clause
*
* @brief Port implementation to obtain time on Windows platforms.
*/
#ifndef PORT_MSWIN_GETTIME_H_
#define PORT_MSWIN_GETTIME_H_
#include "ll_internal.h"
#if HAVE__FTIME_S
... | true |
491b6631d883d87f9f4c7b772fcb43188ce9f55d | C | unbun/computer-systems-sp19 | /hw04/unnas-hw04/hashmap.c | UTF-8 | 2,105 | 3.09375 | 3 | [] | no_license |
#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include <assert.h>
// See "man strlcpy"
#include <bsd/string.h>
#include <string.h>
#include "hashmap.h"
// using pair functions from lecture
void
free_pair(hashmap_pair* pp)
{
if (pp) {
free(pp->key);
free(pp);
}
}
int
hash(char* ... | true |
9977fcf1bb204b2f995187ed061eb8a32c400790 | C | ljca/mybackup | /src_note/develop/c-src/arm-src/src/rfromf.c | UTF-8 | 386 | 2.71875 | 3 | [] | no_license | /*
* File Name: file_read4.c
* Create Date: 2016年12月05日 星期一 11时20分13秒
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct readFF
{
int num;
char str[15];
struct readFF *next;
};
int
main ()
{
return 0;
}
void
readed ()
{
FILE *fp = NULL;
fp = fopen ();
if (NULL != fp)
{
int ... | true |
6469733f6a40512b6a32eed4f179bc04ce0c4fed | C | Omar-19/study-ncurses | /color_blink.c | UTF-8 | 2,427 | 3 | 3 | [] | no_license | #include "ncurses.h"
/*
A_NORMAL нормальный, переустановка всего остального
A_STANDOUT наиболее яркий режим
A_UNDERLINE подчеркивание
A_REVERSE обратное изображение
A_BLINK мигание
A_DIM тусклый или полуяркий режим
A_BOLD жирный шрифт
A_ALTCHARSET использование альтернативной символьной таблицы
A_INVIS невид... | true |
42117bf71c5901c7c0959f1a3105420896705e4c | C | shijupk/YanOS | /kernel/src/common/logger.c | UTF-8 | 6,202 | 2.609375 | 3 | [] | no_license | #include <logger.h>
#include <stdarg.h>
#include <stdint.h>
#include <string.h>
#include <kernel.h>
#include <serial.h>
#define PR_LJ 0x01
#define PR_CA 0x02
#define PR_SG 0x04
#define PR_64 0x08
#define PR_32 0x10
#define PR_WS 0x20
#define PR_LZ 0x40
#define PR_FP 0x80
#define PR_BUFLEN 32
int string_format(const... | true |
11a89968bbde49ce68a5d5c9c3b5e81eacdee177 | C | serena-zhu/fdf | /errors_free_close.c | UTF-8 | 1,719 | 2.921875 | 3 | [] | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* errors_free_close.c :+: :+: :+: ... | true |
af2a0e4684e9f7c7f7245c08e019463db332fde2 | C | LeMinhTinh/Broblocks | /QT/SS_LinuxSampleCode/ss-src-2/exec/exec.c | UTF-8 | 771 | 3.53125 | 4 | [] | no_license | /*
* Program demonstrating the use of execl()
*/
#include <stdio.h>
#include <unistd.h>
#include <errno.h>
extern int errno;
int main()
{
char buf[50];
int retVal;
int pid;
printf("The actual pid %d : %d \n",getpid(),getppid());
pid=fork();
if(pid==0)
{
printf("Child pid %d",getpid());
pri... | true |
43b1c838c341e6a91deb887043fa8d87918a8629 | C | alialameldin/SmartEmbeddSystem | /Tiva 2/MCAL/DIO.c | UTF-8 | 2,188 | 2.765625 | 3 | [] | no_license | #include "typedefs.h"
#include "tm4c123gh6pm.h"
#include "DIO.h"
#define HWREG(x) (*((volatile unsigned long *)(x)))
enum Dio_LevelType {
STD_LOW = 0 , STD_HIGH = 1
};
uint8 DIO_ReadPort(uint8 port_index , uint8 pins_mask)
{
switch (port_index)
{
case 0 :
return GPIO_PORTA_DATA_R & pins_mask;
break... | true |
336da26ab174be9277cd318da272e1e8728e5b36 | C | esepunto/cub3D_42 | /libft/ft_hex2int.c | UTF-8 | 1,610 | 3.609375 | 4 | [] | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_hex2int.c :+: :+: :+: ... | true |
35b6af84fd2b1dd09710686739bddadfcff459e5 | C | ahmetzumber/db-management-namedpipe | /program.c | UTF-8 | 1,496 | 2.984375 | 3 | [] | no_license | #include <stdio.h>
#include <string.h>
#include <fcntl.h>
#include <sys/stat.h>
#include <unistd.h>
int main() {
int pipe;
char * myfifo = "/tmp/myfifo";
mkfifo(myfifo, 0666);
char inputQuery[100] = {'\0'};
char result[3600];
char control;
while (1) {
// clean input
f... | true |
34b32b6cac45238af675c0ffad110df5a57cac9e | C | 1168032249alan/punteros | /punteroAFuncion/main.c | UTF-8 | 881 | 2.953125 | 3 | [] | no_license | #include <stdio.h>
#include <stdlib.h>
void funcionBienvenida(char * nombre);
void funcionDespedida (char* nombre);
void fDelega(void(*punteroFuncion)(char* elDato),char * nombre);
//void funcionDespedidaSin(char* nombre);
///void funcionBienvenidaMas(char* nombre);
int main()
{
fDelega(funcionBienvenida... | true |
6dd2571051f5f96396126d8f0d5bda27602777ae | C | Saydur8853/Problem-Solving | /Basic-Operator/URI 1021 Banknotes & Coins.c | UTF-8 | 902 | 3.21875 | 3 | [] | no_license | #include<stdio.h>
int main ()
{
int N1, N2, N;
scanf ("%d.%d", &N1, &N2);
N = (N1*100)+N2;
printf("Notes:\n");
printf("%d note of TK 100.00\n", N/10000);
N = N % 10000;
printf("%d note of TK 50.00\n", N/5000);
N = N % 5000;
printf("%d note of TK 20.00\n", N/2000);
N = N % 2000;... | true |
adf3a4cb6e82db67429d457327db7a497ccf7821 | C | quakerdocs/quakerdocs | /src/quaker_lib/wasm/search.c | UTF-8 | 11,460 | 3.078125 | 3 | [
"MIT"
] | permissive | /**
* This file contains the search engine backend, for compilation to
* webassembly. This code uses the page data and the prefix tree stored in
* search.h, which are generated during the Python build process, to provide
* the actual search functionality.
*/
#include "search.h"
#define NULL 0
#define WORDS_MAX 6... | true |
956fe7f0f08a380ee30699cdfac895d9974e0258 | C | MiguelCF06/binary_trees | /2-binary_tree_insert_right.c | UTF-8 | 817 | 4.03125 | 4 | [] | no_license | #include "binary_trees.h"
/**
*binary_tree_insert_right - Inserts a node as the right-child of another node
*@parent: is a pointer to the node to insert the right-child in
*@value: is the value to store in the new node
*Return: A pointer to the new node
*/
binary_tree_t *binary_tree_insert_right(binary_tree_t *pa... | true |
76faae2c3aacc0450cdb1005a974b0de502a013e | C | wlampert/COA1-2Projects | /linkedlist.c | UTF-8 | 3,633 | 4.0625 | 4 | [] | no_license | #include "linkedlist.h"
#include <stdio.h>
#include <stdlib.h>
/* reference solution provided with assignment description */
void ll_show(ll_node *list) {
ll_node *ptr = ll_head(list);
putchar('[');
while(ptr) {
if (ptr->prev) printf(", ");
if (ptr == list) putchar('*');
printf("%d"... | true |
6655984ac14263b83c0988409f8564066e7ff254 | C | ludimus/onlinejudge | /499/499.c | UTF-8 | 640 | 3.21875 | 3 | [] | no_license | #include <stdio.h>
int ischar(char c){
int r;
r=-1;
if((c>='A') && (c<='Z')) r=1;
if((c>='a') && (c<='z')) r=1;
return(r);
}
int main(){
char s[1024];
int sl,i,H,A[256];
while (gets(s)){
sl=strlen(s);
for(i=0;i<256;i++)
... | true |
734d8b1105d39b93cf5fddabe1f164ee394c079c | C | Missingrakan/DataStructure | /Dlist/Dlist/dlist.h | UTF-8 | 970 | 2.640625 | 3 | [] | no_license | #ifndef _DLIST_H_
#define _DLIST_H_
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <stdbool.h>
#define DataType int
typedef struct DListNode
{
struct DListNode *prev;
DataType data;
struct DListNode *next;
}DListNode;
typedef struct DList
{
DListNode *first;
DListNode *... | true |
e24cd0c98cb50c255cbd1f42ccdc90c79e05bd36 | C | durakin/PureCLabs | /Lab3/main.c | UTF-8 | 13,063 | 3.40625 | 3 | [] | no_license | #include <stdio.h>
#include <stdbool.h>
#include <string.h>
#include <malloc.h>
enum SymbolCodes
{
// Перечесление кодов символов для функции ввода строки
BACKSPACE_KEY = 8,
START_CHAR_RANGE = 32,
END_CHAR_RANGE = 126
};
enum OperationsCodes
{
// Перечисление кодов операций для организации главног... | true |
afa600a216816fc95ef5c1fd46ecc174b0c1bfdf | C | fauske/Raspi-DHT11 | /teensy.c | UTF-8 | 568 | 2.828125 | 3 | [] | no_license | #include "DHT.h"
#define DHTPIN 8 // what pin we're connected to
#define DHTTYPE DHT11 // DHT 11
DHT dht(DHTPIN, DHTTYPE);
void setup () {
Serial.begin(9600);
dht.begin;
}
void loop() {
if (Serial.available()) {
int ch = Serial.read();
if ( ch == '1' ) {
float h = dht.readHumidity();
... | true |
66c26f9bb9175644fddc16ca024e21767c342d82 | C | KadAkyna/ADS | /Lobianco/Aula_08_Strings/copia.c | UTF-8 | 204 | 3.015625 | 3 | [] | no_license | #include <stdio.h>
#include <string.h>
void main(void)
{
char livro[128] = "Este texto será perdido com a cópia";
strcpy(livro, "Programação C/C++");
printf("Nome do livro: %s\n", livro);
}
| true |
38630fa428e04b9180f28af72b7b07c696e37ad9 | C | alexmisaip/Octocat | /create.c | UTF-8 | 1,550 | 2.8125 | 3 | [] | no_license | /*
** create.c for create.c in /Users/taing_k/Desktop/octo/taing_k
**
** Made by TAING Kevin
** Login <taing_k@etna-alternance.net>
**
** Started on Fri Jan 22 16:05:20 2016 TAING Kevin
** Last update Fri Jan 22 16:05:46 2016 TAING Kevin
*/
#include "libmy.h"
#include "struct.h"
void createMap(void)
{
t_maze m... | true |
e78baee9fbb5a36570c4e58593c55e0285f1a669 | C | Dead2/squash | /tests/bounds.c | UTF-8 | 7,752 | 2.71875 | 3 | [
"MIT"
] | permissive | #include "test-squash.h"
struct BoundsInfo {
SquashCodec* codec;
uint8_t* compressed;
size_t compressed_length;
};
static void*
squash_test_bounds_setup(MUNIT_UNUSED const MunitParameter params[], void* user_data) {
struct BoundsInfo* info = munit_new (struct BoundsInfo);
info->codec = squash_get_codec (mun... | true |
66fca10ce095810601d9cc61f61467593ecb41e7 | C | matheusfrancisco/computer-engineering-at-UFSC | /3th Semester/Data structure/Topico IV - tree/Exercício com árvore binária.c | WINDOWS-1250 | 3,401 | 3.546875 | 4 | [
"MIT"
] | permissive | /*
rvore binria
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct pessoa{
char nome[25];
int idade;
char endereco[50];
struct pessoa *esquerda, *direita;
}pessoa;
pessoa *criaPessoa(char nome[25], int idade, char endereco[50]);
void insereArvore( pessoa **raiz, pess... | true |
0dc000d5821241e2c958cf7c3650e891d0027fcd | C | TheNunoGomes/clava | /benchmarks/SanDiegoVision/clava/woven_code/script_sift.c | UTF-8 | 1,941 | 2.703125 | 3 | [
"Apache-2.0"
] | permissive | #define _POSIX_C_SOURCE 199309L
#include <stdio.h>
#include <stdlib.h>
#include "sift.h"
#include <time.h>
/********************************
Author: Sravanthi Kota Venkata
********************************/
void normalizeImage(F2D *image) {
int i;
int rows;
int cols;
int tempMin = 10000, tempMax = -1;
row... | true |
a4eba7d4c3586fa21248cf2fb0e0c876107d4b66 | C | Ushacs/Module-3 | /Program-6.c | UTF-8 | 504 | 3.5625 | 4 | [] | no_license | /*Instruction: int solveMeFirst(int a, int b);
where,
a is the first integer input.
b is the second integer input
Return values
sum of the above two integers
Sample Input
a = 2
b = 3
Sample Output
5*/
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int solveMeFirst(int a, int b) {
// ... | true |
8bf224a89b39ebbb21727fc9ac71e14c8d0e53af | C | EyciaZhou/acm | /hdoj/4517.2.c | UTF-8 | 367 | 2.765625 | 3 | [] | no_license | #include <stdio.h>
short map[2005][2005];
int main() {
int m, n;
int x, y, i, j;
while (1) {
scanf("%d %d", &n, &m);
if (n == 0 && m == 0) {
return ;
}
scanf("%d %d", &x, &y);
memset(map, 0, sizeof(map));
for (i = 0; i < n; i++) {
getchar();
for (j = 0; j < m; j++) {
if (getchar() == '*')... | true |