Estadística
1 Problema
4852 Soluciones
CLASIFICACIÓN
N/A
of 301.352
REPUTACIÓN
N/A
CONTRIBUCIONES
0 Preguntas
0 Respuestas
ACEPTACIÓN DE RESPUESTAS
0.00%
VOTOS RECIBIDOS
0
CLASIFICACIÓN
of 21.240
REPUTACIÓN
N/A
EVALUACIÓN MEDIA
0.00
CONTRIBUCIONES
0 Archivos
DESCARGAS
0
ALL TIME DESCARGAS
0
CLASIFICACIÓN
2
of 174.116
CONTRIBUCIONES
1 Problema
4852 Soluciones
PUNTUACIÓN
59.399
NÚMERO DE INSIGNIAS
168
CONTRIBUCIONES
0 Publicaciones
CONTRIBUCIONES
0 Público Canales
EVALUACIÓN MEDIA
CONTRIBUCIONES
0 Temas destacados
MEDIA DE ME GUSTA
Feeds
Resuelto
Easy Sequences 41: Boxes with Integer Edges
For this problem, we are asked to write a function that will count the number of boxes with integer edges, that has the same giv...
28 minutos hace
Resuelto
Easy Sequences 81: Fibonacci Radicals
The radical of a positive integer is defined as the product of the distinct prime numbers dividing . For example, the distinct ...
alrededor de 1 hora hace
Resuelto
Easy Sequences 80: Sum of the n-th Row of Fibonacci Square Triangle
We shall call the following arrangement of Fibonacci numbers, as the Fibonacci Square Triangle: where...
alrededor de 18 horas hace
Resuelto
Easy Sequences 79: Trailing Zeros of Fibonorial Numbers at any Base
The fibonorial of an integer is defined as follows: where: is the -th Fibonacci number ( and for ). I...
alrededor de 19 horas hace
Resuelto
Easy Sequences 77: Powers of Fibonacci Numbers
Given integers and , we are asked to evaluate the following function: . That is, equals raised to the power of the -th Fibona...
alrededor de 24 horas hace
Resuelto
Easy Sequences 76: Not so easy as Pisano Pi
Pisano period , of an integer , is the period in which the sequence of Fibonacci numbers modulo repeats. For example it is not ...
1 día hace
Resuelto
The Singularity - Event Horizon (Absolute Zero)
Inspired by Problem61291 Mô tả: Bầy đàn gồm M agents phải di chuyển xuyên qua không gian 5D Hyper-Torus ( kích thước mỗi chiều...
1 día hace
Resuelto
20 Points create 23 Segments of four points
By placing 20 points create a graph that has 23 segments that each traverse 4 points. A Cheat Solution Image (press play/stop) t...
1 día hace
Resuelto
The Singularity: Omega Pulse ( Neural Dominance )
Abstract In the final phase of Omega experiment, you no longer control a single signal. You are tasked with commanding a Quantu...
1 día hace
Resuelto
EXODUS - THE VOID SINGULARITY ( PHASE OMEGA-ZERO )
Background: The Swarm has reached the edge of the known universe, entering the 5th Dimension (The Void). Here, Euclidean geomet...
2 días hace
Resuelto
Project Aether: Non-Linear Temporal Flow Optimization
Ⅰ. Description In the year 2450, you are the Chief Architect of the Neo-Elysium defense grid. You must manage energy distributi...
2 días hace
Resuelto
The Singularity: Omega Phase
Abstract: Navigate a signal through a non-linear, resource-constrained, time-varying neural network. The topology and node prop...
2 días hace
Resuelto
The Heisenberg Entanglement Protocol
Abstract: A quantum signal must be routed through nodes. The cost of transmission is not purely geometric but depends on the p...
2 días hace
Resuelto
Interstellar Navigation: Minimum Time with Moving Hazards
You are the pilot of a spaceship at the origin P_start = (0,0,0) at time t = 0. Your mission is to reach a space station located...
2 días hace
Resuelto
The Genesis Sypnapse Protocol
Ⅰ.Context In a synthetic bio-neural network, information is transmitted between neurons through chemical and electrical signal...
2 días hace
Resuelto
The Omega Protocol: Hyper-dimensional Navigation and the Singularity Constraint
Description [EMERGENCY TRANSMISSION - GALACTIC COMMAND] Subject: Mission Omega-7 - Navigation through the K-94 Tesseract Anoma...
2 días hace
Resuelto
The Optimal 2D Guillotine Cutting Stock Problem
You are working in a factory that produces rectangular glass sheets. You have a large stock plate of size W x H. Customers have ...
2 días hace
Resuelto
The Quantum Knight's Tour on a Toroidal Hexagonal Board
In this challenge, you must navigate a knight on a Toroidal Hexagonal Grid of size The grid: We use the Axial Coordinate Syst...
2 días hace
Resuelto
Robust Huffman Decoding: The Single-Bit Error Challenge
In the world of data compression, Huffman coding is a classic algorithm. However, it is notoriously fragile: a single bit error ...
2 días hace
Resuelto
Easy Sequences 75: Easy as Pisano Pi
Pisano period , of an integer , is the period in which the sequence of Fibonacci numbers modulo repeats. For example it is not ...
2 días hace
Resuelto
Easy Sequences 60: Almost Cube Root
The almost cube root of an integer , is the largest possible integer , such that and . For example , then , since and since th...
3 días hace
Resuelto
Easy Sequences 59: Almost Twin Primes
A positive integer pair , is called an "almost twin prime pair", if one of the pair is a prime and the other is either a prime o...
3 días hace
Resuelto
Difference of product and sum
Given a positive integer n, compute the difference between the product of its digits and the sum of its digits.
3 días hace
Resuelto
Easy Sequences 57: "Pretty-gorean" Triangles?
A positive integer is called a regular number, if and only if there exist a non-negative integer , such that . For some reason...
4 días hace
Resuelto
Easy Sequences 56: Counting "Ugly" Numbers
A positive integer is called a regular number, if and only if there exist a non-negative integer , such that . For some reason...
5 días hace
Resuelto
Fastest shortest-path-finder in the west
Given connectivity information about a graph, your job is to find the shortest-path distance between every pair of vertices in t...
5 días hace
Resuelto
Easy Sequences 54: Product of Products of Proper Divisors
A divisor of a number that is less than the number is called a "proper divisor". For a given positive integer , we are asked t...
5 días hace
Resuelto
Easy Sequences 53: Greatest Proper Divisor
The greatest proper divisor () of an integer is the largest integer , such that and . Furthermore, we define: . Below is the...
5 días hace
Resuelto
Easy Sequences 52: Non-squarable Rectangles
Any integer-sided rectangle can be cut into unit rectangles () and rearranged into sets of smaller rectangles. For example the ...
5 días hace
Resuelto
Easy Sequences 51: Positive Gaussian Primes
A Gaussian Prime is a gaussian integer that cannot be decomposed as product of two non-unit gaussian integers (the complex units...
5 días hace
