题目详情提交记录（0）

孩子，我无敌了（2.0版，67行）

userId_undefined
哇！我传伞太准了Andy
题解仙人出道萌新时空双修者秩序白银

2025-03-02 18:37:50

发布于：辽宁

5024阅读
0回复
0点赞

未成年码将请在成年码王的陪同下观看，否则会引起“bushi”（确信）

#include <bits/stdc++.h>
using namespace std;

#define ll long long
const int N = 1010;

int RAND_1(ll a,ll b){
    ll n = a + b;
    return n;
}

int RAND_2(string a, string b, int n[500], int m[500], int ans[501]){
    for(int i = 0; i < a.size(); i++)
		n[i] = a[a.size() - i - 1] - '0';
	for(int i = 0; i < b.size(); i++)
		m[i] = b[b.size() - i - 1] - '0';
	int len_maxn = max(a.size(), b.size()) + 1;
	for(int i = 0; i < len_maxn; i++)
	{
		ans[i] = n[i] + m[i] + ans[i];
		if(ans[i] > 9)
		{
			ans[i + 1]++;
			ans[i] = ans[i] % 10;
		}
	}
	while(ans[len_maxn - 1] == 0 && len_maxn > 0) len_maxn--;
	for(int i = len_maxn - 1; i >= 0; i--) cout << ans[i];
	return 0;
}

int RAND_3(ll a, ll b){
	ll ans = 0;
	for(int i = 0; i < a; i ++ ) {
		ans ++;
	}
	for(int i = 0; i < b; i ++ ) {
		ans ++;
	}
	return ans;
}

int n[1010], m[1010],c[1010];
int main(){
	srand(time(0));
    ll a , b;
    string z , y;
    int x;
    x = 1 + rand() % 3;
    if(x == 1){
    	cin >> a >> b;
    	int ans = RAND_1(a,b);
    	cout << ans;
	}
    if(x == 2){
    	cin >> z >> y;
    	RAND_2(z , y , n , m, c);
	}
	if(x == 3){
		cin >> a >> b;
		int ans = RAND_3(a, b);
		cout << ans;
	}
    return 0;
}

同样是可以过得好吧

看完的点个赞吧！！！！！！！！！！！！！

userId_undefined
去预览
0/2000

全部评论 148

  • userId_undefined
    yanghongzheng
    荣耀黄金USACO
    a, b = map(int, input().split())
c = 0
d = 'a'
e = "b"
f = 0.0
g = None
h = True
i = False
j = []
k = {}
m = set()
def n(o):
    pass
class p:
    def __init__():
        pass
    def q(r):
        pass
s = c + 1
t = s ** 2
print(a + b)

# Useless variable declarations
var1 = "useless"
var2 = 12345
var3 = [1, 2, 3, 4, 5]
var4 = {'key': 'value'}
var5 = (1, 2, 3)
var6 = set([1, 2, 3])
var7 = 3.14159
var8 = False
var9 = None
var10 = "more useless text"

# Meaningless calculations
calc1 = a * b - c
calc2 = var2 % 10
calc3 = t / s
calc4 = calc1 + calc2 - calc3
calc5 = var7 * 2
calc6 = calc5 ** 0.5
calc7 = len(var3) + len(var4)
calc8 = sum(var3) / len(var3)
calc9 = var2 // 100
calc10 = calc4 * calc6 + calc7

# Empty functions
def func1():
    pass

def func2(param1):
    pass

def func3(param2, param3=0):
    return param2 + param3

def func4():
    return None

def func5(x, y, z):
    pass

def func6():
    return "nothing"

def func7(a, b, c, d):
    pass

def func8():
    return 0

def func9():
    return []

def func10():
    return {}

# Useless class definitions
class UselessClass1:
    def __init__(self):
        self.value = 0
    
    def method1(self):
        pass
    
    def method2(self, x):
        return x * 2

class UselessClass2:
    def __init__(self, name):
        self.name = name
    
    def greet(self):
        return f"Hello, {self.name}"
    
    def double(self, num):
        return num * 2

class UselessClass3:
    def __init__(self):
        self.data = []
    
    def add(self, item):
        self.data.append(item)
    
    def clear(self):
        self.data = []

# More meaningless operations
result1 = func3(5, 10)
result2 = UselessClass2("test").greet()
result3 = var3[2] * var5[1]
result4 = result1 + result3
result5 = var4.get('key', 'default')
result6 = len(var10) - len(var1)
result7 = bool(var8) or bool(var9)
result8 = var6.union(set([4, 5, 6]))
result9 = result4 / result6 if result6 != 0 else 0

    2025-05-05 来自 北京

    16
  • userId_undefined
    哇！我传伞太准了Andy
    题解仙人出道萌新时空双修者秩序白银

    点赞！投币！一键三连！

    2024-06-09 来自 辽宁

    11
  • userId_undefined
    编程猫喵喵喵（暑假复活版）
    出道萌新时间刺客空间掌握者倔强青铜分支·分支解题者枚举·枚举小能手

    我草这就是传说中的炮弹炸蚊子吗

    2025-10-31 来自 广东

    5
  • userId_undefined
    蛋仔我最"牛"
    出道萌新倔强青铜时间刺客空间掌握者时空双修者

    #include <iostream>
    using namespace std;

    int main() {
    int a,b;
    cin >>a >> b ;
    cout<<a+b;
    return 0;
    }

    2025-10-28 来自 浙江

    3
  • userId_undefined
    Sunrise_Dawn
    出道萌新GESP1级

    炮弹炸蚊子

    2025-08-28 来自 新疆

    3
  • userId_undefined
    复仇者_sxwwsด้้（加团队
    时间刺客空间掌握者时空双修者分治·分治练习生出道萌新荣耀黄金

    999

    2024-08-18 来自 河北

    2
  • userId_undefined
    哇！我传伞太准了Andy
    题解仙人出道萌新时空双修者秩序白银

    看完的点个赞吧！！！！！！！！！！！！！

    2024-06-09 来自 辽宁

    2
  • userId_undefined
    杨子珵

    #include <bits/stdc++.h>
    using namespace std;

    #define ll long long
    const int N = 1010;

    int RAND_1(ll a,ll b){
    ll n = a + b;
    return n;
    }

    int RAND_2(string a, string b, int n[500], int m[500], int ans[501]){
    for(int i = 0; i < a.size(); i++)
    n[i] = a[a.size() - i - 1] - '0';
    for(int i = 0; i < b.size(); i++)
    m[i] = b[b.size() - i - 1] - '0';
    int len_maxn = max(a.size(), b.size()) + 1;
    for(int i = 0; i < len_maxn; i++)
    {
    ans[i] = n[i] + m[i] + ans[i];
    if(ans[i] > 9)
    {
    ans[i + 1]++;
    ans[i] = ans[i] % 10;
    }
    }
    while(ans[len_maxn - 1] == 0 && len_maxn > 0) len_maxn--;
    for(int i = len_maxn - 1; i >= 0; i--) cout << ans[i];
    return 0;
    }

    int RAND_3(ll a, ll b){
    ll ans = 0;
    for(int i = 0; i < a; i ++ ) {
    ans ++;
    }
    for(int i = 0; i < b; i ++ ) {
    ans ++;
    }
    return ans;
    }

    int n[1010], m[1010],c[1010];
    int main(){
    srand(time(0));
    ll a , b;
    string z , y;
    int x;
    x = 1 + rand() % 3;
    if(x == 1){
    cin >> a >> b;
    int ans = RAND_1(a,b);
    cout << ans;
    }
    if(x == 2){
    cin >> z >> y;
    RAND_2(z , y , n , m, c);
    }
    if(x == 3){
    cin >> a >> b;
    int ans = RAND_3(a, b);
    cout << ans;
    }
    return 0;
    }

    9小时前 来自 浙江

    1
  • userId_undefined
    杨子珵

    aa

    9小时前 来自 浙江

    1
  • userId_undefined
    杨子珵

    a

    9小时前 来自 浙江

    1
  • userId_undefined
    杨子珵

    a

    9小时前 来自 浙江

    1
  • userId_undefined
    195****8863
    倔强青铜分支·分支解题者俄罗斯套娃大师循环·循环打卡人数组·数组操作员

    1周前 来自 浙江

    1
  • userId_undefined
    MC
    时间刺客空间掌握者时空双修者分支·分支解题者递归·套娃学徒数组·数组操作员

    # 1000行！！！

    2026-05-23 来自 浙江

    1
    • userId_undefined
      MC
      回复
      MC

      发的我手都废了

      2026-05-23 来自 浙江

      1
  • userId_undefined
    MC
    时间刺客空间掌握者时空双修者分支·分支解题者递归·套娃学徒数组·数组操作员
    void useless_func_247() {}
void useless_func_248() {}
void useless_func_249() {}
void useless_func_250() {}
int useless_func_251(int x) {
    return x + useless_func_1(x);
}
int useless_func_252(int x) {
    return x - useless_func_2(x);
}
int useless_func_253(int x) {
    return x * useless_func_3(x);
}
int useless_func_254(int x) {
    return x * useless_func_4(x);
}
int useless_func_255(int x) {
    return x * useless_func_5(x);
}
int useless_func_256(int x) {
    return x * useless_func_6(x);
}
int useless_func_257(int x) {
    return x * useless_func_7(x);
}
int useless_func_258(int x) {
    return x * useless_func_8(x);
}
int useless_func_259(int x) {
    return x * useless_func_9(x);
}
int useless_func_260(int x) {
    return x * useless_func_10(x);
}
int useless_func_261(int x) {
    return x * useless_func_11(x);
}
int useless_func_262(int x) {
    return x * useless_func_12(x);
}
int useless_func_263(int x) {
    return x * useless_func_13(x);
}
int main() {
    int a,b;
    cin>>a>>b;
    cout<<a+b;
}

    2026-05-23 来自 浙江

    1
  • userId_undefined
    MC
    时间刺客空间掌握者时空双修者分支·分支解题者递归·套娃学徒数组·数组操作员
    double useless_func_201(double a, double b, double c) {
    if(a<=b&&a<=c)
        return a;
    else if(b<=a&&b<=c)
        return b;
    else
        return c;
}
int useless_func_202(int x) {
    return x & 1;
}
int useless_func_203(int x) {
    return x | 1;
}
int useless_func_204(int x) {
    return x ^ 1;
}
int useless_func_205(int x) {
    return ~x;
}
int useless_func_206(int x) {
    return x << 1;
}
int useless_func_207(int x) {
    return x >> 1;
}
long useless_func_208(long x) {
    return x & 1;
}
long useless_func_209(long x) {
    return x | 1;
}
long useless_func_210(long x) {
    return x ^ 1;
}
long useless_func_211(long x) {
    return ~x;
}
long useless_func_212(long x) {
    return x << 1;
}
long useless_func_213(long x) {
    return x >> 1;
}
int useless_func_214(int x, int y) {
    return x & y;
}
int useless_func_215(int x, int y) {
    return x | y;
}
int useless_func_216(int x, int y) {
    return x ^ y;
}
long useless_func_217(long x, long y) {
    return x & y;
}
long useless_func_218(long x, long y) {
    return x | y;
}
long useless_func_219(long x, long y) {
    return x ^ y;
}
int useless_func_220(int x, int n) {
    return x << n;
}
int useless_func_221(int x, int n) {
    return x >> n;
}
long useless_func_222(long x, int n) {
    return x << n;
}
long useless_func_223(long x, int n) {
    return x >> n;
}
void useless_func_224() {}
void useless_func_225() {}
void useless_func_226() {}
void useless_func_227() {}
void useless_func_228() {}
void useless_func_229() {}
void useless_func_230() {}
void useless_func_231() {}
void useless_func_232() {}
void useless_func_233() {}
void useless_func_234() {}
void useless_func_235() {}
void useless_func_236() {}
void useless_func_237() {}
void useless_func_238() {}
void useless_func_239() {}
void useless_func_240() {}
void useless_func_241() {}
void useless_func_242() {}
void useless_func_243() {}
void useless_func_244() {}
void useless_func_245() {}
void useless_func_246() {}

    2026-05-23 来自 浙江

    1
  • userId_undefined
    MC
    时间刺客空间掌握者时空双修者分支·分支解题者递归·套娃学徒数组·数组操作员
    long useless_func_188(long x, long y) {
    return x*y/useless_func_186(x,y);
}
int useless_func_189(int start, int end) {
    int sum=0;
    for(int i=start;i<=end;i++)
        sum+=i;
    return sum;
}
long useless_func_190(long start, long end) {
    long sum=0;
    for(long i=start;i<=end;i++)
        sum+=i;
    return sum;
}
int useless_func_191(int x) {
    return (x/10000)*10000 + (x%10000/1000)*1000 + (x%1000/100)*100 + (x%100/10)*10 + x%10;
}
int useless_func_192(int x) {
    int rev=0;
    while(x>0) {
        rev=rev*10+x%10;
        x/=10;
    }
    return rev;
}
long useless_func_193(long x) {
    long rev=0;
    while(x>0) {
        rev=rev*10+x%10;
        x/=10;
    }
    return rev;
}
int useless_func_194(int a, int b, int c) {
    if(a>=b&&a>=c)
        return a;
    else if(b>=a&&b>=c)
        return b;
    else
        return c;
}
int useless_func_195(int a, int b, int c) {
    if(a<=b&&a<=c)
        return a;
    else if(b<=a&&b<=c)
        return b;
    else
        return c;
}
long useless_func_196(long a, long b, long c) {
    if(a>=b&&a>=c)
        return a;
    else if(b>=a&&b>=c)
        return b;
    else
        return c;
}
long useless_func_197(long a, long b, long c) {
    if(a<=b&&a<=c)
        return a;
    else if(b<=a&&b<=c)
        return b;
    else
        return c;
}
float useless_func_198(float a, float b, float c) {
    if(a>=b&&a>=c)
        return a;
    else if(b>=a&&b>=c)
        return b;
    else
        return c;
}
float useless_func_199(float a, float b, float c) {
    if(a<=b&&a<=c)
        return a;
    else if(b<=a&&b<=c)
        return b;
    else
        return c;
}
double useless_func_200(double a, double b, double c) {
    if(a>=b&&a>=c)
        return a;
    else if(b>=a&&b>=c)
        return b;
    else
        return c;
}

    2026-05-23 来自 浙江

    1
  • userId_undefined
    MC
    时间刺客空间掌握者时空双修者分支·分支解题者递归·套娃学徒数组·数组操作员
    float useless_func_165(float x) {
    return x>0?x:-x;
}
double useless_func_166(double x) {
    return x>0?x:-x;
}
void useless_func_167(int &x) {
    x+=10;
}
void useless_func_168(int &x) {
    x-=10;
}
void useless_func_169(long &x) {
    x+=100;
}
void useless_func_170(long &x) {
    x-=100;
}
void useless_func_171(float &x) {
    x*=2;
}
void useless_func_172(float &x) {
    x/=2;
}
void useless_func_173(double &x) {
    x*=3;
}
void useless_func_174(double &x) {
    x/=3;
}
int useless_func_175(int x, int y) {
    int t=x;
    x=y;
    y=t;
    return x+y;
}
long useless_func_176(long x, long y) {
    long t=x;
    x=y;
    y=t;
    return x+y;
}
float useless_func_177(float x, float y) {
    float t=x;
    x=y;
    y=t;
    return x+y;
}
double useless_func_178(double x, double y) {
    double t=x;
    x=y;
    y=t;
    return x+y;
}
int useless_func_179(int x) {
    int cnt=0;
    while(x>0) {
        cnt++;
        x/=10;
    }
    return cnt;
}
int useless_func_180(long x) {
    int cnt=0;
    while(x>0) {
        cnt++;
        x/=10;
    }
    return cnt;
}
int useless_func_181(int x) {
    int sum=0;
    while(x>0) {
        sum+=x%10;
        x/=10;
    }
    return sum;
}
int useless_func_182(long x) {
    int sum=0;
    while(x>0) {
        sum+=x%10;
        x/=10;
    }
    return sum;
}
bool useless_func_183(int x) {
    if(x<=1)
        return false;
    for(int i=2;i*i<=x;i++)
        if(x%i==0)
            return false;
    return true;
}
bool useless_func_184(long x) {
    if(x<=1)
        return false;
    for(long i=2;i*i<=x;i++)
        if(x%i==0)
            return false;
    return true;
}
int useless_func_185(int x, int y) {
    while(y!=0) {
        int t=x%y;
        x=y;
        y=t;
    }
    return x;
}
long useless_func_186(long x, long y) {
    while(y!=0) {
        long t=x%y;
        x=y;
        y=t;
    }
    return x;
}
int useless_func_187(int x, int y) {
    return x*y/useless_func_185(x,y);
}

    2026-05-23 来自 浙江

    1
  • userId_undefined
    MC
    时间刺客空间掌握者时空双修者分支·分支解题者递归·套娃学徒数组·数组操作员
    int useless_func_145(int a, int b, int c, int d) {
    return a+b+c+d;
}
int useless_func_146(int a, int b, int c, int d) {
    return a*b*c*d;
}
long useless_func_147(long a, long b, long c, long d) {
    return a+b+c+d;
}
long useless_func_148(long a, long b, long c, long d) {
    return a*b*c*d;
}
float useless_func_149(float a, float b, float c, float d) {
    return a+b+c+d;
}
float useless_func_150(float a, float b, float c, float d) {
    return a*b*c*d;
}
double useless_func_151(double a, double b, double c, double d) {
    return a+b+c+d;
}
double useless_func_152(double a, double b, double c, double d) {
    return a*b*c*d;
}
int useless_func_153(int n) {
    int res=1;
    for(int i=1;i<=n;i++)
        res*=i;
    return res;
}
long useless_func_154(long n) {
    long res=1;
    for(long i=1;i<=n;i++)
        res*=i;
    return res;
}
int useless_func_155(int x, int n) {
    int res=1;
    for(int i=0;i<n;i++)
        res*=x;
    return res;
}
long useless_func_156(long x, int n) {
    long res=1;
    for(int i=0;i<n;i++)
        res*=x;
    return res;
}
float useless_func_157(float x, int n) {
    float res=1;
    for(int i=0;i<n;i++)
        res*=x;
    return res;
}
double useless_func_158(double x, int n) {
    double res=1;
    for(int i=0;i<n;i++)
        res*=x;
    return res;
}
int useless_func_159(int x) {
    if(x>0)
        return 1;
    else if(x<0)
        return -1;
    else
        return 0;
}
long useless_func_160(long x) {
    if(x>0)
        return 1;
    else if(x<0)
        return -1;
    else
        return 0;
}
float useless_func_161(float x) {
    if(x>0)
        return 1;
    else if(x<0)
        return -1;
    else
        return 0;
}
double useless_func_162(double x) {
    if(x>0)
        return 1;
    else if(x<0)
        return -1;
    else
        return 0;
}
int useless_func_163(int x) {
    return x>0?x:-x;
}
long useless_func_164(long x) {
    return x>0?x:-x;
}

    2026-05-23 来自 浙江

    1
  • userId_undefined
    MC
    时间刺客空间掌握者时空双修者分支·分支解题者递归·套娃学徒数组·数组操作员
    int useless_func_121(int x) {
    for(int i=0;i<100;i++)
        x+=i;
    return x;
}
int useless_func_122(int x) {
    for(int i=100;i>0;i--)
        x-=i;
    return x;
}
long useless_func_123(long x) {
    for(long i=0;i<1000;i++)
        x+=i;
    return x;
}
long useless_func_124(long x) {
    for(long i=1000;i>0;i--)
        x-=i;
    return x;
}
float useless_func_125(float x) {
    for(int i=0;i<50;i++)
        x*=1.1f;
    return x;
}
float useless_func_126(float x) {
    for(int i=0;i<50;i++)
        x/=1.1f;
    return x;
}
double useless_func_127(double x) {
    for(int i=0;i<50;i++)
        x*=1.1;
    return x;
}
double useless_func_128(double x) {
    for(int i=0;i<50;i++)
        x/=1.1;
    return x;
}
int useless_func_129(int x, int y, int z) {
    return x + y + z;
}
int useless_func_130(int x, int y, int z) {
    return x * y * z;
}
int useless_func_131(int x, int y, int z) {
    return (x + y) * z;
}
int useless_func_132(int x, int y, int z) {
    return x + (y * z);
}
long useless_func_133(long x, long y, long z) {
    return x + y + z;
}
long useless_func_134(long x, long y, long z) {
    return x * y * z;
}
long useless_func_135(long x, long y, long z) {
    return (x + y) * z;
}
long useless_func_136(long x, long y, long z) {
    return x + (y * z);
}
float useless_func_137(float x, float y, float z) {
    return x + y + z;
}
float useless_func_138(float x, float y, float z) {
    return x * y * z;
}
float useless_func_139(float x, float y, float z) {
    return (x + y) * z;
}
float useless_func_140(float x, float y, float z) {
    return x + (y * z);
}
double useless_func_141(double x, double y, double z) {
    return x + y + z;
}
double useless_func_142(double x, double y, double z) {
    return x * y * z;
}
double useless_func_143(double x, double y, double z) {
    return (x + y) * z;
}
double useless_func_144(double x, double y, double z) {
    return x + (y * z);
}

    2026-05-23 来自 浙江

    1
  • userId_undefined
    MC
    时间刺客空间掌握者时空双修者分支·分支解题者递归·套娃学徒数组·数组操作员
    long useless_func_93(long arr[], int n) {
    long sum=0;
    for(int i=0;i<n;i++)
        sum+=arr[i];
    return sum;
}
long useless_func_94(long arr[], int n) {
    long max=arr[0];
    for(int i=1;i<n;i++)
        if(arr[i]>max)
            max=arr[i];
    return max;
}
long useless_func_95(long arr[], int n) {
    long min=arr[0];
    for(int i=1;i<n;i++)
        if(arr[i]<min)
            min=arr[i];
    return min;
}
float useless_func_96(float arr[], int n) {
    float sum=0;
    for(int i=0;i<n;i++)
        sum+=arr[i];
    return sum;
}
float useless_func_97(float arr[], int n) {
    float max=arr[0];
    for(int i=1;i<n;i++)
        if(arr[i]>max)
            max=arr[i];
    return max;
}
float useless_func_98(float arr[], int n) {
    float min=arr[0];
    for(int i=1;i<n;i++)
        if(arr[i]<min)
            min=arr[i];
    return min;
}
double useless_func_99(double arr[], int n) {
    double sum=0;
    for(int i=0;i<n;i++)
        sum+=arr[i];
    return sum;
}
double useless_func_100(double arr[], int n) {
    double max=arr[0];
    for(int i=1;i<n;i++)
        if(arr[i]>max)
            max=arr[i];
    return max;
}
double useless_func_101(double arr[], int n) {
    double min=arr[0];
    for(int i=1;i<n;i++)
        if(arr[i]<min)
            min=arr[i];
    return min;
}
void useless_func_102() {
}
void useless_func_103() {
}
void useless_func_104() {
}
void useless_func_105() {
}
void useless_func_106() {
}
void useless_func_107() {
}
void useless_func_108() {
}
void useless_func_109() {
}
void useless_func_110() {
}
void useless_func_111() {
}
void useless_func_112() {
}
void useless_func_113() {
}
void useless_func_114() {
}
void useless_func_115() {
}
void useless_func_116() {
}
void useless_func_117() {
}
void useless_func_118() {
}
void useless_func_119() {
}
void useless_func_120() {
}

    2026-05-23 来自 浙江

    1
暂无数据

提交答案之后，这里将显示提交结果～

首页