Codeforces 939A题，B题（水题）
题目链接：http://codeforces.com/problemset/problem/939/a
a题
as you could know there are no male planes nor female planes. however, each plane on earth likes some other plane. there are n planes on earth, numbered from 1 to n, and the plane with number i likes the plane with number fi, where 1 ≤ fi ≤ n and fi ≠ i.
we call a love triangle a situation in which plane a likes plane b, plane b likes plane c and plane c likes plane a. find out if there is any love triangle on earth.
the first line contains a single integer n (2 ≤ n ≤ 5000) — the number of planes.
the second line contains n integers f1, f2, ..., fn (1 ≤ fi ≤ n, fi ≠ i), meaning that the i-th plane likes the fi-th.
output «yes» if there is a love triangle consisting of planes on earth. otherwise, output «no».
you can output any letter in lower case or in upper case.
5
2 4 5 1 3
yes
5
5 5 5 5 1
no
in first example plane 2 likes plane 4, plane 4 likes plane 1, plane 1 likes plane 2 and that is a love triangle.
in second example there are no love triangles.
思路：题目大意就是1号喜欢2号，2号喜欢3号，3号喜欢1号，如何去表示呢？用数组来下标来表示，例如a[1]=2，表示1号喜欢2号，同理a[2] = 3,表示2号喜欢3号，a[3] = 1,表示3号喜欢1号。现在的遇到的困难是，如何去表示这三者的关系。请先看ac代码：
#include<iostream>
using namespace std;
int n,a[5001];
int main()
{
while(cin >> n)
{
int flag = 0;//设一个标记
for(int i = 1;i <= n;i++)
cin >> a[i];
for(int i = 1;i <= n;i++)
if(a[a[a[i]]] == i)//只要有满足条件的马上跳出循环，立刻结束
flag = 1;
if(flag == 1)
cout << "yes" << endl;
else
cout << "no" << endl;
}
return 0;
}
a[1]=2,a[2]=3,a[3]=1，这是一组满足条件的三角恋关系，我们拿这个例子来分析。a[1]=2说明1号喜欢2号，我们马上判断2号喜欢的是谁,我们想要知道2号喜欢谁，把a[1]=2（1号喜欢2号）中的2号放入数组a中，即a[a[1]]，因为a[1]=2，a[a[1]]等价于a[2]，这表示的是2号喜欢的是谁，同理，a[2]=3，如何表示3号喜欢谁呢?再把a[a[1]]放入数组a中，即a[a[a[1]]]（即为3号喜欢的是谁），判断3号是否喜欢1号，如果是，则三者满足三角恋的条件，否则不满足，继续判断。好好理解下，理解后就不难了。
b题
题目链接：http://codeforces.com/problemset/problem/939/b
dima has a hamsters farm. soon n hamsters will grow up on it and dima will sell them in a city nearby.
hamsters should be transported in boxes. if some box is not completely full, the hamsters in it are bored, that's why each box should be completely full with hamsters.
dima can buy boxes at a factory. the factory produces boxes of k kinds, boxes of the i-th kind can contain in themselves ai hamsters. dima can buy any amount of boxes, but he should buy boxes of only one kind to get a wholesale discount.
of course, dima would buy boxes in such a way that each box can be completely filled with hamsters and transported to the city. if there is no place for some hamsters, dima will leave them on the farm.
find out how many boxes and of which type should dima buy to transport maximum number of hamsters.
the first line contains two integers n and k (0 ≤ n ≤ 1018, 1 ≤ k ≤ 105) — the number of hamsters that will grow up on dima's farm and the number of types of boxes that the factory produces.
the second line contains k integers a1, a2, ..., ak (1 ≤ ai ≤ 1018 for all i) — the capacities of boxes.
output two integers: the type of boxes that dima should buy and the number of boxes of that type dima should buy. types of boxes are numbered from 1 to k in the order they are given in input.
if there are many correct answers, output any of them.
19 3
5 4 10
2 4
28 3
5 6 30
1 5
思路：题目给的数据范围很大很大，注意用long long！！！判断总仓鼠总数除以某个盒子的容量取余（即%的就行），能被整除最好，说明这个盒子刚好能装满所有的仓鼠。这里要设置一个很大的数，比题目所给的盒子容量最大值还要大1（我设为temp）
然后依次判断总仓鼠数对盒子容量取模的值会不会大于temp，会的话执行接下来的操作，不会的话则跳过，具体在代码中解释。
ac代码
#include<iostream>
using namespace std;
long long n,k;//注意用long long！！！
int main()
{
while(cin >> n >> k)
{
long long temp = 1e18 + 1,flag = 0,heshu = 0,x;//long long！temp的初始值要设定好
for(int i = 1;i <= k;i++)//从第一个盒子开始
{
cin >> x;
if(temp > n % x)//目的是取最小余数的那一项
{
temp = n % x;//满足条件则不断更新临时变量temp的值，一直到余数temp最小为止
flag = i;//用flag记录此时满足条件的是第几个盒子
heshu = n / x;//记录所需要盒子的数目
}
}
cout << flag << " " << heshu << endl;
}
return 0;
}