Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int A[105], B[105];
int main() {
int N, a, b;
scanf("%d", &N);
for (int i = 1; i <= N; i++) {
scanf("%d", &a);
A[i] = A[i-1] + a;
}
for (int i = 1; i <= N; i++) {
scanf("%d", &b);
B[i] = B[i-1] + b;
}
int ans = 0;... | 175 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#define N 105
using namespace std;
int n, a[5][N];
int main()
{
int i, j;
cin >> n;
for (i = 1; i <= n; i++) scanf("%d", &a[1][i]);
for (i = 1; i <= n; i++) scanf("%d", &a[2][i]);
for (i = 1; i <= 2; i++) {
for (j = 1; j <= n; j++) {
a[i][j] += max(a[i - 1][j], a[i][j - ... | 164 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int MAIN(){
int n;
if(!(cin >> n)) return 0;
vector<vector<int> > arr(2, vector<int>(n, 0));
for(int e = 0; e < 2; e++) for(int f = 0; f < n; f++) cin >> arr[e][f];
int ans = 0;
// for(int e = 0; e < 2; e++){
for(int f = 0; f < n; f++){
int col = 0;
... | 209 |
Project_CodeNet | 2,018 | /*
ID: simpgoo1
TASK:
LANG: C++14
*/
// timus 219263UI
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <ctime>
#include <queue>
#include <vector>
#include <iomanip>
#include <cstdlib>
#include <stdio.h>
#include <string.h>
#include <algorithm>
// #include <unord... | 479 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define watch(x) cout << (#x) << " is " << (x) << endl
int oo = 0x3f3f3f3f;
int main(){
int n;
cin >> n;
int ar[2][n];
int sum[2][n];
for( int i = 0; i < 2; i++ ){
for( int j = 0; j < n; j++ ){
cin >> ar[i][j];
}
}
sum[0][0] = ar[0][0];
sum[1][0] = ar[1][0];
... | 277 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define pout(n) printf ("%d\n", n)
#define rep(i,a,n) for (int i = a;i < n;i++)
#define per(i,n,a) for (int i = n-1;i >= a;i--)
const int d4x[4] = {1, 0, -1, 0};
const int d4y[4] = {0, 1, 0, -1};
const int d8x[8] = { 1,1,0,-1,-1,-1,0,1 };
const int d8y[8] = { 0,1,1,1,0,-1,-1,-1 };
#define ... | 292 |
Project_CodeNet | 2,018 | //It is made by Awson on 2018.1.28
#include <set>
#include <map>
#include <cmath>
#include <ctime>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define dob co... | 472 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
using namespace std;
#define REP(i, n) for(int i=0;i<n;i++)
template<typename T>
void get(T& t){cin >> t;}
int main(void){
int n;
get(n);
vector<int> a1(n), a2(n);
REP(i,n)get(a1[i]);
REP(i,n)get(a2[i]);
int ans = 0;
... | 158 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
int b[N];
cin >> a[0];
for(int i=1;i<N;i++){
int x;
cin >> x;
a[i]=a[i-1]+x;
}
for(int i=0;i<N;i++){
cin >> b[i];
}
for(int i=N-2;i>=0;i--){
b[i]=b[i+1]+b[i];
}
int max=0;
for(int i=0;i<N... | 158 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
using namespace std;
int solve(int n, vector<vector<int> > arr) {
vector<vector<int> > dp(3);
for(int i = 0; i < 3; i++) {
dp[i].resize(n + 1);
for(int j = 0; j < n + 1; j++) {
dp[i][j] = 0;
}
}
for(int i = 1; i <= 2; i++) {
for(int j = 1; j <= n; j+... | 288 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <map>
#include <vector>
#include <deque>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <iostream>
#include <iterator>
#include <memory>
#include <numeric>
using namespace std;
#if 1
#define PRINT(x)... | 357 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define dbg(x) cerr<<#x": "<<x<<"\n"
#define dbg_p(x) cerr<<#x": "<<x.first<<","<<x.second<<"\n"
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"
#define DMAX
#define NMAX
#define MMAX
using namespace std;
int n, ... | 328 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n,sum[105][2],x[105][2];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&x[i][0]);
}
for(int i=1;i<=n;i++){
scanf("%d",&x[i][1]);
}
sum[0][0]=0;
for(int i=1;i<=n;i++){
sum[i][0]=sum[i-1][0]+x[i][0];
... | 207 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 100000000
#define MAX 100001
#define int ll
#define ll long long
#define ld long double
#define vi vector<int>
#define pa pair<int, int>
#define pb push_back
#define mp make_pair
#define INIT ios::sync_with_stdio(false);cin.tie(0);
#de... | 532 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#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++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#defi... | 431 |
Project_CodeNet | 2,018 | #include<cstdio>
int A,s[110],t[110];
int main()
{
int n,res=0;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&A);
s[i]=s[i-1]+A;
}
for(int i=1;i<=n;i++)scanf("%d",&t[i]);
for(int i=n;i;i--)t[i]+=t[i+1];
for(int i=1;i<=n;i++)if(s[i]+t[i]>res)res=s[i]+t[i];
printf("%d",res);
return 0;
} | 131 |
Project_CodeNet | 2,018 | //start of jonathanirvings' template v3.0.3 (BETA)
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
typedef pair<string,string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<LL> vl;
typedef vector<vl>... | 1,003 |
Project_CodeNet | 2,018 | /* -*- coding: utf-8 -*-
*
* a.cc: C: Candies
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utilit... | 320 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
typedef long long int ll;
#define FOR(i,n,m) for(ll i=(ll)(m);i<(ll)(n);++i)
#define REP(i,n) FOR(i,n,0)
#define IREP(i,n) for(ll i=(ll)(n);i>=0;--i)
const ll MOD = 1000000007;
using namespace std;
int A[2][101];
int main()
{
int N;
ci... | 231 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <cstring>
#include <cstdio>
#include <math.h>
#include <queue>
#include <stack>
using namespace std;
#define F first
#define S second
typedef long long ll;
typedef pair<int,int> P;
int n,u[105],s[105];
int main(void){
... | 193 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <queue>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <stack>
#include <cstring>
#include <cmath>
#include <vector>
#include <ctime>
#include <bitset>
using namespace std;
#define pb push_back
#define sd... | 778 |
Project_CodeNet | 2,018 | /*
Author: CNYALI_LK
LANG: C++
PROG: c.cpp
Mail: cnyalilk@vip.qq.com
*/
#include<bits/stdc++.h>
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define Debug debug("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define all(x) x.begin(),x.end()
u... | 527 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <queue>
#include <algorithm>
#include <stack>
#include <cmath>
#include <map>
#include <cstring>
using namespace std;
#define mod 1000000007
#define PI acos(-1.0)
const long long MAX=200005;
typedef long long ll;
const int INF=0x3f3f3f3f;
//int d[8][2]={-1,0,0,-1,0,1,1,0,1... | 269 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
const int maxn = 105;
int A[2][maxn];
int main(void)
{
int n;
scanf("%d", &n);
for(int i = 0;i < n;i++)
{
scanf("%d", &A[0][i]);
if(i) A[0][i] += max(0, A[0][i-1]);
}
for(int i = 0;i < n;i++)
{
scanf("%d", &A[1][i]);
if(i) A... | 183 |
Project_CodeNet | 2,018 | // This file is in ~/.config/geany/templates/files
#include<bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<(int)(n); i++)
#define forsn(i,s,n) for(int i=(s);i<(int)(n); i++)
#define debug(x) cout << #x << " = " << x << endl
#define pb push_back
#define mp make_pair
typedef long long tint;
int toN... | 484 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int main(){
int N,tmp,ans;
int x[3][100005];
cin>>N;
for(int i=0;i<N;i++){
cin >>x[0][i];
}
for(int i=0;i<N;i++){
cin >>x[1][i];
}
for(int i=0;i<N;i++){
tmp=0;
... | 162 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9+7;
const int size = 1e3+100;
int main()
{
ios_base::sync_with_stdio(0);
int n;
cin >> n;
int a[n+1][2];
int b[n+1][2];
for(int i=0;i<n;i++)
cin >> a[i][0];
for(int i=0;i<n;i++)
cin >> a[i][1];
b[0][0]=a[0][0];
b[0]... | 210 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
int n;
int a1[110];
int a2[110];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a1[i];
}
for (int i = 0; i < n; i++) {
cin >> a2[i];
}
int m = 0;
for (int i = 0; i < n; i++) {
int c = 0;
... | 183 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF 1000000000000000007
typedef long long Int;
typedef pair<Int,Int> P;
Int gcd(Int x, Int y){
if(y == 0) return x;
return gcd(y, x%y);
}
Int lcm(Int x, Int y){
return x * y / gcd(x,y);
}
bool sosuu(Int x){
bool b = 1;
if(x == 1) b ... | 315 |
Project_CodeNet | 2,018 | #include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int N=105;
int n,a[N],b[N];
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]);
for (int i=2;i<=n;i++)
a[i]+=a[i-1];
for (int i=... | 163 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <string>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <utility>
using namespace std;
using ll = long long int;
int main() {
int ... | 227 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define pb push_back
#define gc getchar
#define mp make_pair
#define pii pair<int,int>
#define pll pair<lli,lli>
#define vi vector<int>
#define vc vector<char>
#define pdd pair<double,double>
#define rep(i,n) for(int i=0;i<n;i++)
#define repi(i,a,b) for(int i=a;i<=b;i++)
#define repd(i,a,b... | 451 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
template <class T> void mini(T &l, T r) {l = min(l, r);}
template <class T> void maxi(T &l, T r) {l = max(l, r);}
string to_string(string s) {
return '"' + s + '"';
}
string to_string(bool a) {
return a ? "T" : "F";
}
string to_string(const char* s) {
return to_... | 556 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define f first
#define s second
#define MP make_pair
#define PB push_back
#define LL long long
#define pii pair<int,int>
#define pll pair<LL,LL>
#define ALL(V) V.begin(),V.end()
#define f1(a,b) for(int a=1;a<=b;a++)
#define f0(a,b) for(int a=0;a<b;a++)
#define boost ios_base::sync_with_stdio(0... | 238 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <numeric>
#include <set>
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... | 317 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany ro... | 408 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
const int N = 110;
int a[2][N], qz[2][N];
int main() {
int n;
scanf("%d", &n);
for(int i = 0; i < 2; ++i) {
for(int j = 1; j <= n; ++j) {
scanf("%d", &a[i][j]);
}
}
for(int j = 1; j <= n; ++j)
qz[0][j] = qz[0][j - 1] + a[0][j];
for(int j = n; ... | 238 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define Rep(i, n) for( int i = 0; i < (n); i++ )
#define Rrep(i, a, n) for( int i = (a); i < (n); i++ )
#define All(v) v.begin(), v.end()
typedef pair<int, int> Pii;
typedef... | 261 |
Project_CodeNet | 2,019 | #include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), B(N);
for (int i = 0; i < N; ++i) cin >> A[i];
for (int i = 0; i < N; ++i) cin >> B[i];
for (int i = 1; i < N; ++i) A[i] += A[i - 1];
for (int i = N - 2; i >= 0; --i) B[i] += B[i + 1];
... | 173 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n;
int a[2][105];
int f2[105],f1[105];
while(cin>>n)
{
for(int i=0;i<2;i++)
{
for(int j=1;j<=n;j++)
{
cin>>a[i][j];
}
}
f2[n]=a[1][n];
for(int i=n-1;i>=1;i--)
{
f2[i]=a[1][i]+f2[i+1];
}
f1[n]=a[0][n]+f2[... | 203 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define f first
#define s second
#define MOD 1000000007
#define PMOD 998244353
#define pb(x) push_back(x)
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> plii;
typedef pair<int, pii> piii;
const int INF = 1e9+10;
const ll LINF = 1LL*INF*INF;
const ... | 334 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <iterator>
#include <iostream>
#include <iomanip>
#include <utility>
#include <string>
#include <vector>
#include <limits>
#include <queue>
#include <cmath>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
vector<vector<... | 275 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int f[2][500005];
int main(){
int n,mx=0;
scanf("%d",&n);
for(int i=1;i<=n;++i){
scanf("%d",&f[0][i]);
}
for(int i=1;i<=n;++i){
scanf("%d",&f[1][i]);
}
for(int i=1;i<=n;++i){
f[0][i]+=f[0][i-1];
f[1][n-i+1]+=f[1][n-i+2];
}
for(int i=1;i<=n;++i)mx=max(mx,f[0]... | 164 |
Project_CodeNet | 2,018 | #include <cmath>
#include <cstdio>
#include <stack>
#include <queue>
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <numeric>
#include <string>
#include <array>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) x.begin(), x.end()
using namespace std;
typedef long... | 225 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = (int)1e3 + 10;
int dp[2][MAXN],N,best;
int main(){
scanf("%d",&N);
for(int i = 1;i<=N;i++){
scanf("%d",&dp[0][i]);
dp[0][i] += dp[0][i-1];
}
for(int i = 1;i<=N;i++){
scanf("%d",&dp[1][i]);
dp[1][i] += dp[1][i-1];
}
for(int i = 1;i<=N;i++){
b... | 180 |
Project_CodeNet | 2,018 | #include <vector>
#include <iostream>
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[i][j];
}
}
for(int i = 1; i < N; ++i){
A[0][i] += A[0][i-1];
A[1][N-1-i] += A[1][N-i];
}... | 187 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
ll n;
cin>>n;
ll ar[n],br[n];
ll pre1[n],pre2[n];
cin>>ar[0];
pre1[0] = ar[0];
for(ll i=1;i<n;i++){
cin>>ar[i];
pre1[i] = pre1[i-1] + ar[i];
}
cin>>br[0];
pre2[0] = br[0];
for(ll... | 227 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
int A[2][100];
int dp[2][100];
int main(){
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(j+1<N){
dp[i][j+1]=max(dp[i][j+1]... | 202 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;
int main(void) {
ll N;
cin >> N;
ll A[2][N + 1];
A[0][0] = A[1][0] = 0;
REP(i, 0, 2) REP(j, 1, N + 1) cin >> A[i][j];
REP(i, 0, 2) REP(j, 1, N + 1) A[i][j] += A[i][j - 1];
ll... | 224 |
Project_CodeNet | 2,020 | #include<iostream>
#include<stdio.h>
#include<vector>
#include<cmath>
#include<queue>
#include<string.h>
#include<map>
#include<set>
#include<algorithm>
#define ll long long
#define pi pair < ll,ll >
#define mp(a,b) make_pair(a,b)
#define mid (low+high)/2
#define rep(i,a,b) for(int i = a;i < b;i++)
#define N 300004
#de... | 302 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#incl... | 429 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <tuple>
#include <vector>
using namespace std;
int A[2][101] = {0};
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[0][i];
}
for (int i = 0; i < N; i++) {
ci... | 221 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <assert.h>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <math.h>
#include <string>
#include <string.h>
#include <queue>
#include <complex>
#include <iomanip>
#include <stack>
using namespac... | 964 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 373;
#define rep(i, n) for (int i = 0; i < (n); ++i)
... | 414 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define MAX_N 105
using namespace std;
int n,t[MAX_N],sum[MAX_N];
int main(){
int i,x;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&x);
sum[i]=x+sum[i-1];
}
for(i=1;i<=n;i++){
scanf("%d",&x);
t[i]=max(t[i-1]+x,sum[i]+x);
}
printf("%d\n",t[n]);
return 0;
} | 115 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
//repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define euc_dis(x, y) sqrt(x*x + y*y)
#define pb push_back
#define mp make_pair
#define INF 999999999
#define MOD 1000000007
#define sp ' '
//typedef
type... | 769 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
int in() { int x; scanf("%d", &x); return x; }
template<typename T> void pv(T a, T b) { for (T i = a; i < b; i++) cout << *i << ' '; cout << endl; }
template<typename T, typename U> void chmin(T &x, U y) { if (y < x) x =... | 391 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb emplace_back
#define x first
#define y second
#define sz(a) ((int)(a).size())
#define rep(i,a,b) for(auto i=(a); i<(b); i++)
#define dec(i,n,a) for(auto i=(n); i>=(a); i--)
#define clr(a,v) memset(a, v, sizeof(a))
#define all(a) (a).begin(),(... | 336 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define sc scanf
#define pf printf
#define pb push_back
#define pbk pop_back
#define mk_pr make_pair
typedef long long intl;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<string> vss;
typedef queu... | 269 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using tpl = tuple<char, int>;
typedef pair<int,int> pii;
typedef long long ll;
void fastStream(){cin.tie(0);std::ios_base::sync_with_stdio(0);}
int N;
int A[2][101];
int main(){
cin >> N;
for(int i = 0; i < 2; i++)
for(int j = 0; j < N; j++)
... | 223 |
Project_CodeNet | 2,018 | #include<cstdio>
int main() {
int N, A[2][100], sum=0, i;
scanf("%d", &N);
for (i = 0; i < N; i++) scanf("%d", &A[0][i]);
for (i = 0; i < N; i++) scanf("%d", &A[1][i]);
for (i = 1; i < N; i++) A[0][i] += A[0][i - 1];
for (i = N - 2; i >= 0; i--)A[1][i] += A[1][i + 1];
for (i = 0; i < N; i++)sum = sum < A[0][i] +... | 197 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define ll long long
#define inf (ll)1e18
#define all(x) x.begin(), x.end()
const int MX = 200020;
const int N = 1000060;
const int mood = ((int)1e9 + 7);
int main(){
/*
Hossam ^_^
___ ___
(^_^) (^_^)
/( | )\ /( | )... | 509 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#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++)
#define INF 2e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int GCD(int a,int b){return b?GCD(b,a%b):a;}
int LCM(int a... | 347 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);++i)
#define fi first
#define se second
#define INF 1000000009
#define lINF 1000000000000000009
typedef long long ll;
int main(){
int n;
int a[2][109];
cin>>n;
rep(i,2){
rep(j,n){
cin>>a[i][j];
}
}
int ans=0;
f... | 189 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <istream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <algorithm>
#include <map>
#include <set>
#include <cstring>
#include <string.h>
#include <iomanip>
#include <queue>
#include <stack>
#include <list>
using namespace std;
typedef long lon... | 658 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
using namespace std;
const int N=107;
int a[N],b[N],n,i,ans;
int main(){
for(scanf("%d",&n),i=1;i<=n;++i)scanf("%d",a+i);for(i=1;i<=n;++i)scanf("%d",b+i);
for(i=1;i<=n;++i)a[i]+=a[i-1];for(i=n;i>=1;--i)b[i]+=b[i+1];
for(i=1;i<=n;++i)ans=max(ans,a[i]+b[i]);
printf("%d\n",ans);
} | 135 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define _rep(i,n) _repl(i,0,n)
#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all... | 422 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int N, candy[2][105], result;
void func(int x, int y, int count)
{
if(x == N - 1 && y == 1)
{
result = max(result, count + candy[y][x]);
return;
}
if(x != N - 1)
{
func(x + 1, y, count + candy[y]... | 210 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int s1[200],s2[200],i,v1[200],v2[200],n,Max;
int main()
{
cin>>n;
for(int i = 1;i<=n;i++)
{
cin>>v1[i];
s1[i] = s1[i-1] + v1[i];
}
for(int i = 1;i<=n;i++)
{
cin>>v2[i];
}
for(i = n; i>=1;i--){
s2[i] = s2[i+1] + v2[... | 172 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1LL << 30;
int MOD = 1e9+7;
main(){
int N;
cin >> N;
vector<int> accumA(N);
vector<int> accumB(N);
for(int i = 0;i < N;i++){
cin >> accumA[i];
if(i)accumA[i] += accumA[i-1];
}
for(int i = 0;i < N;i++... | 199 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#ifdef HELTHAZAR
#define dout if (true) cout
#else
#define dout if (false) cout
#endif
const int MAXN = 101;
int dp[MAXN][2], a[MAXN][2];
void solve() {
int n;
cin >> n;
for (int k = 0; k < 2; k++)
for (int i = 0; i < n; i++)
cin >> a[i][k];
dp[0][0] = a[0][0]... | 238 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
#define rep(i,x,y) for(register int i=x;i<=y;++i)
#define repd(i,x,y) for(register int i=x;i>=y;--i)
#define ll long long
using namespace std;
const int N=1e3+100;
int n,m;
int g[4][N],dp[4][N];
int main(){
ios::sync_with_stdio(false);
cin>>n;
... | 179 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, A[2][105], dp[2][105];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> N;
for (ll i = 0; i < 2; i++) {
for (ll j = 0; j < N; j++) {
cin >> A[i][j];
if (i == 0 && j == 0) dp[i][j] = A[i][j];
if (i > 0) dp[i][j] = ma... | 204 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<vector<int>> v(2, vector<int>(n));
for (int j = 0; j < 2; j++) {
for (int i = 0; i < n; i++) {
cin >> v[j][i];
}
}
vector<ll> pr(n);
vector<ll> suf(n);
pr[0] = v[0][0];
for (int i = ... | 241 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
const ll INF = LLONG_MAX;
const ll MOD = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
ll N;
cin >> N;
ll a[110];
ll b[110];
rep(i, N) {
ll temp;
... | 256 |
Project_CodeNet | 2,018 | #include<iostream> // 入出力
#include<stdio.h> // 入出力
#include<math.h> // 数学の関数
#include<vector> // 配列
#include<string> // 文字列
#include<map> // 連想配列
#include<stack> // スタック
#include<queue> // キュー
#include<algorithm> // ソートとか
using namespace std;
using ll = long long;
int A[200][2];
int N;
int main()
{
cin >>... | 275 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
using namespace std;
typedef long long ll;
typedef pair <ll,ll> pii;
const ll NMAX = 10001;
const ll INF = (1LL << 60);
const ll MOD = 998244353;
const ll BLOCK = 447;
int n;
int a[3][101], dp[3][101];
int main() {
ios_base::sync_with_stdi... | 276 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n,a[110][2],ans;
int read()
{
int x=0,f=1;char ch=getchar();
for(;ch<'0'||ch>'9';ch=getchar()) if(ch=='-') f=-1;
for(;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';
return x*f;
}
int main()
{
n=read();
for(int i=1;i<=n;i++)
a[i][0]=re... | 217 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
int main()
{
ull n;
ull 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];
ull sum[2][100];
sum[0][0] = a[0][0];
sum[1][n-1] = a[1][n-1];
for(int i=1;i<n;i++){
sum[0][i] = sum[0][i-1] + ... | 230 |
Project_CodeNet | 2,018 | #define loop(i,j,k) for(long long i = j;i < k;i++)
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <string>
#include <list>
#include <stack>
#include <set>
#include <map>
using namespace std;
typedef long long int int64;
int main(void) {
int n,a[2][100];
cin >> n;
... | 194 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cctype>
#include<cstdlib>
#include<cmath>
#include<queue>
using namespace std;
typedef long long ll;
inline ll read() {
char ch = getchar(); ll x = 0; int op = 1;
for(; !isdigit(ch); ch = getchar()) if(ch == '-') op = -1;
for(; isdig... | 314 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define rep(i,a,n) for(int i = a;i < n;i++)
typedef unsigned long long ull;
typedef long long ll;
using namespace std;
ull gcd(ull a,ull b){
if(!b) return a;
return gcd(b,a%b);
}
int main(){
int n;
cin >> n;
int a[2][n],dp[2][n] = {0};
rep(i,0,2){
rep(j,0,n){
cin >> a[i][j];
... | 282 |
Project_CodeNet | 2,018 |
#include <bits/stdc++.h>
using namespace std;
int a[2][123456];
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
int sum = 0;
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
sum += a[i][j];
}
}
for (int i = 1; i < n; i++) {
sum -= a[0][i];
}
int ans = sum... | 180 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long int
#define mp make_pair
#define pb push_back
#define ld long double
#define pii pair<int,int>
#define sz(x) (int)x.size()
#define piii pair<pii,pii>
#define precise cout<<fixed<<setprecision(10)
#define st first
#define nd second
#define ins insert
#define vi vector<int>
#... | 258 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define F first
#define S second
#define llong long long
#define ullong unsigned long long
#define mp make_pair
#define pb push_back
#define sz(v) (int)v.size()
using namespace std;
const int MXN = (int)1e6 + 10;
const int INF = (int)1e9 + 7;
const llong LINF = (llong)1e18 + 10;
const double... | 342 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n;
cin >> n;
vector<vector<int > >a(2, vector<int>(n)), col(2, vector<int>(n));
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++)
cin >> a[i][j];
}
col[0][0] = a[0][0];
col... | 229 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const int MOD =... | 347 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
vector<vector<int>> A(2, vector<int>(100, 0));
cin >> 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 sum = 0;
for(int j=0; j<=i; j++) sum += A[0][j];
... | 163 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef map<int,int> mi;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
int main()
{
int n,x;
cin >> n;
vector<int> one,two;
for(int i=0;i<n;++i) cin >> x, one.push_back(x);
for(int i=0;i<n;++... | 179 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
long long a[200], b[200];
for(int i = 0;i < n;i++){
cin >> a[i];
}
for(int i = 0;i < n;i++){
cin >> b[i];
}
for(int i = 1;i < n;i++){
a[i] += a[i-1];
}
for(int i = n-1;i > 0;i-... | 172 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define mem(a,n) memset(a,n,sizeof(a))
#define rep(i,a,n) for(int i=a;i<n;i++)
#define pb push_back
#define IO ios::sync_with_stdio(false)
#define fre freopen("in.txt","r",stdin)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
typedef long long ll;
const double PI=acos(-1... | 335 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <deque>
using namespace std;
ty... | 431 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <set>
#include <map>
#include <functional>
#include <string>
#define SIZE 105
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
int A[SIZE];
int B[SIZE];
int main()
{
int n... | 190 |
Project_CodeNet | 2,018 | #define REP(i,n) for(int i=0; i<(int)(n); i++)
#include <queue>
#include <cstdio>
inline int getInt(){ int s; scanf("%d", &s); return s; }
#include <set>
using namespace std;
int main(){
const int n = getInt();
vector<int> a(n);
vector<int> b(n);
REP(i,n) a[i] = getInt();
REP(i,n) b[i] = getInt();
int ... | 181 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define int long long
#define re(i,n) for(i=0;i<n;i++)
#define bre(i,n) for(i=n;i>0;i--)
#define rep(i,l,r) for(i=l;i<r;i++)
#define brep(i,l,r) for(i=r;i>l;i--)
const int inf=1145141919810893;
const int mod=1000000007;
using namespace std;
template<class T>bool chmin(T &a,const T &b){
if(a>b){... | 381 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<string>
#include<cstring>
#include<cctype>
#define lowbit(x) (x & (-x))
#define rep(i,x,y) for(register int i = x ;i <= y; ++ i)
typedef long long ll;
using namespace std;
template<typename T>inline void read(T&x)
{
x = 0;char c;int sign = 1;
do { c = ... | 292 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define rep(i,N) for(ll i=0;i<(N)... | 374 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <locale>
#include <iostream>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include ... | 535 |
Project_CodeNet | 2,018 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
int N;
int imos_u[100]={}, imos_d[100]={};
signed main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> imos_u[i];
}
... | 247 |
Project_CodeNet | 2,018 | #include<stdio.h>
int main()
{
int n,a[2][101],sum=0,i,j,max=0;
scanf("%d",&n);
for(i=0;i<2;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
}
}
for(i=0;i<n;i++)
{
for(j=0;j<=i;j++)
{
sum+=a[0][j];
}
for(j=i;j<n;j++)
{
sum+=a[1][j];
}
if(sum>max)
{
max=sum;
}
sum=0;
}
print... | 159 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.