C++ Version # Constructor #include <bits/stdc++.h> using namespace std; class timer { int n,i,j; clock_t start,end...
Read More
Home / Archive for February 2017
![LightOj 1414 February 29 LightOj 1414 February 29](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgkKkC1zOEf4AiF4kYWdEFok_4CCrWTdEFJv3jcJDdBYLX0YWkcmot4dqSAezMeyP84QihIqPP6v5VVQ05OtJTbPKack4sr0vHNP4Ti3shjvA69jc4YfNdVAIdEvTO19Nb0t4sVVksm9_pi/s1600/main.png)
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 UVA 12439 February 29](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjcNpdHKsAkxGj6kQoxr3TnYynvrm605k12JGC5rigABQIkousMHfo5ropb6lz4FVqbMqRzy29DElCTm2yRmHSzh92s-Fca-1o9Jqnza-s35dgdNd_1oisnYvdkV03cl7hbaOeTOrAN63P9/s1600/onlineJudgeLogo.png)
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 UVA 1727 Counting Weekend Days](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjcNpdHKsAkxGj6kQoxr3TnYynvrm605k12JGC5rigABQIkousMHfo5ropb6lz4FVqbMqRzy29DElCTm2yRmHSzh92s-Fca-1o9Jqnza-s35dgdNd_1oisnYvdkV03cl7hbaOeTOrAN63P9/s1600/onlineJudgeLogo.png)
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 UVA 13148 A Giveaway](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjcNpdHKsAkxGj6kQoxr3TnYynvrm605k12JGC5rigABQIkousMHfo5ropb6lz4FVqbMqRzy29DElCTm2yRmHSzh92s-Fca-1o9Jqnza-s35dgdNd_1oisnYvdkV03cl7hbaOeTOrAN63P9/s1600/onlineJudgeLogo.png)
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? UVA 10107 What is the Median?](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjcNpdHKsAkxGj6kQoxr3TnYynvrm605k12JGC5rigABQIkousMHfo5ropb6lz4FVqbMqRzy29DElCTm2yRmHSzh92s-Fca-1o9Jqnza-s35dgdNd_1oisnYvdkV03cl7hbaOeTOrAN63P9/s1600/onlineJudgeLogo.png)
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 UVA 10986 Sending email](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjcNpdHKsAkxGj6kQoxr3TnYynvrm605k12JGC5rigABQIkousMHfo5ropb6lz4FVqbMqRzy29DElCTm2yRmHSzh92s-Fca-1o9Jqnza-s35dgdNd_1oisnYvdkV03cl7hbaOeTOrAN63P9/s1600/onlineJudgeLogo.png)
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 LightOj 1009 Back to Underworld](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgkKkC1zOEf4AiF4kYWdEFok_4CCrWTdEFJv3jcJDdBYLX0YWkcmot4dqSAezMeyP84QihIqPP6v5VVQ05OtJTbPKack4sr0vHNP4Ti3shjvA69jc4YfNdVAIdEvTO19Nb0t4sVVksm9_pi/s1600/main.png)
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 (ব্রেডথ ফার্স্ট সার্চ বিএফএস) BFS Algorithm in Bangla (ব্রেডথ ফার্স্ট সার্চ বিএফএস)](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEg80BfOAfGYxdSO8u-cEvLvTSdjc__45ZcB6stT9o4DgTJEz6wMiP23UjGnkmv5lmzBNuCoUfVJR3jluZMkBNwLVHjMWBatEVilrt6sA2vaC0G8Vt8vTAcQzGAsKROOaAebrCYHZ3zMEEXN/s640/bfs.jpg)
BFS Algorithm in Bangla (ব্রেডথ ফার্স্ট সার্চ বিএফএস)
ব্রেডথ ফার্স্ট সার্চ (বিএফএস) (Breadth First Search [BFS]) ব্রেডথ ফার্স্ট সার্চ (বিএফএস) হল গ্রাফ ট্রাভার্সাল এর একটি পদ্ধতি। গ্রাফ ...
Read More
![Graph Adjacent List Graph Adjacent List](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjNu7V2kfg81y-63xF9gpg3F9BhootJSDnCaQ5HcNJE_MCrIZUwg6j4iyCNO5fyOkG8O8qFy1jMGXyENOyM-Wo_m62F7BxCnK7V-Ujo6O9W0rwBn7zF5X6z3_XGBvi6bX9g2rruPUOp3Phh/s640/bfs.jpg)
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 Graph Adjacent Matrix](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjNu7V2kfg81y-63xF9gpg3F9BhootJSDnCaQ5HcNJE_MCrIZUwg6j4iyCNO5fyOkG8O8qFy1jMGXyENOyM-Wo_m62F7BxCnK7V-Ujo6O9W0rwBn7zF5X6z3_XGBvi6bX9g2rruPUOp3Phh/s640/bfs.jpg)
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
Subscribe to:
Posts
(
Atom
)