OJI

Aici vom discuta pe tema IT care va include : c++, visual basic, php, html, css si multe altele; veti gasi si diverse stiri.

Moderators: Moderator ajutator, Moderator

skill +2
skill +2
Status: Offline
Posts: 112
Registered for: 10 years 4 months
10
Status: import org.bukkit.command.*;
Cont Premium: ChrystianSandu
Location: 127.0.0.1

OJI Post by ChrystianSandu »

Buna ziua, m-am gandit sa incep rezolvarea subiectelor OJI 2013 - 2014 (din clasa a V-a). Voi face in acest topic publica rezolvarea:

2013
Clasa V:

-Bete:

Code: Select all

#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;
int a[100], b[100],n,i,p;
int main()
{
    ifstream fin ("date.in");
    ofstream fout ("date.out");

    fin >> n;
    for  (i=0; i<n; i++)
    {
        fin >> a[i];
    }
    for  (i=0; i<n; i++)
    {
        fin >> b[i];
    }
    sort (a, a+n);
    sort (b, b+n);
    fout << a[0] + b[n-1] << endl;
    int maxim = a[n-1] + b[n-1];
    int k = 0;
    fout << a[n-1] + b[n-1] << endl;
    for (i=0; i<n; i++)
    {
        for (p = i; p<n; p++)
        {
            if (a[i] + b[p] == maxim)
            {
                k++;
            }
        }
    }
    fout << k;
    return 0;
}
- chibrituri (nu eu am rezolvato, prea mult de scris pentru fiecare cifra)

Code: Select all

#include<cstdio>
using namespace std;
int n,m,oz[10],vt[10],nr,i,j,k,t,imax=-1,jmax=-1,kmax=-1,tmax=-1,imin=10,jmin=10,kmin=10,tmin=10;
int main()
{
    freopen("chibrituri.in", "r",stdin);
    freopen("chibrituri.out","w",stdout);
    scanf("%d%d", &n, &m);
    oz[0]=2;vt[0]=4;oz[1]=0;vt[1]=2;oz[2]=3;vt[2]=2;oz[3]=3;vt[3]=2;oz[4]=1;vt[4]=3;
    oz[5]=3;vt[5]=2;oz[6]=3;vt[6]=3;oz[7]=1;vt[7]=2;oz[8]=3;vt[8]=4;oz[9]=3;vt[9]=3;
    for(i=0;i<=1;i++)
        for(j=0;j<=9;j++)
            for(k=0;k<=5;k++)
                for(t=0;t<=9;t++)
                {
                    if(oz[i]+oz[j]+oz[k]+oz[t]!=m) continue;
                    if(vt[i]+vt[j]+vt[k]+vt[t]!=n) continue;
                    nr++;
                    if(i>imax){imax=i;jmax=j;kmax=k;tmax=t;}
                    else
                        if(i==imax)
                        {
                            if(j>jmax){jmax=j;kmax=k;tmax=t;}
                            else
                                if(j==jmax)
                                {
                                    if(k>kmax){kmax=k;tmax=t;}
                                    else
                                        if(k==kmax)
                                            if(t>tmax)tmax=t;
                                }
                        }
                    if(i<imin){imin=i;jmin=j;kmin=k;tmin=t;}
                    else
                        if(i==imin)
                        {
                            if(j<jmin){jmin=j;kmin=k;tmin=t;}
                            else
                                if(j==jmin)
                                {
                                    if(k<kmin){kmin=k;tmin=t;}
                                    else
                                        if(k==kmin)
                                            if(t<tmin)tmin=t;
                                }
                        }



                }
    i=2;
    for(j=0;j<=3;j++)
        for(k=0;k<=5;k++)
                for(t=0;t<=9;t++)
                {
                    if(oz[i]+oz[j]+oz[k]+oz[t]!=m) continue;
                    if(vt[i]+vt[j]+vt[k]+vt[t]!=n) continue;
                    nr++;
                    if(i>imax){imax=i;jmax=j;kmax=k;tmax=t;}
                    else
                        if(i==imax)
                        {
                            if(j>jmax){jmax=j;kmax=k;tmax=t;}
                            else
                                if(j==jmax)
                                {
                                    if(k>kmax){kmax=k;tmax=t;}
                                    else
                                        if(k==kmax)
                                            if(t>tmax)tmax=t;
                                }
                        }
                    if(i<imin){imin=i;jmin=j;kmin=k;tmin=t;}
                    else
                        if(i==imin)
                        {
                            if(j<jmin){jmin=j;kmin=k;tmin=t;}
                            else
                                if(j==jmin)
                                {
                                    if(k<kmin){kmin=k;tmin=t;}
                                    else
                                        if(k==kmin)
                                            if(t<tmin)tmin=t;
                                }
                        }
                }
    printf("%d\n", nr);
    printf("%d%d:%d%d\n", imin, jmin, kmin, tmin);
    printf("%d%d:%d%d\n", imax, jmax, kmax, tmax);
    return 0;
}
skill +2
skill +2
User avatar
Status: Offline
Posts: 104
Registered for: 10 years 5 months
10
Status: Fost Bukkit Leader
Fost Moderator
Cont Premium: WallE256
Contact:

Re: OJI Post by WallE256 »

Anul ala am fost pe 3 in Bucuresti :D Subiectele sunt mult mai simple decat par. Le-am facut in concurs.
Retras.
[ytsig]raddudj[/ytsig]
skill +2
skill +2
Status: Offline
Posts: 112
Registered for: 10 years 4 months
10
Status: import org.bukkit.command.*;
Cont Premium: ChrystianSandu
Location: 127.0.0.1

Re: OJI Post by ChrystianSandu »

Constantinescu Andrei Costin? Oricum, daca cu mintea de acum eram in clasele a 5-a, eram medalitat cu aur la internationala... ;(. Oare exista calatoria in timp?
Post a new topic Post a reply

Return to “Discutii IT”