-
Elágazásos feladatsor: síknegyed
- Utófeltétel: implikáció
- Utófeltétel: többirányú vagy egymásba ágyazott két irányú implikáció
- Algoritmus1: többirányú elágazással
- Algoritmus2: egymásba ágyazott kétirányú elágazásokkal
-
Ciklusos feladatsor/1: faktoriális
-
Algoritmus: számlálós ciklus bevezetése
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
using namespace std; | |
const int MAXN = 100; | |
typedef struct { | |
string szerzo, cim; | |
int db, kdb; | |
} Konyv; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
J.R.R. Tolkien | |
A hobbit | |
1970 | |
J.K. Rowling | |
Harry Potter és a bölcsek köve | |
1998 | |
Karl May | |
Winnetou | |
1960 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
using namespace std; | |
void beolvas(int &n, string sz[100+1]) { | |
//2. be | |
bool jo; | |
do { | |
cout << "N="; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
using namespace std; | |
int main() | |
{ | |
//1. dekl, beki | |
int n; //be | |
string sz[100+1]; //be | |
bool ferfi; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
using namespace std; | |
int main() | |
{ | |
//1. dekl | |
int n; | |
const int MAXN = 100; | |
int evek[MAXN+1]; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
using namespace std; | |
int main() | |
{ | |
//1. dekl | |
string lap; | |
int ert; | |
const string lapok[8+1] = { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
using namespace std; | |
int main() | |
{ | |
//1. dekl | |
int n; | |
string nap; | |
const string napok[7+1] = { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
program untitled; | |
const MAXN = 200; | |
MAXM = 50; | |
type Tmdb = array[1..MAXM,1..MAXN] of integer; | |
var n, m: integer; //spec be | |
mdb: Tmdb; //spec be | |
maxv: integer; //spec ki | |
procedure beolvasas(var m, n: integer; var mdb: Tmdb); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include <vector> | |
using namespace std; | |
void beolvas(vector<bool> &orhelyek) | |
{ | |
int n; | |
cin >> n; |