31 条题解

  • 3
    @ 2025-11-8 9:43:09
    #include<bits/stdc++.h>
    
    using namespace std;
    int main()
    {
    	string a1,b1;
    	int a[10000]={},b[10000]={},c[10000]={};
    	cin >> a1 >> b1;
    	int lena=a1.size();
    	int lenb=b1.size();
    	for(int i=1;i<=lena;i++)
    	{
    		a[i]=a1[lena-i]-'0';
    	} 
    	for(int i=1;i<=lenb;i++)
    	{
    		b[i]=b1[lenb-i]-'0';
    	}  
    	int lenc=1;
    	while(lenc<=lena||lenc<=lenb)
    	{
    		c[lenc]+=a[lenc]+b[lenc];
    		if(c[lenc]>9)
    		{
    			c[lenc]-=10;
    			c[lenc+1]++; 
    		}
    		lenc++;
    	} 
    	if(c[lenc]==0)
    	{
    		lenc--;
    	}
    	for(int i=lenc;i>=1;i--)
    	{
    		cout << c[i];
    	}
    	return 0;
    }
    
    • 3
      @ 2025-10-25 9:34:12
      #include<iostream>
      using namespace std;
      int main(){
          int a,b;
          cin>>a>>b;
          cout<<a+b;
      return 0;
      }
      
      • 3
        @ 2025-10-25 9:33:33
        #include<bits/stdc++.h>
        using namespace std;
        const int N=1e3+10;
        int a,b;
        int main()
        {
        	cin >> a >> b;
        	cout << a+b;
        	return 0;
        }
        
        
        • 2
          @ 2025-11-22 9:41:59
          #include<iostream>
          using amespace std;
          int vera(int x,int y){
          	return x+y;
          }
          int main(){
          	int a=1,b=2;
          	cout<<vera(a,b);
          	return 0;
          }
          
          
          • 2
            @ 2025-11-22 9:37:06
            #include<bits/stdc++.h>
            using namespace std;
            const int N=1e3+10;
            int Accepted(int a,int b){//Accepted()
            	return a+b; 
            }
            int main()
            {
            	int a,b;
            	cin >> a >> b;
            	cout << Accepted(a,b);
            	return 0;
            }
            //老登布置的作业系列
            
            
            • 1
              @ 2025-12-14 12:27:47
              #include <iostream>
              using namespace std;
              int main()
              {
              	int a,b;
              	cin>>a>>b;
              	cout<<a+b;
              	return 0;
              }
              
              • 0
                @ 2025-12-13 19:56:30

                #include using namespace std; int main() { int a , b;

                cin>>a>>b;
                
                cout<<a+b;
                
                return 0;	
                

                }

                • 0
                  @ 2025-8-18 11:23:58

                  谁不会这道题??

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

                  其实是我不会

                  禁止发疯!!!

                  • 0
                    @ 2025-5-11 9:37:50

                    权威

                    #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;
                    }
                    
                    
                    
                    
                    • 0
                      @ 2024-7-26 10:58:29

                      A+B Problem题解

                      新用户强烈建议阅读此帖

                      首先我们要理清思路

                      1.需要用到什么样的头文件?

                      2.用什么样的数据范围?

                      3.思路是什么?

                      首先题目中的数据范围是1a,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; 
                      }
                      

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

                      • -1
                        @ 2025-11-22 9:39:27

                        #include<bits/stdc++.h> using namespace std; const int N=1e3+10; int fx(int x,int y){ return x+y; } int main() { int a=1,b=2; cin>>a>>b; cout<<fx(a,b); return 0; }

                      • -1
                        @ 2025-11-22 9:38:05

                        #include<bits/stdc++.h> using namespace std; const int N=1e3+10; int fx(int x,int y){ return x+y; } int main() { int a=1,b=2; cin>>a>>b; cout<<fx(a,b); return 0; }

                        • -1
                          @ 2025-11-9 19:01:11

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

                          • -1
                            @ 2025-5-24 15:28:36
                            #include<bits/stdc++.h>//万能头文件
                            using namespace std;
                            
                            int main(){
                            //定义int类型变量a,b
                            int a;
                            int b;
                            //输入变量a,b
                            scanf("%d",&a);
                            scanf("%d",&b);
                            //输出a,b
                            printf(" %d\n", a + b);
                            //exit(0); 或 return 0; 结束程序
                            return 0;
                            }
                            
                            
                            • -2
                              @ 2025-7-23 22:55:34
                              #include<bits/stdc++.h>
                              /*使用iostream库
                              导入cin和cout函数*/
                              using namespace std;
                              /*获取命名空间*/
                              int main(){//主函数
                                  int a,b;//定义整数变量
                                  cin>>a>>b;//输入数据
                                  cout<<a+b<<endl;//计算并输出数据
                              
                                  return 0;//结束主函数
                              }
                              
                              • -2
                                @ 2025-7-7 11:38:39
                                #include<bits/stdc++.h>
                                using namespace std;
                                int main(){
                                	long long a,b;
                                	cin>>a>>b;
                                	cout<<a+b;
                                }
                                
                                
                                • -2
                                  @ 2025-7-6 23:16:54

                                  #include

                                  using namespace std;

                                  int main()

                                  {

                                  int a;
                                  
                                  int b;
                                  
                                  cin>>a>>b;
                                  
                                  cout<<a+b;
                                  
                                  return 0;
                                  

                                  }

                                  • -2
                                    @ 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;
                                    }
                                    //菜鸟驿站
                                    //老六专属
                                    
                                    
                                    • -2
                                      @ 2025-1-23 11:13:08
                                      #include<iostream>
                                      using namespace std;
                                      int main()
                                      {
                                      	int a,b;
                                      	cin>>a>>b;
                                      	cout<<a+b;
                                      }
                                      
                                      • -3
                                        @ 2025-2-21 19:53:22

                                        最短题解

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

                                        信息

                                        ID
                                        1
                                        时间
                                        1000ms
                                        内存
                                        128MiB
                                        难度
                                        1
                                        标签
                                        递交数
                                        4941
                                        已通过
                                        1395
                                        上传者