刚学OI,30分求助

P2312 [NOIP2014 提高组] 解方程

可能是你长得帅吧
by dagggg @ 2018-11-01 10:40:05


您好,您为什么要强调您刚学OI呢?
by andyli @ 2018-11-01 10:40:14


@[andyli](/space/show?uid=84282) 重点是wa了,而不是刚学OI
by xiaolou @ 2018-11-01 10:41:11


@[xiaolou](/space/show?uid=68675) `qjz`函数的返回类型改为`long long`
by andyli @ 2018-11-01 10:41:20


@[xiaolou](/space/show?uid=68675) `t`数组要开`10^6(1000000)`
by andyli @ 2018-11-01 10:42:24


@[andyli](/space/show?uid=84282) 谢谢
by xiaolou @ 2018-11-01 10:43:30


@[andyli](/space/show?uid=84282) 现在还是wa ```cpp #include <iostream> using namespace std; int a[105],t[1000005]; int n,m; bool qjz(int x) { long long sum=0; for(int i=n+1;i>1;i--) { sum=((a[i]+sum)*x); } if(sum+a[1]==0) return true; return false; } int main() { int ans=0; cin >> n >> m; for(int i=1;i<=n+1;i++) cin >> a[i]; for(int i=1;i<=m;i++) { if(qjz(i)==true) { ans++; t[ans]=i; } } cout << ans <<endl; for(int i=1;i<=ans;i++) cout << t[i] <<endl; return 0; } ```
by xiaolou @ 2018-11-01 10:44:07


@[xiaolou](/space/show?uid=68675) ```cpp bool qjz(int x) { long long sum=0; for(int i=n+1;i>1;i--) { sum=((a[i]+sum)*x)%1000000007; } if((sum+a[1])%1000000007==0) return true; return false; } ```
by andyli @ 2018-11-01 10:49:28


为什么你们刚学OI的都怎么强QAQ
by 自闭头铁娃 @ 2018-11-01 11:03:07


@[一只废柴墨](/space/show?uid=100967) 我学OI两年,~~却是个蒟蒻~~
by andyli @ 2018-11-01 11:10:18


| 下一页