Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | import sys
from bisect import bisect_right
from itertools import chain, compress
ub = 50000
is_prime = [0, 0, 1, 1] + [0]*(ub-3)
is_prime[5::6] = is_prime[7::6] = [1]*int(ub/6)
primes = [2, 3]
append = primes.append
for n in chain(range(5, ub, 6), range(7, ub, 6)):
if is_prime[n]:
append(n)
is_pri... | 207 |
Project_CodeNet | 2,018 | # AOJ 0056 Goldbach's Conjecture
# Python3 2018.6.16 bal4u
MAX = 50000
HALF = 2761 # prime[2760]=24989, prime[2761]=25013
prime = [
3, 5, 7, 11, 13, 17, 19, 23, 29,
31, 37, 41, 43, 47, 53, 59, 61, 67, 71,
73, 79, 83, 89, 97,101,103,107,109,113,
127,131,137,139,149,151,157,163,167,173,
179,181,191,193,197,... | 509 |
Project_CodeNet | 2,014 | def sieve(n):
primes = [True] * n
primes[0] = primes[1] = False
for i in xrange(2, int(n ** 0.5) + 1):
if primes[i]:
for j in xrange(i * i, n, i):
primes[j] = False
return [i for i in xrange(n) if primes[i]]
primes = sieve(50000)
ret = [0] * 50001
for i in xrange(len... | 177 |
Project_CodeNet | 2,015 | def pri(t):
i=2
while i**2<=t:
if t%i==0:
return 0
i=i+1
return 1
l=[]
for i in range(2,50000):
if pri(i):
l.append(i)
s=5133
ans={}
for i in range(5132):
for j in range(i,5133):
a,b=l[i],l[j]
if a+b>50000:
break
if ans.has_key... | 165 |
Project_CodeNet | 2,013 | n = 50000
sn = n**0.5 + 1
is_prime = [false, false] + [true] * (n - 1)
(2..sn).each do |i|
next unless is_prime[i]
(i*i).step(n, i).each do |j|
is_prime[j] = false
end
end
pl = (2..n).map.select{ |i| is_prime[i] }
while gets do
s = $_.to_i
break if s == 0
count = 0
tmp = pl.dup
l = tmp.shift
h... | 239 |
Project_CodeNet | 2,016 | require'prime';a=Prime.take(6e3);n,*b=p;a.map{|v|b[v]=1};p a.count{|v|v<=n/2&&b[n-v]} while 0<n=gets.to_i | 51 |
Project_CodeNet | 2,013 | n = 50000
is_prime = [false, false] + [true] * (n-1)
(2..(n**0.5+1)).each do |i|
next unless is_prime[i]
(i**2).step(n,i).each do |j|
is_prime[j] = false
end
end
until (n=gets.to_i)==0
m = n/2
(m-=1) if m.even?
cnt = 0
while m >= 3
if is_prime[m] && is_prime[n-m]
cnt += 1
end
m -... | 164 |
Project_CodeNet | 2,017 | max = 50000
prime = [2]
list = Array.new(max){|i| i}
list[0] = 0
list[1] = 0
loop do
a = prime[-1]
break if a >= Math.sqrt(max)
i = a
while i <= max
list[i] = 0
i += a
end
while list[a] == 0
a += 1
end
prime << list[a]
list[a] = 0
end
prime += list - [0]
p = {}
prime.each{|i|
p[i] = tru... | 215 |
Project_CodeNet | 2,013 | require "prime"
PrimeArray = (2..50000).select(&:prime?)
while input = $stdin.gets
target = input.to_i
break if target == 0
source = PrimeArray.clone
c = 0
pl = 0
pr = source.size - 1
while pl <= pr
s = source[pl].to_i + source[pr].to_i
if s > target
pr -= 1
elsif s == target
... | 141 |
Project_CodeNet | 2,015 | #!ruby -rprime
a=Prime.take 6e3
n,*b=p
a.map{|i|b[i]=1}
p a.count{|i|i<=n/2&&b[n-i]}while 0<n=gets.to_i | 53 |
Project_CodeNet | 2,016 | n = 287117
a = Array.new(n){|i| i+1}
a[0] = 0
(2..n**(0.50)).each do |i|
(2..(n/i)).each{|j| a[i*j-1] = 0} if a[i-1]>0
end
b=Marshal.load(Marshal.dump(a))
a.delete(0)
while (m=gets.to_i)>0
c=0
a.each_with_index do |i, idx|
break if i>(m/2)
c+=1 unless b[m-i-1]==0
end
p c
end | 143 |
Project_CodeNet | 2,015 | def primes(max)
nums = Array.new(max + 1, 1)
nums[0] = nums[1] = 0
(2..Math.sqrt(max)).each do |sieve|
if nums[sieve] == 1
(2 * sieve).step(max, sieve).each do |num|
nums[num] = 0
end
end
end
nums
end
max = 50_000
primes = primes(max)
nums = (2..max).select { |num| primes[num]... | 193 |
Project_CodeNet | 2,017 | #!/usr/bin/env ruby
require 'set'
N = 50_000 # ??¢?´¢???????´???°?????????
elt = Array.new(N, 1)
primes = []
# ??¨????????????????????????
elt[0] = 0
elt[1] = 0
N.times do |i|
next if elt[i].zero?
primes << i
k = i * 2
while k < N
elt[k] = 0
k += i
end
end
# #include?????????????
primes = primes.t... | 203 |
Project_CodeNet | 2,016 | require 'prime'
primes = Prime.each(50000).to_a
while (n = gets.to_i) > 0
i = 0
j = (primes.find_index{|x| x > n} || primes.size) - 1
count = 0
while
s = primes[i] + primes[j]
count += 1 if s == n
break if i == j
if s < n
i += 1
else
j -... | 125 |
Project_CodeNet | 2,018 | is_prime = Array.new(50001, true)
is_prime[0] = is_prime[1] = false
(2..223).each{|p|
if is_prime[p]
(p*2).step(50000,p){|i|
is_prime[i] = false
}
end
}
f = ->n{
return (is_prime[n-2] ? 1 : 0) if n.odd?
(2..(n/2)).count{|i| is_prime[i] and is_prime[n-i]}
}
loop{
n = gets.to_i
break if n==0
... | 141 |
Project_CodeNet | 2,014 | def get_prime_nums(max_p)
primes = (0..max_p).map{true}
primes[0] = primes[1] = false
smp = Math::sqrt(0.5 + max_p).to_i
for p in (2..smp)
if (primes[p])
(p * p).step(max_p, p){|q| primes[q] = false}
end
end
#puts "#{primes.select{|p| p }.length} primes"
return primes
end
### main
max_p... | 231 |
Project_CodeNet | 2,014 | require 'prime'
cache = Array.new(50001,0)
ps = Prime.each(50000).to_a
while ps!=[]
p = ps[0]
ps.each do |x|
if p+x < cache.length
cache[p+x]+=1
else
break
end
end
ps.shift
end
while (n = gets.to_i) != 0
p cache[n]
end | 89 |
Project_CodeNet | 2,013 | require"prime";h={};(q=Prime.take 5133).map{|x|h[x]=!!1};while 0<n=gets.to_i;p q.count{|x|x<=n/2&&h[n-x]}end | 49 |
Project_CodeNet | 2,014 | require"prime"
a=Prime.take 6e3
l=Hash[a.zip(a)]
while 0<n=gets.to_i
p a.count{|i|i<=n/2&&l[n-i]}end | 45 |
Project_CodeNet | 2,015 | def prime(n)
primes = Array.new(n + 1){|i|i}
primes[1] = nil
for i in 2..n ** 0.5
if primes[i]
for j in 2..n / i
primes[i * j] = nil
end
end
end
return primes[2..-1].select{|f|f}
end
def main(input = STDIN)
primes = prime(50000)
num = Array.new(50001, 0)
primes.each_with_inde... | 192 |
Project_CodeNet | 2,013 | require 'prime'
Primes = (2..50000).select(&:prime?)
loop do
n = gets.to_i
break if n==0
primes = Primes.dup
l = primes.shift
h = primes.pop
cnt = 0
while !primes.empty?
case
when l+h==n; l = primes.shift; cnt += 1
when l+h<n; l = primes.shift
else h = primes.pop
end
end
cnt += 1 i... | 138 |
Project_CodeNet | 2,019 | primes = Array.new(50000, true)
primes[0, 2] = [false, false]
2.upto(50000 - 1){|x|
if primes[x]
m = 2
while x * m <= 999_999
primes[x * m] = false
m += 1
end
end
}
while true
n = gets.to_i
break if n == 0
sum = 0
2.upto(n/2){|x| sum += 1 if prime... | 140 |
Project_CodeNet | 2,018 | require 'prime'
h = {}
primes = Prime.each(50000).to_a
primes.each {|pr| h[pr] = true}
until (n = $<.gets.to_i).zero?
co = 0
if n.odd?
co = 1 if h[n - 2]
else
primes.each do |pr|
break if pr > n / 2
co += 1 if h[n - pr]
end
end
puts co
end
| 112 |
Project_CodeNet | 2,019 | using System;
using System.Collections.Generic;
using System.Linq;
class Pg
{
static void Main()
{
Prime p = new Prime();
List<bool> Pmlst = p.GetPrimeNums().ToList();
int n;
while ((n = int.Parse(Console.ReadLine())) != 0)
{
int count = 0;
for (i... | 293 |
Project_CodeNet | 2,013 | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace AOJ
{
class Program
{
static void Main(string[] args)
{
bool[] p = Enumerable.Repeat(true, 50000).ToArray();
p[0] = p[1] = false;
for (int i = 2; i < Math.Sqrt(p.Length); i++)
if (p[i])
for (int j = ... | 202 |
Project_CodeNet | 2,013 | using System;
using System.Collections.Generic;
using System.Linq;
namespace AOJ0056
{
class Program
{
static void Main()
{
var primeTable = GeneratePrimeTable(50100);
foreach (var n in ReadInput())
{
var count = 0;
var posit... | 459 |
Project_CodeNet | 2,016 | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace ConsoleApplication1
{
class Program
{
static void Main(string[] args)
{
StringBuilder sb = new StringBuilder();
int MAX = 50000;
int sqrtMAX = (int)Math.Sqrt(MAX)... | 296 |
Project_CodeNet | 2,018 | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace _0056
{
public class Program
{
public static void Main(string[] args)
{
bool[] primes = new bool[50001];
for (int i = 1 ; i < primes.Length ; i++) primes[i] = IsPrime(i);
... | 468 |
Project_CodeNet | 2,017 | using System;
using System.Text;
namespace AOJ.Volume0
{
public class GoldbachConjecture
{
public static int Main()
{
// 50000??\???????´???°??????????????????
var prime = new bool[50001];
prime[0] = false;
prime[1] = false;
prime[2] =... | 345 |
Project_CodeNet | 2,017 | using System;
using System.Collections.Generic;
using System.Linq;
namespace Miscelleneous {
class Program {
public static int cin() { return int.Parse(Console.ReadLine()); }
static HashSet<int> Prime;
static void Main(string[] args) {
Filt(50000);
int n, Res = 0;
while ... | 282 |
Project_CodeNet | 2,015 | using System;
using System.Collections.Generic;
using System.Linq;
namespace AOJ
{
class Program
{
static bool[] check = new bool[105000];
static void Main(string[] args)
{
int end = (int)Math.Sqrt(105000) + 1;
for (int i = 2; i < end; i++)
{
... | 241 |
Project_CodeNet | 2,017 | using System;
using System.Text;
namespace _056_Goldbach_sConjecture
{
class Program
{
static void Main ( string[] args )
{
string inputStr;
StringBuilder output = new StringBuilder (10000 * 3);
while ((inputStr = Console.ReadLine ()) != "0")
{
int inputNum = int.Parse (inputStr);
int count ... | 493 |
Project_CodeNet | 2,012 | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace mondai0056
{
class Program
{
static void Main(string[] args)
{
var prime = new List<int>();
for( int i = 2; i <= 50000; i++ ) {
if( is_prime( i ) ) {
prime.Add( i );
}
}
var cnt_tbl = new int... | 365 |
Project_CodeNet | 2,016 | using System;
class _0056 {
static readonly int N = 50000;
public static void Main() {
int c, n;
bool[] e = new bool[N + 1];
int[] p = new int[5133];
e[0] = e[1] = false;
for (int i = 2; i <= N; i++) e[i] = true;
for (int i = 2; i < Math.Sqrt(N + 1); i++) if (e[i... | 260 |
Project_CodeNet | 2,018 | using System.Linq;
using System;
public class hello
{
public static void Main()
{
var p = new bool[50000];
GeneratePrime(p);
while (true)
{
var n = int.Parse(Console.ReadLine().Trim());
if (n == 0) break;
var count = 0;
for (int i ... | 222 |
Project_CodeNet | 2,012 | using System;
public class p0056{
const int l = 50001;
p0056 ()
{
string str;
int cnt, n;
bool[] prime = new bool[l];
for (int i = 0; i < l; ++i)
prime [i] = true;
prime [0] = prime [1] = false;
for (int i = 2; i < l; ++i)
if (prime [i])
for (int j = i+i; j < l; j+=i)
prime [j] = false... | 245 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ld, ll>;
const ld pi = acosl(-1);
const ld eps = 1e-13;
template <typename T>
class SegmentTree {
using func_t = function<T(T, T)>;
const int n;
const T id;
func_t merge;
vector<T> data;
int size(int n) {
... | 1,608 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define DEBUG 1
#define INF (1.0/0.0)
#define EPS 1e-10
#define PI 3.1415926535
#define EQ(x, y) (abs((x)-(y))<EPS)
#define X real()
#define Y imag()
#define MIRROR_POP 0
#define MIRROR_EVAL 1
#define REAL_PUSH 2
#define MIRROR_PUSH 3
typedef long long int LLI;
typedef ... | 1,768 |
Project_CodeNet | 2,016 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#i... | 1,030 |
Project_CodeNet | 2,020 | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | 1,207 |
Project_CodeNet | 2,015 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using... | 890 |
Project_CodeNet | 2,015 | #include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#define rep(i,n) for(int i = 0; i < n; ++i)
using namespace std;
int a[210000];
int b[210000];
int p[210000];
double PI=acos(-1.0);
double eps=1e-12;
struct wolf{
int bb;int bs;
int t;
wolf(){
}
wolf(int x,int y,int z){
... | 1,407 |
Project_CodeNet | 2,016 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll INF=(1LL<<50);
double eps=1e-10,PI=acos(-1);
struct segtree{
ll t[(1<<20)];
void init(){
for(int i=0;i<(1<<20);i++)t[i]=INF;
}
ll get(int a,int b,int k=0,int l=0,int r=(1<<19)){
if( !(a<b) )return INF;
if(b<=l||r<=a)return INF;
... | 698 |
Project_CodeNet | 2,019 | import java.util
import scala.annotation.tailrec
import scala.collection.mutable
import scala.io.StdIn._
object Main extends App {
val n = readInt()
val tickets = Array.tabulate(n){_ ⇒
val Array(a, b, p) = readLine.trim.split(' ').map(_.toLong)
if (a != 0 || b != 0) Ticket(a / gcd(a, b), b / gcd(a, b), p)... | 2,178 |
Project_CodeNet | 2,017 | using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
//using System.Numerics;
//using Point = System.Numerics.Complex;
using Number = Pair<long, int>;
namespace Program
{
public class Solver
{
public v... | 2,779 |
Project_CodeNet | 2,017 | import java.util.*;
class Main{
static int w,h,c;
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
while(true) {
w = scan.nextInt();
h = scan.nextInt();
c = scan.nextInt();
if(w==0) break;
int[][] arr = new int[w][h];
for(int i = 0; i < w; ... | 795 |
Project_CodeNet | 2,014 | import java.util.*;
public class Main {
Scanner in = new Scanner(System.in);
public static void main(String[] args) {
new Main();
}
public Main() {
while(true){
int w = in.nextInt(),h = in.nextInt(),c = in.nextInt();
if(w+h+c==0)break;
new AOJ1174().doIt(w, h, c);
}
}
class AOJ1174{
int max =... | 730 |
Project_CodeNet | 2,012 | import java.util.Scanner;
public class Main {
int c; // 最終色
int h;
int w;
int max; // 結合パネル数最大
int tmp; // 局地的結合パネル数算出保持
boolean[][] comb; // 結合パネル範囲(true)
// pane[i][j]から移動できる同色パネル結合
void Join(int[][] pane, int i, int j){
// 配列外アクセスもしくは探索済みまたは同色でない
if(i<0||i>=h||j<0||j>=w||comb[i][j]==true||pane[i]... | 878 |
Project_CodeNet | 2,015 | import java.util.BitSet;
import java.util.Deque;
import java.util.LinkedList;
import java.util.Scanner;
public class Main {
public static int[] dx = {1, 0, -1, 0};
public static int[] dy = {0, 1, 0, -1};
public static void main(String[] args){
Scanner in = new Scanner(System.in);
while(true){
int h = in.nex... | 768 |
Project_CodeNet | 2,016 | import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;
import java.util.Queue;
import java.util.ArrayDeque;
import java.util.Arrays;
public class Main {
public static int[][] vec = {{0,1},{0,-1},{1,0},{-1,0}};
public static void printer(int[][] field) {
for(int i=0; i<fie... | 1,397 |
Project_CodeNet | 2,012 |
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
public class Main {
int INF = 1 << 28;
int h, w, c;
int max;
int count;
void run() {
Scanner sc = new Scanner(System.in);
for(;;) {
h = sc.nextInt();
w = sc.nextInt();
c = sc.nextInt();
if( (h|w|c) == 0 ) break... | 565 |
Project_CodeNet | 2,014 | // Identically Colored Panels Connection
import java.util.*;
public class Main {
static int w, h;
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
while (true) {
h = scanner.nextInt();
w = scanner.nextInt();
int c = scanner.nextInt();
if ((h | w | c) == 0)
break... | 876 |
Project_CodeNet | 2,014 | import java.util.Arrays;
import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
int[] dx = { 1, 0, -1, 0 };
int[] dy = { 0, 1, 0, -1 };
int H, W, C;
int[][] map;
int[][] field;
boolean visit[][];
int max, cnt;
void run() {
for (;;) {
H = sc.nextInt();
W = sc.nextInt();
... | 780 |
Project_CodeNet | 2,016 | import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Deque;
import java.util.Scanner;
public class Main {
static int h, w, c;
static int[][] map;
static Deque<ArrayList<Point>> stack;
static int max;
public static void main(String[] args) {
Scanner sc = new Scanner(Sys... | 723 |
Project_CodeNet | 2,016 | import java.util.*;
import java.io.*;
import java.awt.geom.*;
import java.math.*;
public class Main {
static final Scanner in = new Scanner(System.in);
static final PrintWriter out = new PrintWriter(System.out,false);
static boolean debug = false;
static int h, w, c;
static int[] change;
static int[][] p, stam... | 608 |
Project_CodeNet | 2,013 | import java.util.Arrays;
import java.util.Scanner;
public class Main
{
static int[] D = { 1, 0, -1, 0 };
static int w, h, c;
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
while (true)
{
h = sc.nextInt();
w = sc.nextInt();
c = sc.nextInt();
if ((h|w|c)==0)break;
... | 1,016 |
Project_CodeNet | 2,013 | import java.util.*;
import java.awt.geom.*;
import static java.lang.Math.*;
public class Main {
final Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
new Main().init();
}
void init(){
new AOJ1174();
}
class AOJ1174{
AOJ1174(){
while(sc.hasNext()){
H=sc.nextInt(); W=sc.n... | 642 |
Project_CodeNet | 2,018 | import java.util.Scanner;
public class Main {
final boolean DEBUG = false;
int h, w, c;
int[] colors;
int[][] tmp;
int[] dy = { 1, 0, -1, 0 };
int[] dx = { 0, 1, 0, -1 };
int bColor, aColor;
int sum;
void run() {
Scanner scan = new Scanner(System.in);
while (true) {
h = scan.nextInt();
w = scan.ne... | 699 |
Project_CodeNet | 2,014 | import java.util.*;
class Main{
int h, w, c;
int[][] p, p2;
int[] num = new int[5];
void solve(){
Scanner sc = new Scanner(System.in);
while(true){
h = sc.nextInt(); w = sc.nextInt(); c = sc.nextInt();
if(h==0 && w==0 && c==0) break;
p = new int[h... | 575 |
Project_CodeNet | 2,011 | import java.util.Scanner;
//Identically Colored Panels Connection
public class Main{
int h, w, t;
int[][] o;
int[][] tmp;
int[] order;
boolean[][] u;
int max, c;
int[][] move = {{-1,0},{0,1},{1,0},{0,-1}};
void e(){
for(int k=0;k<5;k++){
if(tmp[0][0]==order[k])continue;
flip(0, 0, tmp[0][0], order[k]... | 612 |
Project_CodeNet | 2,013 | import java.util.Scanner;
public class Main {
static int h, w, c;
static int a[][];
static int dx[] = {-1, 0, 0, 1};
static int dy[] = {0, -1, 1, 0};
public static int f(int k) {
int b[][] = new int[h][w];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
b[i][j] = a[i][j];
}
}
if... | 787 |
Project_CodeNet | 2,016 | import java.util.Arrays;
import java.util.LinkedList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
int h = sc.nextInt();
int w = sc.nextInt();
int c = sc.nextInt();
while(h != 0 || w != 0 ... | 1,091 |
Project_CodeNet | 2,015 | import java.util.ArrayDeque;
import java.util.Deque;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int h = sc.nextInt();
if (h == 0) {
sc.close();
break;
}
int w = sc.nextInt();
int c = sc.nextInt... | 753 |
Project_CodeNet | 2,014 | import java.util.ArrayDeque;
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
static int H, W, C;
static int[][][] f;
static int[] DR = { 1, 0, -1, 0 };
static int[] DC = { 0, 1, 0, -1 };
static int ans;
public static void main(String[] args) {
while (true) {
H = s... | 759 |
Project_CodeNet | 2,013 |
import java.lang.reflect.Array;
import java.util.*;
import java.util.Map.Entry;
import static java.lang.System.*;
import static java.lang.Math.*;
class Main {
public static Random rand=new Random();
static boolean hasNext(int[] r,int[] a){
for(int i=r.length-1;i>=0;i--){
if(a[i]+1<r[i])return true;
}
ret... | 1,274 |
Project_CodeNet | 2,013 | import java.util.*;
import static java.lang.System.*;
public class Main {
/**
* @param args
*/
Scanner sc = new Scanner(in);
int h, w, c;
int[] order = new int[5];
int max;
int[][] p;
int[][] q;
Queue<Integer> qx = new LinkedList<Integer>();
Queue<Integer> qy = new LinkedList<Integer>();
int calc(... | 876 |
Project_CodeNet | 2,015 |
import java.io.*;
import java.util.*;
public class Main {
FastScanner in = new FastScanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int[][][] map;
boolean[][] visited = new boolean[40][40];
int targetc;
int[] vx = {1, 0, -1, 0}, vy = {0, 1, 0, -1};
int dfs2(int x, int y, int[][] a) {
if... | 1,524 |
Project_CodeNet | 2,018 | import java.util.Scanner;
public class Main {
static int h,w;
static int[][] p=new int[9][9];
static int c, size;
static void dfs1(int[][] cpp,int count) {
int[][] cp=new int[9][9];
for(int i=1; i<=6; i++) {
if(count==5 && i!=c) continue;
if(i==cpp[1][1]) continue;
for(int x=1; x<=h; x++) {
fo... | 601 |
Project_CodeNet | 2,012 | import java.io.*;
import java.util.*;
public class Main {
Scanner sc;
int h, w, c;
int[][] p;
boolean[][] done; // biribiri用フラグ
public static void main(String[] args) {
new Main().run();
}
Main() {
sc = new Scanner(System.in);
}
boolean init() {
h = sc.ne... | 966 |
Project_CodeNet | 2,012 | import java.io.*;
public class Main {
private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
public static void main ( String [] args ) throws IOException
{
new Main().cal();
}
private void cal() throws IOException
{
while(true){
String... | 1,059 |
Project_CodeNet | 2,017 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import java.util.StringTokenizer;
import static java.lang.Integer.parseInt;
/**
* Identically Colored Panels Connection
*/
public class Main {
... | 855 |
Project_CodeNet | 2,012 | import java.util.*;
public class Main {
int [] vx = {0,1,0,-1};
int [] vy = {1,0,-1,0};
final int INF = Integer.MAX_VALUE;
int ans,h,w,c;
int [][] work;
class C{
int x,y;
public C(int x, int y) {
this.x = x;
this.y = y;
}
}
private void doit() {
Scanner sc = new Scanner (System.in);
while(t... | 1,068 |
Project_CodeNet | 2,012 | import java.io.*;
import java.util.*;
public class Main{
private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st;
private static boolean end = false;
public static void main ( String [] args ) throws IOException
{
while(!end){
new Main... | 1,084 |
Project_CodeNet | 2,014 | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while(true) {
int h = sc.nextInt();
int w = sc.nextInt();
int c = sc.nextInt();
if (h==0) {
break;
}
int[][] col = new int[h][w];
for(int i... | 751 |
Project_CodeNet | 2,012 | import java.util.Scanner;
public class Main {
static int h;
static int w;
static int c;
static int ans;
static int count;
static int[] color_order;
static int[][] map;
static int[][] tmp;
public static void main(String[] args) throws java.io.IOException {
Scanner sc = new ... | 725 |
Project_CodeNet | 2,012 | import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) {
try {
System.setIn(new FileInputStream("src/aoj1174/input.txt"));
// System.setOut(new PrintStream(new FileOutputStream("src/aoj1172/result.txt")... | 796 |
Project_CodeNet | 2,015 | import java.util.*;
import java.math.*;
import java.awt.geom.*;
import java.io.*;
public class Main {
static int[] vx = new int[] {0,1,0,-1};
static int[] vy = new int[] {1,0,-1,0};
static int Y;
static int X;
static int MIN;
static int TAR;
public static void main(String[] arg... | 885 |
Project_CodeNet | 2,018 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
static PrintWriter out;
static InputReader ir;
stat... | 1,521 |
Project_CodeNet | 2,016 | import java.util.Scanner;
public class Main {
static int max = 0;
static int h, w, c;
static int n;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
h = sc.nextInt();
w = sc.nextInt();
c = sc.nextInt();
max = 0;
if (h == 0)
break;
int panel[][]... | 1,065 |
Project_CodeNet | 2,013 | import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
public class Main {
static byte h,w,c;
static int max;
static byte[][] panel;
static byte[] v1={0,1,0,-1};
static byte[] v2={1,0,-1,0};
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
for(;;){
h=... | 998 |
Project_CodeNet | 2,013 | import java.util.*;
public class Main {
int h, w, c;
int[][] cost, costzero;
int[][][] map;
ArrayList<Integer> stack = new ArrayList<Integer>();
int ans=0;
int sum=0;
public void zero(){
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cost[i][j]=0;
}
}
}
public void change(int z, int y, int x, ... | 878 |
Project_CodeNet | 2,018 | import java.util.Scanner;
public class Main {
static int h;
static int w;
static int c;
static int cnt;
static int[][] p;
static int[][] tmp;
static int[][] move = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
static int[] order;
static boolean[][] jud;
static void e() {
for(int k=0; k<5; k++) {
if(tmp[0][0] ... | 707 |
Project_CodeNet | 2,011 | public
class Main
{
private static
final int ColorNum = 6;
public static
void main (
String args[ ]
)
{
java.util.Scanner scanner
= new java.util.Scanner ( System.in );
while ( true )
{
int[ ][ ] panel;
int h, w, c;
h = scanner.nextInt ( );
w = scanne... | 910 |
Project_CodeNet | 2,019 |
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
public class Main
{
static class Grid
{
int x;
int y;
public Grid(int x0, int y0)
{
x = x0;
y = y0;
}
}
static int colors = 6;
static int tar = 5;
static int c = 0;
static int[][] pan;
static int w, h;
stati... | 1,135 |
Project_CodeNet | 2,016 | import java.util.Scanner;
public class Main {
int chkP[][];
static final int NUM_COLOR = 6;
void run(){
Scanner s = new Scanner(System.in);
while(true){
int h = s.nextInt();
int w = s.nextInt();
int c = s.nextInt();
if(h == 0 && w == 0 && c == 0)break;
int p[][] = new int[h][w];
for(int i = 0;... | 1,179 |
Project_CodeNet | 2,015 | import java.awt.Point;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
static int H, W, C;
static int[][] P;
static int[][] p;
static boolean[][] check;
static int[] dx = {0, 1, 0, -1};
sta... | 842 |
Project_CodeNet | 2,019 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static void main(String[] args) {
InputStrea... | 758 |
Project_CodeNet | 2,017 | import java.awt.geom.Point2D;
import java.io.IOException;
import java.io.InputStream;
import java.util.*;
import java.util.function.BiFunction;
import java.util.function.Function;
import java.util.function.Supplier;
public class Main {
final static int INF = 1 << 28;
final static long MOD = 1_000_000_007;
final ... | 5,444 |
Project_CodeNet | 2,014 |
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Main p = new Main();
}
public Main() {
Scanner sc = new Scanner(System.in);
while(true){
h = sc.nextInt();
w = sc.nextInt();
c = sc.ne... | 781 |
Project_CodeNet | 2,013 | import java.util.Arrays;
import java.util.Scanner;
import java.util.Stack;
public class Main {
public static final int[][] move_dir = new int[][]{{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
public static boolean is_ok(int x, int y, int w, int h){
if(x < 0 || x >= w || y < 0 || y >= h){
return false;
}else{
ret... | 887 |
Project_CodeNet | 2,011 |
import java.util.*;
import java.lang.*;
import java.math.*;
public class Main {
Scanner sc = new Scanner(System.in);
int ni[] ={-1,0,1,0};
int nj[] ={0,-1,0,1};
int h ;
int w ;
int c ;
void label2(int i , int j , int prev, int post, int [][] map){
for(int z= 0; z < 4; z++){
int nni = i + ni[z];
int... | 892 |
Project_CodeNet | 2,016 |
import java.io.*;
import java.util.*;
public class Main {
int H;
int W;
int C;
int[][] map;
int[] DR = {1, 0, -1, 0};
int[] DC = {0, 1, 0, -1};
public void solve() {
while (true) {
H = nextInt();
W = nextInt();
C = nextInt();
if (H == 0) break;
map = new int[H][W];
for(int r = 0; r <... | 1,072 |
Project_CodeNet | 2,012 | import java.util.*;
public class Main{
int h,w,c;
int max;
int from,to;
int ans;
int[][] panel2;
int[] dx = {1,-1,0,0};
int[] dy = {0,0,1,-1};
public static void main(String[] args){
new Main().solve();
}
void solve(){
Scanner sc = new Scanner(System.in);
h = sc.nextInt();
... | 564 |
Project_CodeNet | 2,013 | /**
*
*/
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
/**
* @author kumar1
*
*/
public class Main {
/**
* @par... | 1,836 |
Project_CodeNet | 2,014 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> point;
#define X first
#define Y second
constexpr int NUMBER_OF_COLORS = 6;
constexpr int dx[] = {1, -1, 0, 0};
constexpr int dy[] = {0, 0, 1, -1};
int h, w, c;
inline bool out(int x, int y) {
return x < 0 || x >= w || y < 0 || y >= h;
}
int cal... | 632 |
Project_CodeNet | 2,011 | #include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <assert.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-9;
static const double PI = acos(-1.0);
#define REP... | 691 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
int h,w,c,dx[4]={0,0,1,-1},dy[4]={1,-1,0,0};
vector<int> p(64);
int nu(int x,int y,int cl,int t){
int res=1;
p[y*w+x]=cl;
for(int i=0;i<4;i++){
int nx=x+dx[i],ny=y+dy[i];
if(nx<0||w<=nx||ny<0||h<=ny||p[ny*w+nx]!=t||p[ny*w+nx]==cl)continue;
res+=nu(nx,ny,cl... | 303 |
Project_CodeNet | 2,015 | #include <algorithm>
#include <iostream>
#define N 8
using namespace std;
int h,w,c,p[N][N],d[N][N],t[N][N],change[5],ans;
bool visited[N][N];
void func(int);
void func2(int,int);
int main(){
while(1){
cin>>h>>w>>c;
if(!h&&!w&&!c) break;
for(int i=0;i<h;i++)
for(int j=0;j<w;j++) cin>>p[i][j];
a... | 549 |
Project_CodeNet | 2,015 | #include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int H,W,C;
int tbl[10][10];
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
bool visited[10][10];
void paint(int x,int y,int c){
visited[y][x]=true;
for(int i=0;i<4;++i){
int mx = x+dx[i];
int my = y+dy[i];
if(mx>=W||my>=H||mx<0... | 556 |
Project_CodeNet | 2,016 | # define _CRT_SECURE_NO_WARNINGS 1
# define _USE_MATH_DEFINES
# include <iostream>
# include <numeric>
# include <string>
# include <bitset>
# include <vector>
# include <algorithm>
# include <cstdlib>
# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iomanip>
# include <queue>
# include <sstream>
#... | 798 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.