13 条题解

  • 2
    @ 2021-7-18 14:55:00

    #include<bits/stdc++.h> using namespace std; typedef long long ll; static char buf[100000],*p1=buf,*p2=buf; #define gc p1p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1p2)?EOF:*p1++; inline ll read() { ll res=0,w=0; char c=gc; while (!isdigit(c)) w|=c=='-',c=gc; while (isdigit(c)) res=(res<<1)+(res<<3)+(c^48),c=gc; if (w) res=-res; return res; } inline void write(ll x) { static int sta[50],top=0; if (x<0) putchar('-'),x=-x; do { sta[top++]=x%10,x/=10; }while (x); while (top) putchar(sta[--top]+48); putchar(' '); }

    signed main() { ll a=read(),b=read(); write(a+b); }

    • 0
      @ 2025-3-12 18:46:56
      #include<bits/stdc++.h>
      using namespace std;
      long long t,f,n,m,a[100000],b[100000];
      int main()
      {
      	cin>>n>>m;
      	t=n,f=m;
      	n=false;
      	m=false;
      	while (n<t)
      	{
      		n++;
      		a[n]=n;
      	}
      	while (m<f)
      	{
      		m++;
      		b[m]=m;
      	}
      	cout<<b[m]+a[n];
      }
      
      • 0
        @ 2025-3-11 16:58:15
        try:
            while True:
        	    a,b=map(int,input().split(' '))
        	    print(a+b)
        except:
        	pass
        
        • 0
          @ 2024-10-1 12:53:17

          c

          #include <stdio.h>
          
          int main() {
              int a,b;
              scanf ("%d %d",&a,&b);
              printf ("%d",a+b);
           }
          
          • 0
            @ 2024-7-21 15:39:28

            #include<bits/stdc++.h> using namespace std; int a[10010],b[10010],c[10010]; int main() { string x,y; cin>>x>>y; int t=0,lena=x.size(),lenb=y.size(); int lenc=max(lena,lenb); for(int i=0;i<lena;i++)a[lena-i]=x[i]-'0'; for(int i=0;i<lenb;i++)b[lenb-i]=y[i]-'0'; for(int i=1;i<=lenc;i++) { t=a[i]+b[i]+t; c[i]=t%10; t/=10; } if(t>0)c[++lenc]=t; for(int i=lenc;i>=1;i--)cout<<c[i]; return 0; }

            • 0
              @ 2023-10-12 21:21:34

              #include<bits/stdc++.h> using namespace std; int a[10010],b[10010],c[10010]; int main() { string x,y; cin>>x>>y; int t=0,lena=x.size(),lenb=y.size(); int lenc=max(lena,lenb); for(int i=0;i<lena;i++)a[lena-i]=x[i]-'0'; for(int i=0;i<lenb;i++)b[lenb-i]=y[i]-'0'; for(int i=1;i<=lenc;i++) { t=a[i]+b[i]+t; c[i]=t%10; t/=10; } if(t>0)c[++lenc]=t; for(int i=lenc;i>=1;i--)cout<<c[i]; return 0; }

              • 0
                @ 2023-8-23 15:15:13
                #include<bits/stdc++.h>
                using namespace std;
                int a[10010],b[10010],c[10010];
                int main()
                {
                	string x,y;
                	cin>>x>>y;
                	int t=0,lena=x.size(),lenb=y.size();
                	int lenc=max(lena,lenb);
                	for(int i=0;i<lena;i++)a[lena-i]=x[i]-'0';
                	for(int i=0;i<lenb;i++)b[lenb-i]=y[i]-'0';
                	for(int i=1;i<=lenc;i++)
                	{
                		t=a[i]+b[i]+t;
                		c[i]=t%10;
                		t/=10;
                	}
                	if(t>0)c[++lenc]=t;
                	for(int i=lenc;i>=1;i--)cout<<c[i];
                	return 0;
                }
                
                • 0
                  @ 2023-8-7 14:18:04
                  #include<bits/stdc++.h>
                  using namespace std;
                  int main()
                  {
                  	int a,b;
                  	cin>>a>>b;
                  	cout<<a+b;
                  	return 0;
                  }
                  
                  • 0
                    @ 2023-7-25 13:09:32
                    #include <bits/stdc++.h>
                    using namespace std;
                    int a,b;
                    int main()
                    {
                    	cin>>a>>b;
                    	cout<<a+b;
                    	return 0;
                    }
                    
                    • 0
                      @ 2023-2-25 19:22:04

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

                      • 0
                        @ 2022-11-14 16:11:58
                        #include <bits/stdc++.h>
                        using namespace std;
                        int main()
                        {
                        	int a,b,c,d,e,n;
                            double k=0;
                        	double s;
                        	cin>>a>>b>>c>>d>>e;
                        	if (a>=60)
                        	{
                        		k++;
                        		s=a;
                            }
                        	if (b>=60)
                        	{
                        		k++;
                        		s=s+b;
                        	}
                        	if (c>=60)
                        	{
                        		k++;
                        		s=s+c;
                        	}
                        	if (d>=60)
                        	{
                        		k++;
                        		s=s+d;
                        	}
                        	if (e>=60)
                        	{
                        		k++;
                        		s=s+e;
                        	}
                        	printf ("%.2f",s*1.0/k);
                        	return 0;
                        }
                        
                        • 0
                          @ 2022-10-15 10:56:06

                          Str AK IOI\texttt{Str AK IOI}

                          • 0
                            @ 2022-8-27 11:01:56

                            I\tt{I} AK\tt{AK} IOI\tt{IOI}

                            • 1

                            信息

                            ID
                            1
                            时间
                            1000ms
                            内存
                            256MiB
                            难度
                            3
                            标签
                            (无)
                            递交数
                            353
                            已通过
                            180
                            上传者