西安电子科技大学第二届程序设计新生赛(同步赛)-E-or2?Scum!

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/C_13579/article/details/84930179

地址：https://ac.nowcoder.com/acm/contest/316/E

思路：容斥原理

Code:

#include<iostream>
#include<sstream> 
#include<map>
using namespace std;
typedef long long LL;

const int a[15]={2,3,5,7,-6, -10,-14,-15,-21,-35, 30,42,70,105,-210};
LL n;

int main()
{
	ios::sync_with_stdio(false);
	while(cin>>n){
		LL ans=0;
		string str="Scum";
		if(n%2==0||n%3==0||n%5==0||n%7==0){
			str="or2";
			for(int i=0;i<15;++i)
				ans+=n/a[i];
			cout<<str<<" "<<ans<<endl;
		}else	cout<<str<<endl;
	}
	
	return 0;
}