原题:
Given two integers n and k, find how many different arrays consist of numbers from 1 to n such that there are exactly k inverse pairs.
We define an inverse pair as following: For ith and jth element in the ...
The library of fmod is #include
#include
#include
#include
#include
#include
#include
using namespace std;
int main(){
double x;
long y;
long long z;
scanf("%lf",&x);
double doubleMod = fmod(x,(double)3);
p...