Skip to content

Instantly share code, notes, and snippets.

View devteampentagon's full-sized avatar

Team Pentagon devteampentagon

View GitHub Profile
@devteampentagon
devteampentagon / Prime Numbers - Sieve of Eratosthenes.cpp
Created November 14, 2016 22:21
Prime Numbers - Sieve of Eratosthenes
#include <bits/stdc++.h>
#define MEM(a,b) memset((a),(b),sizeof(a))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define MIN4(a,b,c,d) MIN(MIN(MIN(a,b),c),d)
#define In freopen("In.txt", "r", stdin);
#define Out freopen("out.txt", "w", stdout);
#define i64 long long
@devteampentagon
devteampentagon / Coin Change [Limited Coins].cpp
Created November 14, 2016 22:32
Coin Change [Limited Coins]
#include <stdio.h>
#include <string.h>
int main()
{
int i,j;
int coinNumber;
int coinNumberStore[10];
int highestGivingTotal = 0;
@devteampentagon
devteampentagon / Coin Change [Unlimited Coins].cpp
Created November 14, 2016 22:34
Coin Change [Unlimited Coins]
#include <stdio.h>
#include <string.h>
int main()
{
int i,j;
int coinNumber;
int coinNumberStore[10];
int coinChange[102];
@devteampentagon
devteampentagon / Longest Common Subsequence [LCS].cpp
Created November 14, 2016 22:37
Longest Common Subsequence [LCS]
#include <cstdio>
#include <cstring>
#define max 1000
using namespace std;
char a[max],b[max];
int c[max][max];
int maximum(int x,int y)
@devteampentagon
devteampentagon / Topological Sorting.cpp
Created November 14, 2016 22:39
Topological Sorting
#include<iostream>
#include<string.h>
#include<algorithm>
#define s 100
using namespace std;
typedef struct tag
{
@devteampentagon
devteampentagon / Minimum Edit Distance.cpp
Created November 14, 2016 22:59
Minimum Edit Distance
#include <bits/stdc++.h>
using namespace std;
#define MIN(a,b) ((a)<(b))?(a):(b)
int extra(char lhs,char rhs)
{
if(lhs == rhs)
return 0;
@devteampentagon
devteampentagon / Sum of Digits upto N.cpp
Created November 14, 2016 23:00
Sum of Digits upto N
#include <bits/stdc++.h>
#define MEM(a,b) memset((a),(b),sizeof(a))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define In freopen("In.txt", "r", stdin);
#define Out freopen("out.txt", "w", stdout);
#define limit 10000000
using namespace std;
int dp[limit+5];
@devteampentagon
devteampentagon / Longest Palindromic Subsequence [LCS and LPS].cpp
Created November 14, 2016 23:03
Longest Palindromic Subsequence [LCS and LPS]
#include <bits/stdc++.h>
#define MEM(a,b) memset((a),(b),sizeof(a))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define In freopen("In.txt", "r", stdin);
#define Out freopen("out.txt", "w", stdout);
using namespace std;
class myString
@devteampentagon
devteampentagon / Minimum Spanning Tree [Krushkal].cpp
Created November 14, 2016 23:05
Minimum Spanning Tree [Krushkal]
#include <bits/stdc++.h>
#define MEM(a,b) memset((a),(b),sizeof(a))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define In freopen("In.txt", "r", stdin);
#define Out freopen("out.txt", "w", stdout);
#define m 100
using namespace std;
@devteampentagon
devteampentagon / Breadth First Search [BFS].cpp
Created November 14, 2016 23:08
Breadth First Search [BFS]
#include <bits/stdc++.h>
#define MEM(a,b) memset((a),(b),sizeof(a))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define In freopen("In.txt", "r", stdin);
#define Out freopen("out.txt", "w", stdout);
using namespace std;
vector<int> edge[100], cost[100];