# Monthly Archives: July 2016

## Poj Solution 3981

http://poj.org/problem?id=3981 #include <stdio.h> #include <string.h> #define MAX_LEN 1024 int main(int argc, char **argv) { char str[MAX_LEN]; int i, len; while(gets(str)) { len = strlen(str); for(i = 0; i < len; ++i) { if(‘y’ != str[i]) { putchar(str[i]); } else { … Continue reading

Posted in poj | Comments Off on Poj Solution 3981

## Poj Solution 3980

http://poj.org/problem?id=3980 #include <stdio.h> int mod(int n, int m){ return n%m; } int main(){ int m,n; while(scanf("%d%d",&n,&m)!=EOF){ printf("%dn",mod(n,m)); } return 0; }

Posted in poj | Comments Off on Poj Solution 3980

## Poj Solution 3979

http://poj.org/problem?id=3979 #include <stdio.h> #include <string.h> #include <stdlib.h> #include <math.h> int gdb(int a,int b) { int tmp,ret; if(a < b) { tmp = a; a = b; b =tmp; } while(b) { tmp = a; a = b; b = tmp%b; … Continue reading

Posted in poj | Comments Off on Poj Solution 3979

## Poj Solution 3934

http://poj.org/problem?id=3934 #include <stdio.h> int dp; int main() { int n,m,i,j,k; for(i=1;i<=80;i++){ for(j=0,k=i-1;j<k;j++) dp[i][j]=0; } dp=1; dp=2; dp=4; dp=2; for(i=4;i<=80;i++){ for(j=i-1;j<=200;j++){ dp[i][j]=0; if(j>=2) dp[i][j]=(dp[i-1][j-2]*(i-2))%9937; if(j>=1) dp[i][j]=(dp[i][j]+dp[i-1][j-1]*2)%9937; } } while(scanf("%d%d",&n,&m),n||m){ if(m>=200) printf("0n"); else printf("%dn",dp[n][m]); } return 0; }

Posted in poj | Comments Off on Poj Solution 3934

## Poj Solution 3768

http://poj.org/problem?id=3768 import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while (sc.hasNextInt()) { int n = sc.nextInt(); if (n == 0) break; sc.nextLine(); String[] template = new String[n]; for (int i = … Continue reading

Posted in poj | Comments Off on Poj Solution 3768

## Poj Solution 3767

http://poj.org/problem?id=3767 import java.util.Scanner; public class Main{ public static void dijkstra(int[][] GA, int[] leader, int road) { if (road == 0) System.out.println(-1); else { int size = GA.length; // System.out.println(size); int[] dist = new int[size]; int[] isUsed = new int[size]; isUsed … Continue reading

Posted in poj | Comments Off on Poj Solution 3767

## Poj Solution 3763

http://poj.org/problem?id=3763 //* @author import java.util.*; import java.io.*; public class Main { static Scanner in = new Scanner(System.in); static class Node extends LinkedList< Node> { final int[] dp = new int[]{-1, -1}; int query(int b) { if(dp[b]< 0) init(null); return dp[b]; … Continue reading

Posted in poj | Comments Off on Poj Solution 3763

## Poj Solution 3753

http://poj.org/problem?id=3753 import java.io.BufferedInputStream; import java.util.Scanner; /** * *poj3753 * C������� * while(EOF != scanf("%s",source)) *�ȼ���java���while (scan.hasNext()) * @author NC */ public class Main { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); while (scan.hasNext()) { String … Continue reading

Posted in poj | Comments Off on Poj Solution 3753

## Poj Solution 3752

http://poj.org/problem?id=3752 import java.io.BufferedInputStream; import java.util.Scanner; /** * *poj3752 * ģ�� * @author NC */ public class Main { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); if (scan.hasNext()) { int m = scan.nextInt(); int n = … Continue reading

Posted in poj | Comments Off on Poj Solution 3752

## Poj Solution 3751

http://poj.org/problem?id=3751 import java.io.BufferedInputStream; import java.text.ParseException; import java.text.SimpleDateFormat; import java.util.Locale; import java.util.Scanner; import java.util.logging.Level; import java.util.logging.Logger; /* * To change this template, choose Tools | Templates * and open the template in the editor. */ /** * * poj3751 easy * … Continue reading

Posted in poj | Comments Off on Poj Solution 3751

## Poj Solution 3750

http://poj.org/problem?id=3750 #include <stdio.h> #include <string.h> int main() { int n, w, s; int i, j; char name; scanf("%d", &n); getchar(); for (i=0; i<n; ++i) { gets(name[i]); } scanf("%d,%d", &w, &s); i = w-1; while (n != 0) { if (i+s-1 … Continue reading

Posted in poj | Comments Off on Poj Solution 3750

## Poj Solution 3749

http://poj.org/problem?id=3749 #include<stdio.h> #include<string.h> int main() { void translate(char word[]); char start; char end; char word; while(1) { gets(start); if(strcmp(start,"START")!=0) break; gets(word); translate(word); puts(word); gets(end); } } void translate(char word[]) { int i,len; len=strlen(word); for(i=0;i<len;i++) { if(word[i]>=’A’&&word[i]<=’E’) { word[i]+=21; } else … Continue reading

Posted in poj | Comments Off on Poj Solution 3749