fnmf wh mh on xh kd lh vdm ygd c`n sh lt rgh ygd x`mf cd fdh mh xh fd rgt m pht bgt m cd xtd rgt cd fd rgt
n(1<n<=100)
kaisamima
题目能破解意思就很水拉,
直接枚举一个范围内的凯撒密码移位数,然后会发现每个字母右移一位就是题目的拼音意思了
#include <iostream> #include <cstring> #include <stack> #include <cstdio> #include <cmath> #include <queue> #include <algorithm> #include <vector> #include <set> #include <map> const double eps=1e-8; const double PI=acos(-1.0); using namespace std; int main() { /* char a[]={"fnmf wh mh on xh kd lh vdm ygd c`n sh lt rgh ygd x`mf cd fdh mh xh fd rgt m pht bgt m cd xtd rgt cd fd rgt"}; char b[1005]; for(int i=-10;i<=10;i++) { memset(b,0,sizeof(b)); int j=0; for( j=0;j<strlen(a);j++) b[j]=a[j]+i; b[j]='\0'; printf("%s\n",b); }*/ int n; while(~scanf("%d",&n)){ int ans=0; for(int i=1;i<=n;i++) if(n%i==0) ans++; printf("%d\n",ans); } return 0; }