1. http://www.vi-improved.org/tutorial.php

2. http://vim.runpaint.org/toc/

3. http://www.swaroopch.com/notes/Vim_en:Table_of_Contents

If you want to learn more, checkout http://thomer.com/vi/vi.html#manuals

Here is a sample output of git reflog.

hari@hari-desktop:/var/www/recruit$ git reflog
e458f54 HEAD@{0}: checkout: moving from test1 to e458f54fe99202c82c2690be4fa2fe2d7aa7be32^0
a3281d1 HEAD@{1}: checkout: moving from master to test1
f265802 HEAD@{2}: checkout: moving from test1 to master
ef08492 HEAD@{3}: ORIG_HEAD: updating HEAD
e458f54 HEAD@{4}: commit: Implement phpunit testcase.
1ecf2c3 HEAD@{5}: commit: Bug#1 : MCQ Choices displayed in questions.
f265802 HEAD@{6}: checkout: moving from test1 to f265802d1d65a9ac92bf9f6414d8f468444cce66^0
ec280c6 HEAD@{7}: checkout: moving from release to test1
f265802 HEAD@{8}: merge master: Fast-forward
ccec6c4 HEAD@{9}: checkout: moving from master to release


All your commits, checkouts, pull, merges are logged in here. To, reset the git to any point in there, we use the following command.

git reset --hard <commit-id>

But if you push this to the git, you will find that the commit is rejected now. To forcefully push your new HEAD to server, we use the following command.

git push origin +<branch_name>

+ before the branch name forcefully pushes the branch (even if your current branch is behind the origin).
NOTE: Please be careful when you use the command above. You might lose all the changes made by others (temporarily) if you use it. Of course, using reflog + reset, you can get back the changes.

git log feature1 ^master

The above command displays all commits which are present in feature1 and not present in master.

Note 1: You can also try “git branch -d feature1″. If the new branch is not totally merged, git won’t delete the new branch.

Note 2: You can also try “git branch –contains feature1″, but I’m not sure how that works. I guess I’m happy with git log for now.

To read more about this, checkout http://stackoverflow.com/questions/1710894/using-git-show-all-commits-that-are-in-one-branch-but-not-the-others

Curious to know what the hell is this HTML5, I started reading something from https://developer.mozilla.org/en/HTML/HTML5. Well, truth be told, I finished the overview in say 15 minutes and didn’t know what exactly to do after that. I was in no mood to implement any of the HTML5 features in interviewstreet now (Btw, if you don’t know, interviewstreet.com is my company where we simplify the hiring process by assessing the candidates using automated tests.)

Then for the next 15 minutes, I started playing around with some of the demos at http://html5demos.com/. They are cool, but nothing new or mind blowing. We’ve already seen these stuff in flash and javascript using libraries like jquery, prototype etc. So, now the browser gives native support to these features. What’s the big deal?

I guess unless I create something using HTML5, I’m never gonna realize it’s true potential. I started with the canvas tag.

So, after loads of google search, copy pasted code and a few cups of coffee, here is my first HTML5 game. :) This is the screenshot of the game.

You can play the game at http://sp2hari.com/html5/burst_the_balloon.html.

TODO:
1. Some sort of levels in the game, where you are taken to the next level once you shoot all the balloons.
2. Display score, time taken and other details.
3. Two player game, where two players can shoot arrows from both the directions and one who gets the highest score wins.
4. A special balloon which gives you more score if you shoot it.
5. Better animation for arrow and balloon. Right now, the balloon looks like an egg.

Anyone interested in playing/learning with HTML5 can take up this code and implement something from the above TODO list. Do mail be back at sp2hari AT gmail DOT com if you implement anything or even if you have anything to say about this game :)

I’m very happy to present you Online Programming Contest Calendar (http://www.opccalendar.com/). This is something I wanted to do for Spider in college. All I could finish in college was a simple fetcher from algorithmist.com and topcoder.com. Now, I have everything I wanted to have in this new site. And yes, I hated the algorithmist.com calendar. There was so much I wanted to do for that calendar and the result is http://www.opccalendar.com/.

Some of the cool features I like in this site are.

• Long list of services like Twitter, Google Reader, Google Calendar, Google India SMS Channel, WordPress plugin, Firefox plugin and lots more.
• Alerts through Email, Orkut and Facebook are on the way.
• Automated parses for most of the common programming contests.
• Neat interface.

Things I would like to have in this soon. (Of course, depends on how much time I have to spend on this project)

• Accounts for each member, where they can choose the alerts they want to have. (probably Google accounts integration)
• Interface for members to add contests on their own.
• A simple forum

Any volunteers out there?

There are so many people who helped me in build this site. I guess this is right place to thank them.

Yazhini for helping me with the first prototype of the parser code to fetch from algorithmist.com. Written in C++ and still works cool :)
Vivek for helping me with the text context for this website.
Sindhu and her friends Sathyajith and Gautam for helping me with the ads.
Taggy for giving me webspace in his mediatemple account. Seriously, I should thank this guy for his continuous support with his mediatemple account.
Arvind, Vinod and Prasanna for their feedback during each iteration of this site.

Hope this becomes the one and only place which has all the details about programming contest.

How can you help me promote this site?
1. Keep this site url as GTalk status message. That will really help many many people know about this site.
2. Tell your geek friends about this site.

Wikipedia defines Dictionary attack as,

In cryptanalysis and computer security, a dictionary attack is a technique for defeating a cipher or authentication mechanism by trying to determine its decryption key or passphrase by searching likely possibilities.
A dictionary attack uses a brute-force technique of successively trying all the words in an exhaustive list (from a pre-arranged list of values). In contrast with a normal brute force attack, where a large proportion key space is searched systematically, a dictionary attack tries only those possibilities which are most likely to succeed, typically derived from a list of words in a dictionary. Generally, dictionary attacks succeed because many people have a tendency to choose passwords which are short (7 characters or fewer), single words found in dictionaries or simple, easily-predicted variations on words, such as appending a digit.


In this post, I’m going to write a simple code which will send POST requests to the web server and process the response of each request. Before I start, let me tell you that there are many softwares which already do this. Some of them are,

1. Burp Suite
2. John the Ripper

But what’s the fun in using a software and cracking something. :) The fun part is when YOUR code does something. After all, Code is Poetry (Check wordpress.org footer) ;)

For the demo here, I have this login page, which is very similar to my college mail server (or any horde server). The user-name and password for a successful login is “cs10528″ and “remember” respectively. If you provide a valid user-name/password combination, the page will display “Login Successful”. For any other user-name/password combination, the page will display “Login Failed”. So, now all we need is a code which can send POST request to the login page and a dictionary from which we can pick up the probable passwords.

This is the PHP code I’ve written to automate the login process. It reads from the “dict.txt” file and uses that to send the HTTP request. The code is well commented and main login process is done by curl functions. And finally, here is the dict.txt I’ve used for this demo. It has only around 25 words, so that the processing ends sooner. In case you are not comfortable with curl in php, you can see this post, which explains about curl basics.

You can see the whole login process in action here.

So, how can a web-master prevent these automatic logins?

1. Captcha
Adding a captcha prevents almost all the automatic login attempts. But be careful about what kind of captcha you choose. There are quite a few captchas which confuse people and scare them away.

2. Math Puzzles
Instead of images, you can ask the user to enter some simple arithmetic calculations (like what is 10+15). This loads much faster and prevents any confusion.

3. Maintaining the state in server
Store the login access time for each user, and if the time difference is less than 5 seconds, then block the user for next 10 minutes. This needs some more modification in the server side code, with new tables needed to store the login access time data.

Note :
1. The code posted here won’t work for horde. There are cookies and other stuff to be handled in many cases.

This is my third post on the series of articles I’m writing on C code obfuscation. You can check all the posts I’ve written about obfuscation here.

The task for this post is quite simple. Given two numbers a and b (b>a>3) as input, print all prime numbers in between a and b (including a and b).

Let me first paste final code here. I’ll be happy if you feel that you can’t make head or tail of it. ;-)


#define _$_ "%d",&I);I;})
Y,A,Z,H,I;main() {
#define __$__ ({ int I; scanf(_$_
#define FOR(_,__,___)for(_=__;_<___;+_++)
Y=__$__,A=__$__;FOR(Z,
#define T ({sscanf("2 is the only even prime number. Do you know that?", _$_
Y,A+T/2)FOR(H,T,Z)if(!(Z%H)||(H==Z-1&&printf("%d\n",Z)))break;}


Like the last post, we will start with a simple, clean code. The following code solves the given task.


#include <stdio.h>
int main() {
    int a, b, i, j;
    scanf("%d", &a);
    scanf("%d", &b);
    for (i=a ; i<=b; i++) {
        for (j=2; j<i; j++) {
            if (i%j == 0) {
                break;
            }
            else if (j==i-1) {
                printf("%d\n", j+1);
            }
        }
    }
    return 0;
}


First thing we see here is that we have two for loops. We can replace the for loops using preprocessor statement. This is a common time saving technique if you participate in online programming contests like Topcoder or SPOJ. Also let us remove {} for single line statements.


#define FOR(i,a,b) for(i=a;i<b;+i++)
int main() {
    int a, b, i, j;
    scanf("%d", &a);
    scanf("%d", &b);
    FOR(i, a, b+1)
        FOR(j, 2, i) {
            if (i%j == 0) break;
            else if (j==i-1 && printf("%d\n", i));
        }
    return 0;
}

Next step, we remove the return 0 statement and modify int main as simply main. Also we change all the integer variables we use in our code as global variables so that we need not defing their data type. Another modification that can be done here is to replace 2 by TWO and have a preprocessor statement to define TWO. This preprocessor statement is placed in between the for statement, just before we need the value 2.

Next modification is to is to remove the if else and have it in a single if statement. The idea used here is short-circuiting, so that there is no need for the else statement.


a,b,i,j,t;main(){
scanf("%d",&a);
scanf("%d",&b);
#define FOR(i,a,b) for(i=a;i<b;+i++)
FOR(i,a,b+1) FOR(j,
#define TWO 2
TWO,i)
if (i%j==0||(j==i-1&&printf("%d\n",i)))break;}


Next we see that #define TWO 2 is straight forward. So modify that as shown below. The catch here is that you can have any statement which starts with 2 and has any non digit character following the 2. That way sscanf will just store the value of 2 to TWO.


a,b,i,j,t; main(){
scanf("%d",&a);
scanf("%d",&b);
#define FOR(i,a,b) for(i=a;i<b;+i++)
FOR(i,
#define TWO ({sscanf("2 is the only even prime number. Do you know that?", "%d",&t);t;})
a,b+1) FOR(j,TWO,i) if(!(i%j)||(j==i-1&&printf("%d\n",i)))break;}


Finally, we see that we have 2 scanfs and 1 sscanf. The tail part of these functions are similar. Like
scanf(“%d”,&a);
scanf(“%d”,&b);
sscanf(“2 is the only even prime number. Do you know that?”, “%d”,&t);

In the above three statements, we see that “%d”, &variable); is common. So add one preprocessor statement to replace that as shown below. Rename the variables to single characters. I have used upper case here. ;-).


#define _$_ "%d",&I);I;})
Y,A,Z,H,I;main() {
#define __$__ ({ int I; scanf(_$_
#define FOR(_,__,___)for(_=__;_<___;+_++)
Y=__$__,A=__$__;FOR(Z,
#define T ({sscanf("2 is the only even prime number. Do you know that?", _$_
Y,A+T/2)FOR(H,T,Z)if(!(Z%H)||(H==Z-1&&printf("%d\n",Z)))break;}


You can download all the C files as a single zip file here.

In this post, we’ll see two techniques which one can use in C code obfuscation. The more we apply these to our code, the more obfuscated our code will result in. And of course, this is not the complete guide for obfuscation. Just the two important techniques I find interesting. :-)

Recursion
The first one is recursion. Yes recursion. :-) Well, before we start recursion we should know this. “To iterate is human, but to recurse is divine.” ;-). The great point about recursion is that it can make any simple code complicated. Before I explain what I’m going to do, let me post the code final code here.

T
=__LINE__;
#define FF T*T*T*T*T+T*T*T+T*T*T*T-T/T
char *___="He that falls in love with himself will have no rivals.";_$_(int _,int __){(__-_==(T/T)?printf("%c",*(___+_)):(_$_(_,(__-_)/T+_),_$_((__-_)/T+_, __)));}main(){_$_(T-T, FF);}

The code simply prints the quote “He that falls in love with himself will have no rivals.”, quoted by Benjamin Franklin.

So let us start with a simple code which does that.
#include <stdio.h>
int main() {
    printf("He that falls in love with himself will have no rivals.");
    return 0;
}

Now, let us see how to introduce recursion into this. You can say, to print a string, first print the first half of the string and then the second half of the string. Got it? Yes, it is like this

Print the string
    Print the first half of the string
        Print the first half of the first half of the string
        …
        …
        
        Print the second half of the first half of the string
        …
        ….
    Print the second half of the string
        Print the first half of the second half of the string
        …
        …
        
        Print the second half of the second half of the string
        …
        …

After we introduce recursion into this logic, we get a code similar to the following. Again, the code can be made further complicated. Just remember, there is no limit to obfuscation.

#include <stdio.h>
char *str = "He that falls in love with himself will have no rivals.";
void print(int start, int end) {
    if (end-start==1) {
        printf("%c", *(str+start));        
    }
    else {
        print(start, (end-start)/2+start);
        print((end-start)/2+start, end);
    }
}
int main() {
    print(0, 55);
    return 0;
}


Next, we remove the 2 in the else part of the code using #define. I use __LINE__ in this example. :). So now the code looks like this.

#include <stdio.h>
t=__LINE__;
char *str = "He that falls in love with himself will have no rivals.";
void print(int start, int end) {
    if (end-start==1) {
        printf("%c", *(str+start));        
    }
    else {
        print(start, (end-start)/t+start);
        print((end-start)/t+start, end);
    }
}
int main() {
    print(0, 55);
    return 0;
}

Next, we remove the if else in the print statement and have a single conditional statement. That changes the whole picture in the print function, as shown below.

#include <stdio.h>
t=__LINE__;
char *str = "He that falls in love with himself will have no rivals.";
void print(int start, int end) { (end-start==1?printf("%c", *(str+start)):(print(start, (end-start)/t+start),print((end-start)/t+start, end))); }
int main() {
    print(0, 55);
    return 0;
}

Finally we change all the variable names so that they have only _’s and remove unnecessary space. Also you can change the value 55 to as 32+16+8-1 (all of these generated only using the previously used 2). So this is the final code. :)

T
=__LINE__;
#define FF T*T*T*T*T+T*T*T+T*T*T*T-T/T
char *___ = "He that falls in love with himself will have no rivals.";_$_(int _,int __){(__-_==1?printf("%c", *(___+_)):(_$_(_,(__-_)/T+_),_$_((__-_)/T+_, __)));}main(){_$_(T-T, FF);}


Preprocessor Statements
The second technique I find interesting is using #ifdef, #else, #endif and #include. You can make any code obfuscated without much programming.

Again, let us take the same simple code to explain the usage of preprocessor statements. Though it is much more effective when you apply this to an obfuscated code.

So the sample code with which we start will be

#include <stdio.h>
int main() {
    printf("He that falls in love with himself will have no rivals.");
    return 0;
}

The resultant obfuscated code will be


#ifdef T1
    #ifdef T2
        #ifdef T3
            #ifdef T4
                }    //Line 5
            #else
                #define T4
                return 0;    //Line 4
                #include __FILE__
            #endif        
        #else
            #define T3
            printf("He that falls in love with himself will have no rivals.");    //Line 3
            #include __FILE__
        #endif
    #else
        #define T2
            int main() { //Line 2
        #include __FILE__
                
    #endif
#else
    #define T1
        #include <stdio.h> //Line 1
    #include __FILE__
#endif

I guess I can’t explain much on this. This is one simple concept in which preprocessor complies selected lines and then the same file is included again. :) If the above code is confusing, read this article on preprocessing and then try some simple code using this idea. Then this code will be a cakewalk.

You can download all the C files as a single zip file here.

Since this is the first post in this series, we will start with hello world. But instead of printing the same old hello world, we will print the quote “He that falls in love with himself will have no rivals.”, quoted by Benjamin Franklin.

We need a simple base program to start with right? The following code prints the quote.

#include
int main() {
char s[123] = "He that falls in love with himself will have no rivals.";
printf("%s", s);
return 0;
}

Surely, that is not the obfuscated code. First, let us convert the string into character array and instead of printing the string, we print the character array. Simple right? So the code now looks like this.

#include
int main() {
int i;
char s[] = {'H','e',' ','t','h','a', 't', ' ', 'f', 'a', 'l', 'l', 's', ' ', 'i', 'n', ' ', 'l', 'o', 'v', 'e', ' ', 'w', 'i', 't', 'h', ' ', 'h', 'i', 'm', 's', 'e', 'l', 'f', ' ', 'w', 'i', 'l', 'l', ' ', 'h', 'a', 'v', 'e', ' ', 'n', 'o', ' ', 'r', 'i', 'v', 'a', 'l', 's', '.'};
for (i=0; i<55; i++) {
printf("%c", s[i]);
}
return 0;
}


Next step, we take the two variables “i” and “s” outside the main. Since now the two variables are in global scope, if we don’t define the data type, it is an integer by default. Since we can define a character array as an integer array, we need not provide the datatype for both the variables. So now the code looks like this. Also we can change “int main” to “main” and remove the “return 0;” statement.

Note:: This idea of not defining the data type shouldn’t be used if you are practising for IOCCC. In there, the guidelines clearly states the following.
When declaring local or global variables, you should declare the type:

int this_is_ok;
this_is_not; <-- don't use such implicit type declarations

i, s[] = {'H','e',' ','t','h','a', 't', ' ', 'f', 'a', 'l', 'l', 's', ' ', 'i', 'n', ' ', 'l', 'o', 'v', 'e', ' ', 'w', 'i', 't', 'h', ' ', 'h', 'i', 'm', 's', 'e', 'l', 'f', ' ', 'w', 'i', 'l', 'l', ' ', 'h', 'a', 'v', 'e', ' ', 'n', 'o', ' ', 'r', 'i', 'v', 'a', 'l', 's', '.'};
main() {
for (i=0; i<55; i++) {
printf("%c", s[i]);
}
}

Next, we remove the 55 to the size of the array. We need to replace 55 by “sizeof(s)/sizeof(int)”. Let us do that in a better way as shown below. The two preprocessor statements added below to replaces ck by sizeof(s)/sizeof(int). The point to note here is that we have added the preprocessor statements in between the for statement.


i, s[] = {'H','e',' ','t','h','a', 't', ' ', 'f', 'a', 'l', 'l', 's', ' ', 'i', 'n', ' ', 'l', 'o', 'v', 'e', ' ', 'w', 'i', 't', 'h', ' ', 'h', 'i', 'm', 's', 'e', 'l', 'f', ' ', 'w', 'i', 'l', 'l', ' ', 'h', 'a', 'v', 'e', ' ', 'n', 'o', ' ', 'r', 'i', 'v', 'a', 'l', 's', '.'};
main() {
for (i=0;
#define f(z) sizeof(z)
#define ck f(s)/f(int)
i<ck; i++) {
printf("%c", i[s]);
}
}

Since i is a global variable, we need not initialize the value to 0. Again, we can remove the i++ statement by changing s[i] to s[i++]. And also note that a[i] and i[a] are both the same. So we can use i++[s]. So the code now becomes

i, s[] = {'H','e',' ','t','h','a', 't', ' ', 'f', 'a', 'l', 'l', 's', ' ', 'i', 'n', ' ', 'l', 'o', 'v', 'e', ' ', 'w', 'i', 't', 'h', ' ', 'h', 'i', 'm', 's', 'e', 'l', 'f', ' ', 'w', 'i', 'l', 'l', ' ', 'h', 'a', 'v', 'e', ' ', 'n', 'o', ' ', 'r', 'i', 'v', 'a', 'l', 's', '.'};
main() {
for (;
#define f(z) sizeof(z)
#define ck f(s)/f(int)
i<ck;
)
printf("%c", i++[s]);
}

Next, we remove the extra spaces so that the code is “poorly” aligned, as shown below. Also, now, we can replace the variable names by _ and __ etc. I haven’t done much to the character array here. That is not the aim of this post. Will write a separate post on manipulating strings. But for now, we can convert the character array to hexadecimal or octal numbers. ;-) (This is not the best way to obfuscate it though).

So the final code looks something like this.

#define ____(z) sizeof(z)
_, __[] = {0x48, 0x65, 0x20, 0x74, 0x68, 0x61, 0x74, 0x20, 0x66, 0x61, 0x6c, 0x6c, 0x73, 0x20, 0x69, 0x6e, 0x20, 0x6c, 0x6f, 0x76, 0x65, 0x20, 0x77, 0x69, 0x74, 0x68, 0x20, 0x68, 0x69, 0x6d,0x73, 0x65, 0x6c, 0x66, 0x20, 0x77, 0x69, 0x6c, 0x6c, 0x20,0x68, 0x61, 0x76, 0x65, 0x20, 0x6e, 0x6f, 0x20, 0x72, 0x69, 0x76, 0x61, 0x6c, 0x73, 0x2e}; main() { for (;
#define ___ ____(__)/____(int)
_<___;) printf("%c", _++[__]);}

All suggestions on still screwing up this code are welcome. ;-)

Update: You can download all the C files as a single zip file here.

If you play topcoder, then keeping track of when the next match is a big headache. There are many many people who login to the arena one day before the contest and ask why there is not many playing today. Come on, it is not funny to get up at 5.30 in the morning to know that the match is not today and it is tomorrow. The rest think the match is one day later, who curse themselves, bang their head for missing a match. If you want to forget forgetting :P about topcoder matches, follow the simple steps given below.

All you need is a Google Account.

• Login to google calendars at http://calendar.google.com/
• Search for “Topcoder” in public calendars. ( By clicking “Search Public Calendars” button). I got some 50 results when I wrote this. This may increase or decrease later. Choose anything from the list (anything from the first 5 will be good enough).
• Click on the “Add to Calendar” button.
• Go back to your calendar page. You can see the Topcoder calendar in the “Other calendars”.
• You need to activate mobile setup by activating your phone number. This takes less than a minute. Give your country and phone number. Google will send you a verification code in 1 or 2 minutes. Type that validation code there and voila, you are done with the mobile setup. :-)
• Now click on the “Calendars” tab in the settings page.
• Click the “Notification” of your new Topcoder calendar.
• Click the “Add a reminder” to add new remainders.
• You can have upto 5 remainders for this calendar.

See my notifications page here.

I have seen hundreds and hundreds of seg faults ;-) while coding for record module of LDTP and Spider SMS. But the one i saw yesterday was new, strange and fascinating. I am not sure whether i will be able to reproduce it again. The screenshot says why it is strange and fascinating :-) .

-bash-3.1$ man su
says

AUTHOR
Written by David MacKenzie.

REPORTING BUGS
Report bugs to <bug-coreutils@gnu.org>.

Maybe i should consider reporting this :P .