เฉลย Google Code jam 2009 : Welcome to google code jam (Dynamic Programming)

import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Scanner;

public class WelcomToGoogleCodeJam {
	public static void main(String[] args) {
		try {
			String welcom = "welcome to code jam";
			PrintWriter pw = new PrintWriter(new File("out-large.out"));
			Scanner sc = new Scanner(new File("C-large-practice.in"));

			int T = Integer.parseInt(sc.nextLine());
			for (int i = 1; i <= T; i++) {
				String s = sc.nextLine();
				BigInteger mem[] = new BigInteger[welcom.length()];
				for(int j=0;j< welcom.length();j++)
				{
					mem[j] = new BigInteger("0");
				}
				for (int j = 0; j < s.length(); j++) {
					char x = s.charAt(j);
					if (welcom.contains("" + x)) {
						if (x == welcom.charAt(0)) {
							mem[0] = mem[0] .add(BigInteger.ONE);
						} else {
							for (int k = 1; k < welcom.length(); k++) {
								if (x == welcom.charAt(k))
									mem[k] = mem[k].add( mem[k - 1]);
							}
						}
					}
				}
				String output ;
				output = String.format("%04d", mem[ welcom.length()-1].mod(new BigInteger( "10000")));
				System.out.println("Case #"+i+": "+output);
				pw.println("Case #"+i+": "+output);
			}
			pw.close();
		} catch (IOException ee) {
			ee.printStackTrace();
		}

	}
}

#include<stdio.h>
#include<stdlib.h>
#include<conio.h>

typedef struct Nodex
{
	int data;
	Nodex* next;
} Node ; 
typedef struct List
{
	int size;
	Node * head;
} LinkedList; 

void addFirst(LinkedList* ll , int data )
{
	if(ll->head == NULL)
	{
		ll->head = (Node*)malloc(sizeof(Node));
		ll->head->data = data;
		ll->head->next = NULL;
	}
	else
	{
		Node * n=  (Node*)malloc(sizeof(Node));
		n->data = data;
		n->next = ll->head;
		ll->head = n;
	}
	ll->size ++;
}

void addLast(LinkedList* ll , int data )
{
	if(ll->head == NULL)
	{
		ll->head = (Node*)malloc(sizeof(Node));
		ll->head->data = data;
		ll->head->next = NULL;
	}
	else
	{
		Node * n=  (Node*)malloc(sizeof(Node));
		n->data = data;
		n->next = NULL;
		Node * k = ll->head;

		while(k->next != NULL)
		{
			k=k->next;
		}

		k->next = n;
	}
	ll->size ++;
}

void insert(LinkedList* ll , int data,int at)
{
	if(ll->head == NULL)
	{
		if(at ==0 )
		{
			ll->head = (Node*)malloc(sizeof(Node));
			ll->head->data = data;
			ll->head->next = NULL;
		}	
	}
	else
	{ 
		Node * k = ll->head;
		int i=0;
		while(k->next != NULL&& i < at-1)
		{
			k=k->next;
			i++;
		}
		Node * n=  (Node*)malloc(sizeof(Node));
		n->data = data;
		n->next = k->next ;
		k->next = n;
	}
	ll->size ++;
}

void print(LinkedList* ll)
{
	Node * k = ll->head;
	int i=0;
	while(k != NULL)
	{
		printf(" [%d]->     ",k->data, k->next  );
		k=k->next;
		i++;
	}
	printf("\n");
}
void removeLast(LinkedList * ll)
{
	if(ll->head == NULL) return;
	if(ll->size == 1)
	{
		free (ll->head);
		ll->head = NULL;
		ll->size --;
		return;
	}
	Node * k = ll->head;
	int i=0;
	while(k->next->next  != NULL )
	{
		k=k->next;
		i++;
	}
	free (k->next);
	k->next = NULL;
	ll->size --;

}


void sort(LinkedList * ll)
{
	if(ll->head == NULL) return ;
	int s = ll->size;
	int i = 0 ; 
	int m;
	for(;i < s ; i++)
	{
		Node * k = ll->head;
		int j=0;
		while(k->next != NULL && j < s- i )
		{
			if( k->data > k->next->data)
			{
				m = k->data;
				k->data = k->next->data;
				k->next->data = m;
			}
			k=k->next;
			j++;
		}
	}
}
void removeFirst(LinkedList * ll)
{
	if(ll->head == NULL) return;

	Node * n=  ll->head;
	ll->head = ll->head->next;
	free(n);

	ll->size --;
}

void deleteListAll(LinkedList * ll)
{
	while(ll->size > 0 )
	{
		 removeFirst(  ll);
	}
}

int main(int argc,char* argv[])
{

	LinkedList ll;
	ll.head = NULL;
	ll.size = 0; 
	addFirst (&ll,5);
	addFirst (&ll,15);
	addFirst (&ll,3);
	addFirst (&ll,4);
	addFirst (&ll,2);
	addLast (&ll,21);
	insert  (&ll,40,1);

	print (&ll);
	sort(&ll);
	print (&ll);
	

	deleteListAll(&ll);

	return 0;
}

HaarObjectDetector detector;
HaarCascade cascade = new FaceHaarCascade();
detector = new HaarObjectDetector(cascade, 120);

 detector.SearchMode = (ObjectDetectorSearchMode.Default);
            detector.ScalingMode = (ObjectDetectorScalingMode.SmallerToGreater);
            detector.ScalingFactor = 1.5f;
            detector.UseParallelProcessing = true;
            detector.Suppression = 2;

            Stopwatch sw = Stopwatch.StartNew();
            // Process frame to detect objects
            Rectangle[] objects = detector.ProcessFrame(bitmap);

            sw.Stop();
            if (objects.Length > 0)
            {
                RectanglesMarker marker = new RectanglesMarker(objects, Color.Fuchsia);
                bitmap = marker.Apply(bitmap);
            }

fractal Sierpinski triangle โดยใช้ภาษา JAVA

import java.awt.Color;
import java.awt.Dimension;
import java.awt.Graphics;
import java.awt.Toolkit;

import javax.swing.JFrame;
import javax.swing.JPanel;

public class TriangleFractal extends JPanel
{
	public TriangleFractal()
	{
		setBackground(Color.black);
	}
	public void paint(Graphics g)
	{
		super.paint(g);
		for(int i=0;i< 1000000;i++)
		{
			draw( g,  50, getWidth() - 50, getHeight()-50, getWidth()/2, getHeight()-25);
		}
	}

	public void draw(Graphics g, double n,double w,double h,double x,double y)
	{
		if(n ==0)
		{
			g.setColor(Color.green);
			g.fillRect((int)(x+Math.random()*w-w/2),(int) (y+Math.random()*h-h/2), 1, 1);
			return;
		}
		
		double r= Math.random();
		if(r < 1.0/3.0)
		{
			y = y - h /2;
			
		}
		else if(r < 2.0/3.0)
		{
			x = x - w/4;
		}
		else
		{
			x = x + w/4;
		}
		draw( g,  n-1, w/2, h/2, x, y);
	}
	public static void main(String[] args)
	{
		JFrame fnt = new JFrame();
		
		fnt.add(new TriangleFractal());
		fnt.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
		Dimension screenSize = Toolkit.getDefaultToolkit().getScreenSize();
		double width = screenSize.getWidth();
		double height = screenSize.getHeight();
		fnt.setSize((int)width, (int)height);
		fnt.setVisible(true);
		
	}

}

จำนวนครั้งของ recursive n=1

จำนวนครั้งของ recursive n=2

จำนวนครั้งของ recursive n=3

จำนวนครั้งของ recursive n=4

จำนวนครั้งของ recursive n=5

จำนวนครั้งของ recursive n=6

จำนวนครั้งของ recursive n=7

จำนวนครั้งของ recursive n=30

<<First <Back | 1 | 2 | 3 | 4 | 5 | Next> Last>>

รับสอนเขียนโปรแกรมคอมพิวเตอร์ โทร 0853507540 - Page Generated in 0.0861 seconds | Site Views: 330