<![CDATA[Shipu's Blog]]>https://shipuahamed.com/http://shipuahamed.com/favicon.pngShipu's Bloghttps://shipuahamed.com/Ghost 4.22Tue, 07 Apr 2026 19:46:16 GMT60<![CDATA[How I setup my Development Environment on macOS 2022 Edition]]>

Package Manager

  • Homebrew
    /bin/bash -c "$(curl -fsSL https://raw.githubusercontent.com/Homebrew/install/HEAD/install.sh)"
  • NVM
    brew install nvm
  • Composer
    brew install composer

Browsers

]]>https://shipuahamed.com/how-i-setup-my-development-environment-on-macos-2022-edition/621205f526d1e5142eecd1a9Sun, 20 Feb 2022 10:06:40 GMT

Package Manager

  • Homebrew
    /bin/bash -c "$(curl -fsSL https://raw.githubusercontent.com/Homebrew/install/HEAD/install.sh)"
  • NVM
    brew install nvm
  • Composer
    brew install composer

Browsers

Terminal

IDE

Dev Tools

Editor

Database Client

Communications

API Platform

Project Management

Music

CDN

Blog

UI/UX

Server

Others

]]><![CDATA[The Adapter Design Pattern]]>https://shipuahamed.com/the-adapter-design/61a0be421ddff808acb336c1Tue, 22 Sep 2020 00:00:00 GMT

Adapter Pattern বুজতে আপনার একদমই অসুবিধা হবে না কারণ আপনি জানেন Adapter Pattern কি । এখন হয়তো ভাবছেন আমি কিভাবে জানি । চলেন দেখি ।

The Adapter Design Pattern
Source from google

আপনারা সবাই মেমরি কার্ড দেখে থাকবেন । যখন মেমরি কার্ড থেকে কোন ফাইল আপনার কম্পিউটার বা ল্যাপটপ Transfer করতে চান আর যখন দেখেন মেমরি কার্ড থেকে ফাইল Transfer করার মত কিছুই নেই কম্পিউটার বা ল্যাপটপ তখন নিশ্চয় আপনি কার্ড রিডার অথবা Adapter ব্যবহার করেছেন ।

The Adapter Design Pattern
The Adapter Design Pattern

কি বুঝো নাই ব্যাপারটা !!! আরে ব্যাপার না চলেন আরও একটা Example দেয়া যাক ।

ধরুন আপনি আপনার Laptop নিয়ে কোথায় ঘুরতে গেছেন । Laptop টা যখন চার্জ দিতে গেলেন, দেখলেন আপনার Laptop এর চার্জার পোর্ট তিন পিনের । আর যেখানে চার্জ দিবেন সেটার পোর্ট দুই পিনের তখন আপনি কি করবেন ??

The Adapter Design Pattern
The Adapter Design Pattern
The Adapter Design Pattern
The Adapter Design Pattern



নিশ্চয় একটা Adapter ইউজ করবেন । Adapter pattern ও একি রকম, ব্যতিক্রম কিছু না । তাহলে চলুন দেখি Adapter Pattern কিভাবে Implement করা যায় ।

শুরুতেই একটা Problem নিয়ে আলোচনা করি । ধরুন আপনার একটা website আছে এবং কিছু ইউজারও আছে তাদের Facebook ফ্রেন্ডস এবং কতগুলো পোস্ট করেছে সেটা জানতে চান । দেখা যাক তাহলে কিভাবে করা যায় ।

class Facebook
{
    public function getFriends()
    {
        var_dump(“get all facebook friends”);
    }

    public function getPosts()
    {
        var_dump(“get all facebook posts”);
    }
}

class Person
{
    public function social( $social )
    {
        $social->getPosts();
        $social->getFriends();
    }
}

$person = new Person();
$person->social(new Facebook());

এইতো হয়ে গেছে, খুব সহজ না । কিন্তু এই মুহূর্তে আপানার বস এসে আপনাকে বলল উনি twitter -এর সকল Followers and Tweets ও জানতে চায় । এই শুনে আপনি হয়তো মনে মনে বলবেন আগে বলতে কি হয়ে..ছি..লো গো মনু । ধরে নিচ্ছি আপনি আবার একটু চালাক প্রকৃতির আপনি বুঝতে পারছেন যে সামনে আরও চেঞ্জ আসতে পারে । তাই এমন কিছু চাচ্ছেন যে সামনে এমন কিছু আবার আসলে আপনি যেন সহজে সামাল দিতে পারেন । আর সেই জন্যই মূলত আমরা আজকে Adapter Pattern শিখছি । চলেন স্টেপ বাই স্টেপ দেখি । শুরুতেই Twitter ক্লাস বানায় ফেলি ।

<?php

class Twitter
{
    public function getFollowers()
    {
        var_dump("get Twitter followers");
    }

    public function getTweets()
    {
        var_dump("get all twitter tweets");
    }
}

class Person
{
    public function social( $social )
    {
        $social->getPosts();
        $social->getFriends();
    }
}

$person = new Person();

$person->social(new Facebook());

$person->social(new Twitter());

এখন রান করি । দেখা যাচ্ছে একটা ERROR । কারণ getPosts নামে Twitter ক্লাসে কোন মেথড নেই । এখানে শুধু মাত্র getPosts and getFriend মেথডই Allow করবে ।ধরে নেই Person ক্লাস আপনার পুরো web application এবং আপনি চাচ্ছেন না মেজর কিছু চেঞ্জ করতে । তাহলে কি করবেন ?? তাহলে যেটা করতে হবে Person ক্লাসের social মেথডটা একটা Contract এর মধ্যে নিয়ে আসতে হবে । যেমনঃ

interface SocialInterface
{
    public function getFriends();

    public function getPosts();
}

এবং Person ক্লাসের social মেথডটা শুধু মাত্র SocialInterface Contract ই Allow করবে । এইবার আমাদের আপডেটের কোড হবে এই রকম

<?php

interface SocialInterface
{
    public function getFriends();

    public function getPosts();
}

class Twitter
{
    public function getFollowers()
    {
        var_dump("get Twitter followers");
    }

    public
    function getTweets()
    {
        var_dump("get all twitter tweets");
    }
}

class Person
{
    public function social(SocialInterface $social)
    {
        $social->getPosts();
        $social->getFriends();
    }
}

$person = new Person();
$person->social(new Facebook());
$person->social(new Twitter());

আবার রান করি । আবারো Error কারণ twitter class সেই SocialInterface contract টা Follow করে না । এখন হয়তো মনে মনে আমাকে গালি দিচ্ছেন এতো কষ্ট ক্যান করাইলেন পয়েন্ট আসেন ভাই পয়েন্টে ।

প্রতীক্ষার পালা শেষ হলো । এখন আমার Twitter — এর জন্য একটা Adapter লিখবো ।

// ... previous code ...

class TwitterAdapter implements SocialInterface
{
    /**
     * @var Twitter
     */
    protected $twitter;

    public function __construct(Twitter $twitter)
    {
        $this->twitter = $twitter;
    }

    public function getFriends()
    {
        $this->twitter->getFollowers();
    }

    public function getPosts()
    {
        $this->twitter->getTweets();
    }
}

$person = new Person();
$person->social(new Facebook());
$person->social(new TwitterAdapter(new Twitter()));

দেখেন কত সহজে আমরা করে ফেললাম । কিন্তু আপানার বস এতেও সন্তুষ্ট না যা আপনি আগেই জানতেন । তিনি এবার linkedin -এর সকল conections and feeds জানতে চাচ্ছে । কিন্তু আপনার টেনশন নেয়ার কোন কারণ নেই । কারণ পুরো Application এর কোথাও আপনাকে চেঞ্জ করতে হবে না । অবাক হওয়ার কোন কারণ নেই, কিভাবে করবো চলেন দেখে আসি ।

class LinkedInAdapter implements SocialInterface
{
    /**
     * @var LinkedIn
     */
    protected $linkedIn;

    public function __construct(LinkedIn $linkedIn)
    {
        $this->linkedIn = $linkedIn;
    }

    public function getFriends()
    {
        $this->linkedIn->getConnections();
    }

    public function getPosts()
    {
        $this->linkedIn->getFeeds();
    }
}

class LinkedIn
{
    public function getConnections()
    {
        var_dump("get all linkedin connections");
    }

    public function getFeeds()
    {
        var_dump("get all linkedin feeds");
    }
}

// ... previous code ...
$person->social(new LinkedInAdapter(new LinkedIn()));

সো এই ছিল Basically Adapter Pattern । Adapter Pattern এর আরও Example দিতে চাইলে আপনি Multiple Payment Gateway দিয়ে কাজ করতে পারেন যা শুরুতে হয়তো একটা Payment Gateway নিয়ে কাজ করেছেন পরবর্তীতে আরো কিছু Payment Gateway সংযুক্ত করতে চাইলে । এছাড়া লারাভেলে কাজ করে থাকলে লারাভেল filesystem ও কিন্তু Adapter Pattern এ করা, চাইলে দেখে নিতে পারেন ।

Full Code পাবেন এইখানে ।

খুব ভালো করে লিখতে জানি না এবং খুব ভালো বুঝাতেও পারি নাহ তবু চেষ্টা করেছি এবং চেষ্টা করেই যাবো ইন শাহ্‌ আল্লাহ্‌ । সামনে আর কিছু Design Pattern নিয়ে লেখার ইচ্ছা আছে । ভালো থাকবেন আল্লাহ্‌ হাফেজ ।

]]><![CDATA[UVA 913 - Joana and the Odd Numbers]]>https://shipuahamed.com/uva-913-joana-and-the-odd-numbers/61a0be421ddff808acb336beMon, 31 Aug 2020 20:26:44 GMTProblem PDF

Solution:

#include
int main()
{
    long long n;
    while (scanf("%lld",&n)==1)
    printf("%lld\n",((n*(n+2))/2)*3-6);
return 0;
}
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/913/913.cpp
]]><![CDATA[UVA 871 - Counting Cells in a Blob]]>https://shipuahamed.com/uva-871-counting-cells-in-a-blob/61a0be421ddff808acb336bdMon, 31 Aug 2020 20:26:43 GMTProblem PDF

Solution:

/******************************************************************
***   Problem       :                                           ***
***   Author        : Shipu Ahamed (Psycho Timekiller)          ***
***   E-mail        : shipuahamed01@gmail.com                   ***
***   University    : BUBT,Dept. of CSE                         ***
***   Team          : BUBT_Psycho                               ***
***   My Blog       : http://shipuahamed.blogspot.com           ***
***   Facebook      : http://www.facebook.com/DeesheharaShipu   ***
******************************************************************/

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

#define pi 2*acos(0.0)
#define all(v) v.begin(),v.end()

//input
#define si(t) scanf("%d",&t)
#define sl(t) scanf("%lld",&t)
#define sf(t) scanf("%f",&t)
#define sd(t) scanf("%lf",&t)
#define sc(c) scanf("%c",&c)
#define sii(a,b) scanf("%d%d",&a,&b)
#define sll(a,b) scanf("%lld%lld",&a,&b)

//Output
#define P(a) printf("%d\n",a)
#define PL(a) printf("%lld\n",a)
#define PF(a) printf("%f\n",a)
#define PD(a) printf("%lf\n",a)
#define PS(a) printf("%s\n",a)
#define PSN(a) printf("%s ",a)
#define PN(a) printf("%d ",a)
#define PLN(a) printf("%lld ",a)
#define PFN(a) printf("%f ",a)
#define PDN(a) printf("%lf ",a)
#define PP(a,b) printf("%d %d\n",a,b)
#define PPN(a,b) printf("%d %d ",a,b)
#define PPL(a,b) printf("%lld %lld\n",a,b)
#define PPLN(a,b) printf("%lld %lld ",a,b)

#define CP(a) cout< vi;
typedef  vector vll;
typedef  vector vs;
typedef  set si;
typedef  set ss;
typedef  map mii;
typedef  map mll;
typedef  map msi;
typedef  map mci;

template string toString( T Number ){stringstream st;st << Number;return st.str();}
template  T SOD(T n) {__typeof(n) sum=0;for(__typeof(n) i=1;i*i<=n;i++)sum+=(n%i)?0:((i*i==n)?i:i+n/i);return sum;}

//For Define
#define forab(i,a,b) for(__typeof(b) i=(a);i<=(b);i++)
#define for0(i,n) forab(i,0,(n)-1)
#define for1(i,n) forab(i,1,n)
#define rforab(i,b,a) for(__typeof(b) i=(b);i>=(a);i--)
#define rfor0(i,n) rforba(i,(n)-1,0)
#define rfor1(i,n) rforba(i,n,1)
#define forstl(i,s) for(__typeof((s).end()) i=(s).begin(); i != (s).end(); i++)

//Debug
#define dbg(x) cout << #x << " -> " << (x) << endl;
#define dbgsarr(i,a) cout<<#a<<"["< "< "< "<>p ; return p;}

ll pow(ll a,ll b, ll m) { ll res = 1; while(b) { if(b & 1) { res = ( (res % m) * (a % m) ) %m ; } a= ((a%m) * (a%m)) %m; b >>= 1; } return res; }
ll modInverse(ll a, ll m){return pow(a,m-2,m);}

////============ CONSTANT ===============////
#define mx7   10000007
#define mx6   1000006
#define mx5   100005
#define inf   1<<30                                           //infinity value
#define eps   1e-9
#define mx    (100010)
#define mod   1000000007
////=====================================////

int cnt,a[30][30],r,c;

void dfs(int i,int j)
{
    if(i>=r || i<0 || j<0 || j>=c || a[i][j]==0) return;
    cnt++;
    a[i][j]=0;

    dfs(i,j+1);
    dfs(i,j-1);
    dfs(i+1,j);
    dfs(i-1,j);
    dfs(i+1,j+1);
    dfs(i+1,j-1);
    dfs(i-1,j+1);
    dfs(i-1,j-1);
}

int main()
{
    int t;
    si(t);
    getchar();
    getchar();
    while(t--)
    {
        int i=0,n;
        string s;

        while(getline(cin,s) && sz(s))
        {
            n=sz(s);
            if(i==0)
            {
                c=n;
            }
            for0(j,n)
            {
                a[i][j]=s[j]-'0';
            }
            i++;
        }
        r=i;

        int res=0;
        for0(i,r)
        {
            for0(j,c)
            {
                cnt=0;
                if(a[i][j])
                    dfs(i,j);
                res=max(res,cnt);
            }
        }
        P(res);
        if(t)
            puts("");
        cover(a,0);
    }

    return 0;
}
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/871/871.cpp
]]><![CDATA[UVA 866 - Intersecting Line Segments]]>https://shipuahamed.com/uva-866-intersecting-line-segments/61a0be421ddff808acb336bcMon, 31 Aug 2020 20:26:42 GMTProblem PDF

Solution:

/******************************************************************
***   Problem       :                                           ***
***   Author        : Shipu Ahamed (Psycho Timekiller)          ***
***   E-mail        : shipuahamed01@gmail.com                   ***
***   University    : BUBT,Dept. of CSE                         ***
***   Team          : BUBT_Psycho                               ***
***   My Blog       : http://shipuahamed.blogspot.com           ***
***   Facebook      : http://www.facebook.com/DeesheharaShipu   ***
******************************************************************/

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

#define pi 2*acos(0.0)
#define all(v) v.begin(),v.end()

//input
#define si(t) scanf("%d",&t)
#define sl(t) scanf("%lld",&t)
#define sf(t) scanf("%f",&t)
#define sd(t) scanf("%lf",&t)
#define sc(c) scanf("%c",&c)
#define sii(a,b) scanf("%d%d",&a,&b)
#define sll(a,b) scanf("%lld%lld",&a,&b)

//Output
#define P(a) printf("%d\n",a)
#define PL(a) printf("%lld\n",a)
#define PF(a) printf("%f\n",a)
#define PD(a) printf("%lf\n",a)
#define PS(a) printf("%s\n",a)
#define PSN(a) printf("%s ",a)
#define PN(a) printf("%d ",a)
#define PLN(a) printf("%lld ",a)
#define PFN(a) printf("%f ",a)
#define PDN(a) printf("%lf ",a)
#define PP(a,b) printf("%d %d\n",a,b)
#define PPN(a,b) printf("%d %d ",a,b)
#define PPL(a,b) printf("%lld %lld\n",a,b)
#define PPLN(a,b) printf("%lld %lld ",a,b)

#define CP(a) cout< vi;
typedef  vector vll;
typedef  vector vs;
typedef  set si;
typedef  set ss;
typedef  map mii;
typedef  map mll;
typedef  map msi;
typedef  map mci;

template string toString( T Number ){stringstream st;st << Number;return st.str();}
template  T SOD(T n) {__typeof(n) sum=0;for(__typeof(n) i=1;i*i<=n;i++)sum+=(n%i)?0:((i*i==n)?i:i+n/i);return sum;}

//For Define
#define forab(i,a,b) for(__typeof(b) i=(a);i<=(b);i++)
#define for0(i,n) forab(i,0,(n)-1)
#define for1(i,n) forab(i,1,n)
#define rforab(i,b,a) for(__typeof(b) i=(b);i>=(a);i--)
#define rfor0(i,n) rforba(i,(n)-1,0)
#define rfor1(i,n) rforba(i,n,1)
#define forstl(i,s) for(__typeof((s).end()) i=(s).begin(); i != (s).end(); i++)

//Debug
#define dbg(x) cout << #x << " -> " << (x) << endl;
#define dbgsarr(i,a) cout<<#a<<"["< "< "< "<>p ; return p;}

ll pow(ll a,ll b, ll m) { ll res = 1; while(b) { if(b & 1) { res = ( (res % m) * (a % m) ) %m ; } a= ((a%m) * (a%m)) %m; b >>= 1; } return res; }
ll modInverse(ll a, ll m){return pow(a,m-2,m);}

////============ CONSTANT ===============////
#define mx7   10000007
#define mx6   1000006
#define mx5   100005
#define inf   1<<30                                           //infinity value
#define eps   1e-9
#define mx    (100010)
#define mod   1000000007
////=====================================////

int tarea(int x1, int y1, int x2, int y2, int x3, int y3){ //i don't use struct bcz it's tough for me.
    return x1*y2-y1*x2+x2*y3-y2*x3+x3*y1-y3*x1;
}

bool online(int x1,int y1,int x2,int y2,int x3,int y3)
{
    int  minx,miny,maxx,maxy;
    minx=min(x1,x2);miny=min(y1,y2);
    maxx=max(x1,x2);maxy=max(y1,y2);

    if(minx<=x3 && maxx>=x3 && miny<=y3 && maxy>=y3 )
        return true;
    else
    return false;
}

bool intersection(int x1, int y1, int x2, int y2, int x3, int y3, int x4, int y4)
{
    int a1=tarea(x3,y3,x4,y4,x1,y1);
    int a2=tarea(x3,y3,x4,y4,x2,y2);
    int a3=tarea(x1,y1,x2,y2,x3,y3);
    int a4=tarea(x1,y1,x2,y2,x4,y4);

//    PP(a1,a2),PP(a3,a4);
//    P(online(x3,y3,x4,y4,x1,y1));
//    nl;
    if(a1*a2<0 && a3*a4<0) return true;
    else if(a1==0 && online(x3,y3,x4,y4,x1,y1)) return true;
    else if(a2==0 && online(x3,y3,x4,y4,x2,y2)) return true;
    else if(a3==0 && online(x1,y1,x2,y2,x3,y3)) return true;
    else if(a4==0 && online(x1,y1,x2,y2,x4,y4)) return true;
    else
        return false;
}

struct line
{
    int x1,y1,x2,y2;
};

int main()
{
    int t;
    si(t);
    while(t--)
    {
        vectorv;
        line p;

        int n;
        si(n);
        while(n--)
        {
            sii(p.x1,p.y1),sii(p.x2,p.y2);
            v.pb(p);
        }

        n=sz(v);

        int res=0;
        for0(i,n)
        {
//            PP(v[i].x1,v[i].y1),PP(v[i].x2,v[i].y2);
            int cnt=0;
            for0(j,n)
            {
                if(i==j) continue;

                if(intersection(v[i].x1,v[i].y1,v[i].x2,v[i].y2,v[j].x1,v[j].y1,v[j].x2,v[j].y2 ))
                    cnt++;
            }
            res += cnt+1;
        }

        P(res);
        if(t)
            nl;

    }

    return 0;
}
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/866/866.cpp
]]><![CDATA[UVA 847 - A Multiplication Game]]>https://shipuahamed.com/uva-847-a-multiplication-game/61a0be421ddff808acb336bbMon, 31 Aug 2020 20:26:41 GMTProblem PDF

Solution:

#include 
int main()
{
    long long int n,p;
    while(scanf("%lld",&n)!=EOF)
    {
        p=1;
        while(p=n)
            {
                puts("Stan wins.");
                break;
            }
            p*=2;
            if(p>=n)
            {
                puts("Ollie wins.");
                break;
            }
        }
    }
}
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/847/847.cpp
]]><![CDATA[UVA 836 - Largest Submatrix]]>https://shipuahamed.com/uva-836-largest-submatrix/61a0be421ddff808acb336baMon, 31 Aug 2020 20:26:40 GMTProblem PDF

Solution:

/******************************************************************
***   Problem       :                                           ***
***   Author        : Shipu Ahamed (Psycho Timekiller)          ***
***   E-mail        : shipuahamed01@gmail.com                   ***
***   University    : BUBT,Dept. of CSE                         ***
***   Team          : BUBT_Psycho                               ***
***   My Blog       : http://shipuahamed.blogspot.com           ***
***   Facebook      : http://www.facebook.com/DeesheharaShipu   ***
******************************************************************/

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

#define pi 2*acos(0.0)
#define all(v) v.begin(),v.end()

//input
#define si(t) scanf("%d",&t)
#define sl(t) scanf("%lld",&t)
#define sf(t) scanf("%f",&t)
#define sd(t) scanf("%lf",&t)
#define sc(c) scanf("%c",&c)
#define sii(a,b) scanf("%d%d",&a,&b)
#define sll(a,b) scanf("%lld%lld",&a,&b)

//Output
#define P(a) printf("%d\n",a)
#define PL(a) printf("%lld\n",a)
#define PF(a) printf("%f\n",a)
#define PD(a) printf("%lf\n",a)
#define PS(a) printf("%s\n",a)
#define PSN(a) printf("%s ",a)
#define PN(a) printf("%d ",a)
#define PLN(a) printf("%lld ",a)
#define PFN(a) printf("%f ",a)
#define PDN(a) printf("%lf ",a)
#define PP(a,b) printf("%d %d\n",a,b)
#define PPN(a,b) printf("%d %d ",a,b)
#define PPL(a,b) printf("%lld %lld\n",a,b)
#define PPLN(a,b) printf("%lld %lld ",a,b)

#define CP(a) cout< vi;
typedef  vector vll;
typedef  vector vs;
typedef  set si;
typedef  set ss;
typedef  map mii;
typedef  map mll;
typedef  map msi;
typedef  map mci;

template string toString( T Number ){stringstream st;st << Number;return st.str();}
template  T SOD(T n) {__typeof(n) sum=0;for(__typeof(n) i=1;i*i<=n;i++)sum+=(n%i)?0:((i*i==n)?i:i+n/i);return sum;}

//For Define
#define forab(i,a,b) for(__typeof(b) i=(a);i<=(b);i++)
#define for0(i,n) forab(i,0,(n)-1)
#define for1(i,n) forab(i,1,n)
#define rforab(i,b,a) for(__typeof(b) i=(b);i>=(a);i--)
#define rfor0(i,n) rforba(i,(n)-1,0)
#define rfor1(i,n) rforba(i,n,1)
#define forstl(i,s) for(__typeof((s).end()) i=(s).begin(); i != (s).end(); i++)

//Debug
#define dbg(x) cout << #x << " -> " << (x) << endl;
#define dbgsarr(i,a) cout<<#a<<"["< "< "< "<>p ; return p;}

ll pow(ll a,ll b, ll m) { ll res = 1; while(b) { if(b & 1) { res = ( (res % m) * (a % m) ) %m ; } a= ((a%m) * (a%m)) %m; b >>= 1; } return res; }
ll modInverse(ll a, ll m){return pow(a,m-2,m);}

////============ CONSTANT ===============////
#define mx7   10000007
#define mx6   1000006
#define mx5   100005
#define inf   1<<30                                           //infinity value
#define eps   1e-9
#define mx    (100010)
#define mod   1000000007
////=====================================////

struct zeone
{
    int one=0,zero=0;

};

int main()
{
    int t;
    si(t);
    while(t--)
    {
        string s[30];
        cin>>s[0];

        int n=sz(s[0]);

        zeone cs[50][50];

        for0(i,n)
        {
            if(s[0][i]=='0')
            {
                cs[1][i+1].zero = cs[1][i].zero+1;
                cs[1][i+1].one = cs[1][i].one;
            }
            else
            {
                cs[1][i+1].one = cs[1][i].one+1;
                cs[1][i+1].zero = cs[1][i].zero;
            }

//            PN(cs[1][i+1].one);
        }
//        nl;

        for1(i,n-1)
        {
            cin>>s[i];
            for0(j,n)
            {
                if(s[i][j]=='0')
                {
                    cs[i+1][j+1].zero = cs[i][j+1].zero + cs[i+1][j].zero - cs[i][j].zero +1;
                    cs[i+1][j+1].one = cs[i][j+1].one + cs[i+1][j].one - cs[i][j].one;
                }
                else
                {
                    cs[i+1][j+1].zero = cs[i][j+1].zero + cs[i+1][j].zero - cs[i][j].zero;
                    cs[i+1][j+1].one = cs[i][j+1].one + cs[i+1][j].one - cs[i][j].one+1;
                }
//                PN(cs[i+1][j+1].one);

            }
//            nl;
        }

//        nl;
//        for0(i,n)
//        {
//            cout<=p)
                        {
                            res.zero = p;
                            p = ( cs[i][j].one - (cs[i][l-1].one + cs[k-1][j].one) ) + cs[k-1][l-1].one;
                            if(res.one
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/836/836.cpp
]]><![CDATA[UVA 793 - Network Connections]]>https://shipuahamed.com/uva-793-network-connections/61a0be421ddff808acb336b9Mon, 31 Aug 2020 20:26:39 GMTProblem PDF

Solution:

/******************************************************************
***   Problem       :                                           ***
***   Author        : Shipu Ahamed (Psycho Timekiller)          ***
***   E-mail        : shipuahamed01@gmail.com                   ***
***   University    : BUBT,Dept. of CSE                         ***
***   Team          : BUBT_Psycho                               ***
***   My Blog       : http://shipuahamed.blogspot.com           ***
***   Facebook      : http://www.facebook.com/DeesheharaShipu   ***
******************************************************************/

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

#define pi 2*acos(0.0)
#define all(v) v.begin(),v.end()

//input
#define si(t) scanf("%d",&t)
#define sl(t) scanf("%lld",&t)
#define sf(t) scanf("%f",&t)
#define sd(t) scanf("%lf",&t)
#define sc(c) scanf("%c",&c)
#define sii(a,b) scanf("%d%d",&a,&b)
#define sll(a,b) scanf("%lld%lld",&a,&b)

//Output
#define P(a) printf("%d\n",a)
#define PL(a) printf("%lld\n",a)
#define PF(a) printf("%f\n",a)
#define PD(a) printf("%lf\n",a)
#define PS(a) printf("%s\n",a)
#define PSN(a) printf("%s ",a)
#define PN(a) printf("%d ",a)
#define PLN(a) printf("%lld ",a)
#define PFN(a) printf("%f ",a)
#define PDN(a) printf("%lf ",a)
#define PP(a,b) printf("%d %d\n",a,b)
#define PPN(a,b) printf("%d %d ",a,b)
#define PPL(a,b) printf("%lld %lld\n",a,b)
#define PPLN(a,b) printf("%lld %lld ",a,b)

#define CP(a) cout< vi;
typedef  vector vll;
typedef  vector vs;
typedef  set si;
typedef  set ss;
typedef  map mii;
typedef  map mll;
typedef  map msi;
typedef  map mci;

template string toString( T Number ){stringstream st;st << Number;return st.str();}
template  T SOD(T n) {__typeof(n) sum=0;for(__typeof(n) i=1;i*i<=n;i++)sum+=(n%i)?0:((i*i==n)?i:i+n/i);return sum;}

//For Define
#define forab(i,a,b) for(__typeof(b) i=(a);i<=(b);i++)
#define for0(i,n) forab(i,0,(n)-1)
#define for1(i,n) forab(i,1,n)
#define rforab(i,b,a) for(__typeof(b) i=(b);i>=(a);i--)
#define rfor0(i,n) rforab(i,(n)-1,0)
#define rfor1(i,n) rforab(i,n,1)
#define forstl(i,s) for(__typeof((s).end()) i=(s).begin(); i != (s).end(); i++)

//File input/output
#define input freopen("in.txt","r",stdin)
#define output freopen("out.txt","w",stdout)

//upper bound and lower bound
#define LB(a,value) (lower_bound(all(a),value)-a.begin())
#define UB(a,value) (upper_bound(all(a),value)-a.begin())

//Test Case & New line
#define Case(no) printf("Case %d: ",++no)
#define nl puts("")

int stringconvert(string s){int p; istringstream st(s); st>>p ; return p;}

ll pow(ll a,ll b, ll m) { ll res = 1; while(b) { if(b & 1) { res = ( (res % m) * (a % m) ) %m ; } a= ((a%m) * (a%m)) %m; b >>= 1; } return res; }
ll modInverse(ll a, ll m){return pow(a,m-2,m);}

////============ CONSTANT ===============////
#define mx7   10000007
#define mx6   1000006
#define mx5   100005
#define inf   1<<30                                           //infinity value
#define eps   1e-9
#define mx    (100010)
#define mod   1000000007
////=====================================////

int par[1000005];

int Find(int n)
{
    if(par[n]==n)
        return n;
    return par[n]=Find(par[n]);
}

void Union(int a,int b)
{
    int u= Find(a);
    int v= Find(b);
    if(u!=v)
    {
        par[u]=v;
    }
}

int main()
{
    int t;
    si(t);
    while(t--)
    {
        int n,a,b;
        si(n);

        getchar();

        for1(i,n)
            par[i]=i;

        string s;
        int cnt1=0,cnt2=0;
        while(getline(cin,s))
        {
            if(s.length()==0) break;

            stringstream ss;
            ss<>s>>a>>b;

            if(s=="c")
            {
                Union(a,b);
            }
            else
            {
                int u= Find(a);
                int v= Find(b);
                if(u==v)
                    cnt1++;
                else
                    cnt2++;
            }

        }

        printf("%d,%d\n",cnt1,cnt2);

        if(t)
            nl;


    }

    return 0;
}
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/793/793.cpp
]]><![CDATA[UVA 787 - Maximum Sub-sequence Product]]>https://shipuahamed.com/uva-787-maximum-sub-sequence-product/61a0be421ddff808acb336b8Mon, 31 Aug 2020 20:26:38 GMTProblem PDF

Solution:

package pkg787;

import java.io.IOException;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Scanner;

public class Main {
    private static String line;
    public static void main(String[] args) throws IOException {
        Scanner in = new Scanner(System.in);
    ArrayList a = new ArrayList();
    BigInteger n;
    
    while (in.hasNext()) {
      
      n = in.nextBigInteger();
      if (n.compareTo(BigInteger.valueOf(-999999))==0)
      {
        BigInteger result = a.get(0);
        BigInteger pro;
        for (int i = 0; i < a.size(); i ++) {
          pro =BigInteger.ONE;
          for(int j=i;j < a.size();j++) {
            pro = pro.multiply(a.get(j));
            if (result.compareTo(pro) == -1) 
                result = pro;
 
          }
        }
        a.clear();
        System.out.println(result);
      }
      else
      {
          a.add(n);
      }
    }
    }
    
}
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/787/Main.java
]]><![CDATA[UVA 785 - Grid Colouring]]>https://shipuahamed.com/uva-785-grid-colouring/61a0be421ddff808acb336b7Mon, 31 Aug 2020 20:26:37 GMTProblem PDF

Solution:

/******************************************************************
***   Problem       :                                           ***
***   Author        : Shipu Ahamed (Psycho Timekiller)          ***
***   E-mail        : shipuahamed01@gmail.com                   ***
***   University    : BUBT,Dept. of CSE                         ***
***   Team          : BUBT_Psycho                               ***
***   My Blog       : http://shipuahamed.blogspot.com           ***
***   Facebook      : http://www.facebook.com/DeesheharaShipu   ***
******************************************************************/

#include 
using namespace std;

#define pi 2*acos(0.0)
#define all(v) v.begin(),v.end()

//input
#define si(t) scanf("%d",&t)
#define sl(t) scanf("%lld",&t)
#define sf(t) scanf("%f",&t)
#define sd(t) scanf("%lf",&t)
#define sc(c) scanf("%c",&c)
#define sii(a,b) scanf("%d%d",&a,&b)
#define sll(a,b) scanf("%lld%lld",&a,&b)

//Output
#define P(a) printf("%d\n",a)
#define PL(a) printf("%lld\n",a)
#define PF(a) printf("%f\n",a)
#define PD(a) printf("%lf\n",a)
#define PS(a) printf("%s\n",a)
#define PSN(a) printf("%s ",a)
#define PN(a) printf("%d ",a)
#define PLN(a) printf("%lld ",a)
#define PFN(a) printf("%f ",a)
#define PDN(a) printf("%lf ",a)
#define PP(a,b) printf("%d %d\n",a,b)
#define PPN(a,b) printf("%d %d ",a,b)
#define PPL(a,b) printf("%lld %lld\n",a,b)
#define PPLN(a,b) printf("%lld %lld ",a,b)

#define CP(a) cout< vi;
typedef  vector vll;
typedef  vector vs;
typedef  set si;
typedef  set ss;
typedef  map mii;
typedef  map mll;
typedef  map msi;
typedef  map mci;

template string toString( T Number ){stringstream st;st << Number;return st.str();}
template  T SOD(T n) {__typeof(n) sum=0;for(__typeof(n) i=1;i*i<=n;i++)sum+=(n%i)?0:((i*i==n)?i:i+n/i);return sum;}

//For Define
#define forab(i,a,b) for(__typeof(b) i=(a);i<=(b);i++)
#define for0(i,n) forab(i,0,(n)-1)
#define for1(i,n) forab(i,1,n)
#define rforab(i,b,a) for(__typeof(b) i=(b);i>=(a);i--)
#define rfor0(i,n) rforba(i,(n)-1,0)
#define rfor1(i,n) rforba(i,n,1)
#define forstl(i,s) for(__typeof((s).end()) i=(s).begin(); i != (s).end(); i++)

//Debug
#define dbg(x) cout << #x << " -> " << (x) << endl;
#define dbgsarr(i,a) cout<<#a<<"["< "< "< "<>p ; return p;}

ll pow(ll a,ll b, ll m) { ll res = 1; while(b) { if(b & 1) { res = ( (res % m) * (a % m) ) %m ; } a= ((a%m) * (a%m)) %m; b >>= 1; } return res; }
ll modInverse(ll a, ll m){return pow(a,m-2,m);}

////============ CONSTANT ===============////
#define mx7   10000007
#define mx6   1000006
#define mx5   100005
#define inf   1<<30                                           //infinity value
#define eps   1e-9
#define mx    (100010)
#define mod   1000000007
////=====================================////

string s[100];
char c;
bool f;
void dfs(int i,int j)
{
    if(f & s[i][j]!=' ') return;
    s[i][j]=c;
    f=true;
    dfs(i,j-1);
    dfs(i,j+1);
    dfs(i-1,j);
    dfs(i+1,j);
}
int main()
{
    int n=-1;
    while(getline(cin,s[++n])!=NULL)
    {
        if(s[n][0]!='_')
            continue;
        for0(i,n)
        {
            for(int j=0;s[i][j];j++)
            {
                if(s[i][j]!='X' && s[i][j]!=' ')
                {
                    f=false;
                    c=s[i][j];
                    dfs(i,j);
                }
            }
        }
        for0(i,n+1)
            CP(s[i]);
        n=-1;
    }
    return 0;
}
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/785/785.cpp
]]><![CDATA[UVA 713 - Adding Reversed Numbers]]>https://shipuahamed.com/uva-713-adding-reversed-numbers/61a0be421ddff808acb336b6Mon, 31 Aug 2020 20:26:36 GMTProblem PDF

Solution:

#include
#include
int main()
{
char a[260],b[260],p[205];
int t,l,len,e,f,i,r,s,d,y,q,j;
scanf("%d",&t);
while(t--)
{
scanf("%s%s",&a,&b);
l=strlen(a);
len=strlen(b);
if(l>len)
{
y=l;
for(i=len;il)
{
y=len;
for(i=l;i9)
{
r=s%10;
p[j]=r+'0';
f=1;
}
 else{
    p[j]=s+'0';
    f=0;
    }
}
if(f==1){
    p[j]=f+'0';
    p[j+1]='\0';
    }
else{
    p[j]='\0';
    }
  i=0;
y=strlen(p);
while (p[i]=='0')
i++;
for (;i
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/713/713.cpp
]]><![CDATA[UVA 694 - The Collatz Sequence]]>https://shipuahamed.com/uva-694-the-collatz-sequence/61a0be421ddff808acb336b5Mon, 31 Aug 2020 20:26:35 GMTProblem PDF

Solution:

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include 
#include 
#include
#define ll long long
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
using namespace std;
int main()
{
   ll n,e,c,a;
   int no=0;
   while(sc("%lld %lld",&n,&e)==2)
   {
       if(n<0&&e<0)
       break;
       c=0;
       a=n;
       while(n<=e)
       {
           if(n==1)
           {
               c++;
               break;
           }
           else if(n%2==0)
           {
               c++;
               n/=2;
           }
           else if(n%2==1)
           {
               c++;
               n=n*3+1;
           }

       }
       pf("Case %d: A = %lld, limit = %lld, number of terms = %lld\n",
          ++no,a,e,c);
   }
    return 0;
}
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/694/694.cpp
]]><![CDATA[UVA 686 - Goldbach's Conjecture (II)]]>https://shipuahamed.com/uva-686-goldbach-s-conjecture-ii/61a0be421ddff808acb336b4Mon, 31 Aug 2020 20:26:34 GMTProblem PDF

Solution:

/*************************************
******** Team : BUBT_HIDDEN **********
**************************************
*********** Shipu Ahamed *************
*************************************/

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include

#define ll long long
#define sc scanf
#define pf printf
#define pi 2*acos(0.0)

#define ft first
#define se second
#define st(s) s.size();
#define r(input) freopen("input.txt","r",stdin)
#define w(output) freopen("output.txt","w",stdout)
#define maxall(v) *max_element(v.begin(),v.end())
#define minall(v) *min_element(v.begin(),v.end())
#define Sort(v) sort(v.begin(),v.end())
#define un(v) Sort(v), v.erase(unique(v.begin(),v.end()),v.end())
#define cover(a,d) memset(a,d,sizeof(a))
using namespace std;

bool prime[10000010];
void sieve()
{
    prime[1]=false;
        int n=sqrt(10000000);
        for(int i=2;i<=n;i++)
        {
            if(prime[i]!=false)
            {
                for(int j=2*i;j<=10000000;j=j+i)
                {
                    prime[j]=false;
                }
            }
        }
}
int main()
{
    cover(prime,true);
    sieve();
    int n;
    while(sc("%d",&n)==1)
    {
        if(n==0) break;
        int a,i,c=0;
        mapmp;
        for(i=2;i
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/686/686.cpp
]]><![CDATA[UVA 679 - Dropping Balls]]>https://shipuahamed.com/uva-679-dropping-balls/61a0be421ddff808acb336b3Mon, 31 Aug 2020 20:26:33 GMTProblem PDF

Solution:

/******************************************************************
***   Problem       :                                           ***
***   Author        : Shipu Ahamed (Psycho Timekiller)          ***
***   E-mail        : shipuahamed01@gmail.com                   ***
***   University    : BUBT,Dept. of CSE                         ***
***   Team          : BUBT_Psycho                               ***
***   My Blog       : http://shipuahamed.blogspot.com           ***
***   Facebook      : http://www.facebook.com/DeesheharaShipu   ***
******************************************************************/

#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <stack>
#include <queue>
#include <vector>
#include <utility>
#include <string>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <algorithm>
#include <memory.h>
#include <functional>
#include <numeric>
#include <bits/stdc++.h>
using namespace std;

#define pi 2*acos(0.0)
#define all(v) v.begin(),v.end()

//input
#define si(t) scanf("%d",&t)
#define sl(t) scanf("%lld",&t)
#define sf(t) scanf("%f",&t)
#define sd(t) scanf("%lf",&t)
#define sc(c) scanf("%c",&c)
#define sii(a,b) scanf("%d%d",&a,&b)
#define sll(a,b) scanf("%lld%lld",&a,&b)

//Output
#define P(a) printf("%d\n",a)
#define PL(a) printf("%lld\n",a)
#define PF(a) printf("%f\n",a)
#define PD(a) printf("%lf\n",a)
#define PS(a) printf("%s\n",a)
#define PSN(a) printf("%s ",a)
#define PN(a) printf("%d ",a)
#define PLN(a) printf("%lld ",a)
#define PFN(a) printf("%f ",a)
#define PDN(a) printf("%lf ",a)
#define PP(a,b) printf("%d %d\n",a,b)
#define PPN(a,b) printf("%d %d ",a,b)
#define PPL(a,b) printf("%lld %lld\n",a,b)
#define PPLN(a,b) printf("%lld %lld ",a,b)

#define CP(a) cout<<a<<endl
#define CPN(a) cout<<a<<" "

#define ff first
#define se second
#define pb push_back
#define ST(v) sort(all(v))
#define sz(x) (int)x.size()
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/gcd(a,b)))
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define maxall(v) *max_element(all(v))
#define minall(v) *min_element(all(v))
#define sqr(a) ((a)*(a))
#define abs(x) (((x)<0)?-(x):(x))
#define cover(a,d) memset(a,d,sizeof(a))
#define popcount(i) __builtin_popcount(i)      //count one. in long long use __builtin_popcountll(i)
#define parity(i)   __builtin_parity(i)       //evenparity 0 and odd parity 1
#define btz(a)   __builtin_ctz(a)            //count binary trailling zero
#define un(v) ST(v), (v).erase(unique(all(v)),v.end())
#define common(a,b) ST(a), ST(b), a.erase(set_intersection(all(a),all(b),a.begin()),a.end())
#define uncommon(a,b) ST(a), ST(b), a.erase(set_symmetric_difference(all(a),all(b),a.begin()),a.end())

typedef  long long ll;
typedef  unsigned long long ull;

typedef  vector<int> vi;
typedef  vector<ll> vll;
typedef  vector<string> vs;
typedef  set<int> si;
typedef  set<string> ss;
typedef  map<int,int> mii;
typedef  map<ll,ll> mll;
typedef  map<string,int> msi;
typedef  map<char,int> mci;

template <typename T>string toString( T Number ){stringstream st;st << Number;return st.str();}
template <typename T> T SOD(T n) {__typeof(n) sum=0;for(__typeof(n) i=1;i*i<=n;i++)sum+=(n%i)?0:((i*i==n)?i:i+n/i);return sum;}

//For Define
#define forab(i,a,b) for(__typeof(b) i=(a);i<=(b);i++)
#define for0(i,n) forab(i,0,(n)-1)
#define for1(i,n) forab(i,1,n)
#define rforab(i,b,a) for(__typeof(b) i=(b);i>=(a);i--)
#define rfor0(i,n) rforab(i,(n)-1,0)
#define rfor1(i,n) rforab(i,n,1)
#define forstl(i,s) for(__typeof((s).end()) i=(s).begin(); i != (s).end(); i++)

//File input/output
#define input freopen("in.txt","r",stdin)
#define output freopen("out.txt","w",stdout)

//upper bound and lower bound
#define LB(a,value) (lower_bound(all(a),value)-a.begin())
#define UB(a,value) (upper_bound(all(a),value)-a.begin())

//Test Case & New line
#define Case(no) printf("Case %d: ",++no)
#define nl puts("")

int stringconvert(string s){int p; istringstream st(s); st>>p ; return p;}

ll pow(ll a,ll b, ll m) { ll res = 1; while(b) { if(b & 1) { res = ( (res % m) * (a % m) ) %m ; } a= ((a%m) * (a%m)) %m; b >>= 1; } return res; }
ll modInverse(ll a, ll m){return pow(a,m-2,m);}

////============ CONSTANT ===============////
#define mx7   10000007
#define mx6   1000006
#define mx5   100005
#define inf   1<<30                                           //infinity value
#define eps   1e-9
#define mx    (100010)
#define mod   1000000007
////=====================================////

int main()
{
    while(1)
    {
        int t;
        si(t);

        if(t==-1) break;

        while(t--)
        {
            int d,n;
            sii(d,n);


            int k=1,node=1,f=0;
            while(k<d)
            {
                 if(n&1 || n==0)
                 {
                     node = node<<1;
                     n=(n/2)+1;
                 }
                 else
                 {
                     node = (node<<1)+1;
                     n/=2;
                 }
                k++;
            }

            P(node);
        }
    }

    return 0;
}
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/679/679.cpp
]]><![CDATA[UVA 674 - Coin Change]]>https://shipuahamed.com/uva-674-coin-change/61a0be421ddff808acb336b2Mon, 31 Aug 2020 20:26:32 GMTProblem PDF

Solution:

#include
#include
long long Mod = 100000007;
int main()
{
       long long coin[6]={1,5,10,25,50},way[7510]={0},i,j,a;
        way[0]=1;
        for(i=0;i<5;i++)
        {
          for(j=coin[i];j<=7500;j++)
          {
                way[j]+=way[j-coin[i]];
                if(way[j]>=Mod)
                way[j]%=Mod;
          }
        }
        while(scanf("%lld",&a)==1)
        {
           printf("%lld\n",way[a]);
        }
    return 0;
}
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/674/674.cpp
]]>