Skip to content

Commit 2474a4d

Browse files
jitendrajat10099jitendrajat10099
authored
Merge branch 'master' into master
2 parents 11e6e19 + 282fc4f commit 2474a4d

File tree

335 files changed

+18604
-6
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

335 files changed

+18604
-6
lines changed

‎Codechef/ADAKNG.cpp‎

Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
#include<iostream>
2+
#include<bits/stdc++.h>
3+
using namespace std;
4+
int main()
5+
{
6+
long long int t,r,c,k,ans,x=8;
7+
cin>>t;
8+
while(t--)
9+
{
10+
cin>>r>>c>>k;
11+
r=r-1;
12+
c=c-1;
13+
if(r>3)
14+
r=7-r;
15+
if(c>3)
16+
c=7-c;
17+
ans=min(x,(k+1+min(r,k)))*min(x,(k+1+min(c,k)));
18+
if(ans>64)
19+
ans=64;
20+
cout<<ans<<endl;
21+
}
22+
return 0;
23+
}
24+

‎Codechef/ADAROKS2.cpp‎

Lines changed: 152 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,152 @@
1+
#include <bits/stdc++.h>
2+
using namespace std;
3+
#define mod 1000000007
4+
#define pie 3.14
5+
typedef long long int ll;
6+
/*
7+
.d8b. d8888b. db db .d8b. d8b db
8+
d8' `8b 88 `8D `8b d8' d8' `8b 888o 88
9+
88ooo88 88oobY' `8bd8' 88ooo88 88V8o 88
10+
88~~~88 88`8b 88 88~~~88 88 V8o88
11+
88 88 88 `88. 88 88 88 88 V888
12+
YP YP 88 YD YP YP YP VP V8P
13+
14+
15+
*/
16+
17+
18+
///////////////////////////////////////
19+
bool arr[1001];
20+
ll calculate()
21+
{
22+
if(arr[0]!=0)
23+
{
24+
arr[0]=0;
25+
return 0;
26+
}
27+
for(ll i=1000;i>=0;i--)
28+
if(arr[i]==0)
29+
{
30+
arr[i+1]=false;
31+
return i+1;
32+
}
33+
return 0;
34+
}
35+
int main()
36+
{
37+
ios_base::sync_with_stdio(false);
38+
cin.tie(NULL);
39+
#ifndef ONLINE_JUDGE
40+
freopen("input.txt","r",stdin);
41+
freopen("output.txt","w",stdout);
42+
#endif
43+
ll t;
44+
cin>>t;
45+
while(t--)
46+
{
47+
ll n;
48+
cin>>n;
49+
for(ll i=0;i<sizeof(arr);i++)
50+
{
51+
arr[i]=1;
52+
}
53+
bool check[n][n];
54+
for(ll i=0;i<n;i++)
55+
{
56+
for(ll j=0;j<n;j++)
57+
check[i][j]=0;
58+
}
59+
//memset(a,0,sizeof(a));
60+
ll k=0;
61+
ll x=0,y=-1;
62+
ll temp=8*n,i=0,j=0,u=0;
63+
ll my[n]={0};
64+
while(x<temp)
65+
{
66+
u=u+calculate();
67+
my[k]=u;
68+
for(i=k-1;i>=0;i--)
69+
arr[my[k]-my[i]]=false;
70+
if(y==x)
71+
break;
72+
k++;
73+
y=x;
74+
for(i=u,j=0;j<n;i++,j++)
75+
{
76+
if(i>=n)
77+
break;
78+
check[i][j]=1;
79+
x++;
80+
}
81+
}
82+
// cout<<x<<endl;
83+
if(y==x)
84+
{
85+
bool db=false;
86+
for(j=n-1;j>=0;j--)
87+
{
88+
for(i=0;i<n;i++)
89+
{
90+
bool qk=false;
91+
if(!check[i][j])
92+
{
93+
ll r[n];
94+
ll p=0;
95+
for(ll q1=0;q1<n;q1++)
96+
{
97+
if(q1==i)
98+
continue;
99+
if(check[q1][j])
100+
r[p++]=q1;
101+
}
102+
for(ll q1=0;q1<n;q1++)
103+
{
104+
if(q1==j)
105+
continue;
106+
if(check[i][q1])
107+
{
108+
for(ll q2=0;q2<p;q2++)
109+
{
110+
if(check[r[q2]][q1])
111+
{
112+
qk=1;
113+
break;
114+
}
115+
}
116+
}
117+
if(qk)
118+
break;
119+
120+
}
121+
122+
if(!qk)
123+
{
124+
check[i][j]=1;
125+
x++;
126+
}
127+
if(x>=temp)
128+
{
129+
db=true;
130+
goto A;
131+
}
132+
}
133+
}
134+
}
135+
}
136+
A:
137+
// cout<<x<<endl;
138+
for(i=0;i<n;i++)
139+
{
140+
for(j=0;j<n;j++)
141+
{
142+
if(check[i][j]==1)
143+
cout<<'O';
144+
else
145+
cout<<".";
146+
}
147+
cout<<"\n";
148+
}
149+
cout<<"\n";
150+
}
151+
return 0;
152+
}

‎Codechef/ADASCOOL.c‎

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
#include<stdio.h>
2+
int main()
3+
{
4+
int t,a,b;
5+
scanf("%d",&t);
6+
while(t--)
7+
{
8+
scanf("%d %d",&a,&b);
9+
if(((a*b)%2)==0)
10+
printf("YES\n");
11+
else
12+
printf("NO\n");
13+
}
14+
}
15+

‎Codechef/AGECAL.c‎

Lines changed: 47 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,47 @@
1+
#include<stdio.h>
2+
int main()
3+
{
4+
long long int t,n,sum,i,c,d,e,x,y,z,sum1;
5+
long long int a[100000];
6+
scanf("%lld",&t);
7+
while(t--)
8+
{
9+
sum=0;sum1=0;
10+
scanf("%lld",&n);
11+
for(i=0;i<n;i++)
12+
{
13+
scanf("%lld",&a[i]);
14+
sum=sum+a[i];
15+
}
16+
scanf("%lld %lld %lld",&c,&d,&e);
17+
scanf("%lld %lld %lld",&x,&y,&z);
18+
for(i=(c+1);i<x;i++)
19+
{
20+
if(i%4!=0)
21+
sum1=sum1+sum;
22+
else
23+
sum1=sum1+sum+1;
24+
}
25+
if(c%4==0 || x%4==0)
26+
sum1++;
27+
if(c!=x)
28+
{
29+
for(i=0;i<(y-1);i++)
30+
sum1=sum1+a[i];
31+
sum1=sum1+z;
32+
for(i=(d);i<n;i++)
33+
sum1=sum1+a[i];
34+
sum1=sum1+(a[d-1]-e+1);
35+
}
36+
else
37+
{for(i=(d);i<(y-1);i++)
38+
{
39+
sum1=sum1+a[i];
40+
}
41+
sum1=sum1+z+(a[d-1]-e+1);
42+
}
43+
printf("%lld\n",sum1);
44+
}
45+
46+
}
47+

‎Codechef/AGECAL.cpp‎

Lines changed: 56 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,56 @@
1+
#include <bits/stdc++.h>
2+
using namespace std;
3+
#define mod 1000000007
4+
#define pie 3.14
5+
typedef long long int ll;
6+
/*
7+
.d8b. d8888b. db db .d8b. d8b db
8+
d8' `8b 88 `8D `8b d8' d8' `8b 888o 88
9+
88ooo88 88oobY' `8bd8' 88ooo88 88V8o 88
10+
88~~~88 88`8b 88 88~~~88 88 V8o88
11+
88 88 88 `88. 88 88 88 88 V888
12+
YP YP 88 YD YP YP YP VP V8P
13+
14+
15+
*/
16+
17+
18+
///////////////////////////////////////
19+
int main()
20+
{
21+
ios_base::sync_with_stdio(false);
22+
cin.tie(NULL);
23+
#ifndef ONLINE_JUDGE
24+
freopen("input.txt","r",stdin);
25+
freopen("output.txt","w",stdout);
26+
#endif
27+
ll t;
28+
cin>>t;
29+
while(t--)
30+
{
31+
ll n,i,y,m,d,y1,m1,d1,sum=0,ans=0,leap,yd;
32+
ll arr[100005]={0};
33+
ll arr1[100005]={0};
34+
cin>>n;
35+
for(i=1;i<=n;i++)
36+
{
37+
cin>>arr[i];
38+
sum=sum+arr[i];
39+
}
40+
arr1[1]=arr[1];
41+
for(i=2;i<=n;i++)
42+
arr1[i]=arr1[i-1]+arr[i];
43+
cin>>y>>m>>d;
44+
cin>>y1>>m1>>d1;
45+
// if(m<m1 ||(m==m1 && d<=d1))
46+
// {
47+
leap=(y1-1)/4-y/4;
48+
yd=sum*(y1-y);
49+
ans=ans+yd+leap+arr1[m1-1]+d1-d-arr1[m-1]+1;
50+
if(y%4==0)
51+
ans++;
52+
cout<<ans<<"\n";
53+
54+
55+
}
56+
}

‎Codechef/ALTARAY.cpp‎

Lines changed: 76 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,76 @@
1+
#include <bits/stdc++.h>
2+
using namespace std;
3+
#define mod 1000000007
4+
#define pie 3.14
5+
typedef long long int ll;
6+
/*
7+
.d8b. d8888b. db db .d8b. d8b db
8+
d8' `8b 88 `8D `8b d8' d8' `8b 888o 88
9+
88ooo88 88oobY' `8bd8' 88ooo88 88V8o 88
10+
88~~~88 88`8b 88 88~~~88 88 V8o88
11+
88 88 88 `88. 88 88 88 88 V888
12+
YP YP 88 YD YP YP YP VP V8P
13+
14+
15+
*/
16+
17+
18+
///////////////////////////////////////
19+
int main()
20+
{
21+
ios_base::sync_with_stdio(false);
22+
cin.tie(NULL);
23+
#ifndef ONLINE_JUDGE
24+
freopen("input.txt","r",stdin);
25+
freopen("output.txt","w",stdout);
26+
#endif
27+
ll t;
28+
cin>>t;
29+
while(t--)
30+
{
31+
ll n,i,pa,pr,temp;
32+
ll arr[100005]={0};
33+
ll dp[100005]={0};
34+
cin>>n;
35+
for(i=0;i<n;i++)
36+
{
37+
cin>>arr[i];
38+
}
39+
dp[n-1]=1;
40+
if(arr[n-1]<0)
41+
{
42+
pa=0;
43+
}
44+
else
45+
pa=1;
46+
for(i=n-2;i>=0;i--)
47+
{
48+
if(arr[i]<0)
49+
pr=0;
50+
else
51+
pr=1;
52+
if(pa!=pr)
53+
{
54+
//cout<<i<<" "<<"h\n";
55+
dp[i]=dp[i+1]+1;
56+
temp=pa;
57+
pa=pr;
58+
pr=temp;
59+
}
60+
else
61+
{
62+
dp[i]=1;
63+
if(arr[i]<0)
64+
{
65+
pa=0;
66+
}
67+
else
68+
pa=1;
69+
}
70+
71+
}
72+
for(i=0;i<n;i++)
73+
cout<<dp[i]<<" ";
74+
cout<<"\n";
75+
}
76+
}

0 commit comments

Comments
 (0)