i am no programer dima

pat pat

I've used OpenGL, SFML and Unity, and I've learnt the most with SFML than any other. OpenGL is too low level, and Unity is too high level

ive used from unity to opengl, spent probably most time with opengl... (but haven't got far because i am shit)

I've used Vulkan to create my own engine. It's by far the most challenging but fun way!

And you learn a lot of weird stuff like tan(x) is just sin(x) / cos(x)

C'mon, you don't really need to do graphics to learn that hahaha

https://pastebin.com/MPggrghh

I dont understant ...

but it cant be constant because I need to calcule the size of the array first

Check if count can be more than DIM_MAP

ill give him a text

ey you have a email address @sitischu.com oh wait you are in all the devs groups too

yes

i didn't see that lol

And you learn a lot of weird stuff like tan(x) is just sin(x) / cos(x)

Answer is -3 how

Can anyone help me with the numbering from 11 to 19?#include <iostream> using namespace std; int main() { int row; int nasterisk; cout << "Line" << "\t\t" << "Asterisk" << endl; for(row=1;row<=10;row++) { cout << row << "\t\t"; for (nasterisk=1;nasterisk<=row;nasterisk++) { cout << "*"; } cout << endl; } for (row=10;row>1;row--) { cout << "\t\t"; for (nasterisk=1;nasterisk<row;nasterisk++) { cout << "*"; } cout << endl; } return 0; }

Given two non-negative integers A and B, and limits X and Y,find the smallest integer Z which lies between X and Y such that (A&Z).(B&Z) is maximum possible. &=Bitwise Can anyone help me in this

Do you want us to write the code for you?

Hint

Use loop and if/else

Am new to c programming and I need a guide

void mult_mat(int mat1[][SIZE], int mat2[][SIZE], int result_mat[][SIZE]) { int i, j, k; for (i = 0; i < SIZE; i++) { for (j = 0; j < SIZE; j++) { for (k = 0; k < SIZE; k++) { result_mat[i][j] = (result_mat[i][j]) | (mat1[i][k]) & (mat2[k][j]); printf("%d", result_mat[i][j]); } } } }