Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #include <string.h>
- #include <math.h>
- #include <time.h>
- #define _CRT_SECURE_NO_WARNINGS
- #define TLong long long
- // fact(n)
- int fact(int n){
- if(n == 1) return 1;
- else return (n * fact(n - 1));
- }
- // combination(n,r)
- int combination(int n, int r){
- if(r == 0 || r == n) return 1;
- else if(r == 1) return n;
- return (combination(n - 1, r - 1) + combination(n - 1, r));
- }
- // gcd(a,b)
- int gcd(int a,int b){
- int ret;
- ret = (b == 0) ? a : gcd(b, a % b);
- return ret;
- }
- // lcm(a.b)
- int lcm(int a,int b){
- return (a * b) / gcd(a,b);
- }
- // qsort(array, size, sizeof(int),comp);
- int comp(const int *a,const int *b){
- return (*a - *b);
- }
- // append(array,*size,addNum)
- void append(int *array,int *size,int num){
- realloc(array, sizeof(int) * (*size + 1));
- array[(*size)] = num;
- ++(*size);
- }
- // pop(array,*size) & nongetpop(array,*size)
- int pop(int *array,int *size){
- int temp = array[(*size - 1)];
- realloc(array,sizeof(int) * (*size - 1));
- --(*size);
- return temp;
- }
- void nongetpop(int *array,int *size){
- realloc(array,sizeof(int) * (*size - 1));
- --(*size);
- }
- int main(int argc, char const *argv[]){
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement