solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
int r = 0, i, ara[100];
for (i = 0; i < n; i++) {
scanf("%d", &ara[i]);
if (ara[i] == 0) {
r++;
}
}
if (r == n)
printf("EASY\n");
else
printf("HARD\n");
return 0;
}
| 1 |
#include <bits/stdc++.h>
const int Maxn = 2e5 + 1;
int f1[ Maxn ], f2[ Maxn ], n, k, l;
std::map < std::pair < int, int >, int > mp;
int p, q;
int find( int *f, int x )
{
return f[ x ] == x ? x : f[ x ] = find( f, f[ x ] );
}
void merge( int *f, int x, int y )
{
int x1 = find( f, x ), y1 = find( f, y );
if( x1 == y... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000 * 1000 * 1000;
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
long long x, y, a, b;
cin >> x >> y >> a >> b;
long long g = gcd(x, y);
long long gg = (x * y) / g;
long long ans1 = (a - 1... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
string ans;
inline bool is_vowel(char x) {
return (x == 'a' || x == 'e' || x == 'i' || x == 'o' || x == 'u' || x == 'y');
}
void solve(int index, char last) {
if (index == n) {
return;
}
if (is_vowel(last) && is_vowel(s[index])) {
solve(inde... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1111;
int t[MAXN][MAXN];
vector<pair<int, int> > V;
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) scanf("%d", &t[i][j]);
if (k == 1) reverse(t[i] + 1, t[i] + m + 1);
}
pr... | 2 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string input;
int ans = 0, last;
while (cin >> input) {
last = input.size();
for (int i = 0; i<last; i++) {
if (input[i] != input[last - i - 1]) { break; }
if (i == last - 1) { ans++; }
}
}
cout << ans << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
while (~scanf("%I64d%I64d", &a, &b)) {
long long s = 0;
if (!a) {
s = -b * b;
printf("%I64d\n", s);
while (b--) printf("x");
printf("\n");
} else if (!b) {
s = a * a;
printf("%I64d\n", s);
... | 3 |
#include<bits/stdc++.h>
#define cmin(a,b) (a>(b)?a=(b),1:0)
#define cmax(a,b) (a<(b)?a=(b),1:0)
#define dmin(a,b) ((a)<(b)?(a):(b))
#define dmax(a,b) ((a)>(b)?(a):(b))
namespace io
{
int F()
{
int F=1,n=0;
char ch;
while((ch=getchar())!='-'&&(ch<'0'||ch>'9'));
ch=='-'?F=0:n=ch-'0';
while((ch=getchar())... | 0 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, k;
cin >> n >> k;
vector<long long> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
;
sort(a.begin(), a.end());
long long mm = a[n / 2];
for (int i = n / 2; i < n - 1; i++) {
long long r = a[i + 1] - a[i];
if (k >= r * (i -... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fll;
const long double pi = acos(-1);
const int MOD = 1e9 + 7;
const int N = 1e6;
int main() {
string s;
cin >> s;
string t;
t = s;
sort(t.begin(), t.end());
if (t != s) {
puts("NO");
re... | 1 |
#include <bits/stdc++.h>
using namespace std;
multiset<int> ss;
vector<int> ve[(300000 + 100)];
int p[(300000 + 100)] = {0}, a[(300000 + 100)] = {0};
int main() {
ss.clear();
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
p[a[i]] = i;
ve[i].clear();
}
for (in... | 3 |
#include<iostream>
#include<string.h>
using namespace std;
int main(){
int N,a[100050];
cin>>N;
for(int i=0;i<N;i++){
cin>>a[i];
}
int k=0;
for(int j=0;j<100010;j++){
k = a[k]-1;
if(k==1){
cout<<j+1<<endl;
return 0;
}
}
cout<<-1<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(long long)b;i++)
#define rep(i,n) REP(i,0,n)
int const MAX = 100000;
typedef long long ll;
bool isnp[MAX+1];
vector<int> primes;
int main() {
for(int i=2; (ll)i*i<=MAX; i++) {
if(isnp[i]) continue;
for(int j=i*i; j<=MAX; j+... | 0 |
#include <bits/stdc++.h>
int A[3600], p, a, len, n = 0;
char B[3600];
int f[3600][3600][2][2];
inline void reverse(int *a, int l) {
for (register int i = 1, j = l, tmp; i < j; i++, j--) {
tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
}
inline void reverse(char *a, int l) {
register char tmp;
for (register ... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long k, b, n, t;
cin >> k >> b >> n >> t;
long long res = b, k0 = 1;
long long ans = 0;
while (1) {
if (ans != 0 && res + k0 > t) {
--ans;
break;
} else {
if (ans != 0) res = res * k + b;
k0 *= k;
}
++ans;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
const long long MAX = 1e9 + 1;
const double pi = 3.1415926535897932384626433832;
const long long M = 2e18 + 7;
long long bis(long long a[], long long l, long long r, long long x) {
while (l <= r) {
long long m = l + (r - l) / 2;
if (a[m] == x) return m;
if (a[... | 4 |
#include <bits/stdc++.h>
using namespace std;
bool lcs(string a, string b) {
long long m = a.length();
long long n = b.length();
long long L[m + 1][n + 1];
memset(L, 0, sizeof(L));
long long i, j;
for (i = 0; i <= m; i++) {
for (j = 0; j <= n; j++) {
if (i == 0 || j == 0)
L[i][j] = 0;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n, k, c, l;
int a[100001];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>
que;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
l = c = 0;
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] != ... | 3 |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/stack:200000000")
long long int ans, t, n, m, i, j, k, a, b, c, d, e, f, g;
string s, s2, s3, s4;
long long int ar[(int)(1e6 + 10)];
vector<long long int> v;
map<long long int, long long int> mp;
void brainfuck();
int main() {
ios_base::sync_with... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, sum = 0;
cin >> n;
int a[n][n];
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
cin >> a[i][j];
if (i == (n + 1) / 2 - 1 || j == (n + 1) / 2 - 1) {
sum += a[i][j];
}
}
}
if (n > 1) {
sum += a[0]... | 1 |
#include <bits/stdc++.h>
using namespace std;
long n, d, cost[1 << 20], q, dp[30100][1050];
long actual;
long ans;
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> d;
for (int i = 1; i <= n; i++) {
cin >> q;
cost[q]++;
}
for (int i = 0; i <= 30000; i++)
for (int j = 0; j <= 1005; j++) dp[i][... | 1 |
#include <bits/stdc++.h>
using namespace std;
int arr[10][10];
int pos[10];
int n, k;
int main() {
int ans = 1000000000;
scanf("%d %d\n", &n, &k);
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++) {
char c;
scanf("%c", &c);
arr[i][j] = c - '0';
}
scanf("\n");
}
for (int i... | 2 |
#include <bits/stdc++.h>
char s[100100];
int d[100100];
bool was[100100];
int main() {
int n;
while (scanf("%d", &n) == 1) {
scanf("%s", s);
for (int i = 0; i < n; i++) {
scanf("%d", &d[i]);
}
for (int i = 0; i < n; i++) {
was[i] = false;
}
int pos = 0;
bool cycle = false;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
string n;
int main() {
cin >> n;
int ans = 0;
for (int i = 0; i < n.size(); i++) {
ans += 1 << (i + (n[n.size() - i - 1] - '0') / 7);
}
cout << ans << endl;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000003;
char in[500010];
inline int pow(int a, int b) {
if (b == 0) return 1;
if (b == 1) return a % mod;
long long r = pow(a, b / 2);
r = (r * r) % mod;
if (b % 2) r = (r * a) % mod;
return r;
}
int n, m;
inline char f(int x, int y) { return in... | 5 |
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const int inf = 1012345678;
int main() {
int N;
while (cin >> N, N) {
vector<int> A(N);
for (int i = 0; i < N; ++i) cin >> A[i];
vector<pair<int, int> > dp = { make_pair(0, 0) };
for (int i = 0; i < N; ++i) {
vector<pair<int, i... | 0 |
#include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
... | 0 |
#include<bits/stdc++.h>
using namespace std;
long long n, k, dp[200000], a[200000];
int main()
{
cin >> n >> k;
for (int i = 1; i <= n; i ++) cin >> a[i];
for (int i = 1; i <= k; i ++)
{
for (int j = 1; j <= n; j ++)
{
if (i - a[j] >= 0 && dp[i-a[j]] == 0) {
dp[i] = 1;
break;
}
}
}
if (dp[k] =... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> A;
int n, i, l;
cin >> n;
for (i = 0; i < n; i++) {
cin >> l;
A.push_back(l);
}
sort(A.begin(), A.end());
for (i = 1; i < n; i++) {
if (A[i] % A[0] != 0) {
cout << "-1";
return 0;
}
}
cout << A[0];
ret... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
stack<char> st;
string con;
cin >> con;
for (int i = 0; i < con.length(); i++) {
if (st.size() == 0 || st.top() != con[i]) {
st.push(con[i]);
} else {
st.pop();
}
}
if (st.size() == 0) {
cout << "Yes" << endl;
} else {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int a, b, c, d, e, f;
long long res, ans;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cin >> a >> b >> c >> d >> e >> f;
int set1 = min(a, d);
int set2 = min(b, c);
int set3 = min(set2, d);
res = 1ll * f * set3;
res += 1ll * m... | 1 |
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
//INSERT ABOVE HERE
signed main(){
int n,q;
cin>>n>>q;
vector<stack<int> > s(n);
for(int i=0;i<q;i++){
int t,a;
cin>>t>>a;
if(t==0){
int x;
cin>>x;
s[a].emplace(x);
}
if(t==1) if(!s[a].empty()) cout<<s[a].t... | 0 |
#include <bits/stdc++.h>
int n, k;
int devLast;
inline void oil_read(std::istream& r) { r >> n >> k; }
inline int oil_eval(int v) {
int result = 0;
int dev = v;
while (dev > 0) {
result += dev;
dev /= k;
}
return result;
}
inline void oil_print(std::ostream& w, int i) { w << i << std::endl; }
inline v... | 2 |
#include <iostream>
#define N 20
using namespace std;
int n,k,s,C;
void Ess(int,int,int);
int main(){
bool r;
while(1){
cin >> n >> k >> s;
if(n==0&&k==0&&s==0) break;
C=0;
Ess(0,0,0);
cout << C << endl;
}
return 0;
}
void Ess(int x,int sum,int cnt){
if(n==x){
if(cnt==k&&sum==s) C++;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int a[10], flag[200];
int main() {
int sum = 0;
for (int i = 1; i <= 5; i++) {
cin >> a[i];
sum += a[i];
flag[a[i]]++;
}
int ans = sum;
for (int i = 1; i <= 5; i++) {
if (flag[a[i]] > 1 && flag[a[i]] < 4)
ans = min(ans, sum - flag[a[i]] * a[i... | 1 |
#include<iostream>
#include<cstdio>
#include<string>
using std::cin;
using std::cout;
using std::endl;
using std::string;
//using std::stdin;
//using std::stdout;
//using std::freopen;
const int MXN=100010;
const int MXL=400060;
const int M=26;
int trie[MXL][M],sum[MXL],len[MXL],equal[MXL],tot=1;
bool end[MXL];
int n... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
double x1,y1,x2,y2,x3,y3;
double px,py;
int n;
cin >> n;
for(int i=0; i<n; i++){
cin >> x1>>y1>>x2>>y2>>x3>>y3;
px = ( (y1-y3)*(y1*y1-y2*y2 + x1*x1-x2*x2)-(y1-y2)*(y1*y1-y3*y3+x1*x1-x3*x3))/(2*(y1-y3)*(x1-x2)-2*(y1-y2)*(x1-x3));
py = ( (... | 0 |
#include<iostream>
using namespace std;
int main()
{
int N,ans;
while(cin>>N,N){
ans=0;
for(int i=1;i<N;i++){
int s=0;
for(int j=i;j<N;j++){
s+=j;
if(s<N)continue;
if(s>N)break;
ans++;
break;
}
}
cout<<ans<<endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
void robot() {
int n;
int m;
int rb;
int cb;
int rd;
int cd;
cin >> n;
cin >> m;
cin >> rb;
cin >> cb;
cin >> rd;
cin >> cd;
int answer = 0;
int st = 1;
int st2 = 1;
while (!false) {
if (cb + st2 > m || cb + st2 < 1) st2 *= -1;
if (rb... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, d, i, j;
cin >> k >> d;
if (d == 0 && k > 1)
cout << "No solution\n";
else {
cout << d;
for (i = 1; i < k; i++) cout << 0;
cout << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
const int maxn = int(1e5) + 7, mod = int(1e9) + 7;
bool not_prime[maxn];
std::vector<int> factor[maxn], prime_factor[maxn];
int f[maxn], m;
long long qpow(long long p, long long q) {
long long ret = 1;
while (q) {
if (q & 1) ret = ret * p % mod;
p = p * p % mod;
q >>= 1;
}
r... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y) {
long long res = 1;
x = x % 998244353;
while (y > 0) {
if (y & 1) res = (res * x) % 998244353;
y = y >> 1;
x = (x * x) % 998244353;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NU... | 4 |
#include <bits/stdc++.h>
using namespace std;
char x[200005];
int a[200005];
int b[200005];
int c[200005];
int n, m;
int cnt = 1;
bool judge(int x) {
for (int i = 0; i < m; i++) {
b[i + 1] = a[i];
}
b[m] += x;
for (int i = m; i >= cnt; i--) {
if (b[1] > 9) {
cnt = 0;
}
if (b[i] > 9) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n, m, k, can[256], fx, fy, sx, sy;
int d[] = {0, 1, 1, 0, -1, 0, 0, -1};
int a[70][70], ans = (1 << 30);
char Map[70][70];
bool u[70][70];
queue<int> qx, qy, Qx[2], Qy[2];
string strans, str;
bool check(int x, int y) { return x >= 0 && x < n && y >= 0 && y < m; }
void p... | 5 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
int main() {
int n, k, c, t;
int a[400];
memset(a, 0, sizeof(a));
a[0] = 1;
cin >> n >> k >> c;
for (int i = 0; i < c; i++) {
cin >> t;
a[t] = 1;
}
int ans = c;
t = 0;
for (int i = 0; i <= n; i++) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
template <typename T>
void alert(const T& t) {
cout << t << endl;
exit(0);
}
bool cmd(const pair<int, int>& a, const pair<int, int>& b) {
return a.second < b.second;
}
long long prime(long long n) {
for (long long i = 2; i <= sqrt(n); i++... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, n, i, x;
int j = 0;
int ara[50];
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> ara[i];
}
for (int p = 0; p < n; p++) {
if (ara[p] >= ara[k - 1] && ara[p] > 0) {
j++;
}
}
cout << j << endl;
}
| 1 |
#include<iostream>
using namespace std;
int main()
{
int n;
while(cin>>n){
if(n==0) break;
int mx=0,mi=500;
for(int i=0;i<n;i++){
int temp=0;
for(int j=0;j<5;j++){
int t;
cin>>t;
temp+=t;
}
mx=max(mx,temp);
mi=min(mi,temp);
}
cout<<mx<<" "<<mi<<endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int A[3];
int main() {
int n, t;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &t);
A[t % 3]++;
}
printf("%d\n", A[0] / 2 + min(A[1], A[2]));
return 0;
}
| 3 |
#include <bits/stdc++.h>
int a_, b_, c_, n;
int p[100007];
int gcd(int p, int q) {
int r;
while (q != 0) {
r = p % q;
p = q;
q = r;
}
return p;
}
void init() {
int i, j;
for (i = 0; i < 100007; i++) {
p[i] = 1;
}
for (i = 2; i < 100007; i++) {
if (p[i] == 1) {
for (j = i + i; j... | 4 |
#include <bits/stdc++.h>
using namespace std;
vector<int> ans;
int main() {
int t, n;
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
ans.clear();
for (int i = 1; i * i <= n; i++) {
ans.push_back(n / i);
ans.push_back(i);
}
ans.push_back(0);
sort(ans.begin(), ans.end());
an... | 3 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int a = 0;
char c = getchar();
bool f = 0;
while (!isdigit(c)) {
if (c == '-') f = 1;
c = getchar();
}
while (isdigit(c)) {
a = (a << 3) + (a << 1) + (c ^ '0');
c = getchar();
}
return f ? -a : a;
}
const int MAXN = 1e5 + ... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200000;
int n;
int a[MAXN], b[MAXN];
vector<int> q;
vector<int> ed[MAXN];
int dfs(int u, int a1, int a2, int pred = -1) {
int ret = ((a1 ^ a[u]) == b[u]) ? 0 : 1;
if (ret) {
q.push_back(u + 1);
a1 ^= 1;
}
for (int i = 0; i < (int((ed[u]).siz... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
bool mat[3][3] = {1, 1, 1, 1, 1, 1, 1, 1, 1};
int tog[3][3];
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
cin >> tog[i][j];
tog[i][j] = tog[i][j] % 2;
}
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++)... | 1 |
#include <bits/stdc++.h>
using namespace std;
bool debug = 1;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
long long ln, lk, lm;
long long x[100005], y[100005];
int nxt[100005];
vector<int> mp[100005];
int p[100005][20], d[100005];
void init() {
for (int j = 1; (1 << j) <= n; j++)
for (int i = 1... | 4 |
#include <bits/stdc++.h>
int map[1001][1001];
int n, m;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, -1, 1};
inline bool check(int x, int y) {
return (x >= 1 && x <= n && y >= 1 && y <= m);
}
void dfs(int x, int y) {
for (int i = 0; i < 4; i++)
if (check(x + dx[i], y + dy[i]) && map[x + dx[i]][y + dy[i]]) {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
bool chmax(T &m, const T &v) {
if (v > m) return m = v, true;
return false;
}
template <typename T>
bool chmin(T &m, const T &v) {
if (v < m) return m = v, true;
return false;
}
template <typename T>
bool chinc(T &v1, T &v2) {
if (v1 > v2) re... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n], i, max = 0, f;
for (i = 0; i < n; i++) scanf("%d", &a[i]);
stack<int> s;
for (i = 0; i < n; i++) {
while (!s.empty()) {
if (s.top() < a[i]) {
f = s.top() ^ a[i];
s.pop();
if (f > ma... | 4 |
#include <bits/stdc++.h>
int mat[1000][1000], n, end, snc, syc;
int main() {
FILE *in = fopen("hobbit.in", "r");
scanf("%d", &n);
while (snc <= n) {
end++;
snc += end;
}
snc -= end;
end--;
for (int r = 0; r < end; r++) {
for (int i = r; i < end; i++) {
mat[r][i] = syc + 1;
mat[i + ... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 10010;
int main() {
int f = 0, g = 0;
for (int i = 0; i <= 9; i++) {
cout << i << "\n";
string s;
getline(cin, s);
if (s == "no") f++;
if (s == "don't touch me!" || s == "great!" || s == "don't think so" ||
s == "not bad" || s =... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int ans[maxn], num[maxn];
pair<int, int> pr[maxn];
int main() {
int n, i, j, a, mx;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
pr[i] = make_pair(a, i + 1);
num[a]++;
}
sort(pr, pr + n);
for (i = 2; i <= 100000; i++)
if... | 4 |
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-8;
const int INF = 0x3F3F3F3F;
const long long LINF = 4611686018427387903;
const int MOD = 1e9 + 7;
const int MAXN = 2e5 + 9;
signed main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
long long r, w;
cin >> r >> w;
vector<vector<long long>> arr... | 3 |
#include <bits/stdc++.h>
#pragma GCC target("sse4,avx")
void printOne(const std::vector<int>& as, int idxOne, int w,
std::ostream& out) {
int sum = std::accumulate(as.begin(), as.end(), 0);
int inside = sum - w;
out << (idxOne + 1) << " ";
for (size_t i = 0; i < as.size(); i++) {
if (i == idxO... | 5 |
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
bool isstraight(int *n){
for(int i=0;i<4;i++){
if(n[i+1] - n[i] != 1){
if(n[4] == 13 && n[0] == 1 && n[1] == 10 && n[2] == 11 && n[3] == 12){
return true;
}
return false;
}
}
return true;
}
int main(){
int card[5];... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
int c[105];
int a[105], b[105];
int main() {
cin >> n >> s;
for (int i = 0; i < n; i++) c[i] = s[i] - '0';
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
int ans = 0;
for (int i = 0; i <= 10000; i++) {
int cnt = 0;
for (int j =... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n;
int a[1000005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
long long num = 0, k = 0, tmp;
int i = 0;
while (k < 3 && i <= n) {
i++;
tmp = 1;
while (a[i + 1] == a[i]) {
tmp++;
... | 2 |
#include<bits/stdc++.h>
using namespace std;
typedef complex<double> P;
struct S{
P p,q;
S(P p,P q): p(p),q(q) {}
};
P calc(P a,P b,P c,P d){
a-=d;b-=d;c-=d;
return d+a+(b-a)*imag(a/c)/imag(a/c-b/c);
}
P calc( S a, S b){
return calc( a.p , a.q , b.p , b.q );
}
double cross(P a,P b){
return imag( b * con... | 0 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a[5];
int x,y;
while(cin>>x>>y,x|y){
a[0]=x+y;
for(int i=1;i<5;i++)cin>>x>>y,a[i]=x+y;
int *p=max_element(a,a+5);
cout<<(char)(p-a+'A')<<' '<<*p<<endl;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+10;
int q[N];
ll h[N],dp[N];
ll calcx(int P,int Q){return h[Q]-h[P];}
ll calcy(int P,int Q){return (dp[Q]+h[Q]*h[Q])-(dp[P]+h[P]*h[P]);}
int main()
{
int n;ll C;scanf("%d%lld",&n,&C);
for (register int i=1;i<=n;++i) scanf("%lld",&h[i])... | 0 |
#include <bits/stdc++.h>
void read(int &x) {
x = 0;
int flag = 1;
char ch = ' ';
while (ch < '0' || ch > '9') {
if (ch == '-') flag = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
x *= flag;
}
void read(long long &x) {
x = 0;
int flag = 1;
char c... | 3 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll,ll> P;
#define M 1000000007
int main(){
ll n;
cin>>n;
vector<ll> a(n);
bool f=true;
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]<0){f=!f;a[i]*=-1;}
}
ll c=0;
sort(a.begin(),a.end());
for(int i=1;i<n;i++) c+=a[i];
i... | 0 |
#include<bits/stdc++.h>
using namespace std;
int a[5][5];
bool f[5][5];
int main()
{
int n,i,j,x;
for(i=1;i<4;i++)
for(j=1;j<4;j++)
cin>>a[i][j];
cin>>n;
while(n--)
{
cin>>x;
for(i=1;i<4;i++)
for(j=1;j<4;j++)
if(a[i][j]==x)
f[i][j]=true;
}
if(f[1][1]&&f[1][2]&&f[1][3]||f[2][1]&&f[2][2]&&f[2]... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 2e3 + 5;
long long A[N][N], ID[N][N], IND[N][N], n, m, k, q, l, r, x, y, xx, yy, w,
ST[N];
long long rt;
char s[N];
struct fen {
long long D[N];
inline fen() { memset(D, 0, sizeof(D)); }
void add(long long ind, long long d) {
for (ind++; in... | 5 |
#include <bits/stdc++.h>
using namespace std;
int cnt[1000010];
vector<int> edge[1000010];
int n, m, odd;
bool vis[1000010];
void DFS(int now) {
if (cnt[now] % 2 == 1) odd++;
int i, lm = cnt[now];
for (i = 0; i < lm; i++) {
int ti = edge[now][i];
if (!vis[ti]) {
vis[ti] = true;
DFS(ti);
}
... | 3 |
#include <bits/stdc++.h>
using namespace std;
vector<int> v[200500];
int mrc[200500];
void dfs(int a) {
mrc[a] = 1;
for (int i = 0; i < v[a].size(); i++) {
if (mrc[v[a][i]] == 0) dfs(v[a][i]);
}
}
int main(void) {
int n;
scanf("%d", &n);
memset(mrc, 0, sizeof(int) * 200500);
int x;
for (int i = 1; i... | 1 |
#include <bits/stdc++.h>
#define rep(i, x, y) for (int i = x; i <= y; i++)
#define per(i, x, y) for (int i = x; i >= y; i--)
using namespace std;
const int N = 1e5 + 10;
typedef long long ll;
ll n, m, K, pos[N], a[N], b[N], vis[N], p[N], ans[N];
int main() {
cin >> n;
rep(i, 1, n) scanf("%lld", &pos[i]), b[i]... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long n, a[2005], b[2005], n1, n2, f[2][2005][13], g[2][2005][13],
c[2005][2005], pw[2005], t;
long long calc(long long n, long long m) {
if (m == 0) return (n == 0);
return pw[n] * c[n + m - 1][m - 1] % 998244353;
}
signed main() {
pw[0] = 1;
c[0][0] = 1;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
vector<int> vals;
int spares[1005];
vector<pair<int, int> > edges;
int main() {
int N;
cin >> N;
for (int i = 1; i < N; i++) {
int x, y;
cin >> x >> y;
if (x == N) {
int t = y;
y = x;
x = t;
}
if (x == N || y != N) {
cout <<... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = (2e4)+1;
int n, p[MAX], b[MAX];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for(int i = 1; i <= n; i++) cin >> p[i];
b[p[1]] = n*n;
for(int i = 2; i <= n; i++) b[p[i]] = b[p[i-1]]-n*(p[i]-p[i-1])+1;
for(int i = 1; i <= n; i++) cou... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int M = 1507;
const long long mod = 1e9 + 7;
const long double esl = 1e-5;
int t[M];
int n;
int a[M];
void swapp(int l, int r) {
for (int i = 0; i <= (r - l) / 2; i++) swap(a[i + l], a[r - i]);
}
int getBIT(int m) {
int result = 0;
for (; m > 0; m &= m - 1) {
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, a[100001], g[100001], h[100001], m;
set<int> events[100001];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) events[i].clear();
for (int i = 1; i <= n; i++) scanf("%d", &a[i]), events[a[i]].insert(i);
m = 0;
bool ok = true;
for (int i = 1; i <=... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long mod = 998244353;
long long perm(int a) {
long long ret = 1;
for (int i = 1; i <= a; i++) {
ret *= i;
ret %= mod;
}
return ret;
}
int main() {
int n;
long long rez = 1, cr = 1, rc = 1, cc = 1;
cin >> n;
rez = perm(n);
vector<pair<int, int>... | 4 |
#include <cstdio>
#include <vector>
static const int MAXN = 1e5 + 4;
static const int LOGN = 18;
int n;
std::vector<int> e[MAXN];
int ans = 0;
int f[MAXN];
void dfs_dp(int u, int p = -1)
{
int mask = 0, label = 0;
for (int v : e[u]) if (v != p) {
dfs_dp(v, u);
for (int i = label + 1; i < LOGN;... | 0 |
#include <bits/stdc++.h>
const int M = 100005;
const int N = 2005;
const int MOD = (int)1e9 + 7;
int r[N], c[N], vt[N];
long long f[N];
long long gt[M * 2], igt[M * 2];
bool compare(int i, int j) {
return r[i] < r[j] || (r[i] == r[j] && c[i] < c[j]);
}
long long tru(long long a, long long b) {
if (a < b)
return... | 3 |
#include <iostream>
#include <vector>
#include <queue>
#include <cstdio>
#include <algorithm>
using namespace std;
int DP[60][30][60][30], w, h;
const int INF = (1e9);
char S[60][30];
struct state{int lx, ly, rx, ry;};
bool operator<(const state &x, const state &y){ return x.lx < y.lx;}
bool in_range(int a, int b){ re... | 0 |
#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
using namespace std;
const int N = 300005;
int n, m, s, num, sz[N];
long long ans;
struct node {
int x, y, r;
} d[N];
pair<int, int> q[N * 10];
vector<pair<int, int> > b[N], c[N];
map<pair<pair<int, int>, int>, int> a;
inline int read() {
int ... | 4 |
#include <bits/stdc++.h>
const int MAXN = 300010;
const int INF = 0x3f3f3f3f;
struct Tree {
int tree[MAXN << 2];
void modify(int u, int l, int r, int tar, int v) {
if (l == r) return (void)(tree[u] = v);
int mid = l + r >> 1;
if (tar <= mid)
modify(u << 1, l, mid, tar, v);
else
modify(u ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, ar[1000][100];
int mt[10000];
int l = 0, sure, count = 0;
cin >> n >> m >> k;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> ar[i][j];
}
}
if (k == 0) {
for (int i = m - 1; i >= 0; i--) {
fo... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, *x, id, vis[2001][2001], m;
bool dp[2001][2001];
vector<int> v;
bool solve(int i = 0, int sum = 0) {
if (sum == n) return 1;
if (i == m) return 0;
bool &ret = dp[i][sum];
if (vis[i][sum] == id) return ret;
vis[i][sum] = id;
return ret = solve(i + 1, sum +... | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n, x, y;
vector<pair<ll, ll>> v;
scanf("%lld", &n);
for(ll i = 0; i< n; i++){
scanf("%lld %lld", &x, &y);
v.push_back(make_pair(x, y));
}
sort(v.begin(), v.end());
for(auto i = v.begin(); i !=... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void){
vector<int> v;
int flg;
for (int i=0; i<12; i++){
int t;
cin >> t;
v.push_back(t);
}
sort(v.begin(), v.end());
flg = true;
for (int i=0; i<3; i++){
for (int j=0; j<3; j++){
if (v[j*4+i]!=v[j*4+i+1]) flg = false;
}
}
cout <... | 0 |
#include<iostream>
using namespace std;
int main()
{
while (true){
int n;
cin >> n;
if (!n) break;
for (int i = 0; i < n; i++){
int pm, pe, pj;
cin >> pm >> pe >> pj;
if (pm == 100 || pe == 100 || pj == 100 || (pm + pe) / 2 >= 90 || (pm + pe + pj) / 3 >= 80) cout << "A" << endl;
else if ((pm + pe ... | 0 |
#include <bits/stdc++.h>
using namespace std;
bool comp(long long a, long long b) { return a > b; }
std::vector<long long> fac(500000);
void pre() {
fac[0] = 1;
for (int i = 1; i < 500000; i++) {
fac[i] = i * fac[i - 1];
fac[i] %= 998244353;
}
}
long long power(long long x, long long y, long long p) {
l... | 4 |
#include"bits/stdc++.h"
#include"math.h"
using namespace std;
int main(){
int a;scanf("%d",&a);
int L=a/100;
int R=a%100;
if(1<=L&&L<=12){
if(1<=R&&R<=12)printf("AMBIGUOUS\n");
else printf("MMYY\n");
}else{
if(1<=R&&R<=12)printf("YYMM\n");
else printf("NA\n");
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, m;
cin >> n >> m;
cout << (24 - n) * 60 - m << endl;
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int car[n];
for (int i = 0; i < n; i++) {
car[i] = 2;
}
int temp;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> temp;
if (temp == 1) {
car[i] = 1;
} else if (temp == 2) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
long long t;
t = 1;
while (t--) {
long long n, q;
cin >> n >> q;
long long a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
long long ans = 0, sum = 0;
while (q--) {
long l... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
string tmp;
while (cin >> n, n) {
vector<string> v;
v.reserve(n);
for (int i = 0; i < n; i++) {
cin >> tmp;
v.push_back(tmp);
}
int del = 0;
int flag = 0;
while (flag != 5) {
flag = 0;
int length = 0;
for (int i = del;i <... | 0 |
#include <bits/stdc++.h>
using namespace std;
bool isp(long long x) {
if (x <= 1) return false;
for (long long j = 2; j * j <= x; j++)
if (x % j == 0) return false;
return true;
}
int main(void) {
ios::sync_with_stdio(false);
long long n;
cin >> n;
if (isp(n))
cout << "1\n";
else if (n % 2 == 0)... | 2 |
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
typedef long long int ll;
using namespace std;
string s;
bool is_agari_s(vector<int> h,int len);
bool is_agari_k(vector<int> h,int len);
bool is_agari_k(vector<int> h,int len){//koutu... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.