|
cout<<"/"<<2*a/t;
cout<<endl; } } return 0; }
题目 3929 [CSP 2023J]一元二次方程
2025-07-20 20:02:18
|
|
y)==0)
{ k*=y; d/=(y*y); } if(d==0||d==1) { t=abs(god(2*a,-b+k*d)); cout<<(-b+k*d)/t; if(2*a/t != 1) cout<<"/"<<2*a/t; cout<<endl; continue; } g: t=abs(god(-b,2*a)); if(-b/t==0) goto g; cout<<-b/t; if(2*a/t != 1) cout<<"/"<<2*a/t; cout<<"+"; t=abs(god(k,2*a)); if(k/t != 1) cout<<k/t<<"*"; cout<<"sqrt("<<d<<")"; if(2*a/t != 1)
题目 3929 [CSP 2023J]一元二次方程
2025-07-20 20:02:03
|
|
int t,m,a,b,c,d,q1,q2,q3,r,x,y,zi,mu;
cin>>t>>m; for(int i=1;i<=t;i++) {cin>>a>>b>>c; if(a<0) {a=-a; b=-b; c=-c; } d=b*b-4*a*c;mu=2*a; if(d<0) cout<<"NO"; else if(d>=0) {q2=iff(d); if(q2*q2==d) {zi=-b+q2; zi=zi/gcd(
题目 3929 [CSP 2023J]一元二次方程
2025-07-20 20:01:56
|
|
#include<bits/stdc++.h>
using namespace std; int gcd(int x,int y){ if(y == 0)return x; x = abs(x),y = abs(y); return gcd(y,x%y); } int iff(int d) {int i=1,an; for(i=1;i<=d;i++) {if(d%(i*i)==0) an=i; } return i; } int main(){ freopen("uqe.in","r",stdin); freopen("uqe.out","w",stdout);
题目 3929 [CSP 2023J]一元二次方程
2025-07-20 20:01:37
|
|
#include<bits/stdc++.h>
using namespace std; int god(int a,int b) { if(b==0) return a; else return god(b,a%b); } int main() { freopen("uqe.in","r",stdin); freopen("uqe.out","w",stdout); int T, M; cin >> T >> M; while (T--) { int a, b, c; cin >> a >> b >> c; int d=b*b-4*a*c; if(d<0) cout<<"NO"; else {int p,q; //★★☆ if(a>0) { a=-a; b=-b; c=-c; } int k=1,t; for(int y=2;y*y<=d;y++) while(d%(y*
题目 3929 [CSP 2023J]一元二次方程
2025-07-20 20:01:31
|
|
炸了
|
|
暂时有
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]()
题目 3929 [CSP 2023J]一元二次方程
2025-07-20 19:48:37
|
|
66666666
|
|
#include<bits/stdc++.h>
using namespace std; int main() { freopen("uqe.in","r",stdin); freopen("uqe.out","w",stdout); int T, M; cin >> T >> M; while (T--) { int a, b, c; cin >> a >> b >> c; int d=b*b-4*a*c; if(d<0) cout<<"NO"; else {int p,q; //★★☆ } } return 0; }
题目 3929 [CSP 2023J]一元二次方程
2025-07-18 20:02:09
|
|
好好好
|
|
题目 3929 [CSP 2023J]一元二次方程
2023-11-03 20:27:16
|
|
题目 3929 [CSP 2023J]一元二次方程
2023-10-31 19:04:37
|
|
三年oi一场空,不开long long 见祖宗
题目 3929 [CSP 2023J]一元二次方程
2023-10-30 21:20:30
|