2013
11-12

# Snowflake Snow Snowflakes

You may have heard that no two snowflakes are alike. Your task is to write a program to determine whether this is really true. Your program will read information about a collection of snowflakes, and search for a pair that may be identical. Each snowflake has six arms. For each snowflake, your program will be provided with a measurement of the length of each of the six arms. Any pair of snowflakes which have the same lengths of corresponding arms should be flagged by your program as possibly identical.

The first line of input will contain a single integer n, 0 < n ≤ 100000, the number of snowflakes to follow. This will be followed by n lines, each describing a snowflake. Each snowflake will be described by a line containing six integers (each integer is at least 0 and less than 10000000), the lengths of the arms of the snow ake. The lengths of the arms will be given in order around the snowflake (either clockwise or counterclockwise), but they may begin with any of the six arms. For example, the same snowflake could be described as 1 2 3 4 5 6 or 4 3 2 1 6 5.

If all of the snowflakes are distinct, your program should print the message:
No two snowflakes are alike.
If there is a pair of possibly identical snow akes, your program should print the message:
Twin snowflakes found.

2
1 2 3 4 5 6
4 3 2 1 6 5

Twin snowflakes found.

//* @author:
import java.util.StringTokenizer;
import java.io.IOException;
class Node
{
int index;
Node next;
}
public class Main
{
final int N=9997;

int [][]snow=new int[100010][6];
boolean check(int s1,int  s2)
{
boolean flag;
int temp;

for(int j=0;j< 6;j++)
{
flag=true;
for(int step=0;step< 6;step++)
{
if(snow[s1][(j+step)%6]!=snow[s2][step])
{    flag=false;    break;    }
}
if(flag) return true;
}

for(int j=0;j< 6;j++)
{
flag=true;
for(int step=0;step< 6;step++)
{
temp=j-step;
if(temp< 0) temp+=6;
if(snow[s1][temp]!=snow[s2][step])
{    flag=false;    break;    }
}
if(flag) return true;
}
return false;
}
boolean solve() throws IOException
{
int num,sum;
String input;
StringTokenizer st;

Node[]vs=new Node[N];
for(int i=1;i<=num;i++)
{
sum=0;
st=new StringTokenizer(input);
for(int j=0;j< 6;j++)
{
snow[i][j]=Integer.parseInt(st.nextToken());
sum+=snow[i][j];
}
if(vs[sum%N]==null)        //添加链表
{
Node node=new Node();
node.index=i;
node.next=null;
vs[sum%N]=node;
}
else
{
Node node=new Node();
node.index=i;
node.next=vs[sum%N];
vs[sum%N]=node;
}
}
for(int i=0;i< N;i++)
{
for(Node n1=vs[i]; n1!=null; n1=n1.next)
for(Node n2=n1.next; n2!=null; n2=n2.next)
if(check( n1.index , n2.index ))    return true;
}
return false;
}

public static void main(String args []) throws IOException
{
Main test=new Main();
if(test.solve())
System.out.println("Twin snowflakes found.");
else
System.out.println("No two snowflakes are alike.");
}
}

1. #include <cstdio>

int main() {
int n, u, d;
while(scanf("%d%d%d",&n,&u,&d)==3 && n>0) {
if(n<=u) { puts("1"); continue; }
n-=u; u-=d; n+=u-1; n/=u;
n<<=1, ++n;
printf("%dn",n);
}
return 0;
}

2. 这道题这里的解法最坏情况似乎应该是指数的。回溯的时候
O(n) = O(n-1) + O(n-2) + ….
O(n-1) = O(n-2) + O(n-3)+ …
O(n) – O(n-1) = O(n-1)
O(n) = 2O(n-1)