source_code stringlengths 26 62k | lang_cluster stringclasses 11
values | src_uid stringlengths 32 32 | code_uid stringlengths 32 32 | difficulty int32 -1 3.5k ⌀ | exec_outcome stringclasses 1
value |
|---|---|---|---|---|---|
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#define MIN 1<<31-1
#define HMAX 1000000000000000000
#define MOD 1000000007
#define REP(i,n) for(ll i = 0; i < (n); i++)();... | C++ | 75d05c16baaba4b17ad6a9c1dd641bc0 | 9f1b8d8d033b341f61ebd3c0bf809805 | 2,100 | PASSED |
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#define MIN 1<<31-1
#define HMAX 1000000000000000000
#define MOD 1000000007
#define REP(i,n) for(ll i = 0; i < (n); i++)();... | C++ | 75d05c16baaba4b17ad6a9c1dd641bc0 | fc2a2fbc361a192d0ec1842939d26147 | 2,100 | PASSED |
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#define MIN 1<<31-1
#define HMAX 1000000000000000000
#define MOD 1000000007
#define REP(i,n) for(ll i = 0; i < (n); i++)();... | C++ | 75d05c16baaba4b17ad6a9c1dd641bc0 | e9e67501c31f0bb6b64e2ec2f0eb2967 | 2,100 | PASSED |
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#define MIN 1<<31-1
#define HMAX 1000000000000000000
#define MOD 1000000007
#define REP(i,n) for(ll i = 0; i < (n); i++)();... | C++ | 75d05c16baaba4b17ad6a9c1dd641bc0 | 4ed5a4f3f27b3e606186042983a5b432 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int a[8192];
int ans[8192];
bool f[5005];
int main(){
#ifdef REDIRECT_IO
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n;
scanf("%d",&n);
vector<int> v;
v.push_back(0);
for(int i = 0; i < n; i++){
scanf("%d",a+i);
if(a[i])
for(i... | C++ | 75d05c16baaba4b17ad6a9c1dd641bc0 | 0763e15a32682bf71ba8f219f4503418 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn=10010;
int n,k;
map<int,int>m;
int p[maxn];
int visp[maxn],coun[maxn],ans[maxn];
void iszhi(int x)
{
int count=0;
for(int i=2;i<=x;i++)
{
if(!visp[i])
{
p[count++]=i;
}
for(int j=0;;j++)
{
... | C++ | 75d05c16baaba4b17ad6a9c1dd641bc0 | 62c1519d092715a85527458a1b8c3d02 | 2,100 | PASSED |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
int n;
long long tmp[5050],a[5050],c[5050],cnt,ans[5050],pos0=23333,cnt0;
long long get(long long x)
{
if(x==0) return 0;
long long ans=x>0?1:-1;
x=abs(x);
for(int i=2;i*i<=x;i++)
{
int cnt=0;
if(x%i==0)
{
while(x%i==0) cnt++,x/=... | C++ | 75d05c16baaba4b17ad6a9c1dd641bc0 | 9278df8a9edd41fe45290cf8e32e3417 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5005;
int n,a[maxn], b[maxn];;
int cnt[maxn];
int fun(int x) {
int p = sqrt(abs(x));
int ans = 1;
for(int i=2;i<=p;i++) {
int cnt = 0;
while(x%i==0) {
cnt++;
x/=i;
}
if(cnt&1) ans *= i;
... | C++ | 75d05c16baaba4b17ad6a9c1dd641bc0 | 0dfc2657476ef28984c0cfaf1bcd9e76 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
const int maxlen = 5000, inf = 0x3f3f3f3f;
int n, a[maxlen + 1], ans[maxlen + 1], tmp[maxlen + 1], sz, cnt[maxlen + 1], t[maxlen + 1];
inline int get_hash(int x)
{
return lower_bound(tmp ... | C++ | 75d05c16baaba4b17ad6a9c1dd641bc0 | 825ef3022b881c2e7ce97a3d586bf07d | 2,100 | PASSED |
# include <bits/stdc++.h>
# define ll long long
using namespace std;
ll dp[4][300] , n;
char s[4][20000];
void f( int x, int y, int k )
{
if( y > n || dp[x][y] || y + 2 * k <= n && s[x][y + 2 * k] != '.' && s[x][y + 2 * k] != 's' )
return;
dp[x][y] = 1;
if( abs(x - 1) <= 1 && (y + 2 * k + 1 > n || ... | C++ | 5c1707b614dc3326a9bb092e6ca24280 | 66f2fba645bd4f44ab957225a77c7bd9 | 1,700 | PASSED |
# include <bits/stdc++.h>
# define ll long long
using namespace std;
ll dp[4][300] , n;
char s[4][20000];
void f( int x, int y, int k )
{
if( y > n || dp[x][y] || y + 2 * k <= n && s[x][y + 2 * k] != '.')
return;
dp[x][y] = 1;
if( x != 3 && (y + 2 * k + 1 > n || (s[x][y + 2 * k + 1] == '.' && s[1][... | C++ | 5c1707b614dc3326a9bb092e6ca24280 | d0b361ee5bab896c729f9d38516a3dc4 | 1,700 | PASSED |
#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <queue>
#include <functional>
#include <cstdlib>
#include <cstdio>
using namespace std;
int n, k, s;
char map[3][120];
int cache[3][120];
int solve(int r, int c)
{
int &ret = cache[r][c];
if(ret != -1) return ret;
if(c > n - ... | C++ | 5c1707b614dc3326a9bb092e6ca24280 | 263d571a676b7a8e15cf44076cd7eecc | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
vector<vector<bool>> d(5, vector<bool>(n, 0));
vector<vector<bool>> M(5, vector<bool>(n, 0));
char c;
for (int i = 1; i <= 3; i++)
for... | C++ | 5c1707b614dc3326a9bb092e6ca24280 | 3a196a7758bbcad9798e62a6a0c25db5 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
vector <string> g(3);
vector < vector <bool> > used(3);
int q, t;
bool dfs(int x, int y)
{
if(x >= g[0].size())
return true;
if(used[y][x])
return false;
used[y][x] = true;
if((x + 1 >= g[0].size() || g[y][x + 1] == '.') && (x + 2 >= g[0].... | C++ | 5c1707b614dc3326a9bb092e6ca24280 | c923735a1144e726013e1fd474d0690e | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
string s[3];
bool b[3];
int dp[110][3];
int main()
{
int t;
cin >> t;
for(int u = 0; u < t; u++)
{
int n, k;
cin >> n >> k;
cin >> s[0] >> s[1] >> s[2];
for(int i = 0; i < 3; i++)
fill(dp[i], dp[i] + 110, 0);
memset(dp, 0, sizeof(dp));
for(int i = 0; i... | C++ | 5c1707b614dc3326a9bb092e6ca24280 | 80228924effbdf2b15cca78226002a6e | 1,700 | PASSED |
#include<bits/stdc++.h> //化运动为静止
//理解清楚题意再写
//bfs判重不仅可以减少时间复杂度，还可以减少空间复杂度
using namespace std;
string g[3];
struct node
{
int x,y;
};
int vis[5][105];
queue<node>q;
int n,k;
int main()
{
int t;cin>>t;
while(t--)
{
while(!q.empty())q.pop();
memse... | C++ | 5c1707b614dc3326a9bb092e6ca24280 | 5f36e60bdabf51fb058e77985b4b1878 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
char maps[3][115];
int n;
bool flag;
int vis[3][115];
void solve(int x, int y)
{
vis[x][y] = 1;
for(int i = 0; i < n; i++)
{
for(int j = 0; j < 3; j++)
{
if(vis[j][i] == 0)
continue;
if(maps[j][i + 1] == ... | C++ | 5c1707b614dc3326a9bb092e6ca24280 | 038567c2042b339095f0335675e4ea18 | 1,700 | PASSED |
#include <iostream>
#include <string>
#include <vector>
#include <cstring>
#define MAX_N (100)
#define MAX_K (26)
using namespace std;
bool visit[3][MAX_N+1];
bool solve(const vector<string> &tunnel, int n, int si, int sj) {
if(sj >= n) return true;
if(visit[si][sj]) return false;
visit[si... | C++ | 5c1707b614dc3326a9bb092e6ca24280 | 9643af0c195804a9dd722d42d3b11588 | 1,700 | PASSED |
#include <iostream>
#include <string>
#include <vector>
#include <cstring>
#define MAX_N (100)
#define MAX_K (26)
using namespace std;
bool visit[3][MAX_N+1];
bool solve(const vector<string> &tunnel, int n, int si, int sj) {
if(sj >= n) return true;
if(visit[si][sj]) return false;
visit[si... | C++ | 5c1707b614dc3326a9bb092e6ca24280 | 587bb2b97bd3268b03add6ff04aa2f24 | 1,700 | PASSED |
#include <cmath>
#include <iostream>
using namespace std;
#define ll long long
bool check(ll n) {
if (n==1)return true;
if (n%2!=0 && n%3!=0 && n%5!=0) {
return false;
}
else {
return true;
}
}
int cnt = 0;
int countways(ll n) {
//cout<<n<<" "<<check(n)<<" "<<cnt<<" ";
if (n == 1)
return 0... | C++ | ed5ea0e664aa986ab86e4e6746e8a1bf | 0bc2b77ee219fcf376ea98840f30f92a | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i;
cin>>n;
long long int p,k,c;
for(i=0;i<n;i++)
{
cin>>p;
k=1;c=0;
while(1)
{
if(p==1)
break;
if(p%2==0)
p=p/2... | C++ | ed5ea0e664aa986ab86e4e6746e8a1bf | 417350f9bc4913ca359aec3ced839719 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i;
cin>>n;
long long int p,k,c;
for(i=0;i<n;i++)
{
cin>>p;
k=1;c=0;
while(k!=0 && p!=1)
{
if(p%2==0)
p=p/2;
else if(p%3==0)
p=(2*p)/3;
el... | C++ | ed5ea0e664aa986ab86e4e6746e8a1bf | 71c9b7ae9228a8d8db2ca8fa5a6b2ee7 | 800 | PASSED |
//A
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ios::sync_with_stdio(false);
int q;
int ans,flag;
ll tp;
cin>>q;
while(q--){
cin>>tp;
ans = 0; flag = 0;
while(tp!=1){
if(tp%2!=0&&tp%3!=0&&tp%5!=0){
cout<<-1<<endl; flag = 1;
break;
}
while(tp%2==0){
t... | C++ | ed5ea0e664aa986ab86e4e6746e8a1bf | 8367f5af33c1d16a63c26463a7d6c5fb | 800 | PASSED |
//A
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int q;
int ans,flag;
ll tp;
cin>>q;
while(q--){
cin>>tp;
ans = 0; flag = 0;
while(tp!=1){
if(tp%2!=0&&tp%3!=0&&tp%5!=0){
printf("-1\n"); flag = 1;
break;
}
while(tp%2==0){
tp/=2;
ans++;
}
if... | C++ | ed5ea0e664aa986ab86e4e6746e8a1bf | 6cb6da729823f7d9e01db57eeff29fb6 | 800 | PASSED |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int q;
cin >> q;
vector<uint64_t> ip;
for(int i=0;i<q;i++)
{
uint64_t n;
cin >> n;
ip.push_back(n);
}
for(int i=0;i<ip.size();i++)
{
uint64_t n =ip[i];
int arr[3]={2,3,5};
... | C++ | ed5ea0e664aa986ab86e4e6746e8a1bf | 2bf578e597bfb84fb243b0929bce8249 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define PI (acos(-1.0))
#define FOR(i,a,n) for (int i=(a);i<(n);++i)
typedef long long ll;
typedef long double ld;
typedef double db;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl... | C++ | ed5ea0e664aa986ab86e4e6746e8a1bf | fad69182f1f6b771f7712204210c92b6 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
int q;
cin>>q;
for(int i=0;i<q;i++){
long long resul=0;
long long n;
cin>>n;
while(n>1){
if(n%2==0){
n=n/2;
resul++;
}
else if(n%3==0){
n=n/3;
n=2*n;
resul++;
}
else if(n%5==0){
n=n/5;
n=4*n;
resul++;
... | C++ | ed5ea0e664aa986ab86e4e6746e8a1bf | 99d380aae5e7b4c3ba28333c561433bd | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long t,n, moves,k;
cin >> t;
while(t--)
{
cin >> n;
moves = 0;
k = 0;
while(n != 1)
{
if(!(n%2))
{
n = n/2;
moves++;
}
else if(!(n%3))
{
n = 2*n/3;
moves++;
}
else if(!(n%5))
{
n = 4*n/5;
... | C++ | ed5ea0e664aa986ab86e4e6746e8a1bf | 8f1c1fd243800d5b023ae52e826b5d59 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,m,d=0;
cin>>n;
for(int i=1;i<=n;++i)
{
cin>>m;
while(m>1)
{
if(!(m%2))
{
m=m/2;
d++;
}
else if(!(m%3))
{
... | C++ | ed5ea0e664aa986ab86e4e6746e8a1bf | b2396f85b9f9fb9037e4d743f6587cdd | 800 | PASSED |
#include<stdio.h>
#include<unordered_set>
using namespace std;
int main()
{
int t; scanf("%d",&t);
while(t--)
{
long long n,a; scanf("%lld",&n);
unordered_set<long long> s;
for(int i=0;i<n;i++){ scanf("%lld",&a); s.insert(a);}
long long size=s.size();
printf("%lld\n", size);
}
... | C++ | b978ca6fdef4a02cc027485294caa0f5 | fb27f78804527b5c7a24b4549d533829 | 800 | PASSED |
#include<iostream>
#include<unordered_set>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
int t; cin>>t;
while(t--)
{
long long n,a; cin>>n;
unordered_set<long long> s;
for(int i=0;i<n;i++){ cin>>a; s.insert(a);}
cout<<s.size()<<endl;
}
}
| C++ | b978ca6fdef4a02cc027485294caa0f5 | 4bc1f58e3a526b75e5a471e4e1d03616 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
void merge (long long int *a,long long int p,long long int r);
void mergesort (long long int *a,long long int p,long long int q,long long int r);
vector<long long int> temp;
int main()
{
long long int t;
cin>> t;
while(t--)
{
long long int n,c;
cin>>n;
long long in... | C++ | b978ca6fdef4a02cc027485294caa0f5 | 9b21b16edc2ff0a920debb8b3fc363ab | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long int t;
cin>> t;
while(t--)
{
long int i,j,n;
set<long int> a;
cin >> n;
for(i=0;i<n;i++)
{
cin >> j;
a.insert(j);
}
cout << a.size()<< endl;
}
} | C++ | b978ca6fdef4a02cc027485294caa0f5 | 4f0c7c58a6876e98eaf60cd370bc0add | 800 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int main()
{
int t;
int an[100005];
cin>>t;
while(t--){
int n;
cin>>n;
for(int i=0;i<n;i++) cin>>an[i];
sort(an,an+n);
int ans=unique(an,an+n)-an;
cout<<ans<<endl;
}
}
| C++ | b978ca6fdef4a02cc027485294caa0f5 | bf0abc40c33e4860a44cc5a668b1a79b | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a,int b)
{
return (a*b)/gcd(a,b);
}
int main()
{
int tc;
cin>>tc;
while(tc--)
{
int n;
cin>>n;
int x[n],ans=0;
for(int i... | C++ | b978ca6fdef4a02cc027485294caa0f5 | bfaa34429338edc92b53089877b1739a | 800 | PASSED |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin>>t;
while(t > 0)
{
int n;
cin>>n;
set <int> values;
for(int i = 0; i < n; i++)
{
int x;
cin... | C++ | b978ca6fdef4a02cc027485294caa0f5 | fad6afa7ad8c7f9b5a75f66aeeab8a54 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t;
long n;
long long a[100001];
void quicksort(long long x[], long l , long r)
{
if (l <= r)
{
int k = x[(l+r)/2];
long i = l;
long j = r;
while (i <= j)
{
while (x[i] < k)
i++;
while (x[j] > k)
j--;
if (i <= j)
{
swap(x[i], x[j]);
... | C++ | b978ca6fdef4a02cc027485294caa0f5 | de24871897c53c47794fcc85a5561d4e | 800 | PASSED |
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define loop(n) for(int i=0;i<(n);i++)
#define lpe(x,s,e) for(int x=(s);x<=(e);x++)
#define endl '\n'
using namespace std;
bool prime(long long n)
{
for(long long i=2 ; i*i<=n ; i++)
{
if(n%i == 0)
... | C++ | b978ca6fdef4a02cc027485294caa0f5 | 760d8921ca4fa9abc5dff0b5fb2132de | 800 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define ic(i,j,k) for(int i=j;i<k;i++)
#define dc(i,j,k) for(int i=j;i>k;i--)
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define pf push_front
#define vi vector<int>
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace s... | C++ | b978ca6fdef4a02cc027485294caa0f5 | 60b87dd1b53e51fcd2e6462ad1b5c6d6 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long
#define ff first
#define ss second
#define sz(a) (ll)a.size()
#define lli long long int
#define pb push_back
#define pf push_front
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) ;
#define M 1000000007
#define pi 3.1415926535
l... | C++ | bbbd29774742636a2282dd433ed77b8c | 1621555bda4565e5819f44b2e2e14c0d | 1,900 | PASSED |
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define LEFT (index << 1)
#define RIGHT (index << 1 | 1)
#define MID ((l+r)>>1)
#define MAX_SIZE 2097312
using namespace std;
int tree[MAX_SIZE];
int cnt[MAX_SIZE >> 1];
int n;
void build(int l, int r, int index) {
if (l > r) return;
if (... | C++ | bbbd29774742636a2282dd433ed77b8c | 469d3989d860f7f033b922f6fff04296 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define MAX_SIZE 2097312
#define MID ((l + r) >> 1)
#define LEFT (id << 1)
#define RIGHT (id << 1 | 1)
using namespace std;
int N , Q;
int tree[MAX_SIZE];
int a[MAX_SIZE >> 1];
void build(int l , int r , int id){
if(l > r)return;
if(l == r){
tree[id] = a[l];
}
else{
build(l , MID , LE... | C++ | bbbd29774742636a2282dd433ed77b8c | 83e70ee69c1e3196d88e18308a1a34d2 | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int,int>
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define vi vector<ll>
#define all(x) x.begin(),x.end()
#define show(x) cerr<<#x<<... | C++ | bbbd29774742636a2282dd433ed77b8c | 6d6cf40859ffaf8fe9e7d9c3e017d484 | 1,900 | PASSED |
#include<bits/stdc++.h>
#define mx 1000003
using namespace std;
int arr[mx],tree[4*mx];
void build(int node,int b,int e){
if(b==e)
{
tree[node]=arr[b];
return ;
}
int left=2*node;
int right=2*node+1;
int mid=(b+e)/2;
build(left,b,mid);
build(right,mid+1,e);
tree[node]=tree[left]+tree[right];
}
void update(... | C++ | bbbd29774742636a2282dd433ed77b8c | 1d5c80065e08780a84f5d7bc92e839e6 | 1,900 | PASSED |
//In The Name Of Allah
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define MP make_pair
#define endl '\n'
#define pb push_back
const int N = 1e6 + 5;
int n, q, t[N], x, ps[2000], sq;
int main()
{
ios_base::sync_with_stdio(0),cin.tie(0);
cin >> n >> q;
sq = 1... | C++ | bbbd29774742636a2282dd433ed77b8c | 86651b6b0349465348ffbab43a2912cc | 1,900 | PASSED |
//BISMILLAH
#include <bits/stdc++.h>
using namespace std;
#define sz 1000005
int n,q;
int fen[sz];
void update(int ind,int val){
for( ;ind<=n;ind += ind&(-ind)){
fen[ind] += val;
}
return;
}
int suff(int ind){
int sumy = 0;
while(ind > 0){
sumy = sumy + fen[ind];
ind -= (ind ... | C++ | bbbd29774742636a2282dd433ed77b8c | d15a3eb0d44ec85372f2da1bdc1b439e | 1,900 | PASSED |
//BISMILLAH
#include <bits/stdc++.h>
using namespace std;
#define sz 1000004
int n,q;
int fen[sz];
void update(int ind,int val){
for( ;ind<=n;ind += ind & (-ind)){
fen[ind] += val;
}
return;
}
int suff(int ind){
int sumy = 0;
while(ind > 0){
sumy = sumy + fen[ind];
ind -= (in... | C++ | bbbd29774742636a2282dd433ed77b8c | defe14fb93c64507b39e8c6a60ab6801 | 1,900 | PASSED |
//BISMILLAH
#include <bits/stdc++.h>
using namespace std;
#define sz 1000001
int n,q;
int fen[sz];
void update(int ind,int val){
for( ;ind<=sz-1;ind += ind&(-ind)){
fen[ind] += val;
}
return;
}
int find(int val){
int curr = 0,prevsum = 0;
int i,ans;
for(i = 19;i>=0;i--){
... | C++ | bbbd29774742636a2282dd433ed77b8c | 8058f6e6e58100d068aaf6c2a9cb899f | 1,900 | PASSED |
// I don't just flirt with Disaster, i give it an orgasm.
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define lb lower_bound
#define ub upper_bound
#define ll long long
#define W(x) ... | C++ | bbbd29774742636a2282dd433ed77b8c | b659cc27e2b00be1b73bbafeec541e94 | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int arr[200000+10];
long long no_operations(int n)
{
long long ans=0;
for(int i=n-1;i>0;i--)
{
if(arr[i]<arr[i-1])
{
ans+=arr[i-1]-arr[i];
}
}
return ans;
}
int main()
{
int t;
cin>>t;
int n;
while(... | C++ | 0bd06900e42db9f83cdd43c24da6686e | 16754f8ff9d9cab1b4bf23b28d3970d0 | 1,200 | PASSED |
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#define MAXN 200005
using namespace std;
int a[MAXN],n,t;
int main(void){
scanf("%d",&t);
while(t--){
memset(a,0,sizeof(a));
scanf("%d",&n);
long long ans=0;
for(int i=1;i<=n;i++){
scanf("%d... | C++ | 0bd06900e42db9f83cdd43c24da6686e | 4208f521e454c9136513fc104d25e131 | 1,200 | PASSED |
#include<bits/stdc++.h>
#define N 200005
#define ll long long
using namespace std;
ll t,n,a[N];
int main() {
scanf("%d",&t);
while(t--) {
ll ans = 0;
scanf("%d",&n);
for(int i=0; i<n; i++) {
scanf("%d",&a[i]);
}
for(int i=1; i<n; i++) {
if(a[i] < a[i-1]) {
ans += a[i-1] - a[i];
}
}
printf("... | C++ | 0bd06900e42db9f83cdd43c24da6686e | c70898d111cb6ce63558a086d3c2bd61 | 1,200 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,T,ans,a[300000];
signed main()
{
cin>>T;
while (T--)
{
cin>>n;ans=0;
for (int i=1;i<=n;i++) cin>>a[i];
for (int i=1;i<=n;i++) if (a[i]<a[i-1]) ans+=a[i-1]-a[i];
cout<<ans<<endl;
}
} | C++ | 0bd06900e42db9f83cdd43c24da6686e | d0c6531ed8cc87a1da1bf802f342e21d | 1,200 | PASSED |
#include<cstdio>
#include<algorithm>
#define ll long long
#define N 200005
int T;
int n,a[N];
int main(){
scanf("%d",&T);
while(T--){
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
ll ans=0;
for(int i=1;i<=n;i++)
if(a[i]<a[i-1])
ans+=a[i-1]-a[i];
printf("%I64d\n",ans);
}
}
| C++ | 0bd06900e42db9f83cdd43c24da6686e | fbc8652c4eebd687d34e2b84d5bfc045 | 1,200 | PASSED |
#include<bits/stdc++.h>
#define fint register int
#define h 5001
#define p 4309364
#define int long long
using namespace std;
int a[p];
inline int read();
signed main()
{
int T;
T=read();
while(T--)
{
int n;
n=read();
for(fint i=1;i<=n;i++)
a[i]=read();
int ans=0;
for(fint i=2;i<=n;i++)
if(a[i-1]>a[i]... | C++ | 0bd06900e42db9f83cdd43c24da6686e | 5455cd0d4dca24875ceed088d15431af | 1,200 | PASSED |
#include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
ll a[200050];
int main()
{
int t;
cin >> t;
while(t--)
{
ll n,ans=0;
cin >> n;
for(int i=1;i<=n;i++) cin >> a[i];
for(int i=1;i<=n;i++)
if(a[i]<a[i-1]) ans+=a[i-1] - a[i];
cout << ans << endl;
}
return 0;
} | C++ | 0bd06900e42db9f83cdd43c24da6686e | 610348aca3001a8e50dc8480268f6092 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int tc; cin >> tc;
while (tc--)
{
ll n; cin >> n;
vector<ll> arr(n);
for (int i = 0; i < n; i++)cin >> arr[i];
ll ans = 0;
for (int i = 1; i < n; i++)
if (arr[i - 1] > arr[i])
ans += arr[i - 1] - arr[i];
cout << a... | C++ | 0bd06900e42db9f83cdd43c24da6686e | 1ccd0c0eb5f5c4bbec2592c67751cadf | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long int
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define deb(x) cout<<"Debug\t"<<#x<<"="<<x<<endl;
#define deb2(x,y) cout<<"Debug\t"<<#x<<"="<<x<<"\t"<<#y<<"="<<y<<endl;
#define deb3(x,y,z... | C++ | 0bd06900e42db9f83cdd43c24da6686e | c8ffb1a499bae867f436b089247ef253 | 1,200 | PASSED |
/* Author : the_compiler*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int siz=2e5+9;
const int MOD=1e9+7;
int n,t;
int a[siz];
int main()
{
cin>>t;
A: while(t--)
{
cin>>n; ll Ans=0;
for(int i=0;i<n;++i)cin>>a[i];
int Mx=0;
for(int i=1;i<n;++i)
... | C++ | 0bd06900e42db9f83cdd43c24da6686e | c8e8c14a6e7daad0fe2cc4fa84c3c9ad | 1,200 | PASSED |
import java.util.*;
import java.io.*;
public class Main
{
public static void main(String[] args)
{
FastReader reader = new FastReader();
PrintWriter writer = new PrintWriter(System.out);
int n = reader.nextInt();
int[] count = new int[n];
boolean ans = true;
for (int i=1; i<n; i++)
{
int x = re... | Java | 531746ba8d93a76d5bdf4bab67d9ba19 | ae2961a5955dd4df747511c7d788a841 | 1,900 | PASSED |
import java.io.*;
import java.util.*;
/**
* Copyright © 2018 Chris. All rights reserved.
*
* @author Chris
* 2018/7/9 15:33
* @see format
*/
public class E {
private static BufferedReader br;
private static StreamTokenizer st;
private static PrintWriter pw;
private static void solve() throws I... | Java | 531746ba8d93a76d5bdf4bab67d9ba19 | 57479d047a49e9f119d9ff305c0091ab | 1,900 | PASSED |
//package sept;
import java.io.*;
import java.util.*;
public class CodeAgon {
InputStream is;
PrintWriter out;
String INPUT = "";
//boolean debug=true;
boolean debug=false;
void solve()
{
int n=ni();
int[] a=new int[n-1];
for(int i=0;i<n-1;i++)
{
int u=ni(),v=ni();
if(v!=n)
... | Java | 531746ba8d93a76d5bdf4bab67d9ba19 | c18d70b117e287be1000ea1bbfddd43e | 1,900 | PASSED |
/* Author: Ronak Agarwal, reader part not written by me*/
import java.io.* ; import java.util.* ;
import static java.lang.Math.min ; import static java.lang.Math.max ;
import static java.lang.Math.abs ; import static java.lang.Math.log ;
import static java.lang.Math.pow ; import static java.lang.Math.sqrt ;
/* Thread i... | Java | 531746ba8d93a76d5bdf4bab67d9ba19 | c08e419454a9cc0c55b223da0b58360b | 1,900 | PASSED |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws FileNotFoundException {
ConsoleIO io = new ConsoleIO(new InputStreamReader(System.in), new PrintWriter(System.out));
// String fileName = "C-small-attempt0";
// ConsoleIO io = new ConsoleI... | Java | 531746ba8d93a76d5bdf4bab67d9ba19 | 4710d6cbdbb5c3ab4d8e82963c480ffb | 1,900 | PASSED |
import java.io.*;
import java.util.*;
public class tr1 {
static PrintWriter out;
static StringBuilder sb;
static int inf = (int) 1e9;
static long mod = (long) 998244353;
static int[] si;
static ArrayList<Integer> primes;
static HashSet<Integer> pr;
static int n, k, m;
static int[] in;
static HashMap<Integer,... | Java | 531746ba8d93a76d5bdf4bab67d9ba19 | 359b8527199d2677fd60c29ec474e265 | 1,900 | PASSED |
//package com.company;
import java.io.*;
import java.util.*;
public class Main {
static long TIME_START, TIME_END;
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
// Scanner sc = new Scanner(new FileInputStream("Test.in"));
PrintWriter p... | Java | 531746ba8d93a76d5bdf4bab67d9ba19 | 9e049ee67b483604387f9bc1ff0ff8a4 | 1,900 | PASSED |
import java.io.*;
import java.util.*;
import java.text.*;
import java.lang.*;
import java.math.*;
public class Main{
static ArrayList[] a = new ArrayList[200001];
public void solve () throws IOException {
InputReader in = new InputReader(System.in);
PrintWriter pw = new PrintWriter(Sys... | Java | 531746ba8d93a76d5bdf4bab67d9ba19 | 16b652edd52beb708332c389d85c1797 | 1,900 | PASSED |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.*;
import java.util.*;
import java.util.LinkedList;
import java.math.*;
import java.lang.*;
import java.util.PriorityQueue;
import static java.lang.Math.*;
@SuppressWarnings("unchecked")
public cla... | Java | 531746ba8d93a76d5bdf4bab67d9ba19 | 1af410b6f0cdb0f374a7fd161bb31637 | 1,900 | PASSED |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.HashMap;
import ... | Java | 531746ba8d93a76d5bdf4bab67d9ba19 | 2bf736e5e2ca3623b584cfe60a90ca05 | 1,900 | PASSED |
#include<iostream>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<stdlib.h>
#include<set>
#define ll long long
using namespace std;
main()
{
ll n;cin>>n;
ll a[n],b[n],k,l,p,q;
for(ll i=0;i<n;i++) {
cin>>a[i]; b[i]=a[i];}
multiset<ll> c(a,a+n);
sort(b,b+n);
if(n==2 &&... | C++ | 7bfc0927ea7abcef661263e978612cc5 | 64902c1f6ea83ddc32bf619c2d2ab5ee | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
/*class CoinFlipsDiv2
{
public:
int countCoins(string state)
{
int c=0;
state.insert(0,".");
int sz=state.size();
state+=".";
sz+=1;
for(int i=1;i<sz-1;i++)
{
if(state[i]=='H')
{
... | C++ | 7bfc0927ea7abcef661263e978612cc5 | b00a60c322dc90847292c0d3f8432451 | 1,300 | PASSED |
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <limits>
#include <utility>
#include <iomanip>
#include <cassert>
#include <cmath>
#include <map>
#include <stack>
#include <numeric>
#include <set>
#define endl '\n'
using namespace std;
void pri... | C++ | 7bfc0927ea7abcef661263e978612cc5 | 8f973d945ca25271e1492ef53fcc80f9 | 1,300 | PASSED |
#include <stdio.h>
#include <algorithm>
#include <string.h>
#define inf ~0U>>2
using namespace std;
int n,cnt=0;
struct node{int a,c,ad;}e[3];
int judge(int x)
{
for(int i=0;i<cnt;i++)
if(x==e[i].a) return i;
return 5;
}
bool cmp(node c,node d)
{
if(c.c==d.c)
return c.a<d.a;
return c.c<d... | C++ | 7bfc0927ea7abcef661263e978612cc5 | 7dc4674171c37f07e3f6864b6b65b2a0 | 1,300 | PASSED |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
pair<int,int>pr[1500];
int main()
{
int n;
cin>>n;
double avg = 0;
for(int i = 0 ; i<n ; i++)
{
int x;
cin>>x;
pr[i].first=x;
pr[i].second=i+1;
avg += pr[i].first;
}
avg/=n;
sort(pr... | C++ | 7bfc0927ea7abcef661263e978612cc5 | 6efe6ea2f8575e8c9b0e28d4768ccf9b | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for(int i=(s); i<(e); i++)
#define f first
#define s second
#define LL long long
int main(){
ios::sync_with_stdio(0);
int n;
cin>>n;
LL total=0;
pair<int, int> cup[n+1];
FOR(i,1,n+1){
cin>>cup[i].f;
total+=cup[i].f;... | C++ | 7bfc0927ea7abcef661263e978612cc5 | 768fd72b31ff74dbf61576838f62b9f2 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,v,sz,x,a[3],b[3],ma[3];
map<int,pair<int,int>>m;
scanf("%d",&n);
for(int i=0;i<n;++i){
scanf("%d",&v);
++m[v].first;
m[v].second=i+1;
}
sz=m.size();
if(sz==3){
x=0;
for(auto i:m){
... | C++ | 7bfc0927ea7abcef661263e978612cc5 | e35a2eb611c2539c8cce3c42bfa4471b | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
#endif
int n;
scanf("%d", &n);
map<int, bool> vis;
vector<pair<int, int> > a(n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i].first);
a[i].second = i + 1;
vis[a[i].first] = true;
}
if (vis.si... | C++ | 7bfc0927ea7abcef661263e978612cc5 | 2bf0f09e4654762688f588b70d476da9 | 1,300 | PASSED |
#include "iostream"
using namespace std;
int main(int argc, char const *argv[])
{
int n;
cin>>n;
int a[n],max=-1,min=100000,i1,i2;
//int c[1001]={0};
for (int i = 0; i < n; ++i)
{
cin>>a[i];
if (max<a[i])
{
max=a[i];
i2=i;
}
if (min>a[i])
{
min=a[i];
i1=i;
}
//c[a[i]]++;
}
int il;... | C++ | 7bfc0927ea7abcef661263e978612cc5 | c2492498d0bc3c2df8f39a500979228a | 1,300 | PASSED |
#include <iostream>
using namespace std;
int imin(int t[1001],int n)
{int i,m=0;
for(i=0;i<n;i++)
{
if(t[i]<t[m])
m=i;
}
return m;
}
int imax(int t[1001],int n)
{int i,m=0;
for(i=0;i<n;i++)
{
if(t[i]>t[m])
m=i;
}
return m;
}
int main()
{int indmin,indmax,b,t[1001],n,i,p=0;
cin>>n;
cin>>t[0]... | C++ | 7bfc0927ea7abcef661263e978612cc5 | e7e9290ad5b07d72826804354f757950 | 1,300 | PASSED |
#include <iostream>
using namespace std;
const int max_num = 2e5 + 10;
int data[max_num][7];
int binary[1 << 5 | 1][7];
struct node {
int left, right;
int max_num, min_num;//线段的三个特征
};
node tree[int(8e5 + 2)][1 << 5 | 1];
int cnt;
int k;
class segment_tree {
public:
inline void update_value(int root);
void build(in... | C++ | 6cf46b112d7a9cc4c19b1bb7b8452970 | 8cccc38ad687ae85bb0a4051d5d6e282 | 2,300 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef double D;
typedef long double LD;
typedef long long LL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef tree<int, null_type, less<int>, rb_tree_tag,... | C++ | 6cf46b112d7a9cc4c19b1bb7b8452970 | 8ba69df4e96813f518f40ec79ac7b3b5 | 2,300 | PASSED |
#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | C++ | 6cf46b112d7a9cc4c19b1bb7b8452970 | e374787e923b5dbc4bfa16eec7106bc0 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std; //#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
#define ... | C++ | 6cf46b112d7a9cc4c19b1bb7b8452970 | e25c52592aaff086eb760923401242cd | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std; //#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
#define ... | C++ | 6cf46b112d7a9cc4c19b1bb7b8452970 | f3bc850508fdd60ba4683cec9635b2c3 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std; //#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
#define ... | C++ | 6cf46b112d7a9cc4c19b1bb7b8452970 | 118b21d69a1a78a8bf030146267db443 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct punct{int d[6];};
struct node{node *st, *dr; int valmax[33], valmin[33];};
node *arb;
int n, k;
punct V[200005];
int sum(int c, punct *i)
{
int tot=0;
for (int j=1; j<=k; j++, c/=2)
{
if (c%2==1)
tot+=i->d[j];... | C++ | 6cf46b112d7a9cc4c19b1bb7b8452970 | 2f8eb8ea8ef4204ca77c67b53111212a | 2,300 | PASSED |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define mp make_pair
using namespace std;
typedef pair<int, int> pii;
#define N 200009
int n, k, sum, p[N][7], stt[34][N], q, t, ind, l, r;
const int M = 1e9 + 7;
class seg_min{
private:
pii st[N + N + N + N];
public:
void build(int *a, int node = 1, int l =... | C++ | 6cf46b112d7a9cc4c19b1bb7b8452970 | f16006def42c64155f3b7550d39c5026 | 2,300 | PASSED |
#include <iostream>
#include <cstdio>
using namespace std;
const int inf=1e9+7;
const int maxn=2e5+7;
const int maxk=7;
const int maxl=37;
int k, sign[maxl][maxk], a[maxn][maxk];
int cal(int id, int x){
int ans=0;
for(int i=0; i<k; i++)
ans+=sign[id][i]*a[x][i+1];
return ans;
}
struct node{
int minn, maxx;
node ... | C++ | 6cf46b112d7a9cc4c19b1bb7b8452970 | 1d809f0702268437a845f364946391f7 | 2,300 | PASSED |
#include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define fi first
#define se second
#define ff first
#define ss 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)
#de... | C++ | 6cf46b112d7a9cc4c19b1bb7b8452970 | 09e9460176d93978a5c386bcec2aac2d | 2,300 | PASSED |
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n,i,j,m,c=0;
cin>>n>>m;
char a[n][m];
for(i=0;i<n;i++)
{
cin>>a[i];
}
for(i=0;i<n-1;i++)
{
if(a[i][m-1]!='D')
c++;
}
for(i=0;i<m-... | C++ | 409073ef839a7d0cdb900c06ee4a841c | 53032fbe6aade1a85dfc5a7beaa7a448 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define maxn 110
#define pb push_back
typedef long long ll;
typedef long double ld;
const int MAXI = INT_MAX;
const ll MAXL = LLONG_MAX;
const ll MOD = 1e9 + 7;
int n, t, m;
string s[maxn];
int main(){
//freopen("HL.inp","r",stdin);
//freopen("HL.out","w",stdout)... | C++ | 409073ef839a7d0cdb900c06ee4a841c | 85f847838d0feac5431987d5a4a04c26 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define maxn 110
#define pb push_back
typedef long long ll;
typedef long double ld;
const int MAXI = INT_MAX;
const ll MAXL = LLONG_MAX;
const ll MOD = 1e9 + 7;
int n, t, m;
string s[maxn];
int main(){
//freopen("HL.inp","r",stdin);
//freopen("HL.out","w",stdout)... | C++ | 409073ef839a7d0cdb900c06ee4a841c | a77bde61bc1e9f6d1a38b93624cbf080 | 800 | PASSED |
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int i,j,t;
cin >> t;
while(t--)
{
int n,m,c=0;
cin>>n>>m;
char a[n][m];
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
... | C++ | 409073ef839a7d0cdb900c06ee4a841c | 15b3aa4187fc1a633de27182872cd550 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define loop(i,n) for(int i=0;i<(n);i++)
#define forr(i,a,b) for(int i=(a);i<=(b);i++)
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
char temp;
cin >> t;
while(t--!=0)
{
int n, m;
cin >> n >> m;
int counter=0;
... | C++ | 409073ef839a7d0cdb900c06ee4a841c | 39f9065c362c2cd0ea3ef5877bc29b34 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define loop(i,n) for(int i=0;i<(n);i++)
#define forr(i,a,b) for(int i=(a);i<=(b);i++)
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
char temp;
cin >> t;
while(t--!=0)
{
int n, m;
cin >> n >> m;
int counter=0;
... | C++ | 409073ef839a7d0cdb900c06ee4a841c | 3e15e313ffec5f51132b6d7d6746a6cd | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define loop(i,n) for(int i=0;i<(n);i++)
#define forr(i,a,b) for(int i=(a);i<=(b);i++)
int main()
{
int t;
char temp;
cin >> t;
while(t--!=0)
{
int n, m;
cin >> n >> m;
int counter=0;
for(int i=0; i<n; ++i)
{
for(int j=0;... | C++ | 409073ef839a7d0cdb900c06ee4a841c | 092ba3fbe07a580c1f4e2b1685074df6 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define loop(i,n) for(int i=0;i<(n);i++)
#define forr(i,a,b) for(int i=(a);i<=(b);i++)
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
char temp;
cin >> t;
while(t--!=0)
{
int n, m;
cin >> n >> m;
int counter=0;
... | C++ | 409073ef839a7d0cdb900c06ee4a841c | da7acc3c48aa59fc37a79e7c1b71239e | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define N 100005
#define mod 1000000007
#define dd double
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define mp make_pair
#define clr(x) x.clear()
#define sz(x) ((int)(x).size())
#define F first
#define S secon... | C++ | 409073ef839a7d0cdb900c06ee4a841c | 99275d7d602dbcd5d1da458d50872daa | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define N 100005
#define mod 1000000007
#define dd double
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define mp make_pair
#define clr(x) x.clear()
#define sz(x) ((int)(x).size())
#define F first
#define S secon... | C++ | 409073ef839a7d0cdb900c06ee4a841c | e2000c06d87d7576b815bf133e0e9462 | 800 | PASSED |
/** Micro Mezz Macro Flation -- Overheated Economy ., Last Update: Jun. 15th 2014 **/ //{
/** Header .. **/ //{
#pragma comment(linker, "/STACK:36777216")
//#pragma GCC optimize ("O2")
#define LOCAL
//#include "testlib.h"
#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstre... | C++ | e2cdcfde0d5585cb6c40473fb1c48499 | 6979f68a0debe49446412e351fb0abf3 | 3,000 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.