循环数

数据使用int和long这样都会越界的
使用大数乘法算出两个的结果
判断循环用两个字符串判断是否包含
import java.util.Scanner;
public class Main {
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		while(sc.hasNext()){
			
			String str = sc.nextLine();
			
			String twostr = str+str;
			boolean flag = true;
			
			for(int i= 1; i<=6 ;i++)
			{
				String result = mutli(str,i);
				if(!isCircle(twostr,result)){
					flag = false;
					break;
				}		
			}
			if(flag)
				System.out.println("Yes");
			else
				System.out.println("No");
		}
	}

	 public static String mutli(String s,int n)
	        {
	            char[] ss = s.toCharArray();
	            String result = null;
	            int jinwei = 0;
	            for(int i = s.length()-1;i >= 0;i--)
	            {
	                char c = s.charAt(i);
	                int nn = c - '0';
	                int o = nn * n + jinwei;
	                ss[i] = (char) ((o)%10 + '0');
	                jinwei = o / 10;
	            }
	            if(jinwei==0){
	                result = String.valueOf(ss);
	            }else {
	                result = String.valueOf(jinwei)+String.valueOf(ss);
	            }
	            return result;
	        }

	        private static boolean isCircle(String strcycle,String str) {
	            if(strcycle.contains(str)){
	                return true;
	            }else{
	                return false;
	            }
	        }
}

#include<iostream>
#include<string>
#include<vector>
#include<stack>
using namespace std;
string Mul(const string& s,int index)
{
    string res;
    int tmp=0;
    for(int i=s.size()-1;i>=0;i--)
    {
        int bit=(s[i]-'0')*index+tmp;
        res.push_back(char(bit%10+'0'));
        tmp=bit/10;
    }
    while(tmp)
    {
         res.push_back(tmp%10);
         tmp/=10;
    }
	int index1=0;
	int index2=s.size()-1;
	while(index1<=index2)
	{
		swap(res[index1],res[index2]);
		index1++;
		index2--;
	}
    return res;
}
bool isCarry(const string& s,int i)
{
    string tmp1=Mul(s,i);
    string lei=s+s;
    for(int i=0;i<lei.size();i++)
    {
        string tmp=lei.substr(i,s.size());
        if(tmp==tmp1)
            return true;
    }
    return false;
}
int main()
{
    string s;
    while(cin>>s)
    {
        bool isOk=true;
        for(int i=1;i<=s.size();i++)
        {
            if(!isCarry(s,i))
            {
                isOk=false;
                break;
            }
        }
        if(isOk)
            cout<<"Yes"<<endl;
        else
            cout<<"No"<<endl;
    }
    return 0;
}

import java.util.Scanner;
public class CycleNum {
	 
	    public static void main(String[] args) {
	        Scanner input = new Scanner(System.in);	  
	         while(input.hasNext())
	         {
	             String str = input.nextLine();
	             String strcycle = str +str;
	             boolean resu = isCircle(strcycle, mutliP(str, 1)) &&isCircle(strcycle, mutliP(str, 2)) 
	            		 &&isCircle(strcycle, mutliP(str, 3)) &&isCircle(strcycle, mutliP(str, 4)) 
	            		 &&isCircle(strcycle, mutliP(str, 5))
	                     &&isCircle(strcycle, mutliP(str, 6));
	              
	             if(resu)
	                 System.out.println("Yes");
	             else
	                 System.out.println("No");
	         }
	    }
	    // 字符串全是数字的乘法 
	    public static String mutliP(String s,int n)
	    {
	        char[] ss = s.toCharArray();
	        String result = null;
	        int jinwei = 0;
	        for(int i = s.length()-1;i >= 0;i--)
	        {
	            char c = s.charAt(i);
	            int nn = c - '0';
	            int o = nn * n + jinwei;
	            ss[i] = (char) ((o)%10 + '0');
	            jinwei = o / 10;
	        }
	        if(jinwei==0){
	        	result = String.valueOf(ss);
	        }else {
	        	result = String.valueOf(jinwei)+String.valueOf(ss);
	        }
	        return result;
	    }
	    //判断是否为循环数字
		private static boolean isCircle(String strcycle,String str) {
			if(strcycle.contains(str)){
				return true;
			}else{
				return false;
			}
		}
}

对于每一个输入的数，先找出所有的循环组成；然后依次求2-6倍的结果，判断是是原数的循环。
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<functional>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <exception>

using namespace std;

string add(string num1, string num2)
{
	int n = num1.size();
	int carry = 0;
	for (int i = n - 1; i >= 0; --i)
	{
		int cur = num1[i] - '0' + num2[i] - '0' + carry;
		if (cur >= 10) { carry = 1; cur -= 10; }
		else carry = 0;
		num1[i] = '0' + cur;
	}
	if (carry == 1) num1 = "1" + num1;
	return num1;
}

bool isCirculation(string num)
{
	int n = num.size();
	if (num[0] > '1') return false;
	unordered_set<string> circle;
	string cur = num;
	for (int i = 0; i <= n; ++i)
	{
		circle.emplace(cur);
		cur = cur.substr(1) + cur.substr(0, 1);
	}

	cur = num;
	for (int i = 2; i <= 6; ++i)
	{
		cur = add(cur, num);
		if (circle.find(cur) == circle.end()) return false;
	}

	return true;
}

int main(int argc, char** argv)
{
	string num;
	while (cin >> num)
	{
		if (isCirculation(num)) cout << "Yes" << endl;
		else cout << "No" << endl;
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;

string strAdd(string a, string b) {
    string res; 
    int i, j, tmp, addbit = 0;
    for (i = j = a.length() - 1; 
         i >= 0; --i, --j) {
        tmp = addbit;
        if (i >= 0) {
            tmp += a[i] - '0';
        }
        if (j >= 0) {
            tmp += b[i] - '0';
        }
        res += tmp % 10 + '0';
        addbit = tmp / 10;
    }
    if (addbit) {
        res += addbit + '0';
    }
    reverse(res.begin(), res.end());
    return res;
}

bool isLoopNum(string a, string s) {
    bool flag = true;
    int i, lena= a.length();
    string left, right;
    for (i = 0; i < lena - 1; ++i) {
        left = a.substr(0, i + 1);
        right = a.substr(i + 1);
        right += left;
        if (right == s)
            return true;
    }
    return false;
}

int main() {
    string s, tmp;
    cin >> s;
    tmp = s;
    int len = s.length();
    bool flag = true;
    for (int i = 2; i <= len; ++i) {
        tmp = strAdd(s, tmp);
        if (tmp.length() != s.length() || !isLoopNum(tmp, s)) {
            flag = false;
            break;
        }
    }
    if (flag) {
        cout << "Yes";
    } else {
        cout << "No";
    }
    cout << "\n";
    return 0;
}

#include<iostream>
#include <string>
using namespace std;

string multiplication(string s, int n)
{
	int i = s.size() - 1, num, sum, pre = 0;
	bool sta = false;
	string res;
	for (; i >= 0; i--)
	{
		num = s[i] - '0';
		if (sta == true)
		{
			sum = num * n + pre;
			sta = false;
		}
		else
			sum = num * n;
		if (sum > 9)
		{
			pre = sum / 10;
			sum = sum % 10;
			sta = true;
		}
		char ch = sum + '0';
		res = ch + res;
	}
	if (true == sta)
	{
		char ch = pre + '0';
		res = ch + res;
	}
	return res;
}
bool Stringcompare(string s1, string s2)
{
	if (s1 == s2)
		return true;
	string res;
	char ch = s1[0];
	int len = s2.length();
	bool sta = false;
	for (int i = 1; i < len; i++)
	{
		if (s2[i] == ch)
		{
			res.clear();
			res = s2.substr(i, len - i) + s2.substr(0, i);
			if (res == s1)
			{
				sta = true;
				break;
			}
		}
	}
	return sta;
}

int main()
{
	string s, num;
	while (cin >> s)
	{
		bool sta = true;
		for (int i = 2; i <= 6; i++)
		{
			num = multiplication(s, i);
			if (Stringcompare(s, num) == false)
			{
				sta = false;
				break;
			}
		}
		if (true == sta)
			cout << "Yes" << endl;
		else
			cout << "No" << endl;
	}
	return 0;
}

public class Main{

// write your code here cpp

#include<stdio.h>
#include<string.h>
#include<stdbool.h>

char n[64], m[64];

void calBig(char *n, char *m, int fac)
{
    m[strlen(n)] = '\0';
    for(int i=strlen(n)-1, tmp=0, car=0; i>=0; --i){
        tmp = (n[i]-'0')*fac + car;
        m[i] = tmp%10+'0';
        car = tmp/10;
    }
}

bool isCircle(char *n, char *m)
{
    for(int i=0, k=0; m[i]; ++i, k=0){
    	for(int j=i; 
            m[i]==n[0]&&n[k]&&n[k]==m[j]; ++j, ++k)
            if(!m[j+1]) 
            	j = -1;
        if(!n[k])
            return true;
    }
    return false;
}

int main()
{
    while(~scanf("%60s", n)){
        bool isC = true;
        for(int i=2; i<=6; ++i){
            calBig(n, m, i);
            if(!(isC=isCircle(n, m)))
                break;
        }
        printf("%s\n", isC?"Yes":"No");
    }
    return 0;
}