Thanks for this useful information.

Can online help me out with this problems 🙄#include<stdio.h> int main() { int i,j,k; for(i=1,j=0,k=3;i<=5,j<=6,k>1;i++,j++,k--); { printf("%d\n%d\n%d\n",i,j,k); } return 0; }

It'll be better if you tell us what you plan to do so we might be able to tell you what you could use and get similar or same results.

I was trying to print address of file opened in the RAM only you cleared it but I found @lightness_races_in_orbit also useful which cleared my other doubt. Again Thank you for asking.

Why do you need the location of the data stored in the RAM? If you just want to get the data, you can open all the different files using stream.

I was just practicing pointers and had doubt about this so i asked about it nothing special.

Your for loop has a semicolon after it. So it has no body. Now the condition expression for your for loop is i<=5,j<=6,k>1 Since these are separated by commas, the value of this expression will be the value of the expression k>1. So the expression i++,j++,k-- will be executed till k=1 after which the for loop will terminate. At this stage, i will be 3, j will be 2 and k will be 1 which will be printed out by your printf statement.

The explicit conversion in the case when a is 67 and b is 65 will lead to Undefined Behavior by the way as signed integer overflow is UB according to the standards.

int (*ptr)[3][3]=&arr; int(*p)[3]=(int(*)[3])ptr; Could someone tell me what does it mean?

tnx 👍 I just read about that. And I thought it just wraps around..

I am assuming that arr is defined as int arr[3][3]; ptr is a pointer to a 2 dimensional (there are actually no dimensions in memory) int array i.e. a 3 by 3 array I.e. int[3][3]. It is actually an array of 3 arrays of 3 integers. sizeof(*ptr) will be 36 bytes I.e. 9*4 bytes (assuming ints are 4 bytes long) p is a pointer to an array of 3 integers and it is initialized to refer to the first row of 3 integers in the array pointed to by ptr. Your cast is not legal but it will work on most of the machines out there. It points to &arr[0] You should initialize p with &arr[0] or &(*ptr)[0] or simply arr because arrays decay to a pointer to the type of its elements which in this case will be a pointer to int[3]. sizeof(*p) will be 12 bytes I.e.3*4 bytes

Unsigned integer additions wrap around.

Tell me some websites for coding

& is missing in scanf

how to fix error:qml Emulation layer crash in qt designer?

Write a function that takes an integer as well as an array as input (assuming the array members are in ascending order) And integrate the number in the presentation so that the ascending order of the presentation is maintained. (Do not use the method of adding to the beginning or end of an array and then rearranging to merge.)

Hello I tried to write a program which displays the next prime number. But it didn't work can please someone help me

how is std::int_fast#_t and std::int_least#_t where # = 8, 16, 32, or 64 integer types different from other fixed width integer types like std::int#_t and std::uint#_t?

show your code.

Hello I tried to write a program which displays the next prime number. But it didn't work can please someone help me

They depend on the underlying architecture. Suppose you are working on a system where a byte is 9 bits long (on such a system a char will be 9 bits long). On this system int_least8_t will be 9 bits. Int_fast8_t will be the fastest integer type that can carry out 8 bit integer operations. It can be 9 bits wide or 18 bits wide or even 36 bits wide depending on the underlying architecture. int8_t wont be available on this system.

#include <bits/stdc++.h> using namespace std; bool isPrime(int n) { // Corner cases if (n <= 1) return false; if (n <= 3) return true; / if (n%2 == 0 || n%3 == 0) return false; for (int i=5; i*i<=n; i=i+6) if (n%i == 0 || n%(i+2) == 0) return false; return true; }

A number is given and it displays the next prime number

so you are saying that in some architectures, using 8bit for smaller integers like 20 can be slower compared to using other integer datatype and std::int_fast#_t can be used for determining which one is fast, something like that?

Yes.

#include <bits/stdc++.h> using namespace std; bool isPrime(int n) { // Corner cases if (n <= 1) return false; if (n <= 3) return true; / if (n%2 == 0 || n%3 == 0) return false; for (int i=5; i*i<=n; i=i+6) if (n%i == 0 || n%(i+2) == 0) return false; return true; }

This just tells you whether a number is prime. It doesnt give you the next prime number

How can I do this

To find the next prime number using your IsPrime logic, you just have to check which number greater than the given number returns true when called with isPrime

Can you please help with this A positive intiger is called lucky if its cube ends in 888 Print the n ^th lucky number