Programare cu C++ avansat 3

Cum declaram un vector cu 10 elemente?

• int[10] v;

• int v={0,1,2,3,4,5,6,7,8,9};

• int v[];

• int v[10];

Pentru sirul respectiv care potriveste?

int v[10]={3, 7, 5, 2, 9, 1, 4, 6, 0, 8};

• 11

• cout<<v[0]+v[9];

• 3 5 9 4 0

• for(i=9; i>=0; i-=2)

  cout<<v[i]<<" ";

• 2

• cout<<v[1];

• 8 6 1 2 7

• cout<<v[ v[0] ];

• 7

• for(i=0; i<10; i+=2)

  cout<<v[i]<<" ";

Gasiti ordine

• for(i=0; i<n; i++) {

  if(v[i]>v[n-1])

  s+=v[i]; }

  cout << s; }

• for(i=0; i<n; i++)

  cin >> v[i];

• int v[10];

  int main() {

• int n, s=0;

• cin >> n;

int v[10]={0,1,2,3,2,5,1,6,3,8};

Care sorteaza toate elementele din sirul v in ordine crescatoare

• sort(v);

• sort(v+10);

• sort(v, v+10);

• sort(v, v+9);

Care potriveste?

• sqrt(a)

• #include <iostream>

• sort(v, v+n);

• #include <fstream>

• cout << "Test";

• #include <algorithm>

• ifstream fin("file.in");

• #include <cmath>

care se verifica daca sirul v[n] este un sir palindrom?

• int cnt=0, i;

  for(i=0; i<n; i++) {

  if(v[i]==v[i+1])

  cnt++; }

  if(cnt==n)

  cout << "Da";

• int cnt=0, i;

  for(i=0; i<n; i++) {

  if(v[i]==v[n-i-1])

  cnt++; }

  if(cnt==n)

  cout << "Da";

• int cnt=0, i;

  for(i=0; i<n/2; i++) {

  if(v[i]!=v[i+1])

  cnt++; }

  if(cnt==0)

  cout << "Da";

• int cnt=0, i;

  for(i=0; i<n/2; i++) {

  if(v[i]!=v[n-i-1])

  cnt++; }

  if(cnt==0)

  cout << "Da";

int v[10]={60, 23, 102, 25, 33, 47, 204, 102, 20, 17};

Care potriveste?

• 3

• for(i=1; i<10; i++)

  if(v[i]%2==v[i-1]%2)

  cnt++;

• 1

• for(i=0; i<10; i++)

  if(v[i]%2==0)

  cnt++;

• 4

• for(i=1; i<10; i++)

  if(v[i]>v[0])

  cnt++;

• 5

• for(i=0; i<5; i++)

  if(v[i]==v[9-i])

  cnt++;

Gasiti ordine

• while(cin>>a) {

  if(ciur[a]==0)

  cnt++; }

• bool ciur[1000005];

  int main() {

  int n, a, cnt=0, i, j;

• cout << cnt;

• ciur[0]=ciur[1]=1;

  for(i=2; i*i<=n; i++){

  if(ciur[i]==0) {

  for(j=i*i; j<=n; j+=i){

  ciur[j]=1; }

Ce face programul respectiv?

int v[10]={2, 3, 1, 4, 5, 7, 11, 14, 7, 8};

int main() {

for(int i=0; i<5; i++) {

temp = v[i]; v[i]=v[9-i]; v[9-i]=temp; }

}

• Se verifica daca vectorul v este palindrom.

• Se inverseaza tot vectorul.

• Se verifica daca toate elementele sunt egale

• Se verifica numere palindrome in vector

int v[10]={5, 3, 7, 11, 8, 34, 2, 4, 1, 7};

Care se potriveste?

• sort(v+n/2, n);

• sort crescator tot vectorul

• sort(v, v+n, greater<int>() )

• sort primul jumatate in ord cresc

• sort(v, v+n/2);

• sort descrescator tot vectorul

• sort(v, v+n);

• sort tot vectorul in afara de primei ultimei elemente in ord cresc

• sort(v+1, v+n-1);

• sort al doilea jumatate in ord cresc