孩子，我无敌了（2.0版，67行）
2025-03-02 18:37:50
发布于：辽宁
1852阅读
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;
}
同样是可以过得好吧
看完的点个赞吧！！！！！！！！！！！！！
全部评论 42
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 02025-05-05 来自 北京
5吐s了，只能帮你帮到这了：
#include<iostream>
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <cmath>
#include<string>
#include<cstring>
#include<list>
#include<map>
#include<queue>
#include<iterator>
#include<stack>2024-11-03 来自 广东
0
碾压全部（316行）：
#include<cmath> #include<iostream> #include<cstring> //********一些辅助函数与FFT实现 const double PI=4*atan(1); template<typename T> void Swap(T &a,T &b){ T c=a; a=b; b=c; return; } template<typename T> T Max(const T &a,const T &b){ return a<b?b:a; } typedef long long ll; struct comp{ double real,imag; comp operator+(const comp &x)const{ return {real+x.real,imag+x.imag}; } comp operator-(const comp &x)const{ return {real-x.real,imag-x.imag}; } comp operator*(const comp &x)const{ return {real*x.real-imag*x.imag,real*x.imag+x.real*imag}; } comp operator/(const unsigned &x)const{ return {real/(double)x,imag/(double)x}; } }; void FFT(comp *f,unsigned n,int rev){ for(unsigned i=1,j=n>>1,k;i<n-1;i++){//位逆序置换 if(i<j) Swap(f[i],f[j]); k=n>>1; while(j>=k){ j-=k; k>>=1; } j+=k; } for(unsigned l=2;l<=n;l<<=1){//蝶形运算 double arg=2*PI*rev/l; comp wn={cos(arg),sin(arg)}; for(unsigned i=0;i<n;i+=l){ comp w={1,0}; for(unsigned j=0;j<(l>>1);j++){ comp f1=f[i+j]; comp f2=f[i+j+(l>>1)]; f[i+j]=f1+w*f2; f[i+j+(l>>1)]=f1-w*f2; w=w*wn; } } } if(!~rev) for(unsigned i=0;i<n;i++) f[i]=f[i]/n; } //********高精度整数类 #define BASE 100//因为FFT的精度问题严重，我们只压2位 template<const unsigned Size> class bigint{ private: unsigned len; int num[Size]; void init(){ memset(num,0,sizeof(num)); len=1; } bool abs_greater_equal(const bigint &a)const{ if(len!=a.len) return len>a.len; for(int i=len;i;i--) if(num[i]!=a.num[i]) return num[i]>a.num[i]; return 1; } public: bigint(){ init(); } void get_num(std::string s){ init(); int f=0; unsigned slen=s.length(); if(s[0]=='-') num[0]=f=1; len=0; unsigned temp=0,w=1; for(int i=slen-1;i>=f;i--){ temp+=(s[i]^48)*w; w=(w<<1)+(w<<3); if(w==BASE||i==f){ num[++len]=(int)temp; temp=0; w=1; } } if(temp||len==0) num[++len]=temp; } bool operator<(const bigint &a)const{ if(num[0]&&!a.num[0]) return 1;5天前 来自 江苏
1if(!num[0]&&a.num[0]) return 0; if(num[0]){ if(len!=a.len) return len>a.len; for(int i=len;i;i--) if(num[i]!=a.num[i]) return num[i]>a.num[i]; } else{ if(len!=a.len) return len<a.len; for(int i=len;i;i--) if(num[i]!=a.num[i]) return num[i]<a.num[i]; } return 0; } bigint operator+(const bigint &a)const{ bigint res; if(len==1&&num[1]==0){ res=a; return res; } if(a.len==1&&a.num[1]==0){ res=*this; return res; } if(num[0]==a.num[0]){ res.num[0]=num[0]; unsigned len_sum=1; while(len_sum<len+a.len) len_sum<<=1; comp *fa=new comp[len_sum](); comp *fb=new comp[len_sum](); for(unsigned i=0;i<len;i++) fa[i]={(double)num[i+1],0}; for(unsigned i=0;i<a.len;i++) fb[i]={(double)a.num[i+1],0}; FFT(fa,len_sum,1); FFT(fb,len_sum,1); for(unsigned i=0;i<len_sum;i++) fa[i]=fa[i]+fb[i]; FFT(fa,len_sum,-1); res.len=Max(len,a.len); ll temp=0; for(unsigned i=0;i<res.len;i++){ ll val=(ll)round(fa[i].real)+temp; res.num[i+1]=(int)(val%BASE); temp=val/BASE; } if(temp) res.num[++res.len]=temp; while(res.len>1&&res.num[res.len]==0) res.len--; delete[] fa; delete[] fb; } else{ if(abs_greater_equal(a)){ res.num[0]=num[0]; unsigned len_sum=1; while(len_sum<len+a.len) len_sum<<=1; comp *fa=new comp[len_sum](); comp *fb=new comp[len_sum](); for(unsigned i=0;i<len;i++) fa[i]={(double)num[i+1],0}; for(unsigned i=0;i<a.len;i++) fb[i]={(double)a.num[i+1],0}; FFT(fa,len_sum,1); FFT(fb,len_sum,1); for(unsigned i=0;i<len_sum;i++) fa[i]=fa[i]-fb[i]; FFT(fa,len_sum,-1); res.len=Max(len,a.len); ll temp=0; for(unsigned i=0;i<res.len;i++){ ll val=(ll)round(fa[i].real)+temp; if(val<0){ val+=BASE; temp=-1; } else temp=0;//借位 res.num[i+1]=(int)(val%BASE); } if(temp) res.num[++res.len]=temp; whil5天前 来自 江苏
1e(res.len>1&&res.num[res.len]==0) res.len--; delete[] fa; delete[] fb; return res; } void read(){ init(); std::string s; char ch=getchar(); while(ch<'0'||ch>'9'){ if(ch=='-') s.push_back('-'); ch=getchar(); } while(ch>='0'&&ch<='9'){ s.push_back(ch); ch=getchar(); } get_num(s); } void print(){ if(num[0]) putchar('-'); bool leading_zero=1; for(int i=len;i;i--){ if(leading_zero) printf("%d",num[i]); else printf("%02d",num[i]); leading_zero=0; } putchar('\n'); return; } }; //********程序主体 const int N=1<<10,M=100; int n,m; bigint<114514> a,b,c; int main(){ a.read(); b.read(); c=a+b; c.print(); return 0; }5天前 来自 江苏
1
180行：64 位 0.5MB 内存的机器码虚拟机
#include<bits/stdc++.h> using namespace std; #define int long long #define ull unsigned int #define N 65536 int memory[N]; ull code[N] = { 0x0000000000000000, 0x0000000000000001, 0x5000000000010002, 0x1000000000000002, 0xf000000000000000 }; /* 0 Input 1 Output 2 Write 3 Copy 4 Calculate (& | ~ ^ << >>) 5 Calculate (+ - * / %) 6 Goto 7 If-goto 8 x++ 9 x-- f Exit */ signed main() { for(int i=0;;i=(i+1)%N) { int op=code[i]>>60; if(op==0) //Input { int p=code[i]&65535; cin >> memory[ (code[i]>>56)&1 ? memory[p] : p ]; } else if(op==1) //Output { int p=code[i]&65535, val = memory[ (code[i]>>56)&1 ? memory[p] : p ]; if((code[i]>>57)&1) { cout<<char(val&127); } else { cout<<val; } } else if(op==2) //Write { int p = (code[i]>>32)&65535, val = code[i]&((1ll<<32)-1); memory[ (code[i]>>56)&1 ? memory[p] : p ] = val; } else if(op==3) //Copy { int pf = (code[i]>>16)&65535, pt = code[i]&65535; int val = memory[ (code[i]>>55)&1 ? memory[pf] : pf ]; memory[ (code[i]>>56)&1 ? memory[pt] : pt ] = val; } else if(op==4) //Calculate (& | ~ ^ << >>) { int p1 = (code[i]>>32)&65535, p2 = (code[i]>>16)&65535, p3 = code[i]&65535; int val1 = memory[ (code[i]>>58)&1 ? memory[p1] : p1 ], val2 = memory[ (code[i]>>57)&1 ? memory[p2] : p2 ], val3; int op2 = (code[i]>>52)&15; if(op2==0) { val3=val1&val2; } else if(op2==1) { val3=val1|val2; } else if(op2==2) { val3=~val2; } else if(op2==3) { val3=val1^val2; } else if(op2==4) { val3=((val2>>6)?0:val1<<val2); } else { val3=((val2>>6)?0:val1>>val2); } memory[ (code[i]>>56)&1 ? memory[p3] : p3 ] = val3; } else if(op==5) //Calculate (+ - * / %) {5天前 来自 江苏
1//想要乘方的建议自己写一个快速幂, 应该是能写的 int p1 = (code[i]>>32)&65535, p2 = (code[i]>>16)&65535, p3 = code[i]&65535; int val1 = memory[ (code[i]>>58)&1 ? memory[p1] : p1 ], val2 = memory[ (code[i]>>57)&1 ? memory[p2] : p2 ], val3; int op2 = (code[i]>>52)&15; if(op2==0) { val3=val1+val2; } else if(op2==1) { val3=val1-val2; } else if(op2==2) { val3=val1*val2; } else if(op2==3) { val3=(val2?val1/val2:0); } else { val3=(val2?val1%val2:0); } memory[ (code[i]>>56)&1 ? memory[p3] : p3 ] = val3; } else if(op==6) //Goto { int p=code[i]&65535; i = (code[i]>>56)&1 ? memory[p] : p; i = (i+N-1)%N; } else if(op==7) //If-goto (> < == >= <= !=) { int p1 = (code[i]>>32)&65535, p2 = (code[i]>>16)&65535, p3 = code[i]&65535; int val1 = memory[ (code[i]>>58)&1 ? memory[p1] : p1 ], val2 = memory[ (code[i]>>57)&1 ? memory[p2] : p2 ]; int op2 = (code[i]>>52)&15; bool flag; if(op2==0) { flag=(val1>val2); } else if(op2==1) { flag=(val1<val2); } else if(op2==2) { flag=(val1==val2); } else if(op2==3) { flag=(val1>=val2); } else if(op2==4) { flag=(val1<=val2); } else { flag=(val1!=val2); } if(flag) { i = (code[i]>>56)&1 ? memory[p3] : p3; i = (i+N-1)%N; } } else if(op==8) //x++ { int p=code[i]&65535; memory[ (code[i]>>56)&1 ? memory[p] : p ]++; } else if(op==9) //x-- { int p=code[i]&65535; memory[ (code[i]>>56)&1 ? memory[p] : p ]--; } else if(op==15) //Exit { break; } else { cout<<"\n\nError: Invalid code\n\n"; } } return 0; }5天前 来自 江苏
1
# include <bits/stdc++.h> typedef unsigned long long ull; #define LL long long \ #define u1 u << 1 \ #define u2 u1 | 1 \ #define ef ((l + r) >> 1)\ using namespace std ; int r() { short f = 1; int x = 0; char c; c = getchar(); while (c < '0' || c > '9') { if (c == '-') { f = -1; } c = getchar(); } while (c >= '0' && c <= '9') { x = (x << 1) + (x << 3) + (c ^ (3 << 4)); c = getchar(); } return x * f; } void w(int x) { if(x == 0) { putchar('0'); return; } w(x / 10); char aaa = 'A'; aaa += (x % 10); putchar(aaa); return; } const int N = 1e5 + 3; struct Node{ LL sum; LL tag; }; int n, m; LL a[N]; Node seg[N << 2]; void pushup(int u) { int aaa = seg[u1].sum; aaa += seg[u2].sum; seg[u].sum = aaa; } void pushdown(int u, int l, int r) { LL &x = seg[u].tag; seg[u1].tag += x; seg[u2].tag += x; int mid = ef; LL aaa = mid - l + 1; LL aaa1 = r - mid; seg[u1].sum += 1ll * aaa * x; seg[u2].sum += 1ll * aaa1 * x; seg[u].tag = 0; } void build(int u, int l, int r) { if (l == r) { seg[u].sum = a[l]; seg[u].tag = 0; return; } int mid = ef; build(u1, l, mid); build(u2, mid + 1, r); pushup(u); } void modify(int u, int l, int r, int ql, int qr, int x) { if(l == ql && r == qr) { int aaa = r - l + 1; seg[u].tag += x; seg[u].sum += 1ll * aaa * x; return; } pushdown(u, l, r); int mid = ef; if(qr <= mid) { modify(u1, l, mid, ql, qr, x); } else if(ql > mid) { modify(u2, mid + 1, r, ql, qr, x); } else { modify(u1, l, mid, ql, mid, x); modify(u2, mid + 1, r, mid + 1, qr, x); } pushup(u); } LL query(int u, int l, int r, int ql, int qr) { if (l == ql && r == qr) { return seg[2025-04-06 来自 江西
1u].sum; } pushdown(u, l, r); int mid = ef; if (qr <= mid) { return query(u1, l, mid, ql, qr); } else if (ql > mid) { return query(u2, mid + 1, r, ql, qr); } else { int aaa = query(u1, l, mid, ql, mid); aaa += query(u2, mid + 1, r, mid + 1, qr); return aaa; } } int dfs(int a, int b) { if (b == 0) { return a; } int aaa = dfs(a, b - 1); aaa ++; return aaa; } const int e3 = 1000; int main ( ) { int a, b; a = r(); b = r(); build(1, 1, e3); modify(1, 1, e3, 1, 1, a); modify(1, 1, e3, 2, 2, b); int aaa = query(1, 1, e3, 1, 2), aaa1 = dfs(a, b); if(aaa == aaa1) { int l = aaa, r = aaa1; int mid = ef; cout << ef; } cout << " "; cout << endl; return 0; }2025-04-06 来自 江西
0
#include<iostream>
#include <algorithm>
#include <math.h>
#include <cmath>
#include<string>
#include<cstring>
#include<list>
#include<map>
#include<queue>
#include<iterator>
#include<stack>
#include<vector>
#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;
}应该这样好吧
2025-07-18 来自 浙江
0
有帮助，赞一个