varianta 2 Paralela 45 (INFO )

I.
1.a
2.b
3.b
4.d
5.c
II.
1.

2.
struct punct
{int x,int y;};
struct poligon
{int nr_vf;
punct vf[20];}p;

cin>>p.nr_vf;
for(i=0;i<p.nr_vf;i++)
cin>>p.vf[i].x>>p.vf[i].y;
3.
for(i=1;i<=5;i++)
for(j=1;j<=5;j++)
if(i+j==6)
a[i][j]=3;
if(i+j>6)
a[i][j]=2;
else
a[i][j]=1;
III.
1.
#include <bits/stdc++.h>
using namespace std;
int ap[101];
int main()
{char s[101],ci;
int i,c,maxi=0;
cin.getline(s,100);
c=strlen(s);
for(i=0;i<=c;i++)
if((s[i]>='a'&&s[i]<='z') || (s[i]>='A'&& s[i]<='Z'))
{ap[s[i]-'A']++;
if(ap[s[i]-'A']>maxi)
    {maxi=ap[s[i]-'A'];
    ci=s[i];}}
cout<<ci<<" "<<ap[ci-'A'];
    return 0;
}
2.
int numarare(int a,int b)
{int i,j,nr,nrf=0;
for(i=a;i<=b;i++)
{nr=0;
    for(j=1;j*j<=i;j++)
    {if(i%j==0)
    {nr++;
    if(j*j<i)
     nr++;}}
    if(nr==3)
        nrf++;
}
return nrf;
}
3.
#include <bits/stdc++.h>
using namespace std;
ifstream fin("bac.txt");
int ap1[101],ap2[101];
int main()
{int n,m,x,maxi=0,mini=2e9,i;
fin>>n>>m;
for(i=1;i<=n;i++)
    {fin>>x;
ap1[x]++;
maxi=max(maxi,x);}
for(i=1;i<=m;i++)
{fin>>x;
ap2[x]++;
maxi=max(maxi,x);}
for(i=1;i<=maxi;i++)
    {if(ap1[i]!=0 && ap2[i]!=0)
    mini=min(mini,ap1[i]);
    if(ap2[i]!=0 && ap1[i]==0)
        {mini=0;
        break;}}
cout<<mini;
    return 0;
}