Merge pull request #671 from simranquirky/master

Codechef Dsa series solutions added

Author: Saviour1001

Codechef Problems/DSA Learning Series/Alternative Square Pattern.java

@@ -0,0 +1,64 @@
+/* You're given a number N. Print the first N lines of the below-given pattern.
+
+1 2 3 4 5
+10 9 8 7 6
+11 12 13 14 15
+20 19 18 17 16
+21 22 23 24 25
+30 29 28 27 26
+Input:
+First-line will contain the number N.
+Output:
+Print the first N lines of the given pattern.
+
+Constraints
+1≤N≤200
+Sample Input 1:
+4
+Sample Output 1:
+1 2 3 4 5
+10 9 8 7 6
+11 12 13 14 15
+20 19 18 17 16
+Sample Input 2:
+2
+Sample Output 2:
+1 2 3 4 5
+10 9 8 7 6
+EXPLANATION:
+In the first example, we'll print the first 4 lines of the given pattern.
+In the second example, we'll print the first 2 lines of the given pattern. */
+
+import java.util.*;
+import java.lang.*;
+import java.io.*;
+
+/* Name of the class has to be "Main" only if the class is public. */
+class Codechef
+{
+	public static void main (String[] args) throws java.lang.Exception
+	{
+		Scanner sc= new Scanner(System.in);
+		int n= sc.nextInt();
+		for (int i=1; i<=n; i++)
+		{
+		    if(i%2!=0)
+		    {
+		        for(int j=(5*(i-1)+1);j<=(5*i);j++)
+		        {
+		            System.out.print(j+" ");
+		        }
+		         System.out.println();
+		    }
+		    else{
+		        for(int j=(5*i);j>=(5*(i-1)+1);j--)
+		    {
+		            System.out.print(j+" ");
+		    }
+		     System.out.println();
+		    }
+		   
+		    
+		}
+	}
+}

Codechef Problems/DSA Learning Series/Buy Please.c

@@ -0,0 +1,36 @@
+/* Chef went to a shop and buys a pens and b pencils. Each pen costs x units and each pencil costs y units. Now find what is the total amount Chef will spend to buy a pens and b pencils.
+
+Input:
+First-line will contain 4 space separated integers a, b, x and y respectively.
+Output:
+Print the answer in a new line.
+
+Constraints
+1≤a,b,x,y≤103
+Sample Input 1:
+2 4 4 5
+Sample Output 1:
+28
+Sample Input 2:
+1 1 4 8
+Sample Output 2:
+12
+EXPLANATION:
+In the first example, total cost is (2 * 4 + 4 * 5) = 28.
+In the second example, total cost is (1 * 4 + 1 * 8) = 12.  */
+
+
+#include <stdio.h>
+
+int main(void) {
+	
+	int a,b,x,y;
+	scanf("%d %d %d %d",&a,&b,&x,&y);
+	int pen_cost= a*x;
+	int pencil_cost=b*y;
+	int total=pen_cost+pencil_cost;
+	printf("%d",total);
+	
+	return 0;
+	
+}

Codechef Problems/DSA Learning Series/Factors Finding.c

@@ -0,0 +1,48 @@
+/* You are given a number N and find all the distinct factors of N.
+
+Input:
+First-line will contain the number N.
+Output:
+In the first line print number of distinct factors of N.
+In the second line print all distinct factors in ascending order separated by space.
+Constraints
+1≤N≤106
+Sample Input 1:
+4
+Sample Output 1:
+3
+1 2 4
+Sample Input 2:
+6
+Sample Output 2:
+4
+1 2 3 6
+EXPLANATION:
+In the first example, all factors of 4 are 1, 2, 4.
+In the second example, all factors of 6 are 1, 2, 3, 6. */
+
+#include <stdio.h>
+
+int main(void) {
+	
+	int n;
+	scanf("%d",&n);
+	int c=0;
+	int a[n];
+	
+	for(int i=1;i<=n;i++)
+	{
+	    if(n%i==0)
+	    {
+	        a[c]=i;
+	        c++;
+	    }
+	}
+	printf("%d \n",c);
+		for(int i=0;i<c;i++)
+		{
+		    printf("%d ",a[i]);
+		}
+	
+	return 0;
+}

Codechef Problems/DSA Learning Series/Find Second Largest.c

@@ -0,0 +1,49 @@
+/* Given three distinct integers A, B and C, print the second largest number among them.
+
+Input:
+The input consists of three lines.
+The first line contains a single integer A.
+The second line contains a single integer B.
+The third line contains a single integer C.
+Output:
+Print the second largest number among A, B and C, in a separate line.
+
+Constraints
+1≤A,B,C≤109
+Sample Input 1:
+2
+7
+21
+Sample Output 1:
+7
+Sample Input 2:
+14
+28
+16
+Sample Output 2:
+16
+EXPLANATION:
+In the first example, 7 is the second largest number among the given three numbers.
+In the second example, 16 is the second largest number among the given three numbers. */
+
+#include <stdio.h>
+
+int main(void) {
+	
+	int n1,n2,n3;
+	scanf("%d\n%d\n%d",&n1,&n2,&n3);
+	 if(((n1>n2)&&(n1<n3))||((n1<n2)&&(n1>n3)))
+	 {
+	     printf("%d",n1);
+	 }
+	else if(((n2>n1)&&(n2<n3))||((n2<n1)&&(n2>n3)))
+	{
+	    printf("%d",n2);
+	}
+	else
+	{
+	    printf("%d",n3);
+	}
+	
+	return 0;
+}

Codechef Problems/DSA Learning Series/Find me.c

@@ -0,0 +1,51 @@
+/* You are given a list of N integers and a value K. Print 1 if K exists in the given list of N integers, otherwise print −1.
+
+Input:
+First-line will contain two numbers N and K.
+Next line contains N space-separated numbers.
+Output:
+Print the answer in a new line.
+
+Constraints
+1≤N,K,Ai≤105
+Sample Input 1:
+4 2
+1 2 3 4
+Sample Output 1:
+1
+Sample Input 2:
+4 4
+1 2 6 9
+Sample Output 2:
+-1
+EXPLANATION:
+In the first example, as 2 is present in the list.
+In the second example, 4 is not present in the list. */
+
+#include <stdio.h>
+
+int main(void) {
+	
+	int n,k;
+	scanf("%d %d",&n,&k);
+	int a[n];
+	int c=0;
+	for(int i=1; i<=n; i++)
+	{
+	    scanf("%d ",&a[i]);
+	    if(a[i]==k)
+	    {
+	        c=1;
+	    }
+	}
+	
+	if(c==1)
+	{
+	    printf("1");
+	}
+	else
+	{
+	    printf("-1");
+	}
+	return 0;
+}

Codechef Problems/DSA Learning Series/Is both or not.c

@@ -0,0 +1,46 @@
+/* You're given a number N. If N is divisible by 5 or 11 but not both then print "ONE"(without quotes). If N is divisible by both 5 and 11 then print "BOTH"(without quotes). If N is not divisible by 5 or 11 then print "NONE"(without quotes).
+
+Input:
+First-line will contain the number N.
+Output:
+Print the answer in a newline.
+
+Constraints
+1≤N≤103
+Sample Input 1:
+50
+Sample Output 1:
+ONE
+Sample Input 2:
+110
+Sample Output 2:
+BOTH
+Sample Input 2:
+16
+Sample Output 2:
+NONE
+EXPLANATION:
+In the first example, 50 is divisible by 5, but not 11.
+In the second example, 110 is divisible by both 5 and 11.
+In the third example, 16 is not divisible by 5 or 11. */
+
+#include <stdio.h>
+
+int main(void) {
+	
+	int n;
+	scanf("%d",&n);
+	if((n%5==0)&&(n%11==0))
+	{
+	    printf("BOTH");
+	}
+	else if((n%5==0)||(n%11==0))
+	{
+	    printf("ONE");
+	}
+	else
+	{
+	    printf("NONE");
+	}
+	return 0;
+}

Codechef Problems/DSA Learning Series/Raju and his trip.c

@@ -0,0 +1,43 @@
+/* Raju is planning to visit his favourite restaurant. He shall travel to it by bus. Only the buses whose numbers are divisible by 5 or by 6 shall take him to his destination. You are given a bus number N. Find if Raju can take the bus or not. Print YES if he can take the bus, otherwise print NO.
+
+Input:
+The first and only line of the input shall contain an integer N, denoting the bus number.
+Output:
+Print YES if Raju can take that bus, else print NO.
+
+Constraints
+1≤N≤106
+Sample Input 1:
+60
+Sample Output 1:
+YES
+Sample Input 2:
+16
+Sample Output 2:
+NO
+Sample Input 3:
+20
+Sample Output 3:
+YES
+EXPLANATION:
+In the first example, 60 is divisible by 5 and 6 both, so he can take the bus.
+In the second example, 16 is divisible by neither 5 nor 6, so he can't take the bus.
+In the third example, 20 is divisible by 5, so he can take the bus. */
+
+#include <stdio.h>
+
+int main(void) {
+	
+	int t;
+	scanf("%d",&t);
+	//t is the bus number
+	if((t%5==0)||(t%6==0))
+	{
+	    printf("YES");
+	}
+	else
+	{
+	    printf("NO");
+	}
+	return 0;
+}

Codechef Problems/DSA Learning Series/Range odd.c

@@ -0,0 +1,46 @@
+/* You're given two numbers L and R. Print all odd numbers between L and R (both inclusive) in a single line separated by space, in ascending (increasing) order.
+
+Input:
+First-line will contain two numbers L and R.
+Output:
+Print all odd numbers in a single line separated by space, in ascending (increasing) order.
+
+Constraints
+1≤L<R≤106
+Sample Input 1:
+2 9
+Sample Output 1:
+3 5 7 9
+Sample Input 2:
+3 4
+Sample Output 2:
+3
+EXPLANATION:
+In the first example, odd numbers between 2 and 9 are 3,5,7,9.
+In the second example, the only odd number in the range is 3. */
+
+#include <stdio.h>
+
+int main(void) {
+	
+int start , end;
+scanf("%d %d",&start,&end);
+int a[end];
+int x=0;
+for(int i=start;i<=end;i++)
+{
+   
+    if(i%2!=0)
+    {
+        a[x]=i;
+        x++;
+    }
+}
+
+for (int y=0;y<x;y++)
+{
+    printf("%d ",a[y]);
+}
+	
+	return 0;
+}