KayacanV's blog

By KayacanV, history, 13 months ago, In English

Dear codeforces community,

The Host Scientific Committee of the European Girls' Olympiads in Informatics (EGOI) 2022 invites the competitive programming community to help to create the problem set for EGOI 2022.

EGOI 2022 Website

The competition is planned to be conducted on-site on June 26-July 2, in Antalya, Turkey. We will be pleased to invite the authors of the selected tasks to the on-site contest.

The tasks should be original and should not have been seen by any potential EGOI 2022 contestants. The topics and techniques used in the tasks must conform to the IOI syllabus at: https://ioinformatics.org/page/syllabus/12

The language is English.

Minimum contents of submission:

  • author(s) information: name, e-mail, affiliation, country
  • task statement (PDF preferred)
  • description of the desired solution.

Also recommended:

  • solution implementation in C++
  • suggestions for grading
  • test data and checkers
  • alternate solutions or expected near-solutions
  • background information on the task and any other comments relevant to the task.

Submission deadline: January 31, 2022.

Attach all files for one task in a single zip archive and submit your proposals via e-mail to Tolga Can at tcantr@gmail.com

Authors of submitted tasks will be recognized on the EGOI 2022 website by listing their name, affiliation, and country (unless they specifically decline this).

Thank you.

EGOI 2022 Host Scientific Committee

Full text and comments »

 
 
 
 
  • Vote: I like it
  • +87
  • Vote: I do not like it

By KayacanV, history, 2 years ago, In English

Hello, we will held a contest with cms, and we are wondering there is any suggestion to speed up to the evaluation process?

For example, if one of the test cases get the time limit in the subtask, it still continues to test other test cases in the same subtask. Is there an option in cms to stop the evaluation for same subtask after getting the WA/TLE.

Full text and comments »

Tags cms
 
 
 
 
  • Vote: I like it
  • +15
  • Vote: I do not like it

By KayacanV, 4 years ago, In English

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)

Full text and comments »

 
 
 
 
  • Vote: I like it
  • +42
  • Vote: I do not like it

By KayacanV, history, 4 years ago, In English

I have a private contest in hackerank as a part of algorithm camp, and I want to kick or hide some of people from leaderboard. Is there a way to do it? ( I could not find the way in the management console nor the answer in google)

Full text and comments »

 
 
 
 
  • Vote: I like it
  • +17
  • Vote: I do not like it

By KayacanV, 7 years ago, In English

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?

Full text and comments »

 
 
 
 
  • Vote: I like it
  • -17
  • Vote: I do not like it

By KayacanV, 8 years ago, In English
 
 
 
 
  • Vote: I like it
  • +75
  • Vote: I do not like it

By KayacanV, 8 years ago, In English

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

Full text and comments »

 
 
 
 
  • Vote: I like it
  • +3
  • Vote: I do not like it

By KayacanV, 9 years ago, In English

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

Full text and comments »

 
 
 
 
  • Vote: I like it
  • -1
  • Vote: I do not like it

By KayacanV, 9 years ago, In English

unrated dalex Master dalex how could they ?

Full text and comments »

 
 
 
 
  • Vote: I like it
  • -24
  • Vote: I do not like it

By KayacanV, 9 years ago, In English
 
 
 
 
  • Vote: I like it
  • +3
  • Vote: I do not like it

By KayacanV, 9 years ago, In English

Watch Star Wars in terminal telnet towel.blinkenlights.nl

Full text and comments »

 
 
 
 
  • Vote: I like it
  • -23
  • Vote: I do not like it