Ip address of my and my neighbour's router are same ! Is it possible??

Ip address of my and my neighbour's router are same ! Is it possible??

Let me guess 192.168.0.1

How is that possible 😂

How is that possible 😂

How is that possible 😂

Can we discuss this in ot?

Ip address of my and my neighbour's router are same ! Is it possible??

You need to learn basics of networking

It's not your public IP but the local one in your private network 🤦‍♂

and lots of pain when you multithread stuff

is anyone familiar w/ n-ary search?

Working with sockets is lots of fun

can you please recommend some articles, im not finding anything on the internet n-ary tree is all over the internet.

can't we do it normally on an array

What is the error?

What is the error?

And way ?

bool compareByLength(pair<string, int> v1, pair<string, int> v2){ return v1.second < v2.second; } sort(dict.begin(), dict.end(), compareByLength); map<string, int> dict; this code is throwing errors.. can you please help out as I'm not getting where the error is

What error?

bool compareByLength(pair<string, int> v1, pair<string, int> v2){ return v1.second < v2.second; } sort(dict.begin(), dict.end(), compareByLength); map<string, int> dict; this code is throwing errors.. can you please help out as I'm not getting where the error is

Why are you sorting map?

use scanf_s

I want to create a dictionary..

In file included from /usr/include/c++/7/algorithm:62:0, from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:65, from test.cpp:1: /usr/include/c++/7/bits/stl_algo.h: In instantiation of ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::_Rb_tree_iterator<std::pair<const std::__cxx11::basic_string<char>, int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(std::pair<std::__cxx11::basic_string<char>, int>, std::pair<std::__cxx11::basic_string<char>, int>)>]’: /usr/include/c++/7/bits/stl_algo.h:4868:18: required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::_Rb_tree_iterator<std::pair<const std::__cxx11::basic_string<char>, int> >; _Compare = bool (*)(std::pair<std::__cxx11::basic_string<char>, int>, std::pair<std::__cxx11::basic_string<char>, int>)]’ test.cpp:66:55: required from here /usr/include/c++/7/bits/stl_algo.h:1969:22: error: no match for ‘operator-’ (operand types are ‘std::_Rb_tree_iterator<std::pair<const std::__cxx11::basic_string<char>, int> >’ and ‘std::_Rb_tree_iterator<std::pair<const std::__cxx11::basic_string<char>, int> >’) std::__lg(__last - __first) * 2, ~~~~~~~^~~~~~~~~ In file included from /usr/include/c++/7/bits/stl_algobase.h:67:0, from /usr/include/c++/7/bits/char_traits.h:39, from /usr/include/c++/7/ios:40, from /usr/include/c++/7/istream:38, from /usr/include/c++/7/sstream:38, from /usr/include/c++/7/complex:45, from /usr/include/c++/7/ccomplex:39, from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:52, from test.cpp:1: /usr/include/c++/7/bits/stl_iterator.h:392:5: note: candidate: template<class _IteratorL, class _IteratorR> decltype ((__y.base() - __x.base())) std::operator-(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_IteratorR>&) operator-(const reverse_iterator<_IteratorL>& __x,

Map is already sorted

Yes it works but why? My teacher said she want to scanf not scan_s

Very readable) Try to make ur comparator as std:: function, lambda or struct with overloaded ()

Yeah Ik but actually in dictionary words are first sorted according to length.. Ex - Hi Hello

Google: std::map with comparator

Visual studio is error name

You can't sort map

Search in Google, how to disable secure errors in visual studio, or just remove VS from your PC

Did that

First link in google gives correct answer

Referred to cppreference: u should pass ur comparator as a class with overloaded call operator, there are some ways to make it: std::function - special class which made all dirty jobs instead of u, just see in docs how to use it struct with overloaded () - see example on cppreference lambda - should I really explain how to use it?

Nahh, you don't need to explain . Thank you very much for pointing me in the correct direction... Thanks once again . I'll read from there

Just click Ctrl+*click on sort function*

https://github.com/jalbam/c_games

And why do we need this here?

Maybe it is useful for someone who wants to learn

Maybe it is useful for someone who wants to learn