<?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/"
	>

<channel>
	<title>İlhan Bahar &#187; c örnekler</title>
	<atom:link href="http://www.ilhanbahar.com/tag/c-ornekler/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.ilhanbahar.com</link>
	<description>Kişisel Blog</description>
	<lastBuildDate>Thu, 09 Feb 2012 11:13:01 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	
		<item>
		<title>C dili kapı problemi ile ilgili algoritma</title>
		<link>http://www.ilhanbahar.com/c-dili-kapi-problemi-ile-ilgili-algoritma/</link>
		<comments>http://www.ilhanbahar.com/c-dili-kapi-problemi-ile-ilgili-algoritma/#comments</comments>
		<pubDate>Tue, 11 Nov 2008 21:04:11 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[C Programlama]]></category>
		<category><![CDATA[Programlama]]></category>
		<category><![CDATA[algoritma]]></category>
		<category><![CDATA[c örnek]]></category>
		<category><![CDATA[c örnekler]]></category>
		<category><![CDATA[c programlama]]></category>
		<category><![CDATA[c++]]></category>
		<category><![CDATA[kapı problemi]]></category>

		<guid isPermaLink="false">http://www.ilhanbahar.com/?p=57</guid>
		<description><![CDATA[/* 100 kapı,10 anahtar var,ilk aşamada kapıların tamamı kapalıdır.Anahtarlar denenerek açıksa kapatılıp,kapılıysa açılacaktır*/ //Kodlayan:İlhan BAHAR //Kaynak:www.ilhanbahar.com # include &#60;conio.h&#62; # include &#60;stdio.h&#62; int main(int) { int kapi[101]; int i,a; a=0; //Önce hepsini sıfırladık for (i=1;i&#60;101;i++) { kapi[i]=0; } //Yüz kapıyı do while ile deneyelim do { a++; for (i=1;i&#60;11;i++) { if (a%i==0) { if (kapi[a]==0) [...]]]></description>
			<content:encoded><![CDATA[<p>/* 100 kapı,10 anahtar var,ilk aşamada kapıların tamamı kapalıdır.Anahtarlar denenerek açıksa kapatılıp,kapılıysa açılacaktır*/</p>
<p>//Kodlayan:İlhan BAHAR</p>
<p>//Kaynak:www.ilhanbahar.com</p>
<p># include &lt;conio.h&gt;</p>
<p># include &lt;stdio.h&gt;</p>
<p>int main(int)</p>
<p>{</p>
<p>int kapi[101];</p>
<p>int i,a;</p>
<p>a=0;</p>
<p>//Önce hepsini sıfırladık</p>
<p>for (i=1;i&lt;101;i++)</p>
<p>{</p>
<p>kapi[i]=0;</p>
<p>}</p>
<p>//Yüz kapıyı do while ile deneyelim</p>
<p>do</p>
<p>{</p>
<p>a++;</p>
<p>for (i=1;i&lt;11;i++)</p>
<p>{</p>
<p>if (a%i==0)</p>
<p>{</p>
<p><span id="more-57"></span></p>
<p>if (kapi[a]==0)</p>
<p>{</p>
<p>kapi[a]=1;</p>
<p>}</p>
<p>else if(kapi[a]==1)</p>
<p>{</p>
<p>kapi[a]=0;</p>
<p>}</p>
<p>}</p>
<p>}</p>
<p>}while (a&lt;100);</p>
<p>for (i=1;i&lt;101;i++)</p>
<p>{</p>
<p>printf (&#8220;n%d.Kapi = %d&#8221;,i,kapi[i]);</p>
<p>}</p>
<p>getch();</p>
<p>}</p>
]]></content:encoded>
			<wfw:commentRss>http://www.ilhanbahar.com/c-dili-kapi-problemi-ile-ilgili-algoritma/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

