1月16日训练赛

1月16日训练赛

A

Comrade Dujikov is busy choosing artists for Timofey’s birthday and is recieving calls from Taymyr from Ilia-alpinist.
Ilia-alpinist calls every n minutes, i.e. in minutes n, 2n, 3n and so on. Artists come to the comrade every m minutes, i.e. in minutes m, 2m, 3m and so on. The day is z minutes long, i.e. the day consists of minutes 1, 2, …, z. How many artists should be killed so that there are no artists in the room when Ilia calls? Consider that a call and a talk with an artist take exactly one minute.
Input
The only string contains three integers — n, m and z (1 ≤ n, m, z ≤ 104).
Output
Print single integer — the minimum number of artists that should be killed so that there are no artists in the room when Ilia calls.
Examples
Input
1 1 10
Output
10
Input
1 2 5
Output
2
Input
2 3 9
Output
1
Note
Taymyr is a place in the north of Russia.
In the first test the artists come each minute, as well as the calls, so we need to kill all of them.
In the second test we need to kill artists which come on the second and the fourth minutes.
In the third test — only the artist which comes on the sixth minute.
代码：

#include<iostream>	
#include<stdio.h>
#include<string.h>
#include<math.h>
using namespace std;
int main()
{
    int n,m,z;
    while(cin>>n>>m>>z)
    {
        int i,j;
        i=z/n;
        j=z/m;
        int num=0;
        for(int a=1; a<=i; a++)
            for(int b=1; b<=j; b++)
            {
                if(a*n==b*m)
                    num++;
            }
        cout<<num<<endl;
    }
}

已AC

B
Young Timofey has a birthday today! He got kit of n cubes as a birthday present from his parents. Every cube has a number ai, which is written on it. Timofey put all the cubes in a row and went to unpack other presents.
In this time, Timofey’s elder brother, Dima reordered the cubes using the following rule. Suppose the cubes are numbered from 1 to n in their order. Dima performs several steps, on step i he reverses the segment of cubes from i-th to (n - i + 1)-th. He does this while i ≤ n - i + 1.
After performing the operations Dima went away, being very proud of himself. When Timofey returned to his cubes, he understood that their order was changed. Help Timofey as fast as you can and save the holiday — restore the initial order of the cubes using information of their current location.
Input
The first line contains single integer n (1 ≤ n ≤ 2·105) — the number of cubes.
The second line contains n integers a1, a2, …, an ( - 109 ≤ ai ≤ 109), where ai is the number written on the i-th cube after Dima has changed their order.
Output
Print n integers, separated by spaces — the numbers written on the cubes in their initial order.
It can be shown that the answer is unique.
Examples
Input
7
4 3 7 6 9 1 2
Output
2 3 9 6 7 1 4
Input
8
6 1 4 2 5 6 9 2
Output
2 1 6 2 5 4 9 6
Note
Consider the first sample.
At the begining row was [2, 3, 9, 6, 7, 1, 4].
After first operation row was [4, 1, 7, 6, 9, 3, 2].
After second operation row was [4, 3, 9, 6, 7, 1, 2].
After third operation row was [4, 3, 7, 6, 9, 1, 2].
At fourth operation we reverse just middle element, so nothing has changed. The final row is [4, 3, 7, 6, 9, 1, 2]. So the answer for this case is row [2, 3, 9, 6, 7, 1, 4].
代码：

#include<iostream>	
#include<stdio.h>
#include<string.h>
using namespace std;
int main()
{int n,a[200001];
		while(cin>>n)
	    {
		for(int i=1;i<=n;i++)
		cin>>a[i];
		for(int i=1;i<=(n+1)/2;i++)
		{
			if(i%2==1)
			{
				int t=a[i];
				a[i]=a[n-i+1];
				a[n+1-i]=t;
			}
		}
		for(int i=1;i<n;i++)
		{
			cout<<a[i]<<' ';
		}
cout<<a[n];
}
}

D
在一个国家仅有1分，2分，3分硬币，将钱N兑换成硬币有很多种兑法。请你编程序计算出共有多少种兑法。
代码一：

#include<iostream>
#include<cstdio>
using namespace std;
 int main()
{
int money；
int i,j,k;
while(cin>>money）
{int n=0；
    for(k=0; k<=money/3; k++)
    {
        for(j=0; j<=money/2; j++)
       {
            for(i=0; i<=money; i++)
            {
                if(i+2*j+3*k==money)
                    n++；
            }
        }
    }
    cout<<n<<endl;
}
}

从0到money逐个测试,超时。
改进：

#include<iostream>
#include<cstdio>
using namespace std;
 int main()
{
  int n;
    while(cin>>money)
    {
        int c=0;
        for(int i=0;i<=money/3;i++)
        {
            c+=(money-3*i)/2+1;
        }
        cout<<c<<endl;
    }
}

兑换3分的数量从0开始，一直到N/3；每种3分的数量对应着c种情况，这c种情况的数量等于剩余钱币可兑换2分硬币的的数量加1（全是1分硬币）。

E
Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn’t accept challenges unless he is sure he can win, so he asked you to tell him if he should accept the challenge. Given the lengths of the line segments, check if he can choose exactly 3 of them to form a non-degenerate triangle.
Mahmoud should use exactly 3 line segments, he can’t concatenate two line segments or change any length. A non-degenerate triangle is a triangle with positive area.
Input
The first line contains single integer n (3 ≤ n ≤ 105) — the number of line segments Mahmoud has.
The second line contains n integers a1, a2, …, an (1 ≤ ai ≤ 109) — the lengths of line segments Mahmoud has.
Output
In the only line print “YES” if he can choose exactly three line segments and form a non-degenerate triangle with them, and “NO” otherwise.
Examples
Input
5
1 5 3 2 4
Output
YES
Input
3
4 1 2
Output
NO
Note
For the first example, he can use line segments with lengths 2, 4 and 5 to form a non-degenerate triangle.
能够构成三角形的条件：任意两边之和都大于第三边。

	#include<iostream>
	#include<cstdio>
	using namespace std;
	int main()
	{
	    int n;
	    while(cin>>n)
	    {
	        int p[n];
	        int a,b,c;
	        int m=0;
	        for(int i=0; i<n; i++)
	            cin>>p[i];
	        sort(a,a+n);
	        for(a=0; a<n; a++)
	            {for(b=a; b<n; b++)
	                for(c=b; c<n; c++)
	                    if(p[a]+p[b]>p[c]&&p[c]+p[b]>p[a]&&p[a]+p[c]>p[b]
	                    &&p[a]!=p[b]&&p[b]!=p[c]&&p[c]!=p[a])
	                        m++;
	            }
	            cout<<m<<endl;
	            if(m==0)
	                cout<<"NO"<<endl;
	            else
	                cout<<"YES"<<endl;
	    }
	}

超时。
改进方案：

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int main()
{
    int n;
    while(cin>>n)
    {
        int a[10000];
        int p,i;
        int m=0;
        for(i=0; i<n; i++)
            cin>>a[i];
        sort(a,a+n);
        for(p=0; p<n; p++)
            if(a[p]+a[p+1]>a[p+2])
            {
                m++;
            }
        if(m==0)
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;
    }
}

将线段按长度由短到长排列，则如果前两条线段的和大于第三条，则三角形成立。
在某些测试用例上仍然超时。