hiho week 189 register

Ended

Participants:100

Verdict:Accepted
Score:100 / 100
Submitted:2018-02-11 01:35:03

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<bits/stdc++.h>
struct node{
    double l;
    int a,b;
    double cal()
    {
        return l=(log(a+1)-log(a))/b;
    } 
    void swip(node &x)
    {
        double lt;
        int at,bt;
        lt=l;
        at=a;
        bt=b;
        l=x.l;
        a=x.a;
        b=x.b;
        x.l=lt;
        x.a=at;
        x.b=bt;
    }
}p[20];
int main()
{
    int i,j,k,l;
    int N,K;
    double ans;
    ans=1;
    scanf("%d %d",&N,&K);
    for(i=0;i<K;i++)scanf("%d",&p[i].a);
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX