negative number - Page 48

How to get the slide number of cycle on click event of its element

- by Geetha

Hi All, In each slide of the cycle there are seven links(). in the click event of that link i want to get its slide number. Geetha.

Variable Number of Input Fields in Classic-ASP form

- by itsaboutcode

Hi, I have a check out form where number of products can be "n". So how i can know how many input fields are in the form and take input from it? Thanks

How to get number of cores in C?

- by Alan

I'm writing a program in C on windows that needs to run as many threads as available cores. But I dont know how to get the number of cores. Any ideas?

Find the closest palindrome number C#

Hi All, I am trying to create a console application that reads number from a file all underneath each other like so: 101 9 and then outputs into another file the closest palindrome number. So far what I have is not quite rightm i.e. I don't think I can put the class inside a method which is a bit more Java I was wandering if anyone could help at all? Thanks :) namespace PalidromeC { class Program { static public void Main(string[] args) { #region WriteAnswers try { StreamWriter sw = new StreamWriter("C://Temp/PalindromeAnswers.txt"); sw.WriteLine("Answers"); sw.Close(); }//try catch (Exception e) { Console.WriteLine("Exception: " + e.Message); }//catch #endregion #region ReadFile try { string numbers; StreamReader sr = new StreamReader("C://Temp/Palindrome.txt"); numbers = sr.ReadLine(); while (numbers != null) { Console.WriteLine(numbers); numbers = sr.ReadLine(); }//while sr.Close(); Console.ReadLine(); }//try catch (Exception e) { Console.WriteLine("Exception: " + e.Message); }//catch #endregion NearPalindromeFinder f = new NearPalindromeFinder(); int palindrome = f.findNearPalindrome(n); Console.WriteLine("Nearest Palindrome = " + palindrome); }//main public static void testFindNearestPalindrome(int n) { class NearPalindromeFinder { int findNearPalindrome(int start) { if (testPalindrome(start)) return start; else { int neg = start; int pos = start; for (int i = 0; i < start; i++) { if (testPalindrome(start-i)) { neg = start-i; break; }//if if (testPalindrome(start+i)) { pos = start+i; break; }//if }//for return (start == neg) ? pos : neg; }//else }//findNearPalindrome bool testPalindrome(int start) { if (start == 0 || start == 1) return true; String str = String.valueOf(start); String rev = new if (str.equals(rev)) return true; else return false; }//testPalindrome }//NearPalindromeFinder class }//testFindNearestPalindrome }//Program Class

Search Results

Search found 25563 results on 1023 pages for 'negative number'.

Page 48/1023 | < Previous Page | 44 45 46 47 48 49 50 51 52 53 54 55 | Next Page >

- by Geetha

- by itsaboutcode

- by Alan

- by user294837

- by Simon Johnson

- by Upul

- by James P.

- by Darko Z

- by LS

- by laspal

- by mjmcloug

- by Aruna

- by Barry Carter

- by skiria

- by paultop6

- by Amrita

- by user200018

- by soldieraman

- by Asaf

- by Hello you all men

- by chandu

- by VBeginner

- by palominoz

- by payal

- by user225269

< Previous Page | 44 45 46 47 48 49 50 51 52 53 54 55 | Next Page >