scholarship

http://www.moedu.gov.bd
http://www.edunewsbd.com

IELTS exam registration

http://takeielts.britishcouncil.org/locations/bangladesh

scholarship news

http://www.higherstudyabroad.com
http://www.shikkhok.com/%E0%A6%95%E0%A7%8B%E0%A6%B0%E0%A7%8D%E0%A6%B8-%E0%A6%A4%E0%A6%BE%E0%A6%B2%E0%A6%BF%E0%A6%95%E0%A6%BE/higherstudyabroad/

http://www.ontaheen.com/scholarship/

check my ip info

http://www.earnz.net/visitor-info/
http://www.ipaddresslocation.org/ip-address-locator.php

access tnt number.

http://203.112.222.42

phone number is the password.

torrent download

http://yify-torrents.com

key

http://www.kgdbase.com

UVa 11926 - Multitasking Solution

#include<iostream>
#include<cstdio>
#include<list>
#include<string>
#include<cstring>
#include<sstream>
#include<cctype>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<stack>
#include<fstream>
#include<cstdlib>
#include<vector>
#include<map>
#include<set>
#include<utility>
#include<iomanip>
#include<queue>
#include<deque>
#include<iterator>
#include<assert.h>
#include<bitset>
#include<climits>
#include<ctime>
#include<complex>

using namespace std;

#define SET(a) memset(a,-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define CLR(a) memset(a,0,sizeof(a))
#define PB push_back
#define PI acos(-1.0)
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define READ freopen("input.txt", "r", stdin)
#define WRITE freopen("output.txt", "w", stdout)
#define LL long long

#define S(a) scanf("%d",&a)
#define S2(a,b) scanf("%d%d",&a,&b)
#define KS printf("Case %d: ",kk++)

#define MOD 1000000007
#define MX 1000010

bool arr[MX+2];
int main()
{
    int a,b,c,w,x,y,z,n,m,u,v,cnt,mx,mn,p,q,r,sum,inter,st,ed;
    string s,s2;
    while(cin>>n>>m)
    {
        if(!n && !m) break;
        CLR(arr);
        bool chk=true;
        for(int i=0;i<n;i++)
        {
            cin>>x>>y;
            if(chk)
                for(int j=x;j<y;j++)
                {
                    if(arr[j])
                    {
                        chk=false;
                        break;
                    }
                    else arr[j]=1;
                }
        }
        for(int i=0;i<m;i++)
        {
            cin>>x>>y>>inter;
            if(chk)
            {
                st=x;
                ed=y;
                while(st<MX)
                {
                    if(ed>MX)
                        ed=MX;
                    for(int j=st;j<ed;j++)
                    {
                        if(arr[j])
                        {
                            chk=false;
                            break;
                        }
                        else arr[j]=1;
                    }
                    if(!chk)    break;
                    st+=inter;
                    ed+=inter;
                }
            }
        }
        if(chk) cout<<"NO CONFLICT"<<endl;
        else cout<<"CONFLICT"<<endl;

    }
    return 0;
}

codechef bd ranking

http://www.codechef.com/rankings/APRIL13/BD

UVa 12250 - Language Detection Solution

#include<iostream>
#include<cstdio>
#include<list>
#include<string>
#include<cstring>
#include<sstream>
#include<cctype>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<stack>
#include<fstream>
#include<cstdlib>
#include<vector>
#include<map>
#include<set>
#include<utility>
#include<iomanip>
#include<queue>
#include<deque>
#include<iterator>
#include<assert.h>
#include<bitset>
#include<climits>
#include<ctime>
#include<complex>

using namespace std;

#define SET(a) memset(a,-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define CLR(a) memset(a,0,sizeof(a))
#define PB push_back
#define PI acos(-1.0)
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define READ freopen("input.txt", "r", stdin)
#define WRITE freopen("output.txt", "w", stdout)
#define LL long long

#define S(a) scanf("%d",&a)
#define S2(a,b) scanf("%d%d",&a,&b)
#define KS printf("Case %d: ",kk++)

#define MOD 1000000007
#define MX 100010

int main()
{
    int kk=1,a,b,c,w,x,y,z,n,m,u,v,cnt,mx,mn,p,q,r,sum;
    string s,s2;
    while(cin>>s)
    {
        if(s=="#") break;
        cout<<"Case "<<kk++<<": ";
        if(s=="HELLO")   cout<<"ENGLISH";
        else if(s=="HOLA")    cout<<"SPANISH";
        else if(s=="HALLO")   cout<<"GERMAN";
        else if(s=="BONJOUR") cout<<"FRENCH";
        else if(s=="CIAO")    cout<<"ITALIAN";
        else if(s=="ZDRAVSTVUJTE")  cout<<"RUSSIAN";
        else cout<<"UNKNOWN";
        cout<<endl;

    }
    return 0;
}

UVa 459 - Graph Connectivity Solution

#include<iostream>
#include<cstdio>
#include<list>
#include<string>
#include<cstring>
#include<sstream>
#include<cctype>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<stack>
#include<fstream>
#include<cstdlib>
#include<vector>
#include<map>
#include<set>
#include<utility>
#include<iomanip>
#include<queue>
#include<deque>
#include<iterator>
#include<assert.h>
#include<bitset>
#include<climits>
#include<ctime>
#include<complex>

using namespace std;

#define SET(a) memset(a,-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define CLR(a) memset(a,0,sizeof(a))
#define PB push_back
#define PI acos(-1.0)
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define READ freopen("input.txt", "r", stdin)
#define WRITE freopen("output.txt", "w", stdout)
#define LL long long

#define S(a) scanf("%d",&a)
#define S2(a,b) scanf("%d%d",&a,&b)
#define KS printf("Case %d: ",kk++)

#define MOD 1000000007
#define MX 100010

bool vis[30];
vector<int>adj[30];

void dfs(int node)
{
    vis[node]=1;
    for(int i=0;i<adj[node].size();i++)
    {
        int v=adj[node][i];
        if(!vis[v]) dfs(v);
    }
    return;
}
int main()
{
    int a,b,tc,c,w,x,y,z,n,m,u,v,cnt,mx,mn,p,q,r,sum;
    char s[3];
    cin>>tc;
    scanf("\n");
    while(tc--)
    {
        gets(s);
        n=s[0]-'A';
        CLR(vis);
        for(int i=0;i<=n;i++)   adj[i].clear();

        while(gets(s) && s[0])
        {
            adj[s[0]-'A'].push_back(s[1]-'A');
            adj[s[1]-'A'].push_back(s[0]-'A');
        }

        cnt=0;
        for(int i=0;i<=n;i++)
            if(!vis[i])
                dfs(i), cnt++;
        cout<<cnt<<endl;
        if(tc) cout<<endl;

    }
    return 0;
}