codyhex

//* The Ros object, wrapping a web socket connection to rosbridge.
var ros = new ROSLIB.Ros({
  url: 'ws://localhost:9090' // url to your rosbridge server
});

//* A topic for messaging.
var exampleTopic = new ROSLIB.Topic({
  ros: ros,
  name: '/com/endpoint/example', // use a sensible namespace
  messageType: 'std_msgs/String'

codyhex

package com.example;

import java.io.IOException;
import java.util.Arrays;

class MyTestClass
{

    public static void main(String[] args){
        byte[] bytes = new byte[30];

codyhex

import java.io.IOException;
import java.util.Arrays;

public class InputStreamExample {

	public static void main(String[] args){
		byte[] bytes = new byte[30];

		try {	
			System.out.println("Available bytes :"+System.in.available());

codyhex

# Use 0xFF to AND output the only 8bits for a char.
if cv2.waitKey(0) & 0xFF == ord('q'):
    break

codyhex

// https://www.hackerrank.com/challenges/30-binary-numbers/problem

using namespace std;

int main(){
    int n;
    cin >> n;
    
    int count = 0;
    int old = 0;

codyhex

#!/bin/python3

import sys

if __name__ == "__main__":
    n = int(input().strip())
    m = int(input().strip())
    for a0 in range(m):
        x, y, w = input().strip().split(' ')
        x, y, w = [int(x), int(y), int(w)]

codyhex

# Sample Input
# ( you dont need the count number for python)
# 1 2 3 4 10 11

number_of_elements = int(raw_input())
array = map(int, raw_input().split())
print sum(array)

codyhex

# a nice example where you can use zip to compose pair together to compute them

a_triplet = map(int, input().split())
b_triplet = map(int, input().split())
alice_points = 0
bob_points = 0
for a_val, b_val in zip(a_triplet, b_triplet):
    if a_val < b_val:
        bob_points += 1
    elif a_val > b_val:

codyhex

using namespace std;

int main() {
    int n;
    cin >> n;

    double pl = 0, mn = 0, zr = 0;

    for (int i = 0; i < n; i++) {
        int val;

codyhex

#include <iostream>
#include <climits>

struct TreeNode {
    int val;
    TreeNode* left;
    TreeNode* right;
    TreeNode(int x): val(x), left(nullptr), right(nullptr) {}
};