97 lines
1.7 KiB
JSON
97 lines
1.7 KiB
JSON
{
|
|
"name": "Euclid's algorithm",
|
|
"order": 4,
|
|
"challenges": [
|
|
{
|
|
"id": "59a5801209a6acac5983b646",
|
|
"title": "Basic Euclidean algorithm",
|
|
"description": [
|
|
""
|
|
],
|
|
"challengeSeed": [
|
|
""
|
|
],
|
|
"tests": [
|
|
""
|
|
]
|
|
},
|
|
{
|
|
"id": "59a5801209a6acac5983b062",
|
|
"title": "Extended Euclidean algorithm",
|
|
"description": [
|
|
""
|
|
],
|
|
"challengeSeed": [
|
|
""
|
|
],
|
|
"tests": [
|
|
""
|
|
]
|
|
},
|
|
{
|
|
"id": "59a5801209a6acac5983b063",
|
|
"title": "Computing modular inverses and Chinese remaindering",
|
|
"description": [
|
|
""
|
|
],
|
|
"challengeSeed": [
|
|
""
|
|
],
|
|
"tests": [
|
|
""
|
|
]
|
|
},
|
|
{
|
|
"id": "59a5801209a6acac5983b064",
|
|
"title": "Speeding up algorithms via modular computation",
|
|
"description": [
|
|
""
|
|
],
|
|
"challengeSeed": [
|
|
""
|
|
],
|
|
"tests": [
|
|
""
|
|
]
|
|
},
|
|
{
|
|
"id": "59a5801209a6acac5983b065",
|
|
"title": "An effective version of Fermat's two squares theorem",
|
|
"description": [
|
|
""
|
|
],
|
|
"challengeSeed": [
|
|
""
|
|
],
|
|
"tests": [
|
|
""
|
|
]
|
|
},
|
|
{
|
|
"id": "59a5801209a6acac5983b066",
|
|
"title": "Rational reconstruction and applications",
|
|
"description": [
|
|
""
|
|
],
|
|
"challengeSeed": [
|
|
""
|
|
],
|
|
"tests": [
|
|
""
|
|
]
|
|
},
|
|
{
|
|
"id": "59a5801209a6acac5983b067",
|
|
"title": "RSA cryptosystem",
|
|
"description": [
|
|
""
|
|
],
|
|
"challengeSeed": [
|
|
""
|
|
],
|
|
"tests": [
|
|
""
|
|
]
|
|
}
|
|
]
|
|
} |