I'm using the live share extension in visual studio, I and my friends are developing a game with a graphic library, and when I run the source.cpp only I can see the window of the game, the others only see the console, is possible to make anyone see the window ?

but it is not late to make a better world to join the people to be a defender of cyberspace too, though i will always keep myself a grey hat

Does any body know a good tutor or website , material for learning jsp and servlet Plz tell me It's a request

I know a website. I don't know what you want exactly but I use w3schools.com

Is this satisfactory?

No sir it's not that good in jsp and servlet

You mean javascript?

You mean javascript?

Does any body know a good tutor or website , material for learning jsp and servlet Plz tell me It's a request

Sorry

No sir

#c++_isnt_c_with_classes

You're right, it's worse

A text file (for example: source.txt) contains a text with unknown number of lines. Assume that the file DOES NOT contain the character ‘$’. The aim of the program is to compress the file, by replacing any sequence of repeated characters (with a minimum of 2 and a maximum of 9 repetitions) with the following triplet of characters: <repeated character>$<number of repetitions>. NB: the number of repetitions should not consider the first occurrence of the character: for example, AA contains 1 repetition, BBB contains 2 repetitions, etc. In case a character is repeated more than 9 times, the sequence should be broken into multiple sub-sequences. For example: - “AAAAAAAAAAAAA” should be encoded as “A$9A$2” - “the number 1000000 is large” should be encoded as “the number 10$5 is large” - “there are 15 repeated = : =============== and 4 dots….” should be encoded as “there are 15 repeated = : =$9=$4 and 4 dots.$3” The compressed text should be stored in a second file (for example: compressed.txt). Example: If input file source.txt is: Partenza Destinazione Costo Parigi New York 1000 Roma Londra 700 Sidney Los Angeles 2222 The file compressed.txt should be: Partenza $5Destinazione $3Costo Parigi $9New York $410$2 $4Roma $9 Londra $5700 $2Sidney $6Los Angeles $42$3

That should be really simple. Though I disagree with "AA" being "compressed" into "A$2", but rather, this compression should only be done on characters appearing more than twice. But that's irrelevant if the assignment has that specific request. Anyway, you need to have two "modes", you'll loop through the characters (getc()) and once a character is the same as the previous one, enter a nested loop which will count more repeating characters. If the characters don't repeat, you exit the nested loop and continue in the main loop.

I don't understand why it doesnt work

Yes, no output

http://ix.io/2VeK "How are yoooou" becomes "How are yoo$4u"

can anyone teach me, please what does "\f" do in c++?

Please I'm new at C and C++ programming. Any advice to get started?

https://www.stroustrup.com/programming.html

Thank you. Should I start with C, C++ or C# ? I heard they are all different.

Thank you. Should I start with C, C++ or C# ? I heard they are all different.

Thank you. Should I start with C, C++ or C# ? I heard they are all different.

C++ builds on C, C# is closer to Java

C# can be summarized as a night of passion between C++ and Java

Hi guys.. Anybody with php reading materials..?

I'd say c# is just a Java clone...

I suggest to start with c, then see classes

Please I'm new at C and C++ programming. Any advice to get started?

#stop_teaching_c_as_cpp_preamble

Why ?

There is php group

There is non

@en_it_chats

/warn offtoo

#include <iostream> using namespace std; void inputArray(int array1[5], int array2[5]); void maxArray(int array1[5], int array2[5], int arraym[5]); void PrintArray(int array[]); int main() { int a[5]; int b[5]; int m[5]; inputArray(a, b); maxArray(a, b, m); PrintArray(m); } void inputArray(int array1[5], int array2[5]) { int i; cout << "enter values for the first array: \n"; for (i = 0; i < 5; i++) cin >> array1[i]; cout << "enter values for the second array: \n"; for (i = 0; i < 5; i++) cin >> array2[i]; }; void maxArray(int array1[5], int array2[5], int arraym[5]) { int i; int max = 0; for (i = 0; i < 5; i++) { if (arraym1[i] > array2[2]) max = arraym[i]; } }; void PrintArray(int array[]) { cout << "the values of the array are: \n"; for (int i = 0; i < 5; i++) cout << array[i] << " "; }

#include <iostream> using namespace std; class manip_2_Arrays { private: //size of the two different arrays to manipulate and check for int arraySize1, arraySize2; public: //member function to input and check out two arrays void inputArrays(); }; void manip_2_Arrays::inputArrays() { int array1[arraySize1], array2[arraySize2]; //COMPUTE FOR THE FIRST ARRAY /*Output the numbers*/ cout<<"Enter your first array size: "; cin>>arraySize1; cout<<"Enter your first array numbers: "; for(int i=0; i<arraySize1; i++) cin>>array1[i]; cout<<"1st Array["<<arraySize1<<"]"<<endl; for(int i=0; i<arraySize1; i++) cout<<"["<<i<<"] = "<<array1[i]<<endl; /*Get the maximum number*/ int max1; max1=array1[0]; for(int i=0; i<arraySize1; i++) { if(max1<array1[i]) max1=array1[i]; } cout<<"Maximum number in first array: "<<max1<<endl; /*Get the minimum number*/ int min1; min1=array1[0]; for(int i=0; i<arraySize1; i++) { if(min1>array1[i]) min1=array1[i]; } cout<<"Minimum number in first array: "<<min1<<endl; //COMPUTE FOR THE SECOND ARRAY /*Output the numbers*/ cout<<"\nEnter your second array size: "; cin>>arraySize2; cout<<"Enter your second array numbers: "; for(int i=0; i<arraySize2; i++) cin>>array2[i]; cout<<"2nd Array["<<arraySize2<<"]"<<endl; for(int i=0; i<arraySize2; i++) cout<<"["<<i<<"] = "<<array2[i]<<endl; /*Get the maximum number*/ int max2; max2=array1[0]; for(int i=0; i<arraySize2; i++) { if(max2<array2[i]) max2=array2[i]; } cout<<"Maximum number in second array: "<<max2<<endl; /*Get the minimum number*/ int min2; min2=array1[0]; for(int i=0; i<arraySize2; i++) { if(min2>array2[i]) min2=array2[i]; } cout<<"Minimum number in second array: "<<min2<<endl; } int main() { manip_2_Arrays arr; arr.inputArrays(); }