Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //JOI- cautare binara
- #include <iostream>
- using namespace std;
- int main()
- {
- int v[100],n,i,j,l,pi,aux[100],ok,k,lmax;
- cin>>n;
- for (i=1;i<=n;i++)
- {cin>>v[i];
- // constrium vectorul aux cu 0 si 1 pt nr prime din v[100]
- ok=1;
- for(j=2;j<=v[i]/2;j++)
- if (v[i]%j==0)
- ok=0;
- if (ok==1 &&v[i]>=2)
- aux[i]=1;
- else
- aux[i]=0;
- }
- k=0;
- lmax=0;
- i=1;
- while (i<=n)
- {
- l=0;
- while (aux[i]==1 && i<=n)
- {
- l++;
- i++;
- }
- if (l>lmax)
- lmax=l;
- i++;
- }
- i=1;
- while (i<=n)
- {
- pi=i;
- l=0;
- while (aux[i]==1&& i<=n)
- {
- l++;
- i++;
- }
- if (l=lmax)
- {
- k++;
- for (j=pi;j<=pi+lmax-1;i++)
- cout<<v[j];
- }
- i++;
- }
- cout<<'\n'<<"k="<<k;
- return 0;
- }
- //Se citesc n nr intregi din fisierul date.in. Sa se afiseze platourile(sevcente) de lmax in care elementele
- // au acelasi nr de cifre distincte.
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement