code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rrep(i, n) for(int i=n-1; i>=0; i--)
#define FOR(i, a, b) for(int i=a; i<b; i++)
#define ALL(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> p... | 0 | 9,762,934 |
#include <stdio.h>
int main(){
int x,sum;
sum=1;
while(sum!=0){
sum=0;
while((x=getchar())!='\n'){
sum+=x-'0';
}
if(sum==0){
break;
}
printf("%d\n",sum);
}
return 0;
} | #include<iostream>
#include<math.h>
#include<stdlib.h>
using namespace std;
#define MAX_N 1000001
int main(){
int *count;
count=(int *)malloc(sizeof(int)*MAX_N);
int cnt=0;
bool *a;
a= (bool *)malloc(sizeof(bool)*MAX_N);
a[1]=true;
for(int i=2;i<MAX_N;i++){
count[i]=cnt;
if(a[i])continue;
cnt++;
count[i]... | 0 | 78,819,225 |
#include <iostream>
#include <map>
#include <vector>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <climits>
#include <stack>
#include <queue>
#include <set>
#include <cctype>
#include <bitset>
#include <type_traits>
#include <list>
using namespace std;
#define REP(i, n) for (int i... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <chrono>
#include <ctime>
#include <queue>
#include <math.h>
#include <deque>
#include <stack>
#include <iomanip>
#include <assert.h>
#include <stdio.h>
#... | 0 | 73,060,732 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using pii = pair<int, int>;
using vi = vector<int>;
using vii = vector<vi>;
using ll = long long;
int main() {
int n; cin >> n;
vector<ll> a(n);
rep(i... | #include<bits/stdc++.h>
#define INFTY 10000000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const int MOD=1000000007;
const int di[4] = {-1,0,1,0};
const int dj[4] = {0,-1,0,1};
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
int main(){
int n,k;cin>>n>>k;
int nu... | 0 | 91,368,449 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <set>
#include <queue>
#include <map>
#include <stack>
using namespace std;
#define mod 1000000007
#define ten5 100005
#define ten52 200005
#define ten6 1000005
#define PI 3.1415... | #include<iostream>
#include<vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> vec(n);
for ( int i = 0; i < n; ++i) {
cin >> vec.at(i);
}
long long count1 = 0;
for ( int i = 0; i < n; ++i) {
for ( int j = i+1; j < n; ++j) {
if ( vec.at(... | 0 | 6,096,057 |
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
const double PI = 3.14159265358979323846;
int map[16][16];
inline int get(int x, int y) {
if (map[x][y] == -1) {
return -1;
}
int r = 0;
if ((0 < x) && (map[x - 1][y] != -1)) {
r += map[x - 1][y];
}
if... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long n, x, m;
cin >> n >> x >> m;
vector<long> ids(m, -1);
vector<long> xs;
long len = 0;
long tot = 0;
while (ids[x] == -1)
{
xs.push_back(x);
ids[x] = len;
len++;
tot += x;
x = (x * x) % ... | 0 | 40,290,829 |
#include <bits/stdc++.h>
using namespace std;
#ifndef aa
#define trace(...)
#define endl '\n'
#endif
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define fi first
#define se second
#define int long long
typedef long long ll;
typedef long double ld;
#define double long double
#define pii pair<int,i... | #include <iostream>
using namespace std;
int main(){
int n;
int a , b , c , d;
int ans , count;
while(cin >> n){
if(n == 0) break;
count = 0;
for(a = 0; a <= 9; a++){
for(b = 0; b <= 9; b++){
for(c = 0; c <= 9; c++){
for(d = 0; d <= 9; d++){
ans = a + b + c + d;
if(ans == n){
co... | 0 | 11,100,411 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> A(N);
for(int i=0; i<N; i++) cin >> A[i];
sort(A.begin(), A.end());
double ans = (A[0] + A[1]) / 2.0;
for(int i=2; i<N; i++) {
ans = ans / 2.0 + A[i] / 2.0;
}
cout <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n;
cin >> n;
vi a(n+1);
rep(i, n) cin >> a.at(i+1);
vector<ll> dp(n+1);
dp.at(0) = 1... | 0 | 89,135,362 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, Y;
cin >> N >> Y;
vector<int> ijk(3);
int res1k = -1, res5k = -1, res10k = -1;
for (int i = 0; i <= N; i++) {
for (int j = 0; i + j <= N; j++) {
int k = N - i - j; int money = 10000 * i + 5000 * j + 1000 * k;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<ll, ll>;
const int MAXE { 3 }, MAXN { 110 }, MAXK { 4 };
const ll MOD { 1000000007 }, oo { 1LL << 62 };
ll st[MAXN][MAXE][MAXK];
ll solve(const string& s, int K)
{
int N = s.size();
vector<int> ds(N);
for (int i = 0; i < N; ... | 0 | 29,696,435 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main() {
int n, ans, mini = 100000000;
cin >> n;
vector<int> x(n);
rep(i, n) cin >> x[i];
rep(i, 100) {
int dist = 0;... | #include<iostream>
using namespace std;
typedef struct{
char mark;
int value;
int order;
}t;
int main(){
int N,minj,f=0;
t C1[36],C2[36],a;
cin>>N;
if(N>0 && N<37){
for(int i=0;i<=N-1;i++){
while(1){
cin>>C1[i].mark;
if(C1[i].mark!='D'&&C1[i].mark!='C'&&C1[i].mark!='S'&&C1[i].mark!='... | 0 | 83,211,873 |
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#define pb push_back
#define mp make_pair
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef unsigned long long ull;
typedef long long ll;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector <string> w(n,"");
for(int i = 0; i < n; i++){
cin >> w[i];
if(i!=0){
if(w[i-1].back()!=w[i][0]){
cout << "No" << endl;
return 0;
}
}
}
... | 0 | 71,574,346 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int x;
cin >> x;
queue<ll> q;
for(int i = 1; i < 10; i++) {
q.push(i);
}
if(x<10){
cout << x << endl;
return 0;
}
x -= 9;
ll ans=0;
while(1) {
ll s=q.front();
... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main(){
string card[36],card2[36],tem;
int n,ans=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>card[i];
card2[i]=card[i];
}
for(int i=0;i<=n-1;++i){
for(int j=n-1;j>=i+1;j--){
if(card[j][1]-'0'<card[j-1][1]-'0'){
swap(card[j]... | 0 | 83,303,966 |
#include <bits/stdc++.h>
#define ll long long
#define pq priority_queue
using namespace std;
const ll INF=(ll)1e9;
const ll MOD=(ll)1e9+7;
const ll MAX=510000;
vector<int> dx={1,0,-1,0},dy={0,1,0,-1};
template<class T> inline bool chmax(T& a, T b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> inline bool ... | #include <iostream>
#include <limits>
#include <algorithm>
using namespace std;
int c[100][100];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, t;
int M[101];
cin>>n;
cin>>M[0]>>M[1];
for(int i=2; i<=n; i++) {
cin>>t>>M[i];
}
for(int l=1; l<n; l++) {
for... | 0 | 82,697,301 |
#include<bits/stdc++.h>
using ll = long long;
const ll INF_LL = 1000000000000;
#define fir first
#define sec second
using namespace std;
int main()
{
int n,k;
cin >> n >> k;
vector<vector<int>> hen(n);
if(k > (n - 1) * (n - 2) / 2){cout << -1 << endl; return 0;}
for(int i = 1; i < n; i++){
h... | #include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#in... | 0 | 27,712,504 |
#include <iostream>
using namespace std;
static const int MAX=100;
static const long long INFTY=(1LL<<32);
int n;
long long d[MAX][MAX];
void floyd()
{
for(int k=0;k<n;k++)
{
for(int i=0;i<n;i++)
{
if(d[i][k]==INFTY) continue;
for(int j=0;j<n;j++)
{
... | #include<iostream>
using namespace std;
int main()
{
int g[100][100];
int n;
for(int i=0; i<100; i++)
{
for(int j=0; j<100; j++)
{
g[i][j]=0;
}
}
cin>>n;
int x,y,z;
for(int i=0; i<n; i++)
{
cin>>x>>y;
for(int j=0; j<y; j++)
{
cin>>z;
g[x-1][z-1]=1;
}
... | 0 | 1,291,250 |
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using n... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define Check system("pause")
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
int w[100005],d[100005];
int main()
{
ios::sync_with_stdio(fa... | 0 | 33,226,676 |
#include <iostream>
#include <vector>
#include <string.h>
#include <stack>
#include <queue>
#include <algorithm>
#include <climits>
#include <cmath>
#include <map>
#include <set>
#include <assert.h>
#include <sstream>
#define REP(i,n) for(ll i=0;i<(n);i++)
#define MOD 1000000007
#define int long long
#ifdef int
const l... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
#include<queue>
using namespace std;
#define int long long
#define double long double
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) string s;cin>>s;
#de... | 0 | 72,774,263 |
#include <cstdio>
#include <cstring>
int main() {
const int coin[] = { 500, 100, 50, 10, 5, 1};
int n = 0;
while (scanf("%d", &n)) {
if (n == 0) return 0;
int c = 0;
int o = 1000 - n;
while (o != 0) {
for (int i = 0; i < 6; ++i) {
if (coin[i] <= o)... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | 0 | 74,869,283 |
#include <bits/stdc++.h>
using namespace std;
typedef long int lint;
typedef long long int llint;
typedef pair<int, int> pii;
typedef pair<int, string> pis;
typedef pair<long, long> pll;
#define EACH(i, c) for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define FOR... | #include <iostream>
#include <stack>
#include <queue>
using namespace std;
#define MAX 100
#define WHITE 0
#define GRAY 1
#define BLACK 2
int T;
int N;
int M[MAX][MAX];
int C[MAX],D[MAX];
void bfs(int s)
{
queue<int> *q = new queue<int>;
q->push(s);
D[s] = 0;
C[s] = GRAY;
while(!q->empty())
{
... | 0 | 87,575,337 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
#define REP(i,n) for(int i = 0; i < n; i++)
#define RREP(i,n) for(int i = n - 1; i >= 0; i--)
#define ALL(v) v.begin(),v.... | #include<iostream>
using namespace std;
long int l[1000][3];
void swap(int a, int b, int c){
int buf = l[c][a];
l[c][a] = l[c][b];
l[c][b] = buf;
}
void sort(int c){
for(int i = 0; i < 2; i++){
for(int j = i; j < 2; j++){
if(l[c][j] > l[c][j+1]) swap(j,j+1,c);
}
}
}
int main(){
int buf;
cin >> buf;
for(int... | 0 | 93,885,536 |
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <cassert>
#include <vector>
#include <array>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <numeric>
using ll = long long;
using namespace ... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
using ll = long long;
using ld = long double;
#define vl vector<long long>
#define vvl vector<vector<long long>>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
using pll = pair... | 0 | 44,083,200 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define print(A,x,n) rep(i,0,n){cout<<(i ? " ":"")<<A[i]x;}cout<<endl;
#define pprint(A,y,m,n) rep(j,0,m){print(A[j],y,n);}
const long mod=1e9+7;
const int size=1e5;
const int inf=1e9;
int main(){
int N,M;cin>>N>>M;
int s[N],t[M];
r... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define MAX 1005
#define MOD 1000000007
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi 3.14159265358979323846
#define Q ll _; cin >> _; while(_--)
#define endl "\n"
#define flush ff... | 0 | 44,302,759 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h,n;
cin >> h >> n;
vector<int>a(n);
for(int i = 0;i<n;i++) cin >> a.at(i);
int sum = 0;
for(int i = 0;i < a.size();i++) sum += a.at(i);
if(sum >= h) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0... | 0 | 94,485,423 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | #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;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
ll n, m;
ll a[2005], b[2005];
ll dp[2005][2005], sum[2005][2005];
int main() {
cin.tie(0);
cou... | 0 | 60,795,894 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
typedef pair<ll,int> P;
int main(){
int n,m,x,y;
cin>>n>>m>>x>>y;
int a=-100;
rep(i,0,n){
int cur;
cin>>cur;
a=max(a,cur);
}
int b=100;
rep(i,0,m){
int cur;
cin>>cu... | #include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ub upper_bound
#define lb lower_bound
#define isrt insert
#define clr clear
#define rsz resize
#define ff first
#define ss ... | 0 | 61,653,339 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repm(i,m,n) for(ll i=m;i<n;i++)
#define max(a,b) (((a)>(b))?(a):(b))
#define min(a,b) (((a)<(b))?(a):(b))
#define YesNo(a) (a)?cout<<"Yes"<<endl:cout<<"No"<<endl
#define YESNO(a) (a)?cout<<"YES"<<endl:cout<<"NO"<<endl
#define INF... | #include <iostream>
using namespace std;
int main(int argc, const char * argv[])
{
int a[10005];
int i,j;
i=0;
a[0] = 1;
while( a[i] != 0)
{
i += 1;
cin >> a[i];
}
for(j=1;j<i;j++)
{
cout << "Case " << j << ": " << a[j] << endl;
}
return 0;
} | 0 | 8,495,472 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef long long ll;
typedef long double ld;
int main()
{
ll x,y; cin >> x >> y;
vector<ll> a;
int p = 0;
while (x * (ll)pow(2 , p) <= y)
{
a.push_back(x * (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_temp>
using smaller_queue = priority_queue<Q_temp, vector<Q_temp>, greater<Q_temp>>;
const ll MOD = (ll)(1e9 + 7);
const int INF = (int)1e9;
const ll... | 0 | 28,753,132 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int n,m;
int x;
cin >> n >> m;
rep(i,m){
cin >> x;
if(n - x < 0) {
cout << -1 ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(int)(a); i++)
typedef long long ll;
template<typename T>
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(cons... | 0 | 42,291,328 |
#include <bits/stdc++.h>
#define FOR(i,l,r) for(size_t i=(l);i<(r);++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
using namespace std;
const ll INF=1ll<<32;
int main(){
ll v,e;
cin>>v>>e;
ll G[v][v];
rep(i,v){
rep(j,v){
G[i][j]=INF;
if(i==j)G[i][j]=0;
}
}
rep(i,e){
... | #include <iostream>
#include <fstream>
#include "bits/stdc++.h"
#define REP(i,x,y) for(int i=(x);i<(y);i++)
#define RREP(i,x,y) for(int i=(y)-1;i>=(x);i--)
#define all(x) (x).begin(),(x).end()
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string ... | 0 | 41,949,859 |
#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... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<P,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout<<v<<endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th(... | 0 | 11,020,219 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX 9223372036854775807
#define MOD 1000000007
int main(void)
{
int a, b, m;
cin >> a >> b >> m;
vector<int> A(a), B(b);
rep(i, a) cin >> A.at(i);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, e) for (int i = s; i < e; ++i)
#define sort_(a) stable_sort(a.begin(), a.end())
#define rsort(a) stable_sort(a.rbegin(), a.rend())
#define sum(a) accumulate(a.begin(), a.end(), 0LL)
#define join(a, d) accumulate(a.begin() + 1, a.end(), a[0], [](string s, s... | 0 | 62,111,641 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define per(i,n) for(int i = n-1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const long long mod = 1000000007LL;
int main() ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int INT_INF = 2147483647;
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;... | 0 | 66,604,948 |
#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>
#include <vector>
#include <string>
#include <numeric>
#include <tuple>
#include <algorithm>
#include <array>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(decltype(n) i=0; i<n; ++i)
inline constexpr ll Inf = (1ULL << 62) -1;
templat... | 0 | 56,971,443 |
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define pb push_back
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
double r,g;
cin>>r>>g;
cout<<2*g-r<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | 0 | 69,841,978 |
#include <cstdio>
#include <vector>
#include <forward_list>
#include <queue>
using namespace std;
int cnt = 0;
int cntp = 0;
queue<int> source;
vector<int> pre;
vector<int> in;
class Edge{
public:
int v;
int w;
Edge(int vi,int wi):v(vi),w(wi){;}
};
class Graph{
public:
int V;
int E;
vector<forward_lis... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> G(n+1);
for (int i=0; i<n; i++) {
int u,k;
cin >> u >> k;
for (int j=0; j<k; j++) {
int v;
cin >> v;
G[u].push_back(v);
}
}
vector<int> c(n+1,-1)... | 0 | 3,381,681 |
#include<iostream>
using namespace std;
int main(){
int siharai=1;
int oturi;
int a;
while(siharai!=0){
cin>>siharai;
oturi=0;
if(siharai==0)
break;
oturi=1000-siharai;
if(oturi>500){
a+=1;
oturi-=500;
}
while(oturi>=100){
a+=1;
oturi-=100;
}
while(oturi>=50){
a+=1;
oturi-=50;
}
while(oturi>=10){
a+=1;
oturi-=10;
}
whi... | #include <iostream>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <climits>
#include <numeric>
#include <cmath>
#include <queue>
#include <sstream>
#include <string.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v(n + 2, 0... | 0 | 32,651,043 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
typedef pair<int,ii> ti;
const int INF = 1e9;
const int MN = 110;
int g[MN][MN];
int dx[2] = {1,0};
int dy[2] = {0,1};
int dist[MN][MN];
int main() {
ios::sync_with_stdio(0);cin.tie(0);
int h,w;
cin >> h >> w;
for(int i=0;i<h;i++) {
string s;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define pi 3.14159265359
#define all(i) i.begin(),i.end()
using namespace std;
const long long INF=1e9+7;
const string alp="abcdefghijklmnopqrstuvwxyz";
const string ALP="ABCDEFGHIJK... | 0 | 73,230,316 |
#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;
void solve() {
int W, H, N;
cin >> W >> H >> N;
int x1 = 0, y1 = 0;
int x , y , a;
for (int i = 1; i <= N; i++) {
cin >> x >> y >> a;
if(a == 1 && x1 < x) {
x1 = x;
}
else if (a == 2 && W > x) {
W = x;
}
else if (a == 3 && y1 < ... | 0 | 13,808,384 |
#include<iostream>
#include<algorithm>
using namespace std;
int SelectionSort(int A[], int N){
int cnt = 0;
for(int i = 0; i < N; i++){
int minj = i;
for(int j = i; j < N; j++){
if(A[j] < A[minj]){
minj = j;
}
}
swap(A[i],A[minj]);
if(i != minj) cnt++;
}
return cnt;
}
int... | #include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RRE... | 0 | 50,976,313 |
#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>
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A, B, C, N, M ,K;
int sum = 0;
int t = 0;
char s, s1;
cin >> N;
vector<char> S(N);
for(int i = 0; i < N; i++){
cin >> S.at(i);
}
cin >> K;
s1 = S.at(K-1);
for(int i = 0; i < N; i++){
if(S.at(i) != s... | 0 | 68,387,920 |
#include <iostream>
using namespace std;
int N, A[10010];
int min(int *a, int size) {
int min = a[0];
for(int i=0;i<size;i++){
if(a[i]<min){
min = a[i];
}
}
return min;
}
int max(int *a, int size) {
int max = a[0];
for(int i=0;i<size;i++){
if(a[i]>max){
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
const int MAX = 100;
const long long INF = 1e10;
long long M[MAX][MAX];
int main(){
int V, E;
cin >> V >> E;
rep(i,V){
rep(j,V){
if(i == j){
M[i][j] = 0;
}else{
... | 0 | 1,120,003 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int n,m;
int main(void){
cin>>n>>m;
cout<<max(n-m,0)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 110;
char s[N][N];
int n, m;
int dp[N][N];
int main() {
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; ++i)
scanf("%s", s[i] + 1);
dp[1][1] = s[1][1] == '#';
for(int i = 1; i <= n; ++i) {
f... | 0 | 45,534,660 |
#include <bits/stdc++.h>
using namespace std;
using nagai = long long;
#define sz(x) int((x).size())
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
cout<<(n-2)*180<<'\n';
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> ... | 0 | 95,869,333 |
#include <iostream>
using namespace std;
int main(void)
{
ios_base::sync_with_stdio(false);
int A[10001]={};
int n,num;
cin >> n;
for(int i=0;i<n;i++){
cin >> num;
A[num]+=1;
}
for(int i=0;i<n;i++){
if(0<A[i]){
cout << i;
A[i]-=1;
break;
}
}
for(int i=0;i<10001;i++){
if(0<A[i]){
cout << ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, a) for (int i = 0; (i) < (int) (a); (i)++)
#define reps(i, a, b) for (int i = (int) (a); (i) < (int) (b); (i)++)
#define rrep(i, a) for (int i = (int) a-1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int) (a)-1; ... | 0 | 37,664,237 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
constexpr int NMAX = 2010;
ll _binom[NMAX][NMAX];
ll binom(ll n, ll r) {
if (n < 0 || r < 0 || r > n) return 0;
return _binom[n][r];
}
int main() {
for (int i = 0; i < NMAX; ++i) {
_binom[i][0] = _bino... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(), (x).end()
typedef int64_t ll;
typedef long double ld;
const int INF = 1e9;
const ld EPS = 1e-8;
int main(){
int N;
cin >> N;
vector<int> t(N), v(N);
REP(i, N) cin >> t[i];
REP(i, N) cin >> v[... | 0 | 40,982,986 |
#include<iostream>
using namespace std;
int main(){
int room[4][3][10]={0},b,f,v,r,n,k,j;
cin>>n;
for(int i=0;i<n;i++){
cin>>b>>f>>r>>v;
b=b-1;
f=f-1;
r=r-1;
room[b][f][r]=room[b][f][r]+v;
}
for(j=0;j<3;j++){
for(k=0;k<10;k++){
cout<<" "<<room[0][j][k];
if(k==9){
cout<<endl;
}
}
}
cout... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, n) for (ll i = (f)... | 0 | 28,894,475 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int n=s.size();
for(int i=0; i<n; i++){
if(i==3){
cout << s[i] << " ";
continue;
}
cout << s[i];
}
cout << endl;
} | #pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
const ll MOD = 1'000'000'007LL;
#define pb push_back
#define mp make_pair
#define all(x) ... | 0 | 76,289,194 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define rep1(i, n) for (int i = 1; i < int(n); ++i)
#define repx(i, x, n) for (int i = int(x); i < int(n); ++i)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(n) begin(n), end(n)
#define IN(a, x, b) ((... | #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... | 0 | 40,192,377 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#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
const int inf=1e9+7;
const ll mod=1e9+7... | #include<bits/stdc++.h>
using namespace std;
int main()
{ int a,b;
cin>>a>>b;
a%=2;
b%=2;
if(a==1&&b==1)cout<<"Odd";
else if(a==2&&b==2)cout<<"Even";
else cout<<"Even";
return 0;
} | 0 | 71,712,559 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int count[26] = {0};
for (int i = 0; i < N; i++) {
count[S[i] - 'a']++;
}
for (int i = 0; i < 26; i++) {
if (count[i] == 0) {
printf("%c\n", 'a' + i);
retu... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | 0 | 62,267,559 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
typedef long long ll;
using namespace std;
#define FALSE printf("false\n");
#define TRUE printf("true\n");... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 63,029,530 |
#include <iostream>
using namespace std;
int main() {
int m, f, r;
for (int i = 1;; i++) {
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1) break;
else if (m == -1 || f == -1) cout << "F\n";
else if ((m + f) >= 80) cout << "A\n";
else if ((m + f) >= 65 && (m + f) < 80) cout << "B\n";
else if ((m + f... | #include <stdio.h>
bool x(int n, char str[]){
for(int i=0;i<n/2;i++){
if(str[i] != str[i+n/2]){
return false;
}
}
return true;
}
int main(){
int n;
char str[102];
scanf("%d %s", &n,str);
(n % 2 == 0 && x(n,str)) ? puts("Yes") : puts ("No");
return 0;
} | 0 | 57,329,094 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define Rep(i, n) for(ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.... | #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=1LL<<61;
int main() {
ll n,k;
cin >> n >> k;
vec a(n);
for(ll i=0;i<n;i++) cin >> a[i];
sort(a.begin(),a.end());
ll l=-1,r=n;
while(... | 0 | 45,306,523 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI 3.14159265358979323846264338327950L
int n,m,x,cc,aa;
int a[12][12];
int c[12];
int tmp[12];
void solve(){
cin >> n >> m >> x;
for (int i = 0; i < n; i++)
{
cin >> cc;
c[i] = cc;
for (int j = 0; j < m; j++)
... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll Mod = 998244353;
const int MAX = 510000;
const double PI = 3.14159265358979;
const vector<int> dx = {1, 0};
const vector<int> dy = {0, 1};
int main() {
int N... | 0 | 56,335,983 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
int N, K;
cin >> N >> K;
vector<int> vec(N);
for (int i = 0; i < N; i++){
cin >> vec.at(i);
}
int cnt = 0;
for (int i = 0; i < N; i++){
... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( co... | 0 | 85,663,110 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <set>
#include <queue>
#include <stack>
#include <utility>
using namespace std;
typedef long long int ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#defin... | #include <iostream>
#include <string>
using namespace std;
int main(){
string str;
getline(cin,str);
int ro,so,i,j,k,b[1000]={},p=0;
while(str.size()!=1||str[0]!='.'){
ro=0;so=0;k=0;p=0;
for(i=0;i<str.size();i++){
if(str[i]=='(') {
ro++;
p++;
b[p]=1;
}
if(str[i]=='[') {
so++;
p++;... | 0 | 84,652,884 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N,M;
cin >> N >> M;
vector<long long>a(N);
long long cnt = 0;
for(int i = 0; i < N; i++) {
cin >> a[i];
a[i]/=2;
if(i == 0) {
cnt = a[i];
continue;
}
cnt = cnt/__gcd(c... | #include <iostream>
using namespace std;
int main()
{
double x1, y1, x2, y2, x3, y3, xp, yp;
double a, b, c;
while(cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp)
{
a = (x3 - x2)*(yp - y2) - (y3 - y2)*(xp - x2);
b = (x1 - x3)*(yp - y3) - (y1 - y3)*(xp - x3);
c = (x2 - x1)*(y... | 0 | 88,556,884 |
#include <cstdio>
int main()
{
long long x, y;
scanf("%lld%lld", &x, &y);
if (x % y == 0)
{
puts("-1");
return 0;
}
printf("%lld\n", x * (y - 1));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
main(){
int n;cin >> n;
int t[100010],x[100010],y[100010];
t[0]=x[0]=y[0]=0;
for(int i=0;i<n;i++) cin >> t[i+1] >> x[i+1] >> y[i+1];
string ans="Yes";
for(int i=0;i<n;i++){
int dt = t[i+1]-t[i];
int dist = abs(x[i+... | 0 | 50,833,599 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
cout<<111*((N-1)/111)+111<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using vec_b = vector<bool>;
using vec_str = vector<string>;
#define INF (1LL << 60)
#define MOD 1000000007
#define REP(i,m,n) for(ll (i)=(m),i##_len=(n);(i)<(i##_len);++(i))
#define FORR(i,v) for(auto (i... | 0 | 5,738,214 |
#include <iostream>
int main()
{
int n, a; std::cin >> n >> a;
int mod = n % 500;
std::cout << (mod <= a ? "Yes" : "No") << std::endl;
} | #include <iostream>
using namespace std;
int main() {
int n, y;
cin >> n >> y;
int flag = 0;
int a_max = y / 10000;
for (int a = a_max; a >= 0; a--) {
int b_max = n - a;
for (int b = b_max; b >= 0; b--) {
int c = n - a - b;
if (y == 10000 * a + 5000 * b + 1000 * c) {
cout << a << "... | 0 | 46,870,173 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
string str;
while(cin>>str){
cout<<str.substr(0,4)<<" "<<str.substr(4,str.length())<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 0 | 52,540,422 |
#include <iostream>
#include <queue>
#include <vector>
#include <math.h>
#include <algorithm>
using namespace std;
int main(){
int num;
cin >> num;
priority_queue<int> pq;
for (int i = 0; i < num; ++i) {
for (int j = 0; j < 3; ++j) {
int a;
cin >> a;
pq.push(a);
}
int a, b, c;
a = pq.top();
pq.p... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int s[3],a[3][3],ans=0;
for(int i=0;i<3;i++) cin>>s[i];
sort(s,s+3);
for(int i=0;i<3;i++)
{
for(int j=i+1;j<3;j++)
{
a[i][j]=(max(s[i],s[j])-min(s[i],s[j]))%2;
a[j][i]=a[i][j];
}
}
for(int i=0;i<3;i++)
{... | 0 | 30,788,973 |
#include "bits/stdc++.h"
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) return a;
else return gcd(b, a%b);
}
long long lcm(long long x, long long y) {
return x * y / gcd(x, y);
}
int main() {
long long A,B;
cin >> A >>B;
cout << lcm(A,B)<< endl;
return 0;
} | #include <iostream>
#include <string>
#include <cctype>
#include <map>
using namespace std;
int to_num_from_mcxi(string inp);
string to_mcxi_from_num(int num);
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string x1, x2;
int num1, num2;
num1 = num2 = 0;
cin >> x... | 0 | 72,588,204 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 3e18;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll ans = -inf;
ans=max(ans,a*c);
ans=max(ans,a*d);
ans=max(ans,b*c);
ans=max(ans,b*d);
cout<<ans<<'\n';
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <fstream>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#define endl "\n"
typedef long long ll;
using namespace std;
void Lancer() { ios::sync_with... | 0 | 10,136,782 |
#include<iostream>
#include<algorithm>
using namespace std;
int N_MAX = 100000;
int main()
{
int n,t=1,i,res=0;
int a[N_MAX];
cin >> n;
for(i=0;i<n;i++)
cin >> a[i];
sort(a,a+n);
for(i=1;i<n;i++)
if(a[i]==a[i-1]){
t++;
}else{
if(t>=a[i-1])
res+=t-a[i-1];
else
re... | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
ll a[200010], ans;
bool visited[200010];
int main()
{
int i, v, u, edges, nodes;
cin >> nodes >> edges;
for(i=1;i<=nodes;i++)
{
cin >> a[i];
visited[i] = true;
}
for(i=1;i<=edges;i++)
{
cin >> u >>... | 0 | 13,082,861 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<ll, ll>;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll N = 1e2 + 5;
ll n, m;
ll dx[] = {1, 0};
ll dy[] = {0, 1};
ll dp[N][N];
char grid[N][N];
bool outside(ll r, ll c) {
... | #include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N,M;
cin>>N>>M;
vector<vector<int>> A(N);
while(M--){
int a,b;
cin>>a>>b;
A[a-1].push_back(b-1);
A[b-1].push_back(a-1);
}
vector<int> B(N,-1);
queue<int> Q;
B[0]=0;
Q.push(0);
while(!Q.empty()){
... | 0 | 83,641,681 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n;
s... | #include<stdio.h>
#include<vector>
#include<queue>
#include<string.h>
#include<iostream>
#include<algorithm>
#define INF 1000000000
#define MAXN 100005
using namespace std;
int mmin=11;
int step[4][2]={0,1,0,-1,-1,0,1,0};
int a[1005][1005];int m,n,k,sx,sy;
struct node{
int x,y,cost;
};
int bfs(int x,int y,int s)
{
... | 0 | 33,406,641 |
#include <queue>
#include <iostream>
#define ll long long
using namespace std;
int main(){
string s;
priority_queue<ll> pq;
while(cin >> s){
if(s == "insert"){
ll input;
cin >> input;
pq.push(input);
}else if(s == "extract"){
cout << pq.top() << '\n';
pq.pop();
}else{
... | #include<bits/stdc++.h>
using namespace std;
#define SORT(c) sort((c).begin(),(c).end());
#define pb push_back
#define MP make_pair
#define pii pair<int,int>
#define pcc pair<char,char>
#define pic pair<int,char>
#define pci pair<char,int>
#define VS vector<string>
#define VI vector<int>
#define pi 3.141592653589793
#d... | 0 | 81,932,046 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | #include<iostream>
#include<map>
using namespace std;
int main() {
map<int,int> data;
int n,max;
while (cin >> n) {
data[n]++;
}
max = 0;
for (int i = 0; i < data.size();i++)
if( data[i] > max )
max = data[i];
map<int,int>::iterator it = data.begin();
while (it != data.end()) {
if ( (*it).second == max... | 0 | 66,354,621 |
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
vector<vector<ll>> d;
ll ans = LINF;
void rec(ll start, map<ll, ll> done, ll sum) {
bool last = true;
for (auto town : done) {
if (town.second == 0) last = false;
}... | 0 | 83,400,961 |
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <cmath>
#include <iostream>
#include <stack>
#include <queue>
#include <climits>
#include <iomanip>
#define all(x) x.begin(), x.end()
#define MOD 1000000007
#define debug(x) ... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i =... | 0 | 6,740,136 |
#include "bits/stdc++.h"
#include <chrono>
using namespace std;
using namespace std::chrono;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define forn(ii,nn) for (int ii = 0; ii < nn; ++ii)
#define gcd(ade,bde) __gcd(ade,bde)
#define vi vector<int>
#define vll vector<ll>
#define vs vect... | #include <bits/stdc++.h>
using namespace std;
int main(void){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector< vector<int> > v(n, vector<int>(n, 0));
for(int i = 0; i < n; i++){
int u, k; cin >> u >> k;
u--;
for(int j = 0; j < k; j++){
int a; cin >> a;
a--;
v[u... | 0 | 9,885,268 |
#include <iostream>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
if (a+b>=c) cout<<"Yes";
if (a+b<c) cout<<"No";
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const vector<vector<int>> dir4 = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};
const vector<vector<int>> dir8 = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}, {1, 1}, {-1, 1}, {1, -1}, {-1, -1}};
int main()
{
int h, w;
cin >> h >> w;
vector<vector<bool>> grid(h + 2, vecto... | 0 | 100,199,085 |
#include<bits/stdc++.h>
#define ll long long
#define db double
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define A first
#define B second
#define lowbit(p) (p&(-p))
using namespace std;
void read(int &x){
x=0; char c=getchar(); int p=1;
for (;c<48;c=getchar())if (c=='-')p=-1;
for (;c>47;c=g... | #include <iostream>
#include <vector>
#include <array>
#include <queue>
#include <stack>
#include <map>
#include <string>
#include <climits>
#include <tuple>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <algorithm>
#include <memory>
#include <iomanip>
#define rep(i, n) for(... | 0 | 17,420,562 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int H,W,M;
cin>>H>>W>>M;
vector<pair<int,int>>items(M);
vector<int>Hcount(H),Wcount(W);
int Hmax=-1,Wmax=-1;
for(int i=0;i<M;i++)
{
cin>>items[i].first>>items[i].second;
}
for(int i=0;i<M;i++)
{
items[... | #include <iostream>
using namespace std;
int main() {
int n,x;
int ans;
while(true){
ans = 0;
cin >> n >> x;
if(n == 0 && x == 0) break;
for(int i = 1; i <= n-2; ++i){
for(int j = i+1; j <= n-1; ++j){
if(i == j) continue;
for(int k = j+1; k <= n; ++k){
if(i == k || ... | 0 | 52,106,480 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using namespace std;
using ll=long long;
using pii=pair<int, int>;
using vi=vector<int>;
const ll INF=1LL<<60;
const int MOD=998244353;
const int N=2e5+5;
int main(){
int N, K; cin >> N >> K;
ll R, S, P; cin >> R >> S >> P;
... | #include<bits/stdc++.h>
#include<cmath>
#define pb push_back
#define ld long double
#define mp make_pair
#define vl vector<ll>
#define vd vector<double>
#define vld vector<long double>
#define ll long long int
#define pl pair<ll, ll>
#define all(a) a.begin(), a.end()
#define forr(i, n) for(ll i=0; i<n; i++)
#define f... | 0 | 1,114,939 |
#include <iostream>
using namespace std;
int Y, M, D;
int cal(int ey, int em, int ed){
int cnt = 0;
for(int y=1; y<=ey; y++){
for(int m=1 ; m<=10; m++){
int mc;
if(y%3 == 0)
mc = 20;
else{
if(m%2 == 1)
mc = 20;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
const int INF = 1LL<<30;
int G[10][10];
int main() {
int n,m;
cin>>n>>m;
rep(i,m){
int a,b;
cin>>a>>b;
a--,b--;
G[a][b]=1;
... | 0 | 61,080,192 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int ... | #include <iostream>
using namespace std;
int N;
void solve() {
int counter = 0;
if (!N)
return;
while (true) {
++counter;
int kagen = counter * (counter - 1) / 2;
int jyogen = counter * (counter + 1) / 2;
if (kagen < N && N <= jyogen) {
cout << counter << ... | 0 | 50,057,858 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n, 0);
int p = 0;
for (int i = 0; i < n... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vecto... | 0 | 10,184,038 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define en '\n'
const int MAXN = 1e6+69;
const int INF = 1e18;
const int mod = 1e9+7;
struct vl{
int x,y;
bool operator<(vl t)const{
if(x==t.x)return (y<t.y);
return x<t.x;
}
};
map<int,int>mp;
int q;
int m,p,n,k;
int x,y,z;... | 0 | 68,270,040 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
const int INF = 1LL<<30;
ll dp[110][2][5];
int main() {
string N;
int K;
cin>>N>>K;
int n=N.size();
dp[0][0][0]=1;
rep(dgt,n){
rep(isless,2)... | #include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 60)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64,i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
templa... | 0 | 87,871,036 |
#include<bits/stdc++.h>
#define ll long long
#define MAX 1000005
#define evn(x) (!((x)&1))
#define MOD (ll)(1e9+7)
#define INF INT32_MAX
#define INFL INT64_MAX
using namespace std;
int n;
bool vis[MAX];
vector<int> gp[MAX];
int dist[MAX];
void connect(int a, int b) {
gp[a].push_back(b);
}
void bfs(int a) {
vis[a]=1;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const ll INF = 1LL<<60;
int main()
{
int H,W; cin>>H>>W;
string board[H];
rep(i,H) cin>>board[i];
string ans = "Yes";
rep(i, H) {
rep(j, W) {
if (board[i][j] == '#') {
boo... | 0 | 74,501,057 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<functional>
#include<math.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pf(n) printf("%d\n",n)
#define pff(a,b) printf("%d %d\n",a,b);
typedef long long ll;
typedef p... | #include <iostream>
using namespace std;
int main(){
int m, f, r;
for(;;){
cin >> m >> f >> r;
if(m==-1 && f == -1 && r == -1){
break;
}
if(m == -1 || f == -1){
cout << 'F' << endl;
}else if(m+f >= 80){
cout << 'A' << endl;
}else if (65 <= m+f && m+f <80){
cout << 'B' << endl;
... | 0 | 31,126,480 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string S;
cin>>S;
string check;
int num=0;
int A=0;
int B=0;
int ans=0;
for(int i=0;i<=(int)(S.length()-3);i++){
check=S.substr(i,3);
num=stoi(check);
A=num-753;
if(A<0)A*=-1;
B=ans-753;
if(B<0)B*=-1;
if(A<B... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | 0 | 85,624,450 |
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
using std::max;
typedef long long ll;
const int N = 100010;
int _w;
int n, a[N], d[N];
namespace Tree {
int head[N], nxt[N*2], to[N*2], eid;
void init() {
eid = 0;
memset(head, -1, sizeof head);
}
void link( int u, int v ) {
to[eid] ... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
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; } re... | 0 | 80,530,078 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
uint N; cin >> N;
vector<int> d(N, 0);
int recover = 0;
for (auto &x: d) cin >> x;
for (uint i=0; i<N; i++) {
for (uint j=(i+1); j<N; j++) {
recover += d[i] * d[j];
}
}
cout << recover << endl... | #include "bits/stdc++.h"
using namespace std;
#define rep(i,n)for(int i=0;i<(int)(n);i++)
#define PI 3.141592653589793
int main()
{
int h, n;
cin >> h >> n;
int i;
vector<int>a(n);
for (i = 0; i < n; i++)
{
cin >> a.at(i);
h -= a.at(i);
if (h <= 0)
{
break;
}
}
if (h <= 0)
cout << "Yes" << endl;
... | 0 | 85,326,501 |
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <... | #include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define f... | 0 | 94,060,990 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <regex>
#include <vector>
#define fix(n... | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vector... | 0 | 229,056 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a >... | #include <bits/stdc++.h>
using namespace std;
int main(void){
string S;
cin >> S;
bool kaibun1=true;
bool kaibun2=true;
bool kaibun3=true;
int N=S.size();
for (int i=0;i<N;i++) {
if (S[i] != S[N-1-i]) {
kaibun1 = false;
break;
}
}
for (int i=0;i<(N-1)/2;i++... | 0 | 78,212,685 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3... | #include<bits/stdc++.h>
using namespace std;
#define REPP(i,a,b,c) for(int i=a; i<=b; i+=c)
#define REP(i,a,b) REPP(i,a,b,1)
#define REVV(i,a,b,c) for(int i=a; i>=b; i-=c)
#define REV(i,a,b) REVV(i,a,b,1)
#define FOR(i,a) REP(i,0,(int)a-1)
#define FORD(i,a) REV(i,(int)a-1,0)
#define PB push_back
#define POB pop_back
#d... | 0 | 6,101,093 |
#include <bits/stdc++.h>
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
using namespace std;
using ll = long long; using VI=vector<int>; using pii=pair<int, int>; us... | #include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <cstring>
#include <cassert>
#include <utility>
#include <iomanip>
#include <chrono>
#include <ra... | 0 | 36,346,280 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define F first
#define S second
typede... | #include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie( 0 );
ios::sync_with_stdio( false );
while(true){
int n;
cin >> n;
if(n == 0){ break; }
vector<int> vc(n);
for(int i=0; i<n; i++){
cin >> vc[i];
}
sort(vc.begin(), vc.end());... | 0 | 57,901,871 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i < n; i++)
#define REP(i, n, m) for(int i=n; i < m; i++)
#define reps(i, n) for(int i=1; i <= n; i++)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
using namespace std;
using ll=lo... | #include<bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007
using namespace std;
long long N;
long long A[300005];
long long modpow(long long ori, long long po){
long long res = 1;
while(po > 0){
if(po&1){
res *= ori;
res %= DIV;
}
ori *= ori;
ori %= DIV;
po >>=... | 0 | 86,769,613 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
using namespace std;
typedef long long ll;
typedef long d... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using P = pair<i64, i64>;
#define overload3(_1, _2, _3, name, ...) name
#define rep1(i, n) for(i64 i = 0LL; i < (n); ++i)
#define rep2(i, a, b) for(i64 i = (a); i < (b); ++i)
#define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
#define all... | 0 | 33,821,088 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,03")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#define boost ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define nl "\n"
#define ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=5e3+5;
int n;
ll k,a[N],p[N],cnt[N]={0},sum[N][N]={0};
ll dfs(ll i){
ll u=i,num=1,pos=1;
while(p[i]!=u){
num++;
i=p[i];
sum[u][pos]=sum[u][pos-1]+a[i];
pos++;
}
sum[u][pos]=sum[u][pos-1]+a[u];
... | 0 | 6,692,608 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#define ll long long
#define fi first
#define se second
#define pb push_back
#define me memse... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
const int mod = 1e9 + 7;
#define int long long int
int32_t main() {
IOS ;
int n, k ; cin >> n >> k ;
int arr[n+1], dp[n+1][k+1] ;
for(int i=1; i<=n; i++) cin >> arr[i] ;
... | 0 | 51,015,380 |
#include <iostream>
#include <string>
struct TNode
{
int Value;
TNode* Next;
TNode* Prev;
TNode(int AValue);
};
TNode::TNode(int AValue)
{
Value = AValue;
Next = NULL;
Prev = NULL;
}
class TList
{
TNode* FFirst;
TNode* FEnd;
public:
TList();
~TList();
void PushFront(int Value);
void PopFront();
void PopBa... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
templa... | 0 | 62,011,041 |
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main(){
int N;
cin >> N;
vector<vector<int>> seat(N, vector<int>(2));
for (int i = 0; i < N; i++){
for (int j = 0; j < 2; j++){
cin >> seat.at(i).at(j);
}
}
int people = 0;
for (int i = 0; i < N; i++){
people += seat.at(i).at(1)... | #include "bits/stdc++.h"
using namespace std;
using ll = long long int;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#define pi 3.14159265358979323846
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b... | 0 | 27,315,653 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long LL;
typedef pair<LL,LL> P;
const LL mod=1e9+7;
const LL LINF=1LL<<62;
const int INF=10000000... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 0 | 24,200,789 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | #include <iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<utility>
#include<cstdio>
#define vii vector< pair<int,int> >
#define vi vector<int>
#define INF 1000000007
#define ff first
#define ss second
#define lli long long int
#define ulli unsigned long long ... | 0 | 39,350,247 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.