I want to learn c language easily can anyone help me

Y bro

/rose

buddy, if you really need assistance that badly, ask a concise question. If this behavior continues your access will be terminated

Bruh what r u doing?!

Just asking sorry for bothering

I've got an exam tomorrow but I am really desperate and would pay someone to help me is that okay or it goes against this group's roules?

Ig?

//writing the program to insert the element in the array . #include<iostream> using namespace std ; int* insert(int a[] , int size , int pos , int val){ size++ ; for (int i = size ; i >= pos ; i--) { a[i] = a[i-1]; } a[pos-1] = val ; return a ; } void print(int a[] , int size){ for (int i = 0; i < size; i++) { cout << a[i] << " " ; } } int main(){ int a[] = {2,7,4,1,5,3} ; int size = sizeof(a)/sizeof(a[0]); cout << "The array before insertion ." << endl ; print(a,size); int pos ; cout << "Enter the position you want to insert the value : " << endl; cin >> pos ; int val ; cout << "Enter what value you want to insert " << endl; cin >> val ; cout << "The array after insertion ." << endl ; insert(a , size , pos ,val); print(a,size); return 0 ; }

Please send it via a pasting service , don't send it like this

How to do that

Nope

Lower once sir .

Actually sir i m 8 grade student so don't know about the logic .

Inserting array at the position by shifting the value to right .

Thank u

I understand and i ll try it now

It's actaully easy to understand, it might take some time ,when u don't understand what's going on inside the code I suggest you to use print statements between your codes to see what's going on..it actually helped me...

This is C++, mate.. There's no print statement You mean std::cout

printf() is present on C++

is there anything like @lru_cache on python in C++ libraries? so I can implement memoization easily

https://github.com/Gasu16/Race-Conditions

This is why I don't do shit on Linux

food fest is organised at the JLN stadium. The stalls from different states and cities have been set up. To make the fest more interesting, multiple games have been arranged which can be played by the people to win the food vouchers. One such game to win the food vouchers is described below: There are N number of boxes arranged in a single queue. Each box has an integer I written on it. From the given queue, the participant has to select two contiguous subsequences A and B of the same size. The selected subsequences should be such that the summation of the product of the boxes should be maximum. The product is not calculated normally though. To make the game interesting, the first box of subsequence A is to be multiplied by the last box of subsequence B. The second box of subsequence A is to be multiplied by the second last box of subsequence B and so on. All the products thus obtained are then added together. If the participant is able to find the correct such maximum summation, he/she will win the game and will be awarded the food voucher of the same value. Note: The subsequences A and B should be disjoint. Input Format The first line of input consists of the number of boxes, N. The second line of input consists of N space-separated integers. Constraints 1< N <=3000 -106 <= I <=106 Output Format Print the maximum summation of the product of the boxes in a separate line. Sample TestCase 1 Input 8 1 9 2 3 0 6 7 8 Output 104

This is C++, mate.. There's no print statement You mean std::cout

food fest is organised at the JLN stadium. The stalls from different states and cities have been set up. To make the fest more interesting, multiple games have been arranged which can be played by the people to win the food vouchers. One such game to win the food vouchers is described below: There are N number of boxes arranged in a single queue. Each box has an integer I written on it. From the given queue, the participant has to select two contiguous subsequences A and B of the same size. The selected subsequences should be such that the summation of the product of the boxes should be maximum. The product is not calculated normally though. To make the game interesting, the first box of subsequence A is to be multiplied by the last box of subsequence B. The second box of subsequence A is to be multiplied by the second last box of subsequence B and so on. All the products thus obtained are then added together. If the participant is able to find the correct such maximum summation, he/she will win the game and will be awarded the food voucher of the same value. Note: The subsequences A and B should be disjoint. Input Format The first line of input consists of the number of boxes, N. The second line of input consists of N space-separated integers. Constraints 1< N <=3000 -106 <= I <=106 Output Format Print the maximum summation of the product of the boxes in a separate line. Sample TestCase 1 Input 8 1 9 2 3 0 6 7 8 Output 104

this must be hw or leetcode,hackerrank,etc... u should atleast try out something first...

What you mean?

Btw there are mitigations for this

Ah yes this one of course like changing the path file name with file descriptors instead