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 <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;
long long MOD = 1000000007;
int main() {
int N;
... | 285 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
//#define FILE_IO
int N;
int sum[5][1005];
int main()
{
#ifdef FILE_IO
freopen("1.in", "r", stdin);
freopen("1.out", "w", stdout);
#endif
scanf("%d", &N);
for(int j = 1; j <= 2; j++)
for(int i = 1; i <= N; i++)
{
int ... | 198 |
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 <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
int ar[2][n];
int sum1[n];
int sum2[n];
int sum[n];
for (int i = 0; i < 2; i++)
{
for (int j = 0; j < n; j++)
{
cin >> ar[i][j];
}
}
sum1[0] = ar[0][0]... | 261 |
Project_CodeNet | 2,018 |
#include <iostream>
#include <algorithm>
#include <string.h>
#include <math.h>
#include <vector>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unsigned ll
#define db double
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define PII pair<int, int>
const int N=110;
int... | 268 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <ctime>
#include <algorithm>
#include <vector>
#include <cstring>
#include <stack>
#include <queue>
#include <utility>
#include <cmath>
#include <functional>
#include <map>
#include <set>
const int INF = 1000000009;
int n;
int a[2][100... | 262 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A = {0}, B = {0};
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A.push_back(A.back() + a);
}
for (int i = 0; i < N; i++) {
int a;
cin >> a;
B.push_back(B.back() + a);
}
int maxim = 0;
fo... | 171 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int N, a[2][109], dp[2][109];
int main ()
{
//freopen ("input", "r", stdin);
//freopen ("output", "w", stdout);
scanf ("%d", &N);
for (int i=1; i<=2; i++)
for (int j=1; j<=N; j++)
scanf ("%d", &a[i][j]);
dp[1][1] = a[1][1], dp[2][1] = a[1][1] + a[2][1];
for (... | 232 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define ALL(x) x.begin(),x.end()
#define EPS (1e-8)
#define equals(a,b) (fabs((a)-(b))<EPS)
using namespace std;
typedef long long ll;
bool LTE(double a,double b) { return equals(a,b) || a < b; }
bool LT(double a,double b) { ... | 267 |
Project_CodeNet | 2,018 |
// vim: set fdm=marker:
// {{{
#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <utility>
using namespace std ;
typedef long ... | 267 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int a[3][105];
int main()
{
int n;
scanf("%d",&n);
int i,j;
for(i=1;i<=2;i++)
for(j=1;j<=n;j++){
scanf("%d",&a[i][j]);
a[i][j] += max(a[i-1][j],a[i][j-1]);
}
printf("%d\n",a[2][n]);
} | 105 |
Project_CodeNet | 2,018 | /*
* Created by KeigoOgawa
*/
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <cassert>
#include <cmath>
#define INF (int)1e8
#define EPS 1e-10
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define RFOR(i, a, b) for (ll i = (b)-1; i >= (a); i... | 673 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define pb push_back
using namespace std;
int tab[101][3];
int a[102];
int b[102];
int main(){
int n;
cin >> n;
for ( int i = 1 ; i <= n ; i++){
cin >> tab[i][1];
a[i]=a[i-1]+tab[i][1];
}
for ( int i = 1 ; i <= n ; i++){
cin >> tab[i][2];
}
f... | 198 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
/*
#include<iostream>
#include<vector>
#include<string>
#include<array>
#include<cmath>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<numeric>
#include<iomanip>
#include<utility>
#include<cstdlib>
#include<typeinfo>
#include<stack>
#include<cassert>
#include<functional... | 711 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
const int M = 110;
int a[2][M], dp[2][M];
int main() {
int n; scanf("%d", &n);
for(int i = 0; i < 2; i ++)
for(int j = 0; j < n; j ++)
scanf("%d", &a[i][j]);
dp[0][0] = a[0][0];
for(int i = 0; i < 2; i ++) {
for(int j = 0; j < n; j ++) {
if(i) dp[i][j] = std::max(dp[i][j], dp[... | 206 |
Project_CodeNet | 2,019 | //#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma warning(disable:4786)
#pragma warning(disable:4996)
#include <ctime>
#include<list>
#include <numeric>
#include<bitset>
#include<iostream>
#include<cstdio>
#in... | 1,114 |
Project_CodeNet | 2,020 | // I look at my watch
// it say nine twenty-five
// And I think oh God
// I'm still alive
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(x) int((x).size())
#define all(v) (v).begin(),(v).end()
#define trace(x) cerr << #x << " = " << x << endl
#define f... | 287 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define per(i,a,b) for(int i=a;i>b;i--)
#define repLL(i,a,b) for(LL i=(LL)a;i<(LL)b;i++)
#define perLL(i,a,b) for(LL i=(LL)a;i>(LL)b;i--)
#define debug5(a,b,c,d,e) cerr<<#a<<": "<<a<<" "<<#b<<": "<<b<<" "<<#c<<": "<<c<<" "<<#d<<": "<<d<<" "<<#e<<": "<<e<<e... | 703 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int mat[5][200];
int res[5][200];
int main() {
int N;
scanf("%d", &N);
for (int i = 1; i <= 2; ++i) {
for (int j = 1; j <= N; ++j) {
cin >> mat[i][j];
}
}
for (int i = N; i >= 1; --i) {
res[2][i] = res[2][i + 1] + mat[2][i];
... | 205 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define bug(x) cout<<(#x)<<" "<<(x)<<endl
#define ll long long
/*
char *TT,*mo,but[(1<<15)+2];
#define getchar() ((TT==mo&&(mo=(TT=but)+fread(but,1,1<<15,stdin),TT==mo))?-1:*TT++)//*/
using namespace std;
const int N=1e5+5;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'... | 259 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 100005
int a[2][N];
int32_t 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];
}
for(int i=1;i<n;i++)
{
a[0][i]+=a[0][i-1];... | 204 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <unistd.h>
#include <cctype>
#include <stdlib.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#define SIZE 300005
#define MOD 1000000007LL
#define EPS 1e-10
#define INF 1 << 30
#define LLINF LLONG_MAX/3
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int... | 565 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair... | 320 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<climits>
#define REP(i,m,n) for(int i = m; i < n; i++)
#define rep(i,n) REP(i,0,n)
template<class T> void chmax(T & a, T b) { if (a < b) { a = b; } }
template<class T> void chmin(T& a, T b) { if (a > b) { a = b; } }
usin... | 283 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <numeric>
#include <iostream>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define ... | 279 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#ifdef _WIN32
#include "debug.hpp"
#endif
using namespace std;
#define rep(i, N) for(int i = 0; i < (N); i++)
#define reps(i, N) for(int i = 1; i <= (N); i++)
#define repr(i, N) for(int i = (N) - 1; i >= 0; i--)
#define pub push_back
template<typename T>
void chmax(T &a, T b){ a = max(a, b)... | 474 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n;
int a[2][101];
int dp[3][101];
int main(void){
scanf("%d",&n);
for(int i=0;i<2;i++){
for(int j=0;j<n;j++){
scanf("%d",&a[i][j]);
}
}
dp[0][0]=a[0][0];
for(int i=0;i<2;i++){
for(in... | 205 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e3+5;
int n,a[3][N],f[3][N];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
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++... | 171 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ?... | 390 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define next Next
#define int long long
const int N=1005;
int n,a[3][N],f[3][N];
/*char buf[1<<21],*p1=buf,*p2=buf;
inline int gc(){return p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++;}*/
#define gc getchar
inline int read()
{
int ret=0,f=0;char c=gc();
... | 290 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define MAX 1000005
#define ll long long
#define upperlimit 1000100
#define INF 1e18
#define eps 1e-8
#define endl '\n'
#define pcc pair<char,char>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define tr(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();i... | 466 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const double EPS = 1e-10;
const ll INF = 100000000;
const ll MOD = 1000000007;
int n;
int a[2][100];
int main(){
cin >> n;
rep(i,2) rep(j,n) cin >> a[i][j];
for (int i = ... | 250 |
Project_CodeNet | 2,020 | // ===========================================
// 20.02.26 atcoder 第6回 ドワンゴからの挑戦状 予選. A - Falling Asleep
//
//
// ===========================================
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define ET "\n"
#define CLR(arr) memset(arr, 0, sizeof(arr... | 443 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <sstream>
#include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;++i)
#define per(i,a,n) for(int i=n-1;i>=a;--i);
#define ms(x,a... | 356 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>
#include <iomanip>
#include <bitset>
#include <list>
#include <stack>
#include <deq... | 317 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
inline int read()
{
int x=0;char ch=getchar();
while(ch<'0' || '9'<ch)ch=getchar();
while('0'<=ch && ch<='9')x=x*10+(ch^48),ch=getchar();
return x;
}
const int N=109;
int n,g[2][N],f[2][N];
int main()
{
if(fopen("vj.in","r"))
{
freopen("vj.in","r",stdin);
freop... | 282 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) a.begin(), a.end()
#define MS(m,v) memset(m,v,sizeof(m))
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,... | 478 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = (int)(n); i >= 0; i--)
#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef unsigned long long ll;
int N, n;
int main(){
cin >> N;
vect... | 221 |
Project_CodeNet | 2,018 | #pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pii;
template<typename T>
using pq_gt = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using pq_lt = priority_queue<T, v... | 268 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair < int , int > Pi;
typedef pair < ll , ll > Pl;
const int INF = (1 << 30) - 1;
const ll LLINF = 1LL << 60;
int main()
{
int N;
int A[105], B[105];
cin >> N;
for(int i = 0; i < N; i++) cin >> A[i];
for(int i = 0; i < N... | 226 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int a[5][110];
int dp[5][110];
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]);
memset(dp,0,sizeof(dp));
for (int i=1;i<=2;i++)
for (int j=1;j<=n;j++)
dp[i][j]=max(dp[i-... | 143 |
Project_CodeNet | 2,018 |
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <tuple>
#include <functional>
#include <cmath>
#include <complex>
#include <cctype>
#include <map>
#include <queue>
using namespace std;
#define PI 3.14159265358979323846
#define MOD 1000000... | 453 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <array>
#include <climits> // INT_MAX, LONG_MAX, LLONG_MAX, UINT_MAX, ULONG_MAX, ULLONG_MAX
#include <cmath>
#include <cstdint>
#include <cstring> // memset
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define ALL(x) (x).begin(), (x).end()
#define ... | 300 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
#include<string.h>
#include<set>
#include<stdio.h>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include <cstdio>
#include <cstdlib>
#include<stack>
#include<vector>
long long n,m;
long long a[3][110];
int ... | 230 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, A, B, As[110] = {}, Bs[110] = {}, MAX = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A;
As[i + 1] = As[i] + A;
}
for (int i = 0; i < N; i++) {
cin >> B;
Bs[i + 1] = Bs[i] + B;
}
for (int i = 1; i <= N; i++) {
int count = 0;
count... | 174 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], b[n];
for(int i = 0; i < n; i++) { cin >> a[i]; if(i > 0) a[i] += a[i - 1]; }
for(int i = 0; i < n; i++) cin >> b[i];
for(int i = n - 2; i >= 0; i--) b[i] += b[i + 1];
int ans = 0;
for(int i = 0; i < n; i++) ans = max(ans, a[i... | 144 |
Project_CodeNet | 2,018 | //abc 90 a
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0;i < n;i++)
#define repr(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
int main(){
int a[2][100];
int n;
cin>>n;
rep(k,2){
rep(i,n){
cin>>a[k][i];
}
}
int t=0;
int ans=0;
rep(k,n){
... | 186 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int 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];
}
}
int ans=0;
for (int i=0; i<N; i++) {
int ame=0;
for (int j=0; j<=i; j++) {
ame+=A[0][j];
}
for (int j=i; j<N; j++... | 171 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int m[2][10000], n;
int dp[2][10000];
bool OK(int i, int j){
return (0 <= i && i < 2 && 0 <= j && j < n);
}
int dfs(int i, int j){
if(i == 1 && j == n) return m[i][j];
if(dp[i][j] != -1)return dp[i][j];
int res = 0;
if( OK(i + 1, j) ){
res = max( ... | 275 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[2][N];
for(int a = 0; a < 2; ++a) {
for(int b = 0; b < N; ++b) {
cin >> A[a][b];
}
}
int ans = 0;
for(int a = 0; a < N; ++a) {
int temp = 0;
for(int b = 0; b < N; ++... | 197 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define int long long
signed main() {
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; ... | 178 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<iomanip>
#define sqr(x) (x)*(x)
using namespace std;
int n,m,i,j,a[5][105],dp[5][105];
int main()
{
cin>>n;
for (i=1;i<=2;i++)
{
for (j=1;j<=n;j++)
{
cin>>a[i][j];
}
}
fo... | 171 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | 362 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define ll long long
#define ull unsigned long long
#define ld long double
#define vl vector<long long>
#define vvl vector<vector<long long>>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#def... | 562 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<functional>
#include<cmath>
#include<map>
using namespace std;
#define int long long
typedef pair<int, int> P;
int a[2][114];
signed main() {
int n;
cin >> n;
for (int i = 1; i <= 2; i++)
for (int j = 1; j <= n; j++... | 179 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
using std::max;
inline void umx(int &a,int b){a=max(a,b);}
const int MAXN=105;
int n;
int mp[2][MAXN];
int main()
{
int i,j;scanf("%d",&n);
for(i=1;i<=n;i++) scanf("%d",&mp[0][i]);
for(i=1;i<=n;i++) scanf("%d",&mp[1][i]);
int ans=0;
for(i=1;i<=n;i++)
{
int res=0;
for(j=1;... | 174 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int N;
int a[2][100];
int m[2][100];
int main(void){
cin >> N;
for(int i = 0; i < N; i++){
cin >> a[0][i];
}
for(int i = 0; i < N; i++){
cin >> a[1][i];
}
m[0][0] = a[0][0];
for(int i = 0; i < N; i++){
for(int j = 0; j < 2; j++){
for(int k = 0; k... | 221 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <sstream>
#include <string.h>
#include <vector>
#include <map>
#include <algorithm>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <deque>
#include <limits>
#include <iomanip>
#include <ctyp... | 4,214 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,ans=0;
cin >> n;
int a[n],b[n];
for(int g=0;g<n;g++){
cin >> a[g];
}
for(int i=0;i<n;i++){
cin >> b[i];
}
for(int i=0;i<n;i++){
int sum=0;
for(int j=0;j<=i;j++){
sum+=a[j];
}
for(int j=i;j<n;j++){
sum+=b[j];
}
... | 146 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int arr[2][105];
int n;
cin >> n;
arr[0][0] = 0;
arr[1][n+1] = 0;
for (int i = 0; i <2; i++)
{
for (int j = 1; j <= n; j++)
{
cin>>arr[i][j];
}
}
for (int j = 1; j <= n; j++)
{
arr[0][j] += arr[0][j - 1];
}
for (int ... | 232 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
int A[2][100];
for(int i=0; i<N; i++){
cin >> A[0][i];
}
for(int i=0; i<N; i++){
cin >> A[1][i];
}
//
int dp_ue, dp_shita;
dp_ue=A[0][0];
dp_shita=A[0][0]+A[1][0];
for(int i=0... | 171 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n,m,ans;
int s[2][1003];
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
scanf("%d",&s[0][i]);
}
for (int i=1;i<=n;i++)
{
scanf("%d",&s[1][i]);
}
for (int i=1;i<=n;i++)
{
s[0][i]+=s[0][i-1];
s[1][i... | 160 |
Project_CodeNet | 2,018 | /*
Swamy Saranam
Date : 28/01/2018 17:26:27
Author : Krishna Mohan A M
Problem :
Status :
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ld,ld> pdd;
typede... | 432 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
#include <deque>
#include <string.h>
using namespace std;
#define REP(i,n) for(int i = 0; i < n; i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
typedef pair<int,int> pi;
typedef p... | 377 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int ar[2][n];
for(int i = 0; i<2; i++){
for(int j = 0; j<n; j++){
cin >> ar[i][j];
}
}
for(int i = 1; i<n; i++){
ar[0][i] += ar[0][i-1];
}
for(int i = n-2; i>=0; i--){
ar... | 181 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < n; i++)
#define frab(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef long double ld;
const ll INF = 2e9 + 10;
const ll MOD = 1e9 + 7;
const ld EPS = 1e-9;
const ld PI = acos... | 353 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto (a): (b))
#define all(v) (v).begin... | 628 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <iostream>
#include <vector>
#include <set>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
const int CMax = 100002;
int n, A[2][CMax], B[2][CMax], ats;
int main() {
scanf("%d", &n);
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++) {
... | 280 |
Project_CodeNet | 2,018 | #include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int INF=1e9;
const double eps=1e-9;
const int maxn=1e2+10;
int a[maxn],b[maxn];
inline int read(){
int x=0,flag=1;
char ch=getchar();
while(!isdigit(ch) && ch!=... | 239 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | 523 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define INIT(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i... | 567 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cmath>
int main() {
int w;
std::cin >> w;
int a[100], b[100];
for (int i = 0; i < w; i++) {
std::cin >> a[i];
}
for (int i = 0; i < w; i++) {
std::cin >> b[i];
}
int sum = 0;
for (int i = 0; i < w;i++) {
int suum = 0;
for (int j = 0; j < w; j++) {
if (j < i) {
suum... | 214 |
Project_CodeNet | 2,018 | #pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#define _CRT_SECURE_NO_WARNINGS
# include <iostream>
# include <cmath>
# include <algorithm>
# include <stdio.h>
# include <... | 5,430 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for(l... | 576 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <ctime>
#include <cstring>
#include <iostream>
#include <algorithm>
#define debug(x) cout<<#x<<" = "<<x<<endl;
#define lowbit(x) x&(-x)
#define PA pair<int, int>
#define MK make_pair
using namespace std;
typedef ... | 320 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
//#define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
using Tapris = tuple<int, int, int>;
#define FOR(i, a, n) for(int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
cons... | 343 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int dp[3][110]={};
//dp[i][j]:(i,j)までの点で得ることのできるアメの最大値
int main(){
int N;
cin>>N;
int field[3][110];
for(int i=1; i<=2; i++){
for(int j=1; j<=N; j++)cin>>field[i][j];
}
dp[1][0]=0;//dp初期条件
dp[2][0]=0;
for(int i=1; i<=2; i++... | 302 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
//const int mod = 998244353;
sign... | 250 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int A[3][1010],f[3][1010];
int 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++)
f[i][j] = max(f[i-1][j], f[i][j-1]) + A[i][j];
printf("%d\... | 140 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<map>
#include<cstring>
#include<complex>
#include<cmath>
#include<algorithm>
#include<list>
#include<functional>
#define mp make_pair
#define X first
#define Y second
#define INF... | 690 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int MAX_COLS = 105;
int candies[2][MAX_COLS];
int N;
int calculateNumberOfCandies(int move_down_index) {
int number_of_candies = 0;
for (int i = 0; i <= move_down_index; ++i) {
number_of_candies += candies[0][i];
}
for (int i = move_down_index; i < N; ++... | 312 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define MOD (1e10+7)
int main(void){
int n,a[123][2],i,j,ans=0,s[123][2];
cin >> n;
for(j=0; j<2; j++){
for(i=0; i<n; i++){
cin >> a[i][j];
}
}
s[0][0]=0;
s[0][1]=0;
for(i=0; i<n; i++){
s[i+1][0] = s[i][0] + a[i][0];
s[i+1][1] = s[i]... | 201 |
Project_CodeNet | 2,018 | # include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n+10],b[n+10],c[n+10],d[n+10];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=0;i<n;i++)
{
cin>>b[i];
}
int ans=0;
for(int i=0;i<n;i++)
{
int l=0;
for(int j=0;j<=i;j++)
l+=a[j];
for(int m=i;m<n;m++)
l+=b[m];
ans=... | 153 |
Project_CodeNet | 2,020 | #include<iostream>
#include<vector>
using namespace std ;
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.at(i).at(j) ;
int MAX=0 ;
for(int i=0;i<N;i++){
int sum_up=0 ;
int sum_down=0 ;
for(int j=0;j<N;j++){
if(j<=... | 180 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iterator>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
/* -------------------------------- Template -------------------------------- *... | 449 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define F first
#define S second
#define f_in freopen("test.in","r",stdin);
#define f_out freopen("test.in","w",stdout);
#d... | 479 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
// Begin {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
template <class A, class B> inline bool chmax(A &a, const B &b) noexcept {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) noexcept {
... | 441 |
Project_CodeNet | 2,020 | #include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... | 797 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
const int maxn=110;
int a1[maxn],a2[maxn];
int b1[maxn];
int b2[maxn];
int c[maxn];
int main()
{ int N;
while (scanf("%d",&N)!=EOF&&N) {
b2[0]=b1[0]=0;
for(int i=1;i<=N;i++){
scanf("%d",&a... | 236 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
int N;
int dp[3][104];
int dx[3][104];
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) {
scanf("%d", &dp[1][i]);
}
for (int i = 1; i <= N; ++i) {
scanf("%d", &dp[2][i]);
}
for (int i = 1; i <= 2; ++i) {
for (int j = 1; j <= N; ++j) {
dx[... | 188 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 105;
int n, a[MAXN], b[MAXN];
int main(){
int i, mx = 0, s = 0;
scanf("%d", &n);
for(i = 1; i <= n; ++ i)
scanf("%d", &a[i]);
for(i = 1; i <= n; ++ i)
scanf("%d", &b[i]), s += b[i];
for(i = 1; i <= n; ++ i){
s += a[i];
if(s > mx) mx = s;
s ... | 149 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int 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];
}
}
int sum = 0;
int m = -1;
int x = 0;
for (int i = 0; i < N; i++)
{
... | 179 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double Double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// chmax, chmin
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T ... | 529 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<vector<int>> A(2, vector<int>(N+1));
for(int i=0; i<2; ... | 243 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <cstring>
#include <cmath>
using std::cin;
using std::cout;
using std::endl;
int main() {
int N;
std::vector<int> a[2];
cin >> N;
a[0].resize(N);
a[1].resize(N);
for (int i = 0; i < 2; ++i) {
for (int... | 238 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
using namespace std;
int main() {
int i;
int N;
scanf("%d", &N);
int A[2][110];
A[0][0] = 0;
A[1][0] = 0;
for (i = 1; i < N+1; i++) {
scanf("%d", &A[0][i]);
}
for (i = 1; i < N+1; i++) {
scanf("%d", &A[1][i]);
}
int ruiseki_0[110] = {};
int ruisek... | 302 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string... | 513 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void){
int n;
cin >> n;
vector<int> v1(n);
vector<int> v2(n);
for (int i=0 ; i<n ; i++){
int k;
cin >> k;
v1[i] = k;
}
for (int i=0 ; i<n ; i++){
int k;
cin >> k;
... | 206 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<int> a(n), b(n);
int ans = 0;
for(int i =... | 212 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <functional>
#include <map>
#include <set>
#include <cstring>
#include <string>
#include <cctype>
#include <cassert>
#include <queue>
#include <unordered_set>
#include <unordered_map... | 702 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.