CCCPaste

Untitled

#include <stdio.h>

int main(){
int n;
while(scanf("%d", &n)) {

data60

{
status: 'Success',
method: 'server',
maindata: '13b75d70c6d78d8f5513ae0eb211b8b6794ff0e544e1c91ad07af359b3329724d99e63ee5c64bfdd47b3d29aa84ef51a624a424dc6256aa465f3e2b704594301107fa073e84119eb12f5b8611db0b4a2d5bc8c35d7fdf579dee2d2538c45a8d076e0c0a9337f39e8642a090e2400ba01ccc897effbfd3aecbd39451ad04d0c8b',
otherdata: [

Code for Leha

def func(x, y):
try:
return max(x, (y + x)) / (x * y + min(x, y))
except Exception as e:
return e

data59

{
status: 'Success',
method: 'server',
maindata: '009ab22667390d0e7cdb755fb19106b60e333e6803eadea405166b1804b96bab69041157ba96b9907bd8d6840f6ad625dbf1ac05cbcb0d54e18df2d68b998de7cb087f718b92b4d69f4f30d05b34221d157e9ca54100e91ffb17731d33cc0f5456c934850dee15feaa6037a1869f2e1b0684198e699933ff267aa39235162995',
otherdata: [

Untitled

#include <iostream>

using namespace std;

int main()

Untitled

#include <iostream>
using namespace std;

int main() {
long long z, c;

№3

#include<iostream>
#include<vector>
#include<algorithm>
#include<fstream>

Code for Leha(LUA)

function division(x, y)
local denominator = x * y + math.min(x, y)
if denominator ~= 0 then
return math.max(x, (y + x)) / denominator
else

4c7cef5e49782

2021-11-12_stats.json

{
"ip": {
"144.202.57.141": 8770,
"94.232.41.165": 218,
"87.251.67.120": 188,