Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | n=int(input())
a=[list(map(int,input().split()))for i in range(2)]
v=[]
for i in range(n):
tmp=sum(a[0][0:i+1])+sum(a[1][i:])
v.append(tmp)
print(max(v)) | 56 |
Project_CodeNet | 2,020 | def resolve():
import sys
input = sys.stdin.readline
# 整数 1 つ
n = int(input())
# 整数複数個
# a, b = map(int, input().split())
# 整数 N 個 (改行区切り)
# N = [int(input()) for i in range(N)]
# 整数 N 個 (スペース区切り)
# N = list(map(int, input().split()))
# 整数 (縦 H 横 W の行列)
A = [list(map(int,... | 299 |
Project_CodeNet | 2,018 | N = input()
A = [map(int, raw_input().split())]
A.append(map(int, raw_input().split()))
dp = [[0] * (N + 1) for _ in range(2 + 1)]
for i in range(0, 2):
for j in range(0, N):
dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]) + A[i][j]
print dp[2][N]
| 111 |
Project_CodeNet | 2,018 | N = int(input())
A = []
temp1 = map(int, input().split())
temp2 = map(int, input().split())
#A[0] = [int(input()) for i in range(N)]
#A[1] = [int(input()) for i in range(N)]
A.append(list(temp1))
A.append(list(temp2))
dp = [[0 for i in range(N)] for j in range(2)]
dp[0][0] = A[0][0]
dp[1][0] = dp[0][0] + A[1][0]
for... | 231 |
Project_CodeNet | 2,018 | n,a,b = int(input()),list(map(int,input().split())),list(map(int,input().split()))
print(max([sum([a[j] for j in range(0,i+1)])+sum([b[j] for j in range(i,n)]) for i in range(n)])) | 59 |
Project_CodeNet | 2,019 | N = int(input())
A1 = [int(x) for x in input().split()]
A2 = [int(x) for x in input().split()]
acc1, acc2 = [0], [0]
for i in range(N):
acc1.append(acc1[-1] + A1[i])
acc2.append(acc2[-1] + A2[i])
ans = 0
for i in range(N):
ans = max(ans, acc1[i+1] + acc2[-1] - acc2[i])
print(ans)
| 116 |
Project_CodeNet | 2,018 | n = int(input())
arr = []
arr.append(map(int,raw_input().split()))
arr.append(map(int,raw_input().split()))
dp = [[0 for i in range(n)] for j in range(2)]
dp[0][0] = arr[0][0]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + arr[0][i]
dp[1][0] = dp[0][0] + arr[1][0]
for i in range(1,n):
dp[1][i] = max(dp[1][i-1] + a... | 161 |
Project_CodeNet | 2,019 | n,*a=map(int,open(0).read().split());print(max(sum(a[:i+1]+a[n+i:])for i in range(n))) | 34 |
Project_CodeNet | 2,018 | # coding: UTF-8
n = int(input())
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
tile = [a1, a2]
x, y = 0, 0
score = 0
def move(i, x, y):
score = tile[y][x]
for j in range(i):
x, y = right(x, y)
score += tile[y][x]
x, y = under(x, y)
score += tile[y][x]
for... | 251 |
Project_CodeNet | 2,019 | # -*- coding: utf-8 -*-
def main():
n = int(input())
a = [list(map(int, input().split())) for _ in range(2)]
ans = 0
for i in range(n):
ans = max(ans, sum(a[0][:i + 1]) + sum(a[1][i:]))
print(ans)
if __name__ == '__main__':
main()
| 90 |
Project_CodeNet | 2,018 | from itertools import accumulate
n = int(input())
a1 = list(accumulate(map(int, input().split())))
a2 = list(accumulate(map(int, input().split())))
s2 = a2[-1]
ans = a1[0]
for i in range(1, n):
ans = max(ans, a1[i] - a2[i - 1])
print(ans + s2)
| 84 |
Project_CodeNet | 2,018 | def find_max(n, grid):
def helper(idx, cur_max, down):
if n > (idx + 1):
if down:
return helper(idx + 1, cur_max + grid[1][idx], down)
else:
return max(helper(idx + 1, cur_max + grid[1][idx], True), helper(idx + 1, cur_max + grid[0][idx + 1], False))
... | 180 |
Project_CodeNet | 2,019 | N=int(input())
A=list(map(int,input().split(' ')))
B=list(map(int,input().split(' ')))
candy=[]
candy.append(A[0]+sum(B))
for i in range(N-1):
candy.append(candy[-1]-B[i]+A[i+1])
print(max(candy)) | 66 |
Project_CodeNet | 2,019 | # 要素数を取得
num = gets.to_i
# 要素値を取得
ue = gets.split(' ')
shita = gets.split(' ')
#p ue.class
#p ue
# 最初に右にi移動するとする
# i =< num - 1
i_min = 0
i_max = num - 1
ue_sum = 0
shita_sum = 0
candi_num = 0
for i in i_min..i_max do
for u_num in 0..i do
ue_sum += ue[u_num].to_i
end
for s_num in i..i_max do
shita_sum +... | 267 |
Project_CodeNet | 2,020 | def get_i() #空白区切の入力を数値(整数)の配列で返す
return gets.chomp.split(" ").map(&:to_i)
end
def get_f() #空白区切の入力を数値(実数)の配列で返す
return gets.chomp.split(" ").map(&:to_f)
end
def get() #空白区切の入力を文字列の配列で返す
return gets.chomp.split(" ")
end
def get_nsp() #入力されたものを一文字ずつに区切った文字列の配列で返す
return gets.chomp.split("")
end
def yn_judge(bool... | 510 |
Project_CodeNet | 2,018 | def main()
n = gets.to_i
row1 = gets.split.map { |t| t.to_i }
row2 = gets.split.map { |t| t.to_i }
candies = []
for i in 0..n-1
candies.push((row1[0..i] + row2[i..-1]).inject(:+))
end
puts candies.max
end
main if __FILE__ == $0
| 97 |
Project_CodeNet | 2,018 | n = gets.chomp.to_i
a1 = gets.chomp.split(" ").map(&:to_i)
a2 = gets.chomp.split(" ").map(&:to_i)
max = 0
for i in 0..(n-1) do
sum = 0
for j in 0..(n-1) do
if j < i then
sum = sum + a1[j]
elsif j > i then
sum = sum + a2[j]
else
sum = sum + a1[j] + a2[j]
end
end
if sum > max t... | 146 |
Project_CodeNet | 2,018 | n=gets.to_i
a=gets.split.map &:to_i
b=(gets.split.map &:to_i).reverse
c=[a[0]];d=[b[0]]
for k in 1...n
c<<c[-1]+a[k]
d<<d[-1]+b[k]
end
m=0
for k in 0...n
s=c[k]+d[n-k-1]
m=s if m<s
end
p m | 98 |
Project_CodeNet | 2,018 | n = gets.to_i
a = gets.split.map &:to_i
b = gets.split.map &:to_i
x = 0
(n-1).times{|i|
cnt = b[i..-1].inject(:+) + a[0..i].inject(:+)
x = cnt if x < cnt
}
puts (n!=1)? x : (a[0]+b[0])
| 87 |
Project_CodeNet | 2,018 | *a,n=`tac`.split;p (0..n=n.to_i).map{|i|eval a[i,n+1]*?+}.max | 31 |
Project_CodeNet | 2,018 | n = gets.chomp.to_i
a1 = gets.chomp.split.map(&:to_i)
a2 = gets.chomp.split.map(&:to_i)
(1..(n-1)).each do |i|
a1[i] = a1[i-1] + a1[i]
a2[n-1-i] = a2[n-1-i] + a2[n-i]
end
max = 0
(0..(n-1)).each do |i|
max = a1[i] + a2[i] if max < a1[i] + a2[i]
end
printf("%d\n",max) | 134 |
Project_CodeNet | 2,018 | N = gets.to_i
A1 = gets.split.map(&:to_i)
A2 = gets.split.map(&:to_i)
sum1 =0
sum2 =0
A1.each{|i| sum1 += i }
A2.each{|i| sum2 += i }
sum1 -= A1[0]
sum2 -= A2[N-1]
i =0
max =sum1
while i < N-1 do
max=sum1 if max < sum1
max=sum2 if max < sum2
sum1 -= A1[i+1]
sum2 += A1[i+1]
sum2 -= A2[i]
i+=1
end
p max+A1[0]... | 160 |
Project_CodeNet | 2,018 | n = gets.to_i
r1 = gets.split.map(&:to_i)
r2 = gets.split.map(&:to_i)
h = []
n.times{|i|
h.push( r1[0,i+1].inject(:+) + r2[i,n].inject(:+))
}
p h.max | 62 |
Project_CodeNet | 2,018 | n = gets.to_i
a = gets.split.map(&:to_i)
b = gets.split.map(&:to_i)
r = []
n.times do |i|
s = 0
n.times do |j|
s += if j < i
a[j]
elsif j > i
b[j]
else
a[j] + b[j]
end
end
r << s
end
p r.sort[-1]
| 98 |
Project_CodeNet | 2,020 | n = gets.to_i
a = []
a[0] = gets.split.map(&:to_i)
a[1] = gets.split.map(&:to_i)
for i in 1...n do
a[0][i] += a[0][i - 1]
end
a[1][0] += a[0][0]
for i in 1...n do
a[1][i] += [a[0][i], a[1][i - 1]].max
end
puts a[1][n - 1]
| 121 |
Project_CodeNet | 2,018 | n = gets.to_i
a = gets.chomp.split.map(&:to_i)
b = gets.chomp.split.map(&:to_i)
(1...n).each do |i|
a[i] = a[i] + a[i - 1]
end
(1...n).reverse_each do |i|
b[i - 1] = b[i] + b[i - 1]
end
puts a.zip(b).map{|c| c.inject(:+)}.max | 99 |
Project_CodeNet | 2,018 | n = gets.to_i
a = gets.split.map(&:to_i)
b = gets.split.map(&:to_i)
x = Array.new(n){|i|i}.map do |i|
a[0..i].inject{|r, i| r+i } + b[i..-1].inject{|r, i| r+i }
end.max
puts x | 76 |
Project_CodeNet | 2,018 | n = gets.to_i
a1 = gets.split.map(&:to_i)
a2 = gets.split.map(&:to_i)
n.times do |i|
next if i.zero?
a1[i] += a1[i - 1]
a2[i] += a2[i - 1]
end
max = 0
n.times do |i|
if i.zero?
max = a1[0] + a2[-1]
else
cand = a1[i] + a2[-1] - a2[i - 1]
max = cand if max < cand
end
end
p max | 136 |
Project_CodeNet | 2,018 | eval"N,*A="+`dd`.split*?,;a,b=[A.pop(N),A].map{|a|[s=0]+a.map{|n|s+=n}};p N.times.map{|i|a[N]-a[i]+b[i+1]}.max | 59 |
Project_CodeNet | 2,020 | N=gets.to_i
a1=gets.split.map(&:to_i)
a2=gets.split.map(&:to_i)
i = 1
s1 = a1[0]
s2 = a1[0]+a2[0]
while i < N
s1 += a1[i]
s2 = [s1,s2].max + a2[i]
i += 1
end
puts s2
| 93 |
Project_CodeNet | 2,018 | n = gets.to_i
xs = [gets.split.map(&:to_i), gets.split.map(&:to_i)]
memo = [[0] * n, [0] * n]
2.times do |i|
n.times do |j|
memo[i][j] =
if i == 0
if j == 0
xs[0][0]
else
memo[i][j-1] + xs[i][j]
end
else
if j == 0
memo[i-1][j] + xs[i][j]
else
[... | 168 |
Project_CodeNet | 2,018 | *a,n=`tac`.split;p (0...n=n.to_i).map{|i|eval a[i,n+1]*?+}.max | 31 |
Project_CodeNet | 2,020 | N = gets.to_i
A0 = gets.split.map(&:to_i)
A1 = gets.split.map(&:to_i)
max = 0
0.upto(N - 1) do |i|
tmp = 0
0.upto(i) {|j| tmp += A0[j] }
i.upto(N - 1) {|j| tmp += A1[j] }
max = tmp if max < tmp
end
puts max | 101 |
Project_CodeNet | 2,018 | using System;
using System.IO;
using System.Collections.Generic;
using System.Linq;
namespace ARC090
{
public class Program
{
void Solve(StreamScanner ss, StreamWriter sw)
{
//---------------------------------
var N = ss.Next(Int);
var A1 = ss.Next(Int, N);
... | 489 |
Project_CodeNet | 2,018 | using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using System.Globalization;
using System.Diagnostics;
class Myon
{
public Myon() { }
public static int Main()
{
new Myon().calc();
return 0;
}
Scanner... | 563 |
Project_CodeNet | 2,018 | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Diagnostics;
using System.IO;
namespace AtCoder
{
class Program
{
private static string Read() { return Console.ReadLine(); }
private static int ReadInt() { return int.Parse(Read()); }
pri... | 306 |
Project_CodeNet | 2,018 | using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Reflection.Emit;
using System.Text;
using static System.Console;
using static System.Math;
//using CS_Contest.Graph;
using CS_Contest.Loop;
using... | 2,180 |
Project_CodeNet | 2,018 | using System;
using System.Linq;
using System.Collections.Generic;
class Program
{
static int n;
static int[,] map;
static void Main()
{
n = int.Parse(Console.ReadLine());
int[][] a = Enumerable.Repeat(0, 2).Select(_ => Console.ReadLine().Split(' ').Select(int.Parse).ToArray()).ToArray(... | 326 |
Project_CodeNet | 2,018 | using System;
using System.Linq;//リストの使用
using System.Collections.Generic;
class Program
{
static void Main()
{
long n = long.Parse(Console.ReadLine());//int.Parseは文字列を整数に変換。
long[] nums = Array.ConvertAll(Console.ReadLine().Split(' '),long.Parse);
long[] numsUnder = Array.ConvertAll(Console.ReadLine().Split(... | 200 |
Project_CodeNet | 2,018 | using System;
using System.Collections;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using System.Threading.Tasks;
using static System.Console;
using static System.Math;
class Z { static void Main() => new K(); }
class K
{
int F => int.Parse(Str);
lon... | 374 |
Project_CodeNet | 2,018 | using System;
using System.Linq;
using System.Collections.Generic;
public class Test
{
public static void Main()
{
int n=int.Parse(Console.ReadLine());
int []a=Console.ReadLine().Split().Select(int.Parse).ToArray();
int []b=Console.ReadLine().Split().Select(int.Parse).ToArray();
int max=int.MinValue;
for(in... | 141 |
Project_CodeNet | 2,018 | using System;
using System.Linq;
using System.Collections.Generic;
class P
{
static void Main()
{
Console.ReadLine();
int[] a = Console.ReadLine().Split().Select(int.Parse).ToArray();
int[] b = Console.ReadLine().Split().Select(int.Parse).ToArray();
int res = 0;
for (int... | 117 |
Project_CodeNet | 2,018 | using System;
class MainClass
{
public static void Main(string[] args)
{
//string[] s1 = Console.ReadLine().Split(' ');
//long N = long.Parse(s1[0]);
//long K = long.Parse(s1[1]);
long N = long.Parse(Console.ReadLine());
string[] s1 = Console.ReadLine().Split(... | 300 |
Project_CodeNet | 2,018 | using System;
using System.Text;
using System.Collections.Generic;
using System.Linq;
class Solve{
public Solve(){}
StringBuilder sb;
ReadData re;
public static int Main(){
new Solve().Run();
return 0;
}
void Run(){
sb = new StringBuilder();
re = new ReadData();
... | 1,391 |
Project_CodeNet | 2,020 | using System;
using System.Linq;
using System.Collections.Generic;
namespace Contest
{
class Program
{
static void Main(string[] args)
{
ARC090.C();
}
class ARC090
{
public static void C()
{
var N = Read.Int();
... | 1,397 |
Project_CodeNet | 2,018 | using System;
using System.Linq;
namespace arc090_a
{
class Program
{
static void Main(string[] args)
{
int n = int.Parse(Console.ReadLine());
int[] x1 = Console.ReadLine().Split().Select(int.Parse).ToArray();
int[] x2 = Console.ReadLine().Split().Select(int.... | 152 |
Project_CodeNet | 2,018 | using System;
class Program{
private int max(int x ,int y){
return (x > y) ? x : y;
}
public static void Main(){
Program prog = new Program();
int N = int.Parse(Console.ReadLine());
int[,] A = new int[2,N];
int p, q;
string[] str;
for (p = 0 ;p < 2 ;p++ ){
str = Console.ReadLine().Split(' ');
for... | 282 |
Project_CodeNet | 2,018 | using System;
using System.Linq;
class Program
{
static void Main(string[] args)
{
var colCount = int.Parse(Console.ReadLine());
var array1 = Console.ReadLine().Split().Select(int.Parse).ToArray();
var array2 = Console.ReadLine().Split().Select(int.Parse).ToArray();
int max = ar... | 136 |
Project_CodeNet | 2,018 | using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.ObjectModel;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
public static class TemplateExtension
{
public static X[] MakeArray<X>(this int count, Func<... | 1,012 |
Project_CodeNet | 2,018 | using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;
class TEST{
static void Main(){
Sol mySol =new Sol();
mySol.Solve();
}
}
class Sol{
public void Solve(){
int[][] sum = new int[2][];
for(int i=0;i<2;i++) sum[i] = new int[N+1];
for(int i=0;i... | 398 |
Project_CodeNet | 2,020 | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
// using System.Numerics;
using System.Runtime.CompilerServices;
using System.Diagnostics;
using ll=System.Int64;
using static Contest_A.Lib_IO;
using static Contest_A.Lib_Minifunc;
public static class Contest_A
{
public static ... | 2,565 |
Project_CodeNet | 2,019 | using System;
using System.Collections.Generic;
using System.Linq;
class Program
{
static void Main(string[] args)
{
var N = int.Parse(Console.ReadLine());
var A = new List<List<int>>();
A.Add(Console.ReadLine().Split(' ').Select(s => int.Parse(s)).ToList());... | 177 |
Project_CodeNet | 2,018 | using System;
using System.IO;
using System.Linq;
using System.Collections.Generic;
using System.Text;
public class Program
{
public void Proc()
{
int len = int.Parse(Reader.ReadLine());
int[] line1 = Reader.ReadLine().Split(' ').Select(a => int.Parse(a)).ToArray();
int[] line2 = Read... | 404 |
Project_CodeNet | 2,018 | using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using static System.Convert;
using static System.Math;
using static Extensions;
using static MathExtensions;
public static class Program
{
... | 1,679 |
Project_CodeNet | 2,018 | using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Text;
using System.Text.RegularExpressions;
using System.Linq;
using System.IO;
using System.Diagnostics;
class Scanner
{
private readonly char Separator = ' ';
private int Index = 0;
... | 388 |
Project_CodeNet | 2,020 | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace AtCoder_solve
{
class Program
{
public const ulong mod = 1000000007;
static void Main(string[] args)
{
int n = int.Parse(Console.ReadLine());
... | 437 |
Project_CodeNet | 2,018 | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using static System.Console;
namespace AtCoder.ARC090
{
class Candies
{
public static void Main()
{
var n = int.Parse(ReadLine().Trim());
var upper = ReadLi... | 173 |
Project_CodeNet | 2,018 | using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using System.Text.RegularExpressions;
using System.Globalization;
using System.Diagnostics;
using static System.Console;
//using System.Numerics;
//using static System.Math;
class Program
{
static void Main()
... | 517 |
Project_CodeNet | 2,018 | using System;
using System.Linq;
using System.Collections.Generic;
using System.Numerics;
using Debug = System.Diagnostics.Debug;
using SB = System.Text.StringBuilder;
using Number = System.Int64;
using static System.Math;
using ll = System.Int64;
namespace Program {
public class Solver {
Random rnd = new R... | 1,023 |
Project_CodeNet | 2,019 | using System;
using System.Collections.Generic;
using System.Linq;
using BitArray = System.Collections.BitArray;
using BigInteger = System.Numerics.BigInteger;
using TextReader = System.IO.TextReader;
using System.Text;
namespace AtCoderProject
{
public class Program
{
public object Calc()
{
... | 750 |
Project_CodeNet | 2,018 | using System;
using System.Linq;
namespace ConsoleApp1
{
class Program
{
static void Main(string[] a_asArgs)
{
Console.ReadLine();
int[] l_aiInput1 = Console.ReadLine().Split(' ').Select(a => int.Parse(a)).ToArray();
int[] l_aiInput2 = Console.ReadLine().Split(' ').Select(a => int.Pars... | 231 |
Project_CodeNet | 2,019 | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
public class MainClass
{
public const long Giri = 1000000007;
public static void Main(string[] args)
{
var n = Console.ReadLine().ToInt();
var grid = new int[2, n];
for(int i = 0; i < 2; i++)
{
var p = Input().ToInt()... | 469 |
Project_CodeNet | 2,019 | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace CSharp_AtCoder
{
class Program
{
static void Main(string[] args)
{
int N = int.Parse(Console.ReadLine());
int[,] A = new int[3, N + 1];
for(int i = 1; i < 3; i... | 248 |
Project_CodeNet | 2,018 | using System;
using System.IO;
using System.Text;
class Solver {
public Istream cin = new Istream(Console.OpenStandardInput());
public void solve() {
int n = cin.readInt();
int[,] a = new int[2, n];
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++) {
a[i, j] = cin.readInt();
... | 518 |
Project_CodeNet | 2,020 | #-swank
(unless (member :child-sbcl *features*)
(quit
:unix-status
(process-exit-code
(run-program *runtime-pathname*
`("--control-stack-size" "128MB"
"--noinform" "--disable-ldb" "--lose-on-corruption" "--end-runtime-options"
"--eval" "(push :child-sbc... | 2,448 |
Project_CodeNet | 2,018 |
import java.util.Arrays;
public class Main {
private final static int INF = 1000000000;
private static void solve() {
int n = ni();
int[] from = new int[n - 1];
int[] to = new int[n - 1];
for (int i = 0; i < n - 1; i++) {
from[i] = ni() - 1;
to[i] = ni() - 1;
}
int[][] g = pac... | 1,472 |
Project_CodeNet | 2,016 | import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
static class Tree {
public class Edge {
int to, rev;
public Edge(int to, int rev) {
this.to = to;
this.rev = rev;
}
}
int V;
ArrayList<ArrayList<Edge>> G;
int roo... | 937 |
Project_CodeNet | 2,019 | import java.io.*;
import java.util.*;
class Solver {
final int n, k;
final int[][] abs, vps;
List<List<Integer>> graph;
int[] mins, maxs, values;
Solver(int n, int[][] abs, int k, int[][] vps) {
this.n = n;
this.abs = abs;
this.k = k;
this.vps = vps;
}
private boolean dfsRange(int i... | 1,968 |
Project_CodeNet | 2,016 | import java.io.*;
import java.lang.*;
import java.util.*;
public class Main {
static boolean debug = false;
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(reader.readLine());
Tree tree = new Tr... | 1,038 |
Project_CodeNet | 2,016 |
import java.io.*;
import java.math.*;
import java.util.*;
import static java.util.Arrays.*;
public class Main {
private static final int mod = (int)1e9+7;
final Random random = new Random(0);
final IOFast io = new IOFast();
/// MAIN CODE
public void run() throws IOException {
// int TEST_CASE = Integer.parse... | 2,745 |
Project_CodeNet | 2,016 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
public class Main {
static BufferedReader in;
static PrintWriter out;
... | 1,087 |
Project_CodeNet | 2,016 | import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.PriorityQueue;
public class Main {
static InputStream is;
static PrintWriter out;
static String INPUT = "";
s... | 1,961 |
Project_CodeNet | 2,016 | 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();
List<List<Integer>> edges = new ArrayList<>(n);
for (int i = 0; i < n; i++) {
edges.add(new ArrayList<>());
}
for (int i = 0; i < n - 1;... | 1,400 |
Project_CodeNet | 2,016 | // package atcoder.arc.arc063;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.PriorityQueue;
import java.util.Queue;
public class Main {
public static void main(String[] args) {
InputRea... | 1,614 |
Project_CodeNet | 2,020 | import java.io.*;
import java.util.*;
public class Main {
static ArrayList<Integer>[] adj;
static int INF = (int) 1e9;
static int[] l, r;
static boolean dfs(int u, int p) {
boolean decided = l[u] != -INF;
for (int v : adj[u])
if (v != p) {
dfs(v, u);
l[u] = Math.max(l[v] - 1, l[u]);
r[u] = Mat... | 892 |
Project_CodeNet | 2,020 | import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.lang.reflect.Array;
import java.lang.reflect.Field;
import java.util.Arrays;
import java.util.Collection;
import java.util.HashSet;
import java.util.NoSuchElementException;
import java.util.PrimitiveIterator;
import java.ut... | 6,707 |
Project_CodeNet | 2,016 | import java.util.ArrayList;
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
static final int INF = Integer.MAX_VALUE;
static Node[] nodes;
public static void main(String[] args) {
boolean result = solve();
if (result) {
System.out.println("Yes");
S... | 843 |
Project_CodeNet | 2,016 | // -*- coding: utf-8 -*-
//import java.awt.*;
import java.io.*;
import java.math.*;
import java.text.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
InputStream inputStream;
if (args.length > 0 && args[0].equals("devTesting")) {
try {
inputStream = new FileIn... | 970 |
Project_CodeNet | 2,016 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.Collection;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.List;
import java.util.StringTokenizer;
im... | 721 |
Project_CodeNet | 2,016 | 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... | 1,103 |
Project_CodeNet | 2,020 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Comparator;
import java.util.HashMap;
import ja... | 30,936 |
Project_CodeNet | 2,016 | import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
@SuppressWarnings("unchecked")
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = Integer.parseInt(sc.next());
ArrayL... | 693 |
Project_CodeNet | 2,016 | import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.*;
/*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
... | 1,591 |
Project_CodeNet | 2,017 | import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.Closeable;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
impo... | 2,520 |
Project_CodeNet | 2,019 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.IOException;
import java.util.ArrayList;
import java.io.UncheckedIOException;
import java.util.List;
import java.io.Closeable;
import java.io.Writer;
import java.io.OutputStreamWriter;
import... | 1,413 |
Project_CodeNet | 2,016 |
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.PriorityQueue;
public class Main {
private static fi... | 1,581 |
Project_CodeNet | 2,019 | import java.io.*;
import java.util.*;
import java.util.function.Function;
public class Main {
static int N;
static int[] A, B;
static int K;
static int[] V, P;
public static void main(String[] args) {
FastScanner sc = new FastScanner(System.in);
N = sc.nextInt();
A = new i... | 2,147 |
Project_CodeNet | 2,019 | import java.awt.Point;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
public class Main
{
static class Scanner
{
B... | 1,459 |
Project_CodeNet | 2,016 | import java.io.*;
import java.util.*;
public class Main {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
List<Integer>[] g;
boolean[] fixed;
int[] val;
boolean[] anything;
int[] low, high;
int[] outp;
void solve() throws IOException {
int n = nextInt();
g = new List[n];
f... | 1,137 |
Project_CodeNet | 2,020 | #{{{ header
{.hints:off warnings:off optimization:speed.}
import algorithm, sequtils, tables, macros, math, sets, strutils
when defined(MYDEBUG):
import header
import streams
proc scanf(formatstr: cstring){.header: "<stdio.h>", varargs.}
#proc getchar(): char {.header: "<stdio.h>", varargs.}
proc nextInt(): int = sc... | 3,168 |
Project_CodeNet | 2,018 | import strutils
import sequtils
import algorithm
import math
import queues
import tables
import logging
import future
const INF* = int(1e18 + 373)
when not defined(release):
addHandler(newFileLogger(stderr, lvlAll, "[ $levelname ] "))
proc readInt1*(): int = stdin.readLine().strip().parseInt()
proc readInt2*(): (i... | 813 |
Project_CodeNet | 2,017 | #include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=(... | 1,141 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
int N, K;
vector<int> adj[100001];
int A[100001];
bool seen[100001];
int main()
{
scanf("%d", &N);
for(int i=0; i<N-1; i++)
{
int a, b;
scanf("%d%d", &a, &b);
adj[a].push_back(b);
adj[b].push_back(a);
}
memset(A, -1, si... | 342 |
Project_CodeNet | 2,016 | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 1,016 |
Project_CodeNet | 2,016 | /*
*
*/
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define INF 1e9
int N, K;
vector<int> edge[100005]; // edge[i] connect from i to edge[i][j].
int v[100005]; // v[i] is written in vertex i
int par[100005]; // vertex i's parent is par[i]
int lb[100005], ub[100005]; // Range [lb... | 747 |
Project_CodeNet | 2,016 | #include <bits/stdc++.h>
using namespace std;
struct Interval { int min, max; };
Interval intersection(const Interval a, const Interval b) { return {max(a.min, b.min), min(a.max, b.max)}; }
bool contains(const Interval a, const int x) { return a.min <= x && x <= a.max; }
int main()
{
ios::sync_with_stdio(false);
... | 547 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <vector>
#include <queue>
using namespace std;
int N;
int A, B;
vector<vector<int> >G(100010);
int K;
int V[100010], P[100010];
int vl[100010], vr[100010];
queue<int> q;
int solve()
{
int i;
for(i=0; i<K; i++){
q.push(V[i]);
}
int u, v;
int l, r;
while(!q.empty() ){
u = q.front();... | 478 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define INFS (1LL<<28)
#define INF (1LL<<60)
#define DEKAI 1000000007
//#define MOD 1000000007
#define lp(i,n) for(int i=0;i<n;i++)
#define lps(i,n) for(int i=1;i<=n;i++)
#define all(c) begin(c), end(c)
//#define int long long
namespace {
#define __DECLARE__(C) \
t... | 1,202 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,... | 810 |
Project_CodeNet | 2,017 | #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i... | 1,004 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.