Competition results for the most buggy C ++ code

After a lengthy discussion , the winners of the Grand C ++ Error Explosion Competition have been announced . Awards should have been announced in two categories. Participants first competed on the maximum number of errors for the minimum amount of code. The second nomination is creative, it’s important not the quantity and size, but the quality and beauty of the glitches.

As a result, programmer Ed Hanway (Ed Hanway), who has sent such a program, is named the absolute winner.

#include ".//.//.//.//jeh.cpp" #include "jeh.cpp" ` 

The program Henvey caused six times more error messages than the program of the nearest competitor in this category.
')
The programmer Chris Hopman with double include was the winner by the number of errors in the Plain category.

 #include "set>.cpp" #include "set>.cpp" 

In the “Clean Hands” category, the use of the preprocessor was prohibited and Mark Aldorasi won with such a program.

 template<class T,class...>class C{C<T*const,T,C>a;C<T,C>b;};C<int>c; 

In the category “Best Cheat” (Best Cheat), the winner is Chris Hopman, already mentioned. The jury particularly noted "the use of Perl, the only language less understandable than C ++ templates."

 /usr/include; perl -e "@c=\"x\"x(2**16); while(1) {print @c}" 1>&2 

Nomination "The most unexpected code."

 template<class T>class L{L<T*>operator->()};L<int>i=i-> 

In the nomination “the most plausible code”, Victor Zverovich’s work won out. According to the jury, such a program is able to deprive the desire to live anyone who tries to understand it.

 #include <map> #include <algorithm> template<class T,class U>void f(T,U u){std::vector<std::vector<T>>v;auto i=end(v);find(i,i,u);find(i,i,&u);U*p,**q,r(),s(U);find(i,i,&p);find(i,i,&q);find(i,i,r);find(i,i,&r);find(i,i,s);find(i,i,&s);}template<class T>void f(T t){f(t,0);f(t,0l);f(t,0u);f(t,0ul);f(t,0ll);f(t,.0);f(t,.0l);f(t,.0f);f(t,' ');f(t,L' ');f(t,u' ');f(t,U' ');f(t,"");f(t,L"");}int main(){f(0);f(0l);f(0u);f(0ul);f(0ll);f(.0);f(.0l);f(.0f);f(' ');f(L' ');f(u' ');f(U' ');f("");f(L"");f(u"");f(U"");} 

Finally, the prize in the nomination “Clean Hands” was awarded to John Reger with excellent use of recursion.

 struct x struct z<x(x(x(x(x(x(x(x(x(x(x(x(x(x(x(x(x(y,x(y><y*,x(y*w>v<y*,w,x{}