зеркало из https://github.com/github/dmca.git
96 строки
2.9 KiB
Markdown
96 строки
2.9 KiB
Markdown
|
DMCA Notification
|
||
|
|
|
||
|
|
The following information is presented for the purposes of removing web
|
||
|
|
content that infringes on our copyright per the Digital Millennium
|
||
|
|
Copyright Act. We appreciate your enforcement of copyright law and support
|
||
|
|
of our rights in this matter.
|
||
|
|
|
||
|
|
Identification of Copyrighted Work
|
||
|
|
|
||
|
|
The copyrighted work at issue is the text that appears on *codility.com*
|
||
|
|
<http://codility.com/> and its related pages. The pages in question contain
|
||
|
|
a clear copyright notification and are the intellectual property of the
|
||
|
|
complainant.
|
||
|
|
|
||
|
|
Identification of Infringed Material
|
||
|
|
|
||
|
|
The following copyrighted paragraph have been allegedly copied from the
|
||
|
|
copyrighted work:
|
||
|
|
|
||
|
|
https://github.com/antonioparisi/stack-machine
|
||
|
|
|
||
|
|
Task name: Stack machine emulator : codility/stack_machine_emulator
|
||
|
|
<https://codility.com/tasks/stack_machine_emulator>
|
||
|
|
|
||
|
|
text from: A stack machine is a simple system that performs arithmetic
|
||
|
|
|
||
|
|
text to: is O(N) (not counting the storage required for input arguments
|
||
|
|
|
||
|
|
https://github.com/giuseppecossu/programming-exercises/blob/master/AdjacentPoint/AdjacentPoint.cpp
|
||
|
|
|
||
|
|
Adjacent point pairs count : codility/adjacent_point_pairs_count
|
||
|
|
<https://codility.com/tasks/adjacent_point_pairs_count>
|
||
|
|
|
||
|
|
text from: Write a function that, given a non-empty zero-indexed array A
|
||
|
|
|
||
|
|
array A is an integer within the * range[ 2,147,483,648..2,147,483,647
|
||
|
|
|
||
|
|
https://github.com/prithivm/Codility/blob/master/SymmetricBinaryRoot/Problem
|
||
|
|
|
||
|
|
task name: Symmetric binary root count : codility
|
||
|
|
/symmetric_binary_root_count
|
||
|
|
<https://codility.com/tasks/symmetric_binary_root_count>
|
||
|
|
|
||
|
|
text from: An integer obtained by reversing the bits of a given
|
||
|
|
|
||
|
|
text to: complexity is O(sqrt(N)); * expected worst-case space complexity
|
||
|
|
is O(1
|
||
|
|
|
||
|
|
https://github.com/minsikzzang/stack-machine/blob/master/Readme.md
|
||
|
|
|
||
|
|
task name: Stack machine emulator : codility/stack_machine_emulator
|
||
|
|
<https://codility.com/tasks/stack_machine_emulator>
|
||
|
|
|
||
|
|
text from: A stack machine is given. It contains an internal stack
|
||
|
|
|
||
|
|
text to: Given string S = "11++" the function should return 1
|
||
|
|
|
||
|
|
https://github.com/antonioparisi/stack-machine/blob/master/README.md
|
||
|
|
|
||
|
|
task name: Stack machine emulator : codility/stack_machine_emulator
|
||
|
|
<https://codility.com/tasks/stack_machine_emulator>
|
||
|
|
|
||
|
|
text from:A stack machine is a simple system that performs arithmetic
|
||
|
|
|
||
|
|
text to: s O(N) (not counting the storage required for input arguments
|
||
|
|
|
||
|
|
Notifying Party:
|
||
|
|
|
||
|
|
Codility Limited
|
||
|
|
|
||
|
|
Attn: Legal Dept.
|
||
|
|
|
||
|
|
107 Cheapside, 9th Floor
|
||
|
|
|
||
|
|
EC2V 6DN London
|
||
|
|
|
||
|
|
United Kingdom
|
||
|
|
|
||
|
|
*legal@codility.co <http://lity.co/>m*
|
||
|
|
|
||
|
|
Copyright Owners Statement
|
||
|
|
|
||
|
|
I have a good faith belief that use of the copyrighted materials described
|
||
|
|
above on the allegedly infringing web pages is not authorized by the
|
||
|
|
copyright owner, its agent, or the law.
|
||
|
|
|
||
|
|
I swear, under penalty of perjury, that the information in the notification
|
||
|
|
is accurate and that I am authorized to act on behalf of the copyright
|
||
|
|
owner of an exclusive right that is allegedly infringed.
|
||
|
|
|
||
|
|
[private]
|
||
|
|
|
||
|
|
Office Assistant
|
||
|
|
|
||
|
|
[private]
|