Code with Cisco OA Help : Interview Help
Ir al canal en Telegram
Codeforces Codechef Leetcode AtCoder GFG CodeStudio All Contests Solutions available.
Mostrar más916
Suscriptores
Sin datos24 horas
-47 días
+5530 días
Archivo de publicaciones
100094. Subarrays Distinct Element Sum of Squares I
Done ✅
Dm @cp_wala
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target("popcnt")
#define int long long
#define tccc \
int t; \
cin >> t; \
while (t--)
void DUPLET()
{
int n;
cin >> n;
if (n % 2 == 0)
cout << n << ' ' << n + 1 << endl;
else
cout << n << ' ' << n - 1 << endl;
}
signed main()
{
tccc
DUPLET();
return 0;
}
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define tc \
int tcc; \
cin >> tcc; \
while (tcc--)
void CHEAT()
{
int n;
cin >> n;
cout << n / 7 + (n % 7 > 1) << endl;
}
signed main()
{
tc
CHEAT();
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main() {
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
int ans=1;
for(int i=0;i<n;i++){
if(!i) {if(a[i]==ans) ans++; continue;}
ans++;
if(a[i]==ans) ans++;
}
cout<<ans<<endl;
}
}
// A
Kth Index
GCD Sum
Palindrome World
Ninja and Biryani Party
These questions done ✅
¡Ya disponible! Investigación de Telegram 2025 — los principales insights del año 
