Subiectul1

1d
2 cautare binara
3 b
4 j+i=6
5 12

Subiecul 2
1 a 4 8 6 16 45 => 2 ( cate nr sunt puteri a lui 2)
B n=4 => 3 5 7 9
2 if(((XM==XN)&&(XM==0)) ||((YM==YN)&&(YM==0))) return 1;
Return 0;
3 C={ 80,78,15, 15, 12, 9, 8, 7, 3, 3,}
Subiectul 3
1. Are doar 3 divizori in interval
#include <iostream>
#include <math.h>
using namespace std;
int prim(int n)
{
if (n<2) return 0;
if (n==2) return 1;
if(n%2==0) return 0;
for (int d=3; d*d<n; d+=2)
if(n%d==0) return 0;
return 1;
}
int main()
{
int a,b;
cin>>a>>b;
int m =a;
int q, x=0,nr=1;
while(x==0 && m<=b)
{
q=sqrt(m);
if (q*q==m) if (prim(q)) x=q; m++;
}
while(x*x<=b)
{
x++;
if (prim(x)) nr++;
}
if(x==0) cout<<'0';
else cout<<nr;
return 0;
}

2 problema cu de cate ori apar elementele in vector

#include <iostream>
using namespace std;
int i;
int main()
{
int n;
cin>>n;
int a[n];
int nr;
for(int i=1; i<=n; i++) cin>>a[i];
 for(int i=1; i<n; i++)
{
nr=1;
for (int j=i+1; j<=n; j++)
if(a[j]!=-1 && a[i]!=-1)if(a[i]==a[j])
{
nr++;
a[j]=-1;
}
if (a[i]!=-1) cout<<a[i]<<' '<<nr<<endl;
a[i]=-1;
}

return 0;
}
3