Results 1 to 5 of 5

Thread: (C++) -

Hybrid View

Previous Post Previous Post   Next Post Next Post
  1. #1
    Registered User Nikoloff's Avatar
    Join Date: Sep:2007
    Location: Bourgas
    Posts: 6

    (C++) -

    , ) ) .
    " 2000"
    :
    ) 1
    ( , 30 , 20 ).
    ) - .
    ) - .
    ) - .
    ) , .
    10-
    :
    #include <iostream.h>

    int main()
    {
    const int N=20;
    int A[N];
    //a)
    for(int i=0; i<N; i++)
    {
    cout<<"Broj obsluzheni klienti za "<<i+1<<" mesec e : ";
    cin>>A[i];
    }
    //)
    int max=A[0];
    for (i=0; i<N ; i++)
    if(max<A[i])
    {
    max=A[i];
    }
    cout<<"Denqyat s nai-golqm broj obslujeni e "<<i+1<<"-iya "<<"s "<<A[i]<<" oblujeni klienta";

    //)

    //)

    //)
    int otstypka=0;
    for(i=0; i<N; i++)
    if(A[i]%10==0)
    otstypka=A[i]/10;
    cout<<"Broya na klientite s otstypka za "<<i+1<<"-iya den e "<<otstypka;

  2. #2
    Mire-x
    Join Date: Apr:2005
    Location: Sofia
    Posts: 763
    ) - , "20-yia" , for . , max, , max.

    - ) ) , min (if(min > A[i])), min-a. max ( min1 min2), min1 - A[i], min2 = min1, min1 = A[i]. min1 - , min2 - -. ( ) ).

    ), . A[1] + A[2] + A[3] + A[4] + A[5] . A[6] A[10] - . 4- , - .

    ) . " " ()/10. .. 26, 26/10, 2.

    , - , , , - .
    (10b) || !(10b)

  3. #3
    Registered User Nikoloff's Avatar
    Join Date: Sep:2007
    Location: Bourgas
    Posts: 6
    , ) :

    //)
    int max=A[0];
    for (i=0; i<N ; i++)
    if(max<A[i])
    {
    max=A[i];
    den=i;
    }
    for (i=0; i<N; i++)
    if (den==i)
    cout<<"Denqyat s nai-golqm broj obslujeni e "<<den<<"-iya "<<"s "<<max<<" obslujeni klienta";
    ) .
    ) if- , .

    ) , :x
    int min1=A[0]; int min2; int den=0;
    for (i=0; i<N ; i++)
    if(min1>A[i])
    {
    min1=A[i];
    den=i;
    }
    min2=min1;

    for (i=0; i<N ; i++)
    if(min1>A[i] && min1!=A[den])
    {
    min1=A[i];
    }

    cout<<min1<<min2;

  4. #4
    Mire-x
    Join Date: Apr:2005
    Location: Sofia
    Posts: 763
    ) - if . , A[den] A[i] ( i == den), , A[den] == max. .. max. , den .

    ) - , . :
    PHP Code:
    int min1 maxmin2 maxden1 0den2 0;
    for (
    i=0i<Ni++)
        if (
    min1 A[i])
        {
            
    min2 min1;  // min2 = predishnata nai-malka stoinost
            
    min1 A[i];   // min1 = segashnata nai-malka stoinost
            
    den2 den1// den2 = denia s predishna nai-malka stoinost
            
    den1 i;       // den1 = denia sys segashnata nai-malka stoinost
        
    }
    cout<<"2-ta dni s nai-malyk broi klienti: "<<den1<<" ("<<min1<<") i "<<den2<<" ("<<min2<<")"
    "max" "min" , "broi", 4 : broi1, broi2, den1, den2. ) broi1 broi2, ) - .

    ) - , "otstypka = ..." "cout" , cout .
    (10b) || !(10b)

  5. #5
    Registered User Nikoloff's Avatar
    Join Date: Sep:2007
    Location: Bourgas
    Posts: 6
    :

    Code:
    int min1=A[0], min2=A[1], den1 = 0, den2 = 0; 
    for (i=0; i<N; i++) 
        if (min1>A[i]) 
        { 
            min2 = min1;  // min2 = predishnata nai-malka stoinost 
            min1 = A[i];   // min1 = segashnata nai-malka stoinost 
            den2 = den1; // den2 = denia s predishna nai-malka stoinost 
            den1 = i;       // den1 = denia sys segashnata nai-malka stoinost 
        } 
    cout<<"2-ta dni s nai-malyk broi klienti: "<<den1+1<<" ("<<min1<<") i "<<den2+1<<" ("<<min2<<")";
    min2 , 0, , , min2 min1, . , ... ,
    , Tarvin

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  

Copyright © 1999-2011 . .
iskamPC.com | mobility.BG | Bloody's Techblog | | 3D Vision Blog |