source_code stringlengths 26 62k | lang_cluster stringclasses 11
values | src_uid stringlengths 32 32 | code_uid stringlengths 32 32 | difficulty int32 -1 3.5k ⌀ | exec_outcome stringclasses 1
value |
|---|---|---|---|---|---|
interface Query
data class Change(val i: Int, val x: Int): Query
data class Ask(val l: Int, val r: Int, val k: Int, var ans: Int = Int.MAX_VALUE): Query
fun oversolve(test: Int) {
val (n, m) = read.ints
val ta = read.ints
val queries = mutableListOf<Query>()
for (i in 0 until m) {
val line = r... | Kotlin | 6c39c72b57a48e0560a32fddaa5713e1 | c1ceb4ffd0d6e712b89c36121df49dc6 | -1 | PASSED |
interface Query
data class Change(val i: Int, val x: Int): Query
data class Ask(val l: Int, val r: Int, val k: Int, var ans: Int = Int.MAX_VALUE): Query
fun oversolve(test: Int) {
val (n, m) = read.ints
val ta = read.ints
val queries = mutableListOf<Query>()
for (i in 0 until m) {
val line = r... | Kotlin | 6c39c72b57a48e0560a32fddaa5713e1 | 63d8dc69034674f75c14a3c1e90e40b1 | -1 | PASSED |
import java.lang.AssertionError
private fun readLn() = readLine()!! // string line
private fun readInt() = readLn().toInt() // single int
private fun readLong() = readLn().toLong() // single long
private fun readDouble() = readLn().toDouble() // single double
private fun readStrings() = readLn().split(" ") // l... | Kotlin | 6c39c72b57a48e0560a32fddaa5713e1 | b49a4ca609109be79c5b5fd17df9c582 | -1 | PASSED |
interface Query
data class Change(val i: Int, val x: Int): Query
data class Ask(val l: Int, val r: Int, val k: Int, var ans: Int = Int.MAX_VALUE): Query
fun oversolve(test: Int) {
val (n, m) = read.ints
val ta = read.ints
val queries = mutableListOf<Query>()
for (i in 0 until m) {
va... | Kotlin | 6c39c72b57a48e0560a32fddaa5713e1 | 078c72ef32dc659447275a42aa34538b | -1 | PASSED |
fun readLn() = readLine()!!
fun readInt() = readLn().toInt()
fun readStrings() = readLn().split(" ")
fun readInts() = readStrings().map { it.toInt() }
val K = 11
class Ask(
val l: Int,
val r: Int,
val k: Int,
val t: Int,
val i: Int,
var a: Int,
)
data class Upd(
val i: Int,
... | Kotlin | 6c39c72b57a48e0560a32fddaa5713e1 | 58adb3a0245950f1cc98bca37c42db7e | -1 | PASSED |
fun readLn() = readLine()!!
fun readInt() = readLn().toInt()
fun readStrings() = readLn().split(" ")
fun readInts() = readStrings().map { it.toInt() }
val K = 11
class Ask(
val l: Int,
val r: Int,
val k: Int,
val t: Int,
val i: Int,
var a: Int,
)
data class Upd(
val i: Int,... | Kotlin | 6c39c72b57a48e0560a32fddaa5713e1 | 86936952e234caa70ca81975a2d15dde | -1 | PASSED |
fun readLn() = readLine()!!
fun readInt() = readLn().toInt()
fun readStrings() = readLn().split(" ")
fun readInts() = readStrings().map { it.toInt() }
val K = 11
class Ask(
val l: Int,
val r: Int,
val k: Int,
val t: Int,
val i: Int,
var a: Int,
)
data class Upd(
val i: Int,... | Kotlin | 6c39c72b57a48e0560a32fddaa5713e1 | d17af55cd4d351e81e8e233c4eec8c24 | -1 | PASSED |
import kotlin.math.min
private fun readLn() = readLine()!! // string line
private fun readInt() = readLn().toInt() // single int
private fun readLong() = readLn().toLong() // single int
private fun readDouble() = readLn().toDouble() //single double
private fun readStrings() = readLn().split(" ") // list of strin... | Kotlin | 6c39c72b57a48e0560a32fddaa5713e1 | 0eece52784fb1d26f7dfff5f05776649 | -1 | PASSED |
fun main(args: Array<String>) {
var n = readLine()!!.toInt()
var ans:MutableList<Int> = arrayListOf()
while (!ans.contains(n)) {
ans.add(n)
n=alo(n)
}
println(ans.size)
}
fun alo(num:Int):Int{
var num2 = num
num2+=1
while (num2%10==0)
num2=num2/10
return num2
... | Kotlin | 055fbbde4b9ffd4473e6e716da6da899 | cc5ec76be8d6e10dc66d0620591b3231 | -1 | PASSED |
import java.util.*
import java.lang.Math.*
private fun readLn() = readLine()!!
private fun readInt() = readLn().toInt()
private fun readLong() = readLn().toLong()
private fun readDouble() = readLn().toDouble()
private fun readStrings() = readLn().split(" ")
private fun readInts() = readStrings().map { it.toInt... | Kotlin | 055fbbde4b9ffd4473e6e716da6da899 | 74524dbd876a95b2a8a8582888bb9cb3 | -1 | PASSED |
import java.util.*
import java.lang.*
fun main() {
var n = Integer.valueOf(readLine())
val statistic = n
val initialArray = IntArray(100) {i -> 0 * i}
var i = 0
var flag:Int
while(true){
n += 1
while(n % 10 == 0){
n /= 10
}
flag = 0
for (j in 0... | Kotlin | 055fbbde4b9ffd4473e6e716da6da899 | 98271b4d23d94fe0dea14eb5f804f813 | -1 | PASSED |
import java.io.*;
import java.util.*;
import kotlin.system.exitProcess;
//no-translation
class Kattio : PrintWriter {
@JvmField val r : BufferedReader;
@JvmField var st = StringTokenizer("");
constructor() : this(System.`in`,System.out) {}
constructor(i : InputStream, o : OutputStream) : super(o, false) { r = ... | Kotlin | 055fbbde4b9ffd4473e6e716da6da899 | 831beae17bdaad9eeb3df4c6d85ade16 | -1 | PASSED |
import java.util.*
import java.io.*
import kotlin.collections.HashSet
/**
* 1099 -> 11 -> 19 -> 2 -> 9 -> 1
*
* 10
* 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19
*/
fun solve(N: Long) {
val se: HashSet<Long> = HashSet()
var ss = N.toString()
var cur = (ss.substring(0, ss.length - 1) ... | Kotlin | 055fbbde4b9ffd4473e6e716da6da899 | 94338cf8d852df3de7752aa41829e3a3 | -1 | PASSED |
fun main() {
fun readLn() = readLine()!! // string line
fun readILong() = readLn().toLong() // single int
fun readStrings() = readLn().split(" ") // list of strings
fun readInts() = readStrings().map { it.toInt() }.toMutableList() // list of ints
var n = readILong()
var ans = 0L
if ... | Kotlin | 055fbbde4b9ffd4473e6e716da6da899 | a0336db67e26bb544e45b0303bd45c2b | -1 | PASSED |
import java.io.File
import java.util.*
import java.util.stream.*;
import java.io.*
@JvmField
val ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE");
fun minPair(x : Pair<Int,Int>,y:Pair<Int,Int>) : Pair<Int,Int>{
return if(x.first>=y.first) y else x;
}
val mp = HashMap<Long,Boolean>()
var ans=0;
fun r... | Kotlin | 055fbbde4b9ffd4473e6e716da6da899 | 853208cbf00e00f498984c815ca9f66c | -1 | PASSED |
import java.util.*
object programkt {
@JvmStatic
fun main(args: Array<String>) {
val sc = Scanner(System.`in`)
var n = sc.nextInt()
var dem = 1
if (n % 10 == 0) {
n += 1
dem++
}
val s = n.toString()
if (s.length == 1) ... | Kotlin | 055fbbde4b9ffd4473e6e716da6da899 | 453e37788c8fb1c4c7771e5f8815238f | -1 | PASSED |
fun main() {
var n = readInt()
val hashSet = HashSet<Int>()
while (hashSet.add(n)) {
n+=1
while (n%10 == 0){
n/=10
}
}
println(hashSet.size)
}
fun readInt() = readLine()!!.toInt() | Kotlin | 055fbbde4b9ffd4473e6e716da6da899 | 1b4461b528deb1d41e5121d04604e42d | -1 | PASSED |
fun main() {
var n: Int = readLine()!!.toInt()
val N: Int = n
var counter: Int = 0
while (n >= 10) {
n++
while (n % 10 == 0) {
n /= 10
}
if(n > 10)
counter++
}
println(counter + 9 + (if(N < 10) 0 else 1))
} | Kotlin | 055fbbde4b9ffd4473e6e716da6da899 | d5cff6a9081276c220c211357a2e8987 | -1 | PASSED |
import kotlin.text.*
private fun readLn() = readLine()!! // string line
private fun readInt() = readLn().toInt() // single int
private fun readStrings() = readLn().split(" ") // list of strings
private fun readInts() = readStrings().map { it.toInt() } // list of ints
private fun readLong() = readLn().toLong() // s... | Kotlin | 711d15e11016d0164fb2b0c3756e4857 | c5b15b68820dd8726c99b0795a60e9f8 | -1 | PASSED |
import java.io.BufferedReader
import java.io.InputStreamReader
import java.util.*
import java.lang.AssertionError
import kotlin.math.*
val input = BufferedReader(InputStreamReader(System.`in`))
val output = StringBuilder()
fun main() {
var (n, m) = ints()
var s = Array<String>(n) { "" }
var st... | Kotlin | 711d15e11016d0164fb2b0c3756e4857 | c0efe84d90de2c8b334f99906a23edc1 | -1 | PASSED |
//region TEMPLATE
@file:Suppress("CanBeVal")
import java.io.*;
import java.io.BufferedReader
import java.lang.Exception
import java.util.*
fun main(args: Array<String>) {
if (args.isNotEmpty() && args.first() == "file") {
out = PrintWriter(FileWriter("output.txt"))
reader = BufferedRead... | Kotlin | 711d15e11016d0164fb2b0c3756e4857 | 76872f76171fc275c112d21f0612ef67 | -1 | PASSED |
//region TEMPLATE
@file:Suppress("CanBeVal")
import java.io.*;
import java.io.BufferedReader
import java.lang.Exception
import java.util.*
fun main(args: Array<String>) {
if (args.isNotEmpty() && args.first() == "file") {
out = PrintWriter(FileWriter("output.txt"))
reader = BufferedRead... | Kotlin | 711d15e11016d0164fb2b0c3756e4857 | 78eae2609e5081c523c51cdfc5135071 | -1 | PASSED |
import java.lang.AssertionError
private fun readLn() = readLine()!! // string line
private fun readInt() = readLn().toInt() // single int
private fun readLong() = readLn().toLong() // single long
private fun readDouble() = readLn().toDouble() // single double
private fun readStrings() = readLn().split(" ") // l... | Kotlin | 711d15e11016d0164fb2b0c3756e4857 | 9f2700464f7f1a534e3495432a223d9c | -1 | PASSED |
import kotlin.math.*
const val mod = 998_244_353
fun reduceInt(x: Int): Int {
return x - (if (x >= mod) mod else 0)
}
fun reduce(x: Long): Int {
return (x % mod).toInt()
}
fun intInv(x: Int): Int = if (x == 1) {
1
} else {
mod - reduce(intInv(mod % x) * (mod / x).toLong())
}
class... | Kotlin | 711d15e11016d0164fb2b0c3756e4857 | 57c5f4270af0f22c17f9b1163a44a9de | -1 | PASSED |
import java.io.PrintWriter// {{{
import java.util.*
import kotlin.collections.*// }}}
const val MOD = 998244353
class Modular(var value: Int) {
init {
if ((value > MOD) or (value < -MOD))
value %= MOD
if (value < 0)
value += MOD
}
constructor(other: Modular): this(... | Kotlin | 711d15e11016d0164fb2b0c3756e4857 | 407d0eb1a5375e605c89b1278a2651c8 | -1 | PASSED |
import java.util.*
val MOD = 998244353L
fun add(x: Long, y: Long): Long {
val z = x + y
return if (z >= MOD) z - MOD else z
}
fun sub(x: Long, y: Long): Long {
val z = MOD + x - y
return if (z >= MOD) z - MOD else z
}
fun mul(x: Long, y: Long): Long {
return x * y % MOD
}
fun pow(x_: Long, y... | Kotlin | 711d15e11016d0164fb2b0c3756e4857 | 6d0c6cf01cf73522a5254a66dd79698b | -1 | PASSED |
import kotlin.math.max
import kotlin.math.min
const val MOD = 998244353L
fun main() {
val (n, m) = readLine()!!.split(" ").map { it.toInt() }
val words = Array(n) { readLine()!! }
val position = Array(5) { Array(5) { IntArray(n) } }
var ix = 0
for (a in 0..4) {
for (b in 0..4) {
... | Kotlin | 711d15e11016d0164fb2b0c3756e4857 | 2574346ba00a9fb8859405c6f0df530d | -1 | PASSED |
import kotlin.math.max
import kotlin.math.min
const val MOD = 998244353L
fun main() {
val (n, m) = readLine()!!.split(" ").map { it.toInt() }
val words = Array(n) { readLine()!! }
val position = Array(5) { Array(5) { IntArray(n) } }
var ix = 0
for (a in 0..4) {
for (b in 0..4) {... | Kotlin | 711d15e11016d0164fb2b0c3756e4857 | 3e13e60c6905f7d7f188ea0fbbba183c | -1 | PASSED |
#include<iostream>
using namespace std;
const int MAXN=1e4+10;
const int MR=1e3+5;
int f[MAXN][2*MR];int n;
int a[MAXN];
void solve(){
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=0;i<=n;i++)
for(int j=0;j<2*MR;j++)
f[i][j]=1e9;
f[0][0]=0;
for(int i=0;i<n;i++)
for(int j=0;j<2*MR;j++)
... | C++ | aaa27c57c829f1eb3774ca1e5c1be471 | 0be77f3c6a20a993f23c0f69ac36a92a | 2,200 | PASSED |
#include<iostream>
#include<cstring>
using namespace std;
const int N = 1010, INF = 0x3f3f3f3f;
int n;
int a[10 * N];
int f[10 * N][3 * N];
inline int read()
{
int x = 0, f = 1;
char ch = getchar();
while(ch < '0' || ch > '9')
{
if(ch == '-') f = -1;
ch = getchar();
}
while(ch >= '0' &... | C++ | aaa27c57c829f1eb3774ca1e5c1be471 | 6932f9a117f2d3408ebe6c6247faefac | 2,200 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int read(){
int num=0, flag=1; char c=getchar();
while(!isdigit(c) && c!='-') c=getchar();
if(c=='-') flag=-1, c=getchar();
while(isdigit(c)) num=num*10+c-'0', c=getchar();
return num;
}
const int N = 1053;
const int i... | C++ | aaa27c57c829f1eb3774ca1e5c1be471 | fc0ddbd279db1a4d3bc6fb52176ca71d | 2,200 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int read(){
int num=0, flag=1; char c=getchar();
while(!isdigit(c) && c!='-') c=getchar();
if(c=='-') flag=-1, c=getchar();
while(isdigit(c)) num=num*10+c-'0', c=getchar();
return num;
}
const int N = 1053;
const int i... | C++ | aaa27c57c829f1eb3774ca1e5c1be471 | 2ef8b2bd62d6a1f8d1697f8a2f15539e | 2,200 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int read(){
int num=0, flag=1; char c=getchar();
while(!isdigit(c) && c!='-') c=getchar();
if(c=='-') flag=-1, c=getchar();
while(isdigit(c)) num=num*10+c-'0', c=getchar();
return num;
}
const int N = 1051;
const int i... | C++ | aaa27c57c829f1eb3774ca1e5c1be471 | 0d69cafa7f50c20d27ca59b0d808b3d3 | 2,200 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int read(){
int num=0, flag=1; char c=getchar();
while(!isdigit(c) && c!='-') c=getchar();
if(c=='-') flag=-1, c=getchar();
while(isdigit(c)) num=num*10+c-'0', c=getchar();
return num;
}
const int N = 1050;
const int i... | C++ | aaa27c57c829f1eb3774ca1e5c1be471 | 1d61036dc2842e68a18a0902de38165a | 2,200 | PASSED |
#include<iostream>
using namespace std;
const int MAXN=1e4+5;
const int MR=1e3+5;
int f[MAXN][2*MR];int n;
int a[MAXN];
void solve(){
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=0;i<=n;i++)
for(int j=0;j<2*MR;j++)
f[i][j]=1e9;
f[0][0]=0;
for(int i=0;i<n;i++)
for(int j=0;j<2*MR;j++)
... | C++ | aaa27c57c829f1eb3774ca1e5c1be471 | e9dc18e3afce2ad47eb1933d8aa8c53f | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn=1e4+10,maxl=1000;
int T,n,a[maxn];
int dp[2][8010];
int main()
{
//freopen("aaa.txt","w",stdout);
cin>>T;
while(T--){
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
memset(dp,~0xcf,sizeof(dp));
... | C++ | aaa27c57c829f1eb3774ca1e5c1be471 | 1c1e6dfc80bece4bc1c0c3124fceb3de | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn=1e4+10,maxl=1000;
int T,n,a[maxn];
int dp[2][8010];
int main()
{
//freopen("aaa.txt","w",stdout);
cin>>T;
while(T--){
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
memset(dp,~0xcf,sizeof(dp));
... | C++ | aaa27c57c829f1eb3774ca1e5c1be471 | b5f27b44da1641cc37d11cf6869bb79b | 2,200 | PASSED |
#pragma comment(linker,"/stack:200000000")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
#define ll ... | C++ | aaa27c57c829f1eb3774ca1e5c1be471 | b445e1e9a68c1f56643148d41bddc277 | 2,200 | PASSED |
# include <bits/stdc++.h>
using namespace std ;
int main()
{
int t ; cin>>t;
while(t--){
int n ; cin>>n;
deque <int> dq;
for (int i=0 ; i<n; i++){
int x ; cin >>x ;
if (n==0)
dq.push_back(x);
else {
if (x <= dq.front( ))... | C++ | 5afa0e4f34ab8c8c67bc8ecb7d6d2d7a | fea582af4692220456b53c774165b7c6 | 1,000 | PASSED |
#include <iostream>
#include<queue>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
int* arr=new int[n];
deque<int>dq;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++)
{
... | C++ | 5afa0e4f34ab8c8c67bc8ecb7d6d2d7a | fb38ea9e92a37ec36413e749b3807af9 | 1,000 | PASSED |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<set>
#include<iomanip>
#define ll long long
#define loop(n) for (long long i = 0; i < n; i++)
#define loop1(n) for (long long j= 0; j <n; j++)
#define ts ll t; cin>>t; while(t-... | C++ | 5afa0e4f34ab8c8c67bc8ecb7d6d2d7a | 845ee67e75b1fbdab670696301f726b5 | 1,000 | PASSED |
#include <bits/stdc++.h>
#define moe ios_base::sync_with_stdio(0);cin.tie(0);cin.tie(0);
using namespace std;
int main() {
moe
int t;
cin>>t;
while(t--){
int n,x;
cin>>n;
deque<int>dq;
for (int i = 0; i < n; ++i) {
cin>>x;
if(dq.empty())dq.push_bac... | C++ | 5afa0e4f34ab8c8c67bc8ecb7d6d2d7a | c7f32bc7b713b21ed9592fd4df5670dd | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int MAXN=2e5+5;
int a[MAXN];
deque<int> q;
int main()
{
int t;
scanf("%d",&t);
while (t--)
{
int n;
cin>>n;
for (int i=0;i<n;i++)
cin>>a[i];
for (int j=0;j<n;j++)
{
if (q.empty())
q.push_front(a[j]);
else
{
if (a[j]<q.front())
... | C++ | 5afa0e4f34ab8c8c67bc8ecb7d6d2d7a | a52013db8975a3d73cdf391f1f7558b1 | 1,000 | PASSED |
#define ll long long
#include <bits/stdc++.h>
using namespace std;
/*void print(int n)
{
cout<<n<<" ";
if(n==1)
{
return;
}
if(n%2==0)
{
print(n/2);
}
if(n%2==1)
{
print(3*n+1);
}
}
*/
int main() {
//freopen("output.txt","w",stdout);
//freopen(... | C++ | 5afa0e4f34ab8c8c67bc8ecb7d6d2d7a | ec6b8c705bb0b4b721cb9cccb7a555b8 | 1,000 | PASSED |
#include <iostream>
#include <deque>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t{ 0 };
cin >> t;
while (t--) {
int n{ 0 };
deque <int> dq;
cin >> n;
while (n--) {
int x{ 0 };
cin >> x;
if (dq.empty()) dq.push_back(x);
else if (x < dq[0]) dq.pu... | C++ | 5afa0e4f34ab8c8c67bc8ecb7d6d2d7a | 6ee253cd056d4ab847f2787ff07170c9 | 1,000 | PASSED |
// MoElsherif
#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
#define yes cout << "YES\n"
#define no cout << "NO\n"
using namespace std;
void fastInput(){
cout.tie(nullptr);
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
}
int main(){
fastInput();
int t = 0;
cin >> t;
wh... | C++ | 5afa0e4f34ab8c8c67bc8ecb7d6d2d7a | 0c0f1b5f735b1b03d1b0e25e3751d71c | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int a[1000005];
deque<int>din;
int main(){
int t ;cin >> t;while(t--){
int n;
cin >> n;
for(int i =1 ; i<= n ; i++)cin >> a[i];
for(int i = 1 ; i <= n;i++){
if(i == 1){din.push_front(a[i]);continue;}
if(a[i]>din.fro... | C++ | 5afa0e4f34ab8c8c67bc8ecb7d6d2d7a | c302118f4a39d98d76a0ab5b5cf3677b | 1,000 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<deque>
#include<bits/stdc++.h>
using namespace std;
const int N = 200005;
int t;
int n;
int a[N];
int b[N];
int main()
{
cin >> t;
while(t --)
{
deque<int> d;
cin >> n;
int index = -1;
int minn = 0x3f;
for(int i = 1; i <= n; i++)
{
... | C++ | 5afa0e4f34ab8c8c67bc8ecb7d6d2d7a | 22e8f3efb3cae286d0a8414bcaf330c5 | 1,000 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
ll t,n,a[100],z[100],x[100];
int main() {
cin >> t;
for (int i=0;i<t;i++) {
cin >> n;
for (int j=0;j<n;j++)
cin >> a[j];
ll cnt=0;
for (int j=n-1;j>0;j--) {
... | C++ | 06c515c2d889edec8db784b2d5279edc | 292736476e41dd5257b2736262008ed0 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int t, n, cur;
int a[100];
int l[100];
int d[100];
void shift(int l, int r, int d)
{
int anew[100];
for (int i = l; i <= r; i++)
{
if(i+d <= r)anew[i] = a[i+d];
else anew[i] = a[i+d-r+l-1];
}
for (int i = l; i <= r; i++)... | C++ | 06c515c2d889edec8db784b2d5279edc | b5588fd3c8e324bed2bcf7b3959a9a66 | 1,100 | PASSED |
#include<bits/stdc++.h>
#define x first
#define y second
using namespace std;
using i64=long long;
void solve()
{
int n;
cin>>n;
vector<int>a(n);
for(int i=0;i<n;i++)
cin>>a[i];
auto b=a;
sort(b.begin(),b.end());
reverse(b.begin(),b.end());
vector<tuple<int,int,int... | C++ | 06c515c2d889edec8db784b2d5279edc | 29265e96bf11bb5a871422ca85acd3e9 | 1,100 | PASSED |
#include<bits/stdc++.h>
#define x first
#define y second
using namespace std;
using i64=long long;
void solve()
{
int n;
cin>>n;
vector<int>a(n);
for(int i=0;i<n;i++)
cin>>a[i];
vector<tuple<int,int,int>>ans;
for(int i=0;i<n;i++)
{
int j=min_element(a.begin()+i,a... | C++ | 06c515c2d889edec8db784b2d5279edc | 51642947a3827f5e7e2a3477049f1c6d | 1,100 | PASSED |
#include<bits/stdc++.h>
#define x first
#define y second
using namespace std;
using i64=long long;
void solve()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
vector<tuple<int,int,int>>ans;
for(int i=0;i<n;i++)
{
int j=min_element(a+i,a+n)-a;
i... | C++ | 06c515c2d889edec8db784b2d5279edc | cdea4297713151a1d537c009f8484b0d | 1,100 | PASSED |
#include <stdio.h>
int main(void) {
int t, n, i, j, k, s, tt;
static int a[50];
static int b[50][3];
scanf("%d", &t);
while (t--) {
s = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
j = a[i + 1];
for (k = 0; k < i +... | C++ | 06c515c2d889edec8db784b2d5279edc | ab5d90227ecda707d5649b6303b31537 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int a[52];
int m[52][2];
int main() {
int t = 0;
cin >> t;
while (t--) {
int n = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
a[0] = -1000000000;
int num = 0;
int b = 0;
for (int j = n; j >= 1; j--) {
int max = 0;
for (int i = 1; i... | C++ | 06c515c2d889edec8db784b2d5279edc | bd23c86aac06110746240d600d77a7e7 | 1,100 | PASSED |
#include "bits/stdc++.h"
#define x first
#define y second
using namespace std;
const int N = 110;
typedef pair<int ,int > PII;
typedef long long int LL;
LL t, n;
LL a[N];
struct op {
LL l, r, d;
};
void Swap(int l, int r, int d) {
vector<LL> b;
for(int i = l + d; i <= r; i++) {
b.push_back(a[i]);
}
for(int i... | C++ | 06c515c2d889edec8db784b2d5279edc | 7743d0fdce266ccb15207d3b7c9ebd99 | 1,100 | PASSED |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define allr(x) (x).rbegin(), (x).rend()
#define pb push_back
using namespace std;
int main()
{
cin.sync_with_stdio(0), cin.tie(0);
int t, n, l, r, idx;
cin >> t;
while (t--)
{
cin >> n;
l = 0, r = n-1;
vecto... | C++ | 06c515c2d889edec8db784b2d5279edc | c84dddd80fea0a51b1454eac877737e2 | 1,100 | PASSED |
/*
~~A题~~
# include<bits/stdc++.h>
using namespace std;
const int N = 105;
int T,n,a[N];
void solve(){
int ans = 0;
cin >> n;
for(int i = 0 ; i < n ; i ++) cin >> a[i];
for(int i = 0 ; i <= n - 2 ; i ++ )
for(int j = 0 ; j < n - 1 - i ; j ++ )
if(a[j] > a[j+1]) ans++,swap(a[j],a[j+1]);
cout<<"Optimal train ... | C++ | 06c515c2d889edec8db784b2d5279edc | ff226820e287cc2c32a56c17755db96c | 1,100 | PASSED |
n = int(input())
l = [input() for _ in range(n)]
for i in l:
a = i.count('A')
b = i.count('B')
c = i.count('C')
if a + c == b:
print("YES")
else:
print("NO")
# Fri Apr 15 2022 17:33:44 GMT+0000 (Coordinated Universal Time)
# Fri Apr 15 2022 17:33:50 GMT+0000 (Coordinated Un... | Python | ca6b162f945d4216055bf92d7263dbd5 | 8ad6be3dd1943c3bd96245ff498cd510 | 800 | PASSED |
n = int(input())
l = [input() for _ in range(n)]
for i in l:
a = i.count('A')
b = i.count('B')
c = i.count('C')
if a + c == b:
print("YES")
else:
print("NO")
# Fri Apr 15 2022 17:33:44 GMT+0000 (Coordinated Universal Time)
| Python | ca6b162f945d4216055bf92d7263dbd5 | 0dba42e7a3f958c059c2d3cebc9d0c7a | 800 | PASSED |
a = []
t = int(input())
for i in range(t):
a.append(input())
for i in a:
b = i.count('B')
c = i.count('C')
f = i.count('A')
if b - (c + f) == 0:
print('YES')
else:
print('NO')
# Wed Apr 13 2022 13:52:23 GMT+0000 (Coordinated Universal Time)
# Wed Apr 13 2022 13:52... | Python | ca6b162f945d4216055bf92d7263dbd5 | 7276a809d0ef528ab694a71f2edd03cc | 800 | PASSED |
a = []
t = int(input())
for i in range(t):
a.append(input())
for i in a:
b = i.count('B')
c = i.count('C')
f = i.count('A')
if b - (c + f) == 0:
print('YES')
else:
print('NO')
# Wed Apr 13 2022 13:52:23 GMT+0000 (Coordinated Universal Time)
| Python | ca6b162f945d4216055bf92d7263dbd5 | 41f034cf629e555fa95d56ba5ca08062 | 800 | PASSED |
for _ in range(int(input())):
sl = [0, 0, 0]
s = input()
for i in s:
if i == 'A':
sl[0] += 1
elif i == 'B':
sl[1] += 1
else:
sl[2] += 1
if sl[1] == sl[0]+sl[2]:
print('YES')
else:
print('NO')
# Mon Apr 11 2022 1... | Python | ca6b162f945d4216055bf92d7263dbd5 | 2113009d686a912cddf2210755095ae0 | 800 | PASSED |
for _ in range(int(input())):
sl = [0, 0, 0]
s = input()
for i in s:
if i == 'A':
sl[0] += 1
elif i == 'B':
sl[1] += 1
else:
sl[2] += 1
if sl[1] == sl[0]+sl[2]:
print('YES')
else:
print('NO')
# Mon Apr 11 2022 1... | Python | ca6b162f945d4216055bf92d7263dbd5 | 29df0a2b9909771c9072b2425795a2de | 800 | PASSED |
t = int(input())
A = []
for i in range(t):
A.append(input())
for stroka in A:
a = stroka.count('A')
b = stroka.count('B')
c = stroka.count('C')
if a + c == b:
print('YES')
else:
print('NO')
# Mon Apr 11 2022 14:17:05 GMT+0000 (Coordinated Universal Time)
| Python | ca6b162f945d4216055bf92d7263dbd5 | 7099570cfe1115fb53ce061ed773fbd4 | 800 | PASSED |
t = int(input())
for i in range(t):
s = input()
if len(s) % 2 == 1:
print('NO')
else:
a = s.count('A')
b = s.count('B')
c = s.count('C')
if b == a + c:
print("YES")
else:
print("No")
# Mon Apr 11 2022 14:16:27 GMT+0000 (Co... | Python | ca6b162f945d4216055bf92d7263dbd5 | 6d96808c9e83588f6e30ae147e4991ec | 800 | PASSED |
n=int(input())
for i in range(n):
s=input()
if s.count("B") == (s.count("A")+s.count("C")):
print("YES")
else:
print("NO")
# Mon Apr 11 2022 14:06:12 GMT+0000 (Coordinated Universal Time)
# Mon Apr 11 2022 14:06:18 GMT+0000 (Coordinated Universal Time)
| Python | ca6b162f945d4216055bf92d7263dbd5 | fbf844f30c8b875be639e2e5c2effc55 | 800 | PASSED |
n=int(input())
for i in range(n):
s=input()
if s.count("B") == (s.count("A")+s.count("C")):
print("YES")
else:
print("NO")
# Mon Apr 11 2022 14:06:12 GMT+0000 (Coordinated Universal Time)
| Python | ca6b162f945d4216055bf92d7263dbd5 | e75f0ae988266034e68aee95d358e9f6 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(NULL);cin.tie(NULL);cout.tie(NULL);
#define ll long long
bool a[1000006];
int p[1000006];
int ex[1000006];
int l[1000006];
int in[1000006];
vector<pair<int,int>>vec[1000006];
vector<int>f[1000006];
bool mp[1000006];
int mai... | C++ | c15bce9c4b9eddf5c8c3421b768da98c | 266068bcc9dc26091c28de794f15456d | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
int max(int a, int b) {
if (a > b) return a;
return b;
}
void solve(vector<int>& arr, int n, int d) {
int ans = 0;
vector<bool> used(n, false);
// 0 1 0 1
for (int ... | C++ | c15bce9c4b9eddf5c8c3421b768da98c | 81f7b980778b8e59ce240f6dd76dd495 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int gcd(int n1, int n2) {
int tmp;
while (n2 != 0) {
tmp = n1;
n1 = n2;
n2 = tmp % n2;
}
return n1;
}
void solve(vector<int>& arr, int n, int d) {
int ans = 0, e = gcd(n, d);
for (int i = 0; i < e; i++) {
int count = 0, pos = i;
for (int... | C++ | c15bce9c4b9eddf5c8c3421b768da98c | 98c086190bbb830db561319394e85b06 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int gcd(int n1, int n2) {
int tmp;
while (n2 != 0) {
tmp = n1;
n1 = n2;
n2 = tmp % n2;
}
return n1;
}
void solve(vector<int>& arr, int n, int d) {
int ans = 0, e = gcd(n, d);
for (int i = 0; i < e; i++) {
int count = 0, pos = i;
for (int... | C++ | c15bce9c4b9eddf5c8c3421b768da98c | f66e9273cb2b274b8f043ab49a80f87e | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int gcd(int n1, int n2) {
int tmp;
while (n2 != 0) {
tmp = n1;
n1 = n2;
n2 = tmp % n2;
}
return n1;
}
void solve(vector<int>& arr, int n, int d) {
int ans = 0, e = gcd(n, d);
for (int i = 0; i < e; i++) {
int count = 0, pos = i;
for (int... | C++ | c15bce9c4b9eddf5c8c3421b768da98c | d5ff58d9116b1caf2b4500adba462e8d | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int gcd(int n1, int n2) {
int tmp;
while (n2 != 0) {
tmp = n1;
n1 = n2;
n2 = tmp % n2;
}
return n1;
}
void solve(vector<int>& arr, int n, int d) {
int ans = 0, e = gcd(n, d);
for (int i = 0; i < e; i++) {
int count = 0, pos = i;
for (int... | C++ | c15bce9c4b9eddf5c8c3421b768da98c | 429efc5f851eb09e402386da35c35969 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define REP(T,i,a,b) for (T i = a, something_noone_cares_about = b; i < something_noone_cares_about; i++)
#define RVEP(T,i,b,a) for (T i = b, something_noone_cares_about = a; i >= something_noone_cares_about; i--)
#define RREP(T,i,a,b) for (T i = a, something_noone_ca... | C++ | c15bce9c4b9eddf5c8c3421b768da98c | 1f837c6cf845d7faf3798a1885a781d9 | 1,700 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define int long long
using namespace std;
int N = 2e5;
const int mod = 998244353;
const int INF = 1e9 + 11;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin()... | C++ | c15bce9c4b9eddf5c8c3421b768da98c | fdbe7fe0da12227ab3d3989928e3ce89 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n, d;
int res;
vector<int> a(1e6);
vector<bool> visited(1e6,false);
bool impossible;
void dfs(vector<int>& adj, int node, int count, int len){
if (visited[node] == true && a[node] == 0){
return;
}
if (visited[node] == true && count =... | C++ | c15bce9c4b9eddf5c8c3421b768da98c | d3f9adef0a85586b6e44e07146ef83ed | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
#define pii pair<int,int>
const int N=2e5+5;
int n, q, offset;
auto main() ->int32_t
{
IOS
cin >> q;
while(q--)
{
cin >> n >> offset;
vector<int>a(n);
... | C++ | c15bce9c4b9eddf5c8c3421b768da98c | 41af4d2b1bd67a419a8d44c3f57cff3f | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const int N=2e5+5;
int main() {
FAST
int t;
cin>>t;
while (t--) {
int n;
cin >> n;
int x;
priority_queue<tuple<int, int>> q;
for (int i = 0; i < n; i++) ... | C++ | 5c013cdc91f88c102532a86058893f0d | d5c1a1711f272dfc698f50c405ca6c0a | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
struct node{
int v,pl;
}a[2000005];
int c[200005],b[200005];
priority_queue<pair<int,int>>q;
int main(){
int t,n;
cin>>t;
while(t--){
while(!q.empty())q.pop();
cin>>n;
for(int i=1;i<=n;i++){
int tem;
cin>>tem;
... | C++ | 5c013cdc91f88c102532a86058893f0d | f10f4078d9d36cb4fa10660e0ec00528 | 1,400 | PASSED |
#include<bits/stdc++.h>
const int maxn=2e5+10;
struct people
{
int times;
int pl;
}p[maxn];
struct cmp
{
bool operator()(const people &q,const people &w)
{
return q.times<w.times;
}
};
int l[maxn],r[maxn];
int ans;
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n;
ans=0;
p... | C++ | 5c013cdc91f88c102532a86058893f0d | e3d889ca6e5c5f123c9ed88cc776e0be | 1,400 | PASSED |
// Created by Xueoyet on 2022/4/18 21:49.
#include <map>
#include <algorithm>
#include <queue>
#include "sstream"
#include "iostream"
#include "vector"
#pragma clang diagnostic push
#pragma ide diagnostic ignored "err_typecheck_invalid_operands"
#pragma ide diagnostic ignored "err_ovl_no_viable_member_function_in_call"... | C++ | 5c013cdc91f88c102532a86058893f0d | 72ffa05534bd4a3a199e739d89cd417b | 1,400 | PASSED |
#include "bits/stdc++.h"
#define P pair<int, int>
using namespace std;
int main() {
int t;
cin>>t;
while(t--) {
int n;
cin>>n;
priority_queue<P> q;
for(int i = 1; i <= n; i++) {
int d;
cin>>d;
q.push({d, i});
}
vector<P> res;
while(q.size() > 1 && q.top().first > 0) {
P x = q.top();... | C++ | 5c013cdc91f88c102532a86058893f0d | 6ba2e4286067f38f54b4598053b79715 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
typedef long long ll;
const ll N=2e5+7;
const ll INF=1e18;
struct F{
int num;
int val;
}zt[N];
struct FF{
int x,y;
}res[N];
bool operator <(const F &a,const F &b){
if(a.val!=b.val)
return a.val<b.val;
retu... | C++ | 5c013cdc91f88c102532a86058893f0d | 57452515e1933a278198db08de72fa45 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
struct node{
int pos,val;
bool operator<(const node &a)const{
return a.val > val;
}
};
priority_queue<node>q;
int ans1[200010];
int ans2[200010];
int main(){
int _;cin >> _;
while(_--){
while(q.size()) q.pop();
int n;cin >> n;
for(int i ... | C++ | 5c013cdc91f88c102532a86058893f0d | 7811c11facf31d0c3f741155e3d6c70c | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define F first
#define S second
#define pb push_back
#define si set <int>
#define vi vector <int>
#define pii pair <int, int>
#define vpi vector <pii>... | C++ | 5c013cdc91f88c102532a86058893f0d | f5e48c5b0213020f50265e36016d765a | 1,400 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
#include <numeric>
#define ll long long
using namespace std;
void precal(){
}
void solve() {
int n;
cin>>n;
priority_queue<pair<int, int>>pq;
for(int i=1; i<=n;i++) {
int x;
cin>>x;
if(x>0) pq.push({x, i});
}
vector<pair<int, int>>ans;
while (... | C++ | 5c013cdc91f88c102532a86058893f0d | 73b7906178ed1dd3b7b807894093455d | 1,400 | PASSED |
#include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <math.h>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <string.h>
#define ll long long
using namespace std;
const int M=1e5+5;
/*struct T{
int id;
int num;
};
bool cmp... | C++ | 5c013cdc91f88c102532a86058893f0d | 007669f6694ad0bbd46a9956b54828c0 | 1,400 | PASSED |
#include<iostream>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<unordered_map>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<set>
#include<cstdlib>
#include<stack>
#define forin(i,a,n) for(int i=a;i<=n;i++)
#define forni(i,n,a) for(int i=n;i>=a;i--)
using namespace std;
type... | C++ | 99335597ae5a2fa5946019790d888f08 | 2c91fc7451517abe033f1d30615c3ef9 | 1,500 | PASSED |
#include <stdio.h>
int main(void)
{
int t;
scanf("%d", &t);
while (t--)
{
int n, m, k;
static char a[10][19];
scanf("%d %d %d", &n, &m, &k);
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
scanf("%c", &a[i][j]);
if (a[i][j] != '.' && a[i][j] != '*')
{
j--;
}
}
... | C++ | 99335597ae5a2fa5946019790d888f08 | 1ab86fd7350ad1dfce5e6a1c5b5012a9 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while(t--){
int m, n, k;
cin >> m >> n >> k;
vector < string > grid(m);
string s;
cin.ignore();
for(int i = 0; i < m; i++){
getline(cin, grid[i]);
}... | C++ | 99335597ae5a2fa5946019790d888f08 | 6bc85603cbb24a8279ff8c56aa712e76 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int t;
cin >> t;
while(t--){
bool valid = true;
int n, m, k;
cin >> n >> m >> k;
int table[n][m];
/* 0 -> Branca
1 -> Preta
2 -... | C++ | 99335597ae5a2fa5946019790d888f08 | 5b14b9354391e0a1a0a1e130b65e7cd8 | 1,500 | PASSED |
#include <stdio.h>
int main() {
int t, k;
int n, m;
int x, y, f;
int flag;
int cnt1, cnt2;
char a[99][99];
int b[99][99];
scanf("%d", &t);
getchar();
for (x = 0; x < t; x++) {
scanf("%d%d%d", &n, &m, &k);
getchar();
cnt1 = 0;
for (y = 1; y <= n; y++) {
for (f = 1; f <= m; f++) {
scanf("%c", &a... | C++ | 99335597ae5a2fa5946019790d888f08 | fcba69c6bf44f715ebde39115dfa6aeb | 1,500 | PASSED |
#include<bits/stdc++.h>
#define endl '\n'
#define pb push_back
typedef long long ll;
using namespace std;
int n,m,k;
bool vis[25][25];
char a[25][25];
void ex(int x,int y){
int d=0;
for(int i=x-1,j=y-1,k=y+1;i>=1&&j>=1&&k<=m;--i,--j,++k){ //左上,右上
if(a[i][j]==a[i][k]&&a[i][k]=='*') ++d;
else break;
}
// ++i,++j,-... | C++ | 99335597ae5a2fa5946019790d888f08 | 30cb0e9d6adb68ec35d690cb3cb867d0 | 1,500 | PASSED |
#include<stdio.h>
#include<string.h>
int mn(int a,int b)
{
return a<b?a:b;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
char mp[30][30];
int vis[30][30]={0};
int n,m,k;scanf("%d%d%d",&n,&m,&k);
for(int i=1;i<=n;i++)scanf("%s",mp[i]+1);
int min=9999;
for(int i=k+1;i<=n;i++)
{
for(int j=k+1;j<... | C++ | 99335597ae5a2fa5946019790d888f08 | 1df6e2fc58ee0e76183fa8d95216a159 | 1,500 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
char a[20][20];
int b[20][20];
int n, m,k;
int main()
{
int T;
cin >> T;
while (T--)
{
cin >> n >> m >> k;
int sum = 0,an=0;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
{
cin >> a[i][j];
if... | C++ | 99335597ae5a2fa5946019790d888f08 | d41950fea98f362c87e9e0dfcfa644d3 | 1,500 | PASSED |
#include<iostream>
#include<cstring>
using namespace std;
const int MAX=20;
int a[MAX][MAX],vis[MAX][MAX];
int main(){
int t;
cin>>t;
while(t--){
int n,m,k;
memset(a,0,sizeof a);
memset(vis,0,sizeof vis);
cin>>n>>m>>k;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
char c;
cin>>c;
if(c=='*')a[... | C++ | 99335597ae5a2fa5946019790d888f08 | 185d4cf898539ac843e90773b00fb428 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int mp[20][20];
void solve()
{
memset(mp, 0, sizeof(mp));
int n, m, k;
cin >> n >> m >> k;
for (int i = 1; i <= n; i++)
{
string s;
cin >> s;
for (int j = 1; j <= m; j++)
{
if (s[j-1] == '*')mp[i][j] = 1;
}
}
for (int i = n; i > k; i--)
{
for (int j = ... | C++ | 99335597ae5a2fa5946019790d888f08 | a7eca6db596ae403a49625e87bf64dbf | 1,500 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int... | C++ | aa78a750cac45117f7b4313928c50f76 | e78cb758c281532a390457b8c1585668 | 1,700 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int... | C++ | aa78a750cac45117f7b4313928c50f76 | f85c6e4252f19771721cf7cb8ae66e35 | 1,700 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.