3

2024sng008 LV 8 @ 2025-1-23 11:13:08

#include<iostream>
using namespace std;
int main()
{
	int a,b;
	cin>>a>>b;
	cout<<a+b;
}

1

wuhaolin1 LV 10 @ 2025-4-19 19:45:44

#include using namespace std; int main() { int a,b; cin >> a >> b; cout << a+b; return 0; }

1

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; 
}

本蒟蒻发的第一篇题解，请多多支持喵~~

0

wanbofang LV 7 @ 2025-4-23 18:57:08

#include <bits/stdc++.h> using namespace std; int main() { int a,b; while(cin >> a >> b) { int sum = a* b; while(b != 0) { int t = a%b; a = b; b = t; } cout << a << " " << sum/a << endl;; } return 0; }

0

wuhaolin1 LV 10 @ 2025-4-21 20:16:38

```cpp
#include <bits/stdc++.h>
using namespace std;
#define LL long long
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
string a1 , b1;
int a[500] , b[500] , c[500];
int main()
{
    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;
}
//菜鸟驿站
//老六专属

0

wuhaolin1 LV 10 @ 2025-4-21 20:16:38

```cpp
#include <bits/stdc++.h>
using namespace std;
#define LL long long
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
string a1 , b1;
int a[500] , b[500] , c[500];
int main()
{
    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;
}
//菜鸟驿站
//老六专属

0

wuhaolin1 LV 10 @ 2025-4-21 20:11:49

#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;

}

0

2024sng28 LV 10 @ 2025-2-21 19:53:22

最短题解

#include<iostream>
int a,b;int main(){std::cin>>a>>b;std::cout<<a+b;}

0

mengqingyu LV 10 @ 2024-11-16 16:21:16

#include<iostream>
using namespace std;
int main(){
	int a,b,c;
	cin>>a>>b;
	c=a+b;
	cout<<c;
}

-1

wanbofang LV 7 @ 2025-4-9 20:00:47

#include<bits/stdc++.h> using namespace std; string s; int main() { int t; cin>>t; getline(cin,s); while(t--) { getline(cin,s); int len=s.size(),n=0; s[len]=' '; for(int i=0;i<=len;i++) { if(s[i]!=' ') n++; else { for(int j=i-1;j>=i-n;j--) cout<<s[j]; n=0; cout<<" "; } } cout<<endl; } return 0; }

-2

安娜 C++ LV 8 @ 2025-1-25 11:30:47

#include<bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
cout << a + b << endl;
return 0;
}

-2

slz罗栎晟 LV 8 @ 2024-11-10 15:03:57

#include<iostream> 
using namespace std;
int main(){
	int a,b;
	cin>>a>>b;
	cout<<a+b;
}

-2

liujinhao LV 8 @ 2024-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;
}

提示：此代码可提交题@@高精度加法***

-3

linsirui LV 9 @ 2024-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;
}

-3

linsirui LV 9 @ 2024-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;
}

怎么说🙃

2024sng28 @ 2025-2-21 19:54:15

？？？

-3

liangjingxu LV 7 @ 2024-11-10 20:23:47

#include<iostream>
using namespace std;
int main ()
{
	int a,b;
	cin >> a >> b;
	cout << a + b; 
}

最简单的代码了，自己拿去用

-4

linuoyi2 LV 5 @ 2024-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;
}

mengqingyu @ 2024-12-7 18:23:18

666,

-12

ts2024stu008 LV 8 @ 2024-11-23 18:33:25

#include <iostream>
using namespace std;
int main()
{
    int a,b;
    cin >> a >> b;
    cout << a+b;
    return 0;
}

有标志认证，属三无产品，请各位放心食用

2024sng28 @ 2025-2-21 19:51:47

@哥们儿你这代码真能AC吗

18 条题解

A+B Problem题解

新用户强烈建议阅读此帖

高精度加法

A + B Problem

信息

状态

开发

支持

18 条题解

A+B Problem题解

新用户强烈建议阅读此帖

高精度加法

A + B Problem

信息

状态

开发

支持

还没有账户？

登录