Skip to content

656 D3 #6

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
shubham242 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

656 D3 #6

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
28 changes: 0 additions & 28 deletions **TEMPATE.cpp
View file
Open in desktop

This file was deleted.

70 changes: 35 additions & 35 deletions AUG19B/1.cpp
100755 → 100644
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,35 +1,35 @@
#include <iostream>
#include <vector>
using namespace std;
int main() {
short int t ;
cin >> t ;
while ( t-- ) {
int n ;
cin >> n ;
vector< int > a(n), b(n) ;
for ( auto i = 0 ; i < n ; ++i )
cin >> a[i] ;
for ( auto i = 0 ; i < n ; ++i )
cin >> b[i] ;
int ans = 0 ;
//cout << '\n' ;
for ( auto i = 0 ; i < n ; ++i ) {
int res = a[i]*20 - b[i]*10 ;
//cout << res << '\n' ;
ans = max(res,ans) ;
}
cout << ans << '\n' ;
}
return 0;
}
#include <iostream>
#include <vector>

using namespace std;

int main() {

short int t ;
cin >> t ;

while ( t-- ) {

int n ;
cin >> n ;
vector< int > a(n), b(n) ;

for ( auto i = 0 ; i < n ; ++i )
cin >> a[i] ;
for ( auto i = 0 ; i < n ; ++i )
cin >> b[i] ;

int ans = 0 ;
//cout << '\n' ;
for ( auto i = 0 ; i < n ; ++i ) {
int res = a[i]*20 - b[i]*10 ;
//cout << res << '\n' ;
ans = max(res,ans) ;
}

cout << ans << '\n' ;

}

return 0;
}
44 changes: 22 additions & 22 deletions AUG19B/2.cpp
100755 → 100644
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,22 +1,22 @@
#include <iostream>
using namespace std;
int main() {
short int t ;
cin >> t ;
while ( t-- ) {
long long unsigned int n, k ;
cin >> n >> k ;
if ( k==1 || k*k == n )
cout << "NO\n" ;
else
cout << "YES\n" ;
}
return 0;
}
#include <iostream>
using namespace std;

int main() {

short int t ;
cin >> t ;

while ( t-- ) {

long long unsigned int n, k ;
cin >> n >> k ;

if ( k==1 || k*k == n )
cout << "NO\n" ;
else
cout << "YES\n" ;

}

return 0;
}
Empty file modified AUG19B/a.exe
100755 → 100644
View file
Open in desktop
Empty file.
Empty file modified AUG19B/ks1
100755 → 100644
View file
Open in desktop
Empty file.
202 changes: 101 additions & 101 deletions AUG19B/ks1.cpp
100755 → 100644
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,102 +1,102 @@
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <unordered_map>
#include <list>
using namespace std ;
int main() {
int t ;
cin >> t ;
while ( t-- ) {
int n;
bool f= 0 ;
cin >> n ;
vector< int > v(n), xor1(n+1), sum(n,0) ;
for ( auto i = 0 ; i < n ; ++i ) {
cin >> v[i] ;
if ( f ) {
sum[i] = sum[i-1] + v[i] ;
}
else f=1 ;
}
xor1[0] = 0 ;
for ( auto i = 0 ; i < n ; ++i ) {
xor1[i+1] = xor1[i]^v[i] ;
}
int ans = 0 ;
unordered_map< int, vector< int > > h ;
for ( auto i = 0 ; i < n+1 ; ++i )
h[xor1[i]].push_back( i ) ;
//for ( auto i : xor1 )
//cout << i << ' ' ;
for ( auto i : h ) {
f = 0 ;
int prev=0, next ;
for ( auto j : i.second ) {
if ( f!=0 ) {
next = j ;
ans += next-prev-1 ;
prev = next ;
//if ( i.first == 0 )
//ans += next + prev ;
}
else {
prev = j ;
f = 1;
}
}
}
cout << ans << '\n' ;
}
}
/*
unordered_map< int, vector< int > > h ;
for ( auto i = 0 ; i < n ; ++i )
h[xor1[i]].push_back( i ) ;
for ( auto i : xor1 ) {
cout << i << ' ' ;
}
cout << "\n\n\n";
cout << '\n' << '\n' ;
for ( auto i : h ) {
f = 0 ;
int prev, next ;
for ( auto j : i.second ) {
if ( f==0 ) {
f=1 ;
continue ;
prev = j ;
}
next = j ;
ans += next-prev ;
if ( i.first == 0 ) {
ans += next + prev ;
}
prev = next ;
}
}
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <unordered_map>
#include <list>

using namespace std ;

int main() {

int t ;
cin >> t ;

while ( t-- ) {

int n;
bool f= 0 ;
cin >> n ;

vector< int > v(n), xor1(n+1), sum(n,0) ;


for ( auto i = 0 ; i < n ; ++i ) {
cin >> v[i] ;
if ( f ) {
sum[i] = sum[i-1] + v[i] ;
}
else f=1 ;
}

xor1[0] = 0 ;
for ( auto i = 0 ; i < n ; ++i ) {
xor1[i+1] = xor1[i]^v[i] ;
}

int ans = 0 ;

unordered_map< int, vector< int > > h ;

for ( auto i = 0 ; i < n+1 ; ++i )
h[xor1[i]].push_back( i ) ;


//for ( auto i : xor1 )
//cout << i << ' ' ;

for ( auto i : h ) {
f = 0 ;
int prev=0, next ;
for ( auto j : i.second ) {
if ( f!=0 ) {
next = j ;
ans += next-prev-1 ;
prev = next ;
//if ( i.first == 0 )
//ans += next + prev ;
}
else {
prev = j ;
f = 1;
}
}
}
cout << ans << '\n' ;

}

}


/*
unordered_map< int, vector< int > > h ;

for ( auto i = 0 ; i < n ; ++i )
h[xor1[i]].push_back( i ) ;


for ( auto i : xor1 ) {
cout << i << ' ' ;
}
cout << "\n\n\n";

cout << '\n' << '\n' ;
for ( auto i : h ) {
f = 0 ;
int prev, next ;
for ( auto j : i.second ) {
if ( f==0 ) {
f=1 ;
continue ;
prev = j ;
}
next = j ;
ans += next-prev ;
if ( i.first == 0 ) {
ans += next + prev ;
}
prev = next ;
}
}
*/
Empty file modified Algorithms/FLOYD_LL
100755 → 100644
View file
Open in desktop
Empty file.
Empty file modified Algorithms/Rev_LL_Recurse
100755 → 100644
View file
Open in desktop
Empty file.
Empty file modified Algorithms/a
100755 → 100644
View file
Open in desktop
Empty file.
Empty file modified CF_495_D2_V/A
100755 → 100644
View file
Open in desktop
Empty file.
Loading