Problem 1438. USC Spring 2013 ACM: Relief Supplies

Created by Richard Zapor

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This Challenge is to solve the</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://contest.usc.edu/index.php/Spring13/Home\"><w:r><w:t>USC Spring 2013 ACM Contest</w:t></w:r></w:hyperlink><w:r><w:t> Problem A, Relief Supplies.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The theme for Spring 2013 is Snowstorm.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Summary of Challenge is to Optimize your family's most needed Relief Supplies while never being the sole maximum distribution receiver of your preferred item.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Distribution is to N families; T items; quantity B of each item; Selected item is S. 2&lt;=N&lt;101; S&lt;=T; 1&lt;=B,T&lt;101</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Distribution of T=5 and B=2 to 10 families would be 1 2 3 4 5 1 2 3 4 5. Distribution of items cycle.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Return the Position in Line of N families that is the last to receive the second most of your selected item or the last to receive the most of the item if multiple families receive this maximum amount.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Input NTSB:</w:t></w:r><w:r><w:t> 4 6 3 5 </w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:b/></w:rPr><w:t>Output:</w:t></w:r><w:r><w:t> 3</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Input NTSB:</w:t></w:r><w:r><w:t> 4 3 6 1 </w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:b/></w:rPr><w:t>Output:</w:t></w:r><w:r><w:t> 4</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Winner Cao's C solution (15 minutes): \"For Loops - tsk tsk\"</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[for (int i=0;i<b;++i)\n\nfor (int j=0;j<t;++j)\n{\nif (j==s-1)\n{\na[tot%n]++;\n}\ntot++;\n}\nfor (int i=0;i<n;++i)\nc[i] = a[i];\nsort(a, a+n);\nint ans = 0;\nfor (int i=0;i<n;++i)\nif (c[i]==a[n-2])\nans=i;\nprintf(\"Data Set %d:\\n%d\\n\\n\", I, ans+1);]]></w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

This Challenge is to solve the <a href = "http://contest.usc.edu/index.php/Spring13/Home">USC Spring 2013 ACM Contest</a> Problem A, Relief Supplies.The theme for Spring 2013 is Snowstorm.Summary of Challenge is to Optimize your family's most needed Relief Supplies while never being the sole maximum distribution receiver of your preferred item.Distribution is to N families; T items; quantity B of each item; Selected item is S. 2&lt;=N&lt;101; S&lt;=T; 1&lt;=B,T&lt;101Distribution of T=5 and B=2 to 10 families would be 1 2 3 4 5 1 2 3 4 5. Distribution of items cycle.Return the Position in Line of N families that is the last to receive the second most of your selected item or the last to receive the most of the item if multiple families receive this maximum amount.Input NTSB: 4 6 3 5 Output: 3Input NTSB: 4 3 6 1 Output: 4Winner Cao's C solution (15 minutes): "For Loops - tsk tsk"<pre class="language-matlab">for (int i=0;i&lt;b;++i)
</pre><pre class="language-matlab">for (int j=0;j&lt;t;++j)
{
if (j==s-1)
{
a[tot%n]++;
}
tot++;
}
for (int i=0;i&lt;n;++i)
c[i] = a[i];
sort(a, a+n);
int ans = 0;
for (int i=0;i&lt;n;++i)
if (c[i]==a[n-2])
ans=i;
printf("Data Set %d:\n%d\n\n", I, ans+1);
</pre>

Solve

Solution Stats

20 Solutions
6 Solvers

Last Solution submitted on Jan 22, 2019

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

William on 22 Jan 2019

I believe the problem description has an error. There are two examples given at the end of the description, and they are given as "Input NTSB". Should be "Input NTBS".

Problem Recent Solvers6

Problem Tags

2013 contest usc

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 1438. USC Spring 2013 ACM: Relief Supplies

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers6

Suggested Problems

More from this Author246

Problem Tags

Community Treasure Hunt

Problem 1438. USC Spring 2013 ACM: Relief Supplies

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers6

Suggested Problems

More from this Author246

Problem Tags

Community Treasure Hunt

Players