POJ训练计划3349_Snowflake Snow Snowflakes(哈希)
来源:互联网 发布:数据自动统计分析方法 编辑:程序博客网 时间:2024/04/30 08:00
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 <algorithm>using namespace std;struct node{ int dx[7];}num;int head[5000];node hash[5000][5000];int main(){ int n,i,j,ok=0,sum,lll; scanf("%d",&n); for(i=0;i<n;i++) { sum=0; for(j=0;j<6;j++) { scanf("%d",&num.dx[j]); sum=(sum+num.dx[j])%4997; } sort(num.dx,num.dx+6); if(ok==0) { for(j=0;j<head[sum];j++) { lll=0; for(int k=0;k<6;k++) { if(hash[sum][j].dx[k]!=num.dx[k]) { lll=1; break; } } if(!lll) { ok=1; break; } } } hash[sum][head[sum]++]=num; } if(ok)cout<<"Twin snowflakes found."<<endl; else cout<<"No two snowflakes are alike."<<endl;}
自己又尝试用STL的vector写了下。。。
#include <cstdio>#include <iostream>#include <cstring>#include <vector>#include <algorithm>using namespace std;struct node{ int d[10];};vector<node>hash[100010];int main(){ int n,f=0,sum,i,j,lll=0,ok=0; node num; scanf("%d",&n); for(i=0; i<n; i++) { sum=0; for(j=0; j<6; j++) { scanf("%d",&num.d[j]); sum=(sum+num.d[j]%14997)%14997; } sort(num.d,num.d+6); if(ok==0) { int sz=hash[sum].size(); for(j=0; j<sz; j++) { lll=0; for(int k=0; k<6; k++) if(hash[sum][j].d[k]!=num.d[k]) { lll=1; break; } if(!lll) { ok=1; break; } } hash[sum].push_back(num); } } if(ok)cout<<"Twin snowflakes found."<<endl; else cout<<"No two snowflakes are alike."<<endl;}
- POJ训练计划3349_Snowflake Snow Snowflakes(哈希)
- poj 3349_Snowflake Snow Snowflakes_hash
- poj Snowflakes snow snowflakes 哈希
- poj 3349 Snowflake Snow Snowflakes 哈希
- Snowflake Snow Snowflakes - POJ 3349 哈希
- ***POJ 3349 Snowflake Snow Snowflakes(哈希)
- POJ 3349 Snowflake Snow Snowflakes(哈希)
- Poj 3349 Snowflake Snow Snowflakes(哈希+vector)
- poj-3349-Snowflake Snow Snowflakes-哈希
- POJ 3349-Snowflake Snow Snowflakes(哈希)
- poj 3349 Snowflake Snow Snowflakes 哈希
- POJ 3349 Snowflake Snow Snowflakes 哈希
- POJ Snowflake Snow Snowflakes 3349 (哈希)
- (POJ 3349)Snowflake Snow Snowflakes 哈希
- Snowflake Snow Snowflakes poj 3349 哈希
- poj--3349 Snowflake Snow Snowflakes(哈希)
- poj 3349 Snowflake Snow Snowflakes (哈希)@
- POJ 3349 Snowflake Snow Snowflakes
- 思科寄存器值
- 对象模型图【OMD】阅读指南
- 学习记录
- Java Doc 建议不要使用 JPasswordField.getText()
- 3.进程间的软中断通信
- POJ训练计划3349_Snowflake Snow Snowflakes(哈希)
- 希尔排序(分组插入法)
- 分析cocos2d-x是如何异步的去加载图片
- 联想 笔记本 Lenovo Y410P 在 Linux Ubuntu 下 Wifi无线网不能搜索的问题 博通Broadcom 43xx 无线网卡驱动安装 插耳机后爆破的声音 拔电源后吱吱硬盘声音
- 设计模式——创建型模式
- 基于vim的golang开发环境配置
- 【剑指offer】扑克牌的顺子
- Redhat 系统更换配置yum源
- 欢迎使用马克飞象专业版