Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define loop(n) rep(loop, (0), (n))
#... | 460 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
long long GCD(long long a, long long b){return b == 0 ? a : GCD(b, a % b);}
long long fast_exp(long long base, long long exp, long long mod = MOD) {
long long tot = 1;
for(;exp > 0;exp >>= 1) {
if((exp & 1) == 1) tot = tot... | 410 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i,c) for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(a, n) memset(a, n, sizeof(a))
ty... | 289 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main() {
int n;
int a[101];
int b[101];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int max = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j <= i; j++) {
cnt += a[j];
}for (int j ... | 172 |
Project_CodeNet | 2,018 | #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>... | 714 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <array>
#include <cstddef>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<vector<int>> table(2, vector<int>(n, 0));
for (int i = 0; i < 2; i++)
{
... | 226 |
Project_CodeNet | 2,018 | #include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <c... | 415 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i,n) for(int i=0;i<n;++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
# define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#else
# ... | 581 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <string>
#include <unordered_map>
#include <vector>
#include <numeric>
#define rep(i,min,max) for(int i=min;i<max;i++)
#define rrep(i,min,max) for(int i=max;i>=min;i--)
using namespace std;
int main(){
int N;cin >> N;
int s1[N];
int s2[N];
int tmp[N];
int l... | 206 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<algorithm>
#include<queue>
#include<vector>
#define ll long long
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define inf 0x7fffffff
#define mod 998244353
#define eps 1e-20
ll read()
{
ll tmp=0; char c=getchar(),f... | 253 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, l, r) for (int i = l; i<r;i++)
#define vi vector<int>
#define all(v) v.begin(),v.end()
#define pb(c) push_back(c)
#define vii vector<pair<int,int>>
#define ii pair<int,int>
#define max(a, b) (((a)<(b))?b:a)
#define min(a, b) ((a>b)?b:a)
#define mp(i, j) make_... | 379 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define debug(x) cerr<< #x << ": "<< x << endl;
#define print(x) cerr<< x << endl;
#define mp make_pair
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define REP(i,x,y) for(int i=x;i<y;i++)
#define REPIT(it,A) for(typeof(A.begin()) it =... | 303 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
vector<ll> A[2];
ll R;
int main() {
cin >> N;
for (ll i : {0, 1}) A[i].resize(N);
for (ll i : {0, 1})
for (ll j = 0; j < N; ++j) cin >> A[i][j];
for (ll j = 1; j < N; ++j) A[0][j] += A[0][j - 1];
for (ll j = N - 2; j >= 0; --j) A... | 205 |
Project_CodeNet | 2,018 |
#include <stdio.h>
int Syutoku(int N, int *A);
int Maxget(int N, int *A1, int *A2);
int main(void){
int N,max;
int A1[100] = {0};
int A2[100] = {0};
scanf("%d",&N);
Syutoku(N,&A1[0]);
Syutoku(N,&A2[0]);
max = Maxget(N,&A1[0],&A2[0]);
printf("%d",max);
return 0;
}
int Syutoku(int N, int *A){
for(int ... | 256 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 100;
int n, a[2][MAX], mem[2][MAX];
int best(int i, int j) {
if (i > 1 || j >= n || i < 0 || j < 0) {
return 0;
}
// return memoized value
if (mem[i][j] != -1) {
return mem[i][j];
}
if (i == 0 && j == 0) {
mem[i][j] = a[i][j];
return mem[i]... | 258 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstdlib>
#include<cmath>
#include<climits>
#include<iostream>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<numeric>
#include<bitset>
#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#defin... | 408 |
Project_CodeNet | 2,018 | // In the Name of God
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define sz(a) (a.size())
#define all(v) v.begin(), v.end()
#define bpc(v) __builtin_popcountl... | 398 |
Project_CodeNet | 2,018 | #include<iostream>
#include<stdio.h>
#include<string.h>
#include<ctype.h>
#include<stdlib.h>
using namespace std;
int main(){
int n;
int a[100];
int b[100];
int suma[100];
int sumb[100];
int max;
max = 0;
cin >> n;
suma[0] = 0;
sumb[0] = 0;
cin >> a[0];
suma[0] = a[0];
for(int i = 1 ; i < n ; i++ ){
... | 271 |
Project_CodeNet | 2,018 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=(n)-1;i>=0;i--)
#define VSORT(v) sort(v.begin(), v.end(... | 505 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<tuple>
#include<iomanip>
#include<map>
#define int long long
using namespace std;
signed main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
for(int i = 0;i < N;i++) {
cin >> A.at(i);
... | 192 |
Project_CodeNet | 2,018 | #include <iostream>
#include <queue>
#include <stack>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <bitset>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <string>
#include <sstream>
#define x first
#define y second
#define pb push_back
#define mp mak... | 665 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int nmax=100;
int n;
int dp[5][nmax+5];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
int key;
cin>>key;
dp[1][i]=dp[1][i-1]+key;
}
for(int i=1;i<=n;i++)
{
int key;
cin>>key;
dp[2][i]=max(dp[2][... | 146 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <random>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<ll, ll> ll_ll;
struct edge { int v, w; };
const int INF = INT_MAX / 2;
const int MOD = 1e9 + 7;
... | 256 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
const int maxn = 1e2 + 10 , mod = 1e9 + 7;
int n, a[2][maxn], pu[maxn], pd[maxn], res;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 0; i < 2; i++)
for (int j = 0;... | 226 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int d[3][101],a[3][101];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
cin >> a[i][j];
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
d[i... | 148 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;//10 32 -1
inline int read()
{
int ret=0,f=1; char c=getchar();
while(c<48||c>57)
{
if(c=='-')f=-1;
c=getchar();
}
while(c>=48&&c<=57)ret=ret*10+c-48,c=getchar();
return f*ret;
}
int n,a[105][105];
int main()
{
n=read();
for(int i=1; i<=2; ++i)
for(int j=1; ... | 215 |
Project_CodeNet | 2,018 | #include <iostream>
#include <stdio.h>
#include <cstring>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <utility>
#include <fstream>
#include <random>
#include <map>
#include <unordered_map>
#include <cstdlib>
#define rep(i,n) f... | 291 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#define max(a, b) (a > b ? a : b)
using namespace std;
int main()
{
int no_of_columns;
scanf("%d", &no_of_columns);
int candies[2 + 1][no_of_columns + 1];
memset(candies, 0, sizeof(candies));
for(int i = 1; i <= 2; i++)
for(int j = 1; j <= no_of_colum... | 271 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#d... | 276 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<complex>
using namespace std;
typedef long long LL;
#define sqr(x) ((x)*(x))
#define mp make_pair
inline char gc(){
static char buf[100000],*p1=buf,*p2=buf;... | 361 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define F first
#define S second
#define P push
#define pb push_back
#define MEM(dp,i) memset(dp,i,sizeof(dp))
#define W while
#define R return
#define C continue
#define SI size()
#define ll long long
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define SF(x) scanf... | 352 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
#define il inline
namespace io {
#define in(a) a = read()
#define out(a) write(a)
#define outn(a) out(a), putchar('\n')
#define I_int ll
inline I_int read() {
I_int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
... | 458 |
Project_CodeNet | 2,018 | #include <cstdlib>
#include <cstdio>
#include <algorithm>
#define maxn 105
#define rep(i, l, r) for (register int i = l; i <= r; i++)
#define per(i, r, l) for (register int i = r; i >= l; i--)
using namespace std;
int a[maxn];
int b[maxn];
int n;
int main(){
scanf("%d", &n);
rep(i, 1, n) scanf("%d", &a[i]), a... | 193 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define INF 2140000000
#define MOD 1000000007
#define MaxN 105
using namespace std;
int N,d[2][MaxN];
int main()
{
cin>>N;
for(int i=0;i<2;i++)
for(int j=1;j<=N;j++)
cin>>d[i][j];
for(int i=1;i<=N;i++)
{
d[0][i]+=d[0][i-1];
d[1][i]+=max(d[... | 148 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<m... | 1,929 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#ifndef errOut
#define errOut(s)
#endif
using Count = int;
using Candies = std::array<std::vector<Count>, 2>;
Count calc(Candies& candies, int n) {
Count ret = 0;
for (int downColumn = 0; downColumn < n; ++downColumn) {
Count cnt = 0;
int row = 0... | 266 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int MaxN = 1e5 + 15;
const int INF = 1e9;
const long double eps = 1e-9;
int dp[3][MaxN];
int a[3][MaxN];
int n;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("input.txt", "r", stdin);
cout.precision(9);
cin >> n;
... | 214 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[200][200];
int dp[200][200];
void dfs(int nowx,int nowy,int c) {
if (nowy >= 2) return;
if (nowx >= n) return;
if (dp[nowy][nowx] < c) dp[nowy][nowx] = c;
dfs(nowx,nowy+1,c+a[nowy+1][nowx]);
dfs(nowx+1,nowy,c+a[nowy][nowx+1]);
return;... | 219 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int dp[2][1000];
int main()
{
int i,j,n;
cin>>n;
int arr[2][1000];
for(i=0;i<2;i++)
{
for(j=0;j<n;j++)
{cin>>arr[i][j];}
}
dp[0][0]=arr[0][0];
for(i=1;i<n;i++)
dp[0][i]=dp[0][i-1]+arr[0][i];
dp[1][... | 210 |
Project_CodeNet | 2,018 | #include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<bitset>
#include<random>
#include<time.h>
#define INF 1000000000ll
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=... | 313 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cassert>
typedef long long lint;
const int N=105;
int n,dp[N];
namespace utils{
template <class T> inline void apn(T &x,const T y){x=x<y?x:y;}
template <class T> inline void apx(T &x,const T y){x=x>y?x:y;}
inline int nxi(){
int x=0;
char c;
wh... | 251 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int sumfront[105],sumbeh[105];
int n,a[105];
int main()
{
scanf("%d",&n);
for(int i = 1;i <= n; ++ i)
{
scanf("%d",&a[i]);
sumfront[i] = sumfront[i - 1] + a[i];
}
for(int i = 1;i <= n; ++ i)
scan... | 193 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<numeric>
#include<queue>
#include<string>
#include<vector>
#define ll long long
#include<cstring>
#define rep(i,n) for(int i=0;i<n;i++)
ll mod = 1000000007;
using namespace std;
priority_queue<ll int>QUE;//きゅー
int length(char* str) {
... | 408 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <cstring>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
namespace my
{
//-----------------------------------------------------------------------------
inline char cn()
{
static char buf[1000010],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,1000... | 944 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define ll long long
#define rep(i,b) for(ll i=0;i<b;i++)
using namespace std;
ll n,a,dp[2][101];
signed main() {
cin>>n;
rep(i,2){
rep(j,n){
cin>>a;
if(i+j==0)dp[0][0]=a;
if (i!=0) dp[i][j]=max(dp[i][j],dp[i-1][j]+a);
if (j!=0) dp... | 152 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
const int maxn = 2e2 + 10;
const int INF = 0x3f3f3f3f;
struct EDGE{ int v, w, nxt; }Edge[maxn * maxn];
int Head[maxn], cnt, id, N;
int ID[3][maxn];
int Weight[3][maxn];
inline void init()
{
memset(Head, -1, sizeof(Head));
cnt = id = 0;
}
inline void AddEdge(int ... | 631 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
int A[2][N];
for(int i=0; i<N; i++){
cin >> A[0][i];
}
for(int i=0; i<N; i++){
cin >> A[1][i];
}
int ans=0;
for(int i=0; i<N; i++){
int sum=0;
for(int j=0; j<=i; j++){
sum+=A[0][j];
}
for(int j=i; j<N;... | 165 |
Project_CodeNet | 2,020 | // unolight {{{
#include <bits/stdc++.h>
#include <unistd.h>
#define SZ(x) ((int)(x).size())
#define ALL(c) begin(c),end(c)
#define REP(i,n) for ( int i=0; i<(int)(n); i++ )
#define REP1(i,a,b) for ( int i=(int)(a); i<=(int)(b); i++ )
#define FOR(it,c) for ( auto it=(c).begin(); it!=(c).end(); it++ )
#define MP make_pa... | 677 |
Project_CodeNet | 2,018 | #pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#in... | 489 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int n,f[3][110],a[3][110];
int Read()
{
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
return f*x;
}
int main()
{
// freopen("candy.in","r",stdin);
// freopen("candy.out","w",st... | 244 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
cin >> N;
std::vector<std::vector<int> > A;
for(int i=0;i<2;i++){
std::vector<int> tmp;
for(int j=0; j<N; j++){
int tmpint;
cin >> tmpint;
tmp.push_back(tmpint);
}
A.push_back(tmp);
}
for(int ... | 279 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int N;
int A[2][101];
int memo[2][101];
int f(int r, int c) {
if (r == 1 && c == N-1) {
return A[r][c];
}
int& res = memo[r][c];
if (res != -1) return res;
res = A[r][c];
if (r == 0) {
int t = f(1, c);
if (c != N-1) {
t = max(t, f(0,... | 246 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
using namespace std;
//#define DEBUG_ //!!提出時... | 548 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
using namespace std;
int a[2][101], dp[2][101];
int main(){
int n;
cin >> n;
for(int i = 0; i < n; i++){
cin >> a[0][i];
}
for(int i = 0; i < n; i++){
cin >> a[1][i];
}
dp[0][0] = a[0][0];
for(int i = 1; i < n; i++){
dp[0]... | 228 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define INT long long int
#define MOD 1000000007
#define oo (INT)(6e18)
using namespace std;
INT n, a[3][110], dt[3][110];
INT dp(int x, int y)
{
if( x >= 2 or y >= n ) return -oo;
if( x == 1 and y == n-1 ) return a[x][n-1];
if( dt[x][y] ) return dt[x][y];
INT &ret = dt[x][y] = ... | 219 |
Project_CodeNet | 2,018 | #include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#include <... | 621 |
Project_CodeNet | 2,018 | /* !ya khoda! */
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pp push
#define po pop()
#define pb push_back
#define pf push_front
#define pob pop_back()
#define pof pop_front()
#define F first
#define S second
#define mkp make_pair
#define pll pair<ll,ll>
#define coutghat(x) ... | 404 |
Project_CodeNet | 2,020 | #include <iostream>
typedef long long ll;
int N;
ll A[2][101];
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
std::cin >> N;
for (int i = 0; i < N; ++i) {
std::cin >> A[0][i];
if (i) A[0][i] += A[0][i-1];
}
for (int i = 0; i < N; ++i)
std::cin... | 227 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int N;
int a[2][101];
int ma=0;
int main(){
cin >> N;
for(int i=0;i<2;i++)
for(int j=0;j<N;j++)cin >> a[i][j];
for(int i=0;i<N;i++){
int x=0,y=0;
int ans=0;
while(1){
ans+=a[y][x];
... | 165 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 1000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(),(x)... | 331 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <array>
#include <cstdint>
#include <climits>
#include <functional>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#define INF 1000000000
#de... | 367 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
const int MAXN = 123;
int dp[3][MAXN], candy[3][MAXN];
int main() {
int n; cin >> n;
for (int i = 1; i <= 2; i++) {
for (int j = 1; j <= n; j++) {
cin >> candy[i][j];
}
}
for (int i = 1; i <= 2; i++) {
for ... | 192 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define u... | 438 |
Project_CodeNet | 2,018 | #include<iostream>
#include<stdio.h>
using namespace std ;
int numOfCandies[2][102] ;
int path[2][102] ;
int main(){
//freopen("in.txt","r",stdin ) ;
int n ; scanf("%d",&n) ;
for(int i=0 ; i<2 ; i++){
for(int j=0 ; j<n ; j++){
scanf("%d",&numOfCandies[i][j]) ;
}
}
path[0][0]=numOfCandies[0][0] ;
path[1][0]=... | 239 |
Project_CodeNet | 2,018 | /// Kazuki Hoshino
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;
typedef vector<pi> vpi;
#define inf 1000000000
#define mod 1000000007
#define rep(i,a,b) for (int i = a; i <=... | 327 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n, d[3][110], x;
#define fo(i, n) for(int i = 1; i <= n; ++i)
int main()
{
cin >> n;
fo(i, 2) fo(j, n) {
cin >> x;
d[i][j] = max(d[i - 1][j], d[i][j - 1]) + x;
}
cout << d[2][n];
return 0;
} | 111 |
Project_CodeNet | 2,018 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using u32 = uint32_t;
using vi = vector<int>; using vvi = vector<vi>;
using vb = vector<bool>; using vvb = vector<vb>;
using vl = vector<ll>; using vvl = vector<vl>;
using vd = vector<do... | 430 |
Project_CodeNet | 2,020 |
#include <bits/stdc++.h>
class kin{
public:
inline void open(FILE *,int);
inline void close(void);
inline void scan(void);
inline kin &operator>(char &);
inline kin &operator>(int &);
inline kin &operator>(long long &);
inline kin &operator>(double &);
inline kin &operator>(long double &);
inline kin &operat... | 2,179 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < (n); ++i)
#define REP1(i,n) for(int i = 1; i <= (n); ++i)
#define RREP(i, n) for(int i = (n) - 1; i >= 0; --i)
#define ALL(a) begin(a), end(a)
#define MP(a,b) make_pair((a), (b))
#define ROUNDUP(a,b) ((a) / (b) + ((a) % (b) == 0 ? 0 : 1))
#define X first
#de... | 497 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <iterator>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(v) begin(v), end(v)
#define rreps(i, a, n) for (ll i = (a); i <= (ll)(n); ++i)
#define rrep(i, n) rreps... | 634 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
inline void Boost() {
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
}
typedef long long int ll;
typedef long double ld;
const int NMax = 1050;
int v[4][NMax];
int main() {
Boost();
int n;
cin >> n;
for(int i = 1; i <= 2; ++i) {
for(int j = 1; j <... | 195 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
#define MAXN 106
using namespace std;
int n,ans,a[MAXN],b[MAXN],sum1,sum2;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
for(int i=1;i<=n;i++)
{
scanf("%d",&b[i]);
sum2+=b[i];
}
sum1=a[1];
ans=a[1]+sum2;
for(int i=2;i<=n;i++)
{
sum2-=b[i-1];
... | 150 |
Project_CodeNet | 2,018 | #include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN = 105;
int N, pUp[MAXN], pDown[MAXN], Ans = 1;
int main() {
int i, k;
scanf("%d", &N);
for(i = 1; i <= N; i++) scanf("%d", &k), pUp[i] = pUp[i - 1] + k;
for(i = 1; i <= N; i++) scanf("%d", &k), pDown[i] = pDo... | 172 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(int i = int(l);i < int(r);i++)
template<typename T> bool chmax(T& a,const T& b){ return a < b ? (a = b,true) : false; }
template<typename T> bool chmin(T& a,const T& b){ return b < a ? (a = b,true) : false; }
typedef long long ll;
int N;
vector<int>... | 282 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define mk make_pair
#define pb push_back
#define sz(a) (int)(a).size()
#define rep(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define frep(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define fwr(x) { cout << x << '... | 507 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
using namespace std;
#define lli long long int
#define REP(i,n) for(int i=0;i<n;i++)
#define INV(a,n) REP(i,n){\
lli TMP;\
cin>>TMP;\
a.push_back(TMP);\
}
lli max(lli a,lli b){
return a>=b ? a:b;
}
int main(){
lli n;
vector<lli> a;
vector<lli> b;
cin>>n;
INV(a,n);
I... | 213 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll mod=1e9+7;
int main(){
int N;
cin>>N;
vector<vector<int>> a(2,vector<int>(N,0)),ruiseki(2,vector<int>(N+1,0));
for(int i=0;i<2;i++){
for(int j=0;j<N;j++){
cin>>a[i][j];
ruiseki[i][j+1]=ruiseki[i][... | 175 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pp;
int main() {
int N;
cin >> N;
vector<vector<int>> A(2, vector<int>(N));
for(int i=0; i<2; ++i) {
for(int j=0; j<N; ++j) cin >> A[i][j];
}
int ans = 0;
for(int i=0; i<N; ++i) {
int tmp = 0;
for(i... | 195 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<map>
#include<cmath>
using namespace std;
#define REP(i, limit) for(int i=0; i< limit; ++i)
#define FOR(i, j, limit) for(int i=j; i< limit; ++i)
#define DUMP(a) REP(d,a.size()){cout<<a[d];if(d!=a.size()-1)cout<<" ";else co... | 312 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int N=105;
int n,f[3][N];
int main()
{
cin>>n;
int i,j;
for(i=1;i<=2;i++)
for(j=1;j<=n;j++)
{
cin>>f[i][j];
f[i][j]+=max(f[i-1][j],f[i][j-1]);
}
cout<<f[2][n];
return 0;
}
| 102 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
const int MAXN = 110;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
for(; !isdigit(ch); ch = getchar()) if(ch=='-') f=-1;
for(; isdigit(ch); ch = getchar()) x = (x*10)+(ch^48);
return x * f;
}
int n, a[MAXN], b[MAXN];
int sa[MAXN], sb[MAXN], ans;
int ma... | 223 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef string str;
const long long INF = INT64_MAX / 2;
#define REP(i, n) for(ll i=0;i<n;i++)
#define ASC(v) sort((v).begin(), (v).end())
#define DESC(v) sort((v).rbegin(), (v).rend())
#define UNIQ(v) ASC(v);v.erase(unique(v.b... | 295 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
const ll MOD = 1e9+7;
const ll INF = 1e18+7;
signed main(){
int n;
cin >> n;
vector<vector<int>> a(2, vector<int>(n));
for(auto& x : a)
for(auto& y : x)
cin >> y;
for(int i = 1; i < n; ++i)
a[0][i] += a[0][i - 1];
for(int i = n - 2; i... | 194 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cmath>
int main() {
int n = 0,ans = 0,d = 0;
int kotae = 0;
int dokomade = 1;
int a[100][2] = {};
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> a[i][0];
}
for (int j = 0; j < n; j++) {
std::cin >> a[j][1];
}
for (int c = 0; c < n; c++) {
for (d = 0; d < dokomade; ... | 227 |
Project_CodeNet | 2,018 | //teja349
#include <bits/stdc++.h>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <iomanip>
//setbase - cout << setbase (16); cout << 100 << end... | 556 |
Project_CodeNet | 2,018 | #include<cstring>
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<queue>
#include<set>
#include<stack>
#include<map>
using namespace std;
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define rpe(i,r,l) for(int i=(r);i>=(l);--i)
#define rpp(i,x,e,head) for(int i=head[x];~i;i=e[i].next)
#... | 494 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n,a[100],b[100],r=0;
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++) cin>>b[i];
reverse(b,b+n);
for(int i=1;i<n;i++){
a[i]+=a[i-1];
b[i]+=b[i-1];
}
for(int i=0;i<n;i++) r=max(r,a[i]+b[n-i-1]);
cout<<r<<... | 136 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n) \
for(long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;
typ... | 347 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <ctime>
#include <vector>
#include <queue>
#include <bitset>
#include <cmath>
#include <time.h>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stdlib.h>
#include <deque>
#include <iomanip>
#... | 1,074 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
for (int i = 1; i <= n; i++) {
cin >> b[i];
b[i] += b[i - 1];
}
int ret... | 183 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
while(cin >> n)
{
int x=0;
int sum[110],sum2[110];
memset(sum,0,sizeof(sum));
memset(sum2,0,sizeof(sum2));
for(int i=1;i<=n;i++)
{
cin >> x;
sum[i]=sum[i-1]+x;
... | 188 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define N 1003
#define endl "\n"
#define trace1(x) cerr << #x << ": " << x << endl;
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y, z) cerr << #x << ": " << x << " | " << #y << ": " << y << " | " << #z <... | 487 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template... | 326 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main(){
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a1(n), a2(n);
for(ll i=0; i<n; i++) cin >> a1[i];
for(ll i=0; i<n; i++) cin >> a2[i];
for(ll i=1; i<n; i++) a1[i] += a1[i-1];
a2[0] += a1[0];
for(... | 177 |
Project_CodeNet | 2,019 | #include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
using namespace std;
#define REP(i,n) FOR(i,0,n)
#define FOR(i,a,b) for(long long i=(a),i##Len_=(b);i<i##Len_;i++)
typedef long long ll;
static const ll MOD = 1000000007;
//arc090
//いつのタイミングで、下に行くか
int main()
{
ll N;
cin ... | 325 |
Project_CodeNet | 2,018 | #include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>... | 1,075 |
Project_CodeNet | 2,018 | #include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <string>
#include <tuple>
#include <functional>
#include <map>
#include <cmath>
using namespace std;
int H, a[3][100000], dp[3][100000];
int main() {
cin >> H;
for (int i = 0; i < 2; i++) {
for (int j = 0; j < H; j++) cin >> a[i]... | 240 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define si(X) scanf("%d", &(X))
#define sll(X) scanf("%lld",&(X))
#define INFL 0x3f3f3f3f3f3f3f3fLL
const int mod = 1e9 + 7;
//-------------------------<MATH>-------------------------------------------------------//
ll gc... | 960 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <string>
#include <cstring>
#include <vector>
#include <numeric>
#define roop(i, n) for(int i=0;i<n;i++)
#define DIV 1000000007
using namespace std;
using ll = long long int;
using ull = unsign... | 633 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
using namespace std;
int N;
int main(){
cin>>N;
int A[2][N];
for(int i=0;i<2;i++){
for(int j=0;j<N;j++){
cin>>A[i][j];
}
}
int x[N];
for(int i=0;i<N;i++)x[i]=0;
fo... | 167 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.