厦门饮冰信竞

#include <iostream> #include<stdio.h> #include<string.h> #include<algorithm> #include<math.h> using namespace std; float a,b,c,d; float f(float x){ return ((a*x*x*x) + (b*x*x) + (c*x) + d); } void gen(float l,float h){ if(.

#include <iostream> #include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int a[101] = {0}; int r[101] = {0};//用来临时存储 int N=0; int t=0; //存储逆序对 void qsort(int l,int h){ if(l>=h) return; //已为单元素区间 =&gt.

#include <bits/stdc++.h> #include <cstdlib> #include <cstring> #include <string> #include <queue> using namespace std; int b,p,k; int f(int p){ if(p==0)return 1; //递归边界 int temp =f(p/2) %k; temp = (temp*temp.