Scribd
Upload
80 views6 pages

Tema Dimofte Denisa

The document contains C++ code for reading input from a file, performing operations on arrays, and writing output to a file. The code includes multiple arrays (a, b, c) of size 100, nested for loops to iterate through the arrays, and if/else conditional statements. The main operations include sorting arrays, removing elements that meet certain criteria, and merging arrays together.

Uploaded by

Denisa Georgiana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
80 views6 pages

Tema Dimofte Denisa

The document contains C++ code for reading input from a file, performing operations on arrays, and writing output to a file. The code includes multiple arrays (a, b, c) of size 100, nested for loops to iterate through the arrays, and if/else conditional statements. The main operations include sorting arrays, removing elements that meet certain criteria, and merging arrays together.

Uploaded by

Denisa Georgiana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd

///1

#include <fstream>
#include <cmath>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int a[100],b[100],c[100], n, i, j, x, nr,d,m;
int main()
{
f>>n;
m=n;
for(i=1; i<=n; i++)
{
f>>a[i];
b[i]=a[i];
} /*
for(i=1; i<=n; i++)
if(int(sqrt(b[i]))==sqrt(b[i]))
{
for(j=i; j<n; j++)
b[j]=b[j+1];
n--;
i--;
}
for(i=1; i<=n; i++)
g<<b[i]<<" ";
g<<endl;
for(i=1; i<=n; i++)
b[i]=a[i];
for(i=1; i<=n; i++)
{
x=b[i];
nr=0;
for(d=1; d<=x; d++)
if(x%d==0)
nr++;
if(nr==2)
c[i]=1;
else
c[i]=0;
}
for(i=2;i<=n;i++)
if(c[i-1]==1)
b[i]=-2;
for(i=1;i<=n;i++)
if(b[i]!=-2)
g<<b[i]<<' ';
g<<endl;
for(i=1; i<=n ;i++)
b[i]=a[i];
for(i=2; i<n; i++)
{
if(a[i-1]%2==0 && a[i+1]%2==0)
{
b[i]=-1;
}
}
for(i=1; i<=n; i++)
if(b[i]!=-1)
g<<b[i]<<" ";
for (i=1;i<n;i++)
if(a[i+1]%3==0)
{
for(j=i;j<n;j++)
a[j]=a[j+1];
n--;
i--;

}
for(i=1;i<=n;i++)
g<<a[i]<<" ";
*/
int x1,x2,x3;
for(i=1;i<=n;i++)
{
x1=0;
x2=1;
while(x1+x2<a[i])
{
x3=x1+x2;
x1=x2;
x2=x3;
}
if(x1+x2==a[i])
{
for(j=i;j<n;j++)
a[j]=a[j+1];
n--;
i--;
}
}
for(i=1;i<=n;i++)
g<<a[i]<<" ";
return 0;
}

///2
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int a[100],n,i,j,x,y,max,p,aux;
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>a[i];
/*
for(i=1;i<=n;i++)
{
n++;
for(j=n;j>i+1;j--)
a[j]=a[j-1];
a[i+1]=100;
i++;
}
for(i=1;i<=n;i++)
g<<a[i]<<" ";*/
/*
for(i=1; i<=n; i++)
{
x=a[i];
max=0;
while(x)
{
if(x%10>max)
max=x%10;
x=x/10;
}
n++;
for(j=n; j>i+1; j--)
a[j]=a[j-1];
a[i+1]=max;
i++;
}
for(i=1;i<=n;i++)
g<<a[i]<<" ";*/
/*
for(i=1; i<n; i++)
{
x=a[i];
y=a[i+1];
while(x!=y)
if(x>y)
x=x-y;
else
y=y-x;
n++;
for(j=n; j>i+1; j--)
a[j]=a[j-1];
a[i+1]=x;
i++;
}
for(i=1; i<=n; i++)
g<<a[i]<<" ";*/
/*for(i=1;i<=n;i++)

{
int p1,p2;
p1=1;p2=1;
x=a[i];
y=a[i+1];
while(x)
{
p1=p1*10;
x=x/10;
}
while(y)
{
p2=p2*10;
y=y/10;
}
x=a[i]*p2+a[i+1];
y=a[i+1]*p1+a[i];
n++;
for(j=n;j>i+1;j--)
a[j]=a[j-1];
a[i+1]=max(x,y);
i++;

}
for(i=1;i<=n;i++)
g<<a[i]<<" ";

}*/

/*for(i=1; i<=n; i++)


{
n++;
for(j=n+1; j>i; j--)
a[j]=a[j-1];
a[i]=777;
i++;
}
for(i=1; i<=n; i++)
g<<a[i]<<" ";
}
*/
/* for(i=1;i<=n;i++)
{
p=1;
aux=a[i];
while(aux)
{
p=p*(aux%10);
aux=aux/10;
}
for(j=n+1;j>i;j--)
a[j]=a[j-1];
a[i]=p;
i++;
n++;

}
for(i=1; i<=n; i++)
g<<a[i]<<" ";
}
*/

///3
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int a[100],b[100],i,n,k,c[100];
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
f>>b[i];
k=0;
for(i=1;i<=n;i++)
{

c[++k]=a[i];
c[++k]=b[i];
}
for(i=1;i<=k;i++)
g<<c[i]<<" ";
return 0;
}

///1
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int a[10][10],m,n,i,j,k;
int main()
{
f>>n>>m;
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
f>>a[i][j];

for(j=1; j<=m; j++)


{

for(k=n+1; k>n/2; k--)


a[k][j]=a[k-1][j];
a[k+1][j]=0;
}
n++;
for(i=1; i<=n; i++)
{
for(k=m+1; k>m/2; k--)
a[i][k]=a[i][k-1];
a[i][k+1]=0;

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

///2
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int a[10][10],m,n,i,j,k;
int main()
{
f>>m>>n;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
for(i=m/2+1;i<m;i++)
for(j=1;j<=n;j++)
a[i][j]=a[i+1][j];
m--;
for(j=n/2;j<n;j++)
for(i=1;i<=m;i++)
a[i][j]=a[i][j+1];
n--;
for(i=1;i<=m;i++)
{
for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<endl;
}

You might also like