Questions of competitive Programmer Java Technology Python programing Computer Networks
#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;
}
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.
}
}
#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;
}

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
#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;
}
HackerRank Solutions
5_6282599249154670857.pdf
Introduction to algorithms