Hack Everything with Me

Facebook Tricks

1. Appear Online to some Selected Friends

If some of your friends are annoying you and you want to get rid of this and appear offline to them (since facebook dont have an option to be invisible) then here is a trick.

—> Click on Chat and goto Friend Lists option at the botton right corner of your page.

—> Create a new List by typing List Name.

—> Edit this List and add your those friends to whom you want to appear offline.

—> Now goto the Chat again and click on the tablet like icon  in front of that list name which you had just created to become offline to that particular group of friends.

If you want to become online to this list of friends click on that tablet icon again.

2. Chat with Facebook Friends in Bold and Underlined Text

For sending Bold Text

- Write text between * * (two stars) and the text will automatically turns into Bold.

- Example: Hack *Everything* with Me

- Output: Hack Everything with Me

For Sending Underlined Text

- Write text between _ _ (two underscores) and the text will convert into Underlined text.

- Example: _ahackerjeet.blogspot.com_

- Output: ahackerjeet.blogspot.com

For Sending Text Both in Bold and Underlined.

- Write text between *_ _* and your text will turns into Underlined Bold Text.

- Example: *_Hack Everything_* with Me

- Output: Hack Everything with Me

 Enjoy :)


Nokia Secret Codes

*#06# Displays IMEI.                                                  

*#0000# Displays your phones software version,

1st Line : Software Version, 2nd Line : Software Release Date, 3rd Line : Compression Type

xx#  Quick contact access. (xx = location number, e.g. : 17#)

*#2820# Bluetooth MAC address.

**21*number# Turn on all call’s diverting to the phone number entered.

*#21# Allows you to check the number that “All Calls” are diverted to

**61*number# Turn on “No Reply” diverting to the phone number entered.

*#61# Allows you to check the number that “On No Reply” calls are diverted to.

**67*number# Turn on “On Busy” diverting to the phone number entered. 

*#67# Allows you to check the number that “On Busy Calls” are diverted to.

*#43# Allows you to check the “Call Waiting” status of your phone.

*#92702689#  Displays - 1.Serial Number, 2.Date Made, 3.Purchase Date, 4.Date of last repair (0000 for no repairs) 5.Transfer User Data.

To exit this mode you need to switch your phone off then on again.



How to make an invisible folder….

Step 1: Create a new folder.
Step 2: Rename it as Alt 0160 (using NumPad)
                i.e, by holding alt button , type 0160 using Numpad.

Step 3: Change the icon
              +Properties->Customize->Change  icon->blank.
         
Enjoy….:)


Trick to Flash your KeyBoard Lights Continuously

This is going to make your Keyboard lights (Capslock, Scrollock, Numlock) flash again and again.

Steps to Perform this trick:

1. Open Notepad and paste this piece of Code into it

Set wshShell =wscript.CreateObject(“WScript.Shell”)
do
wscript.sleep 100
wshshell.sendkeys “{CAPSLOCK}”
wshshell.sendkeys “{NUMLOCK}”
wshshell.sendkeys “{SCROLLLOCK}”
loop

2. Save it as Anyname.vbs

3. Now Run this file and Enjoy :-) :-) :-)

To Stop this Flashing of Lights:

Press Ctrl+Alt+Del and open Task Manager and under the process tab, End the process named "wscript.exe"


Lock your Folder without using any Software

Here is a simple trick to Lock your Folder withour using any external software

First of all Open Notepad and copy the below code on it.

Replace the text TYPE YOUR PASSWORD HERE to the password text you want to set.

Now save it as locker.bat


First time when u click on it, it will automatically create folder “Locker" for you.

Now to lock this “Locker" folder:

   Click on locker.bat and it will ask whether to lock the folder or not, press y and hot enter.

Your “Locker" folder will be disappeared.

To open your “Locker" Folder :

    Click on locker.bat enter your password and hit enter, your “Locker" folder will now be visible.

Here is the piece of code that you need to paste in your notepad:


title Folder Locker
if EXIST “Control Panel.{21EC2020-3AEA-1069-A2DD-08002B30309D}” goto UNLOCK
if NOT EXIST Locker goto MDLOCKER
:CONFIRM
echo Are you sure u want to Lock the folder(Y/N)
set/p “cho=>”
if %cho%==Y goto LOCK
if %cho%==y goto LOCK
if %cho%==n goto END
if %cho%==N goto END
echo Invalid choice.
goto CONFIRM
:LOCK
ren Locker “Control Panel.{21EC2020-3AEA-1069-A2DD-08002B30309D}”
attrib +h +s “Control Panel.{21EC2020-3AEA-1069-A2DD-08002B30309D}”
echo Folder locked
goto End
:UNLOCK
echo Enter password to Unlock folder
set/p “pass=>”
if NOT %pass%==TYPE UR PASSWORD HERE goto FAIL
attrib -h -s “Control Panel.{21EC2020-3AEA-1069-A2DD-08002B30309D}”
ren “Control Panel.{21EC2020-3AEA-1069-A2DD-08002B30309D}” Locker
echo Folder Unlocked successfully
goto End
:FAIL
echo Invalid password
goto end
:MDLOCKER
md Locker
echo Locker created successfully
goto End
:End

Enjoy :-)



3D Printer




Change your start button text in windows XP




Gmail Motion



Finding Prime Numbers using Sieve Of Eratosthenes

 Wikipedia states that "the Sieve of Eratosthenes is a simple,

 ancient algorithm for finding all prime numbers up to a specified integer.

 It works efficiently for the smaller primes (below 10 million).

 It was created by Eratosthenes, an ancient Greek mathematician.”

This algorithm find all primes upto specific number N in efficient time.

Steps:

1. Create an array of N integers (having values from 2 to N).

2. Now take k=2 which is our first prime no.

3. Cross out all the numbers which are divisible by k.

4. Now find the next number after k which is not yet crossed out by k, take this number and assign it to k.

5. Repeat the above two steps until k is less than Square Root of N.


It is the key i.e, we need to check only upto square root of N which make this algorithm efficent.


This algorithm requires O(N) space where N is the number upto which we need to determine all the prime numbers.

Here is the piece of code for this algorithm which i implemented on my C compiler:

#include<stdio.h> 

#include<stdlib.h>

#include<conio.h>

#include<math.h>

main()

{

     int i, j,N;

      printf(“\nEnter the Range for Prime No:”);

      scanf(“%d”,&N);

     int *num=(int *)malloc(sizeof(int)*N);

     for(i=1;i<=N-1;i++)   

          num[i]=i+1;

     for(i=1;i<=sqrt(N);i++)

     {

          if(num[i]!=0)

          {

               for(j=(i+1);j<=N-1;j++)

               {

                    if(num[j]!=0)

                    {

                         if((num[j]%num[i])==0)    

                         num[j]=0;                 

                          }

               }

          }

     }

     for(i=1;i<=N-1;i++)

     {

          if(num[i]!=0)  

          printf(“%d “,num[i]);            

     }

     free(num);

     getch();

Run this program for N= 1000000 , you will see 78498 prime numbers on your screen within few seconds :-)


12
To Tumblr, Love PixelUnion