How can write program databas for students. avrge and Gender؟؟
You need to have a specific structure of your file
Like organizing it as
studentNumber
studentName
Subject1
Subject2
MᏫᎻᎯᎷᎷᎬᎠ
MᏫᎻᎯᎷᎷᎬᎠ
Then
You get the average by summing the students results and dividing it by the number of Students
gallo
V
عزة
You need to have a specific structure of your file
Like organizing it as
studentNumber
studentName
Subject1
Subject2
yas of course added to Gender and average ..
عزة
Dima
mac users says same about xcode
It was good at some point back then, now it’s retarded on powerful Mac 💻 too
Roh
Hi
Anonymous
Hello
I_Interface
It was good at some point back then, now it’s retarded on powerful Mac 💻 too
So go for more powerful Windows. :D
Anonymous
Actually I have a problem in C
Anonymous
Anybody help me
Anonymous
Anonymous
Please
数学の恋人
ask the problem first
Anonymous
Actually I don't know how to make programmes in computer
数学の恋人
ask what you want to know
数学の恋人
don't ask meta questions
Anonymous
Read it
数学の恋人
😂
数学の恋人
I'm not gay
Anonymous
can anyone create group for java men?
Roxifλsz 🇱🇹
Roxifλsz 🇱🇹
I didn't know Dima is a miss
Anonymous
Actually I don't know how to make structure and flow chart
Anonymous
C++ courses videos if any one have
bary
Anyone here preparing for placement? And what is the strategy being followed for product based companies
olli
Why x++ is not considered?
It is evaluated, otherwise y would not be 12. Using a comma operator the expression on the left is discarded
"The left operand of a comma operator is evaluated as a void expression" [n1570, 6.5.17]
数学の恋人
数学の恋人
Harsh
/warn
Anonymous
Hello
Dima
Yes I am
Ибраги́м
https://thephd.github.io/full-circle-embed
Anonymous
hi, everybody
Anonymous
glad to meet you.
Кто-то
Hello, how can i delete duplicate in std::list of structures?
My struct: struct Vec { double x, y, z; };
My list: std::list<Vec> points;
Dima
Dima
Just google “std collection remove distinct”
Dima
I am so drunk I can’t help ya
Кто-то
i wrote this code, but it doesn't work
for (auto it = points.begin(); it != --points.end(); ++it)
{
auto it2 = ++it;
while (it2 != points.end())
{
if (it->x == it2->x && it->y == it2->y && it->z == it2->z)
it2 = points.erase(it2);
else
++it2;
}
}
Pavel
i wrote this code, but it doesn't work
for (auto it = points.begin(); it != --points.end(); ++it)
{
auto it2 = ++it;
while (it2 != points.end())
{
if (it->x == it2->x && it->y == it2->y && it->z == it2->z)
it2 = points.erase(it2);
else
++it2;
}
}
"doesn't work" is not clear enough definition.
Why do you do --points.end()? What's the meaning of this?
Pavel
I'm not sure that behavior of decrement operator is specified for end() of a list.
Кто-то
how i think it's a previous pointer before the end
Pavel
Ok, SO telling that this is ok https://stackoverflow.com/questions/5322104/how-portable-is-end-iterator-decrement
Pavel
Unless the list is empty
Pavel
auto it = ++it;
I think you increment it twice per iteration
Pavel
Or is it intended like that?
Кто-то
it's my mistake
Кто-то
I've changed it but it's not still working
auto end = points.end();
--end; --end;
for (auto it = points.begin(); it != end;)
{
auto it2 = ++it;
while (it2 != points.end())
{
if (it->x == it2->x && it->y == it2->y && it->z == it2->z)
it2 = points.erase(it2);
else
++it2;
}
}
Pavel
I've changed it but it's not still working
auto end = points.end();
--end; --end;
for (auto it = points.begin(); it != end;)
{
auto it2 = ++it;
while (it2 != points.end())
{
if (it->x == it2->x && it->y == it2->y && it->z == it2->z)
it2 = points.erase(it2);
else
++it2;
}
}
I see one more problem (except that you keep saying "not working" without providing what exactly is going wrong).
Your it and it2 are equal at the start of each iteration. Because you increment it when set it2.
You should set it2 = it and then increment it2 only. And increment it at the and of the iteration (or better in the loop expression, as it was before)
Pavel
Ah, hard to explain something with such a variable name in the context :)
Javi
Hello, how can i delete duplicate in std::list of structures?
My struct: struct Vec { double x, y, z; };
My list: std::list<Vec> points;
You can convert it to a set and back to a list
Кто-то
i've finally do it:
for (auto it = points.begin(); it != prev(points.end()); it++)
{
auto it2 = next(it);
while (it2 != points.end())
{
if (it->x == it2->x && it->y == it2->y && it->z == it2->z)
it2 = points.erase(it2);
else
++it2;
}
}
Dima
i've finally do it:
for (auto it = points.begin(); it != prev(points.end()); it++)
{
auto it2 = next(it);
while (it2 != points.end())
{
if (it->x == it2->x && it->y == it2->y && it->z == it2->z)
it2 = points.erase(it2);
else
++it2;
}
}
Looks like a very high complexity