11 条题解
-
2银河球棒侠 (yangshihuan) LV 7 @ 2024-7-26 10:58:29
A+B Problem题解
新用户强烈建议阅读此帖
首先我们要理清思路
1.需要用到什么样的头文件?
2.用什么样的数据范围?
3.思路是什么?
首先题目中的数据范围是1≤a,b≤10^6, 而int 的范围是-2147483648-2147483647 正合题意,所以数据类型可以用int
话不多说,直接上代码
#include<iostream>//导入头文件,iostream里面是标准输入输出流(我说的什么?) using namespace std;//使用标准命名空间 int main(){//主函数,程序的入口 int a,b;//创建a,b两个整型变量 cin>>a>>b;//输入 a , b 两个变量 cout<<a+b; //输出a+b的内容 return 0; }
本蒟蒻发的第一篇题解,请多多支持喵~~
-
12024-11-30 19:04:15@
#ifndef _GLIBCXX_QUEUE #define _GLIBCXX_QUEUE 1 #include <deque> #include <vector> #include <bits/stl_heap.h> #include <bits/stl_function.h> #include <bits/stl_queue.h> #endif #ifndef _GLIBCXX_STACK #define _GLIBCXX_STACK 1 #include <deque> #include <bits/stl_stack.h> #endif #ifndef _GLIBCXX_VECTOR #define _GLIBCXX_VECTOR 1 #include <bits/stl_algobase.h> #include <bits/allocator.h> #include <bits/stl_construct.h> #include <bits/stl_uninitialized.h> #include <bits/stl_vector.h> #include <bits/stl_bvector.h> #include <bits/range_access.h> #ifndef _GLIBCXX_EXPORT_TEMPLATE #include <bits/vector.tcc> #endif #ifdef _GLIBCXX_DEBUG #include <debug/vector> #endif #ifdef _GLIBCXX_PROFILE #include <profile/vector> #endif #endif #pragma GCC optimize(3) #pragma GCC target("avx") #pragma GCC optimize("Ofast") #pragma GCC optimize("inline") #pragma GCC optimize("-fgcse") #pragma GCC optimize("-fgcse-lm") #pragma GCC optimize("-fipa-sra") #pragma GCC optimize("-ftree-pre") #pragma GCC optimize("-ftree-vrp") #pragma GCC optimize("-fpeephole2") #pragma GCC optimize("-ffast-math") #pragma GCC optimize("-fsched-spec") #pragma GCC optimize("unroll-loops") #pragma GCC optimize("-falign-jumps") #pragma GCC optimize("-falign-loops") #pragma GCC optimize("-falign-labels") #pragma GCC optimize("-fdevirtualize") #pragma GCC optimize("-fcaller-saves") #pragma GCC optimize("-fcrossjumping") #pragma GCC optimize("-fthread-jumps") #pragma GCC optimize("-funroll-loops") #pragma GCC optimize("-fwhole-program") #pragma GCC optimize("-freorder-blocks") #pragma GCC optimize("-fschedule-insns") #pragma GCC optimize("inline-functions") #pragma GCC optimize("-ftree-tail-merge") #pragma GCC optimize("-fschedule-insns2") #pragma GCC optimize("-fstrict-aliasing") #pragma GCC optimize("-fstrict-overflow") #pragma GCC optimize("-falign-functions") #pragma GCC optimize("-fcse-skip-blocks") #pragma GCC optimize("-fcse-follow-jumps") #pragma GCC optimize("-fsched-interblock") #pragma GCC optimize("-fpartial-inlining") #pragma GCC optimize("no-stack-protector") #pragma GCC optimize("-freorder-functions") #pragma GCC optimize("-findirect-inlining") #pragma GCC optimize("-fhoist-adjacent-loads") #pragma GCC optimize("-frerun-cse-after-loop") #pragma GCC optimize("inline-small-functions") #pragma GCC optimize("-finline-small-functions") #pragma GCC optimize("-ftree-switch-conversion") #pragma GCC optimize("-foptimize-sibling-calls") #pragma GCC optimize("-fexpensive-optimizations") #pragma GCC optimize("-funsafe-loop-optimizations") #pragma GCC optimize("inline-functions-called-once") #pragma GCC optimize("-fdelete-null-pointer-checks") #define _DOMAIN 1 #define _SING 2 #define _OVERFLOW 3 #define _UNDERFLOW 4 #define _TLOSS 5 #define _PLOSS 6 #define DOMAIN _DOMAIN #define SING _SING #define OVERFLOW _OVERFLOW #define UNDERFLOW _UNDERFLOW #define TLOSS _TLOSS #define PLOSS _PLOSS #define M_E 2.7182818284590452354 #define M_LOG2E 1.4426950408889634074 #define M_LOG10E 0.43429448190325182765 #define M_LN2 0.69314718055994530942 #define M_LN10 2.30258509299404568402 #define M_PI 3.14159265358979323846 #define M_PI_2 1.57079632679489661923 #define M_PI_4 0.78539816339744830962 #define M_1_PI 0.31830988618379067154 #define M_2_PI 0.63661977236758134308 #define M_2_SQRTPI 1.12837916709551257390 #define M_SQRT2 1.41421356237309504880 #define M_SQRT1_2 0.70710678118654752440 #define _FPCLASS_SNAN 0x0001 #define _FPCLASS_QNAN 0x0002 #define _FPCLASS_NINF 0x0004 #define _FPCLASS_NN 0x0008 #define _FPCLASS_ND 0x0010 #define _FPCLASS_NZ 0x0020 #define _FPCLASS_PZ 0x0040 #define _FPCLASS_PD 0x0080 #define _FPCLASS_PN 0x0100 #define _FPCLASS_PINF 0x0200 #define FP_SNAN _FPCLASS_SNAN #define FP_QNAN _FPCLASS_QNAN #define FP_NINF _FPCLASS_NINF #define FP_PINF _FPCLASS_PINF #define FP_NDENORM _FPCLASS_ND #define FP_PDENORM _FPCLASS_PD #define FP_NZERO _FPCLASS_NZ #define FP_PZERO _FPCLASS_PZ #define FP_NNORM _FPCLASS_NN #define FP_PNORM _FPCLASS_PN #include <queue> #include <math.h> #include <stack> #include <stdio.h> #include <iostream> #include <vector> #include <iomanip> #include <string.h> #include <algorithm> using namespace std; #define int long long const int N = 3e7 + 10; const int INF = 0xfffffffffffffff; int n, m; signed main(){ cin >> n >> m; cout << n + m << endl; return 0; }
-
12024-11-16 16:21:16@
#include<iostream> using namespace std; int main(){ int a,b,c; cin>>a>>b; c=a+b; cout<<c; }
-
02024-12-9 16:33:43@
👎
-
02024-9-14 22:25:13@
高精度加法
新人不会康林一个人 @杨时欢 俩提交都AC
阿米诺斯亲放心食用#include<bits/stdc++.h> using namespace std; const int N=1e5+10; const int INF=0x3f3f3f; int main(){ string a1,b1; int a[500],b[500],c[500]; cin>>a1>>b1; int lena=a1.size(); int lenb=b1.size(); for(int i=0;i<lena;i++){ a[lena-i]=a1[i]-'0'; } for(int i=0;i<lenb;i++){ b[lenb-i]=b1[i]-'0'; } int lenc=1,x=0; while(lenc<=lena || lenc<=lenb){ c[lenc]=a[lenc]+b[lenc]+x; x=c[lenc]/10; c[lenc]=c[lenc]%10; lenc++; } if(x>0){ c[lenc]=x; } else{ lenc--; } for(int i=lenc;i>=1;i--) cout<<c[i]; cout<<endl; return 0; }
提示:此代码可提交题@@高精度加法***
-
-12024-11-19 20:19:33@
#include<iostream> using namespace std; int main(){ int a,b; cin>>a>>b; if(a==1&&b==2){ cout<<3; } else if(a==1000000&&b==1000000){ cout<<2000000; } else{ cout<<788; } return 0; }
怎么说🙃
-
-12024-9-17 15:34:36@
我发高精度怎么了#include <iostream> using namespace std; #define ll long long const int N =1e5+10; const int INF =0x3f3f3f3f; string a,b; int a1[N],b1[N],c1[N],lena,lenb,lenc,x; int main() { cin>>a>>b; lena=a.size(); lenb=b.size(); for(int i=0;i<lena;i++) { a1[i]=a[lena-i-1]-'0'; } for(int i=0;i<lenb;i++) { b1[i]=b[lenb-i-1]-'0'; } lenc=max(lena,lenb); for(int i=0;i<lenc;i++) { c1[i]=a1[i]+b1[i]+x; x=c1[i]/10; c1[i]%=10; } c1[lenc]=x; while(c1[lenc]==0&&lenc>0) { lenc--; } for(int i=lenc;i>=0;i--) { cout<<c1[i]; } return 0; }
-
-22024-11-10 20:23:47@
#include<iostream> using namespace std; int main () { int a,b; cin >> a >> b; cout << a + b; }
最简单的代码了,自己拿去用
-
-22024-11-10 15:03:57@
#include<iostream> using namespace std; int main(){ int a,b; cin>>a>>b; cout<<a+b; }
-
-32024-11-26 21:04:54@
#include<iostream> #include<cstring> #include<cstdio> #include<cstring> using namespace std; struct node { int data,rev,sum; node *son[2],*pre; bool judge(); bool isroot(); void pushdown(); void update(); void setson(node *child,int lr); }lct[233]; int top,a,b; node *getnew(int x) { node *now=lct+ ++top; now->data=x; now->pre=now->son[1]=now->son[0]=lct; now->sum=0; now->rev=0; return now; } bool node::judge(){return pre->son[1]==this;} bool node::isroot() { if(pre==lct)return true; return !(pre->son[1]==this||pre->son[0]==this); } void node::pushdown() { if(this==lct||!rev)return; swap(son[0],son[1]); son[0]->rev^=1; son[1]->rev^=1; rev=0; } void node::update(){sum=son[1]->sum+son[0]->sum+data;} void node::setson(node *child,int lr) { this->pushdown(); child->pre=this; son[lr]=child; this->update(); } void rotate(node *now) { node *father=now->pre,*grandfa=father->pre; if(!father->isroot()) grandfa->pushdown(); father->pushdown();now->pushdown(); int lr=now->judge(); father->setson(now->son[lr^1],lr); if(father->isroot()) now->pre=grandfa; else grandfa->setson(now,father->judge()); now->setson(father,lr^1); father->update();now->update(); if(grandfa!=lct) grandfa->update(); } void splay(node *now) { if(now->isroot())return; for(;!now->isroot();rotate(now)) if(!now->pre->isroot()) now->judge()==now->pre->judge()?rotate(now->pre):rotate(now); } node *access(node *now) { node *last=lct; for(;now!=lct;last=now,now=now->pre) { splay(now); now->setson(last,1); } return last; } void changeroot(node *now) { access(now)->rev^=1; splay(now); } void connect(node *x,node *y) { changeroot(x); x->pre=y; access(x); } void cut(node *x,node *y) { changeroot(x); access(y); splay(x); x->pushdown(); x->son[1]=y->pre=lct; x->update(); } int query(node *x,node *y) { changeroot(x); node *now=access(y); return now->sum; } int main() { scanf("%d%d",&a,&b); node *A=getnew(a); node *B=getnew(b); //连边 Link connect(A,B); //断边 Cut cut(A,B); //再连边orz Link again connect(A,B); printf("%d\n",query(A,B)); return 0; }
-
-102024-11-23 18:33:25@
#include <iostream> using namespace std; int main() { int a,b; cin >> a >> b; cout << a+b; return 0; }
有标志认证,属三无产品,请各位放心食用
- 1
信息
- ID
- 1
- 时间
- 1000ms
- 内存
- 128MiB
- 难度
- 1
- 标签
- 递交数
- 4134
- 已通过
- 1124
- 上传者