摘要：
Eefun Guessing Words Eefun is currently learning to read. His way of learning is unique, by trying to make every possible substring from a given strin 阅读全文
摘要：
Given a integer N. Find number of possible ways to represent N as a sum of at most five cubes. Input First line contains N. 1<=N<=125000. Output Outpu 阅读全文
摘要：
You are given n points with integer coordinates on the plane. Points are given in a way such that there is no triangle, formed by any three of these n 阅读全文
摘要：
Consider a sequence [a1, a2, ... , an]. Define its prefix product sequence . Now given n, find a permutation of [1, 2, ..., n], such that its prefix p 阅读全文
摘要：
Weird Game Yaroslav, Andrey and Roman can play cubes for hours and hours. But the game is for three, so when Roman doesn't show up, Yaroslav and Andre 阅读全文
摘要：
Regular Bridge An undirected graph is called k-regular, if the degrees of all its vertices are equal k. An edge of a connected graph is called a bridg 阅读全文
摘要：
Make Triangle Chayanika loves Mathematics. She is learning a new chapter geometry. While reading the chapter a question came in her mind. Given a conv 阅读全文
摘要：
Manipulate Dwarfs In a small village beyond seven hills and seven seas, Snow White lives together with N dwarves who spend all their time eating and p 阅读全文
摘要：
Fata7y Ya Warda! Druid (AKA Amr Alaa El-Deen) and little EOIers have finished their training and they are playing "Fatta7y ya warda!". It's a kids gam 阅读全文
摘要：
Gone Fishing John is going on a fishing trip. He has h hours available, and there are n lakes in the area all reachable along a single, one-way road. 阅读全文
摘要：
Divisible Group Sums Given a list of N numbers you will be allowed to choose any M of them. So you can choose in NCM ways. You will have to determine 阅读全文
摘要：
Expression Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 952 Accepted Submission(s): 573 Proble 阅读全文
摘要：
B. Complete The Graph time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output B. Complete The Gr 阅读全文