Pagini recente » Cod sursa (job #2312772) | Cod sursa (job #3139527) | Cod sursa (job #227304) | Cod sursa (job #2975202) | Cod sursa (job #3254109)
#include <iostream>
using namespace std;
int v1[101];
int v2[101];
void inmultire(int &n,int v[])
{
int i,c;
for(i=1;i<=n/2;i++)
swap(v[i],v[n-i+1]);
c=0;
for(i=1;i<=n;i++)
{
c=c+v[i]*2;
v[i]=c%10;
c=c/10;
}
if(c!=0)
{
n++;
v[n]=c;
}
for(i=1;i<=n/2;i++)
swap(v[i],v[n-i+1]);
}
void impartire(int &n,int v[])
{
int i,c=0;
for(i=1;i<=n/2;i++)
swap(v[i],v[n-i+1]);
for(i=n;i>=1;i--)
{
c=c*10+v[i];
v[i]=c/2;
c=c%2;
}
if(v[n]==0)
n--;
for(i=1;i<=n/2;i++)
swap(v[i],v[n-i+1]);
}
void scadere(int a,int x[], int b,int y[])
{
int i;
for(i=1;i<=a/2;i++)
swap(x[i],x[a-i+1]);
for(i=1;i<=b/2;i++)
swap(y[i],y[b-i+1]);
for(i=b+1;i<=a;i++)
y[i]=0;
int c=0;
for(i=1;i<=a;i++)
{
x[i]=x[i]-y[i]-c+10;
c=1-x[i]/10;
x[i]%=10;
}
}
int sunt(int a,int x[],int b,int y[])
{
if(a>b)
return 1;
if(a<b)
return -1;
for(int i=1;i<=a;i++)
{
if(x[i]>y[i])
return 1;
if(x[i]<y[i])
return -1;
}
return 0;
}
int main()
{
int n,i,m;
cin>>n;
for(i=1;i<=n;i++)
cin>>v1[i];
cin>>m;
for(i=1;i<=m;i++)
cin>>v2[i];
while(v1[n1]%2==0 and v2[n2]%2==0)
return 0;
}