C++ Version # Constructor #include <bits/stdc++.h> using namespace std; class timer { int n,i,j; clock_t start,end...
Read More
LightOj 1414 February 29
#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...
Read More
UVA 12439 February 29
#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...
Read More
UVA 1727 Counting Weekend Days
#include <bits/stdc++.h> using namespace std; int main() { long long int s,t,i,j,k; string m,day; //freopen...
Read More
UVA 13148 A Giveaway
#include <bits/stdc++.h> using namespace std; int main() { long long int a[21]={1,64,729,4096,15625,46656,117649, ...
Read More
UVA 10107 What is the Median?
#include <bits/stdc++.h> using namespace std; int main() { long long int n,i,j,k,mid,m,a[100005],x,t; vector<l...
Read More
UVA 10986 Sending email
Dikstra algorithm tutorial in Bangla: https://www.shawonruet.com/2019/10/dijkstra-algorithm-step-by-step-in-c.html #include <bi...
Read More
LightOj 1009 Back to Underworld
Hints : Bipartite Approach. Just use two colors to mark Vampires and Lycans. Then find who are maximum . As graph may be disconnected...
Read More
BFS Algorithm in Bangla (ব্রেডথ ফার্স্ট সার্চ বিএফএস)
ব্রেডথ ফার্স্ট সার্চ (বিএফএস) (Breadth First Search [BFS]) ব্রেডথ ফার্স্ট সার্চ (বিএফএস) হল গ্রাফ ট্রাভার্সাল এর একটি পদ্ধতি। গ্রাফ ...
Read More
Graph Adjacent List
#include <bits/stdc++.h> using namespace std; vector<int>edges[1000]; vector<int>cost[1000]; vector<int>o...
Read More
Graph Adjacent Matrix
#include <bits/stdc++.h> using namespace std; int main() { int i,j,n,e,u,v,g[100][100]; cin>>n>>e...
Read More
How to compile and run C++ program From CMD Or Terminal
At first you need to install gcc compiler in your computer . Then create a file (ex: prime.cpp) in your desktop . Next create an input...
Read More
Subscribe to:
Posts
(
Atom
)