Access and Communication

Each team is allowed to use a single laptop with Internet access. No external screen/monitor or keyboard is allowed.
Internet access may only be used for browsing documentation. Browsing any other website is prohibited. The allowed sites are the following:

http://docs.oracle.com/javase/8/docs/api/
http://docs.python.org/
http://www.cplusplus.com/reference/
http://cppreference.com/
If other sites for documentation are desired, they must be pre-approved by a member of the ProCo staff

The use of external code or pre-writted code is prohibited.
External communication is prohibited.
The only programs allowed are IDE, editors, web browsers, and programming tools. The use of all other programs are prohibited.

Input and Output

All input will be received from console input (System.in in Java, cin in C++, stdin in C, sys.stdin in Python 2.7).
All output should be sent to console output (System.out in Java, cout in C++, stdout in C, sys.stdout in Python 2.7).
Each program will specify its own output format. Format all output as closely as possible to the specifications. This includes spacing, capitalization, and punctuation. See below for examples for input and output.

#include <iostream>
using namespace std;

int main() {
    int a, b;
    cin >> a >> b; //read in input from stdin
    cout << a + b << "\n"; //prints a + b to stdout
    return 0;
}

import java.io.*;
import java.util.*;
import java.lang.*;

//class name must be the TASK name of the problem
class addtwonums {

    public static void main(String[] args) throws java.lang.Exception {

        //make an input reader called input
        //input.readLine() reads in the next line of input
        BufferedReader input = new BufferedReader(new InputStreamReader(System.in));

        //a StringTokenizer st can parse space-separated input in a line (input.readLine())
        StringTokenizer st = new StringTokenizer(input.readLine());

        //st.nextToken() gets the next space-separated part of input
        //Integer.parseInt(st.nextToken()) interprets token as an integer
        int a = Integer.parseInt(st.nextToken());
        int b = Integer.parseInt(st.nextToken());
        System.out.println(a + b);
    }
}

#include <stdio.h>
 
int main(void) {
    int a, b;
    scanf("%d %d", &a, &b); //read in input from stdin
    printf("%d\n", a + b); //prints a + b to stdout
    return 0;
}

a, b = [int(x) for x in raw_input().split()]
print a + b

Submissions

We will be accepting submissions in C, C++, Java, and Python 2.7.
Solutions will be graded using GNU C++11, Java 1.8.0, and Python 2.7 on Linux machines.
All files must be named in the format specified on your problem statement. File extensions must be the following:
- C: problem.c
- C++: problem.cc or problem.cpp
- Java: problem.java
- Python: problem.py
Java submissions must follow these rules:

Name of the main class should be the task name.
All classes should be in one file.
Don't include a package statement.
Avoid using scanner for efficiency.

You will be submitting your (single) code file to us using a web interface. If you are using Java and want to create multiple classes, put all of the class declarations into one file.

Speed Round (Round 1)

The speed round duration will be 2 hours and will consist of 10 unweighted problems.

Submissions will be run on a set of test cases which are not revealed to the teams during the contest, and they are accepted as correct if they pass on all of the test cases. Teams will be notified whether their submission is correct within about a minute. If the submission is correct, no further points can be awarded for the problem. If the submission is not accepted, teams are free to resubmit the problem. There is no penalty for incorrect submissions and no limit on the number of submissions per problem.

The submissions from a team do not all need to be in the same language. For example, the same team could solve novA in C, novD in Java, and novF in C++.

Scoring

Teams are ranked according to the most problems solved. Teams who solve the same number of problems will be ranked in accordance with the earliest time of their last correct submission.

Special Round (Round 2)