Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.
ContestId |
Name |
Phase |
Frozen |
Duration (Seconds) |
Relative Time |
Start Time |
|---|---|---|---|---|---|---|
| 316 | ABBYY Cup 3.0 | FINISHED | False | 14400 | 360781199 | June 12, 2013, 1 p.m. |
Solved$ |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
|---|---|---|---|---|---|---|
| ( 533 ) | E3 | Summer Homework | PROGRAMMING | data structures math | 2500 |
B'By the age of three Smart Beaver mastered all arithmetic operations and got this summer homework from the amazed teacher: You are given a sequence of integers a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an. Your task is to perform on it m consecutive operations of the following type: Smart Beaver planned a tour around great Canadian lakes, so he asked you to help him solve the given problem. The first line contains two integers n and m (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x892 xc2 xb7105) -- the number of integers in the sequence and the number of operations, correspondingly. The second line contains n integers a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an (0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105). Then follow m lines, each describes an operation. Each line starts with an integer ti (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ti xe2 x80 x89 xe2 x89 xa4 xe2 x80 x893) -- the operation type: The input limits for scoring 30 points are (subproblem E1): The input limits for scoring 70 points are (subproblems E1+E2): The input limits for scoring 100 points are (subproblems E1+E2+E3): For each query print the calculated sum modulo 1000000000 (109).'... |
| ABBYY Cup 3.0. Solutions |
No solutions yet.