Crowdly
Add to Chrome
Course 413
Looking for Course 413 test answers and solutions? Browse our comprehensive collection of verified answers for Course 413 at else.fcim.utm.md.
Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!
struct S { int x; int y; };
int main()
{
struct S A = {4,6};
struct S *p = &A;
printf("%d %d", (*p).x++, - --(*p).y);
return 0;
}
std::deque < int > dq; dq.push_back(4); dq.push_back(6); dq.clear(); std::cout << dq.front();
std::list < int > lst = {3, 1, 2, 2}; lst.sort(); lst.unique(); lst[1] = 5; lst.push_back(9); for (int x : lst) std::cout << x << " ";
struct S {
int x;
int y;
};
int main()
{
struct S A = {2,2};
struct S *p = &A;
while(p->y>0)
break;
printf("%d %d", --p->y, --p->y);
return 0;
}
struct S {
int S;
int a;
} ;
struct s {
struct S S;
int a;
} S,s ;
int main()
{
printf("%d %d ",S.S.S++,- --S.S.a);
return 0;
}
std::stack
st;st.push(7);
st.pop();
st.pop();
std::cout << st.empty();
struct S { int a; struct S *b; struct S *prev; };
struct S *x = malloc(sizeof(struct S));
struct S *y = malloc(sizeof(struct S));
struct S *z = malloc(sizeof(struct S));
x->b = y; x->prev = z;
z->a = 22; z->b = x; z->prev = y;
y->a = 33; y->b = z; y->prev = x;
printf("%d", x->b->b->b->a);
std::queue < int > q;
q.push(6);
q.push(3);
q.push(4);
if(q.front() == 6)
{
q.pop();
q.pop();
}
else
{
q.push(1);
}
std::cout << q.front();