solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e10 + 2;
const double eps = 0;
const int ms = 0;
const int md = 0;
const int mxn = 105;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int temp = n;
int hand, total = 0, ans = 0;
while (temp--) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int a[1000], cnt;
string s;
int main() {
getline(cin, s);
for (int i = 1; i <= s.length() - 2; i += 3) {
a[s[i]] = 1;
}
for (int i = 0; i <= 256; i++) cnt += a[i];
cout << cnt;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 20;
bool v[MAXN][MAXN];
int r, c, n, k;
int main() {
ios::sync_with_stdio(0);
while (scanf("%d %d %d %d", &r, &c, &n, &k) > 0) {
memset(v, 0, sizeof(v));
for (int i = (0); i < (n); i++) {
int x, y;
scanf("%d %d", &x, &y);
x--;
... | 6 |
//Largest Square
#include <iostream>
#include <algorithm>
using namespace std;
static const int MAX = 1400;
int dp[MAX][MAX], G[MAX][MAX];
int H, W;
int getLargestSquare() {
int maxWidth = 0;
for(int i = 0; i < H; i++) {
for(int j = 0; j < W; j++) {
dp[i][j] = (G[i][j] + 1) % 2;
... | 0 |
#include<bits/stdc++.h>
using namespace std;
string s;
int main(){
cin>>s;
int n=s.length();
for(int i=0;i<n;i++)if(s[i]!=s[n-i-1])return puts("No"),0;
for(int i=0;i<(n-1)/2;i++)if(s[i]!=s[(n-1)/2-i-1])return puts("No"),0;
for(int i=(n+1)/2;i<n;i++)if(s[i]!=s[n-1-(i-(n+1)/2)])return puts("No"),0;
return puts("Yes... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, P> P3;
const ll MOD = ll(1e9+7);
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(3e5 + 5);
const double EPS = 1e-4;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define REP... | 0 |
#include<iostream>
#include<math.h>
#include<float.h>
#include<cstdio>
using namespace std;
#define EPS (1e-10)
#define equals(a,b) fabs((a)-(b))<DBL_EPSILON*fmax(1,fmax(fabs(a),fabs(b)))
//点のクラス
class Point{
public:
double x,y;
Point(double x=0,double y=0):x(x),y(y){}
Point operator + (Poi... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int m, n;
while (cin >> m >> n, m) {
bool live[1010];
int idx = 1, cnt = m;
memset(live, true, sizeof live);
for (int i = 1; i <= n; ++i) {
string s;
cin >> s;
if (cnt != 1) {
string str = to_string(i);
i... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long int dp[105][2610];
string s;
int n;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
for (int i = 1; i <= 26; i++) {
dp[1][i] = 1;
}
for (int i = 2; i <= 100; i++) {
for (int j = i; j <= i * 26; j++) {
for (int k = 1; k ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
set<pair<int, int> > tt;
const int MAXN = 300006;
vector<int> g[MAXN];
bool used[MAXN];
int timer, tin[MAXN], fup[MAXN];
int pol[1000000];
void IS_BRIDGE(int v, int to) {
tt.insert({v, to});
tt.insert({to, v});
}
void dfs(int v, int p = -1) {
used[v] = true;... | 5 |
#include <bits/stdc++.h>
using namespace std;
long long mod = (long long)1e9 + 7;
long long fast_expo(long long base, long long pw) {
long long ans = 1;
while (pw > 0) {
if (pw % 2 == 1) ans = ans * base % mod;
base = base * base % mod;
pw = pw / 2;
}
return ans;
}
int main() {
long long a, b, n, ... | 4 |
#include <iostream>
const int INF=1e9;
using namespace std;
int main(){
int d[100][100],n,p;
cin>>n;
for(int i=0;i<n;i++) for(int j=0;j<n;j++) d[i][j]=INF;
for(int i=0,r,k,t;i<n&&cin>>r>>k;i++) for(int j=0;j<k&&cin>>t;j++) d[r-1][t-1]=1;
for(int k=0;k<n;k++) for(int i=0;i<n;i++) for(int j=0;j<n;j++) d[i][j]=m... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
long long eq(long long start, long long k) {
long long num = k - (start - 1);
return ((num * (start + k)) / 2) - (num - 1);
}
void solve() {
long long n, k;
cin >> n >> k;
long long q = eq(2, k);
if (n == 1)
cout << 0 << '\n';
else i... | 2 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
struct matrix {
long long t[3][3];
matrix(int k) {
if (k == -1) {
for (int i = 0; i < (3); ++i)
for (int j = 0; j < (3); ++j) t[i][j] = 0;
} else {
for (int i = 0; i < (3); ++i)
for (int j = 0; j < (3); ... | 6 |
#include<bits/stdc++.h>
using namespace std;
int n,a[500001],b[500001];
inline int f(int x)
{
for(int i=0;i<n;i++)b[i]=(a[i]>=x);
bool f=1;
for(int i=1;i<n;i++)
if(b[i]==b[i-1]){f=0;break;}
if(f)return b[0];
int best=n,ans=0,m=n/2;
for(int i=0;i<n;)
{
int j=i;
while(j+1<n&&b[j+1]==b[j])j++;
if(i==j){i++;... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long
signed main(){
int n,k,r=0;
cin>>n>>k;
while(n)n/=k,++r;
cout<<r;
} | 0 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <sstream>
using namespace std;
int w, h;
string field[100];
bool check[100][100];
string search(int y, int x){
if(y < 0 || x < 0 || y >= h || x >= w){
return "";
}
if(check[y][x]){
return ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> groups(n);
for (int i = 0; i < n; i++) {
cin >> groups[i];
}
sort(groups.begin(), groups.end());
cout << groups[n / 2];
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int n, m, k... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long m, n, a[100010], ans[100010], sum[100010];
int main() {
long long i, t;
cin >> n >> m;
for (i = 0; i < m; i++) {
cin >> a[i];
sum[i + 1] = sum[i] + a[i];
}
ans[m - 1] = a[m - 1] + 1;
t = n - a[m - 1];
for (i = m - 2; i >= 0; i--) {
if (t ... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long sum1d(vector<int>& v, int st, int& l, int& r) {
int n = (int)v.size();
vector<long long> dp(n, 0);
vector<int> back(n, -1);
long long m = 0;
l = n;
r = n - 1;
for (int i = st; i < n; i++) {
if (i > st && dp[i - 1] > 0) {
back[i] = back[i - ... | 3 |
#include<bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
typedef long long LL;
typedef double db;
int get(){
char ch;
while(ch=getchar(),(ch<'0'||ch>'9')&&ch!='-');
if (ch=='-'){
int s=0;
while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
... | 0 |
/*
* 2565.cc: Broken Audio Signal
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<co... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
long long int n;
long long int k;
long long int sum = 0;
while (t--) {
cin >> n;
cin >> k;
if ((k % 2) != (n % 2)) {
cout << "NO" << endl;
} else {
sum = ((2 * k) * ((2 * k) + 1) / 2) - 2 * (k * (k + 1) /... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n], s = 0, ans = 0, now = 0;
for (int i = 0; i < n; i++) cin >> a[i], s += a[i];
s /= n;
for (int i = 0; i < n; i++) {
now += a[i] - s;
ans += now > 0 ? now : -now;
}
cout << ans << endl;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
ll t;
cin >> t;
while (t--) {
ll n, k;
bool ok = 1;
cin >> n >> k;
ll ara[n + 1];
for (int i = 0; i < n; ++i) cin >> ara[i];
ll ... | 2 |
#include <iostream>
using namespace std;
int main(){
long double a,b;
cin>>a>>b;
if(a>b){
cout<<"GREATER";
}
else if(a<b){
cout<<"LESS";
}
else
cout<<"EQUAL";
} | 0 |
#include <bits/stdc++.h>
using namespace std;
bool isVowel(string a) {
int n = a.length();
char x = a[n - 2];
if (x == ' ') {
int i = 1;
while (x == ' ') {
x = a[n - 2 - i];
i++;
}
}
x = tolower(x);
if (x == 'a' || x == 'e' || x == 'i' || x == 'o' || x == 'u' || x == 'y')
return ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
while(cin>>a>>b>>c,a,b,c){
int tool[301]={};
for(int i=1;i<=a+b+c;i++)tool[i]=2;
int n;
cin>>n;
int num[1001][4];
for(int i=0;i<n;i++){
for(int j=0;j<4;j++)cin>>num[i][j];
if(num[i][3]==1)for(int j=0;j<3;j++)tool[num[i][j]]=1;
}... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long m = 1e9 + 7;
long long power(long long a, long long b) {
if (b == 0) return 1;
if (b == 1) return a % m;
if (b % 2 == 0) {
return (power(a, b / 2) % m * power(a, b / 2) % m) % m;
}
long long x = (power(a, b / 2) % m * power(a, b / 2) % m) % m;
retu... | 2 |
#include <bits/stdc++.h>
#define N 210
#define ll long long
using namespace std;
int n,f[N],a[N];
ll s;
int main(){
scanf("%lld",&s);
for (n=0;s;)
if (!(s&1))
s--,a[++n]=0;
else
s>>=1,a[++n]=1;
int h=1,r=n;
for (int i=1;i<=n;i++)
if (a[i])
f[r--]=n-i+1;
else
f[h++]=n-i+1;
printf("%d\n",n*2);
... | 0 |
#include<iostream>
#include<algorithm>
using namespace std;
int N, T;
pair<int, int> items[3000];
int dp[3000][3000];
int main(){
cin >> N >> T;
for(int i = 0; i < N; i++){
int a, b;
cin >> a >> b;
items[i].first = a;
items[i].second = b;
}
sort(items, items + N);
int ans = 0;
// dp[i][j]... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long n, a[100010];
vector<pair<long long, long long> > v;
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
while (a[i] == a[i + 1]) i++;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int freq[5005], anabas[5005];
short etneen[5001][5001];
vector<vector<short> > cells(5001);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, q, ans = 0, rem = 1e9;
cin >> n >> q;
vector<pair<int, int> > v(q);
for (int i = 0;... | 3 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
using LD = long double;
using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pld = pair<LD, LD>;
inline char get_diff(const char chr1, const char chr2) {
if (chr1 != 'a' && chr2 != 'a') {
return 'a';
}
i... | 3 |
#include <bits/stdc++.h>
#define int long long
#define INF 1e4
#define MAX_V 505
using namespace std;
/*?????§?????¢?????´?????????(Ford_Fulerson????????¨)???O(F|E|)*/
//????????¨????§???????(???????????????????????????)
struct edge{
int to;
vector<int> cap;
int rev;
};
vector<edge> G[MAX_V]; //??°???????????£?... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (y == 0) return x;
return gcd(y, x % y);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
void XsliferX() {
ios::sync_with_stdio(0);
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
}
long l... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f, mod = 1e9 + 7;
const int maxn = 3e5 + 100;
const long double PI = acos(-1.0);
long long gcd(long long a, long long b) { return (a ? gcd(b % a, a) : b); }
long long power(long long a, long long n) {
long long p = 1;
while (n > 0) {
if (n %... | 5 |
#include<iostream>
#include<queue>
#include<map>
#include<algorithm>
#define fs first
#define sc second
using namespace std;
typedef pair<int,int> P;
typedef pair<P,P> P2;
int main(){
int w,h;
string room[2][50];
int ry,rx,ly,lx;
while(cin >> w >> h && (w||h)){
int ay[2],ax[2];
for(int i=0;i<h;i++)... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int mxN = 1e5, M = 1e9 + 7;
int n, eu[mxN], ev[mxN], ew[mxN], ec[mxN], s[mxN], ctp[mxN];
vector<int> adj[mxN];
long long ans = 1;
vector<pair<long long, int> > v1, v2;
pair<long long, int> ft[3 * mxN];
pair<long long, int> operator+(const pair<long long, int> &a,
... | 4 |
#include <bits/stdc++.h>
using namespace std;
vector<long long> adj[1000100];
bool vis[1000100];
long long a[1000100];
long long bfs(long long s) {
long long mn = 1e9;
queue<long long> q;
q.push(s);
vis[s] = true;
while (!q.empty()) {
long long v = q.front();
mn = min(mn, a[v - 1]);
q.pop();
f... | 3 |
#include <iostream>
#include <map>
using namespace std;
int main()
{
int n;
while(cin >> n){
if(!n){
break;
}
map<unsigned long long int,unsigned long long int> syain;
bool flag = true;
unsigned long long int a,b,c;
for(int i=0;i<n;i++){
map<unsigned long long int,unsigned long long int> tmp;
ci... | 0 |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std ;
string s;
int main(){
cin>>s;
if (s=="AKIHABARA"||
s=="KIHABARA" ||
s=="AKIHBARA" ||
s=="AKIHABRA" ||
s=="AKIHABAR" ||
s=="KIHBARA" ||
s=="KIHABRA" ||
s=="KIHABAR" ||
s=="AKIHBRA" ||
s=="AKIHBAR" ||... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long nx2(long long n) {
long long p = 1;
if (n && !(n & (n - 1))) return n;
while (p < n) p <<= 1;
return p;
}
namespace Debug {
void dout() { cerr << "\n"; }
template <typename Head, typename... Tail>
void dout(Head H, Tail... T) {
cerr << " " << H;
dout(T... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long pwr(long long a, long long b);
long long pwr(long long a, long long b, long long m);
int baap[200002];
int find(int i);
bool Union(int x, int y);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n;
cin >> n;
long long x[n + 1], y[n... | 3 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#incl... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define BLOCK 750
#define mxn 5000001
using namespace std;
struct query{
int l;
int r;
int i;
};
query Q[mxn];
int ar[mxn] , ans[mxn];
int fre[mxn];
int cnt = 0;
bool comp(query a , query b)
{
if(a.l / BLOCK != b.l/BLOCK)
return a.l/BLOCK < b.l/BL... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long query(long long x, long long y, long long k) {
long long br = 0;
if (k < max(x, y)) {
return -1;
}
if (x == y) {
k -= x;
br += x;
br += (k / 2) * 2;
if (k % 2 == 1) {
br--;
}
} else {
long long tmp = min(x, y);
y = m... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long last = -1;
vector<long long> vec(n);
for (long long i = 0; i < n; i++) {
vec[i] = i + 1;
}
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
sort(a, a + n);
sort(b, b + n);
for (int ... | 2 |
#include <iostream>
using namespace std;
int main(){
double a;
while(cin >> a){
double s = a;
for(int i=2;i<11;i++){
if (i % 2) a /= 3;
else a *= 2;
s += a;
}
cout.precision(8);
cout << fixed << s << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, a, b;
cin >> t;
while (t--) {
cin >> a >> b;
if (a == b)
cout << 0 << "\n";
else if (a > b) {
if (a == b + 1)
cout << 2 << "\n";
else if ((a - b) % 2 == 0)
cout << 1 << "\n";
else
cout << ... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long read() {
int f = 1;
long long res = 0;
char ch;
do {
ch = getchar();
if (ch == '-') f = -f;
} while (ch < '0' || ch > '9');
do {
res = res * 10 + ch - '0';
ch = getchar();
} while (ch >= '0' && ch <= '9');
return f == 1 ? res : -res... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, r;
cin >> a >> b >> r;
if (min(a, b) < 2 * r) {
cout << "Second" << endl;
} else {
cout << "First" << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int Max = 1e5 + 10;
bool seen[Max];
int H[Max];
int P[Max];
int G[Max];
int C[Max];
vector<int> N[Max];
bool DFS(int v) {
seen[v] = true;
bool ans = true;
C[v] = P[v];
for (auto u : N[v]) {
if (!seen[u]) {
ans &= DFS(u);
C[v] += C[u];
G[v... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6 + 6;
vector<int> v;
map<int, int> freq;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
v.clear();
freq.clear();
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int a;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n, data[100005], cnt;
struct Node {
int num, r;
} a[100005];
void swap(Node &x, Node &y) {
Node temp = x;
x = y;
y = temp;
}
void stack_down(int x) {
while (x * 2 <= cnt) {
int t = x * 2;
if (x * 2 < cnt && a[t + 1].num > a[t].num) t++;
if (a[t].nu... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int LG = 21;
const int M = 1000;
const int N = 500010;
const int V = 1000010;
int n, q, a[N], store[N], tmp[LG][M], cur[LG], msb[V];
int suff[N][LG], pref[N][LG], suff_sz[N], pref_sz[N];
void gauss() {
for (int i = LG - 1; i >= 0; --i) {
if (cur[i] == 0) continu... | 6 |
#include <iostream>
#include <cstdio>
#define rep(i,n) for(int i=0;i<n;i++)
#define ck(a) (0<=(a)&&(a)<9)
int di[]={-3, -1, 1, 3};
int main() {
using namespace std;
int n, s, t, b; char cs, ct, cb;
while((cin>>n),n) {
cin >> cs >> ct >> cb;
s = cs-'A'; t = ct-'A'; b = cb-'A';
// 確率漸化式（添字は場所に対応。漸... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base ::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> a(n + 1);
vector<int> yes(n + 1), no(n + 1);
int cntn = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] > 0) {
yes[a[i]]++;
} else {
cntn++;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 111111;
const int INF = int(1e9), mod = (int)1e9 + 7;
char s[N + N];
stack<char> st;
string res;
int main() {
gets(s);
int n = (int)strlen(s);
for (int(i) = (0); (i) < (n); ++(i))
st.empty() ? st.push(s[i]) : (st.top() == s[i] ? st.pop() : st.push(s[... | 1 |
#include <bits/stdc++.h>
using namespace std;
int father[200];
void merge(int, int);
int find(int);
int main() {
int n, m;
cin >> n >> m;
bool allzero = true;
for (int i = 1; i <= n + m; ++i) father[i] = -1;
for (int i = 1; i <= n; ++i) {
int k;
cin >> k;
if (k) allzero = false;
for (int j = 1... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string str;
cin >> str;
cout << str.substr(0, 3) << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
struct node {
node* next[26];
node* link;
};
int nid;
node pool[1100005];
void insert(node* root, string s) {
for (char x : s) {
if (root->next[x - 'a'] == nullptr) {
root = root->next[x - 'a'] = pool + nid;
nid++;
} else {
root = root->next[... | 2 |
#include <bits/stdc++.h>
using namespace std;
#define N 55
#define S 5005
#define ll long long
#define set(a,v) memset(a,v,sizeof(a))
int n,m,s,lim=5e3,c[N],d[N];bool vs[N];ll dp[N][S];
struct Edge {int v,a,b;};vector<Edge> e[N];queue<int> q;
void addE(int u,int v,int a,int b)
{
e[u].push_back((Edge) {v,a,b});
e[v].p... | 0 |
#include <bits/stdc++.h>
long work() {
char c = getchar();
long x, y, i, j, z = 0;
if (c == '0') return 1;
if (c == '1') return 8;
if (c == '?') return 6;
x = work();
c = getchar();
y = work();
for (i = 0; i < 4; i++)
if (x & (1 << i))
for (j = 0; j < 4; j++)
if (y & (1 << j))
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count=1;
while(count*N%360!=0)count++;
cout << count << endl;
}
| 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#define M 1000000007
using namespace std;
long long ans=1;
long long n,t[100000],a[100000],u[100000];
int main(){
cin>>n;
for(int i=0;i<n;i++)cin>>t[i];
for(int i=0;i<n;i++)cin>>a[i];
u[0]=t[0];
u[n-1]=a[n-1];
for(int i=1;i<n;i++){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int n, i, j;
long long a[105], k;
vector<vector<long long> > b, id;
vector<vector<long long> > mul(vector<vector<long long> > x,
vector<vector<long long> > y) {
vector<vector<long long> > z;
for (int ii = 0; ii < x... | 5 |
#include <bits/stdc++.h>
using namespace std;
int n, Q, T, P, used[210][210], cnt[210];
struct dot {
int x, y;
} a[210];
double mat[14 + 2][210][210], cur[210][2], tmp[210][2], ans;
vector<vector<int> > l;
vector<int> curr;
dot operator-(dot a, dot b) {
a.x -= b.x, a.y -= b.y;
return a;
}
long long operator*(dot ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int p[] = {0, 1, 2, 3, 4, 5, 6, 7, 8};
int x[9], y[9];
bool dp(int a, int b, int c) {
if ((x[p[a]] - x[p[b]]) * (x[p[c]] - x[p[b]]) +
(y[p[a]] - y[p[b]]) * (y[p[c]] - y[p[b]]) ==
0)
return 1;
else
return 0;
}
int dis(int a, int b) {
return ((x[... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
long long int i;
map<long long int, long long int> mp;
map<long long int, long long int>::iterator it;
long long int a[200001];
for (i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
for (i = 0; i < n; i++) {
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >>a>>b>>c;
cout<<min(a+b,min(b+c,a+c))<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e9;
class RangeMin {
private:
vector<ll> seg;
int n;
int recf(int a, ll v) const {
while (a < n) a = 2 * a + (seg[2 * a] > v);
return a - n;
}
public:
RangeMin(const vector<ll>& v) : n(v.size()), seg(2 * v.size()) {... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
int ans = 0;
if (a[2]) {
--a[2];
++ans;
}
if (a[1]) {
--a[1];
++ans;
}
if (a[0]) {
--a[0];
++ans;... | 1 |
#include <bits/stdc++.h>
using namespace std;
double eps = 1e-9;
long long int n;
long double arr[1000000];
long double solve(long double mid) {
double maxi = 0.0, sum = 0.0;
for (long long int i = 0; i < n; i++) {
sum += (arr[i] - mid);
if (sum < 0) {
sum = 0;
}
maxi = max(abs(sum), maxi);
... | 3 |
#include <bits/stdc++.h>
using namespace std;
const long long int N = 200010;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, m;
cin >> n >> m;
vector<long long int> adj[n + 1];
for (long long int i = 0; i < m; ++i) {
long long int a, b;
cin >> a >> b... | 5 |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <memory>
#include <cstring>
#include <cassert>
#include <numeric>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cctype>
#include <unordered_map>
#inclu... | 0 |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
int a, b;
cin >> a >> b;
int s = a + b;
int sum = 0, k = 1;
while (sum + k <= s) {
sum += k;
k++;
}
--k;
vector<int> A, B;
for (int i = k; i >= 1; i--) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n;
long long a[123456], f[123456], ans, tmp;
void init() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%I64d", &tmp);
a[tmp]++;
}
}
void solve() {
f[1] = a[1];
ans = f[1];
for (int i = 2; i < 123456; i++) {
f[i] = max(f[i - 1], f[i - 2... | 3 |
#include<stdio.h>
int main(){
int x;
scanf("%d",&x);
int r = 0;
while(x > 0){
++r;
x-=r;
}
printf("%d\n",r);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[m];
int eq, diff;
eq = n / m;
diff = m - (n - (m * eq));
for (int i = 0; i < m; i++) {
if (i < diff) {
a[i] = eq;
} else {
a[i] = eq + 1;
}
}
for (int i = 0; i < m; i++) {
cout << a[i]... | 1 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
void use_input() { freopen("input.txt", "r", stdin); }
void use_output() { freopen("output.txt", "w", stdout); }
void use_files() {
use_input();
use_output();
}
long long pw(long long n) {
long long s = 1;
for (long long i = 0; i < n; i++) ... | 5 |
#include <bits/stdc++.h>
long long max(long long a, long long b) { return (a < b) ? b : a; }
long long min(long long a, long long b) { return (a > b) ? b : a; }
using namespace std;
long long x[300], y[300];
long long ab(long long r) { return (r < 0) ? -r : r; }
int main() {
long long x, ans = LLONG_MAX / 2, bb, aa;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long n, i, x, y, s, j;
long long A[100001], M[100001], R[100001];
vector<long long> V[100001];
long long solve(long long i) {
long long &res = M[i], j, x, m, &b = R[i];
vector<long long> X, Y;
if (res == -1) {
res = 0;
for (j = m = 0; j < V[i].size(); j++... | 5 |
#include <bits/stdc++.h>
using namespace std;
inline long long Max(long long a, long long b) { return a > b ? a : b; }
inline long long Min(long long a, long long b) { return a < b ? a : b; }
inline long long read() {
long long x = 0;
int ch = getchar(), f = 1;
while (!isdigit(ch) && (ch != '-') && (ch != EOF)) c... | 6 |
#include <bits/stdc++.h>
using namespace std;
mt19937 Rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
template <typename T>
inline void chkmax(T &x, T y) {
if (x < y) x = y;
}
template <typename T>
inline void chkmin(T &x, T y) {
if (x > y) x = y;
}
inline int read() {
int x = 0;
char c = ... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
long long ans1, ans2, a[N], n, b[N], now = 1, p = 1;
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] < 0) p *= -1;
b[i] = p;
if (p > 0)
an... | 2 |
#include <bits/stdc++.h>
using namespace std;
struct pointer {
int x;
int y;
} p[101];
int main() {
int n, k;
while (cin >> n >> k) {
for (int i = 0; i < n; ++i) {
cin >> p[i].x >> p[i].y;
}
double dis = 0;
for (int i = 1; i < n; ++i) {
dis += sqrt((double)(p[i].x - p[i - 1].x) * (p[... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
while (t--) {
int n, k;
cin >> n >> k;
string s;
cin >> s;
if (s.substr(0) < s.substr(k)) {
int i = k - 1;
while (s[i] == '9') {
s[i] = '0';
i--;... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll D;
cin >> D;
vector<ll> c(26), t(D), last(26, -1);
vector< vector<ll> > s(365, vector<ll> (26));
rep(i, 0, 26) cin >> c[i];
rep(i, 0, ... | 0 |
#include <iostream>
using namespace std;
int main() {
int d;
while(cin >> d) {
int ans = 0;
for(int i = 0; i < 600; i += d) {
ans += i * i * d;
}
cout << ans << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
double a, v, l, d, w, ans, L, t1, t2, v_2;
int main() {
scanf("%lf%lf%lf%lf%lf", &a, &v, &l, &d, &w);
L = l - d;
double A = w * w;
if (v <= w || A >= 2 * a * d) {
if (2 * a * l >= v * v) {
ans = v / a;
ans += (l - v * v / 2 / a) / v;
} else
... | 4 |
#include<iostream>
using namespace std;
int n, k;
long long int T[100000];
long long sum;
long long l;
int check(long long p) {
int m = 0;
for (int i = 0; i < k; i++) {
long long s = 0;
while (s + T[m] <= p) {
s += T[m];
m++;
if (m >= n) {
return n;
}
}
}
return m;
}
int main() {
cin >> n ... | 0 |
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
double r1, r2;
cin >> r1 >> r2;
cout << fixed << setprecision(7) << r1 * r2 / (r1 + r2) << endl;
}
| 0 |
#include <bits/stdc++.h>
#define maxn 5010
using namespace std;
typedef long long LL;
#define G c = getchar()
inline LL read() {
LL x = 0, f = 1;
char G;
for (; c > 57 || c < 48; G)
if (c == '-') f = -1;
for (; c > 47 && c < 58; G) x = x * 10 + c - 48;
return x * f;
}
struct Poi {
LL x, ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f;
while (cin >> a >> b >> c >> d >> e >> f) {
cout << (a + b + c) * (a + b + c) - a * a - c * c - e * e << endl;
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int leapYear(long long x) {
if (x % 400 == 0) return 1;
if (x % 4 == 0 && x % 100 != 0) return 1;
return 0;
}
int main() {
long long y;
cin >> y;
long long days = 0;
for (long long x = y;; x++) {
if (leapYear(x))
days = (days + 366) % 7;
else
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int n, m, temp;
cin >> n >> m;
vector<long long int> vec(m, 0);
for (long long int i = 0; i < n; i++) {
cin >> temp;
vec[--temp]++;
}
long long int sum = 0;
for (long l... | 2 |
#include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define INF 1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define req(i, j, n) for(int i = j; i <= (int)(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin>>n;
... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.