শনিবার, ৪ মার্চ, ২০১৭

Graph related prblm

uva problem :
352,459,469,572,871,260,10336,10946,11244,11518,383,429,762,10009,10116.
lightoj problem:
1094,1066,1111,1141,1174,1238,1257,1337,1049.
# ALGORITHM: Minimum Spanning Tree ?? ???????? ?
Uva problem: 10034,534,544,10048,1174
Lightoj problem: 1002,1029,1040,1041,1059,1123
# ALGORITHM: Minimum Spanning Tree/Dijkstra/Floyd Warshall ?? ???????? ?
Lightoj problems:
Dijkstra/Floyd Warshall : 1002,1019,1099,1174,1281
Minimum Spanning Tree (Repeated): 1002,1029,1040,1041,1059,1123
Uva problems:
Minimum Spanning Tree/Dijkstra/Floyd Warshall :
10986,10034,534,544,10048,1174
Uva: Tropics BFS/MST/Dijkstra/Floyd Warshall and Level 1,2,3,4 Must try
http://uhunt.felix-halim.net/id/166232
Codeforces: Breadth First Search-- solved>2500 Must try
http://codeforces.com/problemset/tags/dfs%20and%20similar?order=BY_SOLVED_DESC

কোন মন্তব্য নেই:

একটি মন্তব্য পোস্ট করুন

Factorization with prime Sieve

vector <int> prime; char sieve[1000009]; int N=1000009; void primeSieve ( ) { sieve[0] = sieve[1] = 1; prime.push_back(2); ...