Kishy-nivas

#include<iostream>
using namespace std;
int main()
{
  int a, b;
  cout<<a+b;
}

Kishy-nivas

# Set project name
project (SampleProject)
# Define target name
set (TARGET_NAME SampleProject)

######################################

# Set CMake minimum version and CMake policy required by Urho3D-CMake-common module
if (WIN32)
    cmake_minimum_required (VERSION 3.2.3)      # Going forward all platforms will use this as minimum version

Kishy-nivas

# Solution to 'The Truth' on rubeque.com
# by mdyn
# http://rubeque.com/problems/the-truth

assert_equal true, true   

# Solution to 'Reverse' on rubeque.com
# by mdyn
# http://rubeque.com/problems/reverse

Kishy-nivas

#!/usr/bin/env ruby
#
# Ruby script to download a number of files
# from individual URLs via HTTP/HTTPS/FTP
# specified in an external file.
#
# Author: Tobias Preuss
# Revision: 2013-04-18 16:26 +0100 UTC
# License: Creative Commons Attribution-ShareAlike 3.0 Unported

Kishy-nivas

import java.io.*;
import java.util.*;
class Ex1 
{
  private String container; 
  private int a,b,temp;
  private int[] arr;
  Scanner sc;
  
  private void print_str (String val)

Kishy-nivas

package advancedjava;
import java.io.*;

/**
 *
 * @author Kishy Nivas 
 */

class Student implements Serializable 

Kishy-nivas

import com.mysql.jdbc.Driver;
import java.sql.*;
class Student{
  private String first_name ;
  private String last_name;
  private int m1,m2,m3;

  public Student(String f_name , String l_name , int m1,int m2,int m3){
    this.first_name = f_name;
    this.last_name = l_name;

Kishy-nivas

import javax.swing.*; 
import java.awt.*; 
import java.awt.event.*; 

class Student {
  private String username;
  private String pwd;
  private String cnfm_pwd;
  private int maths;
  private int chemistry; 

Kishy-nivas

package hello;
import javax.microedition.lcdui.*;
import javax.microedition.midlet.*; 
import java.io.*;

public class kkk extends MIDlet implements CommandListener
{
 private Form form;
 private Display display;
 private TextField input1, input2;

Kishy-nivas

public int continousOnes(int[] arr) {
  int count =0;
  int max = 0;
  for(int i : arr){
     if(i==1){
       count++;
      }
    else {
      max = Math.max(count,max);
      count =0;