|
2011 ACM ICPC Southeast USA Regional Programming Contest |
 |
 |
 |
|
Written by mbehr
|
|
Monday, 31 October 2011 15:05 |
| 2011 ACM ICPC Southeast USA Regional Programming Contest |
|
USA SOC had 3 teams participating in this years programming contest. It took place at the University of West Florida and included teams from UAB and UAT.
Our teams were:
Red Team -- Robert Fornof, Xingyu Lu, Adam Moore
White Team -- Christopher Camp, Hayden Chudy, Nick Thomas
Blue Team -- Christopher Johnson, Matthew Nguyen, KD Wilson
Mr. Howard Whitston submitted problems to the contest. One of his problems made it to the final set.
|
|
All 3 of our teams solved the following problem. Can you?
|
D: Vive la Difference
|
Take any four positive integers: a, b, c, d. Form four more, like this:
|a-b| |b-c| |c-d| |d-a|
That is, take the absolute value of the differences of a with b, b with c, c with d, and d with a. (Note that a zero could crop up, but they'll all still be non-negative.) Then, do it again with these four new numbers. And then again. And again. Eventually, all four integers will be the same. For example, start with 1, 3, 5, 9:
|
| 1 |
3 |
5 |
9 |
|
| 2 |
2 |
4 |
8 |
(1) |
| 0 |
2 |
4 |
6 |
(2) |
| 2 |
2 |
2 |
6 |
(3) |
| 0 |
0 |
4 |
4 |
(4) |
| 0 |
4 |
0 |
4 |
(5) |
| 4 |
4 |
4 |
4 |
(6) |
|
|
In this case, the sequence converged in 6 steps. It turns out that in all cases, the sequence converges very quickly. In fact, it can be shown that if all four integers are less then 2n, then it will take no more then 3*n steps to converge!
Given a, b, c, and d, figure out just how quickly the sequence converges.
|
|
Input
There will be several test cases in the input. Each test case consists of four positive integers on a single line (1 ≤ a, b, c, d ≤ 2,000,000,000), with single spaces for separation. The input will end with a line with four 0s.
|
|
Output
For each test case, output a single integer on its own line, indicating the number of steps until convergence. Output no extra spaces, and do not separate answers with blank lines.
|
|
Sample Input
1 3 5 9
4 3 2 1
1 1 1 1
0 0 0 0
|
|
Sample Output
6
4
0
|
| 2011 ACM ICPC Southeast USA Regional Programming Contest 29 Oct, 2011 |
|
|
|
|
|
Last Updated on Friday, 11 November 2011 11:24 |
|
|
Ms Jennifer Plott DefendsThesis |
|
|
|
|
Written by mbehr
|
|
Friday, 14 October 2011 11:01 |
University of South Alabama
School of Computer and Information Sciences
In partial fulfillment of the Requirements for the Degree of
Master of Science
Jennifer Plott
will defend her thesis
Minimizing Voter Error With Voter Verification Methods
Abstract
The Task-Technology-Individual Fit (TTIF) model is used to explain voter error, conceived as the fit among three sets of factors: aspects of the voting task, the technology used to support the voting process, and the individual voter attributes. The primary question of this study is: How does voter verification reduce voter error and improve voter confidence in democratic elections? Voters voting in either a polling place or by mail and using different verification methods were interviewed, and data were analyzed by both qualitative and quantitative methods. The results partially support relationships between each of the independent variables and verification, and correction/confirmation with voter confidence. The qualitative analysis indicates potential for deeper future study of voter verification using emergent themes.
Date: Monday, October 24, 2011
Time: 8:00 A.M.
Place: FCW 23
Faculty, students, and the general public are invited
All CIS graduate assistants are required to attend
Thesis Committee
Dr. Jeffrey Landry, Chair
Dr. Michael V. Doran
Dr. Corina Schulze
|
|
Last Updated on Friday, 11 November 2011 11:25 |
|
Written by mbehr
|
|
Monday, 10 October 2011 09:04 |
|
Kiss the CourtYard Goodby
No more wet feet as we move around the new building, Shelby Hall! |
|
Last Updated on Monday, 10 October 2011 09:10 |
|
|
Welcome Dr. Jeffrey "Todd" McDonald |
|
|
|
|
Written by mbehr
|
|
Friday, 23 September 2011 07:58 |
|
Welcome Dr. McDonald to SOC.
Dr. Jeffrey "Todd" McDonald received his Ph.D. in computer science from Florida State University, Tallahassee, FL, 2006.
|
|
Last Updated on Friday, 23 September 2011 08:08 |
|
Read more...
|
|
Kaspersky's America Cup at CSAW |
|
|
|
|
Written by mbehr
|
|
Wednesday, 21 September 2011 07:37 |
|
[IAS-Opportunities] Kaspersky's America Cup at CSAW
Polytechnic Institute of New York University
Dear Colleagues,
I wanted you and your students to know about Cyber Security Awareness Week's new affiliation with Kaspersky Lab this year will open up new opportunities for student research.
Winners of the Kaspersky American Cup at NYU-Poly's CSAW will win cash prizes and travel to the international Kaspersky Cup in Europe next spring. The Kaspersky American Cup should be particularly interesting to undergraduate and graduate students who aren't typically able to compete with the PhD-level published research in the AT&T Best Paper Challenge at CSAW. The Kaspersky American Cup welcomes UNPUBLISHED research, and all finalists will win trips to Brooklyn Nov. 9 - 11 to participate in CSAW and special Kaspersky conferences.
Even cybersecurity students who don't qualify for the finals in CSAW or the Kaspersky American Cup can participate in CSAW this year. We're planning to open the career fair to non-finalists from all schools; the Quiz Tournament is always lots of fun and a chance to win cash prizes; and the Kaspersky conferences will welcome student registrants.
I hope you will encourage your students to join the fun and opportunities to meet their peers and professionals. More information isathttp://www.poly.edu/csaw2011.
regards, nasir
For more information: http://www.kaspersky.com/educational-events/it_security_conference_2012_usa#tab=tab-1 |
|
Last Updated on Wednesday, 21 September 2011 07:43 |
|
|
|
|
<< Start < Prev 1 2 3 4 5 6 7 8 9 10 Next > End >>
|
|
Page 10 of 22 |
The News (RSS)
