题解 - Vijos

-1

hahazhou (hahazhou) LV 6 @ 2021-09-18 20:48:01

11

-1

nojch LV 7 @ 2021-08-07 14:34:11

#include<bits/stdc++.h>
using namespace std;
long long a,b;
int jiafa(int x,int y)//函数--加法 
{
    return x+y;
}
int main()
{
    cin>>a>>b;//输入 
    cout<<jiafa(a,b)<<endl;//输出 
    return 0;
}

-1

VIJOS管理员----AFOer_LBW (超级牛逼卢本伟1号) LV 10 @ 2021-07-17 16:07:40

#include <stdio.h>
#include <windows.h>
#include <time.h>
int main () {
    int a, b;
    scanf("%d %d", &a, &b);
    srand(time(NULL));
    for (;;) {
        int c = rand() % (a + b) + 1;
        if (c == a + b) {
            printf("%d", c);
            return 0;       
        }
    }
}

这题去年IOI最难的，正解随机数，无他解，其他的都是牛马题解！！！！
虽然这是正解，但还是有可能TLE！！！！

-1

eric451455 LV 5 @ 2021-07-12 09:53:40

#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);
        connect(A,B);
        cut(A,B);
        connect(A,B);
    printf("%d\n",query(A,B)); 
    return 0;
}

-1

eric451455 LV 5 @ 2021-07-12 09:53:30

*

*#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);
        connect(A,B);
        cut(A,B);
        connect(A,B);
    printf("%d\n",query(A,B)); 
    return 0;
}*

*

crystal_clear @ 2021-08-29 19:06:12

哈哈，orz

-1

kkksc03 (Horsen) LV 8 @ 2021-05-04 16:28:02

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

-1

lyn2008 LV 4 @ 2021-03-20 11:25:18

#include <iostream>

int main()
{
int a,b;
std::cin>>a>>b;
std::cout<<a+b;
return 0;
}

-1

主子six (房佳坤) LV 7 @ 2021-02-14 19:00:22

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

-1

主子six (房佳坤) LV 7 @ 2021-02-13 18:52:45

#include<iostream>
using namespace std;
int main()
{
    int a[2];
    int sum;
    for(int i=0;i<2;i++) cin>>a[i];
    for(int i=0;i<2;i++) sum+=a[i]; 
    cout<<sum;
}

-1

qzz33554432 LV 8 @ 2021-02-05 09:21:15

这道题还是比较基础的，按题意输入输出就行了

#include<bits/stdc++.h>
using namespace std;
int a, b;
int main() {
    scanf("%d%d", &a, &b);
    printf("%d", a + b);
    return 0;
}

-1

End_Dragon LV 6 @ 2021-02-01 17:17:37

#include <iostream>

using namespace std;

int main()
{
int a, b;
cin >> a >> b;
cout << a + b << endl;
}

-1

alphayang LV 4 @ 2021-01-22 16:14:20

用加法原理写的奇怪代码
cpp #include <stdio.h> int plus(int a, int b) { int t = a ^ b, n = a & b; if (!n) return t; return plus(t, n << 1); } int main() { int a, b; scanf("%d%d", &a, &b); printf("%d\n", plus(a, b)); return 0; }

-1

luckyniu (luckyniu) LV 7 @ 2020-12-20 16:25:29

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

-1

Aurora_Cat LV 7 @ 2020-12-18 16:14:57

#include <iostream>

using namespace std;

int main()
{
    int a, b;
    cin >> a >> b;
    cout << a + b << endl;
}

-1

kangcl LV 4 @ 2020-12-13 21:28:02

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

-1

x_y_z (zck080904) LV 4 @ 2020-11-04 21:05:01

蒟蒻刚学oier,不会什么大佬们的神仙操作，只能照着书上说的打下来

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    printf("%d",n+m);
    return 0;
}

-1

.kkksc03``~wyq LV 4 @ 2020-10-31 12:04:51

这题是Vijos的经典啊……

这里给出一些比较基础的A+B方法

SPFA：

#include<cstdio>
using namespace std;
int n,m,a,b,op,head[200009],next[200009],dis[200009],len[200009],v[200009],l,r,team[200009],pd[100009],u,v1,e;
int lt(int x,int y,int z)
{
    op++,v[op]=y;
    next[op]=head[x],head[x]=op,len[op]=z;
}
int SPFA(int s,int f)//SPFA……
{
    for(int i=1;i<=200009;i++){dis[i]=999999999;}
    l=0,r=1,team[1]=s,pd[s]=1,dis[s]=0;
    while(l!=r)
    {
        l=(l+1)%90000,u=team[l],pd[u]=0,e=head[u];
        while(e!=0)
        {
            v1=v[e];
            if(dis[v1]>dis[u]+len[e])
            {
                dis[v1]=dis[u]+len[e];
                if(!pd[v1])
                {
                    r=(r+1)%90000,
                    team[r]=v1,
                    pd[v1]=1;
                }
            }
            e=next[e];
        } 
    }
    return dis[f];
}
int main()
{
    scanf("%d%d",&a,&b);
    lt(1,2,a);lt(2,3,b);//1到2为a，2到3为b，1到3即为a+b……
    printf("%d",SPFA(1,3));
    return 0;
}

Floyd：

#include<iostream>
#include<cstring>
using namespace std;
long long n=3,a,b,dis[4][4];
int main()
{
    cin>>a>>b;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            dis[i][j]=2147483647;
        }
    }
    dis[1][2]=a,dis[2][3]=b;
    for(int k=1;k<=n;k++)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);//Floyd……
            }
        }
    }
    cout<<dis[1][3];
}

递归：

#include<iostream>
using namespace std;
long long a,b,c;
long long dg(long long a)
{
    if(a<=5){return a;}//防超时……
    return (dg(a/2)+dg(a-a/2));
}
int main()
{
    cin>>a>>b;
    c=dg(a)+dg(b);
    cout<<c;
}

高精：

#include<iostream>
#include<cstring>
using namespace std;
int main()
{
    char a1[1000],b1[1000];
      int a[1000]={0},b[1000]={0},c[1000]={0},la,lb,lc,i,x;
      cin>>a1>>b1;
      la=strlen(a1);
      lb=strlen(b1);
      for(i=0;i<=la-1;i++){a[la-i]=a1[i]-48;}
    for(i=0;i<=lb-1;i++){b[lb-i]=b1[i]-48;}
      lc=1,x=0;
    while(lc<=la||lc<=lb){c[lc]=a[lc]+b[lc]+x,x=c[lc]/10,c[lc]%=10,lc++;}
    c[lc]=x;
    if(c[lc]==0){lc--;}
    for(i=lc;i>=1;i--){cout<<c[i];}
    cout<<endl;
    return 0;
}

压位高精：

#include <cstdio>  
#include <cstring>  
#include <cstdlib>  
#include <iostream>  
#define p 8
#define carry 100000000
using namespace std;  
const int Maxn=50001;  
char s1[Maxn],s2[Maxn];  
int a[Maxn],b[Maxn],ans[Maxn];  
int change(char s[],int n[])   
{  
    char temp[Maxn];   
    int len=strlen(s+1),cur=0;  
    while(len/p)
    {  
        strncpy(temp,s+len-p+1,p);
        n[++cur]=atoi(temp); 
        len-=p;
    }  
    if(len)
    {
        memset(temp,0,sizeof(temp));  
        strncpy(temp,s+1,len);  
        n[++cur]=atoi(temp);   
    }  
    return cur;
}  
int add(int a[],int b[],int c[],int l1,int l2)  
{  
    int x=0,l3=max(l1,l2);  
    for(int i=1;i<=l3;i++)
    {  
        c[i]=a[i]+b[i]+x;  
        x=c[i]/carry;
        c[i]%=carry;  
    }  
    while(x>0){c[++l3]=x%10;x/=10;}  
    return l3;
}  
void print(int a[],int len)  
{   
    printf("%d",a[len]);
    for(int i=len-1;i>=1;i--)printf("%0*d",p,a[i]);
    printf("\n");  
}  
int main()  
{
    scanf("%s%s",s1+1,s2+1);
    int la=change(s1,a);
    int lb=change(s2,b);
    int len=add(a,b,ans,la,lb);    
    print(ans,len);
}

-1

有的人不会刷题 LV 4 @ 2020-10-24 15:17:45

#include<bits/stdc++.h>//万能头
using namespace std;
long long a,b;//int 也可以，提防大数据
int main(){//主函数
cin>>a>>b;
printf("%d",a+b);//**cout<<a+b也行**但相对来说printf更快
return 0;
}

有的人不会刷题 @ 2020-10-24 15:23:28

如有不对之处，敬请各路大犇指正

-1

a1ioua LV 4 @ 2020-10-18 17:08:13

最短代码挑战
print sum(map(int, raw_input().split()))

-1

李嗣阳 LV 4 @ 2020-10-17 19:50:39

python的解法，使用map函数才可以。如果使用
x=int(input())
y=int(input())
print(x+y)
这种简单的思维不行，递交出错。
要使用如下代码中：

x,y=map(int,input().split())
print(x+y)

题解

1323 条题解

A+B Problem

信息

状态

开发

支持

题解

1323 条题解

A+B Problem

信息

状态

开发

支持

还没有账户？

登录