Tried my first real codeforces round, got stuck way too long on one of the earlier questions, but over all, you gotta start somewhere i guess

This commit is contained in:
2021-12-21 21:54:41 +01:00
parent 6b735054c5
commit a342d1d04d
8 changed files with 300 additions and 0 deletions

View File

@@ -0,0 +1,36 @@
#include <bits/stdc++.h>
using namespace std;
void test_case(int tc){
string s;
cin >> s;
for(size_t i = 0; i < (s.size() + 1) / 2; ++i){
if(s[i] != s[i + (s.size() + 1) / 2]){
cout << "NO\n";
return;
}
}
cout << "YES\n";
return;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
for(int tc = 1; tc <= t; ++tc){
test_case(tc);
}
cout << flush;
return 0;
}

View File

@@ -0,0 +1,50 @@
#include <bits/stdc++.h>
using namespace std;
int N_MAX = 1e9;
void test_case(int tc){
int n;
cin >> n;
set<int> valids;
int i = 1;
int r = pow(i, 2);
while(r <= n){
valids.insert(r);
i++;
r = pow(i, 2);
}
i = 1;
r = pow(i, 3);
while(r <= n){
valids.insert(r);
i++;
r = pow(i, 3);
}
cout << valids.size() << '\n';
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
for(int tc = 1; tc <= t; ++tc){
test_case(tc);
}
cout << flush;
return 0;
}

View File

@@ -0,0 +1,72 @@
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int first_digit(ll& n){
int digits = (int)log10(n);
n = (int)(n / pow(10, digits));
return n;
}
void test_case(int tc){
ll a, s;
cin >> a >> s;
ll b = 0;
int bpow = 0;
while(a > 0){
if(s == 0){
cout << -1 << '\n';
return;
}
int la = a % 10, ls = s % 10;
if(ls < la){
ls = s % 100;
s /= 10;
}
if(ls - la > 9 || la > ls){
cout << -1 << '\n';
return;
}
a /= 10;
s /= 10;
b += (ll)pow(10, bpow) * (ls - la);
bpow++;
}
while(s > 0){
b += (ll)pow(10, bpow) * (s % 10);
s /= 10;
bpow++;
}
cout << b << '\n';
return;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
for(int tc = 1; tc <= t; ++tc){
test_case(tc);
}
cout << flush;
return 0;
}

View File

@@ -0,0 +1,42 @@
#include <bits/stdc++.h>
using namespace std;
void test_case(int tc){
int m, n;
cin >> m >> n;
vector<vector<int>> joys(m);
vector<int> second_worsts(n);
for(int i = 0; i < m; ++i){
for(int j = 0; j < n; ++j){
int ij;
cin >> ij;
// cin >> joys[i][j];
joys[i].push_back(ij);
}
}
int result = 0;
cout << result << '\n';
return;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
for(int tc = 1; tc <= t; ++tc){
test_case(tc);
}
cout << flush;
return 0;
}

View File

@@ -0,0 +1,25 @@
#include <bits/stdc++.h>
using namespace std;
void test_case(int tc){
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
for(int tc = 1; tc <= t; ++tc){
test_case(tc);
}
cout << flush;
return 0;
}

View File

@@ -0,0 +1,25 @@
#include <bits/stdc++.h>
using namespace std;
void test_case(int tc){
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
for(int tc = 1; tc <= t; ++tc){
test_case(tc);
}
cout << flush;
return 0;
}

View File

@@ -0,0 +1,25 @@
#include <bits/stdc++.h>
using namespace std;
void test_case(int tc){
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
for(int tc = 1; tc <= t; ++tc){
test_case(tc);
}
cout << flush;
return 0;
}

View File

@@ -0,0 +1,25 @@
#include <bits/stdc++.h>
using namespace std;
void test_case(int tc){
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
for(int tc = 1; tc <= t; ++tc){
test_case(tc);
}
cout << flush;
return 0;
}