You are here: Home / Problems and Problem Sets / 2014 NAIPC / 2014 NAIPC Problem Set

2014 NAIPC Problem Set

April 8th, 2014 | Categories: 2014 NAIPC

Here are the statements of the NAIPC 2014 Problems.

And, here is the data and judges’ reference solutions:

Problem Judge Data Solutions
A: Banjo

Submissions: 16
Solutions: 0
banjo.in
banjo.out
banjo_vanb.java
BanjoThreeie_artur.java
B: Cheats

Submissions: 7
Solutions: 1
cheats.in
cheats.out
cheats_vanb.java
cheats_howard.cc
C: Diplomacy

Submissions: 41
Solutions: 11
diplomacy.in
diplomacy.out
diplomacy_vanb.java
Diplomacy_artur.java
D: Fantastic Problem

Submissions: 1
Solutions: 1
fantastic.in
fantastic.out
fantastic_vanb.java
Fantastic-Problem1.cpp
Note: The cpp program runs too slowly, and was only used to verify the data
E: GCDs

Submissions: 36
Solutions: 21
gcd.in
gcd.out
gcd_vanb.java
GCDs_artur.java
GCDs_darko.java
gcds_zheng.cpp
F: Gold Bandits

Submissions: 40
Solutions: 8
gold.in
gold.out
Gold_Calvin.java
GoldBandits_artur.java
G: Integer Estate Agent

Submissions: 64
Solutions: 20
estate.in
estate.out
integerestate_vanb.java
iea-marcf.c
IntegerEstateAgent.java
H: Reconnaissance

Submissions: 26
Solutions: 11
reconnaissance.in
reconnaissance.out
recon_vanb.java
reconnaissance_zheng.cpp
I: Super Mario 169

Submissions: 20
Solutions: 13
mario.in
mario.out
mario_vanb.java
Mario_artur.java
Mario_darko.java
J: Two Knights’ Poem

Submissions: 51
Solutions: 19
twoknights.in
twoknights.out
twoknights_vanb.java
TwoKnights_artur.java
Leave a comment
No comments yet.
You must be logged in to post a comment.