From 6a18d0fadc1dca09e3dd0b5de89894e5f4e7d737 Mon Sep 17 00:00:00 2001 From: Naveen satyarthi <33248236+naveen161@users.noreply.github.com> Date: Wed, 17 Oct 2018 20:42:51 +0530 Subject: [PATCH 1/5] codechef --- CCOOK.cpp | 53 +++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 53 insertions(+) create mode 100644 CCOOK.cpp diff --git a/CCOOK.cpp b/CCOOK.cpp new file mode 100644 index 0000000..b47a158 --- /dev/null +++ b/CCOOK.cpp @@ -0,0 +1,53 @@ +#include +#include +#include +using namespace std; +int main() +{ + int t, n, i, j; + // string s; + cin>>t; + while(t--) + { + +int arr[5]; + for(i = 0; i < 5; i++) + { + cin>>arr[i]; + } + int count = 0; + for(i = 0; i < 5; i++) + { + if (arr[i] == 1) + { + count++; + } + } + if (count == 0) + { + cout<<"Beginner"< Date: Wed, 17 Oct 2018 20:44:41 +0530 Subject: [PATCH 2/5] codechef --- CHEGLOVE.cpp | 65 ++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 65 insertions(+) create mode 100644 CHEGLOVE.cpp diff --git a/CHEGLOVE.cpp b/CHEGLOVE.cpp new file mode 100644 index 0000000..7e05cca --- /dev/null +++ b/CHEGLOVE.cpp @@ -0,0 +1,65 @@ +#include +#include +using namespace std; +int main() + +{ + int q; + cin>>q; + while (q--) + { + int ele = 0; + cin>>ele; + int i, a[ele], b[ele], c[ele]; + int j = 0; + j = ele-1; + int flag = 0; + int temp = 0, count = 0; + for (i = 0 ; i < ele; i++) + { + cin>>a[i]; + c[j] = a[i]; + j--; + } + for (i = 0; i < ele; i++) + { + cin>>b[i]; + } + for (i = 0; i < ele; i++) + { + + if (a[i] <= b[i]) + { + count++; + if (c[i] <= b[i]) + { + flag++; + } + } else if (c[i] <= b[i]) + { + flag++; + }else + { + count++; + } + } + + if (count == ele && flag == ele ) + { + cout<<"both"< Date: Wed, 17 Oct 2018 20:45:34 +0530 Subject: [PATCH 3/5] Add files via upload --- CNDLOVE.cpp | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 CNDLOVE.cpp diff --git a/CNDLOVE.cpp b/CNDLOVE.cpp new file mode 100644 index 0000000..226359c --- /dev/null +++ b/CNDLOVE.cpp @@ -0,0 +1,28 @@ +#include +#include +using namespace std; +int main() +{ + int u; + int i, j, total; + cin>>u; + while(u--) + {int n, flag = 0; + int sum = 0; + cin>>n; + int a[n]; + for (i = 0; i < n; i++) + { + cin>>a[i]; + } + + total = accumulate(a, a+n, sum); + if (total%2 == 0) + { + cout<<"NO"< Date: Wed, 17 Oct 2018 20:53:46 +0530 Subject: [PATCH 4/5] codechef solution --- NUM239.cpp | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 NUM239.cpp diff --git a/NUM239.cpp b/NUM239.cpp new file mode 100644 index 0000000..137232a --- /dev/null +++ b/NUM239.cpp @@ -0,0 +1,26 @@ +#include +#include +#include +using namespace std; +int main() +{ + int t; + cin>>t; + while(t--) + { + int n,l, r, i; + cin>>l>>r; + int count = 0; + for (i = l; i <= r; i++) + { + if (i%10 == 2 || i%10 == 9 || i%10 == 3) + { + count++; + } + } + cout< Date: Wed, 17 Oct 2018 20:55:02 +0530 Subject: [PATCH 5/5] codechef challange --- MGCSET.cpp | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 MGCSET.cpp diff --git a/MGCSET.cpp b/MGCSET.cpp new file mode 100644 index 0000000..1654b08 --- /dev/null +++ b/MGCSET.cpp @@ -0,0 +1,31 @@ +#include +#include +#include +#include +using namespace std; +int main() +{ + int t; + cin>>t; + while(t>0) + { + int n, target, count = 0; + cin>>n>>target; + int a[n], i; + for(i = 0; i < n; i++) + { + cin>>a[i]; + } + for (i = 0; i < n; i++) + { + if(a[i]%target == 0) + { + count++; + } + } + int ans = pow(2, count) - 1; + cout<