铺地毯,求看

P1421 小玉买文具

@[刘素质](/space/show?uid=102028) 你算算你的内存用了多少,99999*99999你确定开得下?还有,铺地毯为什么要放在小玉买文具的题目讨论中
by 1124828077ccj @ 2018-07-15 12:15:01


这道题不能用二维数组
by zhz小蒟蒻 @ 2018-07-15 12:15:17


-而是应该用一维数组 -#include <iostream> #include <cstdio> using namespace std; int main() { int x,y; int i,j,t,n; int a[10001],b[10001],g[10001],k[10001]; int t1[10001]={0},sum1=0; cin>>n; for(i=1;i<=n;i++) cin>>a[i]>>b[i]>>g[i]>>k[i]; cin>>x>>y; for(i=1;i<=n;i++) { if(x>=a[i] && x<=a[i]+g[i] && y>=b[i] && y<=b[i]+k[i]) { sum1++; t1[sum1]=i; } } if(sum1>=1) { cout<<t1[sum1]; } else printf("-1"); return 0; }-
by zhz小蒟蒻 @ 2018-07-15 12:18:51


好吧,哪位好心人能帮我用Markdown调一下
by zhz小蒟蒻 @ 2018-07-15 12:19:19


@[zhz_94me](/space/show?uid=101042) 用Markdown插入代码:在代码前后插入```
by Nero_Claudius @ 2018-07-15 12:20:55


@[zhz_94me](/space/show?uid=101042) ```cpp include <cstdio> using namespace std; int main() { int x,y; int i,j,t,n; int a[10001],b[10001],g[10001],k[10001]; int t1[10001]={0},sum1=0; cin>>n; for(i=1;i<=n;i++)cin>>a[i]>>b[i]>>g[i]>>k[i]; cin>>x>>y; for(i=1;i<=n;i++) { if(x>=a[i] && x<=a[i]+g[i] && y>=b[i] && y<=b[i]+k[i]) { sum1++; t1[sum1]=i; } } if(sum1>=1) { cout<<t1[sum1]; } else printf("-1"); return 0; } ```
by Nero_Claudius @ 2018-07-15 12:22:29


``` #include <iostream> #include <cstdio> using namespace std; int main() { int x,y; int i,j,t,n; int a[10001],b[10001],g[10001],k[10001]; int t1[10001]={0},sum1=0; cin>>n; for(i=1;i<=n;i++) cin>>a[i]>>b[i]>>g[i]>>k[i]; cin>>x>>y; for(i=1;i<=n;i++) { if(x>=a[i] && x<=a[i]+g[i] && y>=b[i] && y<=b[i]+k[i]) { sum1++; t1[sum1]=i; } } if(sum1>=1) { cout<<t1[sum1]; } else printf("-1"); return 0; } ``` Thank you
by zhz小蒟蒻 @ 2018-07-15 12:24:29


这下我终于会用Markdown了
by zhz小蒟蒻 @ 2018-07-15 12:25:28


@[陈常杰](/space/show?uid=14738) 因为我喜欢小玉啊
by 初嫁QAQ @ 2018-07-15 12:26:19


我就弱弱地问一句,你会这道题了吗?@[刘素质](/space/show?uid=102028)
by zhz小蒟蒻 @ 2018-07-15 12:28:24


| 下一页