Ad:

C++ Discussion Thread
Unsolved
Views: 1392

Jul 4th, 2009

substitution cipher help

Expand Post »

Been trying to make a substitution cipher decrypter, but it isn't working especially good. so I thought I might could get some help with it.

c++ Syntax (Toggle Plain Text)
#include <iostream>
#include <time.h>
#include <windows.h>
#include <iomanip.h>
#include <string.h>
 
using namespace std;
 
int main()
{
 
 
    bool EndThisShit(false);
    do {
    string input;
    cin >> input;
    int il;
    input.length() = il;
    int Ninput[il];
    Ninput[il] = input
    int y;
    for( y = 0; y < il; y++){
    int t =1;
    Ninput[fo] + t;
    i++;
    t++;
}
 int a;
 for(a = 0; a < il; a++) {
       enum letter {  a = 97, b, c, d, e, f, g, h, i, j, k, l, m, n, o , p, q, r, s, t, u ,v, w ,x ,y ,z};
       int b = 0;
       cout Ninput[b] 
       b++; 
       }    
       cout << " is this a good solution? y/n >> ";
       char yn;
       cin >> yn; 
       if(yn == y) {
             EndThisShit = true;
             }
       if(yn == n) {
             EndThisShit = false;
             }
}while(!EndThisShit);
}
#include <iostream>
#include <time.h>
#include <windows.h>
#include <iomanip.h>
#include <string.h>

using namespace std;

int main()
{
    
    
    bool EndThisShit(false);
    do {
    string input;
    cin >> input;
    int il;
    input.length() = il;
    int Ninput[il];
    Ninput[il] = input
    int y;
    for( y = 0; y < il; y++){
    int t =1;
    Ninput[fo] + t;
    i++;
    t++;
}
 int a;
 for(a = 0; a < il; a++) {
       enum letter {  a = 97, b, c, d, e, f, g, h, i, j, k, l, m, n, o , p, q, r, s, t, u ,v, w ,x ,y ,z};
       int b = 0;
       cout Ninput[b] 
       b++; 
       }    
       cout << " is this a good solution? y/n >> ";
       char yn;
       cin >> yn; 
       if(yn == y) {
             EndThisShit = true;
             }
       if(yn == n) {
             EndThisShit = false;
             }
}while(!EndThisShit);
}

Last edited by kangarooblood; Jul 4th, 2009 at 7:25 am.

Similar Threads

Need help with Caesar Cipher program in Java
Need help with substitution cipher in Javascript in JavaScript / DHTML / AJAX
Chars becoming negative. in C++
Python challenge help in Python
Help With Caesar Cipher/Shift in Pascal and Delphi

kangarooblood

Reputation Points: 6

Solved Threads: 2

Light Poster

Offline

42 posts
since Jun 2009

Permalink

Jul 4th, 2009

Re: substitution cipher help

What is it supposed to do. Maybe you can give sample input, current (incorrect) output, and expected output.

daviddoria

Featured Poster

Reputation Points: 437

Solved Threads: 204

Posting Virtuoso

Offline

1,968 posts
since Feb 2008

Permalink

Jul 4th, 2009

Re: Substitution cipher help

Click to Expand / Collapse Quote originally posted by daviddoria ...

What is it supposed to do. Maybe you can give sample input, current (incorrect) output, and expected output.

well it's supposed to give differet solutions to a Substitution cipher (http://en.wikipedia.org/wiki/Substitution_cipher)
it should be writing a possible solutions and if it's the correct then finish it of, and if it's not it shall give another suggestion, until it finds the right one. right now nothing happends, all I get is an error message saying " `width' has not been declared" it's supposed to give every letter a specific array, then convert it to numbers, then add an increasing number to the letter number, then convert it back to the letter that is the increasing number after it. and then type it out.

c++ Syntax (Toggle Plain Text)
#include <iostream>
#include <time.h>
#include <windows.h>
#include <iomanip.h>
#include <string.h>
 
using namespace std;
 
int main()
{
 
 
    bool EndThisShit(false);
    do {
    char input;
    cin >> input;
    int Ninput[1000];
    int li;
    li = input.width();
    Ninput[1000] = input;
    int Veckt[li];
    int fo=0;
    int letters[fo];
 
    int y;
    for(y = 0; y < li; y++){
    int t =1;
    Veckt[fo] = Ninput[fo] + t;
    Veckt[fo] = (char)letters[fo];
    fo++;
    t++;
}
 int a;
 for(a = 0; a < li; a++) {
       int bo = 0;
       cout << letters[fo]; 
       bo++; 
       }    
       cout << " is this a good solution? y/n >> ";
       char yn;
       cin >> yn; 
       if(yn == 'y') {
             EndThisShit = true;
             }
       if(yn == 'n') {
             EndThisShit = false;
             }
}while(!EndThisShit);
}
#include <iostream>
#include <time.h>
#include <windows.h>
#include <iomanip.h>
#include <string.h>

using namespace std;

int main()
{
    
    
    bool EndThisShit(false);
    do {
    char input;
    cin >> input;
    int Ninput[1000];
    int li;
    li = input.width();
    Ninput[1000] = input;
    int Veckt[li];
    int fo=0;
    int letters[fo];
    
    int y;
    for(y = 0; y < li; y++){
    int t =1;
    Veckt[fo] = Ninput[fo] + t;
    Veckt[fo] = (char)letters[fo];
    fo++;
    t++;
}
 int a;
 for(a = 0; a < li; a++) {
       int bo = 0;
       cout << letters[fo]; 
       bo++; 
       }    
       cout << " is this a good solution? y/n >> ";
       char yn;
       cin >> yn; 
       if(yn == 'y') {
             EndThisShit = true;
             }
       if(yn == 'n') {
             EndThisShit = false;
             }
}while(!EndThisShit);
}

New code!

Last edited by kangarooblood; Jul 4th, 2009 at 9:54 am.

kangarooblood

Reputation Points: 6

Solved Threads: 2

Light Poster

Offline

42 posts
since Jun 2009

Permalink

Jul 4th, 2009

Re: substitution cipher help

What are all those headers for? Comments would also be nice so we can see what your doing.
Are you incrementing every character by one, and if the input is 'n', you increment every number again? What happens when you go past the printible character range?

Hiroshe

Reputation Points: 431

Solved Threads: 17

Posting Whiz in Training

Offline

255 posts
since Jun 2008

Permalink

Jul 5th, 2009

Re: substitution cipher help

Click to Expand / Collapse Quote originally posted by Hiroshe ...

What are all those headers for? Comments would also be nice so we can see what your doing.
Are you incrementing every character by one, and if the input is 'n', you increment every number again? What happens when you go past the printible character range?

well I'm going to use the headers later, like adding some color and so on. And when I overcome the printable range (for the moment) nothing happends, then it's just not a substitution cipher and it's just to close the window down.

kangarooblood

Reputation Points: 6

Solved Threads: 2

Light Poster

Offline

42 posts
since Jun 2009

This thread is more than three months old

No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.

Previous Thread in C++ Forum Timeline: hey guys could u check my code PLEASE its a code with a "text file"

Next Thread in C++ Forum Timeline: Segmentation Fault

DaniWeb Message

Cancel Changes

User Name
Password