hdu5734——Acperience(数学推导)
来源:互联网 发布:大学java专业入门课程 编辑:程序博客网 时间:2024/05/21 13:56
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 . Professor Zhang would like to find a binary vector and a scaling factor in such a manner that is minimum.
Note that denotes the Euclidean norm (i.e. , where ).
Input
There are multiple test cases. The first line of input contains an integer , indicating the number of test cases. For each test case:
The first line contains an integers – the length of the vector. The next line contains integers: .
Output
For each test case, output the minimum value of as an irreducible fraction “/” where , are integers, .
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
题解报告写的很详细了
#include <iostream>#include <cstring>#include <string>#include <vector>#include <queue>#include <cstdio>#include <map>#include <cmath>#include <algorithm>#define INF 0x3f3f3f3f#define MAXN 1010#define mod 1000000007using namespace std;long long gcd(long long a,long long b){ if(b==0) return a; else return gcd(b,a%b);}int main(){ int t,n; scanf("%d",&t); while(t--) { long long sum1=0,sum2=0,w; scanf("%d",&n); for(int i=1;i<=n;++i) { scanf("%I64d",&w); sum1+=abs(w); sum2+=(w*w); } long long a=n*sum2-(sum1*sum1); long long b=n; long long c=gcd(a,b); long long aa=a/c,bb=b/c; printf("%I64d/%I64d\n",aa,bb); } return 0;}
- hdu5734——Acperience(数学推导)
- hdu5734 Acperience(数学)
- hdu5734 Acperience(数学)
- HDU5734 Acperience
- HDU5734 Acperience
- HDOJ 5734 Acperience (数学推导)
- hdu 5734 Acperience(2016 Multi-University Training Contest 2——化简公式,数学推导)
- HDU 5734 Acperience(数学推导【多校联合】)
- (多校第二场1001)HDU5734 Acperience
- hdu 5734 Acperience (数学)
- HDU 5734 Acperience (数学)
- 【HDU5734 2016 Multi-University Training Contest 2A】【公式代入推导】Acperience n维向量各有加减最小模长
- HDOJ 5734 Acperience(数学运算)
- 数学——Acperience ( HDU 5734) ( 2016 Multi-University Training Contest 2 1001 )
- BestCoder 1st Anniversary ——HDU5312(数学推导)
- hdu 5312 Sequence(数学推导——三角形数)
- hdu5810——Balls and Boxes(数学推导)
- 数学推导——ACdream 1067
- java内存模型与类加载机制
- SQLserver事务处理
- OPENCV3.0 函数学习2——cvtColor
- 逻辑运算符----java
- AFNetworking 2.x 修改适配IPV6
- hdu5734——Acperience(数学推导)
- POJ 2528 Mayor's posters 线段树+离散化技巧
- 互联网金融之量化投资深度文本挖掘——附源码文档
- POJ 1961 KMP
- python selenium环境搭建笔记
- poj 1416 Shredding Company
- POJ 2406 Power Strings KMP
- [总结]FFMPEG视音频编解码零基础学习方法
- 清理Xcode缓存