Bacalaureat Mate Info 2015

I.
1.c
2.

II.
1.d
2.a
3.
1: 2 3
2: 5
3: 2
4: 1
5: 1 2 4

4.

5.
#include <bits/stdc++.h>

using namespace std;

int main()
{
  int t[21][21],i,j,m,n,a=1,k;
  cin>>m>>n;
  for(i=m;i>=1;i--)
    for(j=n;j>=1;j--)
     {for(k=a;k<=k+3;k=k+2)
     if(k%3!=0)
     {t[i][j]=k;
     a=k+2;
     break;}}

    for(i=1;i<=m;i++)
        {for(j=1;j<=n;j++)
        cout<<t[i][j]<<" ";
    cout<<"\n";}
    return 0;
}
III.
1.c
2. 5 16
3.
void subperfect(int a,int b)
{
    int i,j,s;
    for(int i=b;i>=a;i--)
    {s=0;
        for(j=i-1;j>1;j--)
        if(i%j==0)
        s=s+j;
     if(s>i)
        cout<<i<<" ";}
}

4.
#include <bits/stdc++.h>

using namespace std;
ifstream fin("bac.txt");
int ap[101];
int main()
{int n,i,c=0,x,t,maxi,cc=0;
fin>>n;
while(fin>>x)
{c++;
t=log2(x);
maxi=max(maxi,t);
ap[t]++;}
if(c<n)
    cout<<"NU EXISTA";
else
    for(i=0;i<=maxi;i++)
    {cc=cc+ap[i];
        if(n<=cc)
            {cout<<pow(2,i);
            break;}
        }
    return 0;
}