p.259 6.12

  1. package firstjava;
  2. import java.util.Scanner;
  3. public class DisplayNum {
  4.     public static void display (int a, int b){
  5.     int i,j;
  6.     for ( i=a ; i<=b ; i++ )   
  7.         {
  8.         for ( j=0 ; j<10 ; j++ )
  9.             System.out.println(i+" ");
  10.         System.out.println("\n");
  11.         }
  12.     }
  13.     public static void main(String[] args) {
  14.         // TODO Auto-generated method stub
  15.         // input
  16.         Scanner input = new Scanner(System.in);
  17.         int iNum = input.nextInt();
  18.         int iNum2 = input.nextInt();
  19.         // call function
  20.         display(iNum, iNum2);  
  21.     }
  22. }

留言

張貼留言

這個網誌中的熱門文章

codeforces 271A --- beautiful year

BEAUTIFUL YEAR It seems like the year of 2013 came only yesterday. Do you know a curious fact? The year of 2013 is the first year after the old 1987 with only distinct digits. Now you are suggested to solve the following problem: given a year number, find the minimum year number which is strictly larger than the given one and has only distinct digits. Input The single line contains integer  y   (1000 ≤  y  ≤ 9000)  — the year number. Output Print a single integer — the minimum year number that is strictly larger than  y  and all it's digits are distinct. It is guaranteed that the answer exists. Examples input 1987 output 2013 input 2013 output 2014 #include <iostream> using   namespace  std ; int  iFind  (   int  iIn  ) { int  iFlag ;   int  iBucket [ 10 ] ; for   (   int  i = 0   ;  i < 10   ;  i ++ ...
閱讀完整內容

Uva 913

梯形公式 (a+b)*h / 2 amount                 number               1                           1 3                           3  5  7              (1+3)*2 -1                       5                           9 11 13 15 17  (1+3+5)*2-1 ... #include <iostream> using   namespace  std ; int  main ( ) { long   long   int  iSum, iNum ; long   long   int  iAmount, iHight ;           // (a+b)h/2 int  iLength, iCarry , iTemp ;     while   (   cin   >>  iAmount  )    ...
閱讀完整內容

Uva 591--- Box of Bricks

#include <iostream> using   namespace  std ; int  main ( ) { int  iStack ; int  iHight [ 101 ] ; int  iSum, iTime, iTemp ; int  i,j ; j  =   0 ;   while   ( cin   >>  iStack )      {      if   (  iStack  ==   0   )          break ;       iHight [ 101 ]   =   { 0 } ;     iSum  =  iTime  =   0 ;         for   (  i = 0   ;  i < iStack  ;  i ++   )                  {          cin   >>  iHight [ i ] ;            iSum  + =  iHight [ i ] ;            }     iSum  =  iSum  /  iStack...
閱讀完整內容