MᏫᎻᎯᎷᎷᎬᎠ
You're welcome
MᏫᎻᎯᎷᎷᎬᎠ
It's hard to look at an empty file that has only main function and thinking what to do about it?!
Gl_
Ok
Gl_
File
Gl_
Whear is file
Gl_
???
MᏫᎻᎯᎷᎷᎬᎠ
What?!
Gl_
Where is file for programming?
MᏫᎻᎯᎷᎷᎬᎠ
In my laptop
Gl_
Should I Need to Learn to Programming ????
BinaryByter
you SHOULD not
BinaryByter
but if you want to, you can
BinaryByter
Its all about priorities
Gl_
How do you know yes?
MᏫᎻᎯᎷᎷᎬᎠ
I read that
MᏫᎻᎯᎷᎷᎬᎠ
English only
Gl_
Ok
Gl_
Ok
MᏫᎻᎯᎷᎷᎬᎠ
Ok
Gl_
You can do me a guid ...
Gl_
Please
BinaryByter
#private-teacher
MᏫᎻᎯᎷᎷᎬᎠ
I'm fit for giving a simple guide for beginners
MᏫᎻᎯᎷᎷᎬᎠ
You pick a C++ beginner book
Gl_
Ok
Gl_
Give
Gl_
Me
Gl_
Only
MᏫᎻᎯᎷᎷᎬᎠ
Only recommendation
Gl_
English
MᏫᎻᎯᎷᎷᎬᎠ
Hold on
MᏫᎻᎯᎷᎷᎬᎠ
Let me complete the guide
MᏫᎻᎯᎷᎷᎬᎠ
Then
Anonymous
Thats annoying spaming if you need for every word a own message
MᏫᎻᎯᎷᎷᎬᎠ
You google a lot
AlexGamer
Is it possible to get compiled output of c++ program via bot
AlexGamer
?
MᏫᎻᎯᎷᎷᎬᎠ
Is it possible to get compiled output of c++ program via bot
What
That would be a good idea for a bot
AlexGamer
Do you have backend idea?
MᏫᎻᎯᎷᎷᎬᎠ
Actually
MᏫᎻᎯᎷᎷᎬᎠ
It's a great idea
Gl_
No
AlexGamer
I already made a bot which pops up c++ program puzzles.
MᏫᎻᎯᎷᎷᎬᎠ
A bot
That you give a command like /compile
And source code as an argument
MᏫᎻᎯᎷᎷᎬᎠ
How about that @linuxer4fun
MᏫᎻᎯᎷᎷᎬᎠ
Anyway
BinaryByter
already in existance
BinaryByter
but enjoy doing it
BinaryByter
rextester_bot
MᏫᎻᎯᎷᎷᎬᎠ
Thanks
MᏫᎻᎯᎷᎷᎬᎠ
You start a simple project
MᏫᎻᎯᎷᎷᎬᎠ
That you are interested in
MᏫᎻᎯᎷᎷᎬᎠ
Do that a lot
MᏫᎻᎯᎷᎷᎬᎠ
Then contribute in an open source project in GitHub or whatever
BinaryByter
webcpp is looking for contributors
MᏫᎻᎯᎷᎷᎬᎠ
And booom
MᏫᎻᎯᎷᎷᎬᎠ
I read it
MᏫᎻᎯᎷᎷᎬᎠ
Yeah
BinaryByter
Yea lol
MᏫᎻᎯᎷᎷᎬᎠ
It didn't
BinaryByter
I was just kidding ;)
BinaryByter
you should be more confident
Mean Cat
2 points
Suppose we have a directed graph G = (V,E) with V = {1,2,…,n} and E is presented as an adjacency list. For each vertex u in V, out(u) is a list [v1,v2,…,vk] such that (u,vi) in E for each i in {1,2,…,k.
For each u in V, we wish to compute a corresponding list in(u) = [v1,v2,…,vk'] such that (vi,u) in E for each i in {1,2,…,k'.
Let n be the number of vertices in V and m be the number of edges in E. How long would it take to construct the lists in(u), u in V, from the lists out(u), u in V?