Skip to main content

Posts

Showing posts from January, 2018

10424 - Love Calculator UVA Solution

10424 - Love Calculator UVA Solution please do not copy it rather watch it for learning purpose :) Here is the code :-  #include <iostream> #include <bits/stdc++.h> #include <string> using namespace std; int getval(string nam); int reducingVal(int val);    int main(){        //MechaBoo     string name1,name2;     while(getline(cin,name1))     {         getline(cin,name2);         int par1= getval(name1);         int par2=getval(name2);         par1=reducingVal(par1);         par2=reducingVal(par2);               double x= par1*1.00;         double y=par2*1.00;           ...

11942 Lumberjack Sequencing - Solution

Solution of 11942  Lumberjack Sequencing- UVA please do not copy it rather watch it for learning purpose :) Here is the code :-  #include <iostream> #include <bits/stdc++.h> using namespace std; //MECHABOO  bool smallToBig(int arr[]);  bool bigToSmall(int arr[]);    int main(){     int test;     cin >> test;     for(int i=0;i<test;i++)     {         int arr[10];         bool nat;         for(int j=0;j<10;j++)         {             cin >> arr[j];         }         if(arr[0]>arr[1]||arr[1]>arr[2])         {           ...

UVA-11764 Solution

Solution of 11764 UVA number ! please do not copy it rather watch it for learning purpose :) Here is the code :- #include <iostream> #include <bits/stdc++.h> using namespace std;    int main(){        //mechaboo     int testCases;     cin >> testCases;     for (int i=0;i<testCases;i++)     {         int len,maxx=0,minn=0;         cin >> len;         int  arrJumps[len] ;         for(int j=0;j<len;j++)         {             cin >> arrJumps[j];             if(j!=0)             {       ...