How to get your lost Linux OS after Installing a Windows crap

Requirement: An Ubuntu Linux Live CD / USB. In this case you can make do with anything that has GRUB-INSTALL package with the Live CD. But if you have access to the internet using that Live session then you can just Google things down and don't even need this post, right?

Method:
1. Launch the Live Session.
2. Bring up terminal and type: sudo su
this gives you the privilege of a root in the live session
3. Now type: fdisk -l
Lists up all the partitions present in your system. Look for the partition that has "Linux" in the rightmost column. Note it's /dev/sdx name from the left most column.
4. Type : mount /dev/sdx /mnt
Here /dev/sdx is the partition name that you noted. This command mounts that partition in mnt
5. Now type: grub-install --root-directory=/mnt/ /dev/sdx
Here /dev/sdx is the same thing as the previous command. Look at the output, the last line should say that the Installation went successful. VIOLA!!!

Reboot your system from your hard drive (normally) and hopefully the OSs should be there listed beautifully by GRUB. Smile!!!! Don't have to miss your favorite Linux distro.

Linux Mint FIrefox hanging up repeatedly for seconds, weird Google search page

I'm using Linux Mint Lisa (12) with GNOME 3 for a couple of months now. I'm impressed with the huge user support community and nice interface with the ease of using the same knowledge I had from Ubuntu. Recently the Firefox installation got somehow crapped up. It showed weird search results.

Moreover, the pages would repeatedly hang up. They would get updated (downloaded) but won't change until there was some cursor movement. It was real irritating. Thanks to "remoulder" from Linux Mint Forums, I found a nice method for repairing these things.

Close down Firefox > Press Alt + F2 > type "firefox -profilemanager" without the quotes

You'll see a default profile there. That profile is corrupted. Just create a new one using the options and start with the new one. All fixed.

Linux Mint 12 GNOME Freeze / Hang Up Problem

Linux Mint is probably the distro that fixes all the mistakes that Ubuntu makes. It's built on the Ubuntu base while keeping a very light weight taste to it.

Recently the Lisa (12) release of Mint was released with various Desktop Environment including GNOME. I've installed it and it was pretty good to me until a very annoying error was being caused by GNOME. It hung up at very random time forcing me to reboot the system using a Hard Boot. Later on I found this fix that reportedly solved the problem to some extent but still has some issues with Banshee Media Player. Anyway here's the how.

First download this file: Link 1
Go to the directory where you downloaded this file and run this command

sudo patch /usr/share/gnome-shell/extensions/mediaplayer@linuxmint.com/extension.js mgse-mediaplayer.diff 

Then download this file: Link 2

sudo patch /usr/share/gnome-shell/extensions/mediaplayer@linuxmint.com/extension.js mgse-mediaplayer.diff 

NOTE: Both the files have the same name so my commands are also same. But if you don't replace the first file with the second when downloading then you might need to change the command as per your file's name.

This should fix the problem.

Source: [ Launchpad, Linux Mint Forums ]

[UVa] 642 - Word Amalgamation

Very easy problem. Can be solved using bruteforce and C. A good opportunity to test my hands on multimap of C++.

Show/Hide Code

//Headers
#include <set>
#include <map>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <climits>
#include <clocale>
//Defines
#define pow2(i) (1<<i)
#define bit(i) (1<<i)
#define isOdd(i) (i&1)
#define isEven(i) (!(i&1))
#define isPrime(i) ((i==2) || ((i&1) && !pTest[i])) //pTest has to be the bool array's name
#define sz(i) i.size()
#define vec(type,name) vector< type > name
#define rep(i,a,b) for(int i=a ; i<=b ; i++)
#define swap(type,a,b) {type t=a; a=b; b=t;}
#define sum(a,n) ( (n*(n+1)/2) - (a-1)*a/2 )
#define iscap(i) (i>='A'&&i<='Z')
#define issmall(i) (i>='a'&&i<='z')
#define isnum(i) (i>='0'&&i<='9')
#define issymbol(i) (!(i>='a'&&i<='z') && !(i>='A'&&i<='Z') && !(i>='0'&&i<='9'))
#define mk(i,j) make_pair(i,j)
#define ERROR 1e-11
//Type Defs
typedef long long lint;
typedef unsigned long long ulint;
typedef long double ldouble;

using namespace std;

multimap<string, string> mp;

bool cmp(string a, string b)
{
    return (a<b);
}

int main()
{

    int i;
    string dc, st;
    vector<string> lst;

    multimap<string,string>::iterator it, xt;
    pair<multimap<string,string>::iterator, multimap<string,string>::iterator> ret;

    while ( cin >> dc )
    {
        if (dc == "XXXXXX") break;

        st = dc;
        sort(dc.begin(),dc.end());
        //cout << "STORING: " << dc << endl;
        mp.insert(pair<string,string>(dc,st));
    }



    while ( cin >> dc )
    {
        if (dc == "XXXXXX") break;

        sort(dc.begin(),dc.end());

        if ((int)mp.count(dc) == 0)
            cout << "NOT A VALID WORD" << endl;
        else
        {
            ret = mp.equal_range(dc);
            lst.clear();
            for (it=ret.first ; it!=ret.second ; ++it)
            {
                lst.push_back((*it).second);
            }
            sort(lst.begin(),lst.end());
            for (i=0 ; i<lst.size() ; i++)
            {
                cout << lst[i] << endl;
            }
        }
        cout << "******" << endl;

    }

    //     TEST CASE     //
    int kase=1, kounter=1;
    //freopen("input.txt","r",stdin);
    //freopen("outptu.txt","w+",stdout);

    return 0;
}

[UVa] 10903 - Rock-Paper-Scissors Tournament

The common mistake is there are not K games. There are K*N*(N-1)/2 Games. And Win Average is undefined when W+L = 0.

Show/Hide Code

//Headers
#include <set>
#include <map>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <climits>
#include <clocale>
//Defines
#define pow2(i) (1<<i)
#define bit(i) (1<<i)
#define isOdd(i) (i&1)
#define isEven(i) (!(i&1))
#define isPrime(i) ((i==2) || ((i&1) && !pTest[i])) //pTest has to be the bool array's name
#define sz(i) i.size()
#define vec(type,name) vector< type > name
#define rep(i,a,b) for(int i=a ; i<=b ; i++)
#define swap(type,a,b) {type t=a; a=b; b=t;}
#define sum(a,n) ( (n*(n+1)/2) - (a-1)*a/2 )
#define iscap(i) (i>='A'&&i<='Z')
#define issmall(i) (i>='a'&&i<='z')
#define isnum(i) (i>='0'&&i<='9')
#define issymbol(i) (!(i>='a'&&i<='z') && !(i>='A'&&i<='Z') && !(i>='0'&&i<='9'))
#define mk(i,j) make_pair(i,j)
#define ERROR 1e-11

#define rock "rock"
#define paper "paper"
#define scissors "scissors"
//Type Defs
typedef long long lint;
typedef unsigned long long ulint;
typedef long double ldouble;

using namespace std;

int pw[200], pl[200];

int main()
{
    //     TEST CASE     //
    int kase=1, kounter=1;
    //freopen("input.txt","r",stdin);
    //freopen("outptu.txt","w+",stdout);

    string m1, m2;
    int p1, p2, i, n, k;
    double w;
    bool pr=false;

    cout.precision(3);

    while ( cin >> n )
    {
        if (!n) break;

        cin >> k;

        w=-1000;

        if (pr) cout << endl;
        if (!pr) {pr=true;}


        k = k*n*(n-1)/2;


        for (i=0 ; i<=100 ; i++) pw[i]=pl[i]=0;
        while (k--)
        {
            cin >> p1 >> m1 >> p2 >> m2;

            if (m1==rock && m2==scissors) { pw[p1]++; pl[p2]++; }
            if (m1==rock && m2==paper) { pw[p2]++; pl[p1]++; }

            if (m1==paper && m2==rock) { pw[p1]++; pl[p2]++; }
            if (m1==paper && m2==scissors) { pw[p2]++; pl[p1]++; }

            if (m1==scissors && m2==rock) { pw[p2]++; pl[p1]++; }
            if (m1==scissors && m2==paper) { pw[p1]++; pl[p2]++; }
        }

        for (i=1 ; i<=n ; i++)
        {
            w = ((double)pw[i] / (double)(pw[i]+pl[i]));


            if (pw[i]+pl[i]==0) printf("-\n");
            else printf("%.3lf\n",w);


        }



    }

    return 0;
}