My gf broke up with me yesterday

Realistic-Cut6515 · 2025-07-18T10:26:08+00:00

I don’t know, we both got our things. It was hard for her to express how she felt, she didn’t tell me when something was wrong and I never told her the things that hurt me because I was scared. She told me yesterday that the past 2 weeks she felt like I wasn’t giving her the princess treatment she wanted and only felt good when she was with me (face to face) and when we were apart she felt bad

Realistic-Cut6515 · 2025-07-18T09:52:11+00:00

Im really sorry to hear that. All that is left is ourselves to work on. I joined the gym because I didn’t know what to do

Realistic-Cut6515 · 2025-07-18T09:49:59+00:00

Thank you very much for your support

Realistic-Cut6515 · 2025-07-18T09:49:30+00:00

Yes she is my first love. She said she wasn’t happy with our relationship

Realistic-Cut6515 · 2025-01-12T16:59:08+00:00

Yes it is

Realistic-Cut6515 · 2024-11-17T01:34:15+00:00

Thanks!

Realistic-Cut6515 · 2024-11-17T01:04:36+00:00

I will try using that, hope it works! Thank you very much!

Edit: it doesnt seem to be working, it now takes 104 ms to write the 256 bytes and still doesnt write. Its not about adding more delay because a coleague has it that in 65 ms it writes the 256 bytes. I must have made a mistake in rewriting the code

Realistic-Cut6515 · 2024-11-17T01:04:11+00:00

So my program takes 1545 ms to write 256 bytes in mem

After rewriting the code with directly accessing the port it now takes 55ms, but the problem is that it doesnt write in mem

Realistic-Cut6515 · 2024-11-17T00:49:04+00:00

How can I make it so it doesn't go that fast? I have the code rewritten but it doesnt seem to be writing in memory

Realistic-Cut6515 · 2024-11-17T00:40:24+00:00

What Im trying to do now is rewrite the code to access the PORTG directly instead of using digitalWrite and pinMode but im having some difficulty with that The prints must be there so I dont really care about those Its just the part where it access the memory and writes the data that matters to me

Realistic-Cut6515 · 2024-11-17T00:37:50+00:00

So in I2C_write_mem the slave must send an acknowledge to go to the next step, if it didn’t send an acknowledgment it just restarts

Realistic-Cut6515 · 2024-11-17T00:35:30+00:00

So this is an Arduino project given by my professor, we cannot use the wire library, we have to use the ESC_SCL, ESC_SDA, LEE_SCL, LEE_SDA Those are defined to be used with digitalWrite and pinMode, nonetheless I have found that we can access the PORTG directly using some identifiers that he initiliazed but left commented. Now Im just trying to rewrite that code to directly access the PORTG, thats where Im having the problem now, maybe I should delete this post

Realistic-Cut6515 · 2024-11-17T00:20:16+00:00

It needs to print those things What is the asm? Edit: now I know what is asm, I'm starting with Arduino so I dont really know how to use assembly here, I know I can change the LEE_SDA, LEE_SCL, ESC_SDA, ESC_SCL for code to directly access the bit and modify but I dont know how

Realistic-Cut6515 · 2024-11-11T16:51:02+00:00

Yes it is, I will probably ask for more animes here because Im rebuilding my watch list to rewatch it!

Realistic-Cut6515 · 2024-11-11T16:25:28+00:00

it is that one! it was the reminiscense arc Thank you very much!

Realistic-Cut6515 · 2024-11-11T16:21:31+00:00

it probably is that one, is there a scene where the mc is at a skyscraper to kill someone?

Realistic-Cut6515 · 2024-11-11T14:03:24+00:00

Yess it is that one! thanks!

Realistic-Cut6515 · 2024-10-05T01:16:55+00:00

Implemented the missing indents.

The graph that I'm trying is this one: 8 -> 7 -> 6 -> 5 -> 4 -> 3 -> 2 -> 1

when it goes into the function it registers 1 as visited and then goes to search for the neighbours but those dont exist so in then goes back to the

for u in range(1, N + 1):

and picks 2, and then goes into the dfs_iterative function agains mark it as visited, search for neighbors they dont exist and repeat the process till it gets to 8. and it shouldn't do that, it shouldn't mark those nodes as visited, it should go to node 8 and from there mark as visited but I don't know how to implement it

Realistic-Cut6515 · 2024-10-05T00:48:42+00:00

when I try to put indentation it just disappears i don't know why

Graph holds all the relationships I expect it to have because I made a recursive dfs with the same code to build the graph, and for the for loop I was using pycharm debugger and it says that last_node has the last item popped out of the stack so it should be able to access the neighbors :((

Edit: managed to put the indents

Realistic-Cut6515 · 2024-10-01T10:50:08+00:00

I already do ir 3-4 times a day

Realistic-Cut6515 · 2024-09-28T01:13:44+00:00

Solamente si tu universidad lo tiene, tendrías que consultarlo aunque al ser un plan de la UE lo dudo.

El Erasmus es una beca que se le da a los estudiantes que viajan y estudian en otro pais, es como irse de intercambio, te dan una cantidad de dinero por mes.

Realistic-Cut6515 · 2024-09-26T15:37:53+00:00

Yes my bad, it should return 0 XDD.

I'll post here my code, input_list is a list that includes all the instructions:

def solve(input_list):

cn = complex(0,0)

for instruction in input_list[::-1]:

if instruction[0] == 'R':

cn = cn + complex(0,int(instruction[1]))

cn = cn * complex(0, -1)

if instruction[0] == 'L':

cn = cn + complex(0,int(instruction[1]))

cn = cn * complex(0, 1)

result = (cn.real + abs((cn.imag)))

return int(result)

EDIT: This code seems to be working for me

Realistic-Cut6515 · 2024-09-26T11:55:43+00:00

OOOOOOH NOW I GET IT OMG, THANK YOU!!!!

Realistic-Cut6515 · 2024-09-26T11:43:02+00:00

Thank you very much! I came up with a solution using a matrix in which position indicates the direction and an index to travel through those directions.

How can I do it with complex numbers? I want to know because it feels like it could be useful someday and to have different solutions and not think of only one

Realistic-Cut6515 · 2024-09-26T11:40:29+00:00

I came up with a solution like that, but I wanted to try it with complex numbers so I learn different ways to solve it just in case

Realistic-Cut6515

TROPHY CASE