package main
import "fmt"
func main() {
var a, b int
fmt.Scanf("%d%d", &a, &b)
fmt.Printf("%d\n", a + b)
}

欧皇算法

#include <cstdio>
#include <ctime>
#include <iostream>
#include <cstdlib>
#define rg register
int main (int argc, char *argv[])
{
    srand (time (0));
    int a, b; scanf ("%d%d", &a, &b); b += a; rg int i, j;
    for (; i + j != b; i = rand () , j = rand ());
    printf ("%d", b); return 0;
}

跑的贼快（雾）

#include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
int a,b;
cin>>a>>b;
cout<<a+b<<endl;
return 0;
}

a, b = gets.chomp.split.map(&:to_i)
puts a + b

这是ruby的题解，希望vijos能早日加上ruby的评测机qwq

var
a,b:int64;
begin
read(a,b);
writeln(a+b);
end.

#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <deque>
#include <limits>
#include <string>
#include <sstream>
using namespace std;

const int oo_min=0xcfcfcfcf,oo_max=0x3f3f3f3f;

int n,m,t;
vector<int> f;
vector<int> e;
vector<int> u;
vector<int> pre;
vector<int> vis;
vector<vector<int> > c;
vector<vector<int> > p;
vector<vector<int> > ce;
vector<vector<int> > cw;
deque<int> q;

void add_edge_1(int x,int y,int c_v,int p_v)
{
    cw[x].push_back(y);
    c[x].push_back(c_v);
    p[x].push_back(p_v);
    ce[y].push_back(cw[x].size()-1);
    cw[y].push_back(x);
    c[y].push_back(0);
    p[y].push_back(-p_v);
    ce[x].push_back(cw[y].size()-1);
}

int bfs_1(int s,int t,int *flow,int *cost)
{
    f.resize(0);
    f.resize(cw.size(),0);
    f[s]=oo_max;
    e.resize(0);
    e.resize(cw.size(),-1);
    u.resize(0);
    u.resize(cw.size(),oo_max);
    u[s]=0;
    pre.resize(0);
    pre.resize(cw.size(),-1);
    pre[s]=s;
    vis.resize(0);
    vis.resize(cw.size(),0);
    for (q.resize(0),vis[s]=1,q.push_back(s);(!q.empty());vis[q.front()]=0,q.pop_front())
    {
        int now=q.front();
        for (int i=0;i<cw[now].size();i++)
            if (c[now][i]&&u[now]+p[now][i]<u[cw[now][i]])
            {
                f[cw[now][i]]=min(c[now][i],f[now]);
                e[cw[now][i]]=i;
                u[cw[now][i]]=u[now]+p[now][i];
                pre[cw[now][i]]=now;
                if (vis[cw[now][i]]==0)
                    vis[cw[now][i]]=1,q.push_back(cw[now][i]);
            }
    }
    (*flow)=f[t];
    (*cost)=u[t];
    return (pre[t]!=-1);
}

void min_cost_max_flow_1(int s,int t,int *flow,int *cost)
{
    int temp_flow,temp_cost;
    while (bfs_1(s,t,&temp_flow,&temp_cost))
    {
        for (int i=t;i!=s;i=pre[i])
            c[pre[i]][e[i]]-=temp_flow,c[i][ce[pre[i]][e[i]]]+=temp_flow;
        (*flow)+=temp_flow;
        (*cost)+=temp_cost;
    }
}

int a,b;

int main()
{
    while (~scanf("%d%d",&a,&b))
    {
        cw.resize(0);
        cw.resize(2);
        ce.resize(0);
        ce.resize(cw.size());
        c.resize(0);
        c.resize(cw.size());
        p.resize(0);
        p.resize(cw.size());
        add_edge_1(0,1,oo_max,a);
        add_edge_1(0,1,oo_max,b);
        int ans_flow=0,ans_cost=0;
        min_cost_max_flow_1(0,1,&ans_flow,&ans_cost);
        printf("%d\n",ans_cost);
    }
}

var a, b:longint;
begin
readln(a, b);
writeln(a + b);
end.

#include<stdio.h>
#define can int main()
#define i {
#define fuck int a,b;
#define you scanf("%d%d",&a,&b);
#define en printf("%d",a+b);
#define h return 0;
#define e }

can i fuck you en h e

#include <iostream>

using namespace std;

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

#include <iostream>

using namespace std;

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

#include<bits/stdc++.h>
using namespace std;
int f[1000011];
int gf(int x)
{
    if (f[x]==x) return x;
    else return f[x]=gf(f[x]);
}
int un(int x,int y)
{
    f[gf(x)]=gf(y);
}
int main()
{
    int a,b;
    for (int i=1;i<=100010;i++) f[i]=i;
    cin>>a>>b;
    for (int i=2;i<=a;i++)un(i-1,i);
    for (int i=a+2;i<=a+b;i++)un(i-1,i);
    un(1,a+b);
    int ans=1;
    for (int i=2;i<=100010;i++) if (gf(i-1)==gf(i)) ans++;
    cout<<ans;
}

#发一个并查集的代码
cpp
#include<bits/stdc++.h>
using namespace std;
int f[1000011];
int gf(int x)
{
if (f[x]==x) return x;
else return f[x]=gf(f[x]);
}
int un(int x,int y)
{
f[gf(x)]=gf(y);
}
int main()
{
int a,b;
for (int i=1;i<=100010;i++) f[i]=i;
cin>>a>>b;
for (int i=2;i<=a;i++)un(i-1,i);
for (int i=a+2;i<=a+b;i++)un(i-1,i);
un(1,a+b);
int ans=1;
for (int i=2;i<=100010;i++) if (gf(i-1)==gf(i)) ans++;
cout<<ans;
}


训练阶梯2

大家好，这一题其实应该用网络流。
cpp
#include<bits/stdc++.h>
using namespace std;
#define set(x) Set(x)
#define REP(i,j,k) for (int i=(j),_end_=(k);i<=_end_;++i)
#define DREP(i,j,k) for (int i=(j),_start_=(k);i>=_start_;--i)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define mp make_pair
#define x first
#define y second
#define pb push_back
#define SZ(x) (int((x).size()-1))
#define ALL(x) ((x).begin()+1),(x).end()
template<typename T> inline bool chkmin(T &a,const T &b){ return a > b ? a = b, 1 : 0; }
template<typename T> inline bool chkmax(T &a,const T &b){ return a < b ? a = b, 1 : 0; }
typedef long long LL;
typedef pair<int,int> node;
const int dmax=1010,oo=0x3f3f3f3f;
int n,m;
int a[dmax][dmax] , ans;
int d[dmax],e[dmax];
priority_queue <node> q;
inline bool operator >(node a,node b){ return a.y>b.y; }
bool p[dmax];
void Set(int x){ p[x]=1; }
void unset(int x){ p[x]=0; }
bool check(int x){ return x!=1 && x!=n && !p[x] && e[x]>0; }
void preflow(){
e[1]=oo;
d[1]=n-1;
q.push(mp(1,n-1));
set(1);
while (!q.empty()){
bool flag=1;
int k=q.top().x;
q.pop(),unset(k);
DREP(i,n,1)
if ((d[k]==d[i]+1 || k==1) && a[k][i]>0){
flag=0;
int t=min(a[k][i],e[k]);
e[k]-=t;
a[k][i]-=t;
e[i]+=t;
a[i][k]+=t;
if (check(i)){
q.push(mp(i,d[i]));
set(i);
}
if (e[k]==0) break;
}
if (flag){
d[k]=oo;
REP(i,1,n)
if (a[k][i]>0)
chkmin(d[k],d[i]+1);
}
if (check(k)){
q.push(mp(k,d[k]));
set(k);
}
}
ans=e[n];
}
int main(){
n = 2, m = 2;
int x, y;
scanf("%d%d", &x, &y);
a[1][2] += x + y;
preflow();
printf("%d\n",ans);
return 0;
}


C++，我用个二进制吧。。。
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{
int a,b,s=0,s1=0,i=0,na=0,nb=0;
cin>>a>>b;
if(a<=0) na=1,a*=-1;
while(a!=0)
{
if(a%2!=0)
s+=pow(2,a%2*i);
a/=2;
i++;
}
i=0;
if(na==1) s*=-1;
if(b<=0) nb=1,b*=-1;
while(b!=0)
{
if(b%2!=0)
s1+=pow(2,b%2*i);
b/=2;
i++;
}
if(nb==1) s1*=-1;
cout<<s+s1;;
return 0;
}

C答案，不谢，已AC
#include <stdio.h>
int main()
{
int x,y;
scanf("%d%d",&x,&y);
printf("%d",x+y);
return 0;
}

var a,b:longint;
begin
readln(a,b);
writeln(a+b);
end.

var n,k,i,num,sum,ans:longint; a:array[0..20] of longint;

function pangduan(n:longint):integer;
var xx,i:integer;
begin
xx:=trunc(sqrt(n+1));
for i:=2 to xx do
if (n mod i=0) then exit(0);
exit(1);
end;

procedure doit(t:longint);
var p,i:longint;
begin
if (num=k) then
begin
p:=pangduan(sum);
if (p=1) then inc(ans);
exit;
end;
for i:=t+1 to n do
begin
inc(num);
sum:=sum+a[i];
doit(i);
sum:=sum-a[i];
dec(num);
end;
end;

begin
readln(n,k);
for i:=1 to n do read(a[i]);
for i:=1 to n-k+1 do
begin
num:=1;
sum:=a[i];
doit(i);
end;
writeln(ans);
end.

冷清啊。。我来一发Python3的题解

a, b = map(int, input().split())
print(a + b)

恩 就是这么简洁qwq

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