Yahoo Poland Wyszukiwanie w Internecie

Search results

1. codeforces.com › problemset › problemProblem - 148A - Codeforces

   codeforces.com › problemset › problem

   • Zapisane w pamięci cache

   Problem - 148A - Codeforces. A. Insomnia cure. time limit per test. 2 seconds. memory limit per test. 256 megabytes. «One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.

2. github.com › thiagovas › Solutions-to-Online-JudgesSolutions-to-Online-Judges/Codeforces/148A - Insomnia cure.cpp at...

   github.com › thiagovas › Solutions-to-Online-Judges

   • Zapisane w pamięci cache

   You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window.

3. github.com › FahimFBA › Codeforces-SolutionCodeforces-Solution/148A Insomnia Cure/solve.cpp at main - GitHub

   github.com › FahimFBA › Codeforces-Solution

   • Zapisane w pamięci cache

   My solutions from Codeforces. 💻. Contribute to FahimFBA/Codeforces-Solution development by creating an account on GitHub.

4. chucs.github.io › Insomnia-cureCodeForces 148A | CHUPCCA

   chucs.github.io › Insomnia-cure

   • Zapisane w pamięci cache

   7 mar 2019 · CodeForces 148A - Insomnia cure. «One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine. However, just counting dragons was boring as well, so she entertained herself at best she could.

5. github.com › JubaerHosain › Codeforces-Solutioncodeforces-solution/148A - Insomnia cure.java at master - GitHub

   github.com › JubaerHosain › Codeforces-Solution

   • Zapisane w pamięci cache

   You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window.

6. codeforces.com › blog › entryCodeforces Round #105 (Div. 2): editorial - Codeforces

   codeforces.com › blog › entry

   • Zapisane w pamięci cache

   148A - Insomnia cure. The number of dragons D can be quite small, so the problem can be solved in a straightforward way, by iterating over dragons 1 through D and checking each dragon individually. Time complexity of such solution is O(D). There exists a smarter solution with O(1) complexity, based on inclusion-exclusion principle.

7. git.jl-k.com › mohandsakr › my-problem-solving-solutions-on-codeforcesmy-problem-solving-solutions-on-codeforces.com/148 A. Insomnia...

   git.jl-k.com › mohandsakr › my-problem-solving-solutions-on-codeforces

   • Zapisane w pamięci cache

   It is my solution to the problems on the codeforces.com site. note this is not my coding style it is just for the fast writing in problem-solving contests - mohandsakr/my-problem-solving-solutions-...