diff --git a/cpp/najwieksza_liczba_w_tablicy/tab4.cpp b/cpp/najwieksza_liczba_w_tablicy/tab4.cpp new file mode 100644 index 0000000..281b9ec --- /dev/null +++ b/cpp/najwieksza_liczba_w_tablicy/tab4.cpp @@ -0,0 +1,33 @@ +#include +#include +using namespace std; + +int main() { + int a[] = {5,18,7,9,2,1,11,8,2,3}; + int i,k,max1,max2,n; + + n = sizeof(a)/sizeof(a[0]); + max1 = a[0]; + k = 0; + for(i=1; i max1) { + max1 = a[i]; + k = i; + } + } + + cout << "Najwiekszy element: " << max1 << endl; + cout << "Indeks najwiekszego elementu: " << k << endl; + + max2 = a[0]; + for(i=1; i max2) { + max2 = a[i]; + } + } + + cout << "Drugi najwiekszy element: " << max2 << endl; + + system("pause"); + return 0; +} \ No newline at end of file diff --git a/cpp/najwieksza_liczba_w_tablicy/tab4.exe b/cpp/najwieksza_liczba_w_tablicy/tab4.exe new file mode 100644 index 0000000..1091a1f Binary files /dev/null and b/cpp/najwieksza_liczba_w_tablicy/tab4.exe differ diff --git a/cpp/lotto.cpp b/cpp/tablica_cw/lotto.cpp similarity index 93% rename from cpp/lotto.cpp rename to cpp/tablica_cw/lotto.cpp index 86b17d2..47a52cb 100644 --- a/cpp/lotto.cpp +++ b/cpp/tablica_cw/lotto.cpp @@ -1,31 +1,31 @@ -#include -using namespace std; -int main() -{ - - int a[] = {5, 3, 2, 2, 9, 1}; - int i,dl,n; - dl=sizeof(a)/sizeof(a[0]); - for(i=0;i null"); - return 0; -} - +#include +using namespace std; +int main() +{ + + int a[] = {5, 3, 2, 2, 9, 1}; + int i,dl,n; + dl=sizeof(a)/sizeof(a[0]); + for(i=0;i null"); + return 0; +} + diff --git a/cpp/odw.cpp b/cpp/tablica_cw/odw.cpp similarity index 93% rename from cpp/odw.cpp rename to cpp/tablica_cw/odw.cpp index 560bc38..a602492 100644 --- a/cpp/odw.cpp +++ b/cpp/tablica_cw/odw.cpp @@ -1,36 +1,36 @@ -//odwracanie tablicy -#include -#include -using namespace std; - -int main() -{ - int i,n,j; - cout<<"n = "; - cin>>n; - int *a = new int[n]; //Dynamiczna alokacja pamieci - int *b = new int[n]; - - for(i=0;i=0;i--){ - b[j]=a[i]; - j++; - } - cout< +#include +using namespace std; + +int main() +{ + int i,n,j; + cout<<"n = "; + cin>>n; + int *a = new int[n]; //Dynamiczna alokacja pamieci + int *b = new int[n]; + + for(i=0;i=0;i--){ + b[j]=a[i]; + j++; + } + cout< -#include -using namespace std; - -int main() -{ - int i,j,n; - string a,b; - cout<<"Podaj tekst: "; - getline(cin,a); - n = a.length(); - - cout< +#include +using namespace std; + +int main() +{ + int i,j,n; + string a,b; + cout<<"Podaj tekst: "; + getline(cin,a); + n = a.length(); + + cout< -#include -using namespace std; - -int main() -{ - int a[] = {41, 558, 541, 559,63, 62, 551, 155}; - int n,i,max,min; - float sr,suma; - - n=sizeof(a)/sizeof(int); - cout<<"n = "<max) max=a[i]; - cout<<"\n max = "< null"); - return 0; -} - +#include +#include +using namespace std; + +int main() +{ + int a[] = {41, 558, 541, 559,63, 62, 551, 155}; + int n,i,max,min; + float sr,suma; + + n=sizeof(a)/sizeof(int); + cout<<"n = "<max) max=a[i]; + cout<<"\n max = "< null"); + return 0; +} + diff --git a/cpp/sum_2.cpp b/cpp/tablica_cw/sum_2.cpp similarity index 93% rename from cpp/sum_2.cpp rename to cpp/tablica_cw/sum_2.cpp index 283fadb..be90eab 100644 --- a/cpp/sum_2.cpp +++ b/cpp/tablica_cw/sum_2.cpp @@ -1,19 +1,19 @@ -//suma liczb parzystych -#include - -using namespace std; - -int main() -{ - int t[] = {4,7,9,3,10,2,5,6}; - int suma,i,n; - n=sizeof(t)/sizeof(t[0]); - - suma=0; - for(i=0;i +#include +using namespace std; + +int main() +{ + int i,n ; + cout<<"n = "; + cin>>n; + if(n>0) { + int *a = new int[n]; + a[0]=1; + cout< -using namespace std; - -int main() -{ - int i,n; - float zl,suma; - float f[100]; - cout<<"n = "; - cin>>n; - f[0]=0; - f[1]=1; - cout<