Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
algortym A*
#include <iostream> #include<vector> using namespace std; int main() { int tab[][3] = { {3,2,1}, {2,-1,0}, {3,2,1}}; /* int g,h,f; string rodzic; struct wierzcholek { string nazwa; int g; string rodzic; int h; int f; }; vector<struct> lista_otwarta; /* lista_otwarta.push_back("D"); g = 0; h = 2; f = h +g; cout <<lista_otwarta[0]; */ return 0; }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
Pairs having sum equal to target
substr
t>0
Print Euler Path
aaa666
offsetof
Day3
replace-30-Seconds-of-C++
Connected components in complement graph
ამოცანა#3-------From adjacency matrix to the list of edges.
Please log in to post a comment.