<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
	<channel>
		<title><![CDATA[Latest posts for the topic "pomos za zadaca "]]></title>
		<link>http://mendo.mk/jforum/posts/list/8.page</link>
		<description><![CDATA[Latest messages posted in the topic "pomos za zadaca "]]></description>
		<generator>JForum - http://www.jforum.net</generator>
			<item>
				<title>pomos za zadaca </title>
				<description><![CDATA[ aj aako mozi pomos za zadaca Линеарна равенка <a class="snap_shots" href="http://mendo.mk/Task.do?id=229" target="_blank" rel="nofollow">http://mendo.mk/Task.do?id=229</a> ]]></description>
				<guid isPermaLink="true">http://mendo.mk/jforum/posts/preList/460/3060.page</guid>
				<link>http://mendo.mk/jforum/posts/preList/460/3060.page</link>
				<pubDate><![CDATA[Sat, 25 Feb 2017 11:25:20]]> GMT</pubDate>
				<author><![CDATA[ Kiko206]]></author>
			</item>
			<item>
				<title>pomos za zadaca </title>
				<description><![CDATA[ [quote=Kiko206]aj aako mozi pomos za zadaca Линеарна равенка <a class="snap_shots" href="http://mendo.mk/Task.do?id=229" target="_blank" rel="nofollow">http://mendo.mk/Task.do?id=229</a> [/quote]<br /> Математика. [url]http://www.e-matematika.mk/linearni-ravenki-i-neravenki[/url] (види дел 2).]]></description>
				<guid isPermaLink="true">http://mendo.mk/jforum/posts/preList/460/3064.page</guid>
				<link>http://mendo.mk/jforum/posts/preList/460/3064.page</link>
				<pubDate><![CDATA[Sat, 25 Feb 2017 12:02:40]]> GMT</pubDate>
				<author><![CDATA[ MOI]]></author>
			</item>
			<item>
				<title>Re:pomos za zadaca </title>
				<description><![CDATA[ fala gotovo ja resiv <img src="http://mendo.mk/jforum/images/smilies/283a16da79f3aa23fe1025c96295f04f.gif" />]]></description>
				<guid isPermaLink="true">http://mendo.mk/jforum/posts/preList/460/3066.page</guid>
				<link>http://mendo.mk/jforum/posts/preList/460/3066.page</link>
				<pubDate><![CDATA[Sat, 25 Feb 2017 12:27:07]]> GMT</pubDate>
				<author><![CDATA[ Kiko206]]></author>
			</item>
			<item>
				<title>Re:pomos za zadaca </title>
				<description><![CDATA[ aj i za zadacata meseci pomos kako treba da bidi ja pram so switch,case ama samo 6 toci imam  <a class="snap_shots" href="http://mendo.mk/Task.do?id=232" target="_blank" rel="nofollow">http://mendo.mk/Task.do?id=232</a>]]></description>
				<guid isPermaLink="true">http://mendo.mk/jforum/posts/preList/460/3067.page</guid>
				<link>http://mendo.mk/jforum/posts/preList/460/3067.page</link>
				<pubDate><![CDATA[Sat, 25 Feb 2017 14:13:25]]> GMT</pubDate>
				<author><![CDATA[ Kiko206]]></author>
			</item>
			<item>
				<title>Re:pomos za zadaca </title>
				<description><![CDATA[ Не ти го дадов точниот код .. имаш грешка тука најди ja  сам <br /> [quote]#include &lt;iostream&gt;<br />  <br /> using namespace std;<br />  <br /> int main()<br /> {<br />    string i;<br />    cin&gt;&gt;i;<br /> if(i == "1")<br /> {<br />     cout&lt;&lt;"31"&lt;&lt;endl;<br /> }<br /> else if(i == "2")<br /> {<br />     cout&lt;&lt;"28"&lt;&lt;endl;<br /> }<br /> else if(i == "3")<br /> {<br />     cout&lt;&lt;"31"&lt;&lt;endl;<br /> }<br /> else if(i == "4")<br /> {<br />     cout&lt;&lt;"30"&lt;&lt;endl;<br /> }<br /> else if(i == "5")<br /> {<br />     cout&lt;&lt;"30"&lt;&lt;endl;<br /> }<br /> else if(i == "6")<br /> {<br />     cout&lt;&lt;"30"&lt;&lt;endl;<br /> }<br /> else if(i == "7")<br /> {<br />     cout&lt;&lt;"31"&lt;&lt;endl;<br /> }<br /> else if(i == "8")<br /> {<br />     cout&lt;&lt;"31"&lt;&lt;endl;<br /> }<br /> else if(i == "9")<br /> {<br />     cout&lt;&lt;"30"&lt;&lt;endl;<br /> }<br /> else if(i == "10")<br /> {<br />     cout&lt;&lt;"31"&lt;&lt;endl;<br /> }<br /> else if(i == "11")<br /> {<br />     cout&lt;&lt;"30"&lt;&lt;endl;<br /> }<br /> else if(i == "12")<br /> {<br />     cout&lt;&lt;"31"&lt;&lt;endl;<br /> }<br /> return 0;<br /> }[/quote]<br /> ]]></description>
				<guid isPermaLink="true">http://mendo.mk/jforum/posts/preList/460/3069.page</guid>
				<link>http://mendo.mk/jforum/posts/preList/460/3069.page</link>
				<pubDate><![CDATA[Sat, 25 Feb 2017 19:17:21]]> GMT</pubDate>
				<author><![CDATA[ Perez]]></author>
			</item>
			<item>
				<title>Re:pomos za zadaca </title>
				<description><![CDATA[ Fala reseno]]></description>
				<guid isPermaLink="true">http://mendo.mk/jforum/posts/preList/460/3070.page</guid>
				<link>http://mendo.mk/jforum/posts/preList/460/3070.page</link>
				<pubDate><![CDATA[Sat, 25 Feb 2017 21:26:28]]> GMT</pubDate>
				<author><![CDATA[ Kiko206]]></author>
			</item>
			<item>
				<title>Re:pomos za zadaca </title>
				<description><![CDATA[ aj pak mala pomos za zadaca buvki <a class="snap_shots" href="http://mendo.mk/Task.do?id=230" target="_blank" rel="nofollow">http://mendo.mk/Task.do?id=230</a> ]]></description>
				<guid isPermaLink="true">http://mendo.mk/jforum/posts/preList/460/3079.page</guid>
				<link>http://mendo.mk/jforum/posts/preList/460/3079.page</link>
				<pubDate><![CDATA[Sun, 26 Feb 2017 13:22:51]]> GMT</pubDate>
				<author><![CDATA[ Kiko206]]></author>
			</item>
			<item>
				<title>Re:pomos za zadaca </title>
				<description><![CDATA[ [quote=Kiko206]aj pak mala pomos za zadaca buvki http://mendo.mk/Task.do?id=230 [/quote]<br /> [code]<br /> #include &lt;iostream&gt;<br /> using namespace std;<br /> <br /> int main() {<br /> 	char T; cin &gt;&gt; T;<br /> 	<br /> 	if(islower(T))<br /> 		cout &lt;&lt; "MALA" &lt;&lt; endl;<br /> 	else if(isupper(T))<br /> 		cout &lt;&lt; "GOLEMA" &lt;&lt; endl;<br /> 	else<br /> 		cout &lt;&lt; "GRESKA" &lt;&lt; endl;<br /> 		<br /> 	return 0;<br /> }<br /> [/code]]]></description>
				<guid isPermaLink="true">http://mendo.mk/jforum/posts/preList/460/3080.page</guid>
				<link>http://mendo.mk/jforum/posts/preList/460/3080.page</link>
				<pubDate><![CDATA[Sun, 26 Feb 2017 13:41:30]]> GMT</pubDate>
				<author><![CDATA[ lekov]]></author>
			</item>
			<item>
				<title>Re:pomos za zadaca </title>
				<description><![CDATA[ fala za zadacata so bukvi a sega ova so Фибоначиеви броеви http://mendo.mk/Task.do?id=236 mi dava samo 2 tocni <br /> [code]#include &lt;iostream&gt;<br /> <br /> using namespace std;<br /> <br /> int main()<br /> {<br />     int n,prv=0,vtor=1,sleden;<br />     cin&gt;&gt;n;<br />     cout&lt;&lt;1&lt;&lt;endl;<br />     for(int i=1; i&lt;n;i++)<br />     {<br />         sleden=prv+vtor;<br />         prv=vtor;<br />         vtor=sleden;<br />         cout&lt;&lt;sleden&lt;&lt;endl;<br />     }<br />     return 0;<br /> }[/code]]]></description>
				<guid isPermaLink="true">http://mendo.mk/jforum/posts/preList/460/3081.page</guid>
				<link>http://mendo.mk/jforum/posts/preList/460/3081.page</link>
				<pubDate><![CDATA[Sun, 26 Feb 2017 15:43:27]]> GMT</pubDate>
				<author><![CDATA[ Kiko206]]></author>
			</item>
			<item>
				<title>Re:pomos za zadaca </title>
				<description><![CDATA[ Твојот код ги печати првите n Фибоначиеви броеви, а треба да ги печати [b]сите броеви помали или еднакви на n[/b].<br /> <br /> Пример:<br /> влез<br /> 6<br /> <br /> излез<br /> 1<br /> 1<br /> 2<br /> 3<br /> 5<br /> <br /> излез од твојот код<br /> 1<br /> 1<br /> 2<br /> 3<br /> 5<br /> 8<br /> <br /> На местото на for-циклусот, стај еден while-циклус кој би работел за задачава.<br /> И откако ќе решиш некоја задача, прво провери ја за тест примерите кои ти се дадени во текстот и спореди го твојот излез со соодветниот излез од тие тест примери.]]></description>
				<guid isPermaLink="true">http://mendo.mk/jforum/posts/preList/460/3082.page</guid>
				<link>http://mendo.mk/jforum/posts/preList/460/3082.page</link>
				<pubDate><![CDATA[Sun, 26 Feb 2017 16:11:41]]> GMT</pubDate>
				<author><![CDATA[ lekov]]></author>
			</item>
			<item>
				<title>Re:pomos za zadaca </title>
				<description><![CDATA[ Го прам со while ама неможи во примерот за влез 3 вади 1 1 2 3 точно а за 6: 1 1 2 3 5 8 13 <br /> [code]<br /> using namespace std;<br /> <br /> int main()<br /> {<br />     int n,prv=0,vtor=1,sleden;<br />     cin&gt;&gt;n;<br />     cout&lt;&lt;1&lt;&lt;endl;<br />     int i=1;<br />     while(i&lt;=n)<br />     {<br />         sleden=prv+vtor;<br />         prv=vtor;<br />         vtor=sleden;<br />         cout&lt;&lt;sleden&lt;&lt;endl;<br />         i++;<br />     }<br />     return 0;<br /> }[/code]]]></description>
				<guid isPermaLink="true">http://mendo.mk/jforum/posts/preList/460/3083.page</guid>
				<link>http://mendo.mk/jforum/posts/preList/460/3083.page</link>
				<pubDate><![CDATA[Sun, 26 Feb 2017 18:25:19]]> GMT</pubDate>
				<author><![CDATA[ Kiko206]]></author>
			</item>
			<item>
				<title>Re:pomos za zadaca </title>
				<description><![CDATA[ Да, со while циклус ти е подобро да ја решиш оваа задача, но пак го имаш истиот проблем. На тебе програмата ти ги печати првите n фибоначиеви броеви,а треба да ти ги печати сите фибоначиеви броеви помали од бројот n. Во while циклусот наместо i, треба да проверуваш дали sleden е помал од n. Замени while(i&lt;=n) со while(sleden&lt;=n). <br /> <br /> п.с. И вака ќе имаш проблем, нема да ти работи точно програмата. Те оставам сам да размислиш и да се обидеш да го пронајдеш проблемот, ако не успееш пиши и ќе ти објаснам.]]></description>
				<guid isPermaLink="true">http://mendo.mk/jforum/posts/preList/460/3084.page</guid>
				<link>http://mendo.mk/jforum/posts/preList/460/3084.page</link>
				<pubDate><![CDATA[Sun, 26 Feb 2017 20:10:22]]> GMT</pubDate>
				<author><![CDATA[ Tose Todorov]]></author>
			</item>
			<item>
				<title>Re:pomos za zadaca </title>
				<description><![CDATA[ Ај ако можи да ми објасниш за задачата неможам никако да ја решам]]></description>
				<guid isPermaLink="true">http://mendo.mk/jforum/posts/preList/460/3085.page</guid>
				<link>http://mendo.mk/jforum/posts/preList/460/3085.page</link>
				<pubDate><![CDATA[Sun, 26 Feb 2017 21:34:48]]> GMT</pubDate>
				<author><![CDATA[ Kiko206]]></author>
			</item>
			<item>
				<title>Re:pomos za zadaca </title>
				<description><![CDATA[ [code]<br /> #include &lt;iostream&gt;<br /> using namespace std;  <br />       <br /> int main()  <br /> {  <br />         int n,prv=0,vtor=1,sleden=0;  <br />         cin&gt;&gt;n;  <br />         cout&lt;&lt;1&lt;&lt;endl; <br />         sleden=prv+vtor;<br />         while(sleden&lt;=n)  <br />         {  <br />             cout&lt;&lt;sleden&lt;&lt;endl;  <br />             <br />             prv=vtor;  <br />             vtor=sleden;  <br />             sleden=prv+vtor;<br /> <br />         }  <br /> return 0;  <br /> } <br /> [/code]<br /> Во твојот код и кога ќе замениш while (i&lt;=n) со while (sleden&lt;=n) пак ќе имаш проблем, бидејќи следниот број го пресметуваш на почетокот на циклусот, а го печатиш на крајот  без да провериш дали е поголем од n. Ова е мојот код а ако би сакал со твојот да работи треба само да вметнеш if услов во циклусот.<br /> [code]<br /> using namespace std;  <br />       <br /> int main()  <br />     {  <br />         int n,prv=0,vtor=1,sleden=0;  <br />         cin&gt;&gt;n;  <br />         cout&lt;&lt;1&lt;&lt;endl;  <br />         int i=1;  <br />         while(sleden&lt;=n)  <br />         {  <br />             sleden=prv+vtor;  <br />             prv=vtor;  <br />             vtor=sleden;<br /> <br />             if (sleden&lt;=n)<br />             cout&lt;&lt;sleden&lt;&lt;endl;  <br /> <br />         }  <br />         return 0;  <br />     }   <br /> [/code]]]></description>
				<guid isPermaLink="true">http://mendo.mk/jforum/posts/preList/460/3086.page</guid>
				<link>http://mendo.mk/jforum/posts/preList/460/3086.page</link>
				<pubDate><![CDATA[Sun, 26 Feb 2017 21:52:37]]> GMT</pubDate>
				<author><![CDATA[ Tose Todorov]]></author>
			</item>
			<item>
				<title>Re:pomos za zadaca </title>
				<description><![CDATA[ Хмм фала ]]></description>
				<guid isPermaLink="true">http://mendo.mk/jforum/posts/preList/460/3087.page</guid>
				<link>http://mendo.mk/jforum/posts/preList/460/3087.page</link>
				<pubDate><![CDATA[Sun, 26 Feb 2017 21:59:53]]> GMT</pubDate>
				<author><![CDATA[ Kiko206]]></author>
			</item>
	</channel>
</rss>