Java End-of-file
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) {
/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
Scanner sc = new Scanner(System.in);
int i = 1;
while (sc.hasNext()) {
String a = sc.nextLine();
System.out.printf("%d ",i);
System.out.println(a);
i++;
}
}
}
Hi
ReplyDelete#include
ReplyDelete#include
void display(int arr[],int n)
{
for (int i = 0; i < n; i++)
{
printf("%d ",arr[i]);
}
}
void indinsert(int arr[],int n,int element,int index){
for (int i = n-1; i >= index; i--)
{
arr[i+1] = arr[i];
}
arr[index] = element;
}
void insertionSort(int *A, int n){
int key, j;
// Loop for passes
for (int i = 1; i <= n-1; i++)
{
key = A[i];
j = i-1;
// Loop for each pass
while(j>=0 && A[j] > key){
A[j+1] = A[j];
j--;
}
A[j+1] = key;
}
}
int main(){
int n = 4;
int element;
printf("Enter the element: ");
scanf("%d",&element);
int arr[] = {10,20,40,50};
// int element = 35,
int index = 2;
// display(arr[n],n);
// for (int i = 0; i < n; i++)
// {
// scanf("%d",&arr[i]);
// }
n++;
indinsert(arr,n,element,index);
insertionSort(arr,n);
display(arr,n);
}
import java.util.*;
ReplyDeleteclass Main {
public static void main(String[] args) {
// Scanner sc = new Scanner(System.in);
// int n = sc.nextInt();
for(int i=1;i <= 7;i++)
{
for(int j=i;j >1;j--){
System.out.print(j);
}
System.out.print(1);
for(int j=2;j<=i;j++){
System.out.print(j);
}
System.out.println();
}
for(int i = 6;i>=1;i--)
{
for(int j=i;j >1;j--){
System.out.print(j);
}
System.out.print(1);
for(int j=2;j<=i;j++){
System.out.print(j);
}
System.out.println();
}
}
}