摘要： 每四个一循环一次。 1 #include<iostream.h> 2 using namespace std; 3 int main() 4 { 5 int n; 6 while(cin>>n) 7 { 8 if (n%4 == 2) 9 cout<<"yes"<<endl;10 else11 cout<<"no"<<endl;12 }13 return 0;14 } 阅读全文

摘要： Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains two or more digits, those digits are summed and the process is repeated. This is cont 阅读全文