https://i2.wp.com/eblogarithm.com/wp-content/uploads/2017/08/Codeforces-Round-429-Div-2-problem-B-Godsend-Solution-In-CC1.png?fit=640%2C360

Codeforces Round #429 (Div. 2), problem: (B) Godsend Solution In C/C++

#include<cstdio>
int main()
{
int n;int t;scanf(“%d”,&n);
for(int i=1;i<=n;i++)
{scanf(“%d”,&t);
if(t%2)
{
printf(“First”);
return 0;
}
}
printf(“Second”);
return 0;
}

(Visited 202 times, 1 visits today)



There are no comments

Add yours

Leave a Reply

%d bloggers like this: