From 3889e0cd5f1e0d59e0c38b129ad52f3df4d4a820 Mon Sep 17 00:00:00 2001 From: unknown Date: Fri, 19 Oct 2018 17:08:45 +0530 Subject: [PATCH 1/2] First Task --- Nth-Digit-Fibonacci/JayAkabri/Main.java | 34 +++++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 Nth-Digit-Fibonacci/JayAkabri/Main.java diff --git a/Nth-Digit-Fibonacci/JayAkabri/Main.java b/Nth-Digit-Fibonacci/JayAkabri/Main.java new file mode 100644 index 0000000..e51aa57 --- /dev/null +++ b/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 Date: Fri, 26 Oct 2018 09:42:43 +0530 Subject: [PATCH 2/2] palindrome added --- Palindrome/pelindrom.c | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 Palindrome/pelindrom.c diff --git a/Palindrome/pelindrom.c b/Palindrome/pelindrom.c new file mode 100644 index 0000000..7fc847f --- /dev/null +++ b/Palindrome/pelindrom.c @@ -0,0 +1,31 @@ +#include +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); +}