Complete Task

Nth-Digit-Fibonacci/JayAkabri/Main.java

@@ -0,0 +1,34 @@
+import java.io.*;
+import java.util.*;
+public class Main {
+
+    public static void main(String[] args) {
+
+        int n = 1000, t1 = 0, t2 = 1,count=1,no=0;
+
+        Scanner sc = new Scanner(System.in);
+
+        System.out.println("Enter Number");
+        no = sc.nextInt();
+
+        // System.out.print("Upto " + n + ": ");
+        while (count<n)
+        {
+            // System.out.print(t1 + " + ");
+
+            int sum = t1 + t2;
+            t1 = t2;
+            t2 = sum;
+            count+=1;
+            String len=String.valueOf(sum);
+            if (len.length()==no)
+            {
+                System.out.println(count);
+
+                break;
+            }
+
+
+        }
+    }
+}

Palindrome/pelindrom.c

@@ -0,0 +1,31 @@
+#include<stdio.h>
+int pelindrome(int n)
+{
+	int t,r = 0;
+	  t=n;
+	  while(t!=0)
+	  {
+	    r=r*10;
+	    r=r+(t%10);
+	    t=t/10;
+	  }
+	  if(r==n)
+	    return 1;
+	  else
+	    return 0;
+}
+void main()
+{
+	int k,d,i;
+	printf("enter number: ");
+	scanf("%d",&k);
+	i = k + 1;
+	while(1)
+	{
+	  	d=palindrome(i);
+		if(d==1)
+			break;
+		i++;
+	}
+	printf("%d",i);
+}