hdu5734 Acperience(数学)
2016-07-21 19:33
357 查看
思路:把给的式子展开,然后推推就好了....
#include<algorithm>
using namespace std;
typedef long long LL;
LL gcd(LL a,LL b)
{
return a%b==0?b:gcd(b,a%b);
}
int main()
{
int T,n,t;
scanf("%d",&T);
while(T--)
{
LL sum=0,psum=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&t);
if(t<0)t=-t;
sum+=t;
psum+=(LL)t*t;
}
LL x=psum*n-sum*sum,y=n;
//cout<<x<<" "<<y<<endl;
while(gcd(x,y)!=1)
{
LL gc=gcd(x,y);
x/=gc;
y/=gc;
}
cout<<x<<"/"<<y<<endl;
}
Problem Description
Deep neural networks (DNN) have shown significant improvements in several application domains including computer vision and speech recognition. In computer vision, a particular type of DNN, known as Convolutional Neural Networks (CNN), have demonstrated state-of-the-art
results in object recognition and detection.
Convolutional neural networks show reliable results on object recognition and detection that are useful in real world applications. Concurrent to the recent progress in recognition, interesting advancements have been happening in virtual reality (VR by Oculus),
augmented reality (AR by HoloLens), and smart wearable devices. Putting these two pieces together, we argue that it is the right time to equip smart portable devices with the power of state-of-the-art recognition systems. However, CNN-based recognition systems
need large amounts of memory and computational power. While they perform well on expensive, GPU-based machines, they are often unsuitable for smaller devices like cell phones and embedded electronics.
In order to simplify the networks, Professor Zhang tries to introduce simple, efficient, and accurate approximations to CNNs by binarizing the weights. Professor Zhang needs your help.
More specifically, you are given a weighted vector W=(w1,w2,...,wn).
Professor Zhang would like to find a binary vector B=(b1,b2,...,bn) (bi∈{+1,−1})and
a scaling factor α≥0 in
such a manner that ∥W−αB∥2 is
minimum.
Note that ∥⋅∥ denotes
the Euclidean norm (i.e. ∥X∥=x21+⋯+x2n−−−−−−−−−−−√,
where X=(x1,x2,...,xn)).
Input
There are multiple test cases. The first line of input contains an integer T,
indicating the number of test cases. For each test case:
The first line contains an integers n (1≤n≤100000) --
the length of the vector. The next line contains n integers: w1,w2,...,wn (−10000≤wi≤10000).
Output
For each test case, output the minimum value of ∥W−αB∥2 as
an irreducible fraction "p/q"
where p, q are
integers, q>0.
Sample Input
3
4
1 2 3 4
4
2 2 2 2
5
5 6 2 3 4
Sample Output
5/1
0/1
10/1
Author
zimpha
Source
2016 Multi-University Training Contest 2
#include<algorithm>
using namespace std;
typedef long long LL;
LL gcd(LL a,LL b)
{
return a%b==0?b:gcd(b,a%b);
}
int main()
{
int T,n,t;
scanf("%d",&T);
while(T--)
{
LL sum=0,psum=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&t);
if(t<0)t=-t;
sum+=t;
psum+=(LL)t*t;
}
LL x=psum*n-sum*sum,y=n;
//cout<<x<<" "<<y<<endl;
while(gcd(x,y)!=1)
{
LL gc=gcd(x,y);
x/=gc;
y/=gc;
}
cout<<x<<"/"<<y<<endl;
}
Problem Description
Deep neural networks (DNN) have shown significant improvements in several application domains including computer vision and speech recognition. In computer vision, a particular type of DNN, known as Convolutional Neural Networks (CNN), have demonstrated state-of-the-art
results in object recognition and detection.
Convolutional neural networks show reliable results on object recognition and detection that are useful in real world applications. Concurrent to the recent progress in recognition, interesting advancements have been happening in virtual reality (VR by Oculus),
augmented reality (AR by HoloLens), and smart wearable devices. Putting these two pieces together, we argue that it is the right time to equip smart portable devices with the power of state-of-the-art recognition systems. However, CNN-based recognition systems
need large amounts of memory and computational power. While they perform well on expensive, GPU-based machines, they are often unsuitable for smaller devices like cell phones and embedded electronics.
In order to simplify the networks, Professor Zhang tries to introduce simple, efficient, and accurate approximations to CNNs by binarizing the weights. Professor Zhang needs your help.
More specifically, you are given a weighted vector W=(w1,w2,...,wn).
Professor Zhang would like to find a binary vector B=(b1,b2,...,bn) (bi∈{+1,−1})and
a scaling factor α≥0 in
such a manner that ∥W−αB∥2 is
minimum.
Note that ∥⋅∥ denotes
the Euclidean norm (i.e. ∥X∥=x21+⋯+x2n−−−−−−−−−−−√,
where X=(x1,x2,...,xn)).
Input
There are multiple test cases. The first line of input contains an integer T,
indicating the number of test cases. For each test case:
The first line contains an integers n (1≤n≤100000) --
the length of the vector. The next line contains n integers: w1,w2,...,wn (−10000≤wi≤10000).
Output
For each test case, output the minimum value of ∥W−αB∥2 as
an irreducible fraction "p/q"
where p, q are
integers, q>0.
Sample Input
3
4
1 2 3 4
4
2 2 2 2
5
5 6 2 3 4
Sample Output
5/1
0/1
10/1
Author
zimpha
Source
2016 Multi-University Training Contest 2
相关文章推荐
- UVa 10917 A Walk through the forest
- 7.21
- Android 支付宝API使用流程
- 在任意目录下使用某个shell脚本
- 汉诺塔
- 【软件工程】基准配置(基线配置)
- 敏捷开发:入门视频
- java基础之:java注解
- opencv——操作图像中每一个像素
- TCP/IP详解
- iOS UILabel实现部分字段更改样式使用
- 宏的使用
- bzoj 1585: [Usaco2009 Mar]Earthquake Damage 2 地震伤害
- OpenLayers系列之-Geometry格式转换
- 多校 1001 Acperience
- HDU 1232 畅通工程
- 【软件工程】几种模型概念:瀑布模型,快速原型模型,增量模型,螺旋模型,喷泉模型
- C#读取文本播放相应语音【转】
- 2016 Multi-university training contest
- CodeForces 580B Kefa and Company