0_0_26446659_15973.cpp:2:38: error: stray '#' in program
The stones are numbered from 0 to m − 1 and the frogs are numbered from 1 to n. The i-th frog can jump over exactly ai stones in a single step, which means from stone j mod m to stone (j + ai ) mod m. Because all stones lie on a circle.
^
0_0_26446659_15973.cpp:3:1: error: stray '\241' in program
All frogs start their jump at stone 0, then each of them can jump as many steps as he wants. A frog will occupy a stone when he reach it, and he will keep jumping to occupy as much stones as possible. A stone is still considered ¡°occupied¡± after a frog jumped away. They would like to know which stones can be occupied by at least one of them. Since there may be too many stones, the frogs only want to know the sum of those stones¡¯ identifiers.
^
0_0_26446659_15973.cpp:3:1: error: stray '\260' in program
0_0_26446659_15973.cpp:3:1: error: stray '\241' in program
0_0_26446659_15973.cpp:3:1: error: stray '\261' in program
0_0_26446659_15973.cpp:3:1: error: stray '\241' in program
0_0_26446659_15973.cpp:3:1: error: stray '\257' in program
0_0_26446659_15973.cpp:3:444: error: stray '#' in program
All frogs start their jump at stone 0, then each of them can jump as many steps as he wants. A frog will occupy a stone when he reach it, and he will keep jumping to occupy as much stones as possible. A stone is still considered ¡°occupied¡± after a frog jumped away. They would like to know which stones can be occupied by at least one of them. Since there may be too many stones, the frogs only want to know the sum of those stones¡¯ identifiers.
^
0_0_26446659_15973.cpp:1:1: error: 'There' does not name a type
There are m stones lying on a circle, and n frogs are jumping over them.
^
0_0_26446659_15973.cpp:2:45: error: expected unqualified-id before numeric constant
The stones are numbered from 0 to m − 1 and the frogs are numbered from 1 to n. The i-th frog can jump over exactly ai stones in a single step, which means from stone j mod m to stone (j + ai ) mod m. Because all stones lie on a circle.
^
0_0_26446659_15973.cpp:3:451: error: 'ers' does not name a type
All frogs start their jump at stone 0, then each of them can jump as many steps as he wants. A frog will occupy a stone when he reach it, and he will keep jumping to occupy as much stones as possible. A stone is still considered ¡°occupied¡± after a frog jumped away. They would like to know which stones can be occupied by at least one of them. Since there may be too many stones, the frogs only want to know the sum of those stones¡¯ identifiers.
^
|
