------>v100

1) divizori comuni

#include <iostream>
using namespace std;
void div(int a, int b, int c)
{
int minim;

if(a<b)
minim=a;
else
minim=b;
if(minim>c)
minim=c;

for(int d=1;d<=minim/2;d++)
{
if(a%d==0 && b%d==0 && c%d==0)
cout<<d<<" ";
}
}
int main()
{
int a,b,c;
cin>>a>>b>>c;

div(a,b,c);
return 0;
}

2)) Elementele cel mai mici dintre vecini

-tehnica inramarii cu un maxim
#include <iostream>
using namespace std;

int main()
{
int n, a[100][100];
cin>>n;

for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
cin>>a[i][j];
int maxi=9999999;
for(int i=0;i<=n+1;i++)
a[0][i]=a[i][0]=a[n+1][i]=a[i][n+1]=maxi;

for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
if(a[i][j]<a[i-1][j] && a[i][j]<a[i+1][j] && a[i][j]<a[i][j+1]&& a[i]
[j]<a[i][j-1])
cout<<a[i][j]<<" ";
}
return 0;
}

<------v100
---->v99
Cea mai lunga secventa de numere de paritate diferita
#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("bac.in");

int main()
{
int x[100000];
int i=1;

fin>>x[i];
i++;
int l=0;
int lmax=0;
int pmax;
int poz=0;
while(fin>>x[i])
{ int ok=0;
if(x[i-1]%2!=x[i]%2)
{
l++;
if(ok==0)
poz=i-1;
ok=1;

}
else
if(l>lmax)
{
lmax=l;
pmax=i-1;
l=0;
}
i++;

}
cout<<lmax<<endl;
for(int j=poz;j<=pmax;j++)
cout<<x[j]<<" ";
return 0;
}
3) Elimina prima si ultima vocala
#include <iostream>
using namespace std;

void Nr(int &k) {

int rest,p = 1,copie = k;

while (copie >10) {
p *= 10;
copie /= 10;
}
rest = k % p;
k = rest / 10;

}
int main() {

int n;
cin>>n;

Nr(n);
cout<<n;

return 0;
}

4))Problema matrice
#include <iostream>

using namespace std;

int main()
{
int n, a[100][100];
cin>>n;

for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
if(i>=j)
a[i][j]=i;
else
a[i][j]=j;
}

for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
cout<<a[i][j]<<" ";
cout<<endl;
}
return 0;
}
<----99

---->98
4) NUmere pare din siruri
#include <iostream>
using namespace std;

int main()
{
int n,m,a[100],b[100],v[100]={0};

cin>>n>>m;

for(int i=1;i<=n;i++)
{
cin>>a[i];
if(a[i]%2==0)
v[a[i]]++;
}
 for(int i=1;i<=m;i++)
{
cin>>b[i];
if(b[i]%2==0)
v[b[i]]++;
}

int mini,maxi;

if(a[1]<b[m])
mini=a[1];
else
mini=b[m];
if(a[n]>b[1])
maxi=a[n];
else
maxi=b[1];

for(int i=mini;i<=maxi;i++)
{
while(v[i])
{
cout<<i<<" ";
v[i]--;
}
}

return 0;
}
3) Problema cu putere
#include <iostream>
using namespace std;
int mda(int x, int y)
{

int z=x;
while(z<=y)
{
z=z*x;

return z/2;
}
int main()
{
int x, y;
cin>>x>>y;
cout<<mda(x,y);
return 0;
}

test 6
3)void prodprim(int n, int&p)
{
p=1;
int d=1;
while(n%2==0)
 {
d=2;
n=n/2;
}
p=p*d;
d=3;
while(n>1 && d<=n)
{
if(n%d==0)
{while(n%d==0)
{
n=n/d;
}
p=p*d;
}

d+=2;

}
}
4))#include<iostream>
#include <cstring>

using namespace std;

int main()
{
char s[101],*p;
cin.getline(s,101);
p=strtok(s," ");

int v=0,c=0;
while(p)
{
for(int i=0;i<strlen(p);i++)
{

if(strchr("aeiou",p[i]))
v++;
else
c++;
}

if(v<c)
cout<<p<<endl;
v=0;
c=0;
p=strtok(NULL, " ");
}
return 0;
}

4)#include <iostream>
using namespace std;

int main()
{
 int p1, p2;
cin>>p1>>p2;

for(int i=p1;i>=1;i--)
{
if(p1%i==0 && i<10 && p1/i<10)
{
for(int j=p2;j>=1;j--)
if(p2%j==0 && j<10 && j>p2/j)
{
for(int k=9;k>=0;k--)
{ cout<<i<<p1/i<<k<<k<<k<<j<<p2/j<<endl;
cout<<i<<p1/i<<k<<k<<k<<p2/j<<j<<endl;
}

}
}
}

return 0;
}

suma minima -> sir fisier:

#include <iostream>
#include <fstream>
using namespace std;

ifstream fin("no.in");
int main()
{
int x;
fin>>x;
int sc,smin;
sc=smin=x;

while(fin>>x)
{
if(sc<0)
sc=sc+x;
else
sc=x;

if(sc<smin)
{
smin=sc;
}
}
fin.close();
cout<<smin;
return 0;
}
suma maxima sir fisier
#include <iostream>
#include <fstream>
using namespace std;

ifstream fin("no.in");
int main()
{
int x;
fin>>x;
int sc,smin;
sc=smin=x;

while(fin>>x)
{
if(sc>0)
sc=sc+x;
else
sc=x;

if(sc>smin)
{
smin=sc;
}
}
fin.close();
cout<<smin;
return 0;
}

3)#include <iostream>

using namespace std;

int main()
{
int n,k,a[100][100];
cin>>n>>k;

for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
cin>>a[i][j];
int p,q;
p=a[k][1];
int j=1;
while(k!=j)
{
a[k][j]=a[k][j+1];
j++;
}
a[k][j-1]=p;
cout<<endl;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
cout<<a[i][j]<<" ";
cout<<endl;
}
return 0;
}

1)#include <iostream>
using namespace std;
void produs(unsigned int n, unsigned int&p)
{
int v[10]={0};
p=1;
int ok=0;
while(n)
{
if((n%10)%2==0 && v[n%10]==0)
{ p=p*(n%10);
ok=1;
}
v[n%10]++;
n=n/10;
}
if(ok==0)
p=-1;
}
int main()
{
unsigned int n,p;
cin>>n;
produs(n,p);
cout<<p;
return 0;
}

2)#include <iostream>
#include <fstream>
using namespace std;

ifstream fin("bac.txt");

int main()
{
int pre, nr,x;

fin>>pre>>nr;
int r;
r=nr-pre;
int l=2;
int lmax=0;
int rat;
while(fin>>x)
{
if(x-r==nr)
l++;
else
{
r=x-nr;
l=2;
}
nr=x;

if(l>lmax)
{
lmax=l;
rat=r;
}
 }
cout<<rat;
return 0;
}

#include <iostream>
#include <cstring>

using namespace std;

int main()
{
char s[100], aux[100];
cin.getline(s,100);

int i=0;
int poz=-1;

while(i<strlen(s))
{
while(s[i]!=' ' && i<strlen(s))
i++;

if(poz>0 && s[poz-1]==s[i-1])

{

strcpy(aux," stilou");
strcat(aux, s+poz);
strcpy(s+poz,aux);
i=i+7; // atatea caractere are cuvantul stilou+ un spatiu
}
poz=i;
i++;
}

cout<<s;
return 0;
}

1)#include <iostream>
#include <cmath>
using namespace std;
void patrate(unsigned int x, unsigned int y)
{
unsigned int v[y]={0};
int nr=1;
int s=0;
for(int i=x;i<=y;i++)
{
if((int)sqrt(i)*(int)sqrt(i)==i)
{
v[nr]=i;
nr++;
s=s+i;
}
 }
if(nr!=1)
{
for(int i=1;i<nr-1;i++)
cout<<v[i]<<"+";

}
cout<<v[nr-1]<<"="<<s;
}
int main()
{
patrate(10, 50);
return 0;
}

2))#include <iostream>
#include <cstring>
using namespace std;

int main()
{
char s[100];

cin.getline(s,100);

if(s[0]>='a' && s[0]<='z')

s[0]=s[0]-32;

for(int i=1;i<strlen(s);i++)
{
if(s[i-1]==' ' && s[i]>='a' && s[i]<='z')
s[i]=s[i]-32;
else
if(s[i]>='A' && s[i]<='Z' && s[i-1]!=' ')
s[i]=s[i]+32;
}
cout<<s;
return 0;
}
3)) #include <iostream>
#include <fstream>

using namespace std;

ifstream fin("bac.txt");

int main()
{
int x,y,ap;
fin>>x;
ap=1;

while(fin>>y)
{
if(x==y)
ap++;
else
{
cout<<x<<" ";
 cout<<ap<<" ";
ap=1;

}
x=y;

}
cout<<y<<" "<<ap;
return 0;
}

1)))#include <iostream>

using namespace std;

int pdoi(unsigned int n)

{ int cp;

for(int i=n;i>=1;i--)
{ cp=i;
while(cp%2==0)
{
cp=cp/2;

}
if(cp==1)
return i;
}

int main()
{
cout<<pdoi(20);
return 0;
}

2)))#include <iostream>
#include <cstring>

using namespace std;

int main()
{
char s[100];
int ok=0;
cin.getline(s,100);

for(int i=strlen(s)-1;i>=0;i--)
{
if(strchr("aeiou",s[i]))
{ ok=1;
strcpy(s+i,s+i+1);
break;
}
}
 if(ok==1)
cout<<s;
else
cout<<"nu exista";
return 0;
}

3))#include <iostream>

using namespace std;

void putere(unsigned int n, unsigned int&d, unsigned int &p)

{

int pmin=99;
int div;
d=2;
int ok=0;
while(n>1)
{ p=0;
while(n%d==0)
{
p++;
n=n/d;
ok=1;
}
if(p<pmin && ok==1)
{ pmin=p;
div=d;
}
d++;
ok=0;
}

p=pmin;
d=div;
}

int main()
{
unsigned int d, p;

putere(10780,d ,p);
cout<<d<<" "<<p;
return 0;
}

4)))#include <iostream>

using namespace std;

int main()
{
int n,k,a[200][200];

cin>>n>>k;
int cop;
int i=1;
int poz=0;
 while(i<=n)
{
cop=i;

for(int x=1;x<=k;x++)
{
poz++;
for(int j=1;j<=n;j++)
{
a[poz][j]=cop;
cop++;
}
cop=i;
}
i++;
}

for(int i=1;i<=n*k;i++)
{
for(int j=1;j<=n;j++)
cout<<a[i][j]<<" ";
cout<<endl;
}
return 0;
}

1))#include <iostream>
using namespace std;

void pereche(int n)
{
int ok=0;

for(int a=1;a<=n/2;a++)
{
if(n%a==0 && a<n/a)
{
int b=n/a;
if((a%2==0 && b%2!=0) || (a%2!=0 && b%2==0))
{
cout<<"["<<a<<" "<<b<<"]"<<" ";
ok=1;
}

}
}
if(ok==0)
cout<<"nu exista";
}
int main()
{
pereche(9);

return 0;
}

2)))#include<iostream>
#include <cstring>
using namespace std;

int main()
{
char s[100];

cin.getline(s,100);

for(int i=0;i<strlen(s);i++)
{
if(s[i]=='-'&& s[i+1]>='0' && s[i+1]<='9')
{

strcpy(s+i,s+i+1);

}
}

cout<<s;
return 0;
}

3))#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("bac.txt");

int main()
{

int x=99999, y=99999 ,z=99999, nr;

while(fin>>nr)
{
if(nr%10==0 && (nr/10)%10==2)
{

if(nr<x)
x=nr;
int aux;
if(x<z)
{
aux=z;
z=x;
x=aux;
}

if(z<y)
{
aux=y;
y=z;
z=aux;
}
}
}
 cout<<y<<" "<<z<<" "<<x;

return 0;
}

1)))#include <iostream>

using namespace std;

void primMax(int n, int&d)

{
int div;

div=2;

while(n>1)
{
while(n%div==0)
{
n=n/div;
d=div;
}
div++;
}

int main()
{
int n, d;
cin>>n;
primMax(n,d);
cout<<d;

return 0;
}
2))))#include <iostream>
#include <cstring>

using namespace std;

int main()
{
char s[100],*p;
cin.getline(s,100);

int v,c;

p=strtok(s," ");
int total=0;
while(p!=NULL)
{
v=c=0;
for(int i=0;i<strlen(p);i++)
if(strchr("aeiou",p[i]))
v++;
 else
c++;

if(v==c)
total++;
p=strtok(NULL, " ");
}
cout<<total;
return 0;
}

3))))#include <iostream>
#include <fstream>

using namespace std;

ofstream fout("bac.txt");

int main()
{
int p1, p2;
cin>>p1>>p2;

for(int i=1;i<=p1;i++)
{
if(p1%i==0 && i<10 && p1/i<10)
{

for(int j=1;j<=p2;j++)
{

if(p2%j==0 && j<10 && p2/j<10 && j<p2/j)

for(int k=0;k<=9;k++)
{
fout<<i<<p1/i<<k<<k<<k<<j<<p2/j<<endl;
fout<<i<<p1/i<<k<<k<<k<<p2/j<<j<<endl;
}
}

}
}

return 0;
}

v16
s3
1)#include <iostream>

using namespace std;

int nrdiv(int n)
{
int nr=0;
int exp=0;
int d=2;
 while(n>1)
{
while(n%d==0)
{
exp++;
n=n/d;
}
if(exp%2)
nr++;
exp=0;
d++;
}
return nr;
}
int main()
{
int n;
cin>>n;
cout<<nrdiv(n);

return 0;
}

2))#include <iostream>

using namespace std;

int main()
{
int a[100][100],d,n,m;
cin>>n>>m;
d=1;
for(int i=n;i>=1;i--)
for(int j=m;j>=1;j--)
{
while((d*d)%2==0)
{
d++;
}
a[i][j]=d*d;
d++;
}

for(int i=1;i<=n;i++)
{for(int j=1;j<=m;j++)
cout<<a[i][j]<<" ";
cout<<endl;
}
return 0;
}

3)))#include<iostream>
#include<fstream>

using namespace std;

ifstream fin("bac.txt");

int a[10000],b[1000],v[10000];
int main()
{
int n,m,maxi;
fin>>n>>m;

for(int i=1;i<=n;i++)
fin>>a[i];

for(int j=1;j<=m;j++)
fin>>b[j];
if(n>m)
maxi=n;
else
maxi=m;

int nr;
if(a[1]>b[1])
nr=b[1];
else
nr=a[1];

int finall;

if(a[n]>b[m])
finall=a[n];
else
finall=b[m];

for(int i=1;i<=maxi;i++)
{
if(i<=n)
v[a[i]]++;
if(i<=m)
v[b[i]]++;
}

cout<<nr<<" ";
for(int i=1;i<=finall;i++)
{
if(v[i]!=0)
if((nr%2==0 && i%2!=0 && nr<i) || (nr%2!=0 && i%2==0 && nr<i))
{
cout<<i<<" ";
nr=i;
}
}

return 0;
}

v17
#include <iostream>

using namespace std;

int cif(int n)
{
int c,cmax;
cmax=-1;
while(n)
 {
c=n%10;
if(c%2)
if(c>cmax)
cmax=c;
n=n/10;
}
return cmax;
}

int main()
{
int n;
cin>>n;
cout<<cif(n);
return 0;
}

2)) metoda 1
#include <iostream>
#include <cstring>

using namespace std;

int main()
{
char s[101],m[202],*p;
cin.getline(s,101);

p=strtok(s," ");

int poz=0,n,c;

while(p)
{ c=0;
n=strlen(p)-1;

for(int i=0;i<n;i++)
if(strchr("aeiou",p[i]))
c++;

strcat(m,p);
strcat(m," ");
if(c==n)
{
strcat(m,p);
strcat(m," ");
}

p=strtok(NULL, " ");

}
cout<<m;

return 0;
}
T18
#include <iostream>
#include <cstring>

using namespace std;

int main()
{
int n,k;
cin>>n>>k;

char a[21][21],s[21],aux[21];

for(int i=1;i<=n;i++)
{
cin>>s;
strcpy(a[i],s);
}
int c;
strcpy(s,a[k]);
int ok=0;
for(int i=1;i<=n;i++)
{
if(i!=k)
{
c=strlen(a[i])-strlen(s);
if(c>0)
{

strcpy(aux,a[i]+c);
if(strcmp(aux,s)==0)
{
cout<<a[i]<<endl;
ok=1;
}
}
}
}
if(ok==0)
cout<<"NU EXISTA";
return 0;
}

3)#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("bac.txt");
int main()
{
int x,l=0,lmax=0,tot=0;

while(fin>>x)
{
if(x%10==0)
l++;
else
l=0;
 if(l>lmax)
{
lmax=l;
tot=1;
}
else
if(l==lmax)
tot++;
}

cout<<lmax<<" "<<tot;
return 0;
}