For loop inside another while not iterating right in c++
0
So basically my problem is for loop inside while loop that's not iterating right.
#include <iostream>
#include <math.h>
using namespace std;
void obl(long long int n){
long long int h = pow(n, n),
ar[n][h],
countH = 1;
//Filling array with 0's
for(int i = 0; i < n; i++){
for(int z = 0; z < h; z++){
ar[i][z] = 0;
}
}
while(countH != h){
for(int u = 0; u < n; u++){
for(int y = 0 ; y < n; y++){
ar[y][countH] = ar[y][countH - 1];
}
if(u == 0) ar[u][countH] = ar[u][countH] + 1;
if(ar[u][countH] > n - 1){
ar[u][countH] = 0;
ar[u + 1][countH] += 1;
}
cout<< ar[u][countH] << " ";
}
cout<<endl;
countH++;
}
}
int main()
{
obl(2);
}
and the output from cmd for input = 2 looks like this:
Give N:
2
1 0
1 0
1 0
When the output for 2 should be
Give N:
2
1 0
0 1
1 1
Or at least that's what I'm trying to do.
c++ loops iteration
edited Nov 20 at 0:32
user4581301
19.5k51831
asked Nov 20 at 0:18
Hekmatyar
113
|
show 1 more comment
0
So basically my problem is for loop inside while loop that's not iterating right.
#include <iostream>
#include <math.h>
using namespace std;
void obl(long long int n){
long long int h = pow(n, n),
ar[n][h],
countH = 1;
//Filling array with 0's
for(int i = 0; i < n; i++){
for(int z = 0; z < h; z++){
ar[i][z] = 0;
}
}
while(countH != h){
for(int u = 0; u < n; u++){
for(int y = 0 ; y < n; y++){
ar[y][countH] = ar[y][countH - 1];
}
if(u == 0) ar[u][countH] = ar[u][countH] + 1;
if(ar[u][countH] > n - 1){
ar[u][countH] = 0;
ar[u + 1][countH] += 1;
}
cout<< ar[u][countH] << " ";
}
cout<<endl;
countH++;
}
}
int main()
{
obl(2);
}
and the output from cmd for input = 2 looks like this:
Give N:
2
1 0
1 0
1 0
When the output for 2 should be
Give N:
2
1 0
0 1
1 1
Or at least that's what I'm trying to do.
c++ loops iteration
edited Nov 20 at 0:32
user4581301
19.5k51831
asked Nov 20 at 0:18
Hekmatyar
113
2
ar[n][h]isn't valid in C++. Some compilers allow Variable Length Array behaviour by extension, but you have to watch out. A user-specified 2D array oflong longis just asking for a stack overflow. Especially when one of the parameters ispow(n, n)That's going to get freaking huge freaking fast.
– user4581301
Nov 20 at 0:23
Plus you have to watch out withpowon integers. Internallypowworks in floating point and you're going to have all manner of imprecision and truncation issues.
– user4581301
Nov 20 at 0:26
Thanks for info. Will keep that in mind. I think now I have an idea how to remodel whole thing to make it simplier and actually work.
– Hekmatyar
Nov 20 at 0:29
3
The best tool to crack this is probably the debugger. With a debugger you can control the execution of the program, stepping it instruction by instruction if you have to. As you advance through the program, keep an eye out for where the program does something you don't expect. The unexpected is either a bug or an error in your expectations. Either needs to be corrected.
– user4581301
Nov 20 at 0:30
With a small size like 2, it is also a good idea to use a paper with a line per operation and a column per variable or array index. Then it should be obvious how you get what you get.
– Phil1970
Nov 20 at 1:46
|
show 1 more comment
0
0
0
So basically my problem is for loop inside while loop that's not iterating right.
#include <iostream>
#include <math.h>
using namespace std;
void obl(long long int n){
long long int h = pow(n, n),
ar[n][h],
countH = 1;
//Filling array with 0's
for(int i = 0; i < n; i++){
for(int z = 0; z < h; z++){
ar[i][z] = 0;
}
}
while(countH != h){
for(int u = 0; u < n; u++){
for(int y = 0 ; y < n; y++){
ar[y][countH] = ar[y][countH - 1];
}
if(u == 0) ar[u][countH] = ar[u][countH] + 1;
if(ar[u][countH] > n - 1){
ar[u][countH] = 0;
ar[u + 1][countH] += 1;
}
cout<< ar[u][countH] << " ";
}
cout<<endl;
countH++;
}
}
int main()
{
obl(2);
}
and the output from cmd for input = 2 looks like this:
Give N:
2
1 0
1 0
1 0
When the output for 2 should be
Give N:
2
1 0
0 1
1 1
Or at least that's what I'm trying to do.
c++ loops iteration
edited Nov 20 at 0:32
user4581301
19.5k51831
asked Nov 20 at 0:18
Hekmatyar
113
So basically my problem is for loop inside while loop that's not iterating right.
#include <iostream>
#include <math.h>
using namespace std;
void obl(long long int n){
long long int h = pow(n, n),
ar[n][h],
countH = 1;
//Filling array with 0's
for(int i = 0; i < n; i++){
for(int z = 0; z < h; z++){
ar[i][z] = 0;
}
}
while(countH != h){
for(int u = 0; u < n; u++){
for(int y = 0 ; y < n; y++){
ar[y][countH] = ar[y][countH - 1];
}
if(u == 0) ar[u][countH] = ar[u][countH] + 1;
if(ar[u][countH] > n - 1){
ar[u][countH] = 0;
ar[u + 1][countH] += 1;
}
cout<< ar[u][countH] << " ";
}
cout<<endl;
countH++;
}
}
int main()
{
obl(2);
}
and the output from cmd for input = 2 looks like this:
Give N:
2
1 0
1 0
1 0
When the output for 2 should be
Give N:
2
1 0
0 1
1 1
Or at least that's what I'm trying to do.
c++ loops iteration
c++ loops iteration
edited Nov 20 at 0:32
user4581301
19.5k51831
asked Nov 20 at 0:18
Hekmatyar
113
edited Nov 20 at 0:32
user4581301
19.5k51831
asked Nov 20 at 0:18
Hekmatyar
113
edited Nov 20 at 0:32
user4581301
19.5k51831
edited Nov 20 at 0:32
user4581301
19.5k51831
edited Nov 20 at 0:32
user4581301
19.5k51831
19.5k51831
asked Nov 20 at 0:18
Hekmatyar
113
asked Nov 20 at 0:18
Hekmatyar
113
asked Nov 20 at 0:18
Hekmatyar
113
113
2
ar[n][h]isn't valid in C++. Some compilers allow Variable Length Array behaviour by extension, but you have to watch out. A user-specified 2D array oflong longis just asking for a stack overflow. Especially when one of the parameters ispow(n, n)That's going to get freaking huge freaking fast.
– user4581301
Nov 20 at 0:23
Plus you have to watch out withpowon integers. Internallypowworks in floating point and you're going to have all manner of imprecision and truncation issues.
– user4581301
Nov 20 at 0:26
Thanks for info. Will keep that in mind. I think now I have an idea how to remodel whole thing to make it simplier and actually work.
– Hekmatyar
Nov 20 at 0:29
3
The best tool to crack this is probably the debugger. With a debugger you can control the execution of the program, stepping it instruction by instruction if you have to. As you advance through the program, keep an eye out for where the program does something you don't expect. The unexpected is either a bug or an error in your expectations. Either needs to be corrected.
– user4581301
Nov 20 at 0:30
With a small size like 2, it is also a good idea to use a paper with a line per operation and a column per variable or array index. Then it should be obvious how you get what you get.
– Phil1970
Nov 20 at 1:46
|
show 1 more comment
2
ar[n][h]isn't valid in C++. Some compilers allow Variable Length Array behaviour by extension, but you have to watch out. A user-specified 2D array oflong longis just asking for a stack overflow. Especially when one of the parameters ispow(n, n)That's going to get freaking huge freaking fast.
– user4581301
Nov 20 at 0:23
Plus you have to watch out withpowon integers. Internallypowworks in floating point and you're going to have all manner of imprecision and truncation issues.
– user4581301
Nov 20 at 0:26
Thanks for info. Will keep that in mind. I think now I have an idea how to remodel whole thing to make it simplier and actually work.
– Hekmatyar
Nov 20 at 0:29
3
The best tool to crack this is probably the debugger. With a debugger you can control the execution of the program, stepping it instruction by instruction if you have to. As you advance through the program, keep an eye out for where the program does something you don't expect. The unexpected is either a bug or an error in your expectations. Either needs to be corrected.
– user4581301
Nov 20 at 0:30
With a small size like 2, it is also a good idea to use a paper with a line per operation and a column per variable or array index. Then it should be obvious how you get what you get.
– Phil1970
Nov 20 at 1:46
2
2
ar[n][h] isn't valid in C++. Some compilers allow Variable Length Array behaviour by extension, but you have to watch out. A user-specified 2D array of long long is just asking for a stack overflow. Especially when one of the parameters is pow(n, n) That's going to get freaking huge freaking fast.– user4581301
Nov 20 at 0:23
ar[n][h] isn't valid in C++. Some compilers allow Variable Length Array behaviour by extension, but you have to watch out. A user-specified 2D array of long long is just asking for a stack overflow. Especially when one of the parameters is pow(n, n) That's going to get freaking huge freaking fast.– user4581301
Nov 20 at 0:23
Plus you have to watch out with
pow on integers. Internally pow works in floating point and you're going to have all manner of imprecision and truncation issues.– user4581301
Nov 20 at 0:26
Plus you have to watch out with
pow on integers. Internally pow works in floating point and you're going to have all manner of imprecision and truncation issues.– user4581301
Nov 20 at 0:26
Thanks for info. Will keep that in mind. I think now I have an idea how to remodel whole thing to make it simplier and actually work.
– Hekmatyar
Nov 20 at 0:29
Thanks for info. Will keep that in mind. I think now I have an idea how to remodel whole thing to make it simplier and actually work.
– Hekmatyar
Nov 20 at 0:29
3
3
The best tool to crack this is probably the debugger. With a debugger you can control the execution of the program, stepping it instruction by instruction if you have to. As you advance through the program, keep an eye out for where the program does something you don't expect. The unexpected is either a bug or an error in your expectations. Either needs to be corrected.
– user4581301
Nov 20 at 0:30
The best tool to crack this is probably the debugger. With a debugger you can control the execution of the program, stepping it instruction by instruction if you have to. As you advance through the program, keep an eye out for where the program does something you don't expect. The unexpected is either a bug or an error in your expectations. Either needs to be corrected.
– user4581301
Nov 20 at 0:30
With a small size like 2, it is also a good idea to use a paper with a line per operation and a column per variable or array index. Then it should be obvious how you get what you get.
– Phil1970
Nov 20 at 1:46
With a small size like 2, it is also a good idea to use a paper with a line per operation and a column per variable or array index. Then it should be obvious how you get what you get.
– Phil1970
Nov 20 at 1:46
|
show 1 more comment
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53384476%2ffor-loop-inside-another-while-not-iterating-right-in-c%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
draft saved
draft discarded
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53384476%2ffor-loop-inside-another-while-not-iterating-right-in-c%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
2
ar[n][h]isn't valid in C++. Some compilers allow Variable Length Array behaviour by extension, but you have to watch out. A user-specified 2D array oflong longis just asking for a stack overflow. Especially when one of the parameters ispow(n, n)That's going to get freaking huge freaking fast.– user4581301
Nov 20 at 0:23
Plus you have to watch out with
powon integers. Internallypowworks in floating point and you're going to have all manner of imprecision and truncation issues.– user4581301
Nov 20 at 0:26
Thanks for info. Will keep that in mind. I think now I have an idea how to remodel whole thing to make it simplier and actually work.
– Hekmatyar
Nov 20 at 0:29
3
The best tool to crack this is probably the debugger. With a debugger you can control the execution of the program, stepping it instruction by instruction if you have to. As you advance through the program, keep an eye out for where the program does something you don't expect. The unexpected is either a bug or an error in your expectations. Either needs to be corrected.
– user4581301
Nov 20 at 0:30
With a small size like 2, it is also a good idea to use a paper with a line per operation and a column per variable or array index. Then it should be obvious how you get what you get.
– Phil1970
Nov 20 at 1:46