Run Code
|
API
|
Code Wall
|
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
informatika / Cinta Avrille X MIPA 5
Bucket Graph Creation
sd2
star print 2
ClassQuiz2
Segment Tree
check Prime
Sieve of Eratosthenes
aaaaaaaaaaaa
derivative