Professional Documents
Culture Documents
int main()
{
int n = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
int maks = a[0];
for (int i = 0; i < n; i++)
{
if (a[i] > maks)
{
maks = a[i];
}
}
cout << maks;
}
2.
int main()
{
int n = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
int brojac = 0;
for (int i = 0; i < n; i++)
{
if (a[i] * a[i + 1] < 0)
{
brojac++;
}
}
cout << brojac;
3.
int n = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
}
}
4.
int n = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
int pos = a[0];
int n = 0;
int k;
cin >>k;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
int pos = a[0];
6.
int n;
cin >>n;
int b[2*n];
int a[n];
for(int i =0;i<n;i++)
{
cin >> a[i];
}
for(int i =0;i<2*n;i++)
{
b[i]=a[i];
7.
int n = 0;
int k=0;
cin >> n;
int a[n];
int b[k];
8.
int n = 0;
cin >>n;
int a[n];
int mina=abs(a[1]-a[0]);
for (int i = 0; i < n-1; i++)
{
if(abs(a[i]-a[i+1]<mina))
{
mina =abs(a[i]-a[i+1]);
}
}
cout << mina;
9.
10.
int n = 0;
cin >> n;
int a[n];
int b[n];
int k =1;
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
for (int i = 0; i < n; i++)
{
b[i]=a[i]+a[n-k];
k++;
cout << b[i] << " ";
}
11.
int n = 0;
cin >> n;
int a[n];
int b[n];
int k =1;
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
for (int i = 0; i < n; i++)
{
b[i]=a[i]+a[n-k];
k++;
cout << b[i] << " ";
}
12.
int n = 0;
cin >> n;
int a[n];
}
int prv = a[n-4];
for (int i = n-4; i >= 0; i--)
{
a[i]=a[i-4];
}
a[0]=prv;
for(int i =0;i<n;i++)
{
cout << a[i];
}