1061找规律法
来源:互联网 发布:英雄联盟 知乎 编辑:程序博客网 时间:2024/06/05 03:41
#include<iostream>
#include<string.h>
using namespace std;
int main()
{
int a2[5]={6,2,4,8};
int a3[5]={1,3,9,7};
int a4[3]={6,4};
int a7[5]={1,7,9,3};
int a8[5]={6,8,4,2};
int a9[3]={1,9};
int n;
while(scanf("%d",&n)!=EOF&&n!=0)
{
while(n--)
{
long k;
cin>>k;
int g=k%10;
while(g==0){cout<<0<<endl;break;}
while(g==1){cout<<1<<endl;break;}
while(g==5){cout<<5<<endl;break;}
while(g==6){cout<<6<<endl;break;}
while(g==3)
{
int i=k%4;
cout<<a3[i]<<endl;
break;
}
while(g==2)
{
int i=k%4;
cout<<a2[i]<<endl;
break;
}
while(g==7)
{
int i=k%4;
cout<<a7[i]<<endl;
break;
}
while(g==8)
{
int i=k%4;
cout<<a8[i]<<endl;
break;
}
while(g==4)
{
int i=k%2;
cout<<a4[i]<<endl;
break;
} while(g==9)
{
int i=k%2;
cout<<a9[i]<<endl;
break;
}
}
break;
}
return 0;
}
#include<string.h>
using namespace std;
int main()
{
int a2[5]={6,2,4,8};
int a3[5]={1,3,9,7};
int a4[3]={6,4};
int a7[5]={1,7,9,3};
int a8[5]={6,8,4,2};
int a9[3]={1,9};
int n;
while(scanf("%d",&n)!=EOF&&n!=0)
{
while(n--)
{
long k;
cin>>k;
int g=k%10;
while(g==0){cout<<0<<endl;break;}
while(g==1){cout<<1<<endl;break;}
while(g==5){cout<<5<<endl;break;}
while(g==6){cout<<6<<endl;break;}
while(g==3)
{
int i=k%4;
cout<<a3[i]<<endl;
break;
}
while(g==2)
{
int i=k%4;
cout<<a2[i]<<endl;
break;
}
while(g==7)
{
int i=k%4;
cout<<a7[i]<<endl;
break;
}
while(g==8)
{
int i=k%4;
cout<<a8[i]<<endl;
break;
}
while(g==4)
{
int i=k%2;
cout<<a4[i]<<endl;
break;
} while(g==9)
{
int i=k%2;
cout<<a9[i]<<endl;
break;
}
}
break;
}
return 0;
}
0 0
- 1061找规律法
- 找规律
- 找规律!
- 找规律
- 找规律,
- 找规律
- 找规律
- 找规律
- 找规律
- 找规律
- 找规律
- 找规律
- 找规律
- 找规律
- 递归(找规律、找出口)
- 数字找规律
- POJ1450 Gridland [找规律]
- 1694. Spiral (找规律)
- 《编程珠玑》之变位词查找
- ubuntu系统安装FTP
- 安装Gitolite的汇总
- 自定义持久层(dao)框架
- Linux软件的卸载
- 1061找规律法
- [ios专项]几个遗留问题dequeueReusableCellWithIdentifier_2014-05-29
- 学习笔记之 DBUtils 组件
- linux 通用时钟框架CCF
- node和npm的安装
- npm命令
- GridView的监听,选择,美化等详解
- 腾讯云服务器,给力来袭,,开发者扶持计划,,最高1000元的代金券..
- AdapterView、Adapter深度学习