UVA 111 - History Grading

Problem 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 sc scanf
#define pf printf
#define ll long long
#define pi 2*acos(0.0)

#define ff first
#define se second
#define inf (1<<30)                                              //infinity value
#define pb push_back
#define mod  1000000007
#define ST(v) sort(v.begin(),v.end())
#define cover(a,d) memset(a,d,sizeof(a))
#define input freopen("in.txt","r",stdin)
#define output freopen("out.txt","w",stdout)
#define maxall(v) *max_element(v.begin(),v.end())
#define minall(v) *min_element(v.begin(),v.end())
#define un(v) ST(v), v.erase(unique(v.begin(),v.end()),v.end())

using namespace std;
int main(){
    int n,c[20],r[20],lcs[21][21],x;

    scanf("%d\n",&n);

    for(int i=0;i
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/111/111.cpp