Archive for February 2017

Object Oriented Programming Examples

C++ Version # Constructor #include <bits/stdc++.h> using namespace std; class timer { int n,i,j; clock_t start,end...

#include <bits/stdc++.h> using namespace std; int main() { long long int d1,d2,y1,y2,i,j,k,l,n,t,x,y,z,u,w; strin...

#include <bits/stdc++.h> using namespace std; int main() { long long int d1,d2,y1,y2,i,j,k,l,n,t,x,y,z,u,w; strin...

#include <bits/stdc++.h> using namespace std; int main() { long long int s,t,i,j,k; string m,day; //freopen...

#include <bits/stdc++.h> using namespace std; int main() { long long int a[21]={1,64,729,4096,15625,46656,117649, ...

#include <bits/stdc++.h> using namespace std; int main() { long long int n,i,j,k,mid,m,a[100005],x,t; vector<l...

Dikstra algorithm tutorial in Bangla: https://www.shawonruet.com/2019/10/dijkstra-algorithm-step-by-step-in-c.html #include <bi...

Hints : Bipartite Approach. Just use two colors to mark Vampires and Lycans. Then find who are maximum . As graph may be disconnected...

ব্রেডথ ফার্স্ট সার্চ (বিএফএস) (Breadth First Search [BFS]) ব্রেডথ ফার্স্ট সার্চ (বিএফএস) হল গ্রাফ ট্রাভার্সাল এর একটি পদ্ধতি। গ্রাফ ...

#include <bits/stdc++.h> using namespace std; vector<int>edges[1000]; vector<int>cost[1000]; vector<int>o...

#include <bits/stdc++.h> using namespace std; int main() { int i,j,n,e,u,v,g[100][100]; cin>>n>>e...