A+B Problem && OJ推荐【持续更新】

List

List
前言
长郡
Position：
Notice
code
- 1.
- 2.
持续更新，么么哒

前言

有没有觉得写这篇文章很奇怪，这个还是有原因的。①很多OJ都有着道题，所以发个博客②这可以介绍很多OJ(持续更新)

长郡

热烈推荐:http://oj.changjun.com.cn/

然后有一套A+B的神题-Contest4 - A+B Series(http://www.cnblogs.com/YJinpeng/p/5942724.html)

Position：

Notice

不同的题目：

--- hdu1000(见code2)-多组数据，坑

其他没有A+B Problem好的OJ

code

搞了三发才0ms

#include <iostream>

#include <cstdio>

inline int gi() {

    register int w=0;register char ch=getchar();

    while(ch<'0'||ch>'9')ch=getchar();

    while(ch>='0'&&ch<='9')w=w*10+ch-'0',ch=getchar();

    return w;

}

int main()

{

    printf("%d",gi()+gi());

    return 0;

}

1.

// <A+B_Problem.cpp> - 08/13/16 15:16:49

// This file is made by YJinpeng，created by XuYike's black technology automatically.

// Copyright (C) 2016 ChangJun High School, Inc.

// I don't know what this program is.

#include <iostream>

#include <vector>

#include <algorithm>

#include <cstring>

#include <cstdio>

#include <cstdlib>

#include <cmath>

#define MOD 1000000007

#define INF 1e9

#define EPS 1e-10

using namespace std;

typedef long long LL;

const int MAXN=100010;

const int MAXM=100010;

inline int max(int &x,int &y) {return x>y?x:y;}

inline int min(int &x,int &y) {return x<y?x:y;}

inline LL getLL() {

	register LL w=0,q=0;register char ch=getchar();

	while((ch<'0'||ch>'9')&&ch!='-')ch=getchar();

	if(ch=='-')q=1,ch=getchar();

	while(ch>='0'&&ch<='9')w=w*10+ch-'0',ch=getchar();

	return q?-w:w;

}

int main()

{

	freopen("A+B_Problem.in","r",stdin);

	freopen("A+B_Problem.out","w",stdout);

	LL a=getLL(),b=getLL();

    cout<<a+b;

	return 0;

}

2.

// <A+B_Problem.cpp> - 08/13/16 15:16:49

// This file is made by YJinpeng，created by XuYike's black technology automatically.

// Copyright (C) 2016 ChangJun High School, Inc.

// I don't know what this program is.

#include <iostream>

#include <vector>

#include <algorithm>

#include <cstring>

#include <cstdio>

#include <cstdlib>

#include <cmath>

#define MOD 1000000007

#define INF 1e9

#define EPS 1e-10

using namespace std;

typedef long long LL;

const int MAXN=100010;

const int MAXM=100010;

inline int max(int &x,int &y) {return x>y?x:y;}

inline int min(int &x,int &y) {return x<y?x:y;}

inline int getLL() {

	register LL w=0,q=0;register char ch=getchar();

	while((ch<'0'||ch>'9')&&ch!='-')ch=getchar();

	if(ch=='-')q=1,ch=getchar();

	while(ch>='0'&&ch<='9')w=w*10+ch-'0',ch=getchar();

	return q?-w:w;

}

int main()

{

	freopen("A+B_Problem.in","r",stdin);

	freopen("A+B_Problem.out","w",stdout);

    int a,b;

    while(~scanf("%d%d",&a,&b))printf("%d\n",a+b);

	return 0;

}

巴特西

A+B Problem && OJ推荐【持续更新】

List

前言

长郡

Position：

Notice

code

1.

2.

持续更新，么么哒

最新文章

热门文章