Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | import java.util.*;
class Main
{
public static void main (String[] args)
{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] a = new int[n];
int[] b = new int[n];
for(int i = 0; i < n; i++) a[i] = sc.nextInt();
for(int i = 0; i < n; i++) b[i] = sc.n... | 239 |
Project_CodeNet | 2,018 | import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) throws IOException
{
Scanner sc = new Scanner(System.in);
int candies_a = 0;
int candies_b = 0;
int n = sc.nextInt();
int[] a = new int[n];
int[] b = new int[n];
a[0] = sc.nextInt();
for(int i=1;i<n;i++)
... | 313 |
Project_CodeNet | 2,019 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual soluti... | 456 |
Project_CodeNet | 2,019 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.util.stream.IntStream;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.UncheckedIOException;
import java.nio.charset.Charset;
import j... | 806 |
Project_CodeNet | 2,018 | import java.io.*;
import java.util.*;
class Main{
public static void main(String[] args){
solve();
}
public static void solve(){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[][] a = new int[2][n];
for(int i=0;i<2;i++){
for(int j=0;j<n;j++){
a[i][j] = sc.nextInt();
}
}
int[]... | 237 |
Project_CodeNet | 2,018 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.Reader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at th... | 962 |
Project_CodeNet | 2,018 | import java.util.Scanner;
import java.util.stream.IntStream;
class Main{
public static void main(String[] args){
Scanner scan = new Scanner(System.in);
int N = scan.nextInt();
int[] a1 = IntStream.range(0,N).map(i->scan.nextInt()).toArray();
int[] a2 = IntStream.range(0,N).map(i->sc... | 167 |
Project_CodeNet | 2,018 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
class Main {
public static void main(String[] args) throws IOException {
ReaderC.init(System.in);
int n = ReaderC.nextInt();
int[][] a ... | 446 |
Project_CodeNet | 2,018 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws NumberFormatException, IOException {
// TODO Auto-generated method stub
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
... | 260 |
Project_CodeNet | 2,019 | import java.util.Scanner;
public class Main {
public static void main(String args[]) {
try (Scanner in = new Scanner(System.in)) {
int N = in.nextInt();
int[][] A = new int[2][N];
for (int i = 0; i < 2; i++) {
for (int j = 0; j < N; j++) {
... | 282 |
Project_CodeNet | 2,019 | /*
* @Author Silviase(@silviasetitech)
* For ProCon
*/
import java.util.*;
import java.lang.*;
import java.math.*;
class Main{
static int MOD = (int)1e9+7;
// for dfs
static int n;
static int ansi;
static int[] w;
static int[] ww;
static boolean[] isvisited;
... | 1,656 |
Project_CodeNet | 2,018 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main
{
public static void main(String[] args) throws IOException
{
BufferedReader r = new BufferedReader(new InputStreamReader(System.in), 1);
String s = r.readLine();
int n = Integer.parseInt(s)... | 270 |
Project_CodeNet | 2,019 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.next());
int[] a1 = new int[n];
int[] a2 = new int[n];
a1[0] = Integer.parseInt(sc.next());
... | 225 |
Project_CodeNet | 2,018 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual soluti... | 475 |
Project_CodeNet | 2,020 |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) {
InputStream inputS... | 527 |
Project_CodeNet | 2,019 | import java.util.*;
import java.io.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[][] map = new int[2][N];
for(int i=0; i<2; i++)
for(int j=0; j<N; j++)
map[i][j] = sc.nextInt();
... | 246 |
Project_CodeNet | 2,018 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedInputStream;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.FileInputStream;
import java.io.Writer;
import java.io.... | 1,352 |
Project_CodeNet | 2,018 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[][] A = new int[2][N];
for (int i = 0; i < 2; i++) {
for (int j = 0 ; j < N ; j++) {
A[i][j] = sc.nextInt();
}
}
int sum = A[0][0];
for (int ... | 207 |
Project_CodeNet | 2,019 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[][] candies = new int[2][n];
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++) {
candies[i][j] ... | 416 |
Project_CodeNet | 2,018 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.util.InputMismatchException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Bui... | 462 |
Project_CodeNet | 2,018 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int[][] dp = new int[2][n];
for(int i=0;i<n;i++) {
if(i==0) {
dp[0][0]=sc.nextInt();
} else {
dp[0][i]=sc.nextInt()+dp[0][i-1]... | 206 |
Project_CodeNet | 2,020 | import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;
public class Main {
public static void main(String[] args) {
FastScanner sc = new FastScanner();
int N = sc.nextInt();
int[][] A = new int[3][N + 1];
for (int i = 1; i <= N; i++)
A[1][i] = sc.nextInt();
for... | 937 |
Project_CodeNet | 2,018 | import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;
public class Main {
private static FastScanner sc = new FastScanner();
public static void main(String[] args) {
int N = sc.nextInt();
int[] A1 = new int[N];
for(int i=0; i<N; i++) {
A1[i] = sc.nextInt();
}
... | 550 |
Project_CodeNet | 2,018 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.stream.IntStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.util.StringTokenizer;
import java.io.Bu... | 464 |
Project_CodeNet | 2,018 |
public class Main {
private static void solve() {
int n = ni();
int[][] a = ntable(2, n);
int ret = 0;
for (int i = 0; i < n; i ++) {
int now = 0;
for (int j = 0; j <= i; j ++) {
now += a[0][j];
}
for (int j = i; j < n; j ++) {
now += a[1][j];
}
ret = Math.max(now, ret);
}
Syste... | 726 |
Project_CodeNet | 2,018 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) {
FastScanner scan = new FastScanner();
PrintWriter out = new PrintWriter(... | 636 |
Project_CodeNet | 2,018 | import java.util.*;
import java.io.*;
import java.math.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
public class Main{
static final long mod=1000000007;
public static void main(String[] args) throws Exception, IOException{
Read... | 590 |
Project_CodeNet | 2,018 | import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Optional;
import java.util.Scanner;
import java.util.Set;
import java.util.stream.IntStream;
public class Main {
public static void main(String[] args) {
Main main = new Main... | 4,060 |
Project_CodeNet | 2,020 |
import java.util.Scanner;
public class Main {
static Scanner scanner;
public static void main(String[] args) {
scanner = new Scanner(System.in);
int N=gi();
int[][] A=new int[2][N];
for(int i=0; i<2;i++) {
for(int j=0; j<N;j++) {
A[i][j]=gi();
}
... | 281 |
Project_CodeNet | 2,018 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int[] a1=new int[n];
int[] a2=new int[n];
int[] s1=new int[n];
int[] s2=new int[n];
for(int i=0;i<n;i++) a1[i]=sc.nextInt();
for(int i=0;i<n;i++) a2[i]=sc.... | 218 |
Project_CodeNet | 2,018 | import java.io.*;
import java.util.*;
public class Main {
private static Scanner sc;
private static Printer pr;
private static void solve() {
int n = sc.nextInt();
int[] a1 = new int[n];
int[] a2 = new int[n];
for (int i = 0; i < n; i++) {
a1[i] = sc.nextInt();
}
for (int i = 0; i < n; i++) {
... | 1,209 |
Project_CodeNet | 2,020 | import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.Scanner;
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolea... | 1,747 |
Project_CodeNet | 2,019 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner((System.in));
int n = sc.nextInt() ;
int[][] a = new int[2][n];
for(int i = 0; i < 2; i++) {
for(int j = 0; j < n; j++) {
a[i][j] = sc.nextInt();
}
}
int max = 0;
int sum = 0;
for... | 215 |
Project_CodeNet | 2,018 | import java.io.*;
import java.util.*;
public class Main {
private static final int mod = (int) 1E9 + 7, bufsize = (1 << 13);
private static int iNextByte, iNextIndex, iReadByteCount, oNextIndex;
private static final byte ibuf[] = new byte[bufsize], obuf[] = new byte[bufsize];
private static InputStream input = Sys... | 1,606 |
Project_CodeNet | 2,018 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
public class Main {
final int _intMax = Integer.MAX_VALUE; // =2147483647>10^9
final int _intMin = Integer.MIN_VALUE;
final long _longMax = Long.MAX_VALUE; // =9223372036854775807L>10^18
final l... | 744 |
Project_CodeNet | 2,019 | import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[][] A = new int[2][N+1];
int[] t0 = new int[N+1];
int[] t1 = new int[N+1];
int[] ans = new int[N+1];
int total0 = 0,total1 = 0;
for( int i=1; i<=N; i++ ){
A[... | 255 |
Project_CodeNet | 2,019 | import java.util.*;
public class Main {
public static void main (String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = sc.nextInt();
if (i != 0) {
arr[i] += arr[i - 1];
}
}
int ans = 0;
for (int i = 0; i < ... | 150 |
Project_CodeNet | 2,018 | import java.util.*;
import java.io.*;
public class Main {
void solve() {
int n = in.nextInt();
int[][] a = new int[2][n];
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++) {
a[i][j] = in.nextInt();
}
}
int best = 0;
for (int i = 0; i < n; i++) {
int ans = 0;
for (int j = 0; j <... | 432 |
Project_CodeNet | 2,018 | import java.io.*;
import java.util.*;
public class Main {
void submit() {
int n = nextInt();
int[][] a = new int[2][n];
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++) {
a[i][j] = nextInt();
}
}
int[][] b = new int[2][n];
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++)... | 491 |
Project_CodeNet | 2,018 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper... | 577 |
Project_CodeNet | 2,018 | /*
* 2×N のマス目があります。上から i 行目、左から j 列目 (1≤i≤2, 1≤j≤N) のマスをマス (i,j) と表すことにします。
*
* あなたははじめ、左上のマス (1,1) にいます。 あなたは、右方向または下方向への移動を繰り返し、右下のマス (2,N) に移動しようとしています。
*
* マス (i,j) には Ai,j 個のアメが置かれています。 あなたは移動中に通ったマスに置いてあるアメをすべて回収します。
* 左上および右下のマスにもアメが置かれており、あなたはこれらのマスに置かれているアメも回収します。
*
* 移動方法をうまく選んだとき、最大で何個のアメを回収できるでし... | 517 |
Project_CodeNet | 2,018 | import java.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.Set;
import java.util.... | 503 |
Project_CodeNet | 2,018 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
static PrintWriter out;
static InputReader ir;
static void solve() {
int n=ir.nextInt();
int[][] a=new int[2][];
for(int i... | 967 |
Project_CodeNet | 2,018 | import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// 標準入力
Scanner sc = new Scanner(System.in);
String line0 = sc.nextLine();
String line1 = sc.nextLine();
String line2 = sc.nextLine();
List<String> lines1 = Arrays.asLis... | 275 |
Project_CodeNet | 2,018 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Pradyumn
*/
public class M... | 759 |
Project_CodeNet | 2,018 | var n:longint;
f,a:array[0..10,0..1000]of longint;
i,j:longint;
function max(a,b:longint):longint;
begin
if a>b then exit(a) else exit(b);
end;
begin
read(n);
for i:=1 to 2 do
begin
for j:=1 to n do
read(a[i,j]);
readln;
end;
for i:=1 to 2 do
for j:=1 to n do
f[i,j]:=max(f[i-1,j],f[... | 151 |
Project_CodeNet | 2,018 | var
n,i,s,t,ans:Longint;
a,b:array[1..100]of Longint;
begin
read(n);
for i:=1 to n do read(a[i]);
for i:=1 to n do begin
read(b[i]);
inc(t,b[i]);
end;
for i:=1 to n do begin
inc(s,a[i]);
if ans<s+t then ans:=s+t;
dec(t,b[i]);
end;
writeln(ans);
end.
| 106 |
Project_CodeNet | 2,018 | import sequtils,strutils,math
var
N = stdin.readline.parseInt
A = newSeq[seq[int]](2)
ans : int
S : int
A[0] = stdin.readline.split.map(parseInt)
A[1] = stdin.readline.split.map(parseInt)
ans = sum(A[1]) + A[0][0]
S = ans
for i in 1..<N:
S -= A[1][i - 1]
S += A[0][i]
ans = max(ans, S)
echo a... | 118 |
Project_CodeNet | 2,020 | import strutils, sequtils
proc solve() =
var
N = stdin.readLine.parseInt
A1 = stdin.readLine.split.map(parseInt)
A2 = stdin.readLine.split.map(parseInt)
dp: array[101, array[2, int]]
dp[1][0] = A1[0]
dp[1][1] = A1[0] + A2[0]
for i in 1..<N:
dp[i+1][0] = dp[... | 162 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define ll long long
using namespace std;
void qmax(int &x,int y) {if (x<y) x=y;}
void qmin(int &x,int y) {if (x>y) x=y;}
int read()
{
char s;
int k=0,base=1;
while((s=getchar())!='-'&&s!=EOF&&!(isdigit(s)));
if(s==EOF)exit(0);if(s=='-')base=-1,s=getchar();
while(isdigit(s))... | 308 |
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 ALL(x) (x).begin(), (x).end()
const long long INF = 1e18;
using namespace std;
typedef long l... | 333 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define BUF (1000)
#define ll long long
int n;
int A[2][BUF];
int main(void){
cin >> n;
for(int i=1;i<=n;i++) cin >> A[0][i];
for(int i=1;i<=n;i++) cin >> A[1][i];
int ans=0;
for(int i=1;i<=n;i++){
int tmp=0;
for(int j=1;j<=i;j++)tmp+=A[0][j];
for(int j=i;... | 155 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
int N;
int A[2][100];
cin >> N;
for(int j=0;j<N;j++){
cin >> A[0][j];
}
for(int j=0;j<N;j++){
cin >> A[1][j];
}
int max=0;
for(int i=0;i<N;i++){
int count=0;
for(int j=0;j<=i;j++){
cou... | 158 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
int n;
int a[2][100];
int main() {
int i, j;
cin >> n;
for (i = 0; i < 2; i++)
for (j = 0; j < n; j++)
cin >> a[i][j];
//i回右に移動してから下に移動
int ans = 0;
for (i = 0; i < n; i++) {
int s = 0;
for (j = 0; j <= i; j++) s += a[0][j];
for (j = i... | 179 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;cin >> n;
vector<int> a(n+1);
vector<int> b(n+1);
rep(i,n) cin >> a.at(i+1);
... | 179 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
using namespace std;
int n;
int a[3][303];
int x;
int main(){
scanf("%d",&n);
for(int i=1;i<=2;i++){
for(int j=1;j<=n;j++){
scanf("%d",&x);
a[i][j] = max(a[i-1][j],a[i][j-1]) + x;
}
}
printf("%d\n", a[2][n]);
}
| 106 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
inline void read(int &x){
x=0;
int p=1;
char c=getchar();
while(!isdigit(c)){
if(c=='-')p=-1;
c=getchar();
}
while(isdigit(c)){
x=(x<<1)+(x<<3)+(c^'0');
c=getchar();
}
x*=p;
}
int n;
int a[105],b[105],ans;
int main(){
read(n);
for(register int i=1;i<=n;++i)... | 202 |
Project_CodeNet | 2,019 | #include <iostream>
#include <fstream>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <unordered_set>
#include <bitset>
typedef long long ll;
using std::vector;
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typenam... | 522 |
Project_CodeNet | 2,018 | # include<stdio.h>
# include<string.h>
int main()
{
int n;
scanf("%d",&n);
int a[2][n],b[n],max;
memset(b,0,sizeof(b));
for(int i=0;i<2;i++)
for(int j=0;j<n;j++)
scanf("%d",&a[i][j]);
for(int i=0;i<n;i++)
{
for(int j=0;j<i+1;j++)
b[i]+=a[0][j];
for(int j=i;j<n;j++)
b[i]+=a[1][j];
}
max=b[0];
fo... | 169 |
Project_CodeNet | 2,018 | /* AtCoder ARC090C Candies
1st Edition:2018.1.28 Sunday
Algorithm:Greedy
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
#include <map>
#include <set>
#include <bitset>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <c... | 521 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const long long MOD=1e9+7;
const double PI=3.14159265359;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
vector<vector<int>> v(2,vector<int>(n,0)), dp=v;
for(int i=0; i<2; i++){
for(int &j: v[... | 246 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n,x,a[2][205];
int main(){
scanf("%d",&n);
for (int j=0;j<2;++j)
for (int i=1;i<=n;++i) scanf("%d",&a[j][i]);
for (int i=1;i<=n;++i) a[0][i]=a[0][i-1]+a[0][i];
for (int i=n;i;--i) a[1][i]+=a[1][i+1];
for (int i=1;i<=n;++i) x=max(a[0][i]+a[1][i],x);
printf("%d\n",... | 158 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
constexpr int MAX_N = 100;
int N;
int A[2][MAX_N], csum[2][MAX_N];
int main(){
std::cin >> N;
for(int i = 0; i < 2; ++i){
for (int j = 0; j < N; ++j){
std::cin >> A[i][j];
if(j != 0){
csum[i][j] = csum[i][j - 1] + A[i][j];
}
else{
csum[i][j] = A[i][j... | 258 |
Project_CodeNet | 2,018 | /*
ID:njbxgub1
PROG:palsquare
LANG:C++
*/
//******************
//* I<3 C++ *
//* I WANT ANY AC *
//* I LOVE PROGRAM!*
//*IT'S INTERESTING*
//* I LOVE PROGRAM!*
//* IN CONTESTS *
//* GET SCORE *
//* AC CODE *
//* LET'S *
//* GO *
//* Written by: *
//* gbc *
//*******... | 390 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <list>
#include <cassert>
#include <ctime>
#include... | 439 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
signed main() {
std::ios::sync_with_stdio(false);
int N;
std::cin >> N;
std::vector<std::vector<int>> A(2, std::vector<int>(N));
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < N; ++j) {
std::cin >> A[i][j];
}
}
std::vector<std::v... | 301 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define ll long long int
#define mod 1000000007
#define pii pair<int, int>
#define fr(n) for (int i = 0; i < n; i++)
#define fr1(n) for (int i = 1; i <= n; i++)
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, a[102] = {}, b[102] = {}, z = 0;
cin >> n;
fr1(... | 187 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
#define REP(i,n) for(ll i=0;i<ll(n);++i)
#define RREP(i,n) for(ll i=ll(n)-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<ll(n);++i)
#define RFOR(i,m,n) for(ll i=ll(n)-1;i>=ll(m);--i)
#define ALL(v) (v).begin(),(v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v... | 470 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int N=105;
int n;
int a[2][N],dp[N][2];
int main(){
int i,j;
scanf("%d",&n);
for (i=0;i<2;i++) for (j=1;j<=n;j++) scanf("%d",&a[i][j]);
dp[1][0]=a[0][1];
for (i=1;i<=n;i++){
d... | 210 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 1000000000
#define MOD 1000000007
typedef long long ll... | 340 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cmath>
using namespace std;
int a[2][120], n;
int main()
{
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] + a[0][i];
}... | 215 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <map>
#include <vector>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
using namespace std;
int main()
{
int n;
int m[2][110];
int max = -1;
cin >> n;
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++) {
... | 206 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
int N = 0;
int main(int argc, const char * argv[]) {
// insert code here...
cin >> N;
vector<vector<int>> candies(2, vector<int>(N, 0));
vector<vector<int>> sum(2, vector<int>(N, 0));
for (int i = 0; ... | 269 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<functional>
#include<fstream>
#include<utility>
#include<bitset>
#define rep(N) for (int i = 0; i < N; i++)
#define For(i, N) for (i = 0; i < N; i++)
#define rev(N) for (int i = N - 1; i >= 0; --i)
#define all(v) v.begin(), v.end()
#defi... | 382 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define INF 2e9
#define mod 1000000007
#define abs(x) ((x)>=0?(x):-(x))
#define y1 solai
#define fi first
#define se second
typedef long long ll;
void read(ll &x)
{
scanf("%lld",&x);
}
void read(ll &x, ll &y)
{
scanf("%lld%lld",&x,&y);
}
void read(ll ... | 306 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int n;
int arr[2][101];
int dp[2][101];
int solve(int i,int j)
{
if(i>1 || j>=n)
return 0;
if(i==1 && j==n-1)
return arr[i][j];
int &ret=dp[i][j];
if(ret!=-1)
return ret;
ret=0;
return ret=ma... | 194 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#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 pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long l... | 350 |
Project_CodeNet | 2,018 |
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <i... | 668 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdint>
#include <utility>
#include <tuple>
#include <vector>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <limits>
#include <numeric>
#include <iomanip>
using namespace std;
// Type aliases
using i8 = int8_t; using ... | 2,469 |
Project_CodeNet | 2,020 | #include<cstdio>
int a[105][2];
int f[105][2];
int max(int a,int b){ return a>b?a:b; }
int main(){
int n;
scanf("%d",&n);
for(int t = 0; t < 2; t++){
for(int i = 1; i <= n; i++) scanf("%d",&a[i][t]);
}
f[0][0] = 0;
for(int i = 1; i <= n; i++){
f[i][0] = f[i-1][0]+a[i][0];
... | 174 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<double,double> pd;
typedef ve... | 449 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#include <iomanip>
#define rep(i,N) for(int i=0;i<(int)N;++i)
//cout << fixed << setprecision(20) << ... | 268 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 121;
int best[2][MAXN];
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n;
cin >> n;
for(int z = 0; z < 2; z++){
for(int i = 0; i < n; i++){
int a;
cin >> a;
int maxv = 0;
if(z > 0){
maxv = max(maxv, best[z-1][i]);
}
if(i... | 179 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
#define INF_LL (ll)1e18
#define INF (int)1e9
#... | 338 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[3][105];
int d[3][105];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cerr.tie(nullptr);
cin >> n;
for (int i=1; i<=n; i++) {
cin >> a[1][i];
}
for (int i=1; i<=n; i++) {
cin >> a[2][i];
}
for (int i=1; i<=... | 182 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;
int main() {
long long a, b, c, d = 0, e = 0, f = 0;
cin >> a;
int test[101] = { 0 };
int uiop[101] = { 0 };
for (int h = 1; h <= a; h++) {
cin >> b;
test[h] = b;
}
for (int i = 1; i <= a; i++) {
cin >> c;
uiop[i... | 227 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int N;
int A[2][110];
int g[2][110];
int main() {
cin >> N;
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < N; ++j) {
cin >> A[i][j];
}
}
for(int i = 0; i < 2; ++i) {
for(int j = 0; j < N; ++j... | 216 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <cstdlib>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdio>
#include <iomanip>
#include <utility>
#include <unordered_map>
... | 303 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int n,a[2][110],dp[2][110];
int main()
{
cin>>n;
for(int i=0;i<n;i++) cin>>a[0][i];
for(int i=0;i<n;i++) cin>>a[1][i];
dp[0][0]=a[0][0];
dp[1][0]=a[0][0]+a[1][0];
for(int j=1;j<n;j++)
for(int i=0;i<2;i++)
{
if(i==0) dp[i][j]=dp[i][j-1]+a[i][j];
else dp[i][j]=... | 229 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
long long GCD(long long a, long long b)
{
if(b==0)
return a;
return GCD(b, a%b);
}
long long LCM(long long a, long long b)
{
long long gcd=GCD(a,b);
return (a*b)/gcd;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
... | 257 |
Project_CodeNet | 2,018 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <functional>
#include <sstream>
#include... | 321 |
Project_CodeNet | 2,018 | #include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define maxn 1005
using namespace std;
typedef long long ll;
int n=2,m;
ll a[maxn][maxn];
ll dp[maxn][maxn];
int main()
{
scanf("%d",&m);
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
scanf("%lld",&a[i][j]);
ll ans=a[1][1];
for(int i=1;i... | 215 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define fto(i, x, y) for(int i = (x); i <= (y); ++i)
#define fdto(i, x, y) for(int i = (x); i >= (y); --i)
#define ftoa(i, x, y, a) for(int i = (x); i <= (y); i += a)
#define ftoit(it, var) for (__typeof(var.begin()) it = var.begin(); it != var.end(); ++it)
#define ii pair<int, int>
#define m... | 353 |
Project_CodeNet | 2,018 | #include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##... | 382 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
using namespace std;
int a[105][105];
int main(){
int n,sum = 0,cnt = 0;
cin >> n;
for(int i = 1;i <= n;i++) cin >> a[1][i];
for(int i = 1;i <= n;i++) cin >> a[2][i];
for(int i = 1;i <= n;i++){
cnt = 0;
for(int j = 1;j ... | 158 |
Project_CodeNet | 2,018 | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define ... | 292 |
Project_CodeNet | 2,018 | #include <iostream>
#include <stdio.h>
int main(void){
int N;
scanf("%d", &N);
int A1[100] = {0};
int A2[100] = {0};
for(int i = 0; i<N; i++){
scanf("%d", &(A1[i]));
}
for(int i = 0; i<N; i++){
scanf("%d", &(A2[i]));
}
unsigned long int max = 0;
unsigned long i... | 219 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
long long n,a[3][200]={0},res=0,pref1[200]={0},pref2[200]={0};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
for (int i=1; i<=n; i++) cin>>a[1][i];
for (int i=1; i<=n; i++) cin>>a[2][i];
for (int i=1; i<=n; i++){
pref1[i] = pref1[i-1]+a[1][i];... | 201 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <algorithm>
#include <cstdlib>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair < double,double> pt;
typedef pair < int,int> pii;
const in... | 318 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< "... | 420 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.