According to ISO stadnard Metric tire code, tire dimensions are described by a string of letters and numbers
in the following format:
3-digit nonzero number: The nominal section width of the tire in millimeters,
the widest point from both outer edges.
/: Slash character for separation.
2- or 3-digit nonzero number: The aspect ratio of the sidewall height to the nominal section width of the tire, as a percentage.
Letter R indicating radial construction of the fabric carcass of the tire.
2-digit nonzero number: Diameter in inches of the wheel disk that the tires are designed to fit.
Rules of ACM (Any Car Modification) race specify a fixed tire dimensions for all participating cars.
Young racer Vasya has not been able to find this type of tire.
However, his car will still be approved for the race by judges only if radius of the wheel
(wheel disk radius plus sidewall height) differs by at most K percent from that of the specified tire.
Note: 1 inch = 25.4 millimeters. Number a differs from b by at most c percent when 100 × |a − b| / b ≤ c.
Input file format
First line of input file contains integer K.
Second and third lines contain Metric tire codes of specified tire and Vasya's tire respectively.
Tire codes contain only digits, R and slash (ASCII 47) characters.
Output file format
Output file must contain a single string — APPROVED if Vasya's car is approved to the race or DISAPPROVED otherwise.
Customer support department in an "Incomprehension Amateurs, Ltd" software company
has call center for answering users' questions.
Support prices are as follows:
1.
Answer to a question
10 USD
2.
Correct answer to a question
20 USD
3.
Correct answer to a question with explanation
40 USD
4.
Correct answer to a question which was already correctly answered before
+10 USD for each previous correct answer
So, for example, if user asks the same question three times,
first receives incorrect answer, then correct one, and the third time correct answer with explanation,
it will cost him 10 + 20 + (40 + 1 * 10) = 80 USD.
Customers are billed monthly according to call log.
Company engineers review the log and for each question determine:
unique number, so the equivalent questions have same numbers,
whether the answer was correct,
whether the answer was short or included detailed enough explanation.
Given that data, your program must calculate the payment amount.
Input file format
Input file contains number of calls N followed by N triples qiaixi, where
qi is integer question number, ai = 1 if the answer was correct, 0 otherwise,
xi = 1 if explanation was given, 0 otherwise.
Output file format
Output file must contain a single number — payment amount.
Your task is the most trivial one: given non-negative integer N, output N + 1.
The only complication is that the integer is given in an unknown base between
2 and 36 inclusive. Because of that, your program should output
all possible distinct answers in lexicographically increasing order.
Input file format
Input file contains integer N composed of digits from 0 to 9
and latin capital letters from A to Z, without leading zeroes.
Output file format
Output file must contain all possible distinct answers, one per line.
Answers must be output in the same format as input.
At the running contest, jury used a new computerized stopwatch system to ensure the most
accurate measuring of results. Unfortunately, despite very successfull trials,
the system malfunctioned during the actual contest.
Jury was so confident in the new system that it did not use the old mechanical stopwatches.
So the only way to determine outcome was to compare visual impressions of the people watching the contest.
M such impressions were recorded, each in one of two forms:
"runner A finished before runner B" and "runners A and B finished at the same time".
You task is to assign a place pi to each of N runners,
such that
If there is a record that A and B finished at the same time,
then pA = pB.
If there is a record that A finished before B,
then pA < pB.
Additionally, places must be allocated as densely as possible, i.e.
1 ≤ pi ≤ K for minimum possible value of K.
Input file format
Input file contains integers N M followed by M
pairs Ai Bi ci,
where
ci = 0 means the record "runners Ai and Bi finished at the same time",
ci = 1 means the record "runner Ai finished before Bi".
Output file format
Output file must contain either a single number −1, if the places could not be assigned,
or a sequence of N numbers pi.
If several solutions exist, output any of them.
Young programmer Vasya is learning the beginnings of the algorithm complexity theory.
For starters, he wants to be able to quickly estimate the number of iterations
of nested loops.
As a first example, he wrote the following code:
C
Pascal
long long f(int n)
{
long long ans = 0;
for (int i = 1; i <= n; i++)
for (int j = i+1; j <= n; j++)
for (int k = j+1; k <= n; k++)
ans++;
return ans;
}
function f(n: integer): int64;
var i, j, k: integer;
begin
result := 0;
for i := 1 to n do
for j := i+1 to n do
for k := j+1 to n do
inc(result);
end;
Using your knowledge of the subject,
help Vasya calculate f(n) for given n.
Igor is a computer science freshman student.
As opposed to most of his classmates,
he actually knows a little about computer programming.
Because of this, other students often ask him to write their homework
assignments for the "Introductory Programming" course.
He noticed that, although each assignment is unique,
they usually follow a simple pattern.
In particular, one assignment states:
"Count the number of integers in the array which are
[greater than|less than|equal to|not equal to] [value]",
where parts in brackets differ from student to student.
Assignments also contain sample input and output to
encourage students to test their programs before submission.
Igor have many classmates, so to save time
he decided to write a homework generator.
He started with the following template:
count := 0;
for i := 1 to N do
if a[i] #cond# #value# then
Inc(count);
And now he wants to substitute #cond# and #value#
based on the sample input from the assignment.
Of course, generated program might be different from what was required
in the assignment, but at least it would pass the sample test —
his classmates are grateful to have even that.
Do you know enough Introductory Programming to help Igor?
Your program will be given sample input — an array of N integer values,
and the corresponding output R.
It must find such substitution strings for
#cond# and #value# that
after execution of the code snippet above count will be equal to R,
or determine that it is impossible.
Input file format
Input file contains integer N followed by N integers ai
and then by integer R.
Output file format
The first line of output must contain one of the
strings '<', '>', '=', '<>' — substitution for #cond#.
The second line must contain an integer — substitution for #value#.
If there is no solution,
output file must contain a single character '?' (ASCII 63).
If there is more then one solution, output any of them.
Underwater arithmetic is very elementary.
There are just two operations: WITH and WITHOUT
which mean addition and subtraction respectively.
Underwater mathematicians did not yet invent brackets,
so all expressions are calculated from right to left.
For example, the expression 3 WITH 5 WITHOUT 4 WITHOUT 7
is calculated as (3 + (5 − (4 − 7))).
Scientists of Nearsea Institute of Underwater Arithmetic
need a program to evaluate such expressions.
Input file format
First line of input file contains a single integer N.
Following 2 × N + 1 lines describe the expression.
Odd lines contain integer operands, even lines contain operations.
Output file format
Output file must contain a single integer — calculation result.
The puzzle game of Sudoku is played on a board of N2 × N2 cells.
The cells are grouped in N × N squares of N × N cells each.
Each cell is either empty or contains a number between 1 and N2.
The sudoku position is correct when numbers in
each row, each column and each square are different. The goal of the game is, starting from
some correct position, fill all empty cells so that the final position is still correct.
This game is fairly popular in the Internet, and there are many sites which allow
visitors to solve puzzles online. Such sites always have a subroutine to determine a correctness
of a given position.
You are to write such a routine.
Input file format
Input file contains integer N, followed by N4 integers — sudoku position.
Empty cells are denoted by zeroes.
Output file format
Output file must contain a single string 'CORRECT' or 'INCORRECT'.
