<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	xmlns:creativeCommons="http://backend.userland.com/creativeCommonsRssModule">

<channel>
	<title>Bilgisayar Mühendisi&#039;nin seyir defteri &#187; Genel</title>
	<atom:link href="http://thanker.org/yazi/category/genel/feed/" rel="self" type="application/rss+xml" />
	<link>http://thanker.org</link>
	<description></description>
	<lastBuildDate>Tue, 23 Mar 2010 23:44:56 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.4</generator>
<creativeCommons:license>http://creativecommons.org/licenses/by-nc-sa/3.0/</creativeCommons:license>		<item>
		<title>100 adam ve 100 kapı</title>
		<link>http://thanker.org/yazi/100-adam-ve-100-kapi/</link>
		<comments>http://thanker.org/yazi/100-adam-ve-100-kapi/#comments</comments>
		<pubDate>Wed, 10 Mar 2010 01:39:46 +0000</pubDate>
		<dc:creator>ben</dc:creator>
				<category><![CDATA[Genel]]></category>

		<guid isPermaLink="false">http://thanker.org/?p=30</guid>
		<description><![CDATA[selamlar, şimdilik sadece kodlar, #include &#60;stdio.h&#62; #include &#60;conio.h&#62; int main() { int kapi[101]; for (int i=1;i&#60;=100;i++) kapi[i]=0; for (int i=1;i&#60;=100;i++) { //kapi konumunu degistir bakem for (int j=i;j&#60;=100;j=j+i) { //birer birer ikiser ikiser //kapi durumunu kontrol et if (kapi[j]==0) { kapi[j]=1; } else { kapi[j]=0; } } } int sayi=0; for (int i=1;i&#60;=100;i++) { if [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://thanker.org/files/kapi.jpg"><img class="alignleft size-thumbnail wp-image-31" title="kapi" src="http://thanker.org/files/kapi-150x150.jpg" alt="" width="0" height="0" /></a>selamlar,<span id="more-30"></span><br />
şimdilik sadece kodlar,</p>
<pre class="brush: cpp;">
#include &lt;stdio.h&gt;
#include &lt;conio.h&gt;

int main() {

    int kapi[101];
    for (int i=1;i&lt;=100;i++) kapi[i]=0;
    for (int i=1;i&lt;=100;i++) {

        //kapi konumunu degistir bakem
        for (int j=i;j&lt;=100;j=j+i) { //birer birer ikiser ikiser

            //kapi durumunu kontrol et
            if (kapi[j]==0) {
            kapi[j]=1;
            }
            else {
            kapi[j]=0;
            }

         }

    }
    int sayi=0;
    for (int i=1;i&lt;=100;i++) {
        if (kapi[i]==1) {
                        printf(&quot;%d\n&quot;,i);
                        sayi++;
                        }
        }
    printf(&quot;Toplam %d kapi acik&quot;,sayi);

    getch();
    return 0;
    }
</pre>
]]></content:encoded>
			<wfw:commentRss>http://thanker.org/yazi/100-adam-ve-100-kapi/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>matris çarpımı</title>
		<link>http://thanker.org/yazi/matris-carpimi/</link>
		<comments>http://thanker.org/yazi/matris-carpimi/#comments</comments>
		<pubDate>Tue, 09 Mar 2010 23:29:22 +0000</pubDate>
		<dc:creator>ben</dc:creator>
				<category><![CDATA[Genel]]></category>

		<guid isPermaLink="false">http://thanker.org/?p=24</guid>
		<description><![CDATA[selamlar, şimdilik sadece kodlar, sonra açıklamalar : #include &#60;stdio.h&#62; #include &#60;conio.h&#62; int main() { int matris1[8][8],matris2[8][8]; int toplam=0; int matris1Satir,matris1Sutun; int matris2Satir,matris2Sutun; matrisBoylari: printf(&#34;Matris1'in satirini giriniz : &#34;); scanf(&#34;%d&#34;,&#38;matris1Satir); printf(&#34;Matris1'in sutununu giriniz : &#34;); scanf(&#34;%d&#34;,&#38;matris1Sutun); printf(&#34;Matris2'nin satirini giriniz : &#34;); scanf(&#34;%d&#34;,&#38;matris2Satir); printf(&#34;Matris2'nin sutununu giriniz : &#34;); scanf(&#34;%d&#34;,&#38;matris2Sutun); //1in sutunu 2nin satirina esit olmali if (matris1Sutun!=matris2Satir) [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://thanker.org/files/matris.jpg"><img class="alignleft size-thumbnail wp-image-25" title="matris" src="http://thanker.org/files/matris-150x92.jpg" alt="" width="0" height="0" /></a><br />
selamlar,<br />
<span id="more-24"></span></p>
<p>şimdilik sadece kodlar, sonra açıklamalar :</p>
<pre class="brush: cpp;">
#include &lt;stdio.h&gt;
#include &lt;conio.h&gt;

int main() {
 int matris1[8][8],matris2[8][8];
 int toplam=0;
 int matris1Satir,matris1Sutun;
 int matris2Satir,matris2Sutun;

matrisBoylari:
 printf(&quot;Matris1'in satirini giriniz : &quot;);
 scanf(&quot;%d&quot;,&amp;matris1Satir);

 printf(&quot;Matris1'in sutununu giriniz : &quot;);
 scanf(&quot;%d&quot;,&amp;matris1Sutun);

 printf(&quot;Matris2'nin satirini giriniz : &quot;);
 scanf(&quot;%d&quot;,&amp;matris2Satir);

 printf(&quot;Matris2'nin sutununu giriniz : &quot;);
 scanf(&quot;%d&quot;,&amp;matris2Sutun);

 //1in sutunu 2nin satirina esit olmali
 if (matris1Sutun!=matris2Satir) {
 printf(&quot;Girdiniz matrisler carpilamaz!\n&quot;);
 goto matrisBoylari;
 }

 printf(&quot;matris 1 : &quot;);
 for (int i=0;i&lt;matris1Satir;i++) {

 for (int j=0;j&lt;matris1Sutun;j++) {
 printf(&quot;\n%d - %d : &quot;,i+1,j+1);
 scanf(&quot;%d&quot;,&amp;matris1[i][j]);
 }

 }

 printf(&quot;\nmatris 2 : &quot;);
 for (int i=0;i&lt;matris2Satir;i++) {

 for (int j=0;j&lt;matris2Sutun;j++) {
 printf(&quot;\n%d - %d : &quot;,i+1,j+1);
 scanf(&quot;%d&quot;,&amp;matris2[i][j]);
 }

 }

 for (int i=0;i&lt;matris1Satir;i++) { // matris1'in satırları
 for (int j=0;j&lt;matris2Sutun;j++) { // matris2'nin sütünları
 for (int k=0;k&lt;matris2Satir;k++) { // toplami hesapla
 toplam+=matris1[i][k]*matris2[k][j];
 }
 printf(&quot;%d &quot;,toplam); // hesaplanan toplami goster
 toplam=0;
 }
 printf(&quot;\n&quot;);
 }
 getch();
}
</pre>
]]></content:encoded>
			<wfw:commentRss>http://thanker.org/yazi/matris-carpimi/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
	</channel>
</rss>

