May 25, 2020
Questions of competitive Programmer Java Technology Python programing Computer Networks
May 25, 2020
May 25, 2020
May 25, 2020
May 26, 2020
#include <iostream>
#include <vector>
/*****Aakash Vikrant
KIET GROUP OF INSTITUTIONS*****/
using namespace std;
class HotelRoom {
public: HotelRoom(int bedrooms, int bathrooms) : bedrooms_(bedrooms), bathrooms_(bathrooms) {}
virtual int get_price() {
return 50*bedrooms_ + 100*bathrooms_;
}
private: int bedrooms_; int bathrooms_;
};
class HotelApartment : public HotelRoom {
public: HotelApartment(int bedrooms, int bathrooms) : HotelRoom(bedrooms, bathrooms) {}
int get_price() {
return HotelRoom::get_price() + 100;
}
};
int main() {
int n;
cin >> n;
vector<HotelRoom*> rooms;
for (int i = 0; i < n; ++i) {
string room_type;
int bedrooms;
int bathrooms;
cin >> room_type >> bedrooms >> bathrooms;
if (room_type == "standard") {
rooms.push_back(new HotelRoom(bedrooms, bathrooms));
} else {
rooms.push_back(new HotelApartment(bedrooms, bathrooms));
}
}
int total_profit = 0;
for (auto room : rooms) {
total_profit += room->get_price();
}
cout << total_profit << endl;
for (auto room : rooms) {
delete room;
}
rooms.clear();
return 0;
}
#include <vector>
/*****Aakash Vikrant
KIET GROUP OF INSTITUTIONS*****/
using namespace std;
class HotelRoom {
public: HotelRoom(int bedrooms, int bathrooms) : bedrooms_(bedrooms), bathrooms_(bathrooms) {}
virtual int get_price() {
return 50*bedrooms_ + 100*bathrooms_;
}
private: int bedrooms_; int bathrooms_;
};
class HotelApartment : public HotelRoom {
public: HotelApartment(int bedrooms, int bathrooms) : HotelRoom(bedrooms, bathrooms) {}
int get_price() {
return HotelRoom::get_price() + 100;
}
};
int main() {
int n;
cin >> n;
vector<HotelRoom*> rooms;
for (int i = 0; i < n; ++i) {
string room_type;
int bedrooms;
int bathrooms;
cin >> room_type >> bedrooms >> bathrooms;
if (room_type == "standard") {
rooms.push_back(new HotelRoom(bedrooms, bathrooms));
} else {
rooms.push_back(new HotelApartment(bedrooms, bathrooms));
}
}
int total_profit = 0;
for (auto room : rooms) {
total_profit += room->get_price();
}
cout << total_profit << endl;
for (auto room : rooms) {
delete room;
}
rooms.clear();
return 0;
}
May 26, 2020
May 27, 2020
public class Solution
{
/***Aakash Vikrant ***
*Kiet group of institutions*/
public static void main(String []argv) {
System.out.println("Hello World."); System.out.println("Hello Java.");
//Write your solution here.
}
}
{
/***Aakash Vikrant ***
*Kiet group of institutions*/
public static void main(String []argv) {
System.out.println("Hello World."); System.out.println("Hello Java.");
//Write your solution here.
}
}
May 27, 2020
May 27, 2020
#include<stdio.h>
#include<conio.h>
#include<dos.h>
#include<math.h>
#include<string.h>
/*****Aakash Vikrant
*Kiet Group of Institutions**/
int main()
{
int hh, mm, ss ;
char t12[3];
scanf("%d:%d:%d%s", &hh, &mm, &ss, t12);
if (strcmp(t12,"PM")==0 && hh!=12)
{
hh += 12 ;
}
if (strcmp(t12,"AM")==0 && hh==12)
{
hh = 0 ;
}
printf("%02d:%02d:%02d", hh, mm, ss);
return 0;
}
#include<conio.h>
#include<dos.h>
#include<math.h>
#include<string.h>
/*****Aakash Vikrant
*Kiet Group of Institutions**/
int main()
{
int hh, mm, ss ;
char t12[3];
scanf("%d:%d:%d%s", &hh, &mm, &ss, t12);
if (strcmp(t12,"PM")==0 && hh!=12)
{
hh += 12 ;
}
if (strcmp(t12,"AM")==0 && hh==12)
{
hh = 0 ;
}
printf("%02d:%02d:%02d", hh, mm, ss);
return 0;
}
May 27, 2020

By Aakash Vikrant May 26, 2020
Birthday Cake Candles in Algorithm - Hacker Rank Solutions
By Aakash Vikrant May 26, 2020
Birthday Cake Candles in Algorithm - Hacker Rank Solutions
May 27, 2020
#include <iostream>
/*****Aakash Vikrant
**Kiet Group of Institutions**/
int main()
{
int c, n, max = 0;
std::cin.ignore();
while(std::cin >> n)
max < n ? c = !!(max = n) : c += max == n;
std::cout << c;
return 0;
}
/*****Aakash Vikrant
**Kiet Group of Institutions**/
int main()
{
int c, n, max = 0;
std::cin.ignore();
while(std::cin >> n)
max < n ? c = !!(max = n) : c += max == n;
std::cout << c;
return 0;
}
May 27, 2020
May 27, 2020
HackerRank Solutions
5_6282599249154670857.pdf
Introduction to algorithms
May 27, 2020
May 27, 2020
May 27, 2020
Listen guys, we are working for those students who are unable to create their logic behind the solution. Purpose of this website is to explain the solution of Hacker rank problem.
This website will definitely help for beginners.
Check out the website link is given below👇
https://javahackerranksolutions.blogspot.com/?m=1
This website will definitely help for beginners.
Check out the website link is given below👇
https://javahackerranksolutions.blogspot.com/?m=1
Blogspot
Hacker Rank Solutions
Coding,Platform,Hacker, Rank, Programming challenges,Solutions,C, language,Java,Problem,Solving,Python,C++,Data,Structure,Linux,Bash,
interview,code
interview,code
June 9, 2020
Attending Workshops in C++
#include<bits/stdc++.h>
using namespace std;
/*****Aakash Vikrant
**Kiet Group of Institutions**/
//Define the structs Workshops and Available_Workshops.
//Implement the functions initialize and CalculateMaxWorkshops
struct Workshops
{
int start_time;
int duration;
int end_time;
};
struct Available_Workshops
{
int n;
vector <Workshops> w;
};
Available_Workshops *initialize(int *start_time, int *duration, int n)
{
Available_Workshops *paw=new(Available_Workshops);
Workshops ws;
paw->n=n;
for (int i=0;i<n;i++)
{
//construct a Workshops
ws.start_time=start_time[i];
ws.duration=duration[i];
ws.end_time=start_time[i]+duration[i];
paw->w.push_back(ws);
}
return paw;
}
bool compare(Workshops w1, Workshops w2)
{
return (w1.end_time < w2.end_time);
}
int CalculateMaxWorkshops(Available_Workshops* ptr)
{
// sort workshops by end_time
sort(ptr->w.begin(),ptr->w.end(),compare);
// interval scheduling
int last_processed_time=-1;
int maxWorkshops=0;
for (int i=0;i<ptr->n;i++)
{
if (ptr->w[i].start_time >= last_processed_time)
{
last_processed_time=ptr->w[i].end_time;
maxWorkshops++;
}
}
return maxWorkshops;
}
int main(int argc, char *argv[])
{
int n; // number of workshops
cin >> n;
// create arrays of unknown size n
int* start_time = new int[n];
int* duration = new int[n];
for(int i=0; i < n; i++)
{
cin >> start_time[i];
}
for(int i = 0; i < n; i++)
{
cin >> duration[i];
}
Available_Workshops * ptr;
ptr = initialize(start_time,duration, n);
cout << CalculateMaxWorkshops(ptr) << endl;
return 0;
}
#include<bits/stdc++.h>
using namespace std;
/*****Aakash Vikrant
**Kiet Group of Institutions**/
//Define the structs Workshops and Available_Workshops.
//Implement the functions initialize and CalculateMaxWorkshops
struct Workshops
{
int start_time;
int duration;
int end_time;
};
struct Available_Workshops
{
int n;
vector <Workshops> w;
};
Available_Workshops *initialize(int *start_time, int *duration, int n)
{
Available_Workshops *paw=new(Available_Workshops);
Workshops ws;
paw->n=n;
for (int i=0;i<n;i++)
{
//construct a Workshops
ws.start_time=start_time[i];
ws.duration=duration[i];
ws.end_time=start_time[i]+duration[i];
paw->w.push_back(ws);
}
return paw;
}
bool compare(Workshops w1, Workshops w2)
{
return (w1.end_time < w2.end_time);
}
int CalculateMaxWorkshops(Available_Workshops* ptr)
{
// sort workshops by end_time
sort(ptr->w.begin(),ptr->w.end(),compare);
// interval scheduling
int last_processed_time=-1;
int maxWorkshops=0;
for (int i=0;i<ptr->n;i++)
{
if (ptr->w[i].start_time >= last_processed_time)
{
last_processed_time=ptr->w[i].end_time;
maxWorkshops++;
}
}
return maxWorkshops;
}
int main(int argc, char *argv[])
{
int n; // number of workshops
cin >> n;
// create arrays of unknown size n
int* start_time = new int[n];
int* duration = new int[n];
for(int i=0; i < n; i++)
{
cin >> start_time[i];
}
for(int i = 0; i < n; i++)
{
cin >> duration[i];
}
Available_Workshops * ptr;
ptr = initialize(start_time,duration, n);
cout << CalculateMaxWorkshops(ptr) << endl;
return 0;
}
June 10, 2020
C++ Class Template Specialization

By Aakash Vikrant June 06, 2020
#include <iostream>
using namespace std;
enum class Fruit { apple, orange, pear };
enum class Color { red, green, orange };
/*****Aakash Vikrant**
*Kiet Group of Institutions**/
template <typename T> struct Traits;
// Define specializations for the Traits class template here.
template <>
struct Traits<Fruit>{
static string name(int index)
{
switch(index)
{
case 0:return "apple";
case 1: return "orange" ;
case 2: return "pear";
}
return "unknown";
}
};
template <>
struct Traits<Color>
{
static string name(int index)
{
switch(index)
{
case 0:return "red";
case 1: return "green" ;
case 2: return "orange";
}
return "unknown";
}
};
int main()
{
int t = 0; std::cin >> t;
for (int i=0; i!=t; ++i)
{
int index1; std::cin >> index1;
int index2; std::cin >> index2;
cout << Traits<Color>::name(index1) << " ";
cout << Traits<Fruit>::name(index2) << "\n";
}
}

By Aakash Vikrant June 06, 2020
#include <iostream>
using namespace std;
enum class Fruit { apple, orange, pear };
enum class Color { red, green, orange };
/*****Aakash Vikrant**
*Kiet Group of Institutions**/
template <typename T> struct Traits;
// Define specializations for the Traits class template here.
template <>
struct Traits<Fruit>{
static string name(int index)
{
switch(index)
{
case 0:return "apple";
case 1: return "orange" ;
case 2: return "pear";
}
return "unknown";
}
};
template <>
struct Traits<Color>
{
static string name(int index)
{
switch(index)
{
case 0:return "red";
case 1: return "green" ;
case 2: return "orange";
}
return "unknown";
}
};
int main()
{
int t = 0; std::cin >> t;
for (int i=0; i!=t; ++i)
{
int index1; std::cin >> index1;
int index2; std::cin >> index2;
cout << Traits<Color>::name(index1) << " ";
cout << Traits<Fruit>::name(index2) << "\n";
}
}
June 10, 2020
Time Conversion in Algorithm
#include<stdio.h>
#include<conio.h>
#include<dos.h>
#include<math.h>
#include<string.h>
/*****Aakash Vikrant
*Kiet Group of Institutions**/
int main()
{
int hh, mm, ss ;
char t12[3];
scanf("%d:%d:%d%s", &hh, &mm, &ss, t12);
if (strcmp(t12,"PM")==0 && hh!=12)
{
hh += 12 ;
}
if (strcmp(t12,"AM")==0 && hh==12)
{
hh = 0 ;
}
printf("%02d:%02d:%02d", hh, mm, ss);
return 0;
}
#include<stdio.h>
#include<conio.h>
#include<dos.h>
#include<math.h>
#include<string.h>
/*****Aakash Vikrant
*Kiet Group of Institutions**/
int main()
{
int hh, mm, ss ;
char t12[3];
scanf("%d:%d:%d%s", &hh, &mm, &ss, t12);
if (strcmp(t12,"PM")==0 && hh!=12)
{
hh += 12 ;
}
if (strcmp(t12,"AM")==0 && hh==12)
{
hh = 0 ;
}
printf("%02d:%02d:%02d", hh, mm, ss);
return 0;
}
June 10, 2020