Exetools  

Go Back   Exetools > General > Source Code

Notices

Reply
 
Thread Tools Display Modes
  #1  
Old 10-01-2022, 16:10
Zeocrack Zeocrack is offline
Friend
 
Join Date: Sep 2022
Location: Bangladesh
Posts: 26
Rept. Given: 2
Rept. Rcvd 0 Times in 0 Posts
Thanks Given: 76
Thanks Rcvd at 7 Times in 2 Posts
Zeocrack Reputation: 0
Post C++ to masm conversion

Dear all
What could be the easiest source in masm for the below c++ code?

For i=222222 to 999999
C1=i[1]
C2=i[2]
C3=i[3]
C4=i[4]
C5=i[5]
C6=i[6]
Calcul=C1^6+C2^6+C3^6+C3¨6+C4^6+C5^6+C6^6
if Calcul=serial then
Msgbox("sérial" & i)

Exit
end if
Next i
Reply With Quote
  #2  
Old 10-01-2022, 19:49
chants chants is online now
VIP
 
Join Date: Jul 2016
Posts: 807
Rept. Given: 44
Rept. Rcvd 50 Times in 31 Posts
Thanks Given: 721
Thanks Rcvd at 1,114 Times in 515 Posts
chants Reputation: 51
Lol that is Visual Basic code not C++. So the carrot operator ^ represents exponentiation.

Exponentiation by a positive integer constant is best done by exponentuation by squaring most efficient by finding an addition chain which minimizes the number of multiplications and additions or subtractions. 6=4+2 or 6=8-2 will both work but 4+2 is more efficient

So you use IMUL to multiply by itself once, store the square the multiply the result by itself again, and multiply those together to get the 6th power. Accumulate with ADD and use a counter register initialized to 6 which decreases with DEC each time though the loop and check loop exit condition with jump if zero JZ. This is a very basic assembly task if you've learned it. Addition chains are a more advanced topic if your exponents are huge e.g. in cryptography. There is no known efficient way to find them interestingly enough
Reply With Quote
The Following 2 Users Say Thank You to chants For This Useful Post:
tonyweb (10-02-2022), Zeocrack (10-02-2022)
  #3  
Old 10-02-2022, 10:14
Zeocrack Zeocrack is offline
Friend
 
Join Date: Sep 2022
Location: Bangladesh
Posts: 26
Rept. Given: 2
Rept. Rcvd 0 Times in 0 Posts
Thanks Given: 76
Thanks Rcvd at 7 Times in 2 Posts
Zeocrack Reputation: 0
Thank you. But the issue is we need a six digit number for which the equals to the sum of each 6th square. There seems more math.
Reply With Quote
  #4  
Old 10-02-2022, 10:16
Zeocrack Zeocrack is offline
Friend
 
Join Date: Sep 2022
Location: Bangladesh
Posts: 26
Rept. Given: 2
Rept. Rcvd 0 Times in 0 Posts
Thanks Given: 76
Thanks Rcvd at 7 Times in 2 Posts
Zeocrack Reputation: 0
The below C++ code can solve the problem. But need to convert it in simple masm.

#include

int main(void)
{
int a,b,c,d,e,f;
int n;

for (a=2; a<=9; a++)
for (b=2; b<=9; b++)
for (c=2; c<=9; c++)
for (d=2; d<=9; d++)
for (e=2; e<=9; e++)
for (f=2; f<=9; f++)
{
n = 100000*a + 10000*b + 1000*c + 100*d + 10*e +f;
if (a*a*a*a*a*a + b*b*b*b*b*b + c*c*c*c*c*c + d*d*d*d*d*d + e*e*e*e*e*e + f*f*f*f*f*f == n)
{
printf("se! %i\n", n);
return 0;
}
}
}
Reply With Quote
  #5  
Old 02-24-2024, 01:49
chants chants is online now
VIP
 
Join Date: Jul 2016
Posts: 807
Rept. Given: 44
Rept. Rcvd 50 Times in 31 Posts
Thanks Given: 721
Thanks Rcvd at 1,114 Times in 515 Posts
chants Reputation: 51
Quote:
Originally Posted by Zeocrack View Post
The below C++ code can solve the problem. But need to convert it in simple masm.

#include

int main(void)
{
int a,b,c,d,e,f;
int n;

for (a=2; a<=9; a++)
for (b=2; b<=9; b++)
for (c=2; c<=9; c++)
for (d=2; d<=9; d++)
for (e=2; e<=9; e++)
for (f=2; f<=9; f++)
{
n = 100000*a + 10000*b + 1000*c + 100*d + 10*e +f;
if (a*a*a*a*a*a + b*b*b*b*b*b + c*c*c*c*c*c + d*d*d*d*d*d + e*e*e*e*e*e + f*f*f*f*f*f == n)
{
printf("se! %i\n", n);
return 0;
}
}
}
your Loop ranges here on the inner loops should start from 0 not 2. Except for the very first iteration, would likely need while loops
Reply With Quote
The Following User Says Thank You to chants For This Useful Post:
Zeocrack (02-24-2024)
  #6  
Old 10-02-2022, 16:00
chants chants is online now
VIP
 
Join Date: Jul 2016
Posts: 807
Rept. Given: 44
Rept. Rcvd 50 Times in 31 Posts
Thanks Given: 721
Thanks Rcvd at 1,114 Times in 515 Posts
chants Reputation: 51
Might I suggest godbolt.org. Most here could handcraft this, but there us no need. How you can do it is using that website which shows the generated assembly code fir many C++ compilers, take your choice.
Reply With Quote
The Following User Says Thank You to chants For This Useful Post:
Zeocrack (10-02-2022)
  #7  
Old 10-02-2022, 16:21
te$ter te$ter is offline
Friend
 
Join Date: Feb 2013
Posts: 63
Rept. Given: 23
Rept. Rcvd 6 Times in 5 Posts
Thanks Given: 20
Thanks Rcvd at 25 Times in 12 Posts
te$ter Reputation: 6
You may try gcc -S in order to get asm code
Reply With Quote
The Following User Says Thank You to te$ter For This Useful Post:
Zeocrack (10-02-2022)
  #8  
Old 10-03-2022, 01:23
Insid3Code's Avatar
Insid3Code Insid3Code is offline
Family
 
Join Date: May 2013
Location: Algeria
Posts: 84
Rept. Given: 47
Rept. Rcvd 60 Times in 30 Posts
Thanks Given: 24
Thanks Rcvd at 108 Times in 56 Posts
Insid3Code Reputation: 60
Hi,
Using MSVC to compile "C snippet" and generate masm listing code:

Code:
	.686p
	.mmx
	.xmm
	.model flat, stdcall
	option casemap :none

	printf PROTO c :vararg
	EXTRN getchar:PROC

	includelib msvcrt.lib

.const
result DB 'se! %i', 0aH, 00H

.Code
tv273 = -52						; size = 4
_a$ = -48						; size = 4
tv529 = -44						; size = 4
tv440 = -40						; size = 4
tv351 = -36						; size = 4
tv326 = -32						; size = 4
tv302 = -28						; size = 4
tv544 = -24						; size = 4
_b$ = -20						; size = 4
_c$ = -16						; size = 4
_d$ = -12						; size = 4
_e$ = -8						; size = 4
_f$ = -4						; size = 4
start	PROC

; 4    : {

	push	ebp
	mov	ebp, esp
	sub	esp, 52					; 00000034H
	push	ebx
	push	esi

; 5    : int a,b,c,d,e,f;
; 6    : int n;
; 7    : 
; 8    : for (a=2; a<=9; a++)

	mov	DWORD PTR _a$[ebp], 2
	mov	DWORD PTR tv544[ebp], 222222		; 0003640eH
	push	edi
$LL37@main:

; 9    : for (b=2; b<=9; b++)

	mov	ecx, DWORD PTR _a$[ebp]
	mov	eax, ecx
	imul	eax, ecx
	imul	eax, ecx
	imul	eax, ecx
	imul	eax, ecx
	imul	eax, ecx
	mov	DWORD PTR tv273[ebp], eax
	mov	eax, DWORD PTR tv544[ebp]
	mov	DWORD PTR _b$[ebp], 2
	mov	DWORD PTR tv529[ebp], eax
$LL38@main:

; 10   : for (c=2; c<=9; c++)

	mov	eax, DWORD PTR _b$[ebp]
	mov	esi, eax
	imul	esi, eax
	imul	esi, eax
	imul	esi, eax
	imul	esi, eax
	imul	esi, eax
	mov	eax, DWORD PTR tv529[ebp]
	mov	DWORD PTR _c$[ebp], 2
	mov	DWORD PTR tv440[ebp], eax
$LL39@main:

; 11   : for (d=2; d<=9; d++)

	mov	eax, DWORD PTR _c$[ebp]
	mov	edx, eax
	imul	edx, eax
	imul	edx, eax
	imul	edx, eax
	imul	edx, eax
	imul	edx, eax
	mov	eax, DWORD PTR tv440[ebp]
	mov	DWORD PTR _d$[ebp], 2
	mov	DWORD PTR tv351[ebp], eax
$LL40@main:

; 12   : for (e=2; e<=9; e++)

	mov	eax, DWORD PTR _d$[ebp]
	mov	ecx, eax
	imul	ecx, eax
	imul	ecx, eax
	imul	ecx, eax
	imul	ecx, eax
	imul	ecx, eax
	mov	eax, DWORD PTR tv351[ebp]
	mov	DWORD PTR _e$[ebp], 2
	mov	DWORD PTR tv326[ebp], eax
$LL41@main:

; 13   : for (f=2; f<=9; f++)

	mov	edi, DWORD PTR _e$[ebp]
	mov	eax, edi
	imul	eax, edi
	imul	eax, edi
	imul	eax, edi
	imul	eax, edi
	imul	eax, edi
	mov	edi, DWORD PTR tv326[ebp]
	mov	DWORD PTR _f$[ebp], 2
	mov	DWORD PTR tv302[ebp], edi
$LL4@main:

; 14   : {
; 15   : n = 100000*a + 10000*b + 1000*c + 100*d + 10*e +f;
; 16   : if (a*a*a*a*a*a + b*b*b*b*b*b + c*c*c*c*c*c + d*d*d*d*d*d + e*e*e*e*e*e + f*f*f*f*f*f == n)

	mov	edi, DWORD PTR _f$[ebp]
	mov	ebx, edi
	imul	ebx, edi
	imul	ebx, edi
	imul	ebx, edi
	imul	ebx, edi
	imul	ebx, edi
	add	ebx, DWORD PTR tv273[ebp]
	add	ebx, esi
	add	ebx, edx
	add	ebx, ecx
	add	ebx, eax
	cmp	ebx, DWORD PTR tv302[ebp]
	je	SHORT $LN30@main

; 13   : for (f=2; f<=9; f++)

	inc	DWORD PTR _f$[ebp]
	inc	DWORD PTR tv302[ebp]
	push	9
	pop	edi
	cmp	DWORD PTR _f$[ebp], edi
	jle	SHORT $LL4@main

; 12   : for (e=2; e<=9; e++)

	inc	DWORD PTR _e$[ebp]
	add	DWORD PTR tv326[ebp], 10		; 0000000aH
	cmp	DWORD PTR _e$[ebp], edi
	jle	SHORT $LL41@main

; 11   : for (d=2; d<=9; d++)

	inc	DWORD PTR _d$[ebp]
	add	DWORD PTR tv351[ebp], 100		; 00000064H
	cmp	DWORD PTR _d$[ebp], edi
	jle	$LL40@main

; 10   : for (c=2; c<=9; c++)

	inc	DWORD PTR _c$[ebp]
	add	DWORD PTR tv440[ebp], 1000		; 000003e8H
	cmp	DWORD PTR _c$[ebp], edi
	jle	$LL39@main

; 9    : for (b=2; b<=9; b++)

	inc	DWORD PTR _b$[ebp]
	add	DWORD PTR tv529[ebp], 10000		; 00002710H
	cmp	DWORD PTR _b$[ebp], edi
	jle	$LL38@main

; 5    : int a,b,c,d,e,f;
; 6    : int n;
; 7    : 
; 8    : for (a=2; a<=9; a++)

	add	DWORD PTR tv544[ebp], 100000		; 000186a0H
	inc	DWORD PTR _a$[ebp]
	cmp	DWORD PTR tv544[ebp], 922222		; 000e126eH
	jle	$LL37@main

; 14   : {
; 15   : n = 100000*a + 10000*b + 1000*c + 100*d + 10*e +f;
; 16   : if (a*a*a*a*a*a + b*b*b*b*b*b + c*c*c*c*c*c + d*d*d*d*d*d + e*e*e*e*e*e + f*f*f*f*f*f == n)

	jmp	SHORT $LN17@main
$LN30@main:

; 17   : {
; 18   : printf("se! %i\n", n);

	push	DWORD PTR tv302[ebp]
	push	OFFSET result
	call	printf
	pop	ecx
	pop	ecx

; 19   : getchar();

	call	getchar
$LN17@main:

; 20   : return 0;
; 21   : }
; 22   : }
; 23   : } 

	pop	edi
	pop	esi
	xor	eax, eax
	pop	ebx
	leave
	ret	0
start	ENDP
END
You can compile it with MASM32...
Attached source and (binary size 1KB) clean asm code easy to debug...

External link:
https://www.sendspace.com/file/olce5h
Attached Files
File Type: rar release.rar (1.9 KB, 7 views)
__________________
Computer Forensics
Reply With Quote
  #9  
Old 10-03-2022, 11:03
Zeocrack Zeocrack is offline
Friend
 
Join Date: Sep 2022
Location: Bangladesh
Posts: 26
Rept. Given: 2
Rept. Rcvd 0 Times in 0 Posts
Thanks Given: 76
Thanks Rcvd at 7 Times in 2 Posts
Zeocrack Reputation: 0
Quote:
Originally Posted by Insid3Code View Post
Hi,
Using MSVC to compile "C snippet" and generate masm listing code:

Code:
	.686p
	.mmx
	.xmm
	.model flat, stdcall
	option casemap :none

	printf PROTO c :vararg
	EXTRN getchar:PROC

	includelib msvcrt.lib

.const
result DB 'se! %i', 0aH, 00H

.Code
tv273 = -52						; size = 4
_a$ = -48						; size = 4
tv529 = -44						; size = 4
tv440 = -40						; size = 4
tv351 = -36						; size = 4
tv326 = -32						; size = 4
tv302 = -28						; size = 4
tv544 = -24						; size = 4
_b$ = -20						; size = 4
_c$ = -16						; size = 4
_d$ = -12						; size = 4
_e$ = -8						; size = 4
_f$ = -4						; size = 4
start	PROC

; 4    : {

	push	ebp
	mov	ebp, esp
	sub	esp, 52					; 00000034H
	push	ebx
	push	esi

; 5    : int a,b,c,d,e,f;
; 6    : int n;
; 7    : 
; 8    : for (a=2; a<=9; a++)

	mov	DWORD PTR _a$[ebp], 2
	mov	DWORD PTR tv544[ebp], 222222		; 0003640eH
	push	edi
$LL37@main:

; 9    : for (b=2; b<=9; b++)

	mov	ecx, DWORD PTR _a$[ebp]
	mov	eax, ecx
	imul	eax, ecx
	imul	eax, ecx
	imul	eax, ecx
	imul	eax, ecx
	imul	eax, ecx
	mov	DWORD PTR tv273[ebp], eax
	mov	eax, DWORD PTR tv544[ebp]
	mov	DWORD PTR _b$[ebp], 2
	mov	DWORD PTR tv529[ebp], eax
$LL38@main:

; 10   : for (c=2; c<=9; c++)

	mov	eax, DWORD PTR _b$[ebp]
	mov	esi, eax
	imul	esi, eax
	imul	esi, eax
	imul	esi, eax
	imul	esi, eax
	imul	esi, eax
	mov	eax, DWORD PTR tv529[ebp]
	mov	DWORD PTR _c$[ebp], 2
	mov	DWORD PTR tv440[ebp], eax
$LL39@main:

; 11   : for (d=2; d<=9; d++)

	mov	eax, DWORD PTR _c$[ebp]
	mov	edx, eax
	imul	edx, eax
	imul	edx, eax
	imul	edx, eax
	imul	edx, eax
	imul	edx, eax
	mov	eax, DWORD PTR tv440[ebp]
	mov	DWORD PTR _d$[ebp], 2
	mov	DWORD PTR tv351[ebp], eax
$LL40@main:

; 12   : for (e=2; e<=9; e++)

	mov	eax, DWORD PTR _d$[ebp]
	mov	ecx, eax
	imul	ecx, eax
	imul	ecx, eax
	imul	ecx, eax
	imul	ecx, eax
	imul	ecx, eax
	mov	eax, DWORD PTR tv351[ebp]
	mov	DWORD PTR _e$[ebp], 2
	mov	DWORD PTR tv326[ebp], eax
$LL41@main:

; 13   : for (f=2; f<=9; f++)

	mov	edi, DWORD PTR _e$[ebp]
	mov	eax, edi
	imul	eax, edi
	imul	eax, edi
	imul	eax, edi
	imul	eax, edi
	imul	eax, edi
	mov	edi, DWORD PTR tv326[ebp]
	mov	DWORD PTR _f$[ebp], 2
	mov	DWORD PTR tv302[ebp], edi
$LL4@main:

; 14   : {
; 15   : n = 100000*a + 10000*b + 1000*c + 100*d + 10*e +f;
; 16   : if (a*a*a*a*a*a + b*b*b*b*b*b + c*c*c*c*c*c + d*d*d*d*d*d + e*e*e*e*e*e + f*f*f*f*f*f == n)

	mov	edi, DWORD PTR _f$[ebp]
	mov	ebx, edi
	imul	ebx, edi
	imul	ebx, edi
	imul	ebx, edi
	imul	ebx, edi
	imul	ebx, edi
	add	ebx, DWORD PTR tv273[ebp]
	add	ebx, esi
	add	ebx, edx
	add	ebx, ecx
	add	ebx, eax
	cmp	ebx, DWORD PTR tv302[ebp]
	je	SHORT $LN30@main

; 13   : for (f=2; f<=9; f++)

	inc	DWORD PTR _f$[ebp]
	inc	DWORD PTR tv302[ebp]
	push	9
	pop	edi
	cmp	DWORD PTR _f$[ebp], edi
	jle	SHORT $LL4@main

; 12   : for (e=2; e<=9; e++)

	inc	DWORD PTR _e$[ebp]
	add	DWORD PTR tv326[ebp], 10		; 0000000aH
	cmp	DWORD PTR _e$[ebp], edi
	jle	SHORT $LL41@main

; 11   : for (d=2; d<=9; d++)

	inc	DWORD PTR _d$[ebp]
	add	DWORD PTR tv351[ebp], 100		; 00000064H
	cmp	DWORD PTR _d$[ebp], edi
	jle	$LL40@main

; 10   : for (c=2; c<=9; c++)

	inc	DWORD PTR _c$[ebp]
	add	DWORD PTR tv440[ebp], 1000		; 000003e8H
	cmp	DWORD PTR _c$[ebp], edi
	jle	$LL39@main

; 9    : for (b=2; b<=9; b++)

	inc	DWORD PTR _b$[ebp]
	add	DWORD PTR tv529[ebp], 10000		; 00002710H
	cmp	DWORD PTR _b$[ebp], edi
	jle	$LL38@main

; 5    : int a,b,c,d,e,f;
; 6    : int n;
; 7    : 
; 8    : for (a=2; a<=9; a++)

	add	DWORD PTR tv544[ebp], 100000		; 000186a0H
	inc	DWORD PTR _a$[ebp]
	cmp	DWORD PTR tv544[ebp], 922222		; 000e126eH
	jle	$LL37@main

; 14   : {
; 15   : n = 100000*a + 10000*b + 1000*c + 100*d + 10*e +f;
; 16   : if (a*a*a*a*a*a + b*b*b*b*b*b + c*c*c*c*c*c + d*d*d*d*d*d + e*e*e*e*e*e + f*f*f*f*f*f == n)

	jmp	SHORT $LN17@main
$LN30@main:

; 17   : {
; 18   : printf("se! %i\n", n);

	push	DWORD PTR tv302[ebp]
	push	OFFSET result
	call	printf
	pop	ecx
	pop	ecx

; 19   : getchar();

	call	getchar
$LN17@main:

; 20   : return 0;
; 21   : }
; 22   : }
; 23   : } 

	pop	edi
	pop	esi
	xor	eax, eax
	pop	ebx
	leave
	ret	0
start	ENDP
END
You can compile it with MASM32...
Attached source and (binary size 1KB) clean asm code easy to debug...

External link:
https://www.sendspace.com/file/olce5h

Hi insid3code

Thanks. Can you explain a little more so that I can try my own,

Thanks
Reply With Quote
  #10  
Old 10-03-2022, 17:12
Insid3Code's Avatar
Insid3Code Insid3Code is offline
Family
 
Join Date: May 2013
Location: Algeria
Posts: 84
Rept. Given: 47
Rept. Rcvd 60 Times in 30 Posts
Thanks Given: 24
Thanks Rcvd at 108 Times in 56 Posts
Insid3Code Reputation: 60
MSVC compiler can generate from your "c" snippet masm listing..
to generate this masm file:
cl.exe /I"include" /D "WIN32" /X /c /O1 /Zl /Os /GF /EHsc /GS- /W4 /Gd /FAs /Fa"asmX86" "main.c"

You can use the generated masm listing directly under MASM32.
__________________
Computer Forensics
Reply With Quote
The Following 2 Users Say Thank You to Insid3Code For This Useful Post:
Zeocrack (10-04-2022)
  #11  
Old 02-22-2024, 14:22
Zeocrack Zeocrack is offline
Friend
 
Join Date: Sep 2022
Location: Bangladesh
Posts: 26
Rept. Given: 2
Rept. Rcvd 0 Times in 0 Posts
Thanks Given: 76
Thanks Rcvd at 7 Times in 2 Posts
Zeocrack Reputation: 0
Anyone can support me compiling the below code in vb? I tried but not working.

For i=222222 to 999999
C1=i[1]
C2=i[2]
C3=i[3]
C4=i[4]
C5=i[5]
C6=i[6]
Calcul=C1^6+C2^6+C3^6+C3¨6+C4^6+C5^6+C6^6
if Calcul=serial then
Msgbox("sérial" & i)

Exit
end if
Next i
Reply With Quote
  #12  
Old 02-22-2024, 19:38
sendersu sendersu is offline
VIP
 
Join Date: Oct 2010
Posts: 1,174
Rept. Given: 334
Rept. Rcvd 233 Times in 123 Posts
Thanks Given: 277
Thanks Rcvd at 568 Times in 316 Posts
sendersu Reputation: 200-299 sendersu Reputation: 200-299 sendersu Reputation: 200-299
try yourself https://www.onlinegdb.com/online_vb_compiler
Reply With Quote
The Following User Says Thank You to sendersu For This Useful Post:
Zeocrack (02-22-2024)
  #13  
Old 02-23-2024, 06:57
0x1F 0x1F is offline
Guest
 
Join Date: Jan 2024
Posts: 2
Rept. Given: 0
Rept. Rcvd 0 Times in 0 Posts
Thanks Given: 1
Thanks Rcvd at 0 Times in 0 Posts
0x1F Reputation: 0
Code:
.data
    msgTemplate db "serial %d", 0
    serial dd ? ; initialize this somewhere

.code
start:
    mov ecx, 222222 

loop_start:
    mov eax, 2 ; c1
    mov ebx, 2 ; c2, etc.

    cmp eax, [serial]
    je match_found

    inc ecx
    cmp ecx, 999999
    jle loop_start

    jmp exit

match_found:
    ; write your msgbox here :)

exit:
    ; do your cleanup
Here is a good start for you
You have to write your own logic for digit extraction and calling msgbox
Reply With Quote
  #14  
Old 02-23-2024, 21:42
Zeocrack Zeocrack is offline
Friend
 
Join Date: Sep 2022
Location: Bangladesh
Posts: 26
Rept. Given: 2
Rept. Rcvd 0 Times in 0 Posts
Thanks Given: 76
Thanks Rcvd at 7 Times in 2 Posts
Zeocrack Reputation: 0
Quote:
Originally Posted by 0x1F View Post
Code:
.data
    msgTemplate db "serial %d", 0
    serial dd ? ; initialize this somewhere

.code
start:
    mov ecx, 222222 

loop_start:
    mov eax, 2 ; c1
    mov ebx, 2 ; c2, etc.

    cmp eax, [serial]
    je match_found


    inc ecx
    cmp ecx, 999999
    jle loop_start

    jmp exit

match_found:
    ; write your msgbox here :)

exit:
    ; do your cleanup
Here is a good start for you
You have to write your own logic for digit extraction and calling msgbox

The above code is not going to work.
Reply With Quote
  #15  
Old 02-24-2024, 04:09
0x1F 0x1F is offline
Guest
 
Join Date: Jan 2024
Posts: 2
Rept. Given: 0
Rept. Rcvd 0 Times in 0 Posts
Thanks Given: 1
Thanks Rcvd at 0 Times in 0 Posts
0x1F Reputation: 0
Quote:
Originally Posted by Zeocrack View Post
The above code is not going to work.
Of course, it is not going to work, it has to be modified
Reply With Quote
Reply

Tags
source co

Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is On



All times are GMT +8. The time now is 22:05.


Always Your Best Friend: Aaron, JMI, ahmadmansoor, ZeNiX, chessgod101
( 1998 - 2024 )