POJ---3349-Snowflake Snow Snowflakes(hash)
来源:互联网 发布:湖北广电网络武汉有线 编辑:程序博客网 时间:2024/05/18 02:18
Description
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.
Input
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.
Output
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.
Sample Input
21 2 3 4 5 64 3 2 1 6 5
Sample Output
Twin snowflakes found.
Source
#include <iostream>#include <cstdio>#include <cstring>#include <vector>#include <algorithm>#include <map>#include <set>using namespace std;#define maxn 100010#define pri 100007vector<int> hash[pri];int snow[maxn][6];int n;int cmp(int a,int b){ int k,j,ok1; for(k=0; k<6; k++) { ok1=0; for(j=0; j<6; j++) if(snow[a][k]==snow[b][j]) { ok1=1; break; } if(ok1==0) return 0; } return 1;}int main(){ scanf("%d",&n); int i,j; for(i=0; i<n; i++) { for(j=0; j<6; j++) scanf("%d",&snow[i][j]); } int sum,flag=1,key; for(i=0; i<n&&flag!=0; i++) { sum=0; for(j=0; j<6; j++) sum+=snow[i][j]; key=sum%pri; for(j=0; j<hash[key].size(); j++) { if(cmp(i,hash[key][j])) { flag=0; puts("Twin snowflakes found."); break; } } hash[key].push_back(i); } if(flag==1) puts("No two snowflakes are alike."); return 0;}
- POJ---3349-Snowflake Snow Snowflakes(hash)
- POJ 3349 Snowflake Snow Snowflakes(hash)
- poj 3349 Snowflake Snow Snowflakes(hash)
- POJ 3349:Snowflake Snow Snowflakes(Hash)
- POJ 3349 Snowflake Snow Snowflakes(HASH)
- POJ-3349-Snowflake Snow Snowflakes-hash
- POJ 3349 Snowflake Snow Snowflakes hash
- POJ 3349 SNOWFLAKE SNOW SNOWFLAKES(HASH)
- POJ-3349 Snowflake Snow Snowflakes【Hash】
- POJ 3349 Snowflake Snow Snowflakes hash表
- POJ 3349 Snowflake Snow Snowflakes(hash)
- POJ 3349 Snowflake Snow Snowflakes (hash 查找)
- POJ 3349 Snowflake Snow Snowflakes (hash)
- POJ 3349 - Snowflake Snow Snowflakes(Hash)
- POJ 3349 Snowflake Snow Snowflakes (hash)
- poj 3349 Snowflake Snow Snowflakes(hash)
- POJ-3349-Snowflake Snow Snowflakes - hash
- [POJ 3349]Snowflake Snow Snowflakes[hash]
- 演讲大厅安排 解题报告
- nc推单---弹出新单据框
- STM32定时器PWM输出
- Directshow 的前世今生,兼谈Media Foundation
- C调用java代码
- POJ---3349-Snowflake Snow Snowflakes(hash)
- IO-02 整数四则运算
- js思路总结
- C实现二叉树的各种遍历
- ubuntu建立和删除用户
- hdu1175 连连看(DFS+剪枝)
- navicat oracle配置及ORA-28457解决办法
- LINUX 笔记2
- 树根 Digital root