no, remember rule? 1 line of code, 1 line of comments. better with // TODO: calculates middle point a wierd way, change to middle = (right + left)/2 int middle = left_bound + (right_bound - left_bound) / 2

just wanted to point out that your code changes the semantics and you might not want to do that.

Given an array of positive integers. Your task is to find that element whose value is equal to that of its index value. Input: The first line of input contains an integer T denoting the number of test cases. The first line of each test case is N, size of array. The second line of each test case contains array elements. Output: Print the element whose value is equal to index value. Print "Not Found" when index value does not match with value. Note: There can be more than one element in the array which have same value as their index. You need to print every such element's index separated by a single space. Follows 1-based indexing of the array. Constraints: 1 ≤ T ≤ 30 1 ≤ N ≤ 50 1 ≤ A[i] ≤ 1000 Example: Input: 2 5 15 2 45 12 7 1 1 Output: 2 1 For More Input/Output Examples Use 'Expected Output' option

#include <iostream> using namespace std; int main() { int t;cin>>t; for(int i=0;i<t;i++) { int sz; cin>>sz; int arr[sz]; for(int k=0;k<sz;k++) { cin>>arr[k]; } int count = 0; for(int j=0;j<sz;j++) { if(arr[j]==(j+1)) cout<<arr[j]<<" "; count++; } if(count==0) { cout<<"Not Found"<<endl; } cout<<""<<endl; } return 0; }

what is my error1??

I guess, you output two line breaks when nothing is found

But, the construction cout << "" << endl is really weird

And, you shouldn't create arrays on stack usually

Because stack is limited by 1-2-4-8 MB

But in this task it doesn't play a role, because sz is less than 50, so the array will take less than 50 (size of array) * 4 (size of int) = 200 bytes

And, you shouldn't create arrays on stack usually

agreed, C++ does not support VLAs (you can create arrays on the stack if you know the size in advance)

Hhhhhhhh

agreed, C++ does not support VLAs (you can create arrays on the stack if you know the size in advance)

Well, I guess that's wrong #include <iostream> int main() { int a[(int)1e7]; for (int i = 0; i * 1024 < 1e7; ++i) { a[i * 1024] = 1; } } This program crashes with SIGSEGV during the array declaration

just wanted to point out that your code changes the semantics and you might not want to do that.

Another example of that change is changing: i++ to i -=- 1

Perfect, symmetric construction, but absolutely meaningless

Well, I guess that's wrong #include <iostream> int main() { int a[(int)1e7]; for (int i = 0; i * 1024 < 1e7; ++i) { a[i * 1024] = 1; } } This program crashes with SIGSEGV during the array declaration

Because of your compiler/system or the language?

Because of your compiler/system or the language?

hmm, I use g++ 9.3.0

agreed, C++ does not support VLAs (you can create arrays on the stack if you know the size in advance)

VLA is also on the stack btw.

Well, I guess that's wrong #include <iostream> int main() { int a[(int)1e7]; for (int i = 0; i * 1024 < 1e7; ++i) { a[i * 1024] = 1; } } This program crashes with SIGSEGV during the array declaration

Stack overflow

Stack overflow

Yes, that's my point

VLA is also on the stack btw.

I know, but the language C++ does not support VLAs, it's basically an extension of many compiler vendors since they support it in c anyway

I know, but the language C++ does not support VLAs, it's basically an extension of many compiler vendors since they support it in c anyway

Ah, I got what you meant, yes

I know, but the language C++ does not support VLAs, it's basically an extension of many compiler vendors since they support it in c anyway

It's in C99 standard if I'm not mistaken

Anybody having knowledge on rabbitmq with C++

/get cbook

/warn

Hello Kelebek can you help me a resource to start with Python, I basically know nothing about it

#ot

Hello Kelebek can you help me a resource to start with Python, I basically know nothing about it

/warn offtop

Anyone need any type of free app code dm meee

No.

Anybody having knowledge on rabbitmq with C++

www.nohello.com

/get cbook

i am geeting compilation error for this program

https://hastebin.com/upacozecah.cpp

Compilation Error: Compilation Error prog.cpp: In function ‘std::vector<int> printNonRepeated(int*, int)’: prog.cpp:50:22: error: cannot convert ‘std::unordered_set<int>::iterator {aka std::__detail::_Node_iterator<int, true, false>}’ to ‘int’ in assignment arr1[counter]=itr;

#include<stdio.h> #include<stdlib.h> struct slope{ int m; int x; int c; }; int slp(struct slope *q); int main(){ int z; struct slope s={2,3,4}; struct slope *p; p=&s; z=slp (p); printf("%d \n",z); } int slp(struct slope *q) { int y; y= q->m +q->x +q->c; return y; }

how can i minimize lines of code?

how can i minimize lines of code?

For what particular reason?

Code golf? :P

Compilation Error: Compilation Error prog.cpp: In function ‘std::vector<int> printNonRepeated(int*, int)’: prog.cpp:50:22: error: cannot convert ‘std::unordered_set<int>::iterator {aka std::__detail::_Node_iterator<int, true, false>}’ to ‘int’ in assignment arr1[counter]=itr;

*itr

I got this as college assignment and it was asked that best possible optimized code

I was confused if I could optimize it furthermore

I got this as college assignment and it was asked that best possible optimized code

Best optimized doesn't mean the shortest.

Best optimized doesn't mean the shortest.

Could this code be any shorter then?

Could this code be any shorter then?

Sure it could

Well, you could remove newlines.

Well, you could remove newlines.

That's bad idea. He's not code golfing :P

Well, he wanted the shortest code.

Sure it could

What would be the best way?

Well, he wanted the shortest code.

If he wants the shortest, then he could just do this: main() { puts("123");} where 123 is a hardcoded value

It wouldn't do what the wants, which is calculation.

It wouldn't do what the wants, which is calculation.

But all his data is hardcoded

So no difference really. And fast as heck :P

But all his data is hardcoded

Well, alright.

#include<stdio.h> #include<stdlib.h> struct slope{ int m; int x; int c; }; int slp(struct slope *q); int main(){ int z; struct slope s={2,3,4}; struct slope *p; p=&s; z=slp (p); printf("%d \n",z); } int slp(struct slope *q) { int y; y= q->m +q->x +q->c; return y; }

#include<stdio.h> union slope { struct { int m; int x; int c; }; char pad[32]; }; int main(){ struct slope s={2,3,4}; printf("%d \n", slp(&s)); } static inline int slp(struct slope *q) { return (q->m * q->x) + q->c; }

Don't foonspeed.

Not at PC rn, can somebody tell me I'm padding correctly?

#include<stdio.h> union slope { struct { int m; int x; int c; }; char pad[32]; }; int main(){ struct slope s={2,3,4}; printf("%d \n", slp(&s)); } static inline int slp(struct slope *q) { return (q->m * q->x) + q->c; }

What do you need union for?

What do you need union for?

Padding

You can manually force a specific padding to occur by nesting a struct inside a union

You can manually force a specific padding to occur by nesting a struct inside a union

Yeah I know. But why tho?

#include <stdio.h> union slope { struct { int m; int x; int c; }; char pad[32]; }; static inline int slp(union slope *q) { return (q->m * q->x) + q->c; } int main() { union slope s = {2, 3, 4}; printf("%d \n", slp(&s)); }

Yeah I know. But why tho?

Tbh it's been so long since I've done this

Give me a few seconds

Tbh it's been so long since I've done this

I see. You just want to have useless 24 bytes on each struct.

For no particular reason

Meh they perform almost the same

Maybe if I turn on optimization?

Nah. Still the same

Nah. Still the same

The only difference is size

nohello.com

i did it one year ago

i could see

https://beej.us/guide/bgnet/

https://beej.us/guide/bgnet/

https://beej.us/guide/bgnet/

Hah

I might have a TCP server I've written.

Using vectors, is there a way to erase the object that calls is without passing the whole vector?

https://beej.us/guide/bgnet/

Bruh