I hereby claim:
- I am def-au1t on github.
- I am def_au1t (https://keybase.io/def_au1t) on keybase.
- I have a public key ASA9wOISsT2pyU6Tuz4YBbTrxzcCYz4Gpt_wEBpwRCGaMAo
To claim this, I am signing this object:
I hereby claim:
To claim this, I am signing this object:
#include <stdio.h> | |
#include <stdlib.h> | |
int change_int(int amount, int* coins, int coins_count, int* result, int prev_coin, int depth, int* min_global){ | |
// for(int i=0; i<depth; i++){ | |
// printf(" "); | |
// } | |
// printf("%d:%d ",depth, prev_coin); | |
int res, min_num=100; | |
if(depth>=20 || amount<0) return -1; |
#include <iostream> | |
#include <string> | |
// Uncomment line with "#define DEBUG" if you want to see your hashtable. | |
// But rememeber to send only solutions with debug turned off! | |
//#define DEBUG 1 | |
using namespace std; | |
enum states { |
#include <iostream> | |
#include <cmath> | |
using namespace std; | |
/* | |
1. Proszę zaimplementować następujące operacje na tablicy z haszowaniem: | |
- wstawianie | |
- usuwanie | |
- wyszukiwanie | |
- reorganizacja (usunięcie kluczy zaznaczonych do skasowania) |
#include <stdio.h> | |
#include <stdlib.h> | |
#include <stdbool.h> | |
typedef struct stack { | |
int* elements; | |
int top; | |
int max_size; | |
} stack; |
#include <stdio.h> | |
#include <stdlib.h> | |
#include <stdbool.h> | |
typedef struct point { | |
int x, y; | |
} point; | |
typedef struct queue { | |
int start, end, size; |
#include <stdio.h> | |
#include <stdlib.h> | |
#include <stdbool.h> | |
typedef struct stack { | |
int* elements; | |
int top; | |
int max_size; | |
} stack; |