How to Crack Any Adobe Software

 Steps To Crack Any Adobe Software :
1. Download or install any Adobe software which you want to crack from the original site (ignore if you have already installed it).
2. Now press Windows Key + R (or go to START and select RUN).
3. Copy “ C:\Windows\System32\drivers\etc ” to the blank space and press enter.

The window will look like the screenshot shown below:

4. You will see a file named “hosts” , open it in Notepad.

Copy all the codes given below in purple color, exactly at the end of the “hosts” file.



127.0.0.1 hl2rcv.adobe.com
127.0.0.1 adobeereg.com
127.0.0.1 activate.adobe.com
127.0.0.1 practivate.adobe.com
127.0.0.1 ereg.adobe.com
127.0.0.1 activate.wip3.adobe.com
127.0.0.1 ereg.wip3.adobe.com
127.0.0.1 wip3.adobe.com
127.0.0.1 activate-sea.adobe.com
127.0.0.1 wwis-dubc1-vip60.adobe.com
127.0.0.1 activate-sjc0.adobe.com
127.0.0.1 3dns.adobe.com
127.0.0.1 3dns-1.adobe.com
127.0.0.1 3dns-2.adobe.com
127.0.0.1 3dns-3.adobe.com
127.0.0.1 3dns-4.adobe.com
127.0.0.1 adobe-dns.adobe.com
127.0.0.1 adobe-dns-1.adobe.com
127.0.0.1 adobe-dns-2.adobe.com
127.0.0.1 adobe-dns-3.adobe.com
127.0.0.1 adobe-dns-4.adobe.com
127.0.0.1 adobe-dns-5.adobe.com
127.0.0.1 hh-software.com
127.0.0.1 http://www.hh-software.com
127.0.0.1 activate.adobe.de
127.0.0.1 practivate.adobe.de
127.0.0.1 ereg.adobe.de
127.0.0.1 activate.wip3.adobe.de
127.0.0.1 wip3.adobe.de
127.0.0.1 3dns-3.adobe.de
127.0.0.1 3dns-2.adobe.de
127.0.0.1 adobe-dns.adobe.de
127.0.0.1 adobe-dns-2.adobe.de
127.0.0.1 adobe-dns-3.adobe.de
127.0.0.1 ereg.wip3.adobe.de
127.0.0.1 activate-sea.adobe.de
127.0.0.1 wwis-dubc1-vip60.adobe.de
127.0.0.1 activate-sjc0.adobe.de
127.0.0.1 wwis-dubc1-vip60.adobe.de
127.0.0.1 hl2rcv.adobe.de
127.0.0.1 nero.com
127.0.0.1 http://www.nero.com
127.0.0.1 activate.nero.com
127.0.0.1 http://www.activate.nero.com
127.0.0.1 nero.de
127.0.0.1 http://www.nero.de
127.0.0.1 activate.nero.de
127.0.0.1 http://www.activate.nero.de
127.0.0.1 validation.sls.microsoft.com


Now your hosts file will look like below:

5. Now open your installed software and try registering it with the keys given below in purple color. You can also use any other serial from the internet.



Adobe Creative Suite :

1325-0621-9125-0765-3648-0614
1325-0365-5929-6118-8817-8422
1325-0150-1163-7532-1626-3430
1325-0178-1927-9019-0123-2254
1325-0702-3693-1544-9166-3515
1325-0549-2240-0071-3409-1342
Photoshop CS5:

Serial : 1330-1927-7762-6383-0202-0414
Adobe CS5 Serials
Master Suite :

1325-1118-5864-4422-1094-1166
1325-1558-5864-4422-1094-1126
1325-1958-5864-4422-1094-1178
1325-1085-0645-5332-7061-9771
Photoshop :

1330-1927-7762-6383-0202-0414
Fireworks :

1193-1927-7762-6383-0202-0437
Dreamweaver :

1192-1927-7762-6383-0202-0474
Encore :

1132-1127-8739-4724-1356-4304
Soundbooth :

1332-1281-2401-7141-7851-9214
Onlocation :

1132-1434-9226-7415-1756-2046
Contribute :

1188-1001-8428-4361-2308-0839
Adobe Flash Catalyst :

1395-4001-8359-3301-6882-0521
Illustrator :

1034-1006-5290-0019-3090-0219
In Design :

1037-1000-0448-3419-1984-9230
Flash :

1302-1009-3696-1065-6850-7951
Adobe Creative Suite 5 Design Premium :

1407-1774-6464-0961-5577-3797
1325-1245-8536-3731-5649-0659
1325-1113-0107-7817-6293-2712
1325-1355-9394-6283-9724-7600
1325-1059-7531-1609-0601-5636
1325-1337-3209-8161-8985-5221
Adobe Premiere Pro CS5:

1325-1690-0603-1760-5083-6195
1325-1639-7577-9907-5036-7451
Adobe Lightroom 3 :

1160-4180-1304-4433-8182-0131
1160-4089-8059-2477-5747-3653
1160-4524-3826-2813-1878-0373
1160-4061-6875-7714-1191-2089
1160-4998-8932-9947-2948-1705
1160-4796-6424-4832-1184-5113
1160-4674-7526-7461-7646-0743
1160-4526-3596-3501-4568-7963
Adobe Photoshop CS5 :

1330-1331-8999-1502-9478-2917
1330-1142-0465-8003-9094-2819
1330-1316-4643-3923-8060-7538
1330-1671-4856-0278-6039-5990
1330-1647-2807-2131-5612-3113
1330-1069-7042-6518-2723-8340
1330-1273-0567-2526-5898-4518
1330-1700-2259-7564-5904-8654
1330-1456-7129-3124-9883-0945
1330-1978-0944-5190-8622-2482
1330-1729-4134-3278-5127-0701
1330-1195-9669-1964-1664-8624
1330-1053-1062-3663-3360-7919
1330-1721-2162-5454-2056-2287
1330-1266-3612-0814-0203-2212
1330-1398-3612-0601-3319-3385
1330-1559-1431-3534-8376-1995
1330-1121-1371-0736-8351-4437
1330-1168-5387-1370-1930-2853
1330-1710-0698-7698-7854-4790
1330-1554-8539-3561-0436-4419
1330-1522-1016-1028-5254-0575
1330-1114-2026-2783-5050-1059
1330-1415-4881-9987-0255-2828
1330-1024-9870-9107-3211-6777
1330-1005-5851-8724-6749-9129
1330-1302-5050-2968-0368-6016
1330-1243-3955-0795-5819-7078

Chating Program in VB 6.0

Server code
Private Sub Command1_Click()
On Error Resume Next
If Winsock1.State <> 7 Then
MsgBox "can not connected client", vbCritical, "error"
Else
Winsock1.SendData "message|" & Text1.Text
End If

End Sub

Private Sub Form_Load()
Winsock1.Close
Winsock1.LocalPort = 1111
Winsock1.Listen
End Sub

Private Sub Winsock1_Close()
Winsock1.Close
Winsock1.Listen
End Sub

Private Sub Winsock1_ConnectionRequest(ByVal requestID As Long)
Winsock1.Close
Winsock1.Accept requestID
End Sub

Private Sub Winsock1_DataArrival(ByVal bytesTotal As Long)
Dim recieve As String
Dim vector() As String
Winsock1.GetData recieve
vector() = Split(recieve, "|")
If (vector(0) = "message") Then
'MsgBox vector(1)
Text2.Text = vector(1)
End If
End Sub

Private Sub Winsock1_Error(ByVal Number As Integer, Description As String, ByVal Scode As Long, ByVal Source As String, ByVal HelpFile As String, ByVal HelpContext As Long, CancelDisplay As Boolean)
Winsock1.Close
Winsock1.Listen
End Sub

Clieint Code



Private Sub Command1_Click()
If Command1.Caption = "connect" Then
Command1.Caption = "disconnect"
Winsock1.Connect Text1.Text, 1111
Else
If Command1.Caption = "disconnect" Then
Command1.Caption = "connect"
Label1.Caption = "disconnect"
Winsock1.Close
End If
End If


End Sub

Private Sub Command2_Click()
On Error Resume Next
If Winsock1.State <> 7 Then
MsgBox "can not connected client", vbCritical, "error"
Else
Winsock1.SendData "message|" & Text2.Text
End If
End Sub

Private Sub Winsock1_Close()

Winsock1.Close
End Sub




Private Sub Winsock1_Connect()
Label1.Caption = "connected"
End Sub

Private Sub Winsock1_DataArrival(ByVal bytesTotal As Long)
Dim recieve As String
Dim vector() As String
Winsock1.GetData recieve
vector() = Split(recieve, "|")
If (vector(0) = "message") Then
'MsgBox vector(1)
Text3.Text = vector(1)
End If

End Sub

Private Sub Winsock1_Error(ByVal Number As Integer, Description As String, ByVal Scode As Long, ByVal Source As String, ByVal HelpFile As String, ByVal HelpContext As Long, CancelDisplay As Boolean)
Label1.Caption = "error"
Winsock1.Close

End Sub

search element from sort link list

//searching an element from sorted link list
#include<iostream.h>
#include<conio.h>
typedef struct node
{
int data;
struct node *link;
}NODE;
void main()
{
NODE *ptr,*prev,*start;
start=NULL;
clrscr();
cout<<"\nEnter 10 elements in array\n";
for(int i=0;i<10;i++)
{
ptr=new NODE();
cin>>ptr->data;
ptr->link=NULL;
if(start==NULL)
{
start=ptr;
}
else
{
prev->link=ptr;
}
prev=ptr;
}
//searching elements from sort list
int item;
cout<<"\nEnter element to be search \n";
cin>>item;
ptr=start;
int f=0;
NODE *loc;
loc=NULL;
while(ptr!=NULL)
{
if(item>ptr->data)
{
ptr=ptr->link;
}
else if(item==ptr->data)
{
f=1;
loc=ptr;
break;
}
else
{
loc=NULL;
break;
}
}
if(f==1)
cout<<"\nitem searched successfully at "<<loc;
else
cout<<"\nitem not find at"<<loc;
getch();
}

******output*******

Enter 10 elements in array
2
3
14
25
35
62
75
80
82
85

Enter element to be search
82

item searched successfully at 0x8fa50f5a

searching element in unsorted link list

//searching an element from an unsorted link list
#include<iostream.h>
#include<conio.h>
typedef struct node
{
int data;
struct node *link;
}NODE;
void main()
{
NODE *ptr,*prev,*start;
start=NULL;
clrscr();
cout<<"\nEnter 10 elements in array\n";
for(int i=0;i<10;i++)
{
ptr=new NODE();
cin>>ptr->data;
ptr->link=NULL;
if(start==NULL)
{
start=ptr;
}
else
{
prev->link=ptr;
}
prev=ptr;
}
//searching elements from unsort list
int item;
cout<<"\nEnter element to be search \n";
cin>>item;
ptr=start;
int f=0;
NODE *loc;
for(i=0;i<10;i++,ptr=ptr->link)
{
if(item==ptr->data)
{
f=1;
loc=ptr;
break;
}
}
if(f==1)
cout<<"\nitem searched successfully at "<<loc;
else
cout<<"\nitem not find";
getch();
}

*******output*******

Enter 10 elements in array
2
3
15
65
48
9
62
14
75
33

Enter element to be search
62

item searched successfully at 0x8fa40f46

link list in c

//implementation of link list in c
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
void main()
{
typedef struct node
{
int data;
struct node *link;
}NODE;
NODE *ptr,*start,*prev;
int i;
clrscr();
start=NULL;
printf("\nEnter 10 elements in array\n");
for(i=0;i<10;i++)
{
ptr=(NODE *)malloc(sizeof(NODE *));
scanf("%d",&ptr->data);
ptr->link=NULL;
if(start==NULL)
{
start=ptr;
}
else
{
prev->link=ptr;
}
prev=ptr;
}
ptr=start;
printf("\nElements in array\n");
for(i=0;i<10;i++,ptr=ptr->link)
printf("\na[%d]=%d",i,ptr->data);
getch();
}

*****output******

link list in cpp

//implementation of link list in cpp
#include<iostream.h>
#include<conio.h>
void main()
{
typedef struct node
{
int data;
struct node *link;
}NODE;
NODE *ptr,*start,*prev;
int i;
clrscr();
start=NULL;
cout<<"\nEnter 10 elements in array\n";
for(i=0;i<10;i++)
{
ptr=new NODE();
cin>>ptr->data;
ptr->link=NULL;
if(start==NULL)
{
start=ptr;
}
else
{
prev->link=ptr;
}
prev=ptr;
}
ptr=start;
cout<<"\nElements in array\n";
for(i=0;i<10;i++,ptr=ptr->link)
cout<<"\na["<<i<<"]="<<ptr->data;
getch();
}
*******output********

selection sort

//implementing selection sort
#include<iostream.h>
#include<conio.h>
void main()
{
int a[20],ptr,i,k,loc,min,temp;
clrscr();
cout<<"Enter the elements in array";
for(i=1;i<=10;i++)
{
cin>>a[i];
}
for(i=1;i<=10;i++)
{
min=a[i];
loc=i;
ptr=i+1;
while(ptr<=10)
{
if(min>a[ptr])
{
min=a[ptr];
loc=ptr;
}
ptr++;
}

temp=a[i];
a[i]=a[loc];
a[loc]=temp;
}
cout<<"Sorted array is\n";
for(i=1;i<=10;i++)
cout<<"\na["<<i<<"]="<<a[i];
getch();
}
********output**********

shell sort

//implement shell sorting
#include<iostream.h>
#include<math.h>
#include<conio.h>
const int size=10;
void main()
{
int a[size],gap,i,j,temp;
clrscr();
cout<<"\n\Enter elements in array\n";
for(i=0;i<size;i++)
cin>>a[i];
gap=size/2;
while(gap>0)
{
i=gap;
while(i<size)
{
temp=a[i];
j=i;
while(j>=gap && temp<a[j-gap])
{
a[j]=a[j-gap];
j=j-gap;
}
a[j]=temp;
i++;
}
gap=ceil(gap/2);
}
i=0;
cout<<"\nsorted array by shell sorting is\n";
while(i<size)
{
cout<<"\na["<<i<<"]"<<a[i];
i++;
}
getch();
}
*******output*******

radix sort

//implementation of radix sort for number by linked list
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
void radix(int [],int ,int);
void main()
{
int a[100],n,m,i;
printf("\nEnter no of no and no of digits\n");
scanf("%d%d",&n,&m);
printf("\nEnter elemets\n");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
radix(a,n,m);
printf("\nSorted array is\n");
for(i=0;i<n;i++)
printf("\na[%d]=%d",i,a[i]);
getch();
}
void radix(int a[],int n,int m)
{
typedef struct node
{
int data;
struct node *next;
}NODE;
NODE *ptr,*prev,*start;
NODE *front[10],*rear[10];
int i,j,k=1,y,p;
start=NULL;
for(i=0;i<n;i++)
{
ptr=(NODE *)malloc(sizeof(NODE *));
ptr->data=a[i];
ptr->next=NULL;
if(start==NULL)
start=ptr;
else
prev->next=ptr;
prev=ptr;
}
for(i=1;i<=m;i++)
{
for(j=0;j<10;j++)
front[j]=NULL;
ptr=start;
while(ptr!=NULL)
{
y=((ptr->data)/k)%10;
if(front[y]==NULL)
{
front[y]=ptr;
rear[y]=ptr;
}
else
{
rear[y]->next=ptr;
rear[y]=ptr;
}
ptr=ptr->next;
}
start=NULL;
for(j=0;j<10;j++)
{
if(front[j]!=NULL)
{
if(start==NULL)
start=front[j];
else
rear[p]->next=front[j];
p=j;
}
}
rear[p]->next=NULL;
k=k*10;
}
ptr=start;
for(i=0;i<n;i++,ptr=ptr->next)
a[i]=ptr->data;

}
*******output*********

//quick sort
#include<iostream.h>
#include<conio.h>
int quick(int [],int,int,int);
void main()
{
int top=-1,a[10],n=10,lower[10],upper[10],beg,end,loc;
clrscr();
cout<<"Enter the elements in array";
for(int i=0;i<10;i++)
cin>>a[i];
if(n>0)
{
top=top+1;
lower[0]=0;
upper[0]=n-1;
}
while(top!=-1)
{
beg=lower[top];
end=upper[top];
top=top-1;
loc=quick(a,n,beg,end);
if(beg<loc-1)
{
top=top+1;
lower[top]=beg;
upper[top]=loc-1;

}
if(loc+1<end)
{
top=top+1;
lower[top]=loc+1;
upper[top]=end;
}


}

cout<<"\nSorted array is";
for(i=0;i<10;i++)
cout<<"\n"<<a[i];
getch();

}
int quick(int a[],int n,int beg,int end)
{
int left,right,loc;
left=beg;
right=end;
loc=beg;
while(1)
{
while((a[loc]<=a[right]) && (loc!=right))
{
right=right-1;
}
if(loc==right)
return loc;
int temp;
if(a[loc]>a[right])
{
temp=a[loc];
a[loc]=a[right];
a[right]=temp;
loc=right;


}
while((a[left]<=a[loc]) && (left!=loc))
{
left=left+1;
}
if(loc==left)
return loc;
if(a[left]>a[loc])
{
temp=a[loc];
a[loc]=a[left];
a[left]=temp;
loc=left;
}
}
}
*********output*********
Enter the elements in array
11
2
5
3
5
88
9
93
12
16

Sorted array is
2
3
5
5
9
11
12
16
88
93