classmates | A social website based on Laravel | Blog library

I have a database with all the students of a school, the year of each class and the class number. As you need to go to school for 5 years in my country, each student has 5 lines with his name in this database, but with each time different class so the line is not the same.

I want SQL to select classmates in my database. All classes are composed with different classmates but you can be two year in a row with the same classmate.

I want to know if a student has been in the same class with student 1 and student 2 but not at the same time. If a student has been with student 1 in year 1 and with student 2 in year 3 it is ok, like this is a common student. In the picture the correct answer is Lucien Lake.

I tried this code, but it does not work because it only tells me all the students for student Paul Biloux.

I am creating a website for my school coding class using Adobe Dreamweaver, but I have run into an issue.

I have two articles and am trying to get them inline. They are both set to block, and I know that they should be inline-block elements, but setting it to that causes a problem.

I have a navigation bar above these two articles, and if I make these articles inline-block elements, it makes the navigation bar disappear. I don't know why this is happening, and have tried asking my teacher and classmates for help, but can't find a solution. Here is an image of what it looks like with both articles as block elements:

This is what it looks like when they are inline-block elements:

I want the articles to be together, as shown in the second image, but I still want to keep my navigation bar. Note that the navigation bar is styled with 'position:fixed', so that it always stays at the top of my page. I also want to keep this, but I feel as though it may be the cause for my problem. Here is a snippet of the code which I made (sorry if it doesn't work properly, and that the images don't work)

I have a node.js project that uses dotenv for secrets (API keys, db config/login/pass).

I didn't think about this when I was building it, but it needs to be hosted on my school's engineering server for grading and sharing with classmates instead of on Heroku where I would usually host.

If it were Heroku, I could store the env variables there no problem, but on my school server, the .env file will just be out there to everyone.

So my question is: Is there a way to host on a public server without exposing the .env file?

Good afternoon. I need to enter an integer and determine whether there are two identical numbers which are located fairly close to each others( standing side by side). For instance, my input is "1224" and the output is "YES". Or my input is "1256" and the output is "NO". I tried to do it like that:

I was taught about the ORDER BY clause in SQL for sorting queries. I only learned about using the column name or expression, but after looking in the MariaDB help reference for SELECT, I see this:

So I have this question from my professor, and I can not figure out why vector2 is faster and has less cache misses than vector1.

Assume that the code below is a valid compilable C code.

Vector2:

So I have been trying to manipulate a dataset using data.table. Like in STATA, I wanted to categorise my factors using their values and not labels. I feel this is much safer for when working with categorical variables that have very strange labels with lots of spaces.

So far I have not been able to do this in R. Is this even possible or am I missing something?

I have attached a dummy code to recreate this issue.

My brother is a medical student and he came to me with a problem. He and 3 of his classmates have to rotate between two hospitals, say H1 and H2.

• H1 has a morning shift and a night shift. The morning shift is the most demanding one, so two people have to be there for it. The night shift can be covered by one person, this person would then take the rest of the following day off.

• H2 only has a morning shift and can be covered by a single person

I'm trying to solve this problem by looking it as a permutation of the following events:

• H1 morning shift (H1_M)
• H1 night shift (H1_N)
• H2 shift (H2)
• Rest day (R)

These events would have the following restrictions:

• No 24 hour shifts, so H1_N cannot follow H1_M
• A rest day always follows the night shift, so R always goes after H1_N
• 1 student is always on his rest day except on the first day, otherwise there is no solution

The problem is how to create 4 schedules, one for each student, which fulfill the two requirements above.

I've created sequences of events which follow the rules set above,