Show all threads Hide all threads Show all messages Hide all messages |
Page 1209 |
if you have WA10 | LeTim | 1564. Counting Ones | 8 Jul 2025 15:03 | 1 |
input: 1000000000000000000 output: 524638269999999991 |
simple geometric solution | Sssswwwppp | 1139. City Blocks | 4 Jul 2025 23:09 | 1 |
optimized search + cross product) |
Input issues | irkstepanov | 1006. Square Frames | 28 Jun 2025 15:31 | 1 |
To read the input in C++, the following helped me: unsigned char x = cin.get(). Then I used some ifs in the form of if (x == 218) { ... } Also, the first test case seems to be different from the one suggested in the statement. |
wa3 idk why, python | nekrip | 1297. Palindrome | 26 Jun 2025 03:00 | 1 |
b = input() s = '' d = [] for i in b: s += i if s == s[::-1]: d.append(s) if s != s[::-1] and len(s) % 2 != 0: s = s[1:] if s == s[::-1]: d.append(s) if s != s[::-1] and len(s) % 2 != 0: s = s[1:] m = max(d, key=len) if len(m) <= 1000: print(m) |
if you have WA | pon | 1192. Ball in a Dream | 16 Jun 2025 16:39 | 1 |
see what your program outputs for an integer answer ps it should output .00 посмотрите, что выводит ваша программа при целом ответе ps она должна выводить .00 |
WA 17 | наФуллФокусе | 1035. Cross-stitch | 10 Jun 2025 22:08 | 1 |
WA 17 наФуллФокусе 10 Jun 2025 22:08 |
Brute force Accept in 1.625 | zser | 1044. Lucky Tickets. Easy! | 8 Jun 2025 20:41 | 1 |
#include <bits/stdc++.h> using namespace std; int cal(int x){ int ret = 0; while (x > 0){ ret += x % 10; x /= 10; } return ret; } bool lucky(int x, int mm){ int a = x / mm; int b = x % mm; if (cal(a) == cal(b)) return true; return false; } int main(){ int n; cin >> n; int nn = round(pow(10, n)) - 1; int mm = round(pow(10, n / 2)); int tot = 0; for (int i = 0; i <= nn; i++){ if (lucky(i, mm)) tot++; } cout << tot << endl; } if your code is simple and fast enough, brute force can work. |
why I get WA at test 8. | Mahdi Hasan Qurishi | 1036. Lucky Tickets | 6 Jun 2025 01:24 | 1 |
what is wrong with my code: #include <iostream> #include <algorithm> #include <climits> #include <string> #include <cstring> #include <cmath> #include <vector> #include <stack> #include <map> #include <set> #include <iomanip> #include <unordered_map> #define ll long long #define fri(a, b) for (ll i = a; i < b; i++) #define frj(a, b) for (ll j = a; j < b; j++) #define frk(a, b) for (int k = a; k < b; k++) #define frh(a, b) for (int h = a; h < b; h++) #define frz(a, b) for (int z = a; z < b; z++) #define rfri(a, b) for (int i = a; i >= b; i--) #define rfrj(a, b) for (int j = a; j >= b; j--) #define yes cout << "YES" << "\n"; #define no cout << "NO" << "\n"; #define fast \ ios_base::sync_with_stdio(false); \ cin.tie(NULL); \ cout.tie(NULL); const int mod=100000007; using namespace std; ll dp[50][1005]; ll func(ll n,ll s){ if(dp[n][s] != -1) return dp[n][s]; if(s == 0) return 1; if(n == 0){ if(s == 0) return 1; else return 0; } ll ans = 0; fri(0,10){ if((s - i) >= 0) ans = (ans + func(n-1,s-i)) ; } return dp[n][s] = ans; } int main() { fast ll T = 1; // cin >> T; frz(0,T){ ll n,s; cin >> n >> s; memset(dp,-1,sizeof(dp)); if(s%2) cout << 0 << "\n"; else { ll ans = func(n,s/2); cout << (ans*ans) << "\n"; } } } |
Page 1208 |
Tests incorrect | Лукьянчиков Владимир Игоревич | 1369. Cockroach Race | 5 Jun 2025 17:34 | 1 |
For example: 16 9001 9001 8999 8999 9001 8999 8999 9001 -9001 -9001 -9001 -8999 -8999 -9001 -8999 -8999 9001 -9001 8999 -8999 9001 -8999 8999 -9001 -9001 9001 -8999 8999 -9001 8999 -8999 9001 5 9000 9000 9000 -9000 -9000 -9000 -9000 9000 0 0 My AC program gives answer: 1 2 3 4 9 10 11 12 5 6 7 8 13 14 15 16 2 But right answer: 1 2 3 4 9 10 11 12 5 6 7 8 13 14 15 16 2 8 10 14 |
To ADMIN add test, because tests are weak | coder | 2175. Staircase | 25 May 2025 13:20 | 1 |
Hi, Admins. Please, add these case: N > 5*10^4 a[i] = 1, for i = 1.. N-1, and a[N] = 10^9 Q = N p[i] = i, x[i] = i For example: 77888 1 1 1 1 1 1 .... 1 1 77888 77888 1 1 2 2 3 3 4 4 5 5 ... 77888 77888 |
0.031 seconds )) | coder | 2175. Staircase | 24 May 2025 21:58 | 1 |
my solution takes 0.031 seconds. |
Soo the problem is only math. | Shomik Shahriar | 1209. 1, 10, 100, 1000... | 29 May 2025 06:55 | 2 |
I tried with precalculating with map for setting up the index with 1 only rest will be auto 0 but miraculously WA at 4. so i figured out that the author only wants you to solve with his idea only. So good luck. These problems are trivial once you start thinking about things algebraically. The author made the constraints the way they are to try to force you in that direction as its an educational problem. |
For those dude who thinks sieve is only option | Shomik Shahriar | 1086. Cryptography | 11 May 2025 11:57 | 1 |
DO your own solve then check this do not cheat yourself #include<bits/stdc++.h> using namespace std; #define ll long long #define endl "\n" #define FastAF ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); template <typename T> // cin >> vector<T> istream &operator>>(istream &istream, vector<T> &v){for (auto &it : v) cin >> it;return istream;} template <typename T> // cout << vector<T> ostream &operator<<(ostream &ostream, const vector<T> &c){for (auto &it : c) cout << it << " ";return ostream;} const int mx=2e5; int ar[mx]; void d(){ ar[0]=2; int k=1; for(int i=3;i<mx;i++){ bool f=true; for(int j=2;j*j<=i;j++){ if(i%j==0){ f=false; break; } } if(f){ ar[k++]=i; } } } int main(){ FastAF d(); int n; cin>>n; while(n--){ int a;cin>>a; cout<<ar[--a]<<endl; } return 0; } Algo: sqrt with precomputation Edited by author 11.05.2025 11:58 Edited by author 11.05.2025 12:02 |
Test 7 contains intersecting squares which contradicts the statement | bidzilya | 1097. Square Country 2 | 10 May 2025 20:01 | 1 |
|
WA 55 | наФуллФокусе | 2184. Flint's Favorite Number | 9 May 2025 02:32 | 1 |
WA 55 наФуллФокусе 9 May 2025 02:32 |
nice test | 👑TIMOFEY👑`~ | 1762. Search for a Hiding-Place | 3 May 2025 17:37 | 1 |
|
ests | andreyDagger`~ | 1464. Light | 1 May 2025 03:48 | 1 |
ests andreyDagger`~ 1 May 2025 03:48 0 0 16 1 1 2 1 2 0 3 0 3 1 2 2 3 2 4 1 4 3 0 3 0 4 1 4 1 5 -1 5 -1 -1 1 -1 12.00000000000000000000 0 0 5 -1 -1 1 0 0 -1 2 -2 2 4 5.50000000000000000000 0 0 17 -1 -1 5 -1 1 0 1 1 2 2 2 1 3 1 3 3 4 4 4 3 5 3 5 5 0 5 0 6 6 6 6 7 -1 7 24.00000000000000000000 0 0 4 0 -1 1 0 0 1 -1 0 2.00000000000000000000 0 0 4 -1 2 -1 -1 1 0 3 -1 3.6666666666 0 0 3 -1 -1 1 -1 0 1 2.00000000000000000000 0 0 11 0 -1 3 0 2 2 1 1 2 3 0 4 0 3 -1 5 -2 3 0 2 -1 0 10.50000000000000000000 |
hint please | sailingoat | 2041. Nanomatryoshkas | 29 Apr 2025 21:03 | 1 |
I would appreciate hints(or solution) a lot! Please e-mail me at addflash@dmc.chat |
Question about sample | ConnorChang | 1143. Electric Path | 28 Apr 2025 05:03 | 1 |
Why is the sample 50.211, shouldn't the sample be 50.198 because the path (45, 0) -> (50, 1) -> (5, 1) -> (0, 0) is length 50.198? |
I am curious | andreyDagger`~ | 2053. Biology | 25 Apr 2025 01:41 | 1 |
Is there some constructive approach? I solved it with some tricky bruteforce with optimizations |