AtCoder Beginner Contest 183----B - Billiards（double），C - Travel

旧人旧事更值得怀念，或悲或喜每个人身上都承载着某一段时光，但是我会永远清澈永远疯狂永远浪漫。没有人能回到过去重新活过，但你我都可以从现在开始，决定我们未来的模样。
                                                                                                                                                                           ----喻言

 

题解：注意输入变量也要定义成double，否则就一直WA一直WA一直WA。

 

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <ctime>
#include <cctype>
#include <bitset>
#include <utility>
#include <complex>
#include <iomanip>
#include <numeric>
#include<unordered_set>
#include <climits>//INT_100010n
#include <regex>
#include<deque>
//#include<bits/stdc++.h>
#define PP pair<ll,int>
#define inf 0x3f3f3f3f
#define INF 0x7fffffff
#define llinf 0x3f3f3f3f3f3f3f3fll
#define dinf 1000000000000.0
#define PI 3.1415926
#define LL unsigned int
#define wc 1e-18
typedef long long ll;
using namespace std;
const ll mod=1e9+7;
typedef long long ll;
const int N=5010;
double sx,sy,gx,gy;
int main(){
    cin>>sx>>sy>>gx>>gy;
    if(sx>gx){
        swap(sx,gx);
        swap(sy,gy);
    }
    double x=(sy*gx+gy*sx)/(gy+sy);
    printf("%.10f\n",x);
    return 0;
}

 

题解：见代码，暴力dfs即可 

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <ctime>
#include <cctype>
#include <bitset>
#include <utility>
#include <complex>
#include <iomanip>
#include <numeric>
#include<unordered_set>
#include <climits>//INT_100010n
#include <regex>
#include<deque>
//#include<bits/stdc++.h>
#define PP pair<ll,int>
#define inf 0x3f3f3f3f
#define INF 0x7fffffff
#define llinf 0x3f3f3f3f3f3f3f3fll
#define dinf 1000000000000.0
#define PI 3.1415926
#define LL unsigned int
#define wc 1e-18
typedef long long ll;
using namespace std;
const ll mod=1e9+7;
typedef long long ll;
ll N,K,jg,mp[10][10],vis[10];
void dfs(ll ct,ll sum,ll zh)
{
    if(ct==N)
    {
        if(sum+mp[zh][1]==K)
            jg++;
        return ;
    }
    ct++;
    for(int i=2; i<=N; i++)
    {
        if(vis[i]==0)
        {
            vis[i]=1;
            dfs(ct,sum+mp[zh][i],i);
            vis[i]=0;
        }
    }
}
int main()
{
    cin>>N>>K;
    for(int i=1; i<=N; i++)
        for(int j=1; j<=N; j++)
            cin>>mp[i][j];
    vis[1]=1;
    dfs(1,0,1);
    cout<<jg<<endl;
    return 0;
}