o prirodi

09.07.2014., srijeda

binarno stablo

/*Dodajte u uređeno binarno stablo sljedeće elemente (možete ih čitati iz datoteke ili ih direktno dodavati): 
 84 52 98 49 60 85 35 66 87 32 61 70. Unos treba biti rekurzivan. Nakon toga implementirajte funkciju za 
 brisanje čvorova i pozovite je za element 49. Nakon brisanja ispisuje se stablo u stablastom obliku.*/ 
#include<iostream> 
#include<fstream> 
#include<iomanip> 
using namespace std; 
struct cvor 
{ 
 int pod; 
 cvor *l, *d; 
}; 
void unos(cvor *&korijen, int i) 
{ 
 if(korijen==0) 
 { 
 cvor *korijen=new cvor; 
 korijen->pod=i; 
 korijen->l=0; 
 korijen->d=0; 
 } 
 else if(korijen->pod>i) 
 {unos(korijen->l,i); 
 cout<<"nunesen lijevin";} 
 else 
 {unos(korijen->d,i); 
 cout<<"nunesen lijevin";} 
} 
void ispis(cvor *korijen, int n) 
{ 
 if (korijen==0) 
 cout<<"x"<<setw(n)<<endl; 
 else 
 { 
 ispis(korijen->d,n); 
 cout<<korijen->pod<<"<"<<setw(n+2); 
 ispis(korijen->l,n); 
 } 
} 
int main() 
{ 
 cvor *korijen=0; 
 fstream ulaz("stablo.txt"); 
 int n=12; 
 int p[n]; 
 
 for(int i=0;i<n;i++) 
 ulaz>>p[i]; 
 
 for(int i=0;i<n;i++) 
 { 
 cout<<p[i]<<setw(5); 
 unos(korijen,i); 
 } 
 cout<<endl<<endl; 
 int sirina=0; 
 ispis(korijen,sirina); 
 //obrisi(korijen,45); 
 return 0; 
}

- 09:09 - Komentari (0) - Isprintaj - #

gomila

//Napišite program u kojem je polje inicijalizirano sa sljedećim elementima: 10 20 30 15 45. Sagradite gomilu maksimum, a potom ispišite sve elemente gomile na ekran. (10 bodova) 
#include <iostream> 
#include<iomanip> 
using namespace std; 
void build(int p[], int n); 
void exchange(int &x, int &y); 
void reheapUp(int p[], int newNode); 
void write(int p[], int n); 
int main() 
{ 
 int p[]={10,20,30,15,45}; 
 const int n=5; 
 build(p,n); 
 write(p,n); 
 return 0; 
} 
void build(int p[], int n) 
{ 
 int i=0; 
 while(i<n) 
 { 
 reheapUp(p,i); 
 i++; 
 } 
} 
void exchange(int &x, int &y) 
{ 
 int tmp=x; 
 x=y; 
 y=tmp; 
} 
void reheapUp(int p[], int newNode) 
{ 
 if(newNode<=0) 
 return; 
 int parent=(newNode-1)/2; 
 if(p[newNode]>p[parent]) 
 { 
 exchange(p[newNode],p[parent]); 
 reheapUp(p,parent); 
 } 
} 
void write(int p[], int n) 
{ 
 for(int i=0; i<n; i++) 
 cout<<p[i]<<setw(5); 
}

- 09:08 - Komentari (0) - Isprintaj - #

quick find-vektori

/*Napišite program koji je implementacija algoritma quick find pomoću vektora. 
Parovi povezanih čvorova koji su označeni cijelim brojevima od 0 do 9 čitaju se iz datoteke pairs.txt. 
Na ekranu se ispisuju samo redundantne veze.*/ 
 
#include <iostream> 
#include <fstream> 
#include <cstdlib> 
#include <vector> 
using namespace std; 
 
int main() 
{ 
 ifstream ulaz("dat.txt"); 
 if(!ulaz.is_open()) 
 { 
 cout<<"Datoteka ne postoji!n"; 
 exit(1); 
 } 
 int p, q; 
 
 vector <int> polje; 
 
 for(int i=0; i<10; i++) 
 polje.push_back(i); 
 
 cout<<"Redundantne veze: n"; 
 
 while (ulaz>>p>>q) 
 { 
 int i, j; 
 for(i=p; i!=polje[i]; i=polje[i]); 
 for(j=q; j!=polje[j]; j=polje[j]); 
 if(polje[i]==polje[j]) 
 cout<<endl<<p<<" - "<<q<<endl; 
 polje[i]=polje[j]; 
 } 
 
 return 0; 
}

- 09:06 - Komentari (0) - Isprintaj - #

07.07.2014., ponedjeljak

index

(!DOCTYPE html> 
(html xmlns="http://www.w3.org/1999/xhtml"> 
<head) 
 (itle>Naslovna</title> 
 <meta charset="utf-8" /> 
 
 (style type="text/css") 
 
 html,body 
 [ 
 margin:0;padding:0; 
 background-image:url(slike/pozadina.png); 
 ] 
 body[ 
 font-family: Tahoma; 
 font-size: 90%; 
 text-align:center; 
 
 ] 
 p{ 
 margin:0 10px 10px; 
 } 
 /*a{ 
 display:block; 
 color: #006; 
 padding:10px; 
 }*/ 
 header{ 
 position:relative; 
 height:180px; 
 /*line-height:80px;*/ 
 /*margin:0;*/ 
 /*padding-left:10px;*/ 
 background-image:url(slike/slika_header.png); 
 } 
 
 
 /*header a{ 
 position:absolute; 
 right:0; 
 top:23px; 
 }*/ 
 #wrapper{ 
 background-color:white; 
 text-align:left; 
 width:800px; 
 margin:0 auto; 
 } 
 nav{ 
 position:relative; 
 top: -50px; 
 left: 150px; 
 height:50px; 
 width: 500px; 
 /*line-height:30px;*/ 
 /*margin:0;*/ 
 /*padding-left:10px;*/ 
 background:#4d4d4d; 
 color: white; 
 font-size: x-large; 
 font-family:'Dream Orphans'; 
 
 } 
 nav ul{ 
 list-style-type: none; 
 } 
 nav li{ 
 float:left; 
 margin-left: 15px; 
 
 } 
 nav a:link, a:visited{ 
 color:white; 
 text-decoration: none; 
 } 
 nav a:hover{ 
 display:block; 
 border-radius: 15px; 
 box-shadow: 1px 1px 35px rgba(97,212,184,0.7); 
 color:rgb(118, 255, 222); 
 
 -moz-transition-duration: 0.9s; 
 -moz-transition-property: all; 
 -o-transition-duration: 0.9s; 
 -o-transition-property: all; 
 -webkit-transition-duration: 0.9s; 
 -webkit-transition-property: all; 
 
 transition-duration: 0.9s; 
 transition-property: all; 
 background-color:rgba(97,212,184,0.3); 
 
 } 
 
 aside { 
 float:right; 
 width:200px; 
 position: relative; 
 top: 25px; 
 
 } 
 footer { 
 background-image: url(slike/slika_footer.png); 
 clear:both; 
 width:100%; 
 height: 50px; 
 } 
 footer p{ 
 color: rgb(212, 212, 212); 
 font-size: 70%; 
 text-align: center; 
 /*margin:0px;*/ 
 padding: 25px; 
 } 
 footer a { 
 
 /*display: inline;*/ 
 padding: 0; 
 color: #C6D5FD; 
 } 
 footer a:hover{ 
 color:rgb(118, 255, 222); 
 } 
 section{ 
 position: relative; 
 top: 20px; 
 margin:25px; 
 float:left; 
 width:450px; 
 min-height:650px; 
 background-color: rgb(237, 237, 237); 
 border-radius: 10px; 
 border: 2px solid rgb(212, 212, 212); 
 } 
 article{ 
 margin-top: 20px; 
 margin-right: 25px; 
 float:right; 
 clear:right; 
 width:270px; 
 min-height: 200px; 
 background-color: rgb(237, 237, 237); 
 border-radius: 10px; 
 border: 2px solid rgb(212, 212, 212); 
 } 
 div#prazno{ 
 clear:both; 
 height: 55px; 
 width:100%; 
 
 } 
 div#prazno img{ 
 float:left; 
 display:block; 
 width: 60px; 
 height: 60px; 
 opacity:0.4; 
 transition:all 0.5s; 
 
 } 
 div#prazno img:hover{ 
 width:65px; 
 height:65px; 
 opacity: 1; 
 } 
 #galerija{ 
 position: relative; 
 top: 20px; 
 display: block; 
 margin: auto; 
 width:750px; 
 height: 198px; 
 background-image:url(slike/slika_galerija.png); 
 } 
 
 </style> 
<script type="text/javascript">
<![CDATA[//><!--
var pp_gemius_identifier = 'p8ZF1D7vmeoe8Uuxwuq2j_TSLd8RN1sF.aREMenHvGT.i7';
var pp_gemius_use_cmp = true;
var pp_gemius_cmp_timeout = 10000;

// lines below shouldn't be edited
function gemius_pending(i) { window[i] = window[i] || function() {var x = window[i+'_pdata'] = window[i+'_pdata'] || []; x[x.length]=arguments;};};
gemius_pending('gemius_hit'); gemius_pending('gemius_event'); gemius_pending('pp_gemius_hit'); gemius_pending('pp_gemius_event');
(function(d,t) {try {var gt=d.createElement(t),s=d.getElementsByTagName(t)[0],l='http'+((location.protocol=='https:')?'s':''); gt.setAttribute('async','async');
gt.setAttribute('defer','defer'); gt.src=l+'://hr.hit.gemius.pl/xgemius.js'; s.parentNode.insertBefore(gt,s);} catch (e) {}})(document,'script');
//--><!]]>
</script>

<script type="text/javascript">
 /* <![CDATA[ */
 (function() {
 var d=document,
 h=d.getElementsByTagName('head')[0],
 s=d.createElement('script');
 s.type='text/javascript';
 s.async=true;
 s.src='//test-script.dotmetrics.net/door.js?id=' + (document.location.hostname.indexOf('dnevnik.hr')== -1? 610: 977);
 h.appendChild(s);
 }());
 /* ]]> */
</script>

<script>(function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':
new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],
j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src=
'https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);
})(window,document,'script','dataLayer','GTM-5H83FN');</script>

<noscript><iframe src="https://www.googletagmanager.com/ns.html?id=GTM-5H83FN"
height="0" width="0" style="display:none;visibility:hidden"></iframe></noscript>

<script type="text/javascript">window.gdprAppliesGlobally=true;(function(){function a(e){if(!window.frames[e]){if(document.body&&document.body.firstChild){var t=document.body;var n=document.createElement("iframe");n.style.display="none";n.name=e;n.title=e;t.insertBefore(n,t.firstChild)}
else{setTimeout(function(){a(e)},5)}}}function e(n,r,o,c,s){function e(e,t,n,a){if(typeof n!=="function"){return}if(!window[r]){window[r]=[]}var i=false;if(s){i=s(e,t,n)}if(!i){window[r].push({command:e,parameter:t,callback:n,version:a})}}e.stub=true;function t(a){if(!window[n]||window[n].stub!==true){return}if(!a.data){return}
var i=typeof a.data==="string";var e;try{e=i?JSON.parse(a.data):a.data}catch(t){return}if(e[o]){var r=e[o];window[n](r.command,r.parameter,function(e,t){var n={};n[c]={returnValue:e,success:t,callId:r.callId};a.source.postMessage(i?JSON.stringify(n):n,"*")},r.version)}}
if(typeof window[n]!=="function"){window[n]=e;if(window.addEventListener){window.addEventListener("message",t,false)}else{window.attachEvent("onmessage",t)}}}e("_tcfapi","tcfapiBuffer","tcfapiCall","tcfapiReturn");a("_tcfapiLocator");(function(e){
 var t=document.createElement("script");t.id="spcloader";t.type="text/javascript";t.async=true;t.src="https://sdk.privacy-center.org/"+e+"/loader.js?target="+document.location.hostname;t.charset="utf-8";var n=document.getElementsByTagName("script")[0];n.parentNode.insertBefore(t,n)})("03c24551-d648-4df2-98f9-2ed3dd7b05a8")})();</script>

</body> 
</html)

- 09:11 - Komentari (0) - Isprintaj - #

- 09:05 - Komentari (0) - Isprintaj - #

<< Arhiva >>

Ovaj blog je ustupljen pod Creative Commons licencom Imenovanje-Nekomercijalno.