Day 00 Hello World
CPP
cpp
#include <iostream>
int main()
{
string input_string;
getline(cin, input_string);
cout << "Hello, World." << input_string << endl;
return 0;
}C
c
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main()
{
char input_string[105];
scanf("%[^\n]", input_string);
printf("Hello, World.\n%s", input_string);
return 0;
}Java
java
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String inputString = scan.nextLine();
scan.close();
System.out.println("Hello, World.");
System.out.println(inputString);
}
}Javascript
javascript
function processData(inputString) {
console.log("Hello, World.\n" + inputString);
}
process.stdin.resume();
process.stdin.setEncoding("ascii");
_input = "";
process.stdin.on("data", function (input) {
_input += input;
});
process.stdin.on("end", function () {
processData(_input);
});Python
python
print('Hello, World.\n' + input())Day 01 Data Types
CPP
cpp
#include <iostream>
#include <iomanip>
#include <limits>
using namespace std;
int main()
{
int i = 4;
double d = 4.0;
string s = "HackerRank ";
int i2;
double d2;
string s2;
cin >> i2 >> d2;
cin.ignore();
getline(cin, s2);
cout << i + i2 << endl;
printf("%.1f\n", d + d2);
cout << s + s2;
return 0;
}C
c
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main()
{
int i = 4;
double d = 4.0;
char s[] = "HackerRank ";
int i2;
double d2;
char s2[47];
scanf("%d %lf\n%[^\n]", &i2, &d2, s2);
printf("%d\n%.01lf\n%s%s", i + i2, d + d2, s, s2);
return 0;
}Java
java
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
int i = 4;
double d = 4.0;
String s = "HackerRank ";
Scanner scan = new Scanner(System.in);
int i2;
double d2;
String s2;
i2 = scan.nextInt();
d2 = scan.nextDouble();
scan.nextLine();
s2 = scan.nextLine();
System.out.println(i + i2);
System.out.println(d + d2);
System.out.println(s + s2);
scan.close();
}
}Javascript
javascript
process.stdin.resume();
process.stdin.setEncoding("ascii");
var input_stdin = "";
var input_stdin_array = "";
var input_currentline = 0;
process.stdin.on("data", function (data) {
input_stdin += data;
});
process.stdin.on("end", function () {
input_stdin_array = input_stdin.split("\n");
main();
});
// Reads complete line from STDIN
function readLine() {
return input_stdin_array[input_currentline++];
}
function main() {
var i = 4;
var d = 4.0;
var s = "HackerRank ";
var i1;
var d1;
var s1;
i1 = parseInt(readLine());
d1 = parseFloat(readLine());
s1 = readLine();
console.log(i + i1);
console.log((d + d1).toFixed(1));
console.log(s + s1);
}Python
python
i = 4
d = 4.0
s = 'HackerRank '
print(i + int(input()))
print(d + float(input()))
print(s + input())Day 02 Operators
CPP
cpp
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
void solve(double meal_cost, int tip_percent, int tax_percent)
{
int ans = round(meal_cost * tip_percent / 100 + meal_cost * tax_percent / 100 + meal_cost);
cout << ans << endl;
}
int main()
{
string meal_cost_temp;
getline(cin, meal_cost_temp);
double meal_cost = stod(ltrim(rtrim(meal_cost_temp)));
string tip_percent_temp;
getline(cin, tip_percent_temp);
int tip_percent = stoi(ltrim(rtrim(tip_percent_temp)));
string tax_percent_temp;
getline(cin, tax_percent_temp);
int tax_percent = stoi(ltrim(rtrim(tax_percent_temp)));
solve(meal_cost, tip_percent, tax_percent);
return 0;
}
string ltrim(const string &str)
{
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace))));
return s;
}
string rtrim(const string &str)
{
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end());
return s;
}C
c
#include <assert.h>
#include <ctype.h>
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
char *readline();
char *ltrim(char *);
char *rtrim(char *);
double parse_double(char *);
int parse_int(char *);
void solve(double meal_cost, int tip_percent, int tax_percent)
{
int ans = round(meal_cost * tip_percent / 100 + meal_cost * tax_percent / 100 + meal_cost);
printf("%d", ans);
}
int main()
{
double meal_cost = parse_double(ltrim(rtrim(readline())));
int tip_percent = parse_int(ltrim(rtrim(readline())));
int tax_percent = parse_int(ltrim(rtrim(readline())));
solve(meal_cost, tip_percent, tax_percent);
return 0;
}
char *readline()
{
size_t alloc_length = 1024;
size_t data_length = 0;
char *data = malloc(alloc_length);
while (true)
{
char *cursor = data + data_length;
char *line = fgets(cursor, alloc_length - data_length, stdin);
if (!line)
{
break;
}
data_length += strlen(cursor);
if (data_length < alloc_length - 1 || data[data_length - 1] == '\n')
{
break;
}
alloc_length <<= 1;
data = realloc(data, alloc_length);
if (!data)
{
data = ' ';
break;
}
}
if (data[data_length - 1] == '\n')
{
data[data_length - 1] = ' ';
data = realloc(data, data_length);
if (!data)
{
data = ' ';
}
}
else
{
data = realloc(data, data_length + 1);
if (!data)
{
data = ' ';
}
else
{
data[data_length] = ' ';
}
}
return data;
}
char *ltrim(char *str)
{
if (!str)
{
return ' ';
}
if (!*str)
{
return str;
}
while (*str != ' ' && isspace(*str))
{
str++;
}
return str;
}
char *rtrim(char *str)
{
if (!str)
{
return ' ';
}
if (!*str)
{
return str;
}
char *end = str + strlen(str) - 1;
while (end >= str && isspace(*end))
{
end--;
}
*(end + 1) = ' ';
return str;
}
double parse_double(char *str)
{
char *endptr;
double value = strtod(str, &endptr);
if (endptr == str || *endptr != ' ')
{
exit(EXIT_FAILURE);
}
return value;
}
int parse_int(char *str)
{
char *endptr;
int value = strtol(str, &endptr, 10);
if (endptr == str || *endptr != ' ')
{
exit(EXIT_FAILURE);
}
return value;
}Java
java
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;
class Result {
/*
* Complete the 'solve' function below.
*
* The function accepts following parameters:
* 1. DOUBLE meal_cost
* 2. INTEGER tip_percent
* 3. INTEGER tax_percent
*/
public static void solve(double meal_cost, int tip_percent, int tax_percent) {
int ans = (int) Math.round(meal_cost + meal_cost * tip_percent / 100.0 + meal_cost * tax_percent / 100.0);
System.out.println(ans);
}
}
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
double meal_cost = Double.parseDouble(bufferedReader.readLine().trim());
int tip_percent = Integer.parseInt(bufferedReader.readLine().trim());
int tax_percent = Integer.parseInt(bufferedReader.readLine().trim());
Result.solve(meal_cost, tip_percent, tax_percent);
bufferedReader.close();
}
}Javascript
javascript
"use strict";
process.stdin.resume();
process.stdin.setEncoding("utf-8");
let inputString = "";
let currentLine = 0;
process.stdin.on("data", function (inputStdin) {
inputString += inputStdin;
});
process.stdin.on("end", function () {
inputString = inputString.split("\n");
main();
});
function readLine() {
return inputString[currentLine++];
}
function solve(meal_cost, tip_percent, tax_percent) {
console.log(
Math.round(
meal_cost +
(meal_cost * tip_percent) / 100 +
(meal_cost * tax_percent) / 100
)
);
}
function main() {
const meal_cost = parseFloat(readLine().trim());
const tip_percent = parseInt(readLine().trim(), 10);
const tax_percent = parseInt(readLine().trim(), 10);
solve(meal_cost, tip_percent, tax_percent);
}Day 03 Conditional Statements
CPP
cpp
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
int main()
{
string N_temp;
getline(cin, N_temp);
int N = stoi(ltrim(rtrim(N_temp)));
if (N % 2 == 0 and (N < 6 or N > 20) )
printf("Not ");
printf("Weird");
return 0;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end()
);
return s;
}C
c
#include <assert.h>
#include <ctype.h>
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
char *readline();
char *ltrim(char *);
char *rtrim(char *);
int parse_int(char *);
int main()
{
int N = parse_int(ltrim(rtrim(readline())));
if (N % 2 == 0 && (N < 6 || N > 20))
printf("Not ");
printf("Weird");
return 0;
}
char *readline()
{
size_t alloc_length = 1024;
size_t data_length = 0;
char *data = malloc(alloc_length);
while (true)
{
char *cursor = data + data_length;
char *line = fgets(cursor, alloc_length - data_length, stdin);
if (!line)
{
break;
}
data_length += strlen(cursor);
if (data_length < alloc_length - 1 || data[data_length - 1] == '\n')
{
break;
}
alloc_length <<= 1;
data = realloc(data, alloc_length);
if (!data)
{
data = ' ';
break;
}
}
if (data[data_length - 1] == '\n')
{
data[data_length - 1] = ' ';
data = realloc(data, data_length);
if (!data)
{
data = ' ';
}
}
else
{
data = realloc(data, data_length + 1);
if (!data)
{
data = ' ';
}
else
{
data[data_length] = ' ';
}
}
return data;
}
char *ltrim(char *str)
{
if (!str)
{
return ' ';
}
if (!*str)
{
return str;
}
while (*str != ' ' && isspace(*str))
{
str++;
}
return str;
}
char *rtrim(char *str)
{
if (!str)
{
return ' ';
}
if (!*str)
{
return str;
}
char *end = str + strlen(str) - 1;
while (end >= str && isspace(*end))
{
end--;
}
*(end + 1) = ' ';
return str;
}
int parse_int(char *str)
{
char *endptr;
int value = strtol(str, &endptr, 10);
if (endptr == str || *endptr != ' ')
{
exit(EXIT_FAILURE);
}
return value;
}Java
java
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(bufferedReader.readLine().trim());
if (N % 2 == 0 && (N < 6 || N > 20) )
System.out.print("Not ");
System.out.print("Weird");
bufferedReader.close();
}
}Javascript
javascript
"use strict";
process.stdin.resume();
process.stdin.setEncoding("utf-8");
let inputString = "";
let currentLine = 0;
process.stdin.on("data", function (inputStdin) {
inputString += inputStdin;
});
process.stdin.on("end", function () {
inputString = inputString.split("\n");
main();
});
function readLine() {
return inputString[currentLine++];
}
function main() {
const N = parseInt(readLine().trim(), 10);
if (N % 2 == 0 && (N < 6 || N > 20)) process.stdout.write("Not ");
process.stdout.write("Weird");
}Python
python
#!/bin/python3
import math
import os
import random
import re
import sys
if __name__ == '__main__':
N = int(input().strip())
if N % 2 == 0 and (N < 6 or N > 20):
print("Not", end=' ')
print("Weird")
Day 04 Class vs. Instance
CPP
cpp
using namespace std;
#include <iostream>
class Person
{
public:
int age;
Person(int initialAge);
void amIOld();
void yearPasses();
};
Person::Person(int initialAge)
{
if (initialAge < 0)
{
cout << "Age is not valid, setting age to 0." << endl;
age = 0;
}
else
age = initialAge;
}
void Person::amIOld()
{
if (age < 13)
{
cout << "You are young." << endl;
}
else if (age >= 13 && age < 18)
{
cout << "You are a teenager." << endl;
}
else
{
cout << "You are old." << endl;
}
}
void Person::yearPasses()
{
age++;
}
int main()
{
int t;
int age;
cin >> t;
for (int i = 0; i < t; i++)
{
cin >> age;
Person p(age);
p.amIOld();
for (int j = 0; j < 3; j++)
{
p.yearPasses();
}
p.amIOld();
cout << '\n';
}
return 0;
}Java
java
import java.io.*;
import java.util.*;
public class Person {
private int age;
public Person(int initialAge) {
if (initialAge < 0)
{
System.out.println("Age is not valid, setting age to 0.");
age = 0;
}
else
age = initialAge;
}
public void amIOld() {
if (age < 13)
{
System.out.println("You are young.");
} else
if ( age >= 13 && age < 18)
{
System.out.println("You are a teenager.");
}
else{
System.out.println("You are old.");
}
}
public void yearPasses() {
age++;
}
public static void main(String[] args) {Javascript
javascript
process.stdin.resume();
process.stdin.setEncoding('ascii');
var input_stdin = "";
var input_stdin_array = "";
var input_currentline = 0;
process.stdin.on('data', function (data) {
input_stdin += data;
});
process.stdin.on('end', function () {
input_stdin_array = input_stdin.split("\n");
main();
});
function readLine() {
return input_stdin_array[input_currentline++];
}
function Person(initialAge){
if (initialAge < 0){
age = 0
console.log("Age is not valid, setting age to 0.")
}
else
age = initialAge
this.amIOld=function(){
if (age < 13)
console.log("You are young.")
else if (age < 18)
console.log("You are a teenager.")
else
console.log("You are old.")
};
this.yearPasses=function(){
age++
};
}
function main() {Python
python
class Person:
def __init__(self, initialAge):
if initialAge < 0:
print("Age is not valid, setting age to 0.")
self.age = 0
else:
self.age = initialAge
def amIOld(self):
if self.age < 13:
print("You are young.")
elif self.age < 18:
print("You are a teenager.")
else:
print("You are old.")
def yearPasses(self):
self.age += 1
t = int(input())
for i in range(0, t):
age = int(input())
p = Person(age)
p.amIOld()
for j in range(0, 3):
p.yearPasses()
p.amIOld()
print("")Day 05 Loops
CPP
cpp
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
int main()
{
string n_temp;
getline(cin, n_temp);
int n = stoi(ltrim(rtrim(n_temp)));
for(int i = 1; i<11; i++)
cout << n <<" x "<<i<<" = " << i*n << endl;
return 0;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end()
);
return s;
}C
c
#include <assert.h>
#include <ctype.h>
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
char* readline();
char* ltrim(char*);
char* rtrim(char*);
int parse_int(char*);
int main()
{
int n = parse_int(ltrim(rtrim(readline())));
for(int i = 1; i<11; i++)
printf("%d x %d = %d\n",n,i,i*n);
return 0;
}
char* readline() {
size_t alloc_length = 1024;
size_t data_length = 0;
char* data = malloc(alloc_length);
while (true) {
char* cursor = data + data_length;
char* line = fgets(cursor, alloc_length - data_length, stdin);
if (!line) {
break;
}
data_length += strlen(cursor);
if (data_length < alloc_length - 1 || data[data_length - 1] == '\n') {
break;
}
alloc_length <<= 1;
data = realloc(data, alloc_length);
if (!data) {
data = ' ';
break;
}
}
if (data[data_length - 1] == '\n') {
data[data_length - 1] = ' ';
data = realloc(data, data_length);
if (!data) {
data = ' ';
}
} else {
data = realloc(data, data_length + 1);
if (!data) {
data = ' ';
} else {
data[data_length] = ' ';
}
}
return data;
}
char* ltrim(char* str) {
if (!str) {
return ' ';
}
if (!*str) {
return str;
}
while (*str != ' ' && isspace(*str)) {
str++;
}
return str;
}
char* rtrim(char* str) {
if (!str) {
return ' ';
}
if (!*str) {
return str;
}
char* end = str + strlen(str) - 1;
while (end >= str && isspace(*end)) {
end--;
}
*(end + 1) = ' ';
return str;
}
int parse_int(char* str) {
char* endptr;
int value = strtol(str, &endptr, 10);
if (endptr == str || *endptr != ' ') {
exit(EXIT_FAILURE);
}
return value;
}Java
java
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(bufferedReader.readLine().trim());
for(int i = 1; i<11; i++)
System.out.println(n +" x "+i+" = " + i*n);
bufferedReader.close();
}
}Javascript
javascript
"use strict";
process.stdin.resume();
process.stdin.setEncoding("utf-8");
let inputString = "";
let currentLine = 0;
process.stdin.on("data", function (inputStdin) {
inputString += inputStdin;
});
process.stdin.on("end", function () {
inputString = inputString.split("\n");
main();
});
function readLine() {
return inputString[currentLine++];
}
function main() {
const n = parseInt(readLine().trim(), 10);
for (let i = 1; i < 11; i++) console.log(n + " x " + i + " = " + i * n);
}Python
python
#!/bin/python3
import math
import os
import random
import re
import sys
if __name__ == '__main__':
n = int(input().strip())
for i in range(1,11):
print(str(n) +" x "+str(i)+" = " +str(i*n))Day 06 Let’s Review
CPP
cpp
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int t;
cin >> t;
while(t--)
{
string str;
cin >> str;
for(int i = 0; i<str.size(); i += 2)
cout << str[i];
cout << " ";
for(int i = 1; i<str.size(); i += 2)
cout << str[i];
cout << endl;
}
return 0;
}C
c
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main() {
int t;
scanf("%d",&t);
while(t--)
{
char str[10000];
scanf("%s",str);
for(int i = 0; i<strlen(str); i += 2)
printf("%c",str[i]);
printf(" ") ;
for(int i = 1; i<strlen(str); i += 2)
printf("%c",str[i]);
printf("\n");
}
return 0;
}Java
java
import java.io.*;
import java.util.*;
public class Solution {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
sc.nextLine();
for (int i = 0; i < n; i++) {
String string = sc.nextLine();
char[] charArray = string.toCharArray();
for (int j = 0; j < charArray.length; j += 2)
System.out.print(charArray[j]);
System.out.print(" ");
for (int j = 1; j < charArray.length; j += 2)
System.out.print(charArray[j]);
System.out.println();
}
sc.close();
}
}Javascript
javascript
function processData(input) {
input = input.split("\n");
for (let i = 1; i <= input[0]; i++) {
var str = input[i].split("");
for (x = 0; x < str.length; x += 2) process.stdout.write(str[x]);
process.stdout.write(" ");
for (x = 1; x < str.length; x += 2) process.stdout.write(str[x]);
console.log(" ");
}
}
process.stdin.resume();
process.stdin.setEncoding("ascii");
_input = "";
process.stdin.on("data", function (input) {
_input += input;
});
process.stdin.on("end", function () {
processData(_input);
});Python
python
for i in range(int(input())):
s = input()
print(s[::2], s[1::2])Day 07 Arrays
CPP
cpp
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
vector<string> split(const string &);
int main()
{
string n_temp;
getline(cin, n_temp);
int n = stoi(ltrim(rtrim(n_temp)));
string arr_temp_temp;
getline(cin, arr_temp_temp);
vector<string> arr_temp = split(rtrim(arr_temp_temp));
vector<int> arr(n);
for (int i = 0; i < n; i++) {
int arr_item = stoi(arr_temp[i]);
arr[i] = arr_item;
}
for(auto it = arr.rbegin(); it != arr.rend(); it++){
std::cout << *it << " ";
}
return 0;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end()
);
return s;
}
vector<string> split(const string &str) {
vector<string> tokens;
string::size_type start = 0;
string::size_type end = 0;
while ((end = str.find(" ", start)) != string::npos) {
tokens.push_back(str.substr(start, end - start));
start = end + 1;
}
tokens.push_back(str.substr(start));
return tokens;
}C
c
#include <assert.h>
#include <ctype.h>
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
char* readline();
char* ltrim(char*);
char* rtrim(char*);
char** split_string(char*);
int parse_int(char*);
int main()
{
int n = parse_int(ltrim(rtrim(readline())));
char** arr_temp = split_string(rtrim(readline()));
int* arr = malloc(n * sizeof(int));
for (int i = 0; i < n; i++) {
int arr_item = parse_int(*(arr_temp + i));
*(arr + i) = arr_item;
}
for (int i = n -1; i >=0 ; i--)
printf("%d ",arr[i]);
return 0;
}
char* readline() {
size_t alloc_length = 1024;
size_t data_length = 0;
char* data = malloc(alloc_length);
while (true) {
char* cursor = data + data_length;
char* line = fgets(cursor, alloc_length - data_length, stdin);
if (!line) {
break;
}
data_length += strlen(cursor);
if (data_length < alloc_length - 1 || data[data_length - 1] == '\n') {
break;
}
alloc_length <<= 1;
data = realloc(data, alloc_length);
if (!data) {
data = ' ';
break;
}
}
if (data[data_length - 1] == '\n') {
data[data_length - 1] = ' ';
data = realloc(data, data_length);
if (!data) {
data = ' ';
}
} else {
data = realloc(data, data_length + 1);
if (!data) {
data = ' ';
} else {
data[data_length] = ' ';
}
}
return data;
}
char* ltrim(char* str) {
if (!str) {
return ' ';
}
if (!*str) {
return str;
}
while (*str != ' ' && isspace(*str)) {
str++;
}
return str;
}
char* rtrim(char* str) {
if (!str) {
return ' ';
}
if (!*str) {
return str;
}
char* end = str + strlen(str) - 1;
while (end >= str && isspace(*end)) {
end--;
}
*(end + 1) = ' ';
return str;
}
char** split_string(char* str) {
char** splits = NULL;
char* token = strtok(str, " ");
int spaces = 0;
while (token) {
splits = realloc(splits, sizeof(char*) * ++spaces);
if (!splits) {
return splits;
}
splits[spaces - 1] = token;
token = strtok(NULL, " ");
}
return splits;
}
int parse_int(char* str) {
char* endptr;
int value = strtol(str, &endptr, 10);
if (endptr == str || *endptr != ' ') {
exit(EXIT_FAILURE);
}
return value;
}Java
java
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(bufferedReader.readLine().trim());
List<Integer> arr = Stream.of(bufferedReader.readLine().replaceAll("\s+$", "").split(" ")).map(Integer::parseInt).collect(toList());
for (int i = n - 1 ; i >= 0; i--) {
System.out.print(arr.get(i) + " ");
}
bufferedReader.close();
}
}Javascript
javascript
"use strict";
process.stdin.resume();
process.stdin.setEncoding("utf-8");
let inputString = "";
let currentLine = 0;
process.stdin.on("data", function (inputStdin) {
inputString += inputStdin;
});
process.stdin.on("end", function () {
inputString = inputString.split("\n");
main();
});
function readLine() {
return inputString[currentLine++];
}
function main() {
const n = parseInt(readLine().trim(), 10);
const arr = readLine()
.replace(/s+$/g, "")
.split(" ")
.map((arrTemp) => parseInt(arrTemp, 10));
for (let i = n - 1; i >= 0; i--) process.stdout.write(arr[i] + " ");
}Python
python
input()
arr = str(input()).split(" ")
print(" ".join(map(str, arr[::-1])))Day 08 Dictionaries and Maps
CPP
cpp
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
int main() {
map<string, int> pb;
int n;
cin >> n;
string name;
for(int i=0; i<n; i++){
cin >> name;
if (!pb[name])
cin >> pb[name];
}
for(int i=0; i<n; i++){
cin >> name;
if(pb.find(name) != pb.end())
cout << name <<"="<< pb[name] << endl;
else
cout << "Not found" << endl;
}
return 0;
}Java
java
import java.io.*;
import java.util.*;
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
Map<String,Integer> pb = new HashMap<String,Integer>();
for(int i = 0; i < n; i++)
pb.put(in.next(), in.nextInt());
while(in.hasNext()){
String name = in.next();
if (pb.containsKey(name))
System.out.println(name + "=" + pb.get(name) );
else
System.out.println("Not found");
}
in.close();
}
}Javascript
javascript
function processData(input) {
input = input.split("\n");
let pb = {};
for (i = 1; i <= parseInt(input[0]); i++) {
let entry = input[i].split(" ");
pb[entry[0]] = entry[1];
}
for (i = parseInt(input[0]) + 1; i < input.length; i++) {
if (pb[input[i]]) console.log(input[i] + "=" + pb[input[i]]);
else console.log("Not found");
}
}
process.stdin.resume();
process.stdin.setEncoding("ascii");
_input = "";
process.stdin.on("data", function (input) {
_input += input;
});
process.stdin.on("end", function () {
processData(_input);
});Python
python
import sys
pb = {}
for i in range(int(input())):
contact = input().split(' ')
pb[contact[0]] = contact[1]
query = sys.stdin.readline().strip()
while query:
if query in pb:
print("{}={}".format(query, pb[query]))
else:
print("Not found")
query = sys.stdin.readline().strip()Day 09 Recursion 3
CPP
cpp
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
/*
* Complete the 'factorial' function below.
*
* The function is expected to return an INTEGER.
* The function accepts INTEGER n as parameter.
*/
int factorial(int n) {
if (n == 1)
return 1;
return n * factorial(n-1);
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
string n_temp;
getline(cin, n_temp);
int n = stoi(ltrim(rtrim(n_temp)));
int result = factorial(n);
fout << result << "\n";
fout.close();
return 0;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end()
);
return s;
}C
c
Java
java
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;
class Result {
/*
* Complete the 'factorial' function below.
*
* The function is expected to return an INTEGER.
* The function accepts INTEGER n as parameter.
*/
public static int factorial(int n) {
if (n == 1)
return 1;
return n * factorial(n-1);
}
}
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int n = Integer.parseInt(bufferedReader.readLine().trim());
int result = Result.factorial(n);
bufferedWriter.write(String.valueOf(result));
bufferedWriter.newLine();
bufferedReader.close();
bufferedWriter.close();
}
}Javascript
javascript
"use strict";
const fs = require("fs");
process.stdin.resume();
process.stdin.setEncoding("utf-8");
let inputString = "";
let currentLine = 0;
process.stdin.on("data", function (inputStdin) {
inputString += inputStdin;
});
process.stdin.on("end", function () {
inputString = inputString.split("\n");
main();
});
function readLine() {
return inputString[currentLine++];
}
/*
* Complete the 'factorial' function below.
*
* The function is expected to return an INTEGER.
* The function accepts INTEGER n as parameter.
*/
function factorial(n) {
if (n == 1) return 1;
return n * factorial(n - 1);
}
function main() {
const ws = fs.createWriteStream(process.env.OUTPUT_PATH);
const n = parseInt(readLine().trim(), 10);
const result = factorial(n);
ws.write(result + "\n");
ws.end();
}Python
python
#!/bin/python3
import math
import os
import random
import re
import sys
#
## Complete the 'factorial' function below.
#
## The function is expected to return an INTEGER.
## The function accepts INTEGER n as parameter.
#
def factorial(n):
if n == 1:
return 1
return n * factorial(n-1)
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
n = int(input().strip())
result = factorial(n)
fptr.write(str(result) + '\n')
fptr.close()Day 10 Binary Numbers
CPP
cpp
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
int main()
{
string n_temp;
getline(cin, n_temp);
int n = stoi(ltrim(rtrim(n_temp)));
int ans = 0, series = 0;
while(n>0)
{
if (n%2 == 1)
series++;
else
series = 0;
ans = max(ans, series);
n = n/2;
}
cout << ans << endl;
return 0;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end()
);
return s;
}C
c
#include <assert.h>
#include <ctype.h>
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX(x, y) (((x) > (y)) ? (x) : (y))
char* readline();
char* ltrim(char*);
char* rtrim(char*);
int parse_int(char*);
int main()
{
int n = parse_int(ltrim(rtrim(readline())));
int ans = 0, series = 0;
while(n>0)
{
if (n%2 == 1)
series++;
else
series = 0;
ans = MAX(ans, series);
n = n/2;
}
printf("%d\n", ans);
return 0;
}
char* readline() {
size_t alloc_length = 1024;
size_t data_length = 0;
char* data = malloc(alloc_length);
while (true) {
char* cursor = data + data_length;
char* line = fgets(cursor, alloc_length - data_length, stdin);
if (!line) {
break;
}
data_length += strlen(cursor);
if (data_length < alloc_length - 1 || data[data_length - 1] == '\n') {
break;
}
alloc_length <<= 1;
data = realloc(data, alloc_length);
if (!data) {
data = ' ';
break;
}
}
if (data[data_length - 1] == '\n') {
data[data_length - 1] = ' ';
data = realloc(data, data_length);
if (!data) {
data = ' ';
}
} else {
data = realloc(data, data_length + 1);
if (!data) {
data = ' ';
} else {
data[data_length] = ' ';
}
}
return data;
}
char* ltrim(char* str) {
if (!str) {
return ' ';
}
if (!*str) {
return str;
}
while (*str != ' ' && isspace(*str)) {
str++;
}
return str;
}
char* rtrim(char* str) {
if (!str) {
return ' ';
}
if (!*str) {
return str;
}
char* end = str + strlen(str) - 1;
while (end >= str && isspace(*end)) {
end--;
}
*(end + 1) = ' ';
return str;
}
int parse_int(char* str) {
char* endptr;
int value = strtol(str, &endptr, 10);
if (endptr == str || *endptr != ' ') {
exit(EXIT_FAILURE);
}
return value;
}Java
java
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(bufferedReader.readLine().trim());
int ans = 0, series = 0;
while(n>0)
{
if (n%2 == 1)
series++;
else
series = 0;
ans = Math.max(ans, series);
n = n/2;
}
System.out.println(ans);
bufferedReader.close();
}
}Javascript
javascript
"use strict";
process.stdin.resume();
process.stdin.setEncoding("utf-8");
let inputString = "";
let currentLine = 0;
process.stdin.on("data", function (inputStdin) {
inputString += inputStdin;
});
process.stdin.on("end", function () {
inputString = inputString.split("\n");
main();
});
function readLine() {
return inputString[currentLine++];
}
function main() {
var n = parseInt(readLine().trim(), 10);
var ans = 0,
series = 0;
while (n > 0) {
if (n % 2 == 1) series++;
else series = 0;
ans = Math.max(ans, series);
n = parseInt(n / 2);
}
console.log(ans);
}Python
python
#!/bin/python3
import math
import os
import random
import re
import sys
if __name__ == '__main__':
n = int(input().strip())
ans = 0
series = 0
while n>0 :
if n%2 == 1 :
series += 1
else :
series = 0
ans = max(ans, series)
n = n //2
print(ans)Day 11 2D Arrays
CPP
cpp
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
vector<string> split(const string &);
int main()
{
vector<vector<int>> arr(6);
for (int i = 0; i < 6; i++) {
arr[i].resize(6);
string arr_row_temp_temp;
getline(cin, arr_row_temp_temp);
vector<string> arr_row_temp = split(rtrim(arr_row_temp_temp));
for (int j = 0; j < 6; j++) {
int arr_row_item = stoi(arr_row_temp[j]);
arr[i][j] = arr_row_item;
}
}
int ans = INT_MIN ;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++)
ans = max(ans, arr[i][j] + arr[i][j+1] + arr[i][j+2] + arr[i+1] [j+1] + arr[i+2][j] + arr[i+2][j+1] + arr[i+2][j+2]);
}
cout << ans << endl;
return 0;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end()
);
return s;
}
vector<string> split(const string &str) {
vector<string> tokens;
string::size_type start = 0;
string::size_type end = 0;
while ((end = str.find(" ", start)) != string::npos) {
tokens.push_back(str.substr(start, end - start));
start = end + 1;
}
tokens.push_back(str.substr(start));
return tokens;
}C
c
#include <assert.h>
#include <ctype.h>
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX(x, y) (((x) > (y)) ? (x) : (y))
char* readline();
char* ltrim(char*);
char* rtrim(char*);
char** split_string(char*);
int parse_int(char*);
int main()
{
int** arr = malloc(6 * sizeof(int*));
for (int i = 0; i < 6; i++) {
*(arr + i) = malloc(6 * (sizeof(int)));
char** arr_item_temp = split_string(rtrim(readline()));
for (int j = 0; j < 6; j++) {
int arr_item = parse_int(*(arr_item_temp + j));
*(*(arr + i) + j) = arr_item;
}
}
int ans = INT_MIN ;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++)
ans = MAX(ans, arr[i][j] + arr[i][j+1] + arr[i][j+2] + arr[i+1][j+1] + arr[i+2][j] + arr[i+2][j+1] + arr[i+2][j+2]);
}
printf("%d\n", ans);
return 0;
}
char* readline() {
size_t alloc_length = 1024;
size_t data_length = 0;
char* data = malloc(alloc_length);
while (true) {
char* cursor = data + data_length;
char* line = fgets(cursor, alloc_length - data_length, stdin);
if (!line) {
break;
}
data_length += strlen(cursor);
if (data_length < alloc_length - 1 || data[data_length - 1] == '\n') {
break;
}
alloc_length <<= 1;
data = realloc(data, alloc_length);
if (!data) {
data = ' ';
break;
}
}
if (data[data_length - 1] == '\n') {
data[data_length - 1] = ' ';
data = realloc(data, data_length);
if (!data) {
data = ' ';
}
} else {
data = realloc(data, data_length + 1);
if (!data) {
data = ' ';
} else {
data[data_length] = ' ';
}
}
return data;
}
char* ltrim(char* str) {
if (!str) {
return ' ';
}
if (!*str) {
return str;
}
while (*str != ' ' && isspace(*str)) {
str++;
}
return str;
}
char* rtrim(char* str) {
if (!str) {
return ' ';
}
if (!*str) {
return str;
}
char* end = str + strlen(str) - 1;
while (end >= str && isspace(*end)) {
end--;
}
*(end + 1) = ' ';
return str;
}
char** split_string(char* str) {
char** splits = NULL;
char* token = strtok(str, " ");
int spaces = 0;
while (token) {
splits = realloc(splits, sizeof(char*) * ++spaces);
if (!splits) {
return splits;
}
splits[spaces - 1] = token;
token = strtok(NULL, " ");
}
return splits;
}
int parse_int(char* str) {
char* endptr;
int value = strtol(str, &endptr, 10);
if (endptr == str || *endptr != ' ') {
exit(EXIT_FAILURE);
}
return value;
}Java
java
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int arr[][] = new int[6][6];
for(int i=0; i < 6; i++){
for(int j=0; j < 6; j++){
arr[i][j] = sc.nextInt();
}
}
int ans = Integer.MIN_VALUE;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++)
ans = Math.max(ans, arr[i][j] + arr[i][j+1] + arr[i][j+2] + arr[i+1][j+1] +
arr[i+2][j] + arr[i+2][j+1] + arr[i+2][j+2]);
}
System.out.println(ans);
sc.close();
}
}Javascript
javascript
"use strict";
process.stdin.resume();
process.stdin.setEncoding("utf-8");
let inputString = "";
let currentLine = 0;
process.stdin.on("data", function (inputStdin) {
inputString += inputStdin;
});
process.stdin.on("end", function () {
inputString = inputString.split("\n");
main();
});
function readLine() {
return inputString[currentLine++];
}
function main() {
var arr = Array(6);
var i, j;
for (i = 0; i < 6; i++) {
arr[i] = readLine().split(" ");
arr[i] = arr[i].map(Number);
}
var ans = -64;
for (i = 0; i < 4; i++) {
for (j = 0; j < 4; j++) {
ans = Math.max(
ans,
arr[i][j] +
arr[i][j + 1] +
arr[i][j + 2] +
arr[i + 1][j + 1] +
arr[i + 2][j] +
arr[i + 2][j + 1] +
arr[i + 2][j + 2]
);
}
}
console.log(ans);
}Python
python
#!/bin/python3
import math
import os
import random
import re
import sys
if __name__ == '__main__':
arr = []
ans = -64
for _ in range(6):
arr.append(list(map(int, input().rstrip().split(' '))))
for i in range(4):
for j in range(4):
ans = max(ans,arr[i][j]+arr[i][j+1]+arr[i][j+2]+arr[i+1][j+1]+arr[i+2][j]+arr[i+2][j+1]+arr[i+2][j+2])
print (ans)Day 12 Inheritance
CPP
cpp
#include <iostream>
#include <vector>
using namespace std;
class Person{
protected:
string firstName;
string lastName;
int id;
public:
Person(string firstName, string lastName, int identification){
this->firstName = firstName;
this->lastName = lastName;
this->id = identification;
}
void printPerson(){
cout<< "Name: "<< lastName << ", "<< firstName <<"\nID: "<< id << "\n";
}
};
class Student : public Person{
private:
vector<int> testScores;
public:
Student(string firstName, string lastName, int id, vector<int> scores) : Person(firstName, lastName, id) {
this->testScores = scores;
}
char calculate() {
int total = 0;
int n = testScores.size();
for (int i = 0; i < n; i++)
total += this->testScores[i];
int avg = total / n;
if (avg > 89) return 'O';
if (avg > 79) return 'E';
if (avg > 69) return 'A';
if (avg > 54) return 'P';
if (avg > 39) return 'D';
return 'T';
}
};
int main() {
string firstName;
string lastName;
int id;
int numScores;
cin >> firstName >> lastName >> id >> numScores;
vector<int> scores;
for(int i = 0; i < numScores; i++){
int tmpScore;
cin >> tmpScore;
scores.push_back(tmpScore);
}
Student* s = new Student(firstName, lastName, id, scores);
s->printPerson();
cout << "Grade: " << s->calculate() << "\n";
return 0;
}Java
java
import java.util.*;
class Person {
protected String firstName;
protected String lastName;
protected int idNumber;
Person(String firstName, String lastName, int identification){
this.firstName = firstName;
this.lastName = lastName;
this.idNumber = identification;
}
public void printPerson(){
System.out.println("Name: " + lastName + ", " + firstName + "\nID: " + idNumber);
}
}
class Student extends Person{
private int[] scores;
Student(String firstName, String lastName, int identification, int[] scores){
super(firstName,lastName,identification);
this.scores = scores;
}
public char calculate (){
int total = 0, n = scores.length;
for (int i = 0; i < n; i++) {
total += scores[i];
}
int avg = total / n;
if (avg > 89) return 'O';
if (avg > 79) return 'E';
if (avg > 69) return 'A';
if (avg > 54) return 'P';
if (avg > 39) return 'D';
return 'T';
}
}
class Solution {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String firstName = scan.next();
String lastName = scan.next();
int id = scan.nextInt();
int numScores = scan.nextInt();
int[] testScores = new int[numScores];
for(int i = 0; i < numScores; i++){
testScores[i] = scan.nextInt();
}
scan.close();
Student s = new Student(firstName, lastName, id, testScores);
s.printPerson();
System.out.println("Grade: " + s.calculate() );
}
}Javascript
javascript
"use strict";
var _input = "";
var _index = 0;
process.stdin.on("data", (data) => {
_input += data;
});
process.stdin.on("end", () => {
_input = _input.split(new RegExp("[ \n]+"));
main();
});
function read() {
return _input[_index++];
}
/**** Ignore above this line. ****/
class Person {
constructor(firstName, lastName, identification) {
this.firstName = firstName;
this.lastName = lastName;
this.idNumber = identification;
}
printPerson() {
console.log(
"Name: " +
this.lastName +
", " +
this.firstName +
"\nID: " +
this.idNumber
);
}
}
class Student extends Person {
constructor(firstName, lastName, identification, testScores) {
super(firstName, lastName, identification);
this.testScores = testScores;
}
calculate() {
var total = 0;
this.testScores.forEach((score) => {
total += score;
});
var avg = total / this.testScores.length;
if (avg > 89) return "O";
if (avg > 79) return "E";
if (avg > 69) return "A";
if (avg > 54) return "P";
if (avg > 39) return "D";
return "T";
}
}
function main() {
let firstName = read();
let lastName = read();
let id = +read();
let numScores = +read();
let testScores = new Array(numScores);
for (var i = 0; i < numScores; i++) {
testScores[i] = +read();
}
let s = new Student(firstName, lastName, id, testScores);
s.printPerson();
s.calculate();
console.log("Grade: " + s.calculate());
}Python
python
class Person:
def __init__(self, firstName, lastName, idNumber):
self.firstName = firstName
self.lastName = lastName
self.idNumber = idNumber
def printPerson(self):
print("Name:", self.lastName + ",", self.firstName)
print("ID:", self.idNumber)
class Student(Person):
def __init__(self, firstName, lastName, idNumber, testScores):
super().__init__(firstName, lastName, idNumber)
self.testScores = testScores
def calculate(self):
total = 0
for testScore in self.testScores:
total += testScore
avg = total // len(self.testScores)
if avg > 89 : return 'O'
if avg > 79 : return 'E'
if avg > 69 : return 'A'
if avg > 54 : return 'P'
if avg > 39 : return 'D'
return 'T'
line = input().split()Day 13 Abstract Classes
CPP
cpp
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
class Book{
protected:
string title;
string author;
public:
Book(string t,string a){
title=t;
author=a;
}
virtual void display()=0;
};
class MyBook : public Book{
private:
int price;
public:
MyBook(string title, string author, int price) : Book(title, author){
this->price = price;
}
void display(){
cout << "Title: " << title << "\nAuthor: " << author << "\nPrice: " << price << endl;
}
};
int main() {
string title,author;
int price;
getline(cin,title);
getline(cin,author);
cin>>price;
MyBook novel(title,author,price);
novel.display();
return 0;
}Java
java
import java.util.*;
class Book {
protected String title;
protected String author;
Book(String title, String author){
this.title = title;
this.author = author;
}
}
class MyBook extends Book{
private int price;
MyBook(String title, String author, int price){
super(title,author);
this.price = price;
}
public void display(){
System.out.println("Title: " + title + "\nAuthor: " + author + "\nPrice: " + price);
}
}
public class Solution {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String title = sc.nextLine();
String author = sc.nextLine();
int price = sc.nextInt();
MyBook mb = new MyBook(title, author, price);
mb.display();
}
}Javascript
javascript
"use strict";
var _input = "";
var _index = 0;
process.stdin.on("data", (data) => {
_input += data;
});
process.stdin.on("end", () => {
_input = _input.split(new RegExp("\n"));
main();
});
function readLine() {
return _input[_index++];
}
/**** Ignore above this line. ****/
class Book {
constructor(title, author) {
if (this.constructor === Book) {
throw new TypeError(
"Do not attempt to directly instantiate an abstract class."
);
} else {
this.title = title;
this.author = author;
}
}
display() {
console.log("Implement the 'display' method!");
}
}
class MyBook extends Book {
constructor(title, author, price) {
super(title, author);
this.price = price;
}
display() {
process.stdout.write(
`Title: ${this.title}\nAuthor: ${this.author}\nPrice: ${this.price}`
);
}
}Python
python
from abc import ABCMeta, abstractmethod
class Book(object, metaclass=ABCMeta):
def __init__(self,title,author):
self.title=title
self.author=author
@abstractmethod
def display(): pass
class MyBook(Book):
def __init__(self,title,author,price):
super().__init__(title,author)
self.price = price
def display(self):
print("Title:",title,"\nAuthor:",author,"\nPrice:",price)
title=input()
author=input()
price=int(input())
new_novel=MyBook(title,author,price)
new_novel.display()Day 14 Scope
CPP
cpp
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
class Difference {
private:
vector<int> elements;
public:
int maximumDifference;
Difference(vector<int> elements){
this->elements = elements;
}
void computeDifference(){
int min_ele = 101, max_ele = -1;
for(int i=0; i<(int)elements.size(); i++){
if (elements[i] < min_ele) min_ele = elements[i];
if (elements[i] > max_ele) max_ele = elements[i];
}
maximumDifference = max_ele - min_ele;
}
};
int main() {
int N;
cin >> N;
vector<int> a;
for (int i = 0; i < N; i++) {
int e;
cin >> e;
a.push_back(e);
}
Difference d(a);
d.computeDifference();
cout << d.maximumDifference;
return 0;
}Java
java
import java.io.*;
import java.util.*;
class Difference{
private int[] elements;
Difference(int[] elements){
this.elements = elements;
}
public void maximumDifference;
int computeDifference(){
int min_ele = 101, max_ele = -1;
for(int i=0; i<elements.length; i++){
if (elements[i] < min_ele) min_ele = elements[i];
if (elements[i] > max_ele) max_ele = elements[i];
}
maximumDifference = max_ele - min_ele
}
}
public class Solution {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int arr[] = new int[n];
for(int i = 0; i < n; i++){
arr[i] = sc.nextInt();
}
Difference d = new Difference(arr);
d.computeDifference();
System.out.println(d.maximumDifference);
sc.close();
}
}Python
python
class Difference:
def __init__(self, a):
self.__elements = a
def computeDifference(self):
maximum = 0
min_ele=101
max_ele = -1
for i in range(len(self.__elements)):
if self.__elements[i] < min_ele : min_ele = self.__elements[i]
if self.__elements[i] > max_ele : max_ele = self.__elements[i]
self.maximumDifference = max_ele - min_ele
## End of Difference class
_ = input()
a = [int(e) for e in input().split(' ')]
d = Difference(a)
d.computeDifference()
print(d.maximumDifference)Day 15 Linked List
CPP
cpp
#include <iostream>
#include <cstddef>
using namespace std;
class Node
{
public:
int data;
Node *next;
Node(int d){
data=d;
next=NULL;
}
};
class Solution{
public:
Node* insert(Node *head,int data)
{
if(head==NULL) head=new Node(data);
else head->next=insert(head->next,data);
return head;
}
void display(Node *head)
{
Node *start=head;
while(start)
{
cout<<start->data<<" ";
start=start->next;
}
}
};
int main()
{
Node* head=NULL;
Solution mylist;
int T,data;
cin>>T;
while(T-->0){
cin>>data;
head=mylist.insert(head,data);
}
mylist.display(head);
}C
c
#include <stdlib.h>
#include <stdio.h>
typedef struct Node
{
int data;
struct Node* next;
}Node;
Node* insert(Node *head,int data)
{
if(head == NULL) {
head = malloc(sizeof(Node));
head->data = data;
}
else head->next=insert(head->next,data);
return head;
}
void display(Node *head)
{
Node *start=head;
while(start)
{
printf("%d ",start->data);
start=start->next;
}
}
int main()
{
int T,data;
scanf("%d",&T);
Node *head=NULL;
while(T-->0){
scanf("%d",&data);
head=insert(head,data);
}
display(head);
}
Java
java
import java.util.Scanner;
class Node {
int data;
Node next;
Node(int d) {
data = d;
next = null;
}
}
class Solution {
public static Node insert(Node head, int data) {
if (head == null) head = new Node(data);
else {
Node curr = head;
while (curr.next != null) curr = curr.next;
curr.next = new Node(data);
}
return head;
}
public static void display(Node head) {
Node start = head;
while (start != null) {
System.out.print(start.data + " ");
start = start.next;
}
}
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
Node head = null;
int N = sc.nextInt();
while (N-->0) {
int ele = sc.nextInt();
head = insert(head, ele);
}
display(head);
sc.close();
}
}Javascript
javascript
process.stdin.resume();
process.stdin.setEncoding("ascii");
var input_stdin = "";
var input_stdin_array = "";
var input_currentline = 0;
process.stdin.on("data", function (data) {
input_stdin += data;
});
process.stdin.on("end", function () {
input_stdin_array = input_stdin.split("\n");
main();
});
function readLine() {
return input_stdin_array[input_currentline++];
}
function Node(data) {
this.data = data;
this.next = null;
}
function Solution() {
this.insert = function (head, data) {
if (head == null) return new Node(data);
var curr = head;
while (curr.next != null) curr = curr.next;
curr.next = new Node(data);
return head;
};
this.display = function (head) {
var start = head;
while (start) {
process.stdout.write(start.data + " ");
start = start.next;
}
};
}
function main() {
var T = parseInt(readLine());
var head = null;
var mylist = new Solution();
for (i = 0; i < T; i++) {
var data = parseInt(readLine());
head = mylist.insert(head, data);
}
mylist.display(head);
}Python
python
class Node:
def __init__(self,data):
self.data = data
self.next = None
class Solution:
def display(self,head):
current = head
while current:
print(current.data,end=' ')
current = current.next
def insert(self,head,data):
if head is None: head = Node(data)
else:
curr = head
while curr.next:
curr = curr.next
curr.next = Node(data)
return head
mylist= Solution()
T=int(input())
head=None
for i in range(T):
data=int(input())
head=mylist.insert(head,data)
mylist.display(head);Day 16 Exceptions
CPP
cpp
#include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
getline(cin, S);
try {
int I = stoi(S);
cout << I << endl;
} catch(...) {
cout << "Bad String" << endl;
}
return 0;
}Java
java
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String string = in.next();
in.close();
try {
System.out.println(Integer.parseInt(string));
} catch (NumberFormatException numberFormatException) {
System.out.println("Bad String");
}
}
}
Javascript
javascript
"use strict";
process.stdin.resume();
process.stdin.setEncoding("utf-8");
let inputString = "";
let currentLine = 0;
process.stdin.on("data", function (inputStdin) {
inputString += inputStdin;
});
process.stdin.on("end", function () {
inputString = inputString.split("\n");
main();
});
function readLine() {
return inputString[currentLine++];
}
function main() {
var S = readLine();
try {
isNaN(S) ? null.throw : console.log(parseInt(S));
} catch (err) {
console.log("Bad String");
}
}Python
python
try: print(int(input()))
except: print("Bad String")Day 17 More Exceptions
CPP
cpp
#include <cmath>
#include <iostream>
#include <exception>
#include <stdexcept>
using namespace std;
class Calculator{
public:
int power(int base,int power){
if (base < 0 || power< 0) throw invalid_argument("n and p should be non-negative");
return pow(base,power);
}
};
int main()
{
Calculator myCalculator=Calculator();
int T,n,p;
cin>>T;
while(T-->0){
if(scanf("%d %d",&n,&p)==2){
try{
int ans=myCalculator.power(n,p);
cout<<ans<<endl;
}
catch(exception& e){
cout<<e.what()<<endl;
}
}
}
}Java
java
import java.util.Scanner;
class Calculator {
public int power(int n, int p) throws Exception {
if (n < 0 || p < 0) throw new Exception("n and p should be non-negative");
return (int) Math.pow(n, p);
}
}
class Solution {
public static void main(String[] argh) {
Scanner sc = new Scanner(System.in);
int T = sc.nextInt();
while (T-->0) {
int n = sc.nextInt();
int p = sc.nextInt();
Calculator myCalculator = new Calculator();
try {
int ans =
System.out.println(myCalculator.power(n, p););
} catch (Exception e) {
System.out.println(e.getMessage());
}
}
sc.close();
}
}Javascript
javascript
process.stdin.resume();
process.stdin.setEncoding("ascii");
var input_stdin = "";
var input_stdin_array = "";
var input_currentline = 0;
process.stdin.on("data", function (data) {
input_stdin += data;
});
process.stdin.on("end", function () {
input_stdin_array = input_stdin.split("\n");
main();
});
function readLine() {
return input_stdin_array[input_currentline++];
}
class Calculator {
power(base, pow) {
if (base < 0 || pow < 0) throw "n and p should be non-negative";
return Math.pow(base, pow);
}
}
function main() {
var myCalculator = new Calculator();
var T = parseInt(readLine());
while (T-- > 0) {
var num = readLine().split(" ");
try {
var n = parseInt(num[0]);
var p = parseInt(num[1]);
var ans = myCalculator.power(n, p);
console.log(ans);
} catch (e) {
console.log(e);
}
}
}Python
python
class Calculator:
def power(self,n, p):
if n < 0 or p <0 : raise Exception("n and p should be non-negative")
return pow(n, p)
myCalculator=Calculator()
T=int(input())
for i in range(T):
n,p = map(int, input().split())
try:
ans=myCalculator.power(n,p)
print(ans)
except Exception as e:
print(e)Day 18 Queues and Stacks
CPP
cpp
#include <bits/stdc++.h>
using namespace std;
class Solution {
private:
queue<char> qu;
stack<char> st;
public:
void pushCharacter(char ch) {
st.push(ch);
}
char popCharacter() {
char ch = st.top();
st.pop();
return ch;
}
void enqueueCharacter(char ch) {
qu.push(ch);
}
char dequeueCharacter() {
char ch = qu.front();
qu.pop();
return ch;
}
};
int main() {
// read the string s.
string s;
getline(cin, s);
// create the Solution class object p.
Solution obj;
// push/enqueue all the characters of string s to stack.
for (int i = 0; i < s.length(); i++) {
obj.pushCharacter(s[i]);
obj.enqueueCharacter(s[i]);
}
bool isPalindrome = true;
// pop the top character from stack.
// dequeue the first character from queue.
// compare both the characters.
for (int i = 0; i < s.length() / 2; i++) {
if (obj.popCharacter() != obj.dequeueCharacter()) {
isPalindrome = false;
break;
}
}
// finally print whether string s is palindrome or not.
if (isPalindrome) {
cout << "The word, " << s << ", is a palindrome.";
} else {
cout << "The word, " << s << ", is not a palindrome.";
}
return 0;
}Java
java
import java.util.*;
import java.util.Scanner;
public class Solution {
Stack<Character> s = new Stack<Character>();
Queue<Character> q = new LinkedList<Character>();
void pushCharacter(char ch)
{
s.push(ch);
}
void enqueueCharacter(char ch){
q.add(ch);
}
char popCharacter() {
return s.pop();
}
char dequeueCharacter()
{
return q.remove();
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String input = scan.nextLine();
scan.close();
char[] s = input.toCharArray();
Solution p = new Solution();
for (char c : s) {
p.pushCharacter(c);
p.enqueueCharacter(c);
}
boolean isPalindrome = true;
for (int i = 0; i < s.length / 2; i++) {
if (p.popCharacter() != p.dequeueCharacter()) {
isPalindrome = false;
break;
}
}
if (isPalindrome) System.out.println("The word, " + input + ", is a palindrome.");
else System.out.println("The word, " + input + ", is not a palindrome.");
}
}Javascript
javascript
process.stdin.resume();
process.stdin.setEncoding("ascii");
var input_stdin = "";
var input_stdin_array = "";
var input_currentline = 0;
process.stdin.on("data", function (data) {
input_stdin += data;
});
process.stdin.on("end", function () {
input_stdin_array = input_stdin.split("\n");
main();
});
function readLine() {
return input_stdin_array[input_currentline++];
}
function Solution() {
this.stack = [];
this.queue = [];
this.pushCharacter = this.stack.push;
this.popCharacter = this.stack.pop;
this.enqueueCharacter = this.queue.push;
this.dequeueCharacter = this.queue.shift;
}
function main() {
// read the string s
var s = readLine();
var len = s.length;
// create the Solution class object p
var obj = new Solution();
//push/enqueue all the characters of string s to stack
for (var i = 0; i < len; i++) {
obj.pushCharacter(s.charAt(i));
obj.enqueueCharacter(s.charAt(i));
}
var isPalindrome = true;
/*
pop the top character from stack
dequeue the first character from queue
compare both the characters*/
for (var i = 0; i < len / 2; i++) {
if (obj.popCharacter() != obj.dequeueCharacter()) {
isPalindrome = false;
break;
}
}
//finally print whether string s is palindrome or not
if (isPalindrome) console.log("The word, " + s + ", is a palindrome.");
else console.log("The word, " + s + ", is not a palindrome.");
}Python
python
import sys
from collections import deque
class Solution:
def __init__(self):
self.s = deque()
self.q = deque()
def pushCharacter(self, char): self.s.append(char)
def popCharacter(self): return(self.s.pop())
def enqueueCharacter(self, char): self.q.append(char)
def dequeueCharacter(self): return(self.q.popleft())
## read the string s
s=input()
#Create the Solution class object
obj=Solution()
l=len(s)
## push/enqueue all the characters of string s to stack
for i in range(l):
obj.pushCharacter(s[i])
obj.enqueueCharacter(s[i])
isPalindrome=True
'''
pop the top character from stack
dequeue the first character from queue
compare both the characters
'''
for i in range(l // 2):
if obj.popCharacter()!=obj.dequeueCharacter():
isPalindrome=False
break
#finally print whether string s is palindrome or not.
if isPalindrome:
print("The word, "+s+", is a palindrome.")
else:
print("The word, "+s+", is not a palindrome.")Day 19 Interfaces
CPP
cpp
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
class AdvancedArithmetic{
public:
virtual int divisorSum(int n)=0;
};
class Calculator : public AdvancedArithmetic {
public:
int divisorSum(int n) {
int ans = 0;
for(int i=1; i<=n; i++)
if (n%i==0) ans += i;
return ans;
}
};
int main(){
int n;
cin >> n;
AdvancedArithmetic *myCalculator = new Calculator();
int sum = myCalculator->divisorSum(n);
cout << "I implemented: AdvancedArithmetic\n" << sum;
return 0;
}Java
java
import java.util.Scanner;
interface AdvancedArithmetic {
int divisorSum(int n);
}
class Calculator implements AdvancedArithmetic {
@Override
public int divisorSum(int n) {
int ans = 0;
for(int i=1; i<=n; i++)
if (n%i==0) ans += i;
return ans;
}
}
class Solution {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
AdvancedArithmetic myCalculator = new Calculator();
int sum = myCalculator.divisorSum(n);
System.out.println("I implemented: " + myCalculator.getClass().getInterfaces()[0].getName() + "\n" + sum);
scan.close();
}
}Python
python
class AdvancedArithmetic(object):
def divisorSum(n):
raise NotImplementedError
class Calculator(AdvancedArithmetic):
def divisorSum(self, n):
ans = 0
for i in range(1, n + 1):
if n%i == 0: ans += i
return ans
n = int(input())
my_calculator = Calculator()
s = my_calculator.divisorSum(n)
print("I implemented: " + type(my_calculator).__bases__[0].__name__)
print(s)Day 20 Sorting
CPP
cpp
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
vector<string> split(const string &);
int main()
{
string n_temp;
getline(cin, n_temp);
int n = stoi(ltrim(rtrim(n_temp)));
string a_temp_temp;
getline(cin, a_temp_temp);
vector<string> a_temp = split(rtrim(a_temp_temp));
vector<int> a(n);
for (int i = 0; i < n; i++) {
int a_item = stoi(a_temp[i]);
a[i] = a_item;
}
int numberOfSwaps =0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
if (a[j] > a[j + 1]) {
swap(a[j], a[j + 1]);
numberOfSwaps++;
}
}
if (numberOfSwaps == 0) {
break;
}
}
cout << "Array is sorted in " << numberOfSwaps <<" swaps.\n" << "First Element: "
<< a[0] << "\nLast Element: " << a[n-1];
// Write your code here
return 0;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end()
);
return s;
}
vector<string> split(const string &str) {
vector<string> tokens;
string::size_type start = 0;
string::size_type end = 0;
while ((end = str.find(" ", start)) != string::npos) {
tokens.push_back(str.substr(start, end - start));
start = end + 1;
}
tokens.push_back(str.substr(start));
return tokens;
}C
c
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
int main() {
int n;
scanf("%d", &n);
int *a = malloc(sizeof(int) * n);
for(int a_i = 0; a_i < n; a_i++){
scanf("%d", &a[a_i]);
}
int numberOfSwaps = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
if (a[j] > a[j + 1]) {
int temp = a[j + 1];
a[j + 1] = a[j];
a[j] = temp;
numberOfSwaps++;
}
}
if (numberOfSwaps == 0) break;
}
printf("Array is sorted in %d swaps.\nFirst Element: %d\nLast Element: %d\n", numberOfSwaps, a[0], a[n - 1]);
return 0;
}Java
java
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(bufferedReader.readLine().trim());
List<Integer> a = Stream.of(bufferedReader.readLine().replaceAll("\s+$", "").split(" "))
.map(Integer::parseInt)
.collect(toList());
int numberOfSwaps =0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
if (a.get(j) > a.get(j+1)) {
Collections.swap(a, j, j+1);
numberOfSwaps++;
}
}
if (numberOfSwaps == 0) {
break;
}
}
System.out.println( "Array is sorted in " + numberOfSwaps +" swaps.\n" + "First Element: " + a.get(0) + "\nLast Element: " + a.get(n-1) );
bufferedReader.close();
}
}Javascript
javascript
"use strict";
process.stdin.resume();
process.stdin.setEncoding("utf-8");
let inputString = "";
let currentLine = 0;
process.stdin.on("data", function (inputStdin) {
inputString += inputStdin;
});
process.stdin.on("end", function () {
inputString = inputString.split("\n");
main();
});
function readLine() {
return inputString[currentLine++];
}
function main() {
const n = parseInt(readLine().trim(), 10);
const a = readLine()
.replace(/s+$/g, "")
.split(" ")
.map((aTemp) => parseInt(aTemp, 10));
let numberOfSwaps = 0;
for (let i = 0; i < n; i++) {
for (let j = 0; j < n - 1; j++) {
if (a[j] > a[j + 1]) {
let temp = a[j + 1];
a[j + 1] = a[j];
a[j] = temp;
numberOfSwaps++;
}
}
if (numberOfSwaps == 0) break;
}
console.log(
`Array is sorted in ${numberOfSwaps} swaps.\nFirst Element: ${
a[0]
}\nLast Element: ${a[n - 1]}\n`
);
}Python
python
#!/bin/python3
import math
import os
import random
import re
import sys
if __name__ == '__main__':
n = int(input().strip())
a = list(map(int, input().rstrip().split()))
numberOfSwaps = 0;
for i in range(n):
for j in range(n-1):
if a[j] > a[j + 1]:
temp = a[j + 1]
a[j + 1] = a[j]
a[j] = temp
numberOfSwaps += 1
if numberOfSwaps == 0 : break
print("Array is sorted in {} swaps.\nFirst Element: {}\nLast Element: {}\n".format(numberOfSwaps,a[0],a[n-1]))Day 21 Generics
CPP
cpp
#include <iostream>
#include <vector>
#include <string>
using namespace std;
template <typename T>
void printArray(vector<T> arr){
for(auto& e : arr) cout << e << endl;
}
int main() {
int n;
cin >> n;
vector<int> int_vector(n);
for (int i = 0; i < n; i++) {
int value;
cin >> value;
int_vector[i] = value;
}
cin >> n;
vector<string> string_vector(n);
for (int i = 0; i < n; i++) {
string value;
cin >> value;
string_vector[i] = value;
}
printArray<int>(int_vector);
printArray<string>(string_vector);
return 0;
}Java
java
import java.util.*;
class Printer <T> {
public static < E > void printArray( E[] inputArray ) {
for(E elem : inputArray) {
System.out.printf("%s\n", elem);
}
}
}
public class Generics {
public static void main(String args[]){
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
Integer[] intArray = new Integer[n];
for (int i = 0; i < n; i++) {
intArray[i] = scanner.nextInt();
}
n = scanner.nextInt();
String[] stringArray = new String[n];
for (int i = 0; i < n; i++) {
stringArray[i] = scanner.next();
}
Printer<Integer> intPrinter = new Printer<Integer>();
Printer<String> stringPrinter = new Printer<String>();
intPrinter.printArray( intArray );
stringPrinter.printArray( stringArray );
if(Printer.class.getDeclaredMethods().length > 1){
System.out.println("The Printer class should only have 1 method named printArray.");
}
}
}Day 22 Binary Search Trees
CPP
cpp
#include <iostream>
#include <cstddef>
using namespace std;
class Node{
public:
int data;
Node *left;
Node *right;
Node(int d){
data = d;
left = NULL;
right = NULL;
}
};
class Solution{
public:
Node* insert(Node* root, int data) {
if(root == NULL) {
return new Node(data);
}
else {
Node* cur;
if(data <= root->data){
cur = insert(root->left, data);
root->left = cur;
}
else{
cur = insert(root->right, data);
root->right = cur;
}
return root;
}
}
int getHeight(Node* root){
if(root==NULL) return -1;
return 1+max(getHeight(root->left),getHeight(root->right));
}
}; //End of Solution
int main() {
Solution myTree;
Node* root = NULL;
int t;
int data;
cin >> t;
while(t-- > 0){
cin >> data;
root = myTree.insert(root, data);
}
int height = myTree.getHeight(root);
cout << height;
return 0;
}C
c
#include <stdio.h>
#include <stdlib.h>
typedef struct Node{
struct Node* left;
struct Node* right;
int data;
}Node;
Node* newNode(int data){
Node* node=(Node*)malloc(sizeof(Node));
node->left=node->right=NULL;
node->data=data;
return node;
}
#define max(x, y) (((x) > (y)) ? (x) : (y))
int getHeight(Node* root){
if(root==NULL) return -1;
return 1+max(getHeight(root->left),getHeight(root->right));
}
Node* insert(Node* root,int data){
if(root==NULL)
return newNode(data);
else{
Node* cur;
if(data<=root->data){
cur=insert(root->left,data);
root->left=cur;
}
else{
cur=insert(root->right,data);
root->right=cur;
}
}
return root;
}
int main(){
Node* root=NULL;
int T,data;
scanf("%d",&T);
while(T-->0){
scanf("%d",&data);
root=insert(root,data);
}
int height=getHeight(root);
printf("%d",height);
return 0;
}Java
java
import java.util.*;
import java.io.*;
class Node{
Node left,right;
int data;
Node(int data){
this.data=data;
left=right=null;
}
}
class Solution{
public static int getHeight(Node root){
if(root==null) return -1;
return 1+Math.max(getHeight(root.left),getHeight(root.right));
}
public static Node insert(Node root,int data){
if(root==null){
return new Node(data);
}
else{
Node cur;
if(data<=root.data){
cur=insert(root.left,data);
root.left=cur;
}
else{
cur=insert(root.right,data);
root.right=cur;
}
return root;
}
}
public static void main(String args[]){
Scanner sc=new Scanner(System.in);
int T=sc.nextInt();
Node root=null;
while(T-->0){
int data=sc.nextInt();
root=insert(root,data);
}
int height=getHeight(root);
System.out.println(height);
}
}Javascript
javascript
// Start of function Node
function Node(data) {
this.data = data;
this.left = null;
this.right = null;
} // End of function Node
// Start of function BinarySearchTree
function BinarySearchTree() {
this.insert = function (root, data) {
if (root === null) {
this.root = new Node(data);
return this.root;
}
if (data <= root.data) {
if (root.left) {
this.insert(root.left, data);
} else {
root.left = new Node(data);
}
} else {
if (root.right) {
this.insert(root.right, data);
} else {
root.right = new Node(data);
}
}
return this.root;
};
// Start of function getHeight
this.getHeight = function (root) {
if (root == null) return -1;
return 1 + Math.max(this.getHeight(root.left), this.getHeight(root.right));
}; // End of function getHeight
} // End of function BinarySearchTree
process.stdin.resume();
process.stdin.setEncoding("ascii");
var _input = "";
process.stdin.on("data", function (data) {
_input += data;
});
process.stdin.on("end", function () {
var tree = new BinarySearchTree();
var root = null;
var values = _input.split("\n").map(Number);
for (var i = 1; i < values.length; i++) {
root = tree.insert(root, values[i]);
}
console.log(tree.getHeight(root));
});Python
python
class Node:
def __init__(self,data):
self.right=self.left=None
self.data = data
class Solution:
def insert(self,root,data):
if root==None:
return Node(data)
else:
if data<=root.data:
cur=self.insert(root.left,data)
root.left=cur
else:
cur=self.insert(root.right,data)
root.right=cur
return root
def getHeight(self,root):
if root==None: return -1;
return 1+max(self.getHeight(root.left),self.getHeight(root.right));
T=int(input())
myTree=Solution()
root=None
for i in range(T):
data=int(input())
root=myTree.insert(root,data)
height=myTree.getHeight(root)
print(height)Day 23 BST Level-Order Traversal
CPP
cpp
#include <iostream>
#include <cstddef>
#include <queue>
#include <string>
#include <cstdlib>
using namespace std;
class Node{
public:
int data;
Node *left,*right;
Node(int d){
data=d;
left=right=NULL;
}
};
class Solution{
public:
Node* insert(Node* root, int data){
if(root==NULL){
return new Node(data);
}
else{
Node* cur;
if(data<=root->data){
cur=insert(root->left,data);
root->left=cur;
}
else{
cur=insert(root->right,data);
root->right=cur;
}
return root;
}
}
void levelOrder(Node * root){
if (root == NULL) return;
queue<Node *> q;
q.push(root);
while (!q.empty())
{
Node *node = q.front();
cout << node->data << " ";
q.pop();
if (node->left != NULL) q.push(node->left);
if (node->right != NULL) q.push(node->right);
}
}
};//End of Solution
int main(){
Solution myTree;
Node* root=NULL;
int T,data;
cin>>T;
while(T-->0){
cin>>data;
root= myTree.insert(root,data);
}
myTree.levelOrder(root);
return 0;
}C
c
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
typedef struct Node{
struct Node* left;
struct Node* right;
int data;
}Node;
Node* newNode(int data){
Node* node=(Node*)malloc(sizeof(Node));
node->left=node->right=NULL;
node->data=data;
return node;
}
#define max(x, y) (((x) > (y)) ? (x) : (y))
int getHeight(Node* root){
if(root==NULL) return 0;
return 1+max(getHeight(root->left),getHeight(root->right));
}
void print(struct Node* root, int level){
if (root == NULL) return;
if (level == 1) {printf("%d ", root->data); return;}
print(root->left, level-1);
print(root->right, level-1);
}
void levelOrder( struct Node *root)
{
int h = getHeight(root);
for (int i=1; i<=h; i++) print(root, i);
}
Node* insert(Node* root,int data){
if(root==NULL)
return newNode(data);
else{
Node* cur;
if(data<=root->data){
cur=insert(root->left,data);
root->left=cur;
}
else{
cur=insert(root->right,data);
root->right=cur;
}
}
return root;
}
int main(){
Node* root=NULL;
int T,data;
scanf("%d",&T);
while(T-->0){
scanf("%d",&data);
root=insert(root,data);
}
levelOrder(root);
return 0;
}Java
java
import java.io.*;
import java.util.*;
class Node{
Node left,right;
int data;
Node(int data){
this.data=data;
left=right=null;
}
}
class Solution{
static void levelOrder(Node root){
if (root == null) return;
Queue<Node> q = new LinkedList<>();
q.add(root);
while (!q.isEmpty()) {
Node curr = q.remove();
System.out.print(curr.data + " ");
if (curr.left != null) q.add(curr.left);
if (curr.right != null) q.add(curr.right);
}
}
public static Node insert(Node root,int data){
if(root==null){
return new Node(data);
}
else{
Node cur;
if(data<=root.data){
cur=insert(root.left,data);
root.left=cur;
}
else{
cur=insert(root.right,data);
root.right=cur;
}
return root;
}
}
public static void main(String args[]){
Scanner sc=new Scanner(System.in);
int T=sc.nextInt();
Node root=null;
while(T-->0){
int data=sc.nextInt();
root=insert(root,data);
}
levelOrder(root);
}
}Javascript
javascript
// Start of function Node
function Node(data) {
this.data = data;
this.left = null;
this.right = null;
} // End of function Node
// Start of function BinarySearchTree
function BinarySearchTree() {
this.insert = function (root, data) {
if (root === null) {
this.root = new Node(data);
return this.root;
}
if (data <= root.data) {
if (root.left) {
this.insert(root.left, data);
} else {
root.left = new Node(data);
}
} else {
if (root.right) {
this.insert(root.right, data);
} else {
root.right = new Node(data);
}
}
return this.root;
};
// Start of function levelOrder
this.levelOrder = function (root) {
if (this.root == null) return;
let q = [root];
while (q.length > 0) {
let node = q.shift();
process.stdout.write(node.data + " ");
if (node.left) q.push(node.left);
if (node.right) q.push(node.right);
}
}; // End of function levelOrder
} // End of function BinarySearchTree
process.stdin.resume();
process.stdin.setEncoding("ascii");
var _input = "";
process.stdin.on("data", function (data) {
_input += data;
});
process.stdin.on("end", function () {
var tree = new BinarySearchTree();
var root = null;
var values = _input.split("\n").map(Number);
for (var i = 1; i < values.length; i++) {
root = tree.insert(root, values[i]);
}
tree.levelOrder(root);
});Python
python
import sys
class Node:
def __init__(self,data):
self.right=self.left=None
self.data = data
class Solution:
def insert(self,root,data):
if root==None:
return Node(data)
else:
if data<=root.data:
cur=self.insert(root.left,data)
root.left=cur
else:
cur=self.insert(root.right,data)
root.right=cur
return root
def levelOrder(self,root):
from collections import deque
if root is None: return
q = deque()
q.append(root)
while q:
node = q.popleft()
print(node.data, end=" ")
if node.left is not None: q.append(node.left)
if node.right is not None: q.append(node.right)
T=int(input())
myTree=Solution()
root=None
for i in range(T):
data=int(input())
root=myTree.insert(root,data)
myTree.levelOrder(root)Day 24 More Linked Lists
CPP
cpp
#include <cstddef>
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
class Node
{
public:
int data;
Node *next;
Node(int d){
data=d;
next=NULL;
}
};
class Solution{
public:
Node* removeDuplicates(Node *head){
if (head == NULL || head->next == NULL) return head;
Node *curr = head;
while (curr->next != NULL )
if (curr->data == curr->next->data) curr->next = curr->next->next;
else curr = curr->next;
return head;
}
Node* insert(Node *head,int data)
{
Node* p=new Node(data);
if(head==NULL){
head=p;
}
else if(head->next==NULL){
head->next=p;
}
else{
Node *start=head;
while(start->next!=NULL){
start=start->next;
}
start->next=p;
}
return head;
}
void display(Node *head)
{
Node *start=head;
while(start)
{
cout<<start->data<<" ";
start=start->next;
}
}
};
int main()
{
Node* head=NULL;
Solution mylist;
int T,data;
cin>>T;
while(T-->0){
cin>>data;
head=mylist.insert(head,data);
}
head=mylist.removeDuplicates(head);
mylist.display(head);
}C
c
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
typedef struct Node
{
int data;
struct Node* next;
}Node;
Node* removeDuplicates(Node *head){
if (head == NULL || head->next == NULL) return head;
Node *curr = head;
while (curr->next != NULL )
if (curr->data == curr->next->data) curr->next = curr->next->next;
else curr = curr->next;
return head;
}
Node* insert(Node *head,int data)
{
Node *p = (Node*)malloc(sizeof(Node));
p->data = data;
p->next=NULL;
if(head==NULL){
head=p;
}
else if(head->next==NULL)
{
head->next=p;
}
else{
Node *start=head;
while(start->next!=NULL)
start=start->next;
start->next=p;
}
return head;
}
void display(Node *head)
{
Node *start=head;
while(start)
{
printf("%d ",start->data);
start=start->next;
}
}
int main()
{
int T,data;
scanf("%d",&T);
Node *head=NULL;
while(T-->0){
scanf("%d",&data);
head=insert(head,data);
}
head=removeDuplicates(head);
display(head);
}Java
java
import java.io.*;
import java.util.*;
class Node{
int data;
Node next;
Node(int d){
data=d;
next=null;
}
}
class Solution
{
public static Node removeDuplicates(Node head) {
if (head == null || head.next == null) return head;
Node curr = head;
while (curr.next != null )
if (curr.data == curr.next.data) curr.next = curr.next.next;
else curr = curr.next;
return head;
}
public static Node insert(Node head,int data)
{
Node p=new Node(data);
if(head==null)
head=p;
else if(head.next==null)
head.next=p;
else
{
Node start=head;
while(start.next!=null)
start=start.next;
start.next=p;
}
return head;
}
public static void display(Node head)
{
Node start=head;
while(start!=null)
{
System.out.print(start.data+" ");
start=start.next;
}
}
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
Node head=null;
int T=sc.nextInt();
while(T-->0){
int ele=sc.nextInt();
head=insert(head,ele);
}
head=removeDuplicates(head);
display(head);
}
}Javascript
javascript
process.stdin.resume();
process.stdin.setEncoding("ascii");
var input_stdin = "";
var input_stdin_array = "";
var input_currentline = 0;
process.stdin.on("data", function (data) {
input_stdin += data;
});
process.stdin.on("end", function () {
input_stdin_array = input_stdin.split("\n");
main();
});
function readLine() {
return input_stdin_array[input_currentline++];
}
function Node(data) {
this.data = data;
this.next = null;
}
function Solution() {
this.removeDuplicates = function (head) {
if (head == null || head.next == null) return head;
var curr = head;
while (curr.next != null) {
if (curr.data == curr.next.data) curr.next = curr.next.next;
else curr = curr.next;
}
return head;
};
this.insert = function (head, data) {
var p = new Node(data);
if (head == null) {
head = p;
} else if (head.next == null) {
head.next = p;
} else {
var start = head;
while (start.next != null) {
start = start.next;
}
start.next = p;
}
return head;
};
this.display = function (head) {
var start = head;
while (start) {
process.stdout.write(start.data + " ");
start = start.next;
}
};
}
function main() {
var T = parseInt(readLine());
var head = null;
var mylist = new Solution();
for (i = 0; i < T; i++) {
var data = parseInt(readLine());
head = mylist.insert(head, data);
}
head = mylist.removeDuplicates(head);
mylist.display(head);
}Python
python
class Node:
def __init__(self,data):
self.data = data
self.next = None
class Solution:
def insert(self,head,data):
p = Node(data)
if head==None:
head=p
elif head.next==None:
head.next=p
else:
start=head
while(start.next!=None):
start=start.next
start.next=p
return head
def display(self,head):
current = head
while current:
print(current.data,end=' ')
current = current.next
def removeDuplicates(self,head):
if not head or not head.next : return head
current = head
while current.next:
if current.data == current.next.data: current.next = current.next.next
else: current = current.next
return head
mylist= Solution()
T=int(input())
head=None
for i in range(T):
data=int(input())
head=mylist.insert(head,data)
head=mylist.removeDuplicates(head)
mylist.display(head);Day 25 Running Time and Complexity
CPP
cpp
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
bool ifPrime(int number){
if (number == 1) return false;
for (int i=2; i*i <= number; i++) if (number % i == 0) return false;
return true;
}
int main() {
int n, num;
cin >> n;
while(n--){
cin >> num;
if (ifPrime(num)) cout << "Prime\n";
else cout << "Not prime\n";
}
return 0;
}C
c
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <stdbool.h>
bool ifPrime(int number){
if (number == 1) return false;
for (int i=2; i*i <= number; i++) if (number % i == 0) return false;
return true;
}
int main() {
int n, num;
scanf("%d", &n);
while(n--){
scanf("%d", &num);
if (ifPrime(num)) printf("Prime\n");
else printf("Not prime\n");
}
return 0;
}
Java
java
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static boolean ifPrime(int number){
if (number == 1) return false;
for (int i=2; i*i <= number; i++) if (number % i == 0) return false;
return true;
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
while(n-->0){
int num = scan.nextInt();
if (ifPrime(num)) System.out.printf("Prime\n");
else System.out.printf("Not prime\n");
}
scan.close();
}
}Javascript
javascript
function ifPrime(number) {
if (number == 1) return false;
for (let i = 2; i * i <= number; i++) if (number % i == 0) return false;
return true;
}
function processData(input) {
let n = input.split("\n");
for (let t = 1; t < n.length; t++) {
if (ifPrime(n[t])) console.log("Prime");
else console.log("Not prime");
}
}
process.stdin.resume();
process.stdin.setEncoding("ascii");
_input = "";
process.stdin.on("data", function (input) {
_input += input;
});
process.stdin.on("end", function () {
processData(_input);
});Python
python
import math
def ifPrime(number):
if number == 1: return False
for i in range(2, int(math.sqrt(number)) + 1):
if number % i == 0: return False
return True
for _ in range(int(input())):
if ifPrime(int(input())): print("Prime")
else: print("Not prime")Day 26 Nested Logic
CPP
cpp
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int d1,d2,m1,m2,y1,y2,ans = 0;
cin >> d1 >> m1 >> y1 >> d2 >> m2 >> y2;
if (y1 > y2) ans = 10000;
else if (y1 == y2) {
if (m1 > m2) ans = 500 * (m1 - m2);
else if (m1 == m2 &&d1 > d2) ans = 15 * (d1 - d2);
}
cout << ans << endl;
return 0;
}C
c
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main() {
int d1,d2,m1,m2,y1,y2,ans = 0;
scanf("%d%d%d%d%d%d", &d1, &m1, &y1, &d2, &m2, &y2);
if (y1 > y2) ans = 10000;
else if (y1 == y2) {
if (m1 > m2) ans = 500 * (m1 - m2);
else if (m1 == m2 &&d1 > d2) ans = 15 * (d1 - d2);
}
printf("%d", ans);
return 0;
}Java
java
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int d1 = scan.nextInt();
int m1 = scan.nextInt();
int y1 = scan.nextInt();
int d2 = scan.nextInt();
int m2 = scan.nextInt();
int y2 = scan.nextInt();
int ans = 0;
if (y1 > y2) ans = 10000;
else if (y1 == y2) {
if (m1 > m2) ans = 500 * (m1 - m2);
else if (m1 == m2 &&d1 > d2) ans = 15 * (d1 - d2);
}
System.out.println(ans);
scan.close();
}
}Javascript
javascript
function processData(input) {
let data = input.split("\n");
let ret = data[0].split(" ");
let due = data[1].split(" ");
let ans = 0;
if (ret[2] > due[2]) ans = 10000;
else if (ret[2] == due[2]) {
if (ret[1] > due[1]) ans = 500 * (ret[1] - due[1]);
else if (ret[1] == due[1] && ret[0] > due[0]) ans = 15 * (ret[0] - due[0]);
}
console.log(ans);
}
process.stdin.resume();
process.stdin.setEncoding("ascii");
_input = "";
process.stdin.on("data", function (input) {
_input += input;
});
process.stdin.on("end", function () {
processData(_input);
});Python
python
(d1, m1, y1) = [int(x.strip()) for x in input().split()]
(d2, m2, y2) = [int(x.strip()) for x in input().split()]
ans = 0
if y1 > y2: ans = 10000
elif y1 == y2:
if m1 > m2: ans = 500 * (m1 - m2)
elif m1 == m2 and d1 > d2: ans = 15 * (d1 - d2)
print(ans)Day 27 Testing
CPP
cpp
#include <algorithm>
#include <iostream>
#include <stdexcept>
#include <vector>
#include <cassert>
#include <set>
using namespace std;
int minimum_index(vector<int> seq) {
if (seq.empty()) {
throw invalid_argument("Cannot get the minimum value index from an empty sequence");
}
int min_idx = 0;
for (int i = 1; i < seq.size(); ++i) {
if (seq[i] < seq[min_idx]) {
min_idx = i;
}
}
return min_idx;
}
class TestDataEmptyArray {
public:
static vector<int> get_array() {
vector<int> vec{};
return vec;
}
};
class TestDataUniqueValues {
public:
static vector<int> get_array() {
vector<int> vec{ 2,1 };
return vec;
}
static int get_expected_result(){ return 1; }
};
class TestDataExactlyTwoDifferentMinimums {
public:
static vector<int> get_array() {
vector<int> vec{ 2,1,1 };
return vec;
}
static int get_expected_result(){ return 1; }
};
void TestWithEmptyArray() {
try {
auto seq = TestDataEmptyArray::get_array();
auto result = minimum_index(seq);
} catch (invalid_argument& e) {
return;
}
assert(false);
}
void TestWithUniqueValues() {
auto seq = TestDataUniqueValues::get_array();
assert(seq.size() >= 2);
assert(set<int>(seq.begin(), seq.end()).size() == seq.size());
auto expected_result = TestDataUniqueValues::get_expected_result();
auto result = minimum_index(seq);
assert(result == expected_result);
}
void TestWithExactlyTwoDifferentMinimums() {
auto seq = TestDataExactlyTwoDifferentMinimums::get_array();
assert(seq.size() >= 2);
auto tmp = seq;
sort(tmp.begin(), tmp.end());
assert(tmp[0] == tmp[1] and (tmp.size() == 2 or tmp[1] < tmp[2]));
auto expected_result = TestDataExactlyTwoDifferentMinimums::get_expected_result();
auto result = minimum_index(seq);
assert(result == expected_result);
}
int main() {
TestWithEmptyArray();
TestWithUniqueValues();
TestWithExactlyTwoDifferentMinimums();
cout << "OK" << endl;
return 0;
}Java
java
import java.util.*;
public class Solution {
public static int minimum_index(int[] seq) {
if (seq.length == 0) {
throw new IllegalArgumentException("Cannot get the minimum value index from an empty sequence");
}
int min_idx = 0;
for (int i = 1; i < seq.length; ++i) {
if (seq[i] < seq[min_idx]) {
min_idx = i;
}
}
return min_idx;
}
static class TestDataEmptyArray {
public static int[] get_array() {
return new int[]{};
}
}
static class TestDataUniqueValues {
public static int[] get_array() {
return new int[]{2,1};
}
public static int get_expected_result() {
return 1;
}
}
static class TestDataExactlyTwoDifferentMinimums {
public static int[] get_array() {
return new int[]{2,1,1};
}
public static int get_expected_result() {
return 1;
}
}
public static void TestWithEmptyArray() {
try {
int[] seq = TestDataEmptyArray.get_array();
int result = minimum_index(seq);
} catch (IllegalArgumentException e) {
return;
}
throw new AssertionError("Exception wasn't thrown as expected");
}
public static void TestWithUniqueValues() {
int[] seq = TestDataUniqueValues.get_array();
if (seq.length < 2) {
throw new AssertionError("less than 2 elements in the array");
}
Integer[] tmp = new Integer[seq.length];
for (int i = 0; i < seq.length; ++i) {
tmp[i] = Integer.valueOf(seq[i]);
}
if (!((new LinkedHashSet<Integer>(Arrays.asList(tmp))).size() == seq.length)) {
throw new AssertionError("not all values are unique");
}
int expected_result = TestDataUniqueValues.get_expected_result();
int result = minimum_index(seq);
if (result != expected_result) {
throw new AssertionError("result is different than the expected result");
}
}
public static void TestWithExactlyTwoDifferentMinimums() {
int[] seq = TestDataExactlyTwoDifferentMinimums.get_array();
if (seq.length < 2) {
throw new AssertionError("less than 2 elements in the array");
}
int[] tmp = seq.clone();
Arrays.sort(tmp);
if (!(tmp[0] == tmp[1] && (tmp.length == 2 || tmp[1] < tmp[2]))) {
throw new AssertionError("there are not exactly two minimums in the array");
}
int expected_result = TestDataExactlyTwoDifferentMinimums.get_expected_result();
int result = minimum_index(seq);
if (result != expected_result) {
throw new AssertionError("result is different than the expected result");
}
}
public static void main(String[] args) {
TestWithEmptyArray();
TestWithUniqueValues();
TestWithExactlyTwoDifferentMinimums();
System.out.println("OK");
}
}Python
python
def minimum_index(seq):
if len(seq) == 0:
raise ValueError("Cannot get the minimum value index from an empty sequence")
min_idx = 0
for i in range(1, len(seq)):
if seq[i] < seq[min_idx]:
min_idx = i
return min_idx
class TestDataEmptyArray():
@staticmethod
def get_array():
return []
class TestDataUniqueValues():
@staticmethod
def get_array():
return [2,1]
@staticmethod
def get_expected_result():
return 1
class TestDataExactlyTwoDifferentMinimums():
@staticmethod
def get_array():
return [2,1,1]
@staticmethod
def get_expected_result():
return 1
def TestWithEmptyArray():
try:
seq = TestDataEmptyArray.get_array()
result = minimum_index(seq)
except ValueError as e:
pass
else:
assert False
def TestWithUniqueValues():
seq = TestDataUniqueValues.get_array()
assert len(seq) >= 2
assert len(list(set(seq))) == len(seq)
expected_result = TestDataUniqueValues.get_expected_result()
result = minimum_index(seq)
assert result == expected_result
def TestiWithExactyTwoDifferentMinimums():
seq = TestDataExactlyTwoDifferentMinimums.get_array()
assert len(seq) >= 2
tmp = sorted(seq)
assert tmp[0] == tmp[1] and (len(tmp) == 2 or tmp[1] < tmp[2])
expected_result = TestDataExactlyTwoDifferentMinimums.get_expected_result()
result = minimum_index(seq)
assert result == expected_result
TestWithEmptyArray()
TestWithUniqueValues()
TestiWithExactyTwoDifferentMinimums()
print("OK")
Day 28 RegEx, Patterns, and Intro to Databases
CPP
cpp
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
string email,name;
vector<string> list;
while(N--) {
cin >> name >> email;
if(regex_match(email, regex("(.*)@gmail.com")))
list.push_back(name);
}
sort(list.begin(), list.end());
for(auto& user : list) cout << user << endl;
return 0;
}C
c
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
int cmp(const void *a, const void *b) {
const char *s1 = *(const char **)a, *s2 = *(const char **)b;
return strcmp(s1, s2);
}
int main(){
int n, size = 0;
scanf("%d",&n);
char *list[30];
for(int i = 0; i < n; i++){
char* name = (char *)malloc(20 * sizeof(char));
char* email = (char *)malloc(50 * sizeof(char));
scanf("%s %s",name,email);
if(strcmp((email+strlen(email)-10), "@gmail.com") == 0) list[size++] = name;
}
qsort(list, size, sizeof(char *), cmp);
for (int i=0;i!=size;++i) printf("%s\n", list[i]);
return 0;
}Java
java
import java.io.*;
import java.util.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int N = in.nextInt();
String regexPattern = "@gmail.com";
Pattern p = Pattern.compile(regexPattern);
List<String> list = new ArrayList<String>();
for(int i = 0; i < N; i++){
String firstName = in.next();
Matcher m = p.matcher(in.next());
if (m.find()) list.add(firstName);
}
in.close();
Collections.sort(list);
for (String user : list) {
System.out.println(user);
}
}
}Javascript
javascript
"use strict";
process.stdin.resume();
process.stdin.setEncoding("utf-8");
let inputString = "";
let currentLine = 0;
process.stdin.on("data", function (inputStdin) {
inputString += inputStdin;
});
process.stdin.on("end", function () {
inputString = inputString.split("\n");
main();
});
function readLine() {
return inputString[currentLine++];
}
function main() {
let N = parseInt(readLine());
let patt = new RegExp("@gmail.com");
let list = [];
for (let i = 0; i < N; i++) {
let input = readLine().split(" ");
let name = input[0];
let email = input[1];
if (patt.test(email)) list.push(name);
}
list.sort().forEach(function (name) {
console.log(name);
});
}Python
python
#!/bin/python3
import sys
import re
list = []
pattern = re.compile('@gmail.com$')
for _ in range(int(input())):
name,email = input().strip().split(' ')
if pattern.search(email): list.append(name)
list.sort()
for user in list:
print(user)Day 29 Bitwise AND
CPP
cpp
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
int n, k;
while(t--)
{
cin >> n >> k;
vector<int> vec;
int ans = 0;
for(int i = 1; i <= n; i++) vec.push_back(i);
for(int a = 0; a < n; a++){
for(int b = a + 1; b < n; b++){
int ab = vec[a] & vec[b];
if(ab > ans && ab < k) ans = ab;
}
}
cout << ans << endl;
}
return 0;
}C
c
#include <assert.h>
#include <ctype.h>
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
char* readline();
char* ltrim(char*);
char* rtrim(char*);
char** split_string(char*);
int parse_int(char*);
int bitwiseAnd(int n, int k) {
int arr[1000];
int ans = 0;
for(int i = 0; i < n; i++) arr[i] = i+1;
for(int a = 0; a < n; a++){
for(int b = a + 1; b < n; b++){
int ab = (arr[a] & arr[b]);
if(ab > ans && ab < k) ans = ab;
}
}
return ans;
}
int main()
{
FILE* fptr = fopen(getenv("OUTPUT_PATH"), "w");
int t = parse_int(ltrim(rtrim(readline())));
for (int t_itr = 0; t_itr < t; t_itr++) {
char** first_multiple_input = split_string(rtrim(readline()));
int count = parse_int(*(first_multiple_input + 0));
int lim = parse_int(*(first_multiple_input + 1));
int res = bitwiseAnd(count, lim);
fprintf(fptr, "%d\n", res);
}
fclose(fptr);
return 0;
}
char* readline() {
size_t alloc_length = 1024;
size_t data_length = 0;
char* data = malloc(alloc_length);
while (true) {
char* cursor = data + data_length;
char* line = fgets(cursor, alloc_length - data_length, stdin);
if (!line) {
break;
}
data_length += strlen(cursor);
if (data_length < alloc_length - 1 || data[data_length - 1] == '\n') {
break;
}
alloc_length <<= 1;
data = realloc(data, alloc_length);
if (!data) {
data = ' ';
break;
}
}
if (data[data_length - 1] == '\n') {
data[data_length - 1] = ' ';
data = realloc(data, data_length);
if (!data) {
data = ' ';
}
} else {
data = realloc(data, data_length + 1);
if (!data) {
data = ' ';
} else {
data[data_length] = ' ';
}
}
return data;
}
char* ltrim(char* str) {
if (!str) {
return ' ';
}
if (!*str) {
return str;
}
while (*str != ' ' && isspace(*str)) {
str++;
}
return str;
}
char* rtrim(char* str) {
if (!str) {
return ' ';
}
if (!*str) {
return str;
}
char* end = str + strlen(str) - 1;
while (end >= str && isspace(*end)) {
end--;
}
*(end + 1) = ' ';
return str;
}
char** split_string(char* str) {
char** splits = NULL;
char* token = strtok(str, " ");
int spaces = 0;
while (token) {
splits = realloc(splits, sizeof(char*) * ++spaces);
if (!splits) {
return splits;
}
splits[spaces - 1] = token;
token = strtok(NULL, " ");
}
return splits;
}
int parse_int(char* str) {
char* endptr;
int value = strtol(str, &endptr, 10);
if (endptr == str || *endptr != ' ') {
exit(EXIT_FAILURE);
}
return value;
}Java
java
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
class Result {
public static int bitwiseAnd(int N, int K) {
if ((K | (K - 1)) > N ) return (K - 2);
return K - 1;
}
}
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int t = Integer.parseInt(bufferedReader.readLine().trim());
for (int tItr = 0; tItr < t; tItr++) {
String[] firstMultipleInput = bufferedReader.readLine().replaceAll("\s+$", "").split(" ");
int count = Integer.parseInt(firstMultipleInput[0]);
int lim = Integer.parseInt(firstMultipleInput[1]);
int res = Result.bitwiseAnd(count, lim);
bufferedWriter.write(String.valueOf(res));
bufferedWriter.newLine();
}
bufferedReader.close();
bufferedWriter.close();
}
}Javascript
javascript
"use strict";
const fs = require("fs");
process.stdin.resume();
process.stdin.setEncoding("utf-8");
let inputString = "";
let currentLine = 0;
process.stdin.on("data", function (inputStdin) {
inputString += inputStdin;
});
process.stdin.on("end", function () {
inputString = inputString.split("\n");
main();
});
function readLine() {
return inputString[currentLine++];
}
function bitwiseAnd(N, K) {
if ((K | (K - 1)) > N) return K - 2;
return K - 1;
}
function main() {
const ws = fs.createWriteStream(process.env.OUTPUT_PATH);
const t = parseInt(readLine().trim(), 10);
for (let tItr = 0; tItr < t; tItr++) {
const firstMultipleInput = readLine().replace(/s+$/g, "").split(" ");
const count = parseInt(firstMultipleInput[0], 10);
const lim = parseInt(firstMultipleInput[1], 10);
const res = bitwiseAnd(count, lim);
ws.write(res + "\n");
}
ws.end();
}Python
python
for i in range(int(input())):
n, k = [int(x) for x in input().split()]
if (k | (k - 1)) > n: print(k - 2)
else: print(k - 1)This post is licensed under
CC BY 4.0 Edit this page | Report an issue