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 |
|---|---|---|---|---|---|
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int test = scanner.nextInt();
while(test-->0){
int cubes = scanner.nextInt();
ArrayList<Integer> cubeVolum... | Java | b34f29e6fb586c22fa1b9e559c5a6c50 | a5b43ab364466e41c4787e56b9f5d27d | 900 | PASSED |
// package Round672;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class typeA {
static long merge2(long[] A,int s, int mid, int n)
{
int i=s,j=mid,k=0;
long[] temp = new long[n-s+1];
long count=0;
while(i<mid && j<=n)... | Java | b34f29e6fb586c22fa1b9e559c5a6c50 | 4133e1310e60a582c356783d8b5ba90d | 900 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
public class Main{
public static void main(String[] args) throws IOException {
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int t=Integer.parseInt(br.rea... | Java | b34f29e6fb586c22fa1b9e559c5a6c50 | 73031d0d0d2c3c99f31cd047008fefee | 900 | PASSED |
import java.io.IOException;
import java.io.InputStream;
import java.util.*;
public class A {
public static void main (String[] args) throws java.lang.Exception {
InputReader in = new InputReader(System.in);
int t = in.readInt();
while(t-->0) {
int n =in.readInt();
int[]nums = new int[n]... | Java | b34f29e6fb586c22fa1b9e559c5a6c50 | cf04ec47505f9d59881b5e6ef51ce045 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define MAX 100005
#define DIV 130
int n, arr[MAX];
bool vis[MAX][DIV];
vector<int> divs;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
if (i > 0 && i < n-n/2 && n%i == ... | C++ | d3a0402de1338a1a542a86ac5b484acc | 440a7dbb5fc3c12286c523f6620862d2 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
bool valid = false;
for (int j = 1; j < n-n/2 && !valid; ++j) {
if (n%j) co... | C++ | d3a0402de1338a1a542a86ac5b484acc | b71cfa418d75eb1c63f8216ae550c0a6 | 1,600 | PASSED |
#include<iostream>
using namespace std;
int main()
{
int n,a[100002];
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=n/3;i++){
if(n%i==0){
int j;
for(j=1;j<=i;j++){
int tmp=j; ... | C++ | d3a0402de1338a1a542a86ac5b484acc | 4850854f2d701516e35f24def933cfe6 | 1,600 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxN = 1e5;
int readInt()
{
bool minus = false;
int result = 0;
char ch;
ch = getchar();
while (true) {
if (ch == '-')
break;
if (ch >= '0' && ch <= '9')
break;
ch = getch... | C++ | d3a0402de1338a1a542a86ac5b484acc | 54593b43f47c530984a296c9e064ccae | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int v[100010];
int dp[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> v[i];
vector<int> dv;
for (int i = 1; i * i < n; ++i)
if(n % i == 0) {
dv.push_back(i);
if(i != n / i a... | C++ | d3a0402de1338a1a542a86ac5b484acc | e1bb9c174dbb05ee8c43084fbc61685d | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fu(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,n) fu(i,1,n)
#define re(i,n) fu(i,0,n - 1)
#define fd(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define vi vector< int >
#define vl vector< ll >
#define ss second
#define ff first
#define ll l... | C++ | d3a0402de1338a1a542a86ac5b484acc | 50a3de3a4889a7336717cd59c4803e06 | 1,600 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <string>
#include <time.h>
#include <queue>
#define last(x, y) (x)[(x).size() - (y)]
#define endl '\n'
#define flush fflush(stdout), cout.flush()
#define fast ios::sync_wit... | C++ | d3a0402de1338a1a542a86ac5b484acc | 1d33a09cf60ffc54ce3358ecf435cfca | 1,600 | PASSED |
#include <iostream>
#include <vector>
#include <memory.h>
using namespace std;
vector<int> d;
int arr[111111],N,visited[111111];
int main()
{
cin >> N;
for(int i=0; i<N; i++)
cin >> arr[i];
for(int i=1; i<=N; i++)
{
if(N%i==0&&N/i>=3)
d.push_back(i);
}
for(int i=0; i<d.size(); i++)
{
memset(visited,0,... | C++ | d3a0402de1338a1a542a86ac5b484acc | f3ce022de6e988897c2ca0d0d38dd3c4 | 1,600 | PASSED |
#include <iostream>
#include <vector>
#define REP(i,a,n) for(i=a ; i<n ; i++)
using namespace std;
int main(){
int n,i,j,k;
cin>>n;
vector<int> v(n);
bool res = true;
REP(i,0,n){
cin>>v[i];
if(v[i]==0) res = false;
}
if(res){
cout<<"YES"<<endl;
return 0;
... | C++ | d3a0402de1338a1a542a86ac5b484acc | 289113b59821f0273d869e1d5c8383f0 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,x) for(int i=a;i<x;i++)
int knight[100000];
//Compute if possible
int is_possible(int t, int n){
vector<int> r(t,1);
rep(i,0,n) r[i%t] &= knight[i];
rep(i,0,r.size()) if(r[i]) return 1;
return 0;
}
int main(){
ios_base::sync_with_stdi... | C++ | d3a0402de1338a1a542a86ac5b484acc | 5a64947a6bb31eedd10af8183bfd0dd3 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define mod 1'000'000'007
typedef long long ll;
template<typename T>
void deb(initializer_list<T> l)
{
for (auto &e : l)
cout << e << ' ';
cout << endl;
}
vector<string> element{"","H","He","Li","Be","B","C","N","O","F","Ne","Na","Mg","Al","Si","P","S","Cl","Ar","K",... | C++ | f84c7b3945a5112e4ab6bdf9a6b5e63b | d394033892cbf2c4ea2e1ae4cf6943f4 | 2,200 | PASSED |
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <cstdio>
#include <cstring>
using namespace std;
const char PT[][5] = {"H", "He", "Li", "Be", "B", "C", "N", "O", "F", "Ne", "Na", "Mg", "Al", "Si", "P",
"S", "Cl", "Ar", "K", "Ca", "Sc", "Ti", "V", "C... | C++ | f84c7b3945a5112e4ab6bdf9a6b5e63b | 861c54b8a54093baa5230a618b416373 | 2,200 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <string>
#include <random>
#include <climits>
#include <iomanip>
#include <queue>
using namespace std;
#define forn(i,n) for (int i = 0;i < int(n);i++)
#define ford(i,n) for (int i = n-1;i >=0;i--)
#define fore(i,l,r) fo... | C++ | f84c7b3945a5112e4ab6bdf9a6b5e63b | 84b2436c89ea109c1280cd480f50050e | 2,200 | PASSED |
/* In the name of Allah */
#include<bits/stdc++.h>
using namespace std;
const int N = 17 + 1;
unordered_map<string, int> mp;
int n, m, s1, s2, a[N], sum[1 << N], dp[1 << N];
string s[105] = {
"", "H", "He", "Li", "Be", "B", "C", "N", "O", "F", "Ne",
"Na", "Mg", "Al", "Si", "P", "S", "Cl", "Ar", "K", "Ca",
"Sc", "Ti... | C++ | f84c7b3945a5112e4ab6bdf9a6b5e63b | 7e929a30e329f43c969c4a8e251aa76b | 2,200 | PASSED |
// nauynix
// 27/08/2020
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef long long int ll;
const int I... | C++ | f84c7b3945a5112e4ab6bdf9a6b5e63b | f6a3b438deb422c58fb37149d5363c88 | 2,200 | PASSED |
#include <ext/pb_ds/assoc_container.hpp>
#include <bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
template <class c, class cmp = less<c> > using ordered_set = tree<c, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define l... | C++ | f84c7b3945a5112e4ab6bdf9a6b5e63b | 390562b461e476fe4c23e11bd62b8618 | 2,200 | PASSED |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <cmath>
#include <set>
#include <map>
#include <cstdio>
#include <stdlib.h>
#include <stack>
#include <numeric>
#include <bitset>
typedef long long ll;
#define MAX 105
using namespace std;
int n,m,k... | C++ | f84c7b3945a5112e4ab6bdf9a6b5e63b | 0f72e5ee8252389ea6ae08c230ac35a2 | 2,200 | PASSED |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<map>
using namespace std;
string element[110]={"","H","He","Li","Be","B","C","N","O","F","Ne","Na","Mg","Al","Si","P","S","Cl","Ar","K","Ca","Sc","Ti","V","Cr","Mn","Fe","Co","Ni","Cu","Zn","Ga","Ge","As","Se","Br","Kr","Rb","Sr","Y","Z... | C++ | f84c7b3945a5112e4ab6bdf9a6b5e63b | f56ea16b9a3fb5ef083bb0fce25cf57d | 2,200 | PASSED |
/*
author: Edward Johnson(Manchester_UNITED)
problem: 71E Nuclear Fusion
time: 2020.11.01
last verdict: N/A
*/
#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define inf 1000000000
#define inf64 1000000000000000000
#define X first
#define Y second
#define ll long long
using n... | C++ | f84c7b3945a5112e4ab6bdf9a6b5e63b | b0336b90d8dfc019718b6c35310182dc | 2,200 | PASSED |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <sstream>
#include <cstring>
#include <string>
#include <set>
#include <complex>
#include <map>
#include <unordered_map>
#include <climits>
#include <bitset>
#include <queue>
using namespace std;
#define all(v) v... | C++ | f84c7b3945a5112e4ab6bdf9a6b5e63b | a8dc0a79f84c52ca76e7350343653ceb | 2,200 | PASSED |
# Legends Always Come Up with Solution
# Author: Manvir Singh
import os
from io import BytesIO, IOBase
import sys
from collections import Counter
from math import sqrt, pi, ceil, log, inf, gcd, floor
def main():
for _ in range(int(input())):
n, q = map(int, input().split())
a = input().strip()
... | Python | cbd91ac0fc9e4ca01996791e4c94bd6e | 7ba1d2c9acbb3e1bbad4c98bdcb8cc79 | null | PASSED |
from collections import Counter
from collections import OrderedDict
from collections import defaultdict
import bisect
import math
from sys import setrecursionlimit
#setrecursionlimit(10**6)
def gcd(a, b):
if a == 0 :
return b
return gcd(b%a, a)
def fre_count(mylist):
return Counter(mylist)
t=in... | Python | cbd91ac0fc9e4ca01996791e4c94bd6e | 051b682342b59773837e3ae10c6931e4 | null | PASSED |
import sys, math
import io, os
#data = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
from bisect import bisect_left as bl, bisect_right as br, insort
from heapq import heapify, heappush, heappop
from collections import defaultdict as dd, deque, Counter
from itertools import permutations,combinations
def data(): r... | Python | cbd91ac0fc9e4ca01996791e4c94bd6e | 3385e5cb0d813da3ea579a3058b39e81 | null | PASSED |
def solve():
n, q = map(int,input().split())
zeroes = []
ones = []
for i, c in enumerate(input()):
if c == '0':
zeroes.append(i)
else:
ones.append(i)
for x in [zeroes, ones]:
if not x:
x.append(-1)
for _ in range(q):
l... | Python | cbd91ac0fc9e4ca01996791e4c94bd6e | 848275f121819da8d9c3c0a104426ad7 | null | PASSED |
for _ in range(int(input())):
n, q = map(int, input().split())
s = input()
for __ in range(q):
l, r = map(int, input().split())
l -= 1
r -= 1
if s.find(s[l], 0, l) != -1 or s.find(s[r], r+1, n) != -1:
print('YES')
else:
print('NO') | Python | cbd91ac0fc9e4ca01996791e4c94bd6e | 7e4bafc9ec76e859c4f5ce966804f5cc | null | PASSED |
for _ in range(int(input())):
n , q = map(int , input().split())
s = input()
for __ in range(q):
l,r = map(int , input().split())
l-=1 ; r-=1
bad = True
i = 0
while(i<l and bad):
if(s[i] == s[l]):
bad = False
i+=1
i... | Python | cbd91ac0fc9e4ca01996791e4c94bd6e | dcbfcf6f97ad903d9053b92668963c7f | null | PASSED |
for _ in range(int(input())):
n,q = map(int,input().split())
s = str(input())
sl = []
for _ in range(q):
l,r = map(int,input().split())
if s[l-1] in s[:l-1] or s[r-1] in s[r:]:
print("YES")
else:
print("NO")
| Python | cbd91ac0fc9e4ca01996791e4c94bd6e | 7814c5489ebe4f419a4740d05c63446f | null | PASSED |
for _ in range(int(input())):
n,q = map(int,input().split())
s = str(input())
for i in range(q):
a,b = map(int,input().split())
l1 = []
c = a-1
tt = 0
tot = 0
count = 0
for j in range(len(s)):
if s[j] == s[c]:
k = j
... | Python | cbd91ac0fc9e4ca01996791e4c94bd6e | 3b0983840539e4d7e5009ccba57c87f1 | null | PASSED |
def main():
t = int(input())
for __ in range(t):
n,q = map(int,input().split())
s = input()
if s[0] == "0":
count_0 = [1]
count_1 = [0]
else:
count_0 = [0]
count_1 = [1]
for i in range(1,n):
if s[i] == "0":
... | Python | cbd91ac0fc9e4ca01996791e4c94bd6e | 31f1a9af666d073a495a262db5397e24 | null | PASSED |
t = int(input(""))
for i in range(t):
n , q = list(map(int,input("").split()))
s = input("")
for ii in range(q):
i , j = list(map(int,input("").split()))
ans = "NO"
for ss in range(n):
if s[ss] == s[i-1]:
if ss < i-1:
ans = "YES"
... | Python | cbd91ac0fc9e4ca01996791e4c94bd6e | 7904e2e0d46c4329e4c3ae260a524205 | null | PASSED |
t=int(input())
for _ in range(t):
l=list(map(int,input().split()))
if 2*max(l)<=sum(l)+1:
print('Yes')
else:
print('No') | Python | 34aa41871ee50f06e8acbd5eee94b493 | d53ffbdbe544d9997b359900cde00fa8 | 900 | PASSED |
def newYearGarland(givenInput):
input = givenInput.split("\n")
input = input[1:]
result = ""
for i in range(len(input)):
singleLine = input[i]
singleLine = singleLine.split()
r = singleLine[0]
g = singleLine[1]
b = singleLine[2]
r = eval(r)
... | Python | 34aa41871ee50f06e8acbd5eee94b493 | b79b709d25dfa4bc0b9476097590f0af | 900 | PASSED |
for i in range(int(input())):
a=list(map(int,input().strip().split()))[:3]
sum=0
for k in a:
sum+=k
sum=sum-max(a)
if sum>=max(a) or max(a)-sum==1:
print("Yes")
else:
print("No")
| Python | 34aa41871ee50f06e8acbd5eee94b493 | ac358ba2b8c07a8770ea1511d2cf3508 | 900 | PASSED |
for i in range(int(input())):
t=sorted(list(map(int,input().split())))
print( "No" if t[0]+t[1]<t[2] and not(t[2]-t[0]-t[1]==1) else "Yes")
| Python | 34aa41871ee50f06e8acbd5eee94b493 | 6916300cf73c5295479c72ed46d40049 | 900 | PASSED |
for i in range(int(input())):
X = sorted(list(map(int, input().split())))
print("YES" if X[-1] <= X[1] + X[0] + 1 else "NO")
| Python | 34aa41871ee50f06e8acbd5eee94b493 | 2672b5e206685d596eebd054c643c0e7 | 900 | PASSED |
t=int(input()) #testcases
if(t>=1 and t<=100):
for _ in range(0,t):
r,g,b=map(int,input().split())
if(r+b<g-1 or b+g<r-1 or r+g<b-1):
print("No")
else:
print("Yes") | Python | 34aa41871ee50f06e8acbd5eee94b493 | c894d7539e196af57484d72303dc2eee | 900 | PASSED |
t =int(input())
for _ in range(t):
lst = list(map(int,input().split()))
lst.sort()
if lst[2] <= lst[0] + lst[1]+1:
print("Yes")
else:
print("No") | Python | 34aa41871ee50f06e8acbd5eee94b493 | 3d9ed908c02870d8701dca76233f584f | 900 | PASSED |
for _ in range(int(input())):
l=list(map(int,input().split()))
l.sort()
print('Yes' if l[2]-(l[1]+l[0])<=1 else 'No') | Python | 34aa41871ee50f06e8acbd5eee94b493 | 230c8d1b45cbb84d7123a3fd4e48e116 | 900 | PASSED |
t=int(input())
for _ in range(t):
r,g,b=sorted(map(int,input().split()))
print("NO" if b>g+r+1 else "YES") | Python | 34aa41871ee50f06e8acbd5eee94b493 | 6b9a7804d33e8763d8630e3ab61ed96c | 900 | PASSED |
n = int(input())
for i in range(n):
l = [int(k) for k in input().split()]
l.sort()
if l[2] <= l[1]+l[0]+1 :
print("YES")
else :
print("NO") | Python | 34aa41871ee50f06e8acbd5eee94b493 | 364233423a0a4974f6dda890cd8ef46b | 900 | PASSED |
//============================================================================
// Name : Codeforces.cpp
// Author : Jos Ral Prez Rodrguez
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//================================================================... | C++ | ab904e148bc7ba4cca38078c7ea41ad6 | a9d8e27ab56abcadd04ef0efe6e89b72 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(n) for(ll i=0;i<n;i++)
#define rep1(n) for(ll j=0;j<n;j++)
#define F first
#define S second
#define pb push_back
# define M_PI 3.14159265358979323846
#define mod 998244353
vector<pair<ll,ll>>v1,v2;ll n;
map<pair<ll,ll>,ll>mp1,mp2;
ll dist(ll ... | C++ | ab904e148bc7ba4cca38078c7ea41ad6 | b341d0b7784c3d3ba0c5301993c8ed87 | 1,700 | PASSED |
#include <iostream>
#include<map>
#include<cstring>
#include<cmath>
#include<set>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<memory.h>
using namespace std;
int n,m;
struct candy{
int st;
int ed;
}a[202];
bool cmp(candy a1,candy a2){
if(a1.st<a2.st) return tr... | C++ | ab904e148bc7ba4cca38078c7ea41ad6 | b22c800d6303849f0130e0fdbd1298ad | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
vector <long long> g[100005];
long long ans[100005];
long long a[10005], b[10005];
int main()
{
ios_base::sync_with_stdio(0);
//freopen("revegetate.in", "r", stdin);
//freopen("revegetate.out", "w", stdout);
int n, m;
cin >> n >> m;
for (int i = 1... | C++ | ab904e148bc7ba4cca38078c7ea41ad6 | e4d6e01f92bf0fa7362131475c1bc2c0 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int cur_cmp;
vector<vector<int> > candies(m);
bool cmp(int x, int y) {
if (x < cur_cmp) {
x += n;
}
if (y < cur_cmp) {
y += n;
}
return x - cur_cmp > y - cur_cmp;
}
int simul(int start) {
int sent = 0;
int ans = 0;
vector<int> ptr(n, 0);... | C++ | ab904e148bc7ba4cca38078c7ea41ad6 | c7375143d9a22adeb9f86bdf4e7832a2 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, m;
int cur_cmp;
vector<vector<int> > candies;
bool cmp(int x, int y) {
if (x < cur_cmp) {
x += n;
}
if (y < cur_cmp) {
y += n;
}
return x - cur_cmp > y - cur_cmp;
}
int simul(int start) {
int ans = 0;
for (int i = 0; i <... | C++ | ab904e148bc7ba4cca38078c7ea41ad6 | 76cbdc01c7e2c16614af0d15c5ff71f5 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define REPP(i,a,b,c) for(int i=a; i<=b; i+=c)
#define REP(i,a,b) REPP(i,a,b,1)
#define REVV(i,a,b,c) for(int i=a; i>=b; i-=c)
#define REV(i,a,b) REVV(i,a,b,1)
#define FOR(i,a) REP(i,0,(int)a-1)
#define FORD(i,a) REV(i,(int)a-1,0)
#define PB push_back
#define POB pop_back
... | C++ | ab904e148bc7ba4cca38078c7ea41ad6 | 404eff7edf9f274aa61f699ab0426f80 | 1,700 | PASSED |
/* ****revpro**** */
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll,ll>
#define vi vector<ll>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define sz(x) (ll)x.size()
#d... | C++ | ab904e148bc7ba4cca38078c7ea41ad6 | 215ee939324f424e20641ff93ee006c0 | 1,700 | PASSED |
#include "bits/stdc++.h"
using namespace std;
////////////// Prewritten code follows. Look down for solution. ////////////////
#define x first
#define y second
#define len(x) ((int)(x).size())
using pii = pair<int, int>;
using ll = long long;
using llu = long long unsigned;
using ld = long double;
const ld EPS = 1e-9... | C++ | ab904e148bc7ba4cca38078c7ea41ad6 | 301c464e62bb3a53d3aa0c1c9b965092 | 1,700 | PASSED |
#include "bits/stdc++.h"
using namespace std;
////////////// Prewritten code follows. Look down for solution. ////////////////
#define x first
#define y second
#define len(x) ((int)(x).size())
using pii = pair<int, int>;
using ll = long long;
using llu = long long unsigned;
using ld = long double;
const ld EPS = 1e-9... | C++ | ab904e148bc7ba4cca38078c7ea41ad6 | 456954edcee66dd24a40e65ae29fc0e6 | 1,700 | PASSED |
import java.util.Arrays;
import java.util.Scanner;
public class A {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int a[]=new int[n];
for (int i = 0; i <n ; i++) {
a[i]=sc.nextInt();
}if (n==1){
System.out.println(1); return;}
... | Java | ce68f1171d9972a1b40b0450a05aa9cd | bbafc6049d5bb6ec605436c8cca159f4 | 900 | PASSED |
import java.util.*;
public class Elephant
{
public static void main(String[] args)
{
Scanner console = new Scanner(System.in);
int n = console.nextInt();
int min = console.nextInt();
int numRep = 1;
int numCity = 1;
int next;
for(int i = 2; i <= n; i++)
{
next = console.nextInt... | Java | ce68f1171d9972a1b40b0450a05aa9cd | 7264a47219dd22ce0682e9e69688d3b0 | 900 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class privet {
public static void main(String[] args) throws IOException {
BufferedReader bReader = new BufferedReader(new InputStreamReader(System.in));
String kolvo = bReader.readL... | Java | ce68f1171d9972a1b40b0450a05aa9cd | adc80881fc945d2bf17411a600de94e1 | 900 | PASSED |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.StringTokenizer;
/*
ID: he.andr1
LANG: JAVA
TASK: PrA
*/
public class PrA {
public static long time;
public static void main(String[] args) throws Exception {
time = System.currentTimeMillis();
Bu... | Java | ce68f1171d9972a1b40b0450a05aa9cd | 6571c583222d47c30ae177e4c8b0bc6d | 900 | PASSED |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.StringTokenizer;
/*
ID: he.andr1
LANG: JAVA
TASK: PrA
*/
public class PrA {
public static long time;
public static void main(String[] args) throws Exception {
time = System.currentTimeMillis();
Bu... | Java | ce68f1171d9972a1b40b0450a05aa9cd | 7388eadfe20005984abc693f73efb8b0 | 900 | PASSED |
import java.awt.Point;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;
import java.util.StringTokenizer;
public class A {
public static vo... | Java | ce68f1171d9972a1b40b0450a05aa9cd | ff8b65d31241e4f69878c14c91449878 | 900 | PASSED |
import static java.util.Arrays.deepToString;
import java.io.*;
import java.util.*;
public class A {
static void solve() throws Exception {
int n = nextInt();
int[] a = new int[n];
for(int i = 0; i < n; i++){
a[i] = nextInt();
}
int min = Integer.MAX_VALUE;
... | Java | ce68f1171d9972a1b40b0450a05aa9cd | d070e5f43db06ac37f0b9ae0175ebbfa | 900 | PASSED |
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.util.Locale;
public class A205
{
public static void main(String[... | Java | ce68f1171d9972a1b40b0450a05aa9cd | 6b6b9e8f09b92051b6298cf2b66f1141 | 900 | PASSED |
import java.io.*;
import java.util.*;
public class A {
public static void main(String[] args) throws Exception {
new A().solve();
}
void solve() throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(in.readLine());
... | Java | ce68f1171d9972a1b40b0450a05aa9cd | 92557fa3166ef852e94b5645871991e8 | 900 | PASSED |
import java.util.*;
import java.io.*;
public class AContest129{
public static void main(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int times=Integer.parseInt(br.readLine());
String[] in=br.readLine().split(" ");
long[]... | Java | ce68f1171d9972a1b40b0450a05aa9cd | 39e44b2c7a9f5cba05d815937197217f | 900 | PASSED |
#include <iostream>
#define int long long
int a[180];
int b[181][179];
using namespace std;
main(){
for(int x=0; x<180; x++){
a[x]=0;
}
int T;
int nod;
cin>>T;
int ang;
for(int x=3; x<181; x++){
for(int y=0; y<x-2; y++){
if((180*(y+1))%x!=0){
b[x][y]=0;
}
else{
b[x][y]=180*(y+1)/x... | C++ | d11b56fe172110d5dfafddf880e48f18 | 0ee79e0dfadf8c42d7685727b18c2368 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int T;
cin >> T;
while(T--) {
int ang;
cin >> ang;
int gcd = __gcd(ang, 180);
int tmp = ang/gcd, ans = 180/gcd;
if(ans == tmp + 1) {
cout << ans*2 << endl;
}
else {
cout << ans << endl;
}
}
return ... | C++ | d11b56fe172110d5dfafddf880e48f18 | 210d28d784878ed25f2c1f1da9ccf94d | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int T;
cin >> T;
while(T--) {
int ang;
cin >> ang;
if(ang > 180) {
cout << -1;
continue;
}
int gcd = __gcd(ang, 180);
int ans = ang/gcd, tmp = 180/gcd;
if(tmp - ans == 1) {
cout << tmp*2 << endl;
}
... | C++ | d11b56fe172110d5dfafddf880e48f18 | 5ba0a91b6daa1f1e8b55ba92f269688f | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int t,ang;
cin>>t;long long int divisions;
while(t--)
{
cin>>ang;
long long int k=1;
while((180*k)%ang!=0 and (180*k)/ang<=998244353)k++;
divisions=(180*k)/ang;
if(divisions>998244353)divisions=-1;
else if(180-180/divisions==ang)d... | C++ | d11b56fe172110d5dfafddf880e48f18 | 9c7383d8b040fe6d1df62c07557d2d16 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int t,ang;
cin>>t;long long int ans,ele=180;
while(t--)
{
cin>>ang;
long long int k=1;
while((ele*k)%ang!=0 and (ele*k)/ang<=998244353)k++;
ans=(ele*k)/ang;
if((ele*k)/ang>998244353)ans=-1;
else if(180-180/ans==ang)ans*=2;
co... | C++ | d11b56fe172110d5dfafddf880e48f18 | 56bec2f880302dc40aecd12ec6681ff2 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long int gcd(long long int a,long long int b)
{
if(a%b==0)return b;else return gcd(b,a%b);
}
int main()
{
long long int t,ang;
cin>>t;long long int ans,ele=180;
while(t--)
{
cin>>ang;
long long int k=1;
// ele/=gcd(180,ang);ang/=gcd(180,ang);
while((el... | C++ | d11b56fe172110d5dfafddf880e48f18 | faf64a3f1bdced5e41e27602aab58655 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int a[182];
int main()
{
memset(a,0,sizeof(a));
int cnt=0;
for(int n=3;n<=2000;n++)
{
double k=(n-2)*180*1.0/n;
for(int i=1;i<=n-2;i++)
{
double kkk=(double)i*((double)180-k)/2;
if(kkk-1.0*(int)kkk!=0) continue... | C++ | d11b56fe172110d5dfafddf880e48f18 | ecc3e16e7ac34d5175db135972ea70ce | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(){
int ang;
cin>>ang;
int g = __gcd(ang, 180);
int k = ang / g;
int n = 180 / g;
if(k + 1 == n)
k *= 2, n *= 2;
cout << n << endl;
}
int main(){
int q;
cin>>q;
while(q--){
solve();
cout<<endl;
}
}
| C++ | d11b56fe172110d5dfafddf880e48f18 | c233e21144cf15fc1e66931e87e5635c | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long n,l,a,r,cnt,num1,num2,s[2000];
string q;
int main()
{
cin>>n;
for(int i=3;i<=180;i++)
{
if(360%i==0 && ((i-2)*180)%i==0)
{
for(int j=1;j<=180;j++)
{
if(j<=((i-2)*180/i) && j*i%180==0 && !s[j]) s[j]=i;
}
}
}
//for(int i=1;i<=180;i++) cout<... | C++ | d11b56fe172110d5dfafddf880e48f18 | c7909b30928a17d1b57c073c2c93a354 | 1,600 | PASSED |
#include<iostream>
#include<cstring>
#include<string>
using namespace std;
typedef long long ll;
const int mod = 998244353;
int a[188];
int main()
{
memset(a,-1,sizeof(a));
for(int i=3;i<=360;++i)
{
for(int j=1;j<=i-2;++j)
{
if(180*j%i==0 && a[180*j/i]==-1) a[180*j/i]=i;
... | C++ | d11b56fe172110d5dfafddf880e48f18 | db615b63ba9fa45c658a312a10d1e16b | 1,600 | PASSED |
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <map>
#include <stack>
#include <set>
#include <memory.h>
#include <vector>
using namespace std;
#define all(it,a) for(typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define eprllf(...) fprllf(stderr, __VA_ARGS__)
typedef __int64 ll;
const int... | C++ | c01c7a6f289e6c4a7a1e2fb2492a069e | d8cb2d9ea34939239586cbbf6591ce28 | 2,300 | PASSED |
#include <cstdio>
#include <vector>
#define N 200100
using namespace std;
typedef __int64 LL;
const LL MOD = 1000000007;
int pa[N];
vector <int> con[N];
LL f[N], g[N];
LL tp[N];
int cnt[N];
inline LL powmod(LL a, LL e, LL n) {
LL ret = 1;
a %= n;
while (e > 0) {
if (e & 1) ret = (ret * a) % n;
a = (a * a) ... | C++ | c01c7a6f289e6c4a7a1e2fb2492a069e | 02a9ee6e7ca9382158798d8126cfd017 | 2,300 | PASSED |
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<map>
#include<string>
#include<vector>
#include<set>
using namespace std;
long long total,dp[200005][2],Rank[200005],dp1[200005];
int edge[400005],tot=0;
const int mod = 1e9 + 7;
vector<int>e[200005];
long long getinver(int v)
{
long long base = v,res... | C++ | c01c7a6f289e6c4a7a1e2fb2492a069e | e51da8acd215916ea509709a00e26103 | 2,300 | PASSED |
#include <iostream>
#include <cstdio>
#include <vector>
#define puba push_back
using namespace std;
typedef long long LL;
const LL MOD = (LL) 1e9 + 7;
typedef struct {
LL p, sub_tr, sub_up, num_z, n_z;
vector < LL > ch;
} TVertex;
vector < vector < LL > > g;
vector < TVertex > tree;
void make_tree... | C++ | c01c7a6f289e6c4a7a1e2fb2492a069e | 09a58937622b3b3b6284f8e8b4847e7d | 2,300 | PASSED |
#include <bits/stdc++.h>
#define I(c) 1LL*(int(c)-'a'+1)
#define F first
#define S second
#define ll long long
using namespace std;
typedef pair<int,int> pii;
const ll maxn=2e5+10,mod=1e9+7;
ll dp[maxn],dpu[maxn];
inline ll P(int x,int y)
{
if(y==0)
return 1;
ll G=P(x,y/2);
G=(G*G)%mod;
if(y&1)... | C++ | c01c7a6f289e6c4a7a1e2fb2492a069e | 955875230563e7f78b6a8edddbe3516c | 2,300 | PASSED |
#include <bits/stdc++.h>
#define rep(i,n) for(i=1;i<=n;i++)
#define Rep(i,n) for(i=0;i<n;i++)
#define For(i,a,b) for(i=a;i<=b;i++)
#define pb(x) push_back(x)
#define sz(x) x.size()
#define mem(ara,val) memset(ara,val,sizeof(ara))
#define eps 1e-9
#define Afridi 0
#define si(x) scanf("%d",&x)
#define sii(x,y) scanf(... | C++ | c01c7a6f289e6c4a7a1e2fb2492a069e | 90b0e0807053ffb0814a0298e5bacaf0 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
// Typedefs
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
// Macros
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define FORR(i, a) FOR(i, 0, a)
#define sz(e) (int)e.size()
#define all(e) e.begin(), e.end()
#define pb(e) push_back(e)
cons... | C++ | c01c7a6f289e6c4a7a1e2fb2492a069e | cbfb644df45fe0d1ccce83577197416d | 2,300 | PASSED |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#define M 200005
const int Mod=1e9+7;
int dp[M],dp2[M];
int n,par[M];
//long long int l[M],r[M];
bool mark[M];
vector<int> g[M],dg[M];
void inp()
{
cin>>n;
for(int i=2;i<=n;i++)
{
dp[i]=dp2[i]=1;
int k;
cin>... | C++ | c01c7a6f289e6c4a7a1e2fb2492a069e | 40eae3c4939b6a5e22b24b4a59e5df00 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N (201*1000)
#define MOD ((ll)1e9+7)
ll n,par[N],dp_up[N],dp_down[N];
vector <ll> child[N];
ll tavan(ll a,ll n,ll mod){ll p=1;while(n>0){if(n%2){p=p*a;p%=mod;}n>>=1;a*=a;a%=mod;}return p%mod;}
void dfs(ll x)
{
dp_down[x]=1;
for(int i=0;i<chi... | C++ | c01c7a6f289e6c4a7a1e2fb2492a069e | 0a8538a7ec7b14c73d72813ff12e22c3 | 2,300 | PASSED |
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
#include <cass... | C++ | c01c7a6f289e6c4a7a1e2fb2492a069e | c31b18304acd13bc11bf6f23be690c86 | 2,300 | PASSED |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual soluti... | Java | 86d17fa4bac5edd0cc4b6bff1c9899b7 | 22420e63cf372c80397eb91f0adb18ce | 2,300 | PASSED |
//package com.company;
import java.io.*;
import java.util.*;
public class Main {
public static class Task {
public String get(int[] input, int offset) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < input.length; i++) {
char truePos = input[(i + input... | Java | 86d17fa4bac5edd0cc4b6bff1c9899b7 | 1e0c248b62e63b9ae405282b4472fdeb | 2,300 | PASSED |
import java.io.*;
import java.util.StringTokenizer;
public class F {
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
PrintWriter writer = new PrintWriter(System.out);
StringTokenizer st = new StringTok... | Java | 86d17fa4bac5edd0cc4b6bff1c9899b7 | ff6d888bc7ef247f9acd0121a55c47ca | 2,300 | PASSED |
//package round592;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class F {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni(), K = n... | Java | 86d17fa4bac5edd0cc4b6bff1c9899b7 | da2120b128705fb0b108abe1351650e2 | 2,300 | PASSED |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Collection;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.Queue;
import java.util.LinkedList;
import java.io.InputStream;
/*... | Java | 86d17fa4bac5edd0cc4b6bff1c9899b7 | 3bc2dbbeda33c8420c3b42af54fcb074 | 2,300 | PASSED |
import java.io.*;
import java.util.*;
public class F implements Runnable {
public static void main (String[] args) {new Thread(null, new F(), "_cf", 1 << 28).start();}
public void run() {
FastScanner fs = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
System.err.println("");
int n = fs.n... | Java | 86d17fa4bac5edd0cc4b6bff1c9899b7 | 8bc37ba34f992d515fc90dcf177c081c | 2,300 | PASSED |
/**
* @author Juan Sebastian Beltran Rojas
* @mail jsbeltran.valhalla@gmail.com
* @veredict
* @url https://codeforces.com/problemset/problem/1244/F
* @category implementation
* @date 18/10/2019
**/
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arr... | Java | 86d17fa4bac5edd0cc4b6bff1c9899b7 | 7bfa06b5d9941ac1bb4bb99ea062b787 | 2,300 | PASSED |
import java.util.*;
import java.io.*;
public class Chips {
static BufferedReader br;
static StringTokenizer tokenizer;
public static void main(String[] args) throws Exception {
br = new BufferedReader(new InputStreamReader(System.in));
int n = nextInt();
int k = nextInt();
boolean[] white = new boolean[n];... | Java | 86d17fa4bac5edd0cc4b6bff1c9899b7 | fc10f9843b0ecae5dd045d083395a7db | 2,300 | PASSED |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;
public class Test {
public static void main(String[] args) throws Exception
{
// TODO Auto-generated method ... | Java | 86d17fa4bac5edd0cc4b6bff1c9899b7 | 0c5b6a6f3699a4b1ebc1ef70377ee2df | 2,300 | PASSED |
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.List;
public class Main {
InputStream is;
PrintWriter out;
String INPUT = "";
pri... | Java | 86d17fa4bac5edd0cc4b6bff1c9899b7 | 85655cbb303e9b1a9820cc0dfdc1be58 | 2,300 | PASSED |
#include <iostream>
#include <cstdio>
using namespace std;
const long long MOD = 998244353;
int n;
long long y, ans;
string x;
int main()
{
cin>>n;
for (int i=1;i<=n;i++){
cin>>x;
y=0;
for (int i=0;i<(int)x.size();i++){
y*=100;
y+= (x[i]-'0')*10+(x[i]-'0');
... | C++ | 6e093dbcbcaa7c87c9b62546745984db | bcee5a66a63795e7bcc9c841aede3e36 | 1,500 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
#include <algorithm>
#define constant 1000000007
#define lli long long int
#define pb push_back
using namespace std;
const lli mod = 998244353;
void solve(){
lli n;
cin>>n;
string a[n];
for(lli i =0;i<n;i++) cin>>a[i];
lli length = a[0].length();
lli s... | C++ | 6e093dbcbcaa7c87c9b62546745984db | 7b34147c85594b48f4d69067ca8f8b1a | 1,500 | PASSED |
// "It does not matter how slowly you go as long as you do not stop." - Confucius
#include <bits/stdc++.h>
using namespace std;
/*
author : Roshan_Mehta
motto : Time Management,Consistency,Patience!!
*/
#define int long long
#ifdef Local_Debug
#define debug(x) cout<<#x <<" "<<x<<" "
#define debug1(a) cout... | C++ | 6e093dbcbcaa7c87c9b62546745984db | 9408b0511067b2def47f1964d6561020 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mx 500010
#define pb push_back
ll mod=998244353;
ll arr[mx];
ll brr[mx];
ll n,ans;
void cal(string s){
unsigned ll b=0;
for(ll i=0;i<s.size();i++){
ll a=s[i]-'0';
b=b*10+a;
b=b*10;
}
unsigned ll c=b/10;
c%=mod;
... | C++ | 6e093dbcbcaa7c87c9b62546745984db | 4f63e98b80a7b9be0da7b348b68be3c4 | 1,500 | PASSED |
#include<bits/stdc++.h>
#define LL long long
#define mod 998244353
using namespace std;
LL ed[100000 + 5][10];
LL ten[21];
int main(){
int n, t;
cin >> n;
ten[0] = 1;
for(int i = 1; i <= 20; ++i){
ten[i] = (ten[i - 1] * 10) % mod;
}
LL ans = 0;
memset(ed, 0, sizeof ed);
for(int i = 1; i <= n; ++i){
c... | C++ | 6e093dbcbcaa7c87c9b62546745984db | f4bd1b5f0b0c06df53ae422110f2aa71 | 1,500 | PASSED |
#include<iostream>
using namespace std;
string s[100005];
long long int cl(string s)
{
long long int num=0;long long int c=1;
for(int i=s.size()-1;i>=0;i--)
{
num+=(c*(s[i]-'0'))%998244353;
c=(c*10)%998244353;
num+=(c*(s[i]-'0'))%998244353;
c=(c*10)%998244353;
}
retur... | C++ | 6e093dbcbcaa7c87c9b62546745984db | 9fbc1e02a69443533cbd9860a0b360d6 | 1,500 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.