Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /* Chương trình giải */
- import java.util.LinkedList;
- /**
- *
- * @author KimDinhSon
- */
- public class VMO04 {
- public LinkedList<Integer> arr=new LinkedList<Integer>();
- public LinkedList<Integer> Arr=new LinkedList<Integer>();
- private int N=2013;
- int CountA=0, CountB=0;// Dem so buoc thuc hien
- public void init(){
- // Du lieu phan b)
- for(int i=0;i<999;i++){
- arr.add(i, i+1);
- }
- // Du lieu phan a)
- Arr.addFirst(1);
- Arr.addLast(1000);
- }
- public int resulfA(){
- int i=0,KQ=0;
- while(i<Arr.size()){
- if(Arr.get(i)==N){
- KQ++;
- i++;
- }
- else i++;
- }
- return KQ;
- }
- public int resulfB(){
- int i=0,KQ=0;
- while(i<arr.size()){
- if(arr.get(i)==N){
- KQ++;
- i++;
- }
- else i++;
- }
- return KQ;
- }
- public void addNumber(){
- // Part a
- while(CountA<N){
- int i=1;
- while(i<Arr.size()){
- // Buoc dien thu i+1
- if(Arr.get(i)<N+1){
- Arr.add(i, Arr.get(i-1)+Arr.get(i));// Dien so moi vao mang bang tong Arr[i-1]+Arr[i]
- i+=2;
- }
- else break;
- }
- CountA++;
- i=1;
- }
- // Part b
- while(CountB<N){
- int i=1;
- while(i<arr.size()){
- // Buoc dien thu i+1
- if(arr.get(i)<N+1){
- arr.add(i, arr.get(i-1)+arr.get(i));// Dien so moi vao mang bang tong Arr[i-1]+Arr[i]
- i+=2;
- }
- else break;
- }
- CountB++;
- i=1;
- }
- }
- public void printArrA(){
- for(int i=0;i<Arr.size();i++){
- if(Arr.get(i)==N)// Chi hien thi ptu bang 2013
- System.out.print("A["+i+"]="+Arr.get(i)+" ;");
- }
- System.out.println();
- }
- public void printArrB(){
- for(int i=0;i<arr.size();i++){
- if(arr.get(i)==N){// Chi hien thi ptu bang 2013
- System.out.print("B["+i+"]="+arr.get(i)+" ;");
- if(i%10==0)System.out.println();
- }
- }
- System.out.println();
- }
- public static void main(String[] args) {
- VMO04 pro4 = new VMO04();
- pro4.init();
- pro4.addNumber();
- System.out.print("Kết quả câu a là: "+pro4.resulfA()+" lần số "+pro4.N+" xuất hiện.\n");
- pro4.printArrA();
- System.out.println();
- System.out.print("Kết quả câu b là: "+pro4.resulfB()+" lần số "+pro4.N+" xuất hiện.\n");
- pro4.printArrB();
- }
- }
- //////////////////////////////////////////////////////////////////////////////////////////
- // Output:
- Kết quả câu a là: 2 lần số 2013 xuất hiện.
- A[2]=2013 ;A[2016]=2013 ;
- Kết quả câu b là: 40 lần số 2013 xuất hiện.
- B[2]=2013 ;B[2016]=2013 ;B[4701]=2013 ;B[5708]=2013 ;B[7779]=2013 ;B[8498]=2013 ;B[10257]=2013 ;B[12842]=2013 ;B[14151]=2013 ;B[14711]=2013 ;B[19149]=2013 ;B[20337]=2013 ;B[25519]=2013 ;B[29699]=2013 ;B[37168]=2013 ;B[38545]=2013 ;B[42517]=2013 ;B[50703]=2013 ;B[57069]=2013 ;B[60499]=2013 ;B[61717]=2013 ;B[64309]=2013 ;B[120671]=2013 ;B[169579]=2013 ;B[170797]=2013 ;B[172609]=2013 ;B[179955]=2013 ;B[183493]=2013 ;B[190765]=2013 ;B[192058]=2013 ;B[198611]=2013 ;B[206657]=2013 ;B[207685]=2013 ;B[211515]=2013 ;B[213149]=2013 ;B[215347]=2013 ;B[216962]=2013 ;B[217545]=2013 ;B[219386]=2013 ;B[220195]=2013 ;
- BUILD SUCCESSFUL (total time: 5 minutes 21 seconds)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement