I've now , and it was rejected. It really not a big deal, but something seems strange.  2 reviewers approved it, one rejected it (community?), and when I looked at the post, it was edited with my suggestion! (it's even the same comment word by word..) what has happened here?
I found this , but I am not sure if this is the same issue.  On , I did some reformatting of the indentation in the code block to make it a bit more readable and it was  for peer review. A few minutes later, it appears the OP made an edit that added some additional code. It looks like my suggested edit was applied when the OP saved his/her edit, and it looks like he got the "credit" for the edit.  I'm not really concerned about the 2 rep points; I'm more curious why this happened and if this is a bug (or limitation) in the editing feature, or if this is known/intended behavior?  Note that this is not a suggested edit that's overridden by a concurrent edit: the recorded edit starts from the post-suggested edit state (and in fact can be identical to it, as in  ).
If I have a native C++ windows program (i.e. the entry point is WinMain) how do I view output from console functions like std::cout? What's the protocol for requesting a tag warning? On a particular site, RPG Stack Exchange, we've decided on our meta on a couple of tags that should have tag warnings, and on what those tag warnings should say. I am  on the site in question.  What should we do to get the tag warnings implemented? Do we do any/all of the following?:   start a [feature-request] on our meta for the tag warnings? raise a CM escalation? contact staff via the contact form? ping a staff member in the Teacher's Lounge? anything else? Prove $x \equiv a \pmod{p}$ and $x \equiv a \pmod{q}$ then $x \equiv a\pmod{pq}$ Prove $x \equiv a \pmod{p}$ and $x \equiv a \pmod{q}$ then $x \equiv a\pmod{pq}$ for $p\neq q$ distinct primes.  Where can I start with this proof? It looks similar to the Chinese Remainder Theorem, but that deals with two different a values. There's no need to  the  that have led to a lack of trust between  of  and . Suffice it to say that astoundingly they continue to assert that  and, instead of apologizing and reinstating Monica have demanded that she go through a process with no transparency, due process, or involvement from the community.   Has the time has come for Stack Exchange, Inc to spin off the community and all the data needed to keep the sites running to a separate non-profit, who would then in turn license the software from the company?  What's in it for the community?   The community can practice self determination for issues from as basic as the number of moderators they have to as fundamental as the policies they enforce. If the company development continues to be unresponsive to the community's needs, the community would be able to develop its own open source software that would meet its needs. They can find their own funding model instead of having ads imposed on them.   What's in it for the company?   Community actions will no longer reflect on the company. Interaction with the community as a customer may come more naturally to current leadership than the present paradigm. They don't have to worry about paying for the community's operating expenses. They can focus on doing one thing well. How do I summon a baby mob? In Minecraft Java Edition, one can summon baby zombies and drowned using the IsBaby NBT tag: /summon zombie X Y Z {IsBaby:1b}  Likewise, one can summon baby breedable mobs (Pigs, Cows, etc.) by giving them a negative Age NBT tag (the number of ticks until the mob grows up): /summon cow X Y Z {Age:-100000}  Since NBT is inaccessible from commands in Bedrock Edition, the above commands will not work there. How do I summon baby mobs in Minecraft Bedrock Edition? How do you prove that $\sum\limits_{n=0}^{\infty}{2n \choose n}x^n=(1-4x)^{-1/2}$? I tried to identify the sum as a binomial series, but the $4$ and the $-1/2$ puzzle me. (This series arises in studying the first passage time of a simple random walk.) What are the differences between Iron Man and War Machine armours ?  In the movies, it seems that they are the same, except the War Machine armour features more heavy weapons. But if they are the same, why wouldn't Tony Stark use the War Machine armour?  Do they have different characteristics (like strength, resistance, flight time...)?  I am looking for answers from the movies and/or the comics. Find the coefficient of the term $x^2$ in $\left(x+\frac 2x\right)^{4}$ Find the coefficient of the term $x^2$ in $$\left(x+\frac 2x\right)^{4}$$   This is what I have done so far.  We know $a$ = $x$ and $b$ = $\frac2x$ and $n$ = 4  So what I have done is $4c2$ x $(x)^2$ x ($\frac2x$)$^2$  As we know that $^2$ + $^2$ = 4, and 4 is the $n$ value.  The answer is one though?  What have I done wrong?   P.S.  was the tutorial that helped me. Help with table multicolumn I have done major updates to my website, and renamed all my URLs.  How can I tell Google that I have renamed these URLs and let Google refresh its index?  My website URL: http://www.pndmasr.com/  My sitemap: http://www.pndmasr.com/sitemap.xml  I have uploaded my sitemap via Google Webmaster Tools many times.  However, every time I search Google for "pndmasr", I still get results with old pages. I have waited more than 3 days but the problem remains. Any suggestions?  Is there a problem with my sitemap? Design properties of the Rijndael finite field? So we've already had a question on . My question is - can we use a different finite field other than the one given by $x^8 + x^4 + x^3 + x + 1$ in $GF(2^8)$. In other words, would any irreducible polynomial over this field do the trick or are the special considerations and properties of that particular reducing polynomial?  If a more general discussion on appropriate fields for cryptographic operations, such as those used in ECC, is necessary, then I'd be happy to hear it. What I'm trying to get to is an understanding of whether there are any important properties in terms of the "randomness" of the operation - for example, are there weak fields to operate over? For example, $x^8 + x^3 + x + 1$ ought to also be irreducible - so would it be suitable? I ask partly because of the  which lead me to think not all fields might hold equal strength. Right? Wrong? Inconsequential? In our application, we receive text files (.txt, .csv, etc.) from diverse sources. When reading, these files sometimes contain garbage, because the files where created in a different/unknown codepage.  Is there a way to (automatically) detect the codepage of a text file?   The detectEncodingFromByteOrderMarks, on the StreamReader constructor, works for UTF8  and other unicode marked files, but I'm looking for a way to detect code pages, like ibm850, windows1252.     Thanks for your answers, this is what I've done.  The files we receive are from end-users, they do not have a clue about codepages. The receivers are also end-users, by now this is what they know about codepages: Codepages exist, and are annoying.  Solution:    Open the received file in Notepad, look at a garbled piece of text. If somebody is called François or something, with your human intelligence you can guess this. I've created a small app that the user can use to open the file with, and enter a text that user knows it will appear in the file, when the correct codepage is used.  Loop through all codepages, and display the ones that give a solution with the user provided text.  If more as one codepage pops up, ask the user to specify more text. Audio is working, but the speaker test doesn't work I've installed Ubuntu 12.04 LTS from a minimal cd on a netbook (Asus 1001 PXD). I've installed the ubuntu-desktop package using the --no-install-recommends option.  Everything works fine, except the "sound test" for headphones or analog speakers.  Clicking on the "test" buttons (front left and front right) I don't hear any sound. Despite this, the audio is working properly.  I've checked the audio levels with alsamixer; I have also checked that the test sounds actually exist in /usr/share/sounds/alsa.  I tried an installation of Ubuntu 12.04 LTS made with the desktop-cd, and in this case the speaker test works properly.  I suppose, therefore, that the problem could depend on the lack of a package, but I have not identified which one. Prove existence of a real root. Windows file system is case insensitive. How, given a file/folder name (e.g. "somefile"), I get the actual name of that file/folder (e.g. it should return "SomeFile" if Explorer displays it so)?  Some ways I know, all of which seem quite backwards:   Given the full path, search for each folder on the path (via FindFirstFile). This gives proper cased results of each folder. At the last step, search for the file itself. Get filename from handle (as in ). This requires opening a file, creating file mapping, getting it's name, parsing device names etc. Pretty convoluted. And it does not work for folders or zero-size files.   Am I missing some obvious WinAPI call? The simplest ones, like GetActualPathName() or GetFullPathName() return the name using casing that was passed in (e.g. returns "program files" if that was passed in, even if it should be "Program Files").  I'm looking for a native solution (not .NET one). I know I can set the render border with Ctrl+B and dragging a box.  But is there  a way I can exactly specify the border dimensions? How to evaluate this infinite sum?  $$\sum_{n=1}^{\infty}\frac{1}{2^n-1}$$ I have two classes, Foo and Bar, that have constructors like this:  class Foo {     Foo()     {       // do some stuff     }      Foo(int arg)     {       // do some other stuff     } }  class Bar : Foo {     Bar() : base()     {       // some third thing     } }   Now I want to introduce a constructor for Bar that takes an int, but I want the stuff that happens in Bar() to run as well as the stuff from Foo(int).  Something like this:  Bar(int arg) : Bar(), base(arg) {   // some fourth thing }   Is there any way to do this in C#?  The best I have so far is putting the work done by Bar() into a function, that also gets called by Bar(int), but this is pretty inelegant. I'm trying to install KDE 5 on my Ubuntu 16.04 system as per the instructions in , but I'm getting the below error message when running sudo apt-get install kubuntu-desktop.  Is there something I can do to resolve this?  Need to get 682 kB/326 MB of archives. After this operation, 1,272 MB of additional disk space will be used. Do you want to continue? [Y/n] y Err:1 http://ir.archive.ubuntu.com/ubuntu xenial/universe amd64              gtk2-engines-oxygen amd64 1.4.6-1ubuntu1   Temporary failure resolving 'ir.archive.ubuntu.com' Get:2 http://ir.archive.ubuntu.com/ubuntu xenial/universe amd64              libkf5sendlater5 amd64 4:15.12.3-0ubuntu1 [45.2 kB] Get:3 http://ir.archive.ubuntu.com/ubuntu xenial/universe amd64              libthreadweaver4 amd64 4:4.14.16-0ubuntu3 [46.6 kB] Get:4 http://ir.archive.ubuntu.com/ubuntu xenial/universe amd64              libfarstream-0.2-5 amd64 0.2.7-0ubuntu1 [192 kB] Fetched 284 kB in 1min 9s (4,093 B/s)         E: Failed to fetch http://ir.archive.ubuntu.com/ubuntu/pool/universe/g/             gtk2-engines-oxygen/gtk2-engines-oxygen_1.4.6-1ubuntu1_amd64.deb               Temporary failure resolving 'ir.archive.ubuntu.com'  E: Unable to fetch some archives, maybe run apt-get update or              try with --fix-missing? I have my mobile phone (Samsung Galaxy S2) running on ICS. Recently I activated Microsoft Exchnage ActiveSync to connect to my corporate email. It disabled all the security options like 'Pattern Unlock'. I hated it, and removed my microsoft active exchange account from the phone, but these options are still disabled. How do I get it enabled?