# Monthly Archives: April 2010

## Poj Solution 1383

http://poj.org/problem?id=1383 #include"stdio.h" #include"memory.h" char map; bool sign; int max,bx,by,n,m; void init_sign() { int i,j; for(i=0;i<n;i++) for(j=0;j<m;j++) sign[i][j]=0; } void init() { scanf("%d %d",&m,&n); for(int i=0;i<n;i++) scanf("%s",map[i]); } inline int inmap(int x,int y) { return x>=0&&y>=0&&x<n&&y<m; } const int dx[]={0,0,1,-1},dy[]={1,-1,0,0}; void … Continue reading

## Poj Solution 1371

http://poj.org/problem?id=1371 #include <iostream> #include <algorithm> #include <memory.h> using namespace std; int x, y, xn, yn, n, m; struct { int x1, x2, y1, y2; }ln; char map; bool init() { int i, j, l, r, u, d, k; cin >> … Continue reading

## Poj Solution 1368

http://poj.org/problem?id=1368 #include<iostream> #include"memory.h" using namespace std; int set; int map; int n,m; int div(char c) {switch(c) {case ‘O’:return 0; case ‘F’:return 1; case ‘I’:return 2; default:return -1; } } void init() {int i,j,a;char c; memset(set,0,81*sizeof(int)); for(i=0;i<n*m;i++) {for(j=0;j<4;j++) {cin>>c;a[j]=div(c);} set[a][a][a][a]++; } … Continue reading

## Poj Solution 1366

http://poj.org/problem?id=1366 //* @author: <strong>Yeming&nbsp;Hu</strong>&quot;cslittleye@gmail.com&quot; import java.util.*; import java.io.*; public class Main { public static BufferedInputStream bis; public static StringBuilder str; public static char[][] rules; public static StringBuilder[] words; public static int k; public static void main(String[] args) throws Exception { … Continue reading

## Poj Solution 1365

http://poj.org/problem?id=1365 import java.util.*; import java.math.*; public class Main { /** * @param args */ static int pp; static int[] p = new int; static int[] w = new int; static boolean[] q = new boolean; static void init() { int … Continue reading

## Poj Solution 1363

http://poj.org/problem?id=1363 import java.util.*; public class Main { public static void main(String[] args){ Scanner sc = new Scanner(System.in); int in[]=new int; int out[]=new int; int stack[]=new int; int n; int i,j; for(i=0;i< 1001;i++) in[i]=i+1; while(sc.hasNext()) { n=sc.nextInt(); if(n==0) break; while(true) { … Continue reading

## Poj Solution 1362

http://poj.org/problem?id=1362 //* @author: <strong>Yeming&nbsp;Hu</strong>&quot;cslittleye@gmail.com&quot; import java.util.*; public class Main { public static final int max = 30; public static void main(String[] args) { int[] weights = new int[max]; int p = 2; for(int i = 0; i < max; i++) … Continue reading

## Poj Solution 1354

http://poj.org/problem?id=1354 import java.io.BufferedInputStream; import java.math.BigDecimal; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); while (scan.hasNext()) { int n = scan.nextInt(); if (n == -1) { break; } BigDecimal nn = … Continue reading

## Poj Solution 1353

http://poj.org/problem?id=1353 //* @author: import java.util.*; public class Main{ public static void main(String args[]){ Scanner sc=new Scanner(System.in); int a[]=new int,b[]=new int; int n,m,k; while(sc.hasNext()) { String s=sc.nextLine(); Scanner scan=new Scanner(s); scan.useDelimiter(","); n=scan.nextInt(); if(n==-1) break; m=scan.nextInt(); k=scan.nextInt(); for (int i=1;i<=n;i++) { if … Continue reading

## Poj Solution 1351

http://poj.org/problem?id=1351 /* @author:zeropinzuo */ import java.io.*; import java.util.*; public class Main{ static Scanner cin; static long[] f,g; public static void main(String args[]){ cin = new Scanner(System.in); f = new long; g = new long; g=4; g=14; for(int i=3;i< 17;i++) g[i]=3*g[i-1]+2*g[i-2]; … Continue reading

## Poj Solution 1350

http://poj.org/problem?id=1350 //* @author: <strong>Yeming&nbsp;Hu</strong>&quot;cslittleye@gmail.com&quot; import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(true) { String num = sc.next(); if(num.equals("-1")) { break; } System.out.println("N="+num+":"); if(num.length()!=4||(num.charAt(0)==num.charAt(1)&& num.charAt(1)==num.charAt(2)&& num.charAt(2)==num.charAt(3))) { System.out.println("No!!"); }else { int … Continue reading
{"ft_lang_label":"__label__en","ft_lang_prob":0.5148885,"math_prob":0.71959424,"size":6560,"snap":"2022-27-2022-33","text_gpt3_token_len":2205,"char_repetition_ratio":0.13804148,"word_repetition_ratio":0.08618785,"special_character_ratio":0.41951218,"punctuation_ratio":0.21909341,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9878939,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-07-06T15:47:07Z\",\"WARC-Record-ID\":\"<urn:uuid:a3eda577-5639-4dbd-882a-571a55351d42>\",\"Content-Length\":\"41648\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:f278cbd2-7c6e-4a20-88ef-f028d9b2a8f3>\",\"WARC-Concurrent-To\":\"<urn:uuid:89e043cf-0df6-4135-8821-239d9c91d333>\",\"WARC-IP-Address\":\"104.168.243.247\",\"WARC-Target-URI\":\"https://dietoad.org/2010/04/\",\"WARC-Payload-Digest\":\"sha1:VRWYNODAAAFUA4VEXX57SNNTP2ASFA6P\",\"WARC-Block-Digest\":\"sha1:746YTXK5X6FRA2WPQGY7T2O46A5DOTHB\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656104675818.94_warc_CC-MAIN-20220706151618-20220706181618-00228.warc.gz\"}"}