Codegolf/RGB2Rv10 - Revision history

Merovius at 11:41, 15 October 2013

2013-10-15T11:41:54Z

← Older revision		Revision as of 11:41, 15 October 2013
Line 65:		Line 65:

	=== C ===		=== C ===
	Merovius (59+186=245 bytes)		Merovius (59+186=245 bytes) [http://blog.merovius.de/2013/10/11/how-to-cgolf.html Ausführliche Erklärung]
	<code><pre>		<code><pre>
	GOLF_BIN="cc -D'c(a,x)=p+3==#a?x:' -D'o(a,r)=c(a,(++s=s r*(s-1),i))' -o golf golf.c; ./golf"		GOLF_BIN="cc -D'c(a,x)=p+3==#a?x:' -D'o(a,r)=c(a,(++s=s r*(s-1),i))' -o golf golf.c; ./golf"

Mxffon: /* C */

2013-10-15T09:21:03Z

← Older revision		Revision as of 09:21, 15 October 2013
Line 71:		Line 71:
	<code><pre>		<code><pre>
	main(i){char q[2001],p=q,s;for(gets(p);;)p+=i=c(#,i)c(1,(printf("%d\n",s++),i))c(C,p)o(.,+)o(0,-)o(-,)o(2,/)c(A,1)c(?,-1)c(a,-80)c(y,80)c(b,s++?-1:1)c(,s++?-80:80)(--s=p-48,i);}		main(i){char q[2001],p=q,s;for(gets(p);;)p+=i=c(#,i)c(1,(printf("%d\n",s++),i))c(C,p)o(.,+)o(0,-)o(-,)o(2,/)c(A,1)c(?,-1)c(a,-80)c(y,80)c(b,s++?-1:1)c(,s++?-80:80)(--s=p-48,i);}
			</pre></code>
			adi64 (349 bytes)
			<code><pre>GOLF_BIN="cc -ogolf golf.c; ./golf"</pre></code>
			<code><pre>
			#define S(O) t--;s[t-1]O s[t];
			#define A(X,Y) if(c==X){a=Y;}
			#define K(X) if(c==#X[0]){S(X##=)}
			int i[2000],s[9],c,z,t;main(a){while((c=getchar())>0)(i[z++]=c)==10?z+=80-z%80:0;z=0;while((c=i[z])!=64){A(118,80)A(94,-80)A(62,1)A(60,-1)A(95,s[--t]?-1:1)A(124,s[--t]?-80:80)K(+)K(-)K(*)K(/)c==46?printf("%d\n",s[--t]):0;c>47&&c<58?s[t++]=c-48:0;z+=a;}}
	</pre></code>		</pre></code>
	koebi (370 bytes)		koebi (370 bytes)

Mxffon: /* Perl */

2013-10-11T07:11:45Z

Perl

← Older revision		Revision as of 07:11, 11 October 2013
Line 122:		Line 122:
	== Post Mortem ==		== Post Mortem ==
	=== Perl ===		=== Perl ===
	mxf (~~155~~ bytes, nicht kompatibel mit testsuite)		mxf (151 bytes, nicht kompatibel mit testsuite (GOLF_BIN shellquoting)
	<code><pre>		<code><pre>
	perl -naF -E'sub _{$_=$F[$p];push@_,/[\/*+-]/?eval join$_,@_:/(\d)/;$p+=$m=($m\|\|1,-1,1,-80,80)[y/_\|/13/?$_+!pop:y/<>^v/1-4/?$_:0];/\./&&say$==pop;/@/\|\|&_}_'		perl -naF -E'sub _{$_=$F[$p];push@_,/[\/*+-]/?eval join$_,@_:/(\d)/;$p+=$m=($m\|\|1,-1,1,-80,80)[y/_\|/13/?$_+!pop:y/<>^v/1-4/?$_:0];/\./&&say$==pop;/@/\|\|&_}_'
	</pre></code>		</pre></code>

Mxffon: /* Perl */

2013-10-11T07:11:18Z

Perl

← Older revision		Revision as of 07:11, 11 October 2013
Line 124:		Line 124:
	mxf (155 bytes, nicht kompatibel mit testsuite)		mxf (155 bytes, nicht kompatibel mit testsuite)
	<code><pre>		<code><pre>
	perl -naF -E'sub _{$_=$F[$p];@_=(/[\/*+-]/?eval ~~pop.~~$_~~.pop~~:/(\d)/~~,@_);/\./&&say$==shift~~;$p+=$m=($m\|\|1,-1,1,-80,80)[y/_\|/13/?$_+!pop:y/<>^~~v0-9~~/1-4/dr];/@/\|\|&_}_'		perl -naF -E'sub _{$_=$F[$p];push@_,/[\/*+-]/?eval join$_,@_:/(\d)/;$p+=$m=($m\|\|1,-1,1,-80,80)[y/_\|/13/?$_+!pop:y/<>^v/1-4/?$_:0];/\./&&say$==pop;/@/\|\|&_}_'
	</pre></code>		</pre></code>

Mxffon: /* Lösungen */

2013-10-10T17:02:24Z

Lösungen

@@ Line 102: / Line 102: @@
 s=[];l,p,q,d,v,z,m=raw_input(),s.pop,0,1,80,-80,-1
 while 1:c=l[q];exec(((4*"t=p();s+=[p()%st]|"+4*"d=%s|"+2*"d=p()and %s or %s|"+"print p()|exit()|0|s+=[int(c)]")%tuple("+-*/1mzvm1zv")).split("|")["+-*/><^v_|.@ ".find(c)]);q+=d
 </pre></code>

Mxffon at 16:57, 10 October 2013

2013-10-10T16:57:49Z

← Older revision		Revision as of 16:57, 10 October 2013
Line 1:		Line 1:
	== Esocalc ==		= Esocalc =

	Was passiert, wenn man [http://en.wikipedia.org/wiki/Befunge Befunge]		Was passiert, wenn man [http://en.wikipedia.org/wiki/Befunge Befunge]
Line 8:		Line 8:
	vereinfachen.		vereinfachen.

	=== Programmspeicher ===		== Programmspeicher ==

	Der Programmspeicher hat 80 * 25 bytes.		Der Programmspeicher hat 80 * 25 bytes.
Line 20:		Line 20:
	Der Zeiger wird nicht über die Grenzen der Zeilen/Zellen wandern.		Der Zeiger wird nicht über die Grenzen der Zeilen/Zellen wandern.

	=== Operatoren ===		== Operatoren ==
	<code>		<code>
	<pre>		<pre>
Line 49:		Line 49:
	Ausgabe ist "5\n"		Ausgabe ist "5\n"

	=== Testcases ===		== Testcases ==
	git clone https://github.com/maikf/codegolf-rgb2rv10		git clone https://github.com/maikf/codegolf-rgb2rv10

	Ausführen mit 'GOLF_BIN="yadda yadda" prove -l'		Ausführen mit 'GOLF_BIN="yadda yadda" prove -l'

	=== Lösungen ===		== Lösungen ==
	== Perl ==		=== Perl ===
	sECuRE (191 bytes):		sECuRE (191 bytes):
	<code><pre>		<code><pre>
Line 64:		Line 64:
	</pre></code>		</pre></code>

	== C ==		=== C ===
	Merovius (59+186=245 bytes)		Merovius (59+186=245 bytes)
	<code><pre>		<code><pre>
Line 81:		Line 81:
	</pre></code>		</pre></code>

	== C++ ==		=== C++ ===
	ink (482 bytes)		ink (482 bytes)
	<code><pre>		<code><pre>
Line 94:		Line 94:
	</pre></code>		</pre></code>

	== Python ==		=== Python ===
	nicolas (227 bytes)		nicolas (227 bytes)
	<code><pre>		<code><pre>
Line 104:		Line 104:
	</pre></code>		</pre></code>

	= Post Mortem =		== Post Mortem ==
	== Perl ==		=== Perl ===
	mxf (155 bytes, nicht kompatibel mit testsuite)		mxf (155 bytes, nicht kompatibel mit testsuite)
	<code><pre>		<code><pre>
	perl -naF -E'sub _{$_=$F[$p];@_=(/[\/*+-]/?eval pop.$_.pop:/(\d)/,@_);/\./&&say$==shift;$p+=$m=($m\|\|1,-1,1,-80,80)[y/_\|/13/?$_+!pop:y/<>^v0-9/1-4/dr];/@/\|\|&_}_'		perl -naF -E'sub _{$_=$F[$p];@_=(/[\/*+-]/?eval pop.$_.pop:/(\d)/,@_);/\./&&say$==shift;$p+=$m=($m\|\|1,-1,1,-80,80)[y/_\|/13/?$_+!pop:y/<>^v0-9/1-4/dr];/@/\|\|&_}_'
	</pre></code>		</pre></code>

Mxffon at 16:34, 10 October 2013

2013-10-10T16:34:17Z

← Older revision		Revision as of 16:34, 10 October 2013
Line 104:		Line 104:
	</pre></code>		</pre></code>

	=== Post Mortem ===		= Post Mortem =
	== Perl ==		== Perl ==
	mxf (155 bytes, nicht kompatibel mit testsuite)		mxf (155 bytes, nicht kompatibel mit testsuite)

Mxffon: /* Post Mortem */

2013-10-10T16:33:26Z

Post Mortem

← Older revision		Revision as of 16:33, 10 October 2013
Line 105:		Line 105:

	=== Post Mortem ===		=== Post Mortem ===
			== Perl ==
			mxf (155 bytes, nicht kompatibel mit testsuite)
			<code><pre>
			perl -naF -E'sub _{$_=$F[$p];@_=(/[\/*+-]/?eval pop.$_.pop:/(\d)/,@_);/\./&&say$==shift;$p+=$m=($m\|\|1,-1,1,-80,80)[y/_\|/13/?$_+!pop:y/<>^v0-9/1-4/dr];/@/\|\|&_}_'
			</pre></code>

Mxffon: /* C */

2013-10-08T19:10:30Z

← Older revision		Revision as of 19:10, 8 October 2013
Line 65:		Line 65:

	== C ==		== C ==
	~~Merovious~~ (59+186=245 bytes)		Merovius (59+186=245 bytes)
	<code><pre>		<code><pre>
	GOLF_BIN="cc -D'c(a,x)=p+3==#a?x:' -D'o(a,r)=c(a,(++s=s r*(s-1),i))' -o golf golf.c; ./golf"		GOLF_BIN="cc -D'c(a,x)=p+3==#a?x:' -D'o(a,r)=c(a,(++s=s r*(s-1),i))' -o golf golf.c; ./golf"

Mxffon at 18:50, 8 October 2013

2013-10-08T18:50:24Z

← Older revision		Revision as of 18:50, 8 October 2013
Line 103:		Line 103:
	while 1:c=l[q];exec(((4"t=p();s+=[p()%st]\|"+4"d=%s\|"+2"d=p()and %s or %s\|"+"print p()\|exit()\|0\|s+=[int(c)]")%tuple("+-/1mzvm1zv")).split("\|")["+-*/><^v_\|.@ ".find(c)]);q+=d		while 1:c=l[q];exec(((4"t=p();s+=[p()%st]\|"+4"d=%s\|"+2"d=p()and %s or %s\|"+"print p()\|exit()\|0\|s+=[int(c)]")%tuple("+-/1mzvm1zv")).split("\|")["+-*/><^v_\|.@ ".find(c)]);q+=d
	</pre></code>		</pre></code>

			=== Post Mortem ===