Ибраги́м
And it's usually written in VB(.NET)/ASP/PHP
Anonymous
Thanks admin😂
Anonymous
Im programmer making application on tools visual studio enterprise 2015
Anonymous
mmm.. hello
Anonymous
hi rose 🤗
Badugar
Dima
Loooool
Badugar
Segmentation Fault.
桃桃乌龙
Anonymous
hi rose
Badugar
(core dumped)
Would that be a complete memory dump of the crashed process along with add. info like state of cpu-registers ?
桃桃乌龙
you can open core dump with gdb
Badugar
桃桃乌龙
桃桃乌龙
on linux it should be in ELF format
桃桃乌龙
Badugar
Admiral
What's the best IDE for C/C++?
Daniele°
Dima
CLion is good
Dima
Xcode if you are on a mac
Admiral
I want one that doesn'e explode
Admiral
I'm on Linux
Dima
CodeLite is fine too
Admiral
CodeBlocks?
Dima
CodeLite
Daniele°
Dima
CodeLite looks more modern than CodeBlocks
Admiral
vim
Don't want to use vim, neovim, emacs, spacemacs or anything like that😂
Daniele°
Admiral
IDE
Dima
everyone who offers vim/whatever need to go back to their caves
Daniele°
IDE
You can turn vim in to ide
Daniele°
Need 2/3 plug-in
Admiral
I know. But I cannot use mouse and I'm not used to keyboard shortcuts. I mean a lot of them.
Daniele°
Dima
Anonymous
Admiral
vscode?
Settled on Code Blocks
Dima
vscode for cxx looool
klimi
Yay another flame war
Anonymous
Anonymous
Dima
because
Anonymous
because?
Anonymous
🤨
Anonymous
come on fast😂
Dima
yeah get some job and receive some really large project and see how it’s uncomfortable to work in vscode, also it gets slow
Dima
just use some traditional ides, that’s all lol.
Anonymous
oh okie👍
Anonymous
H̲i̲L̲e̲v̲e̲l̲
I think, he means start-up companies
Dima
I am not talking about startups.
H̲i̲L̲e̲v̲e̲l̲
ok, e.g. google
Dima
Naw, just some usual companies, outsource or whatever, except startups
klimi
桃桃乌龙
Anyone tried yavide before?
桃桃乌龙
It’s a C/C++ IDE based on vim
Rekha
Why we do programming of percentage,marks using floating point and answer will be error some point?
Anonymous
Rekha
Yes
Anonymous
Give me a game code c and c++
King
Can anyone help me on code and programming I'm a beginner
Anonymous
Hey can someone provide a solution for the problem in c++. poisonous plants on hackerrank. I did solved that problem but not in required time complexity.
Dima
Unless you post your code here and we’ll help
Anonymous
Ok wait
Anonymous
This is the problem https://www.hackerrank.com/challenges/poisonous-plants/problem
Anonymous
I'm posting my code
Anonymous
#include <bits/stdc++.h>
using namespace std;
vector<string> split_string(string);
// Complete the poisonousPlants function below.
int poisonousPlants(vector<int> p) {
 long long int a = p.size();
  long long int ci;
  long long int count = 0;
  while (1) {
    ci = 0;
    for (long long int j = p.size() - 1; j > 0; j--) {
      if (p[j] > p[j - 1]) {
        p.erase(p.begin() + j);
        ci++;
      }
    }
    if (ci == 0)
      break;
    count++;
  }
  return count;
}
int main()
{
    ofstream fout(getenv("OUTPUT_PATH"));
    int n;
    cin >> n;
    cin.ignore(numeric_limits<streamsize>::max(), '\n');
    string p_temp_temp;
    getline(cin, p_temp_temp);
    vector<string> p_temp = split_string(p_temp_temp);
    vector<int> p(n);
    for (int i = 0; i < n; i++) {
        int p_item = stoi(p_temp[i]);
        p[i] = p_item;
    }
    int result = poisonousPlants(p);
    fout << result << "\n";
    fout.close();
    return 0;
}
vector<string> split_string(string input_string) {
    string::iterator new_end = unique(input_string.begin(), input_string.end(), [] (const char &x, const char &y) {
        return x == y and x == ' ';
    });
    input_string.erase(new_end, input_string.end());
    while (input_string[input_string.length() - 1] == ' ') {
        input_string.pop_back();
    }
    vector<string> splits;
    char delimiter = ' ';
    size_t i = 0;
    size_t pos = input_string.find(delimiter);
    while (pos != string::npos) {
        splits.push_back(input_string.substr(i, pos - i));
        i = pos + 1;
        pos = input_string.find(delimiter, i);
    }
    splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1));
    return splits;
}
Anonymous
I'm a noob😅
Pavel
This is the problem https://www.hackerrank.com/challenges/poisonous-plants/problem
So, in array of numbers we need to find in how many iterations we need to do in order to remove any values that are bigger that their previous neighbor, with the given algorithm.
So my thought, that this can be calculated with one iteration over the list. remembering the previous value and trying to eliminate all ascending values after it, and remembering the max step needed to eliminate any ascending values after this specific value.
Pavel
Not sure though
Anonymous
Anonymous
Anonymous
No
Anonymous
Anonymous