codeforces 691A 模拟
2016-09-03 11:47
357 查看
题目:给一串0和1,要求有且只有一个0,如果只有一个数,则必须为1
直接模拟就可以
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#define rep(i, j, k) for(int i = j; i <= k; i++)
using namespace std;
int n, a[1009];
int main ()
{
cin >> n;
rep (i, 1, n)
scanf ("%d", &a[i]);
int ok = 1;
rep (i, 1, n)
ok -= (a[i] == 0);
if ( (n == 1 && a[1]) || (n > 1 && ok == 0))
printf ("YES\n");
else
printf ("NO\n");
return 0;
}
直接模拟就可以
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#define rep(i, j, k) for(int i = j; i <= k; i++)
using namespace std;
int n, a[1009];
int main ()
{
cin >> n;
rep (i, 1, n)
scanf ("%d", &a[i]);
int ok = 1;
rep (i, 1, n)
ok -= (a[i] == 0);
if ( (n == 1 && a[1]) || (n > 1 && ok == 0))
printf ("YES\n");
else
printf ("NO\n");
return 0;
}
相关文章推荐
- Codeforces 366B Dima and To-do List 【模拟】
- CodeForces 691C Exponential notation(模拟)
- CodeForces 689A Mike and Cellphone (模拟+水题)
- Codeforces-754B-Ilya and tic-tac-toe game(简单模拟判断)
- Codeforces 509C. Sums of Digits 贪心 + 模拟
- Codeforces 520D. Cubes 状态模拟+贪心
- Codeforces 439C Devu and Partitioning of the Array 模拟
- codeforces 116A Tram(模拟水题)
- CodeForces 567B Berland National Library 容器模拟
- codeforces 266A Stones on the Table(模拟水题)
- Codeforces 677B Vanya and Food Processor【模拟】
- CodeForces - 754B Ilya and tic-tac-toe game(模拟)
- 【codeforces 1B】Spreadsheets——模拟,水
- Codeforces--237B--Young Table(模拟)
- Codeforces - 834B. The Festive Evening - 思维、模拟
- CodeForces - 868B Race Against Time 简单模拟
- CodeForces 734D:Anton and Chess(模拟?)
- CodeForces - 868B Race Against Time(模拟)
- Codeforces 438D (今日gg模拟第二题) | 线段树 考察时间复杂度的计算 -_-|||
- 【Goodbye2014】Codeforces 500C New Year Book Reading【贪心+模拟】