ACMSolver :: Art of Programming Contest, Tips and Tricks for C, C++, Java

Probable Venues are as follows:

2010 Bangladesh University of Engineering and Technology
2011 University of Liberal Arts Bangladesh

Source: http://icpcasia.blogspot.com/2008/07/wait-list-to-host-acm-icpc-asia.html

Registration opens 15-Aug-2010.
Send an electronic payment for the 2010 Registration Fees, $63.00 per team.
Details: http://www.socalcontest.org/current/index.shtml

ACMsolver on Yahoo.com? (for search keyword: acm icpc)

ACMSolver on Yahoo!

What about  Google.com?

ACMSolver on google?

These are the results of a few SEO techniques that I applied on this site. Happy Programming!

As I remember I started programming when I was 9 years old in my third year at school. My first programming language was Basic. One day I found an old book describing the principles of solving differential equations. I didn’t understand them at all but the examples were given in Basic and I began learning the language.

When I had grasped the fundamentals, I started coding. First I wrote programs just for mastering the language and then went on with the ones closer to real life problems. During the first year of my self-education I tried to write small games – mathematical and arcades mainly. Later I wrote editors, image viewers, and code-helping utilities. (My own 3-D shooter game I left unfinished.)

I participated in my very first programming contest in the sixth form. It was the Saint-Petersburg School Olympiad where I got the last but one of the third category certificates for solving several problems. By that time I had been already attending a special programming group for kids. At such circles children had an opportunity to study Logo, Pascal, C, Basic and learn how to solve algorithm problems. Thus by the time when I started taking part in real programming contests, I’d already had some programming skill.

[...]

Programming Competition :COCI : Croatian Open Competition in Informatics
USACO : United States of America Computing Olympiad
IOI Thailand League
Al Zimmermann’s Programming Contests
Google Code Jam 2010
Codeforces BETA

Online Judge && Problem Container :Programming.in.th : เว็บยอดฮิตโดยคนไทย
USACO : United States of America Computing Olympiad
IARCH Problem Archive
Sphere Online Judge
Timus Online Judge
TopCoder Problem Archive
UVa Online Judge
PKU JudgeOnline
British Informatics Olympiad
ALL IOI TASK (1989 – 2008) : รวมโจทย์ IOI

IIT Kanpur, Algorithm Applets Page
Thailand OI Official Website
TopCoder Algorithm Tutorial
COME ON CODE ON
ACMSolver
Algorithmist

IOI Information :IOI Official Website

by Zac Friggstad

The UVa Online Judge is a web site where you can try solving a number of algorithmic problems by implementing the solution in C, C++, Pascal or Java. The problems are usually described in a few paragraphs and some sample input and output is given for the purpose of illustration. For example, the problem might state that a weighted, undirected graph is given as input and you are to output the cost of the minimum spanning tree.

Solving a problem on the UVa Online Judge requires the following:

• Read and understand the problem statement
• Devise an algorithm to solve the problem
• Implement the algorithm in C, C++, Pascal or Java
• Finally, if you are convinced of its correctness, upload your code to have it judged.

The judging is automated (they use benchmark input and output files), so you can typically expect a response within a few seconds.

Getting Started: A Step-By-Step Introduction

The website is located at http://uva.onlinejudge.org/. After registering, choose the “browse problems” link on the lower-left side of the main page. From here, you will be asked to choose which problem set volume you want to browse.

Since this is a tutorial, I will suggest a problem. Follow the “Contest Volumes” link and select “Volume CXI” from here. We are going to try problem number “11172: Relational Operator”, so select it from the list.

Begin by reading the problem statement; hopefully you realize that the problem is absolutely trivial. Don’t worry, there are plenty of far more interesting problems on the archive. This problem is chosen to help you get used to the mechanics of the judge.

Make sure you are comfortable with the input and output specifications. When you submit the problem, the judge will supply their own input based on the input specification and the judge expects the output to conform to the specification in the problem description.

Begin by coding the problem. You should read the input from standard input and write to standard output (e.g. cin and cout in C++ or scanf() and printf() in C). For example, the following C++ code would solve this problem:

#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a >> b;
if (a < b) cout << '<' << endl;
else if (a > b) cout << '>' << endl;
else cout << '=' << endl;
}
return 0;
}

Try compiling this problem and testing it with the sample data; I suggest creating a file with the sample input and supplying this file to the program as standard input. For example, if the program name is ‘relational’ and the file name is ‘input.dat’, then you can test your code by executing ./relational < input.dat from a terminal window.

Does it work? Great! You are ready to try submitting it to the judge. In the upper-right corner of the problem description page you should see the graphic . Clicking on this will bring you to the submission page for this problem. Select the language you coded the problem in and upload the file using the upload tool. Once you are ready, click submit and hope for the best!

You can check the status of your submission by selecting the “My Submissions” link on the left side of the page. The “Verdict” heading will tell you if it was solved or if there was a problem (e.g. wrong answer, ran too long, crashed, too much memory was used, compile error, etc).

Now go ahead and solve some more problems!

[...]