code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <stdio.h>
int N;
int R[200];
int dp[200][200];
int min(int x, int y) { return x < y ? x : y; }
int main(void) {
scanf("%d", &N);
for (int i = 0; i < N; i ++) {
scanf("%d %d", &R[i], &R[i+1]);
}
for (int i = 0; i < N; i ++) {
for (int j = 0; j < N; j ++) {
dp[i][j] = 1 << 20;
}
}
for (int i = 0; ... | #include <iostream>
#include <vector>
#include <string>
int main(){
int q;
std::string a, b;
std::vector< std::vector< int > > dp;
dp.resize(1001);
for(int i=0;i<=1000;++i){
dp[i].resize(1001);
}
std::cin >> q;
for(int i=0;i<q;++i){
std::cin >> a >> b;
for(int x=1;x<=a.length();++x){
for(int y=1;y<=b.l... | 0 | 64,888,820 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(void){
int money = 100000, weeks;
cin >> weeks;
for(int i = 0; i < weeks; i++){
money += (money / 100) * 5;
int underTp = money % 1000;
if(underTp != 0){
money -= underTp;
money += 1000;
}
}
cout << money << endl; ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const double PI = 3.1415926535897932;
long long GCD(long long a, long long... | 0 | 31,033,221 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
int gc... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
... | 0 | 44,317,027 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
const double pi=acos(-1);
int main()
{
ll a,b,x; cin>>a>>b>>x;
if(2*x<=a*a*b) {cout<<fixed<<setprecision(15)<<atan((double)(a*b*b)/(2*x))*180/pi<<endl; re... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for(ll i=0; i<n; i++)
#define repr(i, s, e) for(ll i=s; i>=e; i--)
#define reps(i, s, e) for(ll i=s; i<=e; i++)
#define inf 1e18
#define all(v) v.begin(),v.end()
#define ceil(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp ... | 0 | 77,683,271 |
#include <iostream>
using namespace std;
int N, A, B, C, Y[110], i, n, X;
int ran(int x1, int i, int n){
int x2;
if(Y[i] == x1 && i==N) return n;
if(x1 == Y[i]){
if(i==N) return n;
else i++;
}
x2 = (A*x1+B)%C;
n++;
if(n > 10000) return -1;
return ran(x2, i, n)... | #include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | 0 | 38,156,217 |
#include<iostream>
#include<cctype>
using namespace std;
#include<cstdio>
#include<cstring>
#include<string>
int main(){
int n, taro=0, hanako=0;
string ct, ch;
cin >> n;
for (int i=0; i<n; i++){
cin >> ct >> ch;
if (ct > ch) taro+=3;
else if (ct < ch) hanako+=3;
else {
taro++; hanako++;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define f first
#define s second
const int N = 1e6+5;
string s;
ll n , m , cnt[N] , x[N] , y[N] , mod=1e9+7;
int mul(int a, int b)
{
a = (a + mod) % mod;
b = (b + mod) % mod;
return (1ll * a * b) % mod;
}
int add(int ... | 0 | 25,751,613 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1e18;
typedef pair<char,ll> pcl;
typedef vector<pcl> vpcl;
vpcl rle(string s) {
vector<pair<char,ll>> res;
char temp=s[0];
ll count=0;
for... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
while(cin>>n,n){
int p=0;
vector<int> a;
a.resize(n);
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a.begin(),a.end());
for(int i=1;i<n-1;i++){
... | 0 | 5,897,774 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
template<class S>S sum(vector<S>&a){return accumulate(all(a),S());}
template<class S>S max(vect... | # include <bits/stdc++.h>
# define rep(i, n) for(ll i = 0; i < (n); ++i)
# define reps(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(ll i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(ll i=((int)(n)); i>0; --i)
# define ll long long
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((i... | 0 | 51,632,555 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
int a,b;cin >>a>>b;
string s;cin >>s;
int n=s.size();
bool flg=true;
f... | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
ll solve(vector<ll> v) {
int n = v.size();
ll res = 0;
for (ll i=0; i<... | 0 | 93,658,382 |
#include <iostream>
using namespace std;
int main() {
long N, M, x[100010], y[100010], mod=1000000007; cin >> N >> M;
for(int i=0; i<N; ++i) cin >> x[i];
for(int i=0; i<M; ++i) cin >> y[i];
long XSUM=0, YSUM=0, mul, Int;
for(int i=1; i<N; ++i){
mul=(i*(N-i))%mod, Int=(x[i]-x[i-1])%mod;
XSUM=(XSUM+Int*mul... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | 0 | 291,597 |
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <sstream>
#include <utility>
#include <cstdlib>
#include ... | #include <iostream>
#include <string>
using namespace std;
string satu;
string dua;
string tiga;
int main(){
cin>>satu>>dua>>tiga;
satu[0]-=32;
dua[0]-=32;
tiga[0]-=32;
cout<<satu[0]<<dua[0]<<tiga[0]<<endl;
} | 0 | 64,399,252 |
#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3... | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using na... | 0 | 20,958,818 |
#include <stdio.h>
#define REV_INF (1 << 31)
int main(void)
{
int data[100000];
int n;
int k;
int sum;
int sum_max;
int i;
while (1){
scanf("%d%d", &n, &k);
if (n == 0){
break;
}
for (int i = 0; i < n; i++){
scanf("%d", &data[i]);
}
sum = 0;
for (i = 0; i < k; i++){
sum += data[i];
}
s... | #include <bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < n; i++)
#define REPR(i,n) for(int i = n; i >= 0; i--)
#define FOR(i,m, n) for(int i = m-1; i < n; i++)
#define INF 2000000000
#define ALL(v) v.begin(), v.end()
#define chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))
#define FILL2D(A,c) fill(A[0], ... | 0 | 24,404,927 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<vector<int>> d(n);
vector<int> cnt(n);
for(int i = 0; i < n-1; i++)
{
int a, b;
cin >> a >> b;
a--;b--;
d[a].push_back(b);
d[... | 0 | 69,416,103 |
#include <iostream>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
void solve(ll x) {
cout << (x < 1200 ? "ABC" : "ARC") << endl;
}
int main() {
ll x;
cin >> x;
solve(x);
return 0;
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#define int long long
using namespace std;
const int N = 1e5 + 5;
int n, head[N], tot, siz[N], dis[N];
struct data{int d, id;}d[N];
struct node{int to, nex;}a[N << 1];
inline int read()
{
int x = 0, f = 1; char ch = getchar();
while(ch < '0' || ch > '9') {if(... | 0 | 60,907,795 |
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>
#include <stack>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using pii = pair... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = 998244353;
int main() {
ll N, x, m{}, ans{1};
cin >> N;
vector<int> D(N);
for (int i = 0; i != N; ++i) {
cin >> x;
if ((!i && x) || (i && !x)) {
cout << 0 << endl;
return 0;
... | 0 | 28,459,147 |
#include <iostream>
using namespace std;
int main () {
int a,b,c,d,cnt=0;
cin >> a >> b >> c >> d;
int array[101]={0};
for(int i=a;i<b;i++) array[i]++;
for(int i=c;i<d;i++) array[i]++;
for(int i=0;i<100;i++)
if (array[i]==2) cnt++;
cout << cnt;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
long long N, A[100000], Cur = 2, ANS = 0;
cin >> N;
for (int i = 0; i < N; i++) cin >> A[i];
ANS = A[0] - 1;
for (int i = 1; i < N; i++) {
if (Cur == A[i]) Cur++;
else {
ANS += (A[i] - 1) / Cur;
}
}
cout << ANS << endl;
} | 0 | 56,368,535 |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
const int maxn=100005;
int n,a[maxn];
ll sum[maxn];
template<class Type>Type read(){
Type res=0,f_f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') f_f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') res=(res<<... | #include<stdio.h>
int main(){
int t;
long long a[100010];
scanf("%d", &t);
for(int i=0; i<t; i++){
scanf("%lld", &a[i]);
if (a[i]==0){
printf("%d\n", 0);
return 0;
}
}
long long u=1;
long long s=1e18;
for(int i=0; i<t; i++){
s/=a[i];
if(s<1){
printf("%d\n", -1);
return 0;
}
else{
... | 0 | 68,825,141 |
#include <iostream>
long fact(int n);
int main()
{
int n;
std::cin >> n;
std::cout << fact(n) << std::endl;
return 0;
}
long fact(int n)
{
long ans = 1;
while (n--) {
ans *= (n + 1);
}
return ans;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<string> S;
vector<map<int, int>> m(n);
for (int i = 0; i < n; ++i) {
string str;
cin >> str;
S.push_back(str);
for (int j = 0; j < st... | 0 | 67,841,602 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main(){
ll n;
cin >> n;
string s[n];
ll counta=0,countb=0,countab=0,count=0;
for(ll i=0;i<n;i++){
cin >> s[i];
if(s[i][0]=='B') countb++;
if(s[i][s[i].size()-1]=='A') counta++;
... | #include <iostream>
using namespace std;
int main() {
int N,a,b,max_man,out_man;
int A[210];
cin >> N;
int res = 0;
max_man = 0;
out_man = 1;
for (int i = 1; i <= N; ++i) {
a = 0;
b = i;
for (int j = 0; a < 1 ; ++j) {
if (b % 2... | 0 | 54,268,820 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,av;
cin>>a>>av;
cout<<2*av-a;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);cout.precision(dbl::max_digits10);
#define pb push_back
#define mod 1000000007
#define lld long double
#define mii map<int, int>
#define mci map<char, int>... | 0 | 7,516,395 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define mod 1000000007
int main(){
fast;
string s;
cin>>s;
int fre[26]={0};
for(int i=0;i<s.length();i++)
fre[s[i]-97]++;
for(int i=0;i<26;i++)... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=(int)(n);i++)
using ll=long long;
int main(){
int n,sum=0;
cin>>n;
vector<int> dat(n+5);
rep(i,n){
cin>>dat[i];
sum+=abs(dat[i]-dat[i-1]);
}
sum+=abs(dat[n]);
rep(i,n){
int now=sum;
n... | 0 | 51,505,341 |
#include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
double w,h,x,y;
cin >> w >> h >> x >> y;
double ans = w*h / 2;
int flag = 0;
if (x*2 == w && y*2 == h) flag = 1;
else flag = 0;
cout << ans << " " << f... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string str;
int q;
cin >> str;
cin >> q;
string cmd, p;
int a, b;
for (int i = 0; i < q; i++) {
cin >> cmd;
if (cmd == "print") {
cin >> a >... | 0 | 90,548,788 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<int,int> P;
typedef pair<int,P> P1;
#define fr first
#define sc second
#de... | 0 | 35,763,127 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
int n,m;
cin >> n >> m;
int sum=0;
for(int i=1; i<n; i++){
sum = sum + i;
}
for(int i=1; i<m; i++){
sum = sum + i;
}
cout << sum << endl;
return 0 ;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
int main(void) {
int64_t N, D, A;
cin >> N >> D >> A;
vector< pair<int64_t,int64_t> > monster(N);
for(int i=0; i<N; i++) {
cin >> monster[i].first >> monster[i].second;
}
sort(monster.begin()... | 0 | 84,919,883 |
#include <bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
const int MAXN=500005;
const long MOD=(long)(1e9+7);
vector<int> adj[MAXN];
vector<pair<int,int>> G[MAXN];
Int N,M,K;
Int B,C,H,W;
Int X,Y,Z;
vector<Int> A;
Int ceilS(Int x,Int y){
return (x+y-1)/y;
}
using D=long double;
Int p... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int L = 60;
ll basis[L];
void insert_vec(ll msk) {
for (int i = L-1; i >= 0; i--) {
if (!(msk&(1ll<<i))) continue;
if (!basis[i]) {
basis[i] = msk; return;
}
msk ^= basis[i];
}
}
void solve() ... | 0 | 6,952,637 |
#include <iostream>
#include <vector>
#include <stack>
using namespace std;
int main(){
int e;
stack<int> S;
while(cin >> e){
if(e > 0){
S.push(e);
continue;
}
cout << S.top() << endl;
S.pop();
}
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<vector<bool>> path(8,vector<bool>(8,false));
int dfs(int v,int n, vector<bool> checked){
int ans = 0;
bool all_visited = true;
for(int i=0;i<n;i++){
if(checked.at(i) == false){
all_visited = false;
... | 0 | 63,255,864 |
#include <iostream>
#include <atcoder/dsu>
using namespace std;
int main(){
int N,Q;
cin >> N >> Q;
int query[Q][3];
for(int i = 0; i < Q; i++){
cin >> query[i][0] >> query[i][1] >> query[i][2];
}
atcoder::dsu d(N);
for(int i = 0; i < Q; i++){
int u = query[i][1];
in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n; cin >> n;
ll answer = 0;
vector<int> as(n);
for(int i = 0; i < n; ++i)
{
cin >> as.at(i);
}
map<int, int> mp;
for(int i = 0; i < n; ++i)
{
mp[as.at(i)]++;
}
for(int i = 0; i... | 0 | 86,909,496 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define sz size()
#define pi acos(-1.0)
#def... | 0 | 12,595,359 |
#include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep1(i,n) for(long long i=1;i<=(long long)(n);i++)
#define all(v) v.begin(),v.end()
#define Sort(v) sort(all(v))
#define Reverse(v) reverse(all(v))
#define Rsort(v) sort(all(v),greater)
#define pub(v)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int main() {
int h, w;
cin >> h >> w;
vector<string> a(h);
for (int i = 0; i < h; ++i) {
cin >> a[i... | 0 | 61,736,731 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> lines(h);
for (int i = 0; i < h; ++i) {
cin >> lines[i];
}
for (int i = 0; i < h; i++) {
string line = lines[i];
cout << line << endl;
... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
using P = pair<int,int>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = ... | 0 | 232,446 |
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<cmath>
#include<vector>
#include<utility>
#define FOR(i, a, b) for(int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define MOD 1000000007
using namespace std;
int main(void) {
int h, w;
char moj... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 0 | 99,396,112 |
#include "bits/stdc++.h"
#define REP(i,n) for(ll i=0;i<ll(n);++i)
#define RREP(i,n) for(ll i=ll(n)-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<ll(n);++i)
#define RFOR(i,m,n) for(ll i=ll(n)-1;i>=ll(m);--i)
#define ALL(v) (v).begin(),(v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v)... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b;
string s;
cin >> a >> b >> s;
if(s.size()!=a+b+1) {cout << "No" << endl; return 0;}
if(s... | 0 | 25,334,082 |
#include<iostream>
#include<algorithm>
using namespace std;
int a[200000];
int n,l,s,maxn;
int main(){
while(true){
maxn=-100000000;
s=0;
cin>>n>>l;
if(n==0 && l==0){break;}
for(int i=0;i<n;i++){
cin>>a[i];
if(i<l){s+=a[i];}
}
maxn=s;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n, l;
cin >> n >> l;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] + a[i + 1] >= l) {
cout << "Possible" << endl;
... | 0 | 19,389,669 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
int K = 0;
cin >> K;
vector<int> A(N,0);
for(int i = 0; i < N; i++) {
cin >> A.at(i);
}
int ans = 0;
sort(A.begin(),A.end());
reverse(A.begin(),A.end());
for (size_t i = 0; i < K; i++)
{
... | 0 | 60,301,633 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
ll dp[100004][2];
int main()
{
string s;
cin >> s;
int n = s.size();
dp[0][1] = 1;
for(int i = 0;i<n;i++)
{
if(s[i]=='0')
{
(dp[i+1][0] += dp[i][0]*3)%=MOD;
(dp[i+1][1] += dp[i][1]);
}
else
{
(dp[i+1][0] +=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int main() {
int N; cin >> N;
vector<bool> dp(100);
dp.at(0) = false, dp.at(1) = false, dp... | 0 | 41,930,787 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
using namespace std;
void solve(){
long long int n, m; cin >> n >> m;
long long int ans;
if(n >= 2 && m >= 2) ans = (n - 2) * (m - 2);
else if(n == 1 && m == 1) ans = 1;
else ans = max(... | #include<bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define bit(n,k) (((ll)n>>(ll)k)&1)
const long long INF= 1e+18+1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll> >vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
const... | 0 | 70,636,893 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <stack>
#include <vector>
#include <set>
#include <tuple>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typed... | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) (obj).begin(), (obj).end()
#define rep(i,n) for(int i=0; i<n; i++)
#define rep2(i,a,b) for(int i=a; i<=b; i++)
using ll = long long;
#define pb push_back
class Position {
public:
int x;
int y;
Position(int y, int x) {
this->x = x;
... | 0 | 44,202,972 |
#include <iostream>
#include <set>
using namespace std;
int collatz(int x){
if(x%2 == 0) return x/2;
else return 3*x+1;
}
int main(){
int s; cin >> s;
set<int> st;
int ans = 1;
while(1){
st.insert(s);
s = collatz(s);
ans++;
if(st.count(s) == 1) {
cout ... | #include <iostream>
#include <queue>
using namespace std;
const int MAX = 100;
int n;
int G[MAX + 1][MAX + 1];
int states[MAX + 1];
int d[MAX + 1];
queue<int> Q;
void bfs(int id) {
d[id] = 0;
states[id] = 1;
Q.push(id);
while (!Q.empty()) {
id = Q.front(); Q.pop();
for (int i = 0; i < n; i++) {
if... | 0 | 81,855,252 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,a,b;
cin >> n >> a >> b;
int cnt1=0,cnt2=0,cnt3=0;
for(int i=0;i<n;i++){
int m;
cin >> m;
if(m<=a)cnt1++;
else if(a<m && m<=b)cnt2++;
else if(b<m)cnt3++;
}
cout << min(cnt1,min(cnt2,cnt3)) << endl;
} | #include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define rep(i,x) for(ll i = 0; i < (ll)(x); i++)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define debug(x) cerr << #x << ": " << (x) << "\n";
#def... | 0 | 21,934,506 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i=0;
int n;
cin>>n;
vector<long long> data(90);
data.at(0)=2;
data.at(1)=1;
for(i=0;i<n-1;i++){
data.at(i+2)=data.at(i)+data.at(i+1);
}
cout<<data.at(i+1)<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define vll vector<ll>
#define mll map<ll,ll>
#define MOD 1000000007
#define pll pair<ll,ll>
constexpr ll INF = 1999999999999999997;
#define fastio ios_base:... | 0 | 87,215,338 |
#include<iostream>
using namespace std;
int main()
{
int Dice[6];
int q;
int up;
int forward;
int tmp;
int i, j, k;
for(i=0;i<6;i++){
cin >> Dice[i];
}
cin >> q;
for(i=0;i<q;i++){
cin >> up >> forward;
for(j=0;j<4;j++){
tmp=Dice[0];
Dice[0]=Dice[1];
Dice[1]=Dice[5];
Dice[5]=Dice[4];
Dice[... | #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<climits>
#include<cstring>
#include<queue>
using namespace std;
typedef long long ll;
const int INF = INT_MAX/3;
int main(){
int H, W;
cin >> H >> W;
while(H!=0 || W!=0){
... | 0 | 61,097,993 |
#include <cstdio>
#include <cassert>
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <cstring>
#include <cmath>
#include <bitset>
#define pb push_back
#define mk make_pair
#define eb emplace_back
#define eps 1e-8
#define fi first
... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define P pair<ll,ll>
#define INF 1000000000000000000
using namespace std;
int main(void){
ll w, h, n;
cin >> w >> h >> n;
vector<vector<ll>> t(h, vector<ll>(w, 0));
for (int i = 0; i < n; i++){
ll x, y, a;
cin >> x >> y >> a;
... | 0 | 55,785,209 |
#include<iostream>
using namespace std;
int a[1000];
int main() {
while(1) {
int n;
cin >> n;
if (n == 0) break;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int mindelta = 2000000;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MN = 100010;
int N;
ll D[MN];
vector<pair<ll, int> > ord;
int inv[MN], sz[MN];
vector<pii> edge;
vector<int> adj[MN];
int dep[MN];
void dfs(int u, int p) {
for(int i = 0; i < adj[u].size(); i++) {
int v ... | 0 | 6,421,434 |
#include<iostream>
#include<queue>
#include<utility>
using namespace std;
const int INF = 2000000;
char fl[1010][1010];
int d[1010][1010];
int bfs(int sx, int sy, int gx, int gy, int mx, int my) {
typedef pair<int, int>P;
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
for (int i = 0;i < mx;i++)
for (int j = 0;j <... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n; cin >> n;
string s,t; cin >> s >> t;
int hit = 0;
for (int i = 0; i < n; i++)
{
int tmp = 0;
for (int j = 0; j < n - i; j++)
{
int a = i + j;
int b = n - i + j;
if (s[a] == t[j])
{
tmp++;
cont... | 0 | 82,955,000 |
#include <iostream>
using namespace std;
int ans = 0;
void dfs(int n, int s, int k){
if( s < 0 ) return;
if( n == 0 ){
if( s == 0 ) ans++;
}else{
if( 9 < k ) return;
for(int i = k; i <= 9; i++){
dfs(n-1, s - i, i + 1);
}
}
}
int main(){
int n, s;
while( cin >> n >> s, n || s ){
ans = 0;
dfs(n, s, 0... | #include <iostream>
using namespace std;
int ari;
int jiku[102];
int u[102];
int v[102][102];
int ushi[102][102];
int main(){
cin>>ari;
for(int i=1;i<ari+1;i++){
cin>>u[i];
cin>>jiku[u[i]];
for(int j=1;j<jiku[u[i]]+1;j++){
cin>>v[u[i]][j];
}
}
for(int k=1;k<ari+1;k++){
for(int l=1;l<jik... | 0 | 90,667,940 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
#define INF (1e9)
ll gcd_func(ll a, ll b) {
if (a < b) return gcd_func(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm_func(ll a, ll b) {
retur... | #include <iostream>
#include <algorithm>
#include <string>
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
while(true){
std::string x;
std::cin >> x;
if(x=="0") break;
int ans = 0;
for(const auto& c : x){
ans += c-'0';
}
std:... | 0 | 90,682,617 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
typedef long long ll;
string S;
int main(){
cin >> S;
int ans = 100010;
int cnt = 0;
rep(i, S.size()){
if (i % 2 == 0){
... | 0 | 90,457,088 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int X;
cin>>X;
int A=X%100;
int B=X/100;
if(B*5>=A) cout<<1<<endl;
else cout<<0<<endl;
} | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <stack>
#include <s... | 0 | 3,320,055 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#define rep_n(_1, _2, _3, NAME, ...) NAME
#define rep_2(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define rep_3(i, initial, n) for (int(i) = (int)(initial); (i) < (int)(n); ++(i))
#define rep(...) rep_n(__VA_ARGS__, rep_3, rep_2, rep_1)(__VA_ARGS_... | #include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
using ll = long long;
using ld = double;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return ... | 0 | 91,115,689 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<queue>
#include<bitset>
#include<complex>
using namespace std;
template<typename __T>
inline void read(__T &x)
{
x=0;
int f=1;char c=getchar();
while(!isdigit(c)){if(c=='-') f=-1;c=getchar();}
while(isdigit(c)) {x=x*10+c-... | 0 | 14,725,890 |
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
string S, T;
cin >> S >> T;
vector<int> U(26);
rep(i, 26) U[i] = 'a' + i;
rep(i, S.size()) rep(j, 26) {... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin >> n){
int ans = 0;
for(int a = 0;a <= 9;a++){
for(int b = 0;b <= 9;b++){
for(int c = 0;c <= 9;c++){
for(int d = 0;d <= 9;d++){
if(a + b + c + d == n) ans++;
}
}
}
}
... | 0 | 3,871,028 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> A(N);
for(int i=1; i<=N; i++) {
cin >> A[i];
}
int next = 1;
int count = 0;
for(int i=0; i<N; i++) {
if(next == 2) {
cout << count << endl;
return 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
vector<... | 0 | 21,453,318 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> si;
typedef map<string, int> msi;
typede... | #include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main()
{
ll K, A, B;
c... | 0 | 66,749,586 |
#include<bits/stdc++.h>
#define PI 3.1415926535897932384626433832795
#define ll long long
#define MP make_pair
#define IN insert
#define PB push_back
#define fr first
#define se second
#define sf scanf
#define pf printf
#define debug(x) cout<<"---------"<<x<<endl;
#define LEN(a) sizeof(a)/sizeof(a[0])
#define MEM(arr,k... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | 0 | 31,708,116 |
#include<stdio.h>
#include<math.h>
int main(){
long long int r,c,i,j,k,co=0,s=0,b;
scanf("%lld %lld",&r,&c);
long long int a[r][c];
for(i=0;i<r;i++){
for(j=0;j<c;j++){
scanf("%lld",&a[i][j]);
}
}
for(i=0;i<r;i++){
for(j=i+1;j<r;j++){
s=0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli>> mat;
typedef vector<unordered_map<lli,lli>> graph;
const lli mod = 1000000007;
lli n;
vll a;
lli b;
lli factorial(lli n){
static lli dp[100000];
if(dp[n]) return dp[n];... | 0 | 53,372,679 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 1000005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x) ... | #include <iostream>
using namespace std;
int main()
{
int n, m;
char cstr[100][2], str[1000000];
cin >> n;
while (n != 0){
for (int i = 0; i < n; i++) cin >> cstr[i][0] >> cstr[i][1];
cin >> m;
for (int i = 0; i < m; i++){
cin >> str[i];
for (int j = 0; j < n; j++){
if (str[i] == cstr[j][0]){
s... | 0 | 28,530,511 |
#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#define EPS (1e-... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | 0 | 1,391,347 |
#define _GLIBCXX_DEBUG
#include <iostream>
#include <vector>
using namespace std;
using vi = vector<int>;
int main(void){
int n, m;
cin >> n >> m;
vi AC(n+1, 1), WA(n+1);
int ac = 0, wa = 0;
for(int i=0; i<m; i++){
int p;
string s;
cin >> p >> s;
if(AC[p] == 0) contin... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int INF=1e9;
typedef pair<int,int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
vector<vector<bool>> use... | 0 | 95,089,769 |
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1000000007;
const long long int big = 2999999999999999999;
const long long int small = -2999999999999999999;
#define ll long long int
#define pb(a) push_back(a)
#define vll vector<long long int>
#define loop(i, n) for(long long int i=1;i<=n;i++)
#... | #include "bits/stdc++.h"
using namespace std;
#define int long long
class CMultipleGift {
public:
void solve(std::istream &in, std::ostream &out) {
int x, y;
in >> x >> y;
int t = x;
int ans = 0;
while (t <= y) {
ans++;
t *= 2;
}
out << ans << endl;
}
};... | 0 | 98,959,405 |
#include <iostream>
#include <cmath>
#include <stdio.h>
using namespace std;
int main(){
double deg;
double PI = acos(-1);
double rad;
double a, b;
cin >> a >> b >> deg;
rad = PI / 180 * deg;
printf("%.8lf\n", a * b * sin(rad) / 2);
printf("%.8lf\n", a + b + sqrt(a*a + b*b - 2*a*b*cos(rad)));
printf("%.8lf\n",... | #include <stdio.h>
#define GRAY 2
#define WHITE 1
#define BLACK 3
#define INF -1
int n,color[110],d[110],Q[110],adj[110][110];
int head=0,tail=0;
int judge(){
if(tail==head) return 1;
return 0;
}
void enQ(int s){
Q[tail]=s;
if(tail==110)tail=0;
else tail++;
}
int deQ(){
int a;
a=Q[head];
if(head==100... | 0 | 44,640,035 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
char c;
scanf("%d %c %d", &a, &c, &b);
if (c=='+') cout << a+b << "\n";
else cout << a-b << "\n";
} | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin>>s;
int n=s.size();
int a=0,b=0;
rep(i,n){
if(i%2==1){
... | 0 | 26,397,152 |
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<deque>
#include<map>
#include<queue>
using namespace std;
#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define pb push_back
#define fi first
#define se second
type... | #define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <sstream>
#include<set>
#include<stack>
#include<t... | 0 | 78,007,801 |
#include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>
#include <numeric>
using namespac... | 0 | 57,001,020 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, n) for (int i = 1; i < (int)(n+1); i++)
#define rep4(i, s, n) for (int i = (s... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
vector<vector<char>> s(h, vector<char>(w));
for(int i=0;i<h;i++)for(int j=0;j<w;j++) cin >> s[i][j];
vector<vector<pair<int, int>>> vec(h, vector<pair<int, int>>(w, {0,0}));
for(int i=0;i<h;i++){
int count =... | 0 | 64,883,766 |
#include<stdio.h>
int main(void) {
int n, s[100] = {0}, max, min,sum,count;
while(1){
sum = 0;
count = 0;
scanf("%d", &n);
if (n== 0) break;
for (int i = n; i > 0; i--) {
scanf("%d", &s[i]);
if (i == n) {
max = s[i];
min = s[i];
}
if (max < s[i]) max = s[i];
if (min > s[i]) min = s[i]... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#define llint long long
using namespace std;
typedef pair<llint, llint> P;
string s;
llint x, y;
vector<llint> vecx, vecy;
bool dp[8005][16005];
llint Zero = 8002;
bool check(vector<llint> vec, llint x)
{
if(x < -8000 || x ... | 0 | 53,381,642 |
#include <iostream>
#include <cstdio>
using namespace std;
string s = "ACGT";
char x;
int main() {
int i;
cin >> x;
for(i=0; i<4; i++) if(s[i]==x) break;
cout << s[3-i];
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | 0 | 36,535,611 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <string.h>
#include <tuple>
#include <vector>
#define REP(i,x) for(int i{ 0 }; i < (int)(x); i++)
#define REP... | #include <iostream>
using namespace std;
int main()
{
long long n, k;
cin >> n >> k;
long long a = n / k;
long long c = a * a * a;
if (k % 2 == 1)
cout << c << endl;
else
{
long long b = n / (k / 2) - a, d = b * b * b;
cout << c + d << endl;
}
return 0;
} | 0 | 35,911,100 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | #include <bits/stdc++.h>
#include <functional>
#include<stdio.h>
using namespace std;
#define ll unsigned long long int
#define dd long double
#define pb push_back
#define pf push_front
#define pi pair<ll,ll>
#define vi vector<ll>
#define vpi vector<pi>
#define mi ... | 0 | 71,484,004 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,k,ans=0,aaa=0;
cin >> n >> k;
map<long,long> x;
map<long,long> y;
vector<long> data(n);
vector<long> a(n);
for(long i=0;i<n;i++) cin >> a[i];
for(long i=0;i<n;i++) {
x[aaa]++;
data[i]=aaa;
if(i+1>=k) y[data[i-k+1]]++;
aaa=... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 | 85,861,801 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) {
cin >> a.at(i);
a.at(i)--;
}
int ans = 0;
rep(i,n) if (i == a.at(a.at(i))) an... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define Br cout<<endl
#define int long long
#define fe first
#define se second
#define double long double
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define PT(x) cout << (x) << endl
#define last(x) prev(x.end())
#define PTT(x) c... | 0 | 81,853,777 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int num;
cin >> num;
for (int i = 0; i <= 100; i++) {
for (int j = 0; j <= 100; j++) {
if(i*4 + j*7 == num){
cout << "Yes";
return 0;
}
}
}
cout << "No";
} | #include <iostream>
#include <iomanip>
using namespace std;
const long INF = 1e9;
const long MOD = 1e9 + 7;
#define repi(i, n, init) for (int i = init; i < int(n); i++)
int main()
{
char a, b;
cin >> a >> b;
if (a == 'H')
{
cout << b << endl;
}
else if (b == 'H')
{
cout << 'D... | 0 | 40,132,553 |
#include <iostream>
#include <fstream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <cctype>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cstring>
#include <string>
#include <queue>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <bitse... | #include <bits/stdc++.h>
using namespace std;
long long cnt,sum;
long long a[200005],b[200005];
vector<long long>v;
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
cin>>b[i];
for(int i=0;i<n;i++)
{
if(a[i]>=b[i])
v.push_back(a[i]-b[i]);
else
{
sum+=(b[i]-a[i]);
... | 0 | 27,313,675 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int INF = 100000000;
int main(){
ll n,k;cin>>n>>k;
ll a,b,c,ans=0;
vector<bool> visit(k,false);
ll spare;
for(a=1;a<=n;a++){
if(a%k>=0){spare=k-(a%k);}
else{spare=-(a%k);}
if(!(visit[spare]) && (2*a)%k==0)... | 0 | 20,909,582 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define RNG(i,from,to) for(int i=(from); i<(int)(to); i++)
#define gcd(i,j) __gcd((i), (j))
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<ll> vecll;
template<typename S, typename T> string to_string(pair<S, T... | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using std::string;
using std::vector;
us... | 0 | 67,309,714 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | #include <iostream>
using namespace std;
int main()
{
int n, s, count, max, min, sum, adv;
while(cin >> n){
if(n == 0){
break;
}
min = 1001;
max = -1;
sum = 0;
count = 0;
while(count < n){
count++;
cin >> s;
sum += s;
if(s < min){
min = s;
}
... | 0 | 21,649,679 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define IFOR(i, m, n) for(ll i = n - 1; i >= m; i-- )
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define FOREACH(x,a) for(auto& (x) : (... | #include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
int main() {
string s; cin >> s;
in... | 0 | 68,991,285 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int n, k;
cin >> n >> k;
int t = 1;
for (int i = 0; i < n; i++... | #include "bits/stdc++.h"
using ll = long long;
using namespace std;
int get(vector <int> &v, int d) {
int ans = 0;
for(auto &e: v) {
ans += (e - d) * (e - d);
}
return ans;
}
void solve() {
int n;
cin >> n;
vector <int> v(n);
for(int i = 0; i < n; i++) {
cin >> v[i];
}
int sum ... | 0 | 63,541,702 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
#define intt long long
intt N;
intt func(intt& p) {
return p * (p - 1) / 2;
}
int main() {
std::cin >> N;
intt ans = 0;
std::vector<intt> A(N);
std::map<intt, intt> ... | #include <bits/stdc++.h>
#define fastIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
using ll = long long;
const int INF = 1e8+10;
int n;
int a[3];
vector<int> v,ans(3,INF);
bool ok(int i,int j,int k){
for(int u=0;u<n;++u){
bool x = (((1<<u)&i) != 0);
bool y = (((1<<u)&j) != 0);
... | 0 | 11,912,599 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
sort(all(s));
cout << (s == "ab... | #include <bits/stdc++.h>
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
using namespace std;
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inline void print(const std::vector<T>& rhs){
std::cout<<" = [ ";
for(uint i=0; i<... | 0 | 80,755,329 |
#include <iostream>
using namespace std;
string ToMCXI(int v) {
char c[5] = "ixcm";
int k[4] = {1, 10, 100, 1000};
string ret = "";
for (int i = 3; i >= 0; --i) {
int d = v / k[i] % 10;
if (d > 1) ret += (char)(d + '0');
if (d > 0) ret += c[i];
}
return ret;
}
int FromMCXI(string mcxi) {
int ret = 0;
for ... | #pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#define rep2(i, a, b) for... | 0 | 75,954,860 |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
r... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <numeric>
#define... | 0 | 58,791,999 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
int main() {
int n,m; cin >> n >> m;
vector<string> a(n),b(m);
rep(i,n)cin >> a[i];
rep(i,m)cin >> b[i];
int d=n-m,cnt=0;;
for(int i=0;i<d+1;i++){
for(int j=0;j<d+1;j++){
bool flag=1;
if(a[i][j]==b[0][0]){
... | #include <iostream>
#include <string>
const int SURFACE_NUM = 6;
enum Direction{TOP, SOUTH, EAST, WEST, NORTH, BOTTOM};
class Dice{
public:
void roll(char op);
int top(){
return label_value[label_dir[TOP]];
}
Dice(int label_value[SURFACE_NUM]);
int getright(int top, int front);
void rese... | 0 | 32,233,345 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y;
cin >> x >> y;
long long ans = 0;
if (y - x >= 0) {
ans = min(y - x, abs(abs(y) - abs(x)) + 1);
}
else {
if (x * y <= 0) {
ans = abs(abs(y) - abs(x)) + 1;
}
else {
a... | #include <iostream>
#include <map>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <utility>
#include <stdlib.h>
#include <fstream>
#include <vector>
#include <iomanip>
#include <algorithm>
#include <stack>
#include <assert.h>
#include <unordered_map>
#include <unordered_set>
#include <math.h>... | 0 | 75,928,047 |
#include<algorithm>
#include<bitset>
#include<climits>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 | 79,170,088 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
using namespace std;
typedef vector<int> vi;
typedef vector< vi > vvi;
int main() {
int m, f, r, S;
while (cin >> m >> f >> r) {
S = m + f;
if(m == -1 && f == -1 && r == -1){
break;
}
else {
if (m == -1 || f == -1 || S < 30) {
... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=mod*mod;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
struct node{ll x, y, cost;};
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_... | 0 | 84,400,523 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<climits>
#include<iostream>
#include<sstream>
#include<utility>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
#include<set>
#include<stack>
#include<functional>
using namespace std;
typedef long long ll;
typedef pair<int,... | #include<bits/stdc++.h>
using namespace std;
#define Boost() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long long int lli;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
t... | 0 | 68,326,176 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[20];
int main() {
int n,k;
cin >> n >> k;
ll ans = 1e18;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < (1 << n); i++) {
int cnt = 0;
for (int j = 0; j < n; j++) {
if ((i >> j) & 1) cnt... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
struct Dice
{
vector<int> faces;
Dice(vector<int>& f)
: faces(f) {}
int top() {
return faces[0];
}
int front() {
return faces[1];
}
int at(int n) {
return faces[n];
}
void rol... | 0 | 5,374,701 |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(x,y,h,w) x >= 0 && x < h && y >= 0 && y < w
#define in... | #include <iostream>
#include <sstream>
#include <algorithm>
#include <vector>
#include <tuple>
using namespace std;
int main(int argc, char* argv[]) {
while (true) {
int n = -1, m = -1, a, b, c;
cin >> n >> m;
if (n <= 0 || m <= 0) break;
vector<tuple<int, int, int>> edges;
vector<vector<int>> dist(n, vector... | 0 | 20,635,852 |
#include <iostream>
#include <cstring>
using namespace std;
int a[200005];
int dp[1 << 26];
const int INF = 1e9;
int main() {
string s;
cin >> s;
for(int i = 0; i < s.size(); i++) {
a[i+1] = (1 << (s[i] - 'a')) ^ a[i];
}
for(int i = 0; i < (1 << 26); i++) dp[i] = INF;
dp[0] = 0;
int tmp;
for(int i =... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(... | 0 | 84,913,904 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s,d,f; cin>>s>>d>>f;
int sa = 'A'-'a';
cout<<(char)(s.at(0)+sa)<<(char)(d.at(0)+sa)<<(char)(f.at(0)+sa)<<endl;
} | #include <bits/stdc++.h>
#define ll long long
#define rep(i,a,b) for(long long i=a; i<b; i+=1)
#define repr(i,a,b) for(long long i=a; i<=b; i+=1)
#define vec vector<ll>
#define map map<string,int>
#define repa(p,A) for(auto p:A)
#define pb push_back
#define sort(a) sort(a.begin(),a.end())
#define reverse(a) reverse(a.b... | 0 | 90,290,512 |
#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#include<map>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vec... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)... | 0 | 33,041,840 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int gcd(int a, int b){
while(b != 0){
int c = a % b;
a = b;
b = c;
}
return a;
}
int main(){
int n, sx, x;
cin >> n >> sx >> x;
int ans = abs(x - sx);
sx = x;
for(int i = 1; i < n; i++){
c... | #include<bits/stdc++.h>
using namespace std;
int main(){
int m = 1000000007;
int r,c;
cin>>r>>c;
vector<vector<char>> v (r,vector<char>(c,'.'));
vector<vector<long long>> dp(r,vector<long long>(c,0));
for(int i=0; i<r; i++){
for(int j=0; j<c; j++){
cin>>v[i][j];
}
... | 0 | 92,593,021 |
#include <iostream>
using namespace std;
int main(void){
int A,B;
cin >> A >> B;
string ans;
if(A <= 8 && B <= 8){
ans = "Yay!";
}
else{
ans = ":(";
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B, C, K, cnt = 0;
cin >> A >> B >> C >> K;
while(A >= B)
{
cnt += 1;
B *= 2;
}
while(B >= C)
{
cnt += 1;
C *= 2;
}
if(cnt <= K) cout << "Yes" << endl;
else
cout << "No" << en... | 0 | 26,822,164 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll N,M,R;
cin >> N >> M >> R;
vector<ll> r(R);
rep(i,R){
cin >> r[i];
r... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using Grid= vector<vector<char>>;
using vin= vector<int>;
using ll=long long;
using vll= vector<ll>;
using vbl=vector<bool>;
using vch=vector<char>;
using pnn=pair<int ,int>;
#define ft first
#define sd second
#define fn front
#define pb p... | 0 | 2,381,690 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N_MAX = 100002;
int n;
ll a[N_MAX];
vector <int> edges[N_MAX];
int root;
bool ok = true;
ll dfs (int u, int parent = -1)
{
if(edges[u].size() == 1)
return a[u];
ll sum = 0;
ll mx = 0;
for(int v : edges[u])
if(v... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 0 | 36,027,675 |
#include<cstdio>
main(){
int w,h,x,y,r;
scanf("%d%d%d%d%d",&w,&h,&x,&y,&r);
printf("%s\n",((x-r<0||x+r>w||y-r<0||y+r>h)?"No":"Yes"));
} | #include<bits/stdc++.h>
using namespace std;
int main ()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a,b,c;
cin>>a>>b>>c;
if(a==b)
cout<<c<<endl;
else if(b==c)
cout<<a<<endl;
else
cout<<b<<endl;
return 0;
} | 0 | 93,398,817 |
#include<stdio.h>
int main(){
int N,sum=0,summ=0;
scanf("%d", &N);
for(int i=0;i<N;i++){
sum+=1;
summ+=sum;
}
printf("%d", summ);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(ll i = 0; i < n; i++)
const ll INF = 1LL << 60;
int main(){
double A, B, X; cin >> A >> B >> X;
double volume = A * A * B;
if(X < volume / 2){
... | 0 | 3,090,535 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
int main(){
string s, t; cin >> s >> t;
int n=s.size();
vector<set<char>> key(26);
for(int i=0; i<n; i++)
key[t[i]-'a']... | #include <bits/stdc++.h>
#include <stdlib.h>
#include <fstream>
#include <iostream>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> llP;
ll mod(ll a, ll b){
ll ret=a%b;
if(ret<0) ret+=b;
return ret;
}
ll modpow(ll a,ll b,ll c){
ll res=1;
while(b>0){
if(b&1) res=mod(... | 0 | 94,746,890 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int i, n, sum=0, cnt=0;
vector <int> a;
cin >>n;
for(i=1;i<=n;i++){
sum=sum+i;
a.push_back(i);
cnt++;
if(sum>=n) break;
}
for(auto ans : a){
if(sum-n!=ans) cout << ans <<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define LL long long
using namespace std;
const int maxn = (int)1e5 + 10;
int r[maxn], g[maxn], c[maxn];
int cmp(int a, int b){
return a > b;
}
int main(){
ios::sync_with_stdio(false);
int X, Y, A, B, C; cin>>X>>Y>>A>>B>>C;
priority_queue <int> cll;
for(int i = 1; i <= A; i+... | 0 | 40,746,121 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.