摘要:
SPF Description Consider the two networks shown below. Assuming that data moves around these networks only between directly connected nodes on a peer- 阅读全文
摘要:
Problem F: 我是好人4 Description 众所周知,我是好人!所以不会出太难的题,题意很简单 给你n个数,问你1000000000(含1e9)以内有多少个正整数不是这n个数任意一个的倍数 最后友情提供解题代码(我真是太好人了) void solve(int p[], int n) { 阅读全文