CodeForces 675B D - Restoring Painting
来源:互联网 发布:java 输出两位小数 编辑:程序博客网 时间:2024/05/22 02:58
枚举,找公式
#include<stdio.h>
int main()
{
int n,a,b,c,d,e,f,g,h,i;
long long ans=0;
scanf("%d%d%d%d%d",&n,&a,&b,&c,&d);
for(e=1;e<=n;e++)
{
f=e+b-c;
h=e+a-d;
i=e+a+b-c-d;
if(f>=1&&f<=n&&h>=1&&h<=n&&i>=1&&i<=n)
ans++;
else
continue;
}
ans*=n;
printf("%I64d\n",ans);
return 0;
}
int main()
{
int n,a,b,c,d,e,f,g,h,i;
long long ans=0;
scanf("%d%d%d%d%d",&n,&a,&b,&c,&d);
for(e=1;e<=n;e++)
{
f=e+b-c;
h=e+a-d;
i=e+a+b-c-d;
if(f>=1&&f<=n&&h>=1&&h<=n&&i>=1&&i<=n)
ans++;
else
continue;
}
ans*=n;
printf("%I64d\n",ans);
return 0;
}
0 0
- CodeForces 675B D - Restoring Painting
- codeforces 675B Restoring Painting
- CodeForces 675B Restoring Painting
- 【Codeforces】675B - Restoring Painting
- 【CodeForces】[675B]Restoring Painting
- CodeForces 675B Restoring Painting
- [CodeForces]-675B-Restoring Painting
- CodeForces - 675B Restoring Painting (暴力&转换)水
- 【CodeForces】675B - Restoring Painting(数学推导)
- Codefroces 675 B. Restoring Painting
- Codeforces #353(div2)B.Restoring Painting
- B. Restoring Painting
- Codeforces Round #353 (Div. 2)-B. Restoring Painting(数学)
- Codeforces Round #353 (Div. 2) B. Restoring Painting
- Codeforces Round #353 (Div. 2) B Restoring Painting
- Codeforces Round #353 (Div. 2) -- B. Restoring Painting (规律)
- Codeforces Round #353 (Div. 2) B. Restoring Painting
- Codeforces Round #353 (Div. 2) B.Restoring Painting
- 路由 get '/*path' => 'welcome#index'
- static analysis tool
- 线段树专题(一)
- nodejs npm grunt 运行调试代码遇到的问题
- Swift编程规范之 Documentation/Comments
- CodeForces 675B D - Restoring Painting
- Integer对象和 ==、equals分析
- Java核心技术-读书笔记 概览
- Sqlite
- 如何解决 img 标签上下出现的间隙
- 下载服务器中的apk
- CodeForces 625A E - Guest From the Past
- 百度地图绘制图形
- 299. Bulls and Cows