Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | /*
.:*+=%@@@@@@=-.
.:=@#@@@#@@#######%==*.
.-=####@######%*-.....:%##%.
.*@###########%+:--........-%@-
.*@##############@+--.........-:%-
.+##################@==%%%%=+*:----+.
.-@####################%++%@@@@@=+**%@@*
.%######... | 1,568 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
/*
*/
using namespace std;
int main(){
long long int N;
cin >> N;
vector<long long int>A(N), B(N);
for( size_t i = 0; i < N; i++ ){
cin >> A[i];
}
long long int sumB = 0;
for( size_t i = 0; i < N; i++ ){
cin >> B[i];
sumB += B[i];
}
sumB += A[0];
long long int ans = sumB;
for(... | 164 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef v... | 490 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int main() {
int n;
cin >> n;
int dp[3][103];
memset(dp, 0, sizeof(dp));
int a[3][103];
for(int i=1; i<3; i++){
for(int j=1; j<=n; j++){
cin >> a[i][j];
}
}
for(int j=1;... | 217 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <set>
#include <bitset>
#include <cmath>
#include <string>
#include <cstring>
#include <iterator>
#include <typeinfo>
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ROF(i,a,b) for(int i=b-1;i>=a;i--)
#define FI first
#define SE second... | 386 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<vector<int>> a(2, vector<int>(n));
for (auto& x : a)
for (auto& y : x)
cin >> y;
vector<vector<int>> pref(2, vector<int>(n + 1));
for (int i = 0; i < 2; ++i)
for (int j = 0; j < n; ++j)
pref[i][j + 1] = pref[i][j] + a[i... | 184 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N... | 243 |
Project_CodeNet | 2,019 | #include<stdio.h>
#include<algorithm>
#include<functional>
#include<cmath>
using namespace std;
int main()
{
int N, an = 0, count = 0;
int A[100][100];
scanf("%d", &N);
for (int i = 0; i < 2; i++) {
for (int j = 0; j < N; j++) {
scanf("%d", &A[i][j]);
}
}
int k = 0;
for (int i = 0; i < N; i++) {
k = 0;
... | 212 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 110;
int a[3][N], f[3][N], n, ans;
int main() {
scanf("%d", &n);
for(int i = 1 ; i <= 2 ; ++ i) {
for(int j = 1 ; j <= n ; ++ j) {
scanf("%d", &a[i][j]);
... | 184 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
main(){
int n;
cin>>n;
int a[3][101];
for(int i=0;i<n;i++)
cin>>a[0][i];
for(int i=0;i<n;i++)
cin>>a[1][i];
int ans=-1;
for(int i=0;i<n;i++){
int m=0;
for(int j=0;j<=i;j++){
m+=a[0][j];
}
for(int j=i;... | 146 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<P,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout<<v<<endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th(... | 355 |
Project_CodeNet | 2,018 | /**
* iN thE namE oF AllaH
* |__________________|
* m_a_k_e m_e W_I_N_N_N_R o_f S_M_I_L_E :(
**/
#include "bits/stdc++.h"
using namespace std;
#define FasterIO ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL);
typedef long long int ll;
typedef double dd;
typedef pair<ll,ll>... | 1,630 |
Project_CodeNet | 2,020 | //Zory-2020
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
// typedef __int128 ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define FR first
#define SE second
#define MP make_pair
#define PB push_back
#define vc vector
#define db double
#define all(x) (x).begin(),(x).end()
#define sz(x) (... | 960 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
int n;
int x[110][110];
int dp[110][110];
int main () {
cin >> n;
for (int i = 1; i <= 2; i ++) {
for (int j = 1; j <= n; j ++) {
cin >> x[i][j];
dp[i][j] = max(dp[i-1][j], dp[i][j-1]) + x[i][j];
}
}
cout << dp[2][n];
return 0;
}
| 123 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define ll long long
#define mP make_pair
#define pB push_back
int dp[10][500];
int main(){
int n;
cin >> n;
int a[2][n + 10];
for(int i = 0 ; i < 2 ; ++i){
for(int j = 0 ; j < n ; ++j){
cin >> a[i][j];
}
}
dp[0][0] = a[0... | 247 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int A[2][N];
int i,j;
for(i=0;i<2;i++){
for(j=0;j<N;j++){
cin >> A[i][j];
}
}
int max = 0;
int sum, k;
for(i=0;i<N;i++){
sum = 0;
k = 0;
for(j=1;j<N;j++){
if(i+1 == j){
k = 1;
}
sum += A[0+k][j-k];
}
if(sum > ... | 180 |
Project_CodeNet | 2,020 | //#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define int long long
#define ll long long
#... | 514 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
//#define DEBUG 1
//#define int long long
#define for0(i,n) for (int i=0; i<n; i++)
#define iter(c) for(auto it=c.begin(); it!=c.end(); it++)
#define iter2(c) for(auto it2=c.begin(); it2!=c.end(); it2++)
#define pb push_back
#define ms(a,z) memset(a,z,sizeof(a));
#define mp make_pair
#define ... | 694 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, max = 0;
cin >> n;
vector< vector<int> > arr (2, vector<int>(n));
for(int i = 0; i < n; i++) cin >> arr[0][i];
for(int i = 0; i < n; i++) cin >> arr[1][i];
for(int i = 0; i < n; i++) {
int count = 0;
for(int j = 0; j < n; j++) {
if(i == j) ... | 210 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(),v.end()
#define pii pair< ll,ll>
#define pb push_back
#define eb emplace_back
#define F first
#define S second
#define mp make_pair
#define ll long long int
#define mod 1000000007
#define mxn 2000002
#define sqr 320
ll pre1[1000]={0},pre2[1000]={0};... | 255 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
//using ll = long long int;
int main()
{
int n;
cin>>n;
int a=0,b=0;
int p[102],q[102]={0};
for(int i=0;i<n;++i){
int buf;
cin>>buf;
a+=buf;
p[i]=a;
}
for(int i=1;i<=n;++i){
int buf;
cin>>buf;
b+=buf;
q[i]=b;
}
int ans=0;... | 158 |
Project_CodeNet | 2,020 | #include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#include<cmath>
#include<map>
#define MN 1005
#define INF 1000000007
using namespace std;
int n;
int a[3][MN];
int sum[3][MN];
int main() {
int i,j;
scanf("%d", &n);
for (i = 1; i <= 2; i++) {
for (j = 1; j <= n; j++) {
scanf("%d", &a[i][j]... | 239 |
Project_CodeNet | 2,018 | #include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
static const int INF = 1000000;
int main() {
int N;
cin >> N;
vector<int>a0(N);
for (int i = 0; i < N; i++) {
cin >> a0[i];
}
vector<int>a1(N);
for (int i = 0; i < N; i++) {
cin >> a1[i];
}
vector<int>dp(N, INF);
int kiten = a0[0... | 252 |
Project_CodeNet | 2,018 |
//File Name: arc090_a.cpp
//Created Time: 2018年02月01日 星期四 22时29分27秒
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 101;
int a[2][MAXN],f[2][MAXN];
int solve(const int n){
for(int i(1);i<=n;++i)
f[0][i] = f[... | 231 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
int arr[200];
for (int i = 0;i < n * 2;i++){
cin >> arr[i];
}
int res[200] = {arr[0]};
for (int i = 1;i < n;i++){
res[i] = res[i - 1] + arr[i];
}
res[n] = res[0] + arr[n];
for (int i = n+1; i... | 161 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cstring>
#include <utility>
#include <vector>
#include <complex>
#include <valarray>
#include <fstream>
#include <cassert>
#include <cmath>
#include <functional>
#includ... | 478 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <stack>
#include <limits>
#include <array>
#include <unordered_map>
#include <unordered_set>
#include <memory>
#include <numeric>
//#include <tuple>
constexpr long long mod = stati... | 300 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n,a[2][105],dp[2][105];
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++) {
if (i>1) {
dp[i][j]=max(dp[i][j],dp[i-1][j]);
}
if (j>1) {
dp[i][j]=max(dp[i][j],dp[i][j-1]);
}
... | 172 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) >= 0; --(i))
#define rep1(i,n) for(ll (i) = 1; (i) < (n); ++(i))
#define rrep1(i,n) for(ll (i) = (n) - 1; (i) >= 1; --(i))
#define nfor(i,a,b) for(ll (i) = (a); (i) < (b); ++(i)... | 468 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <string>
#include <utility>
#include <algorithm>
#include <functional>
#include <climits>
#include <math.h>
#include <iomanip>
#include <fstream>
#include <random>
using namespace std;
inline void InitRand()
{
srand((unsigned int)time(N... | 297 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
int n;
cin>>n;
int ans=0;
int c[2][100];
for(int i=0;i<2;i++){
for(int j=0;j<n;j++){
cin>>c[i][j];
}
}
for(int i=0;i<n;i++){
int sum=0;
for(int j=0;j<n;j++){
if(j<=i)sum+=c[0][j];
if(i<=j)sum+=c[1][j];
}
if(sum... | 147 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
int main()
{
#ifdef jcg
assert(freopen("input.in", "r", stdin));
// assert(freopen("output.out", "w", stdout));
#else
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i)
{
cin >> ... | 223 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<t... | 272 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n; cin>>n;
vector<vector<int>> a(2);
for(auto& v: a) {
v.push_back(0);
for(int i=0; i<n; ++i) {
int t; cin>>t;
v.push_back(v[i]+t);
}
}
int res=0;
for(int i=1; i<=n; ++i)
res=ma... | 136 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std ;
typedef long long ll;
#define forn(i,e) for(ll i=0; i<e; i++)
#define endl "\n"
#define zoom ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define PB push_back
#define MP make_pair
#define F first
#define S second
long long binpow(long long a, long long b,... | 350 |
Project_CodeNet | 2,018 | // #includes {{{
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define RREP(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();++i)
#define LET(x,a) __typeof(a) x(a)
//#define IFOR(i,it,c) for(__typeof((c).begin()... | 1,239 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<vector<int>> a(2,vector<int>(n));
vector<vector<int>> dp(2,vector<int>(n));
rep(i,2){
rep(j,n) cin >> a[i][j];
}
dp[0][0] = a[0][0];
rep(i,n-1){... | 268 |
Project_CodeNet | 2,018 | // 基本テンプレート
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#in... | 488 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <map>
#include <utility>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#define REP(i,a,n) for(int i=a;i<n;++i)
#define rep(i,n) REP(i,0,n)
#defi... | 332 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <math.h>
#include <iomanip>
#include <vector>
#include <queue>
#include <functional>
#include <random>
#include <time.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
int main() {
ll n, a[3][110], ca[110] = {}, ... | 254 |
Project_CodeNet | 2,018 | #include <cmath>
#include <cstdio>
#include <cstring>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int main()
{
ios::sync_with_stdio(false);
... | 259 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n;
cin >> n;
vector<int> a(2*n);
for(int i=0; i<2*n; i++){
cin >> a[i];
}
int max=0;
for(int i=0; i<n; i++){
int sum = 0;
int y=0;
for(int j=0; j<n; j++){
sum += a[y*n+j];
... | 147 |
Project_CodeNet | 2,019 | #include <ios>
#include <iomanip>
#include <iostream>
#include <functional>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <s... | 349 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <uno... | 674 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <string>
#define REP(i, a, b) for (int i = (a); i < (b); i++)
using ll = long long;
using namespace std;
void solve()
{
int n;
cin >> n;
vector<int> a0(n), a1(n);
REP(i, 0, n) cin >> a0[i];
REP(i, 0, n) cin >> a1[... | 226 |
Project_CodeNet | 2,020 | ///////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
#include <unistd.h>
#include <time.h>
#include <sys/time.h>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 0
#define pb push_back
#define V ve... | 1,558 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#include <cstring>
#include <string>
#include <map>
#define pb push_back
using namespace std;
typedef pair<int,int> pii;
int A[3][111];
int B[3][111];
int main(void){
int n;
cin>>n;
int a;
for(int i=1;i<=2;i++){
for(int j=1;j<=n;... | 225 |
Project_CodeNet | 2,018 | #include <stdio.h>
int main(){
int N;
scanf("%d", &N);
int a1[N];
int a2[N];
int i;
int j;
int down_num; // 1 <= down_num <= N
for(i=0; i<N; i++){
scanf("%d", &a1[i]);
}
for(i=0; i<N; i++){
scanf("%d" ,&a2[i]);
}
int max, sum;
for(down_num=1; dow... | 197 |
Project_CodeNet | 2,018 |
#include <bits/stdc++.h>
#define FOR(i,b,e) for(int i=(b); i <= (e); ++i)
#define FORD(i,b,e) for(int i=(b); i >= (e); --i)
#define SIZE(c) (int) (c).size()
#define FORE(i,c) FOR(i,0,SIZE(c)-1)
#define FORDE(i,c) FORD(i,SIZE(c)-1,0)
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using... | 426 |
Project_CodeNet | 2,018 | #include<stdio.h>
#include<string.h>
int main()
{
int a[2][105],i,n,ans,s=0,j;
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=0;i<n;i++)
{
ans=0;
for(j=0;j<n;j++)
{
if(j<i)
an... | 165 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int N = 105;
int a[3][N], dp[3][N];
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]);
}
}
for (int i = 1; i <= 2; i++) {
for (int j = 1; j <= n; j++) {
dp[i][... | 219 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define si(n) scanf("%d",&n)
#define MAX 103
int a[MAX],b[MAX],n;
int main()
{
int i,j;
si(n);
for(i=1;i<=n;i++){
si(a[i]);
a[i]+=a[i-1];
}
for(i=1;i<=n;i++){
si(b[i]);
}
for(i=n-1;i>=1;i--)b[i]+=b[i+1];
int ans=0;
... | 150 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int n;
int p[2][105];
int main(){
cin >> n;
for(int b = 0; b < 2; b++){
for(int i = 1; i <= n; i++){
cin >> p[b][i];
p[b][i] += p[b][i-1];
}
}
int ans = 0;
for(int i = 1; i <= n; i++){
ans = max(ans, p[0][i... | 144 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
#include<string>
#include<map>
#include<list>
#include<queue>
#include<utility>
#include<sstream>
#include<cstdlib>
#include<cctype>
#include<math.h>
#include<set>
#include<stack>
#include<fstream>
#include<numeric>
#include<strin... | 1,185 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <string.h>
#include <set>
#include <map>
#include <unordered_map>
#include <assert.h>
#include <algorithm>
#include <queue>
#include <bitset>
#include <stack>
#include <chrono>
#include <random>
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define ll... | 369 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
using namespace std;
int dp[233][233];
int a[233][233];
int n;
int main()
{
scanf("%d",&n);
for(int j=1;j<=2;j++)
for(int i=1;i<=n;i++)
scanf("%d",&a[i][j]);
dp[1][1]=a[1][1];
for(int i=1;i<=n;i++)
for(int j=1;j<=2;j++)
dp[i][j]=max(dp[i-1][j],dp[i][j-1])+a[i][j];
pri... | 149 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n, a[110], maxt, maxb, v[2][110];
cin >> n;
for(int i = 0; i < 2; i++)
for(int j = 0; j < n; j++)
cin >> v[i][j];
maxt = v[0][0]; maxb = maxt + v[1][0];
for(int i = 1; i < n; i++){
maxt += v[0][i];
maxb = v[1][i] + ... | 150 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll , ll> pair_t;
bool comp(const pair_t &a, const pair_t &b) {
return a.first < b.first;
}
int main(){
ll n , t , x ,y ;
cin >> n ;
vector<int> v1(n) , v2(n);
... | 260 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <functional>
#include <queue>
#include <string>
#include <cstring>
#include <numeric>
#include <cstdlib>
#include <cmath>
#include <map>
#include <unordered_map>
#include <set>
using namespace std;
typedef long long ll;
#define INF ... | 431 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n, a[105], b[105];
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];
b[n-i+1] += b[n-i+2];
}
int ans = 0;
for(int i=1;i<=n;i++) {
ans = max(a... | 150 |
Project_CodeNet | 2,019 | #include <iostream>
#define MAXN 101
using namespace std;
int A[2][MAXN];
int main()
{
int N, x;
cin >> N;
for (int i = 1; i <= N; ++i) {
cin >> A[0][i];
A[0][i] += A[0][i - 1];
}
for (int i = 1; i <= N; ++i) {
cin >> x;
A[1][i] = max(A[0][i], A[1][i - 1]) + x;
}
... | 148 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
using namespace std;
int dp[4][110],a[4][110];
int main(){
int n;
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<=n;j++){
... | 226 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> A1(N);
vector<int> A2(N);
rep(i, N) cin >> A1[i];
rep(i, N) cin >> A2[i];
int calc = 0;
int ans = 0;
rep(i, N) {
rep(j, i + 1) calc += A1[j... | 175 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define F first
#define S second
#define dq deque
#define vc vector
#define INF (0x3f3f3f3f)
#define LINF ((long long)(0x3f3f3f3f))
#define Pb push_back
#define Mp make_pair
#define ll long long
#define _tp template
#define _tyn typename
#define Pf push_front
#define sint short int
#define ull ... | 1,324 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
const int MAX = 100;
int main() {
int N, A[MAX], A2[MAX];
cin >> N;
for (int i = 0;i < N;i ++) cin >> A[i];
for (int i = 0;i < N;i ++) cin >> A2[i];
int max = 0, sum;
for (int i = 1;i < N;i ++) {
A[i] += A[i - 1]; // 累積和
}
for (int i = N - 2;i >= 0;i --) {
A2[i] += A... | 230 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n, a[3][105];
int main() {
scanf("%d", &n);
for (int i = 1; i <= 2; i++)
for (int 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]);
return 0;
}
| 119 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define fr first
#define sc second
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
typedef unsigned long long u64;
const int NMAX = 1e5 + 3, KEK = 1453, CMAX = 'z' - 'a' + 1;
const double EPS = 1e-5;
main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
... | 361 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define int long long
int $(int a,int b) {
if(a%b==0)
return a/b;
else
return a/b+1;
}
signed main(){
int a,d=0;
cin>>a;
vector<int> b(a),c(a);
for(int i=0;i<a;i++)
cin>>b.at(i);
for(int i=0;i<a;i++){
if(i==0)
continue;
b.at(i)+... | 206 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define re... | 276 |
Project_CodeNet | 2,018 | /**
*
*/
// #include {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip>
#includ... | 5,557 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<queue>
#include<utility>
#include<bitset>
#include<complex>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
using namespace ... | 348 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
const int rows = 2;
int dx[2] = {0, 1};
int dy[2] = {1, 0};
int main() {
int N; cin >> N;
vector<vector<int>> A(rows, vector<int>(N));
... | 286 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ld long double
const ld pi = 3.1415926535897932384626433;
const ld eps = 0.0000001;
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;
for(int i = 0; i < n; i+... | 186 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;
int data[2][110];
int ansOut=-1;
int n;
int main(){
scanf("%d",&n);
int ans = 0;
int ans2 = 0;
for(int i=0;i<n;i++){
scanf("%d",&data[0][i]);
ans += data[0][i... | 180 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n,dp[3][111],in[3][111];
int rec(int r,int c)
{
if(r>2 || c>n) return 0;
int &ret=dp[r][c];
if(ret!=-1) return ret;
ret=0;
ret=max(ret,rec(r+1,c));
ret=max(ret,rec(r,c+1));
return ret=ret+in[r][c];
}
int main()
{
cin >> n;
for(int i... | 170 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
const int INF = 1e9;
#define put(n) cout<<(n)<<endl
#define rep(i,N) for(int(i)=0;(i)<(N);++(i))
#define rrep(i,N) for(int (i)=(N-1);(i)>=(0);--(i))
#define all(v) (v).begin() , (v).end()
#define rall(v) (v).rbegin() ,... | 312 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << "... | 523 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<math.h>
#include<queue>
#include<deque>
#include<stack>
#include<cstdio>
#include<utility>
#include<set>
#include<list>
#include<cmath>
#include<stdio.h>
#include<string.h>
#include<iomanip>
using namespace std;
#define FOR(... | 551 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int s[2][105];
int main()
{
int n,cur=0,ans=0;
scanf("%d",&n);
for(int i=0;i<n;i++) scanf("%d",s[0]+i);
for(int i=0;i<n;i++)
{
scanf("%d",s[1]+i);
cur += s[1][i];
}
for(int i=0;i<n;i++)
{
cur += s[0][i];
if(c... | 145 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
int main(){
int n;
cin>>n;
vector<int> a(n);
vector<int> b(n);
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)cin>>b[i];
vector<int> rui(n+1);
rui[0]=a[0];
for(int i=1;i<n+1;i++)rui[i]=rui[i-1]+a[i];
vector<int> rui2(n+1);
rui2[0]=b[0];
for(int i=1;i<... | 231 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int a[3][111];
int dp[3][111];
void solve() {
int m; cin >> m;
for (int i = 1; i <= 2; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
}
}
memset(dp, 0, sizeof dp);
for (int i = 1; i <= 2; i++) {
for (int j = 1... | 194 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,x,a[3][105],dp[3][105];
int main(){
ios_base:: sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
cin>>n;
for(ll i=1;i<=2;i++)for(ll j=1;j<=n;j++)cin>>x,dp[i][j] = x + max(dp[i-1][j] , dp[i][j-1]);
cout<<dp[2][n];
} | 116 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int N;
int a[2][105];
int dp1[105]={0};
int dp2[105]={0};
cin>>N;
for(int i=1;i<=N;i++)
{
cin>>a[0][i];
}
for(int i=1;i<=N;i++)
{
cin>>a[1][i];
}
for(int i=1;i<=N;i++)
{
dp1[i]=dp1[i-1... | 225 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<cmath>
#include<set>
#include<stack>
#define ll long long
#define pb push_back
#define max(x,y) ((x)>(y)?(x):(y))
#define min(x,y) ((x)>(y)?(y):(x))
#define cls(name,x) mem... | 353 |
Project_CodeNet | 2,018 | #include<iostream>
#include <stdio.h>
#include <string.h>
#include <string>
using namespace std;
int main()
{
long long i = 0;
long long j = 0;
long long k = 0;
long long l = 0;
long long m = 0;
long long N;
long long A[100] = {0};
long long B[100] = {0};
long long a = 0;
long long max = 0;
cin >> N;
for... | 243 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
vector<int> A1(N); vector<int> A2(N);
for(int i = 0; i < N; i++){ cin >> A1[i];}
for(int i = 0; i < N; i++){ cin >> A2[i];}
int sum = 0;
for(int i = 0; i < N; i++){
int res = 0;
for(int k = 0; k <= i; k++){
res +... | 172 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int n, A[111111], B[111111];
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%d", &A[i]);
... | 215 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define MAX 10005
#define MOD 1000000007
#define fo(a, b) for (int i = a; i < b; i++)
#define foi(a, b) for (int i = a; i <= b; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main () {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false);
int n; cin... | 274 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int t[101], b[101];
for (int i = 0; i < 101; ++i)
{
t[i] = 0; b[i] = 0;
}
for (int i = 1; i <= n; ++i)
{
int a; cin >> a;
t[i] = a + t[i - 1];
}
for (int i = 1; i <= n; ++i)
{
int a; cin >> a;
b[i] = a;
}
for (int i = 99; i ... | 221 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int dp[2][100] = {};
int func(int i, int j);
int N;
int A[2][100];
int main()
{
cin>>N;
for(int i = 0;i<2;i++)
{
for(int j = 0;j<N;j++)
{
cin>>A[i][j];
}
}
cout<<func(1,N-1)<<endl;
}
int func(int i, int j)
{
if(dp[i][j] > 0) return dp[i][j]... | 260 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
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 nans=0;
for (int j = 0; j < n; ++j)
{
if (j<=i)
{
... | 203 |
Project_CodeNet | 2,018 | #include<stdio.h>
int main(){
int n,m[2][101];
while(~scanf("%d",&n)){
int l,i;
for(l=0;l<2;l++)
for(i=0;i<n;i++)
scanf("%d",&m[l][i]);
for(i=1;i<n;i++){
m[0][i]+=m[0][i-1];
}
m[1][0]+=m[0][0];
for(i=1;i<n;i++){
m[1][i]+=(m[0][i]>m[1][i-1]?m[0][i]:m[1][i-1]);
}
printf("%d\n",m[1][n-1]);
... | 162 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define loop(I, N) for(int I = 1; I <= N; I++)
#define pool(I, N) for(int I = N; I >= 1; I--)
#define rep(I, N) for(int I = 0; I < N; I++)
#define per(I, N) for(int I = N - 1; I >= 0; I--)
#define FOR(I, L, R) for(int I = L; I <= R; I++)
#define FOD(I, R, L) for(int I = R; I... | 303 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
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];
vector< vector<int> > dp(2, vector<int>... | 260 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n, a[5][110], f[5][110];
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... | 167 |
Project_CodeNet | 2,018 | #include <vector>
#include <stack>
#include <stdio.h>
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <typeinfo>
#include <queue>
#include <set>
#include <sstream>
using namespace std;
#define RSORT(c) sort((c).begin(),(c).end(),std::greater<int>())
#define REP(i,n) for(int i=0;i... | 815 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int dp[4][200]={0};
int a[4][200];
int n;cin>>n;
for(int i=1;i<=2;i++)
{
for(int j=1;j<=n;j++)
cin>>a[i][j];
}
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
dp[i][j]=max(dp[i-1][j],dp[i][j-... | 143 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sf scanf
#define pf printf
#define pb push_back
#define mp make_pair
#define PI ( acos(-1.0) )
#define mod 1000000007LL
#define maxn 500005
#define IN freopen("C.in","r",stdin)
#define OUT freopen("output.tx... | 367 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <algorithm>
#include <vector>
#include <iostream>
#include <string>
#include <set>
using namespace::std;
int main(){
int N;
cin >> N;
int A[2][101];
for(int i = 0; i < 2; i++){
for(int j = 0; j < N; j++){
cin >> A[i][j];
}
}
int max_sum = 0;
for(int i = 0; i < N; i++){
in... | 216 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<l... | 667 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.