https://mediawiki.zeropage.org/index.php?action=history&feed=atom&title=Pairsumonious_Numbers%2F%EA%B6%8C%EC%98%81%EA%B8%B0 2026-05-14T22:11:10Z Revision history for this page on the wiki MediaWiki 1.39.8 https://mediawiki.zeropage.org/index.php?title=Pairsumonious_Numbers/%EA%B6%8C%EC%98%81%EA%B8%B0&diff=37454&oldid=prev 2012-08-31T07:09:22Z

<p></p> <p><b>New page</b></p><div> <br /> #include&amp;lt;stdio.h&amp;gt;<br /> #include&amp;lt;memory.h&amp;gt;<br /> #include&amp;lt;algorithm&amp;gt;<br /> #include&amp;lt;list&amp;gt;<br /> #define M 100<br /> #define N 12<br /> using namespace std;<br /> list &amp;lt;int&amp;gt; sum;<br /> int ans[N], n, flag = 0, checkans[M], temp[M], cnt = 0;<br /> int checker(){<br /> memset(checkans, 0, sizeof(int) * M);<br /> cnt = 0;<br /> for(int i = 1; i&amp;lt;=n; i++){<br /> for(int j = i+1; j&amp;lt;=n; j++){<br /> checkans[cnt++] = ans[i] + ans[j];<br /> }<br /> }<br /> sort(checkans, checkans+cnt);<br /> for(int i = 0; i&amp;lt;cnt; i++){<br /> if(checkans[i] != temp[i])return 0;<br /> }<br /> return 1;<br /> }<br /> void back(int s, list &amp;lt;int&amp;gt;::iterator iter){<br /> list &amp;lt;int&amp;gt;::iterator it1, it2, temp, tempit;<br /> int tempsum;<br /> if(s == n+1 &amp;amp;&amp;amp; checker()){<br /> flag = 1;<br /> return;<br /> }<br /> <br /> for(it1 = iter; it1 != sum.end() &amp;amp;&amp;amp; !flag; it1++){<br /> temp = it1;<br /> temp++;<br /> for(it2 = temp; it2 != sum.end() &amp;amp;&amp;amp; !flag; it2++){<br /> tempsum = (ans[s-1] + ans[s-2] + *it1 + *it2)/2;<br /> ans[s] = tempsum - ans[s-1] - ans[s-2];<br /> if(ans[s-2] &amp;lt;= ans[s-1] &amp;amp;&amp;amp; ans[s-1] &amp;lt;= ans[s]){<br /> tempit = find(it2, sum.end(), ans[s-1] + ans[s]);<br /> //back(s+1, find(it2, sum.end(), ans[s-1] + ans[s]));<br /> back(s+1, tempit);<br /> }<br /> }<br /> }<br /> }<br /> int main(void)<br /> {<br /> <br /> int m, i, tempsum, start = 1;<br /> while(scanf(&quot;%d&quot;, &amp;amp;n) == 1){<br /> if(start == 1){<br /> start = 0;<br /> }<br /> else if(start == 0){<br /> printf(&quot;\n&quot;);<br /> }<br /> flag = 0;<br /> memset(temp, 0, sizeof(int) * M);<br /> memset(ans, 0, sizeof(int) * N);<br /> while(!sum.empty())sum.pop_back();<br /> for(i = 0; i&amp;lt;n*(n-1)/2; i++){<br /> scanf(&quot;%d&quot;, &amp;amp;temp[i]);<br /> }<br /> m = i;<br /> sort(temp, temp + m);<br /> for(i = 2; i&amp;lt;m; i++){<br /> sum.push_back(temp[i]);<br /> }<br /> <br /> list&amp;lt;int&amp;gt;::iterator iter, tempit;<br /> for(iter = sum.begin(); iter!=sum.end(); iter++){<br /> tempsum = (temp[0] + temp[1] + *iter)/2;<br /> ans[1] = tempsum - *iter;<br /> ans[2] = tempsum - temp[1]; <br /> ans[3] = tempsum - temp[0];<br /> if(ans[1] &amp;lt;= ans[2] &amp;amp;&amp;amp; ans[2] &amp;lt;= ans[3]){<br /> tempit = find(sum.begin(), sum.end(), ans[2]+ans[3]);<br /> //back(4, find(sum.begin(), sum.end(), ans[2] + ans[3]));<br /> back(4, tempit);<br /> if(flag)break;<br /> }<br /> }<br /> if(!flag)printf(&quot;Impossible&quot;);<br /> else{<br /> for(i = 1; i&amp;lt;=n; i++){<br /> printf(&quot;%d&quot;, ans[i]);<br /> if(i != n)printf(&quot; &quot;);<br /> }<br /> }<br /> <br /> }<br /> <br /> <br /> return 0;<br /> }<br /> <br /> 10546028 10202 Pairsumonious Numbers Accepted C++ 0.008 2012-08-31 07:07:56<br /> </div>

imported>trailblaze