Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
const int MAXN = 101;
int N;
int A[3][MAXN];
cin >> N;
for(int i = 1; i <= 2; ++i) {
for(int j = 1; j <= N; ++j) {
cin >> A[i][j];
}
}
int maxima = -1;
for(int i = 1; i <= N; ++i) {
... | 209 |
Project_CodeNet | 2,018 | #include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <map>
#include <vector>
#include <set>
#include <algorithm>
#include <sstream>
#include <queue>
#include <cctype>
#include <cmath>
#include <fstream>
using namespace std;
typedef long long ll;
#define REP(i,k) for(int (i)=0;(i)<(k... | 398 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
int A1[N];
int A2[N];
for (int i = 0; i < N; i++) {
cin >> A1[i];
}
for (int i = 0; i < N; i++) {
cin >> A2[i];
}
in... | 273 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1010;
int n , a[2][N];
int main(){
scanf("%d",&n);
for(int i=0;i<2;i++)
for(int j=0;j<n;j++)
scanf("%d",&a[i][j]);
for(int i=1;i<=n;i++)a[0][i]+=a[0][i-1];
for(int i=n-2;i>=0;i--)a[1][i]+=a[1][i+1];
int ans=0;
for(int i=0... | 163 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(void){
int N;
cin >> N;
vector<vector<int>> A(2, vector<int>(N));
for(int i = 0; i < N; i++){
cin >> A[0][i];
}
for(int i = 0; i < N; i++){
cin >> A[1][i];
}
A[1][0] += A[0][0];
for(int i = 1; i < N; i++){
A[0][i] += A[0][i - 1];
... | 179 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int const N = 2000 + 4;
int a[N][N];
char g[N][N];
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n;
cin >> n;
vector<int> a[2];
a[0].resize(n);
a[1].resize(n);
for(int i = 0; i < n; ++i)
cin >> a[0][i];
for(int i = ... | 235 |
Project_CodeNet | 2,018 | #include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<limits>
#include<sstream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const int inf = numeric_limits<int>... | 944 |
Project_CodeNet | 2,018 | #include <iostream>
#include<cstdlib>
#include<queue>
#include<set>
#include<vector>
#include<string>
#include<algorithm>
#include<sstream>
#include<cmath>
#include<stack>
#include<map>
#include<cstdio>
using namespace std;
#define rep(i,a) for(int i=0;i<a;i++)
#define mp make_pair
#define pb push_back
#define P pair<i... | 257 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
#define MAX_N 51
using namespace std;
int main(){
int n;
int c[1000],c2[1000],up[1000],btm[1000];
int sum;
sum = 0;
cin>>n;
for(int i = 0;i<n; i++){
cin>>c[i];
if(i == 0){
up[i] = c[i];
}else{
up[i] = ... | 265 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do { cout << "\033[32;1m " << #x << " -> "; err(x); } while (0)
void err() { cout << "\033[39;0m" << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cout << v << ' ';... | 443 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define VARNAME(x) #x
#define show(x) cerr << #x << " = " << x << endl
using namespace std;
using ll = long long;
using ld = long double;
template <typename T>
vector<T> Vec(int n, T v)
{
return vector<T>(n, v);
}
template <class... Args>
auto Vec(int n, Args... args)
{
auto val = Vec... | 469 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
int a[2][2000];
int dp[2][2000];
signed main(){
int n;scanf("%d",&n);
rep(i,2)rep(j,n)sc... | 227 |
Project_CodeNet | 2,018 | // ARC090
// C - Candies
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
const int MAX_N = 100;
int N;
int a[3][MAX_N + 1];
int dp[3][MAX_N + 1];
int main() {
cin >> N;
memset(a, 0, sizeof(a));
for (int i = 1; i <= 2; i++) {... | 236 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define int long long
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e18;
signed main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<vecto... | 226 |
Project_CodeNet | 2,018 | /// Author : Nhat Huy
/*
∧＿＿∧
(。・ω・)つー☆・ * 。
⊂ ノ . ゜
し————Ｊ Accepted
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define REP(i,n) for (int i = 0; i < n; ++ i)
#define FOR(i,a,b) for (int i = a; i <= b; ++ i)
#define F... | 516 |
Project_CodeNet | 2,018 | /*===============================================================
* Filename：C.cpp
* Author：zhuyutian
* Date：2018年01月28日
================================================================*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 100005;
in... | 196 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int dp[2][101],n;
int main ()
{
ios::sync_with_stdio(false);
cin>>n;
for(int i=1;i<=n;++i)
cin>>dp[0][i];
for(int i=1;i<=n;++i)
cin>>dp[1][i];
for(int i=1;i<=n;++i)
dp[0][i]=dp[0][i]+dp[0][i-1];
for(int i=1;i<=n;++i)
dp[1][i... | 165 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
#include<set>
#include<algorithm>
#define int long long int
int Xor(int left,int right)
{
if(right<left)
return 0;
if(right-left>=10)
{
int answer=0;
int i=left;
int j=right;
while(1)
{
if(i%4==0)
break;
answer=answer^i;
i++;
}
while(1)
{
... | 370 |
Project_CodeNet | 2,020 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 1,020 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int N;
int A[3][101];
int dp[3][101];
int main()
{
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++)
{
dp[i][j] = max(dp[i - ... | 165 |
Project_CodeNet | 2,018 | //C++14 (Clang 3.8.0)
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#includ... | 268 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
using namespace std;
int main(void)
{
int n;
int a[2][100];
int dp[2][100];
cin>>n;
for(int i=0;i<2;i++)
for(int j=0;j<n;j++)
cin>>a[i][j];
dp[0][0]=a[0][0];
dp[1][0]=a[1][0]+a[0][0];
for(int i=1;i<n;i++)
dp[0][i]=dp[0][i-1]+a[0][i];
for(i... | 218 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZER... | 322 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define pb push_back
#define mp make_pair
#define f(i,a,n) for(int i=a ; i<(int)n ; i++)
#define rf(i,n,a) for(int i=n ; i>=a ; i--)
#define F first
#define S second
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size(... | 349 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int a[200][200],n=2,m,f[200][200];
int main()
{
cin>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)cin>>a[i][j];
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)f[i][j]=max(f[i-1][j],f[i][j-1])+a[i][j];
cout<<f[n][m]<<endl;
return 0;
}
| 120 |
Project_CodeNet | 2,019 |
#include <iostream>
#include <algorithm>
#include<vector>
#include <queue>
#include "math.h"
#include <string>
using namespace std;
int h[105][3];
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> h[i][1];
}
for (int i = 1; i <= n; i++) {
cin >> h[i][2];
}
for (int i = 1; i <= n; i++) {
... | 222 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
using std::max;
const int MAXN=105;
int a[3][MAXN],suf[3][MAXN];
int main(){
int n;
scanf("%d",&n);
for(int i=1;i<=n;++i)
scanf("%d",&a[1][i]);
for(int i=1;i<=n;++i)
scanf("%d",&a[2][i]);
for(int i=n;i;--i){
suf[1][i]=suf[1][i+1]+a[1][i];
suf[2][i]=suf[2][i+1]+a[2]... | 288 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int Nmax = 102;
int n, a[3][Nmax], dp[3][Nmax];
int32_t main() {
//ifstream cin("a.in");
cin >> n;
for(int i = 1; i <= 2; ++i)
for(int j = 1; j <= n; ++j) cin >> a[i][j];
dp[1][1] = a[1][1];
for(int i = 1; i <= 2; ++i) {
for(int j = 1; j <= ... | 184 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int dp[5][105];
int n;
int main()
{
cin>>n;
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
cin>>dp[i][j];
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
dp[i][j]=max(dp[i-1][j],dp[i][... | 134 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a... | 764 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define F first
#define S second
int const M=2e5+10,inf=1e9+10,mod=1e9+7,M2=1e6+10,M3=3e3+10;
int a[M],b[M],ps[M];
main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i];
for(int i... | 196 |
Project_CodeNet | 2,020 |
// Problem : C - Candies
// Contest : AtCoder Regular Contest 090
// URL : https://atcoder.jp/contests/arc090/tasks/arc090_a
// Memory Limit : 256 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define size(... | 309 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
using namespace std;
int n,m;
int a[5][233],d[5][233];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[1][i]);
for(int i=1;i<=n;i++)
scanf("%d",&a[2][i]);
for(int i=1;i<=n;i++)
{
d[1]... | 174 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#include<set>
#include<complex>
#include<string>
#include<cstring>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
#define INF 100000000
#de... | 294 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
using namespace std;
#define debug(x) std::cerr << #x << " = " << (x) << std::endl
typedef long long LL;
const int MAXN = 1e2+17;
int a[MAXN],b[MAXN],l[MAXN],r[MAXN];
int main(int argc ,char const *argv[])
{
#ifdef GoodbyeMonkeyKing
freopen("Input.txt","r",stdin);freopen("... | 324 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
using namespace std;
int n,m,f[1000][1000];
int main(){
scanf("%d",&m); n=2;
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j){
int x; scanf("%d",&x);
f[i][j]=max(f[i-1][j],f[i][j-1])+x;
}
printf("%d",f[n][m]);
} | 104 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define LL long long
#define Accel ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define Re(a,b) memset(a,b,sizeof a)
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define ALL(X) (X).begin(), (X).end()
#define FOR(I, A, B) for (int I = (A); I <= (B); I++)
#defin... | 520 |
Project_CodeNet | 2,018 | #include<iostream>
#include<set>
#include <bitset>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include <cstdio>
#include<algorithm>
#include <sstream>
#include<string>
#include<string.h>
#include <cmath>
#include <iomanip>
#include <string>
#include<list>
#include <limits>
#include <numeric>
#includ... | 327 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <queue>
#include <stack>
#include <list>
#include <functional>
#include <numeric>
#include <iostream>
using namespace std;
typedef long long ll;
#defin... | 323 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include <map>
using namespace std;
typedef long long ll;
const int maxn = 105;
int t[maxn][maxn],a[maxn][maxn];
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=2;i++)
{
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j... | 263 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct Edge{
ll to, weight;
Edge(ll t, ll w) : to(t), weight(w){}
};
using graph = vector<vector... | 440 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
using namespace std;
const int N = 1005;
int gi()
{
int x=0,w=1;char ch=getchar();
while ((ch<'0'||ch>'9')&&ch!='-') ch=getchar();
if (ch=='-') w=0,ch=getchar();
while (ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
return w?x:-x;
}
int n,dp[5][N],a[5][N];
int main()
{
... | 221 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
int a[2][n];
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
for (int i = 1; i < n; i++) {
a... | 199 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstring>
#define LL long long
using namespace std;
const int N=105;
int n;
int f[3][N];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i) scanf("%d",&f[1][i]);
for(int i=1;i<=n;++i) scanf("%d",&f[2][i]);
for(int i=1;i<=2;++i)
for(int j=1;j<=n;... | 148 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
//#include <math.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(... | 346 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
const int maxn=110;
void chkmax(int &x,int y){
x=x>y?x:y;
}
int a[maxn][maxn];
int dp[maxn][maxn];
int main(){
// freopen("A.in","r",stdin);
int n;
scanf("%d",&n);
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
for(int i=1;i<=2;i++){
for(int j=... | 186 |
Project_CodeNet | 2,018 | #include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
#define N 103
using namespace std;
int dp(int ,int );
int tmp [2][N];
int ans [2][N];
int n;
int main ()
{
while (scanf ("%d",&n)!=EOF)
{
for (int i=0;i<n;i++) scanf ("%d",&tmp[0][i]);
for (int i=0;i<n;i++) scanf ("%d... | 283 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
vector<int> a(N+1, 0), b(N+1, 0);
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 ans = 0;
for ... | 165 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll,ll> P;
#define Mod 1000000007
using VP = vector<P>; using VVP = vector<VP>;
using VI = vector<ll>; using VVI = vector<VI>; using VVVI = vector<VVI>;
int main(){
ll i,j;
ll ... | 244 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=110;
int a[5][maxn];
int dp[5][maxn];
int main()
{
int n;
cin>>n;
memset(dp,0,sizeof(dp));
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
cin>>a[i][j];
for(int... | 158 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> A(2+1, vector<int>(N+1));
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++) A[i][j] += A[i][j - 1];
int ans = 0;
for (int i = 1... | 188 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <vector>
#include <array>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <random>
#include <bitset>
... | 539 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
using namespace std;
const int N = 1e2;
int a[2][N+2];
int f[2][N+2];
int n;
int main()
{
scanf("%d",&n);
for(int i=1; i<=n; i++) scanf("%d",&a[0][i]);
for(int i=1; i<=n; i++) scanf("%d",&a[1][i]);
f[0][1] = a[0][1]; f[1][1] = a[0][1]+a[1][1];
for(int i=2; i<=n; i++)
{
f[0... | 210 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <map>
#include <cstdio>
#include <cstring>
#include <math.h>
#include <bitset>
#include <time.h>
#include <set>
#include <algorithm>
#define MODD 1000000007
#define ll long long
#define Inf 1000000000
using namespace std;
int H,W;
int A[2][111];
int main() {
int N;
... | 207 |
Project_CodeNet | 2,018 |
#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/stack:16777216")
#include <string>
#include <vector>
#include <map>
#include <list>
#include <iterator>
#include <cassert>
#include <set>
#include <queue>
#include <iostream>
#include <sstream>
#include <stack>
#include <deque>
#include <cmath>
#include <memor... | 551 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll mod=1000000007;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int N;
int A[2][100];
cin>>N;
int A1[100];
int A2[1... | 229 |
Project_CodeNet | 2,018 | #define _USE_MATH_DEFINES
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <co... | 501 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define F first
#define S second
#define endl '\n'
#define MP make_pair
#define pb push_back
#define SIZE 100005
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> i_P;
typedef long long LL;
static const int INF = INT_MAX;
static const int MIN = INT_MIN;
static const LL L_INF... | 370 |
Project_CodeNet | 2,018 | #include <iostream>
#include<vector>
#include<cmath>
using namespace std;
int N;
int A[3][1000];
int main(){
cin>>N;
vector<vector<int > > dp(3,vector<int>(N+10,0));
for(int i=1;i<=2;i++){
for(int j=1;j<=N;j++){
cin>>A[i][j];
dp[i][j]=A[i][j];
}
}
for... | 176 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int n,s[100],t[100],sum;
int main(void){
cin>>n;
for(int i=0;i<n;i++){
cin>>s[i];
}
for(int i=0;i<n;i++){
cin>>t[i];
sum+=t[i];
}
int MAX=sum+s[0],M=MAX;
for(int i=1;i<n;i++){
M+=s[i]-t[i-1];
MAX=max(MAX,M);
... | 120 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
#define FOR(x,val,to) for(int x=(val);x<int((to));++x)
#define FORE(x,val,to) for(auto x=(val);x<=(to);++x)
#define FORR(x,arr) for(auto &x: arr... | 1,058 |
Project_CodeNet | 2,020 | //Dragon_warrior7(IITK)
#pragma GCC optimize ("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("-ffloat-store")
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace... | 595 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <bitset>
#define ll long long
#define pb push_back
#define f first
#define s second
#define mod 10000000007
#define hurry ios::sync_with_stdio(false)
#define PI 3.141592654
#define xx (ll) 100+3
using namespace std;
int N,dp[3][xx];
string s;
int main()
{
hurry;
cin>>N;
... | 199 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio> //scanf,printf
#include <algorithm> //max,min
#include <string> //string
#include <cstring> //strlen,s... | 388 |
Project_CodeNet | 2,018 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
using ll = long long;
ll a[2][500] = {};
for(int i = 0; i < 2; ++i){
for(int j = 0; j < n; ++j){
cin >> a[i][j];
}
}
ll best = 0;
for(int poz = 0; poz < n; ++poz){
best = max(best, accumulate(a[0], a[0] + poz + 1, 0ll) + accumulate(a[1]+poz... | 153 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
int main()
{
int n;
int a[5][110], dp[5][110] = { 0 };
std::cin >> n;
for (int i = 0; i < 2; ++i)
{
for (int j = 0; j < n; ++j)
{
std::cin >> a[i][j];
}
}
dp[0][0] = a[0][0];
dp[1][0] = a[1][0] + a[0][0];
for (int j = 1; j < n; ++j)
{
dp[0][j] = dp[... | 219 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int main()
{
int N;
... | 259 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define rep(i,n,m) for(int i = (n); i <(m); i++)
#define rrep(i,n,m) for(int i = (n) - 1; i >=(m); i--)
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
int a[2][n];
rep(i, 0, n) cin >> a[0][i];
rep(i, 0, n) cin >> a[1][i];
rep(i, 1, n) a[0][... | 217 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include <map>
using namespace std;
typedef long long ll;
const int maxn = 105;
int t[maxn][maxn],a[maxn][maxn];
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=2;i++)
{
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j... | 263 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <map> // STL
#include <string>
#include <vector>
#include <queue>
#include <stack>
#define mpr make_pair
#define debug() puts("okkkkkkkk")
using namespace std;
typedef long long LL;
const int inf = 1 << 26;
// dp[1][1]=a[1][1]; ... | 300 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstring>
#include<cmath>
#define MAX 105
#define max(a,b) ((a) > (b) ? (a) : (b))
using namespace std;
int Cand[5][MAX],DP[5][MAX];
int main( )
{
int n;
memset(DP,0,sizeof(DP));
cin >> n;
for(int j = 1; j <= 2; j++)
for(int i = 1; i <= n; i++)
cin >> Cand[j][i];
for(int i = 1; i <... | 194 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include<algorithm>//next_permutation
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define repa(i,a,n) for(int i=(a);i<(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rrepa(i,a,n) for(int i=n-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
#define MOD 1000000007
... | 442 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <algorithm>
using namespace std;
int main() {
int a[2][100];
int n;
scanf("%d", &n);
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++) {
scanf("%d", &a[i][j]);
}
}
for (int i = 1; i < n; i++) {
a[0][i] += a[0][i - 1];
a[1][n - i - 1] += a[1][n - ... | 198 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n,maxn;
int wei[3][3]={{0,0,0},{0,1,0},{0,0,1}};
int a[3][101];
bool bol[3][101];
bool ok(int c,int d){
if(c>0&&c<=2&&d>0&&d<=n)
return true;
else
return false;
}
void dfs(int x,int y,int sum){
if(x==2&&y==n){
maxn=max(maxn,sum);
}
else{
for(int i=1;i<=2;... | 278 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
typedef vector<lld> vi;
typedef pair<lld,lld> pi;
#define F first
#define S second
#define PB push_back
#define MOD 100000000007
#define MP make_pair
#define rep(i,a,b) for (lld i = a; i < b; i++)
lld l,x,y,n,m,i,z,p,s,e,j,k,c,d,t,h,q;
int main()
... | 265 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define up(i,j,n) for (int i = j; i <= n; i++)
#define down(i,j,n) for (int i = j; i >= n; i--)
#define cadd(a,b) a = add (a, b)
#define cpop(a,b) a = pop (a, b)
#define cmul(a,b) a = mul (a, b)
#define pr pair<int, int>
#... | 374 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define re return
#define pb push_back
#define po pop_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define sqrt(x) sqrt(abs(x))
#define mp make_pair
#define pi 3.14159265359
#define fo(i, n) for(int i = 0; i < n; ++i)
#define ro(i, n) for(i... | 337 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#ifdef DEMETRIO
#define deb(...) fprintf(stderr,__VA_ARGS__)
#define deb1(x) cerr << #x << " = " << x << endl
#else
#define deb(...) 0
#define deb1(x) 0
#endif
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define fore(i,a,b) for(int i=a,ThxDem=b;i<ThxDem;++i)
#... | 227 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int dp[4][10000];
int main()
{
int n;
cin>>n;
int i,a[2][n],j;
for(i=0;i<2;i++)
{
for(j=0;j<n;j++)
cin>>a[i][j];
}
for(i=0;i<n;i++)
{
dp[0][i]=-1;
dp[0][i]=-1;
}
dp[0][0]=a[0][0];
dp[1][0]=a[0][... | 243 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define rep(i, x, y) for(int i = x; i <= y; i ++)
#define rrep(i, x, y) for(int i = x; i >= y; i --)
#define ll long long
#define X first
#define Y second
#define pb push_back
#define mp make_pair
#define pii pair<ll, ll>
#define ls rt << 1
#define rs rt << 1 | 1
#define sz(x) (int)(x).size()
#... | 326 |
Project_CodeNet | 2,020 | #include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
const int N=205;
int n;
int a[N][N],dp[N][N];
int main() {
scanf("%d",&n);
for (int i=1;i<=2;++i) {
for (int j=1;j<=n;++j) scanf("%d",&a[i][j]);
}
for (int i=1;i<=2;++i) {
for (int j=1;j<=n;++j) {
dp[i][j]=max(dp[i-1][... | 163 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define r(i,n) for(long long i = 0; i<n; i++)
typedef long long ll;
using namespace std;
int main() {
int n,count,ans=0;
cin >> n;
vector<int> a(n,0),b(n,0);
r(i,n)cin >> a[i];
r(i,n)cin >> b[i];
r(i,n){
count=accumulate(a.begin(),a.begin()+1+i,0)+accumulate(b.begin()+i,b.end()... | 132 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define LL long long
using namespace std;
int a[2][200];
int main()
{
int n;
scanf("%d", &n);
for(int j = 0; j < 2; j ++)
for(int i = 0; i < n; i ++)
scanf("%d", &a[j][i]);
int ans = 0;
for(int k = 0; k < n; k ++) {
int sum = 0;
for(int... | 177 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 105;
int n;
int a[MAXN], b[MAXN];
int main()
{
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i-1];
}
for (int j = 1; j <= n; j++) cin >> b[j];
for (int j = n; j >= 1; j--) b[j] += b[j+1];
int ans = 0;
for (int i = 1; i <= n; ... | 155 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int a,b[110],c[110],ans =0;
cin >> a;
for (int i = 0; i < a; ++i) cin >> b[i];
for(int i=0;i<a;i++) cin >> c[i];
for(int i=0;i<a;i++){
int ant =0;
for(int k =0;k<=i;k++){
ant += b[k];
}
for(int j=i;j<a;j++)... | 151 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
template<class T, class U>
ostream& operator<<(ostream& os, pair<T, U> p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template<template<class, class...> class C, class... A>
typename enable_if<!is_same<C<A...>, string>::value, ostream&>... | 426 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int dp[2][100];
int A[2][100];
int main() {
int N;
cin >> N;
for (int i = 0; i < 2; i++) for (int j = 0; j < N; j++) cin >> A[i][j];
dp[0][0] = A[0][0];
for (int i = 0; i < 2; i++) {
for (int j = 0; j < N; j++) {
if (... | 236 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli>> mat;
typedef vector<unordered_map<lli,lli>> graph;
lli n;
vll a,b;
lli ans = 0;
int main(){
cin >> n;
a = vll(n+1);
b = vll(n+1);
for(lli i = 0;i < n;i++) cin >... | 227 |
Project_CodeNet | 2,018 | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
const int inf=1e9,dx[]={-1,0,1,0},dy[]={0,-1,0,1};
int n,a[3][105],ans,x,y;
int main(){
cin>>n;
for(int i=1;i<=2... | 208 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
int n;
int a[105];
int b[105];
int main(){
cin >> n;
for(int i = 0; i < n; i++)
cin >> a[i];
for(int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
int tmp = 0;
for(int i = 0; i < n; i++){
tmp += a[i];
int cur = tmp;
for(int j = i; j < n; ... | 149 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
//const int INF = 1e8;
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n),b(n);
rep(i... | 208 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
using namespace std;
int a1[101];
int a2[101];
int b1[101];
int b2[101];
int main() {
size_t n;
cin >> n;
for (size_t i = 0; i < n; ++i) {
int a;
cin >> a;
a1[i] = a;
}
for (size_t i = 0; i < n; ++i) {
int a;
cin >> a;
a2[i] = a;
}
... | 238 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <map>
#include <string>
#include <tuple>
#include <cmath>
#include <cstring>
using namespace std;
typedef long long ll;
int N;
int Aorig[2][101];
int A[2][101];
int solve(int a) {
int count = 0;
for (int j = 0; j <= a; j ... | 271 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define pb push_back
#define rep(i, n) for(int i = 0; i < (n); i++)
#define dep(i, a, n) for(int i = a; i >= (n); i--)
#define FOR(i, a, n) for(int i = a; i < (n); i++)
#define mod (ll)(1e9+7)
#define int ll
#define INF 100000... | 261 |
Project_CodeNet | 2,019 | // だーれだ？
//qqqqqqHHMqqqqqHf!(:;jHmmkf``(:;jkqqqqqqqqqmMH#HMqqK_````````````````(kqqqqqqHMMM
//qqqqqqHHmqqqqH=` :;;jkqH=?~..;;jqqqqqqqqqmM#HM#MHH!```` ```````..-``dqWbWkRqHMMM
//qqqqqqMHmqqqK!``.;;;dqH: ```.?TUqqHmqqqqmHHHM4Mqkt..```` ..JgHHW@P`.HHkqHHHqM#NN
//qqqqqmHMmqHTYWHgHmmgHR...``` :;Jkq9qqqqqgMH#1dHk$...-gW@HY"=... | 1,759 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd... | 327 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define re return
#define pb push_back
#define po pop_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define ss second.second
#define sf second.first
#define ff first.first
#define fs first.second
#define si size
#define sqrt(x) sqrt(abs(x))
#define mp make_pair
#... | 429 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define maxn 110
using namespace std;
long long a[maxn],b[maxn];
int main()
{
cin.tie(0);ios_base::sync_with_stdio(false);
int n;
long long mx=0;
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i];
for(int i=1;i<=n;i++)cin>>b[i];
for(int i=1;i<=n;i++)a[i]+=a[i-1];
for(int i=n... | 159 |
Project_CodeNet | 2,018 | #include<cstdio>
int main(){
int n;
scanf("%d",&n);
int a[n],b[n];
int c[n]={};
int d[n]={};
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
if(i==0)c[0]=a[0];
else c[i]=c[i-1]+a[i];
}
for(int i=0;i<n;i++){
scanf("%d",&b[i]);
if(i==0)d[0]=b[0];
else d[i]=d[i-1]+b[i];
}
int ans=c[0]+d[n-1];
int x;
for(i... | 185 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main(){
int N;
int A[2][100];
cin>>N;
for(int i=0;i<N;i++)cin>>A[0][i];
for(int i=0;i<N;i++)cin>>A[1][i];
int max=-1;
for(int i=0;i<N;i++){
int sum=0;
for(int j=0;j<=i;j++){
sum+=A[0][j];
}
for(int j... | 160 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.