Documente Academic
Documente Profesional
Documente Cultură
Suma cifrelor
return ogl;
}
return palindrom;
}
return px;
}
return prim;
}
return nrdiv;
}
/// VECTORI
Algoritmi C++
//stergere
if(a[i]%2 == 1)
b[m++] = a[i];
}
///inserare
int main()
Algoritmi C++
{
int n, a[100], m, b[200];
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
inserare1(a,n,10);
afisare(a,n);
inserare2(a,n,20);
afisare(a,n);
inserare3(a,n,b,m,30);
afisare(b,m);
//stergere1(a,n);
//afisare(a,n);
//stergere2(a,n);
// afisare(a,n);
stergere3(a,n,b,m);
afisare(b,m);
return 0;
}
///sortare
//// sortare prin interschimbare
/// crescatoare
#include <iostream>
a[i] = a[j];
a[j] = aux;
}
for(int i = 0; i < n; i ++)
cout << a[i] << " ";
return 0;
}
do
{
ok = 1;/// presupun sirul sortat
for(int i = 0;i < n - 1 - p; i++)
if(a[i] > a[i+1])
{
ok = 0;
int aux;
aux = a[i];
a[i] = a[i+1];
a[i+1] = aux;
}
p++;
}while(ok == 0);
int a[100000],b[100000],c[200000],n,m;
ifstream f("interclasare.in");
ofstream g("interclasare.out");
void citire()
{
f>>n;
for(int i=0;i<n;i++)
f>>a[i];
f>>m;
for(int i=0;i<m;i++)
f>>b[i];
}
void interclasare()
{
int i=0,j=0,k=0;
while(i<n && j< m)
if(a[i]<b[j])
c[k++]=a[i++];
else
c[k++]=b[j++];
while(i<n)
c[k++]=a[i++];
while(j<m)
c[k++]=b[j++];
void afisare()
{
for(int i=0;i<n+m;i++)
{
if(i>0 && i%10==0)
Algoritmi C++
g<<"\n";
g<<c[i]<<" ";
//if(i%10==9) g<<"\n";
}
}
int main()
{
citire();
interclasare();
afisare();
return 0;
}
///cautare binara
#include <fstream>
#include <iostream>
int a[100],n,v;
int CB(){
int st = 0, dr = n - 1;
while(st <= dr){
int mij = (st + dr) / 2;
if(a[mij] == v)
return 1;
else
if(a[mij] < v)/// caut in a doua jumatate
st = mij + 1;
else /// caut in prima jumatate
dr = mij - 1;
}
return 0;
}
int main(){
ifstream fin("date.in");
Algoritmi C++