class Wikitechy
{ 
	/* prints element and NGE pair for 
	all elements of arr[] of size n */
	static void printNGE(int arr[], int n) 
	{ 
		int n1, i, j; 
		for (i=0; i<n; i++) 
		{ 
			n1 = 0; 
			for (j = i+1; j<n; j++) 
			{ 
				if (arr[i] < arr[j]) 
				{ 
					n1 = arr[j]; 
					break; 
				} 
			} 
			System.out.println(arr[i]+" -- "+n1); 
		} 
	} 
	
	public static void main(String args[]) 
	{ 
		int arr[]= {30, 35, 11, 17, 2}; 
		int n = arr.length; 
		printNGE(arr, n);
        
	} 
}

import java.io.*;
class Wikitechy {
 public static void main(String[] args) {
  int val = 1, n = 4;
  for (int i = 1; i <= n; i++) 
  {
   for (int j = 0; j < i; j++) 
   {
    System.out.print(val + " ");
    val++;
   }
   System.out.println();
  }
 }
}

class wiki{
	public static void main (String[] args) {
	String str = "Welcome to wikitechy website. Wikitechy is the best website to learn technology."
String findStr = "wikitechy";
int lastIndex = 0;
int count = 0;

while(lastIndex != -1){

    lastIndex = str.indexOf(findStr,lastIndex);

    if(lastIndex != -1){
        count ++;
        lastIndex += findStr.length();
    }
}
System.out.println(count);
	}
}

public class Wiki
{ 
	public static void main(String[] args) 
	{ 
		int a[] = {2, 8, 3}; 

		// Copy elements of a[] to b[] 
		int b[] = a.clone(); 

		// Change b[] to verify that b[] is different 
		// from a[] 
	 

		System.out.println("Values of a[] "); 
		for (int i=0; i<a.length; i++) 
			System.out.print(a[i] + " "); 

		System.out.println("\n\nValues of b[] "); 
		for (int i=0; i<b.length; i++) 
			System.out.print(b[i] + " "); 
	} 
}

/ Given an array of numbers, program to arrange the numbers to form the 
// largest number 
#include <iostream> 
#include <string> 
#include <vector> 
#include <algorithm> 
using namespace std; 
  
// A comparison function which is used by sort() in printLargest() 
int myCompare(string X, string Y) 
{ 
    // first append Y at the end of X 
    string XY = X.append(Y); 
  
    // then append X at the end of Y 
    string YX = Y.append(X); 
  
    // Now see which of the two formed numbers is greater 
    return XY.compare(YX) > 0 ? 1: 0; 
} 
  
// The main function that prints the arrangement with the largest value. 
// The function accepts a vector of strings 
void printLargest(vector<string> arr) 
{ 
    sort(arr.begin(), arr.end(), myCompare); 
  
    for (int i=0; i < arr.size() ; i++ ) 
        cout << arr[i]; 
} 
  
// driver program to test above functions 
int main() 
{ 
    vector<string> arr; 
  
    //output should be 5545727825 
	arr.push_back("25"); 
	arr.push_back("457"); 
	arr.push_back("278"); 
	arr.push_back("55"); 
	printLargest(arr); 
  
  
   return 0; 
}