OJ Board

why i got WA in my code ? #include <iostream> #include <vector> #include <algorithm> using namespace std; static long long sw,n; static long long v[500001]; void gabung(int p,int q,int r) { long long n1 = q-p+1; long long n2 = r-q; long long i,j; long long L[n1+1], R[n2+1]; for (i=0;i<n1;i++) L[i]=v...

actually, you just missing enter after you print the output
try this for the output : and you will get AC

finally, i got AC... i just use bool cmp(data a, data b) { if (a.mod==b.mod) if (a.stat==b.stat) if (a.stat==1) return a.angka > b.angka; else return a.angka < b.angka; return a.stat < b.stat; return a.mod < b.mod; } and sort(v.begin(),v.end(),cmp); :lol: :lol: :lol: :lol: :lol:

why my code is always RE ? this is my code : #include <iostream> #include <vector> using namespace std; int main() { int arr1[100000],arr2[100000]; vector<int> v,v1,v2; int t; cin>>t; for (int i=0;i<t;i++) { int n,a,b,temp; cin>>n>>a>>b; v.clear(); v1.clear(); v2.clear(); a++;b++; memset(arr1,0,size...

@ eric :
i know where is your mistake.

1. you should delete this line : 2. The word 'Wins' in 'Stan Wins' and 'Ollie Wins' its should change to 'Stan wins' and 'Ollie wins'..

where is my mistake in this program? i always got TLE #include <iostream> #include <vector> using namespace std; int arr[1000001]={0}; vector<int> v; int main() { bool prime[1000001]={0}; prime[0]=1; prime[1]=1; for (int i=2;i<=1000000;i++) { if (prime[i]==0) { v.push_back(i); int temp=i+i; while (t...

i know why your code is WA :
your code should : only thats, n you will AC

Pliss help me... i always runtime error with my code, this is my code : #include <iostream> #include <math.h> using namespace std; int main() { double x[1010]; x[1] = x[0] = 0; for(int i=2;i<=1009;i++) x[i] = x[i-1] + log10(i); int n; int *fact[1010]; n=1009; { int hasil1[2600]={0}; int hasil2[2600]...

you can use floor and ceil function to solve this problem.

i just use :

if (floor(sqrt(n))==ceil(sqrt(n)))
cout<<"yes"<<endl;
else
cout<<"no"<<endl;

and i accepted...