Hello guys, we organized some contests (like ICPC), and we are looking for a plagiarism checker for up to 100 users. Which checker do you advise? (paid checkers are also fine)

# | User | Rating |
---|---|---|

1 | tourist | 3557 |

2 | Radewoosh | 3468 |

3 | Um_nik | 3429 |

4 | Petr | 3354 |

5 | Benq | 3286 |

6 | mnbvmar | 3280 |

7 | wxhtxdy | 3276 |

7 | LHiC | 3276 |

9 | ecnerwala | 3214 |

10 | yutaka1999 | 3190 |

# | User | Contrib. |
---|---|---|

1 | Errichto | 191 |

2 | Radewoosh | 180 |

3 | tourist | 173 |

4 | PikMike | 165 |

4 | Vovuh | 165 |

4 | antontrygubO_o | 165 |

7 | rng_58 | 161 |

8 | Um_nik | 157 |

9 | majk | 156 |

10 | 300iq | 155 |

when i study , after the read problem , i found the solution I am geting lazy and i am saying "i can take accepted this problem so i dont need to solve" after then i am looking another problem its repeats until i cant find the solution.

is that false?

how can i read to c++ string from position one not zero

Usaco > 2006 > november > gold > Asteroids

question { Problem 1: Asteroids [Gary Sivek, 2004]

Bessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 <= N <= 500). The grid contains K asteroids (1 <= K <= 10,000), which are conveniently located at the lattice points of the grid.

Fortunately, Bessie has a powerful weapon that can vaporize all the asteroids in any given row or column of the grid with a single shot. This weapon is quite expensive, so she wishes to use it sparingly. Given the location of all the asteroids in the field, find the minimum number of shots Bessie needs to fire to eliminate all of the asteroids.

PROBLEM NAME: asteroid

INPUT FORMAT:

Line 1: Two integers N and K, separated by a single space.

Lines 2..K+1: Each line contains two space-separated integers R and C (1 <= R, C <= N) denoting the row and column coordinates of an asteroid, respectively.

SAMPLE INPUT (file asteroid.in):

3 4 1 1 1 3 2 2 3 2

INPUT DETAILS:

The following diagram represents the data, where "X" is an asteroid and "." is empty space:

X.X

.X.

.X.

OUTPUT FORMAT:

- Line 1: The integer representing the minimum number of times Bessie must shoot.

SAMPLE OUTPUT (file asteroid.out):

2

OUTPUT DETAILS:

Bessie may fire across row 1 to destroy the asteroids at (1,1) and (1,3), and then she may fire down column 2 to destroy the asteroids at (2,2) and (3,2). }

/////////////////////////////////////////////

I have one more question about this problem. Is there a good way to find which rows and columns

Watch Star Wars in terminal telnet towel.blinkenlights.nl

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/20/2019 05:30:29 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|