USACO 1.2 dualpal
来源:互联网 发布:windows route add 编辑:程序博客网 时间:2024/04/29 07:16
/*
ID:zengzha1
LANG:C++
TASK:dualpal
*/
#include<stdio.h>
int a[110];
int dlp(int n){
int i,j,k,m,f,s=0;
for(i=2;i<=10;i++){
m=0;k=n;f=1;
while(k){
a[++m]=k%i;
k/=i;
}for(j=1;j<=m/2;j++)
if(a[j]!=a[m-j+1]){
f=0;break;
}if(f)s++;
if(s>=2)return 1;
}return 0;
}int main(){
int m,n;
freopen("dualpal.in","r",stdin);
freopen("dualpal.out","w",stdout);
scanf("%d%d",&n,&m);
while(n){
m++;
if(dlp(m)){
printf("%d\n",m);
n--;
}
}return 0;
}
ID:zengzha1
LANG:C++
TASK:dualpal
*/
#include<stdio.h>
int a[110];
int dlp(int n){
int i,j,k,m,f,s=0;
for(i=2;i<=10;i++){
m=0;k=n;f=1;
while(k){
a[++m]=k%i;
k/=i;
}for(j=1;j<=m/2;j++)
if(a[j]!=a[m-j+1]){
f=0;break;
}if(f)s++;
if(s>=2)return 1;
}return 0;
}int main(){
int m,n;
freopen("dualpal.in","r",stdin);
freopen("dualpal.out","w",stdout);
scanf("%d%d",&n,&m);
while(n){
m++;
if(dlp(m)){
printf("%d\n",m);
n--;
}
}return 0;
}
0 0
- usaco 1.2.5 dualpal
- USACO 1.2 dualpal
- usaco-dualpal-1.2宣告结束
- USACO 1.2 Dual Palindromes (dualpal)
- USACO dualpal
- 【USACO】dualpal
- usaco dualpal
- USACO 1.2.5 Dual Palindromes (dualpal)
- usaco/ 1.2 milk2/transform/namenum/palsquare/dualpal
- usaco——dualpal
- 1.2 dualpal
- USACO-Section1.2 dualpal[字符处理]
- dualpal
- 1.2 dualpal 还是进制和回文
- Dualpal解题报告
- USACO1.2:dualpal
- dualpal-section1.2
- USACO 1.2
- 如何自学Android编程
- Android studio设置requestWindowFeature(Window.FEATURE_NO_TITLE);出错
- LeetCode题解:Gas Station
- 文件lseek操作产生空洞文件的方法
- 功能测试(0)-功能测试详解
- USACO 1.2 dualpal
- hdu2680 Choose the best route (dijkstra)
- 功能测试的测试工作流程
- 230. Kth Smallest Element in a BST
- C语言堆栈说明
- 安装Android SDK时遇到"Done loading packages"解决方法
- UVa11292勇士斗恶龙
- poj 2492 A Bug's Life(带权并查集)
- poj1006中国剩余定理