SPOJ 17921 XOR Solution
Solve in C:
#include <stdio.h>
int main()
{
int a,b;
scanf("%d%d",&a,&b);
printf("%d\n",a^b);
return 0;
}
#include <stdio.h>
int main()
{
int a,b;
scanf("%d%d",&a,&b);
printf("%d\n",a^b);
return 0;
}
Subscribe to:
Post Comments
(
Atom
)
Most View Post
-
Solve in C: #include <stdio.h> int main () { int y , a , b , c , d , count = 0 ; while ( scanf ( "%d" ,&...
-
Solve in C++: #include<bits/stdc++.h> using namespace std; int main() { int l,count=0,i; string s; cin>>s;...
-
Solve in C++: //AH Tonmoy //Department of CSE ,Islamic University #include<bits/stdc++.h> using namespace std; int main() { in...
-
solve in c++: #include<bits/stdc++.h> using namespace std; int main() { int i,t,c=0,ar[101],c1=0; while(cin>>t)...
-
Solve in C++: //AH Tonmoy //Department of CSE ,Islamic University #include<bits/stdc++.h> using namespace std; int main() { ...
-
Solve in C: #include<stdio.h> #include<string.h> int main() { char s[1001]; int i,len,p,n,j; scanf("%d...
-
Solve in C++: //AH Tonmoy //Department of CSE ,Islamic University #include<bits/stdc++.h> using namespace std; int main() { i...
-
Slve in C: #include<stdio.h> int main() { int i,len,one=0,zero=0,flag=0,j; char n[101]; while(scanf("%s"...
-
Solve in C++: #include<bits/stdc++.h> using namespace std; int main() { int n[100],k,nn,i,j,c=0; while(cin>>nn>>k...
-
Solve in C++: #include<bits/stdc++.h> using namespace std; main() { long long int n,i,a,r,j,f=0; scanf("%lld&quo...
Recent post
Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution
Problem Link : https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...
No comments