Codeforces Round #304 (Div. 2)

题意大概就是给两组数，每组将第一个拿出来比较大小放入较大的组里后面，问哪个到最后没有了就输了。可能一直循环。

拿queue模拟一下就可以，操作次数大于3000*3000时可以判断是循环的。

#include <bits/stdc++.h>
using namespace std;
queue <int > s1;
queue <int > s2;
int main()
{
	int n;
	cin>>n;
	int k1,k2;
	cin>>k1;
	int t;
	for(int i=1;i<=k1;i++)
	{
		cin>>t;
		s1.push(t);
	}
	cin>>k2;
	for(int i=1;i<=k2;i++)
	{
		cin>>t;
		s2.push(t);
	}
	int cnt=0;
	int flag=0;
	while(!s1.empty()&&!s2.empty())
	{
		int t1=s1.front();
		int t2=s2.front();
		s2.pop();
		s1.pop();
		if(t1>t2)
		{
			s1.push(t2);
			s1.push(t1);
			cnt++;
		}
		else
		{
			s2.push(t1);
			s2.push(t2);
			cnt++;
		}
		if(cnt>10000000)
		{
			flag=1;
			break;
		}
	}
	if(flag) cout<<"-1";
	else if(s1.empty()) cout<<cnt<<" 2";
	else cout<<cnt<<" 1";
	return 0;
}

D. Soldier and Number Game

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Two soldiers are playing a game. At the beginning first of them chooses a positive integer n and gives it to the second soldier. Then the second one tries to make maximum possible number of rounds. Each round consists of choosing a positive integer x > 1, such that n is divisible by x and replacing n with n / x. When n becomes equal to 1 and there is no more possible valid moves the game is over and the score of the second soldier is equal to the number of rounds he performed.

To make the game more interesting, first soldier chooses n of form a! / b! for some positive integer a and b (a ≥ b). Here by k! we denote the factorial of k that is defined as a product of all positive integers not large than k.

What is the maximum possible score of the second soldier?

Input

First line of input consists of single integer t (1 ≤ t ≤ 1 000 000) denoting number of games soldiers play.

Then follow t lines, each contains pair of integers a and b (1 ≤ b ≤ a ≤ 5 000 000) defining the value of n for a game.

Output

For each game output a maximum score that the second soldier can get.

Sample test(s)

input

2
3 1
6 3

output

2
5

题意大概意思是，求出一个区间的所有数的质因子数之和。

可以先预处理出所有从1到n的数的质因子数之和，再减就可以辣

注意scanf printf

#include <bits/stdc++.h>
using namespace std;
int s[5000010];
int d[5000010];
void init()
{
	memset(d,0,sizeof(d));
	for(int i=2;i<=5000000;i++)
	{
		if(d[i]==0)
		{
			for(int j=i;j<=5000000;j+=i)
			{
				int c=j;
				while(c%i==0)
				{
					d[j]++;
					c/=i;
				}
			}
		}
		s[i]=s[i-1]+d[i];
	}
}
int main()
{
	init();
	int T;
	cin>>T;
	int a,b;

	while(T--)
	{
		scanf("%d%d",&a,&b);
		printf("%d\n",s[a]-s[b]);
	}
	return 0;
}