mirror of
https://github.com/wczffl-503/OI-Codes.git
synced 2025-07-08 02:13:51 +08:00
Update: Rename folder name to XSMOJ
This commit is contained in:
26
XSMOJ/小码君的阶段求和.cpp
Normal file
26
XSMOJ/小码君的阶段求和.cpp
Normal file
@ -0,0 +1,26 @@
|
||||
#include <algorithm>
|
||||
#include <iostream>
|
||||
#include <iomanip>
|
||||
#include <cstring>
|
||||
#include <cstdio>
|
||||
#include <stack>
|
||||
#include <ctime>
|
||||
#include <cmath>
|
||||
#include <queue>
|
||||
typedef long long l;
|
||||
typedef double d;
|
||||
typedef char c;
|
||||
using namespace std;
|
||||
int s(int a,int b,int c){
|
||||
int sum=0;
|
||||
for(int i=a;i<=b;i+=c){
|
||||
sum+=i;
|
||||
}
|
||||
return sum;
|
||||
}
|
||||
int main(){
|
||||
int a,b,c;
|
||||
cin >>a>>b>>c;
|
||||
cout <<fixed<<setprecision(3)<<s(a,b*10,c)*1.0/(s(a,b*2,c*1.0/2)*s(a*1.0/2,b-a,c*2));
|
||||
return 0;
|
||||
}
|
Reference in New Issue
Block a user