codeforces 268A problem solution in c/c++


#include <iostream>
#include<string>
using namespace std;
int main()
{
int anis[1000];
int n, i, j=1, a, b;
cin >> n;
for (i = 0;i < n;i++)
{
cin >> a >> b;
anis[j] = a;
j++;
anis[j] = b;
j++;
}
int z, v=0;
z = j;
for (i = 1;i < z;i+=2)
{
for (j = 2;j < z;j += 2)
{
if (anis[i] == anis[j])
{
v++;
}
}

}
cout << v << endl;
 
}


Comments

Post a Comment

Popular posts from this blog

codeforces 472A problem solution in simple c/c++

// 472A.cpp : This file contains the 'main' function. Program execution begins and ends there. // #include <iostream> using namespace std; int main() { int n,v=0,b=0,m=0,e=0,cc=0,bb=0; cin >> n; if (n % 2 == 0) { v = n; v = v / 2; if (v % 2 == 0) { b = v; m = v; } else if (v % 2 == 1) { b = v - 1; m = v + 1; } } else if (n % 2 == 1) { e = n; e = e / 2; b = e; m = e + 1; for (int j = 0;j < m;j++) { for (int i = 2;i < m / 2;i++) { if (b%i == 0) { cc++; } if(m%i==0) { bb++; } } if (bb == 0 && cc == 0) { b = b - 1; m = m + 1; bb = 0; cc = 0; } else if (bb > 0 && cc == 0) { b = b - 1; m = m + 1; bb = 0; cc = 0; } else if (cc > 0 && bb == 0) { b = b - 1; m = m + 1; bb = 0; cc = 0; } else if (bb > 0 &...
Read more

codeforces 339A solution in c/c++

// 339A.cpp : This file contains the 'main' function. Program execution begins and ends there. // #include <iostream> # include<string> using namespace std; int main() { string anis; cin >> anis; int v = anis.length();//determine string length int c = anis[0]; int temp; for (int i = 0;i < v;i+=2) { for (int j = i + 2;j < v;j+=2) { if (anis[i] > anis[j]) { temp = anis[i]; anis[i] = anis[j]; anis[j] = temp; } } } cout << anis;     }
Read more

codeforces 520A problem solution in c/c++

// 520A.cpp : This file contains the 'main' function. Program execution begins and ends there. // //# include "pch.h" # include <iostream> # include<string> using namespace std; int main() { string anis; string anis1; int nn,a=0,b=0,c=0,d=0,e=0,f=0,g=0,h=0,ii=0,j=0,k=0,l=0,m=0,n=0,o=0,p=0,q=0,r=0,s=0,t=0,u=0,v=0,w=0,x=0,y=0,z=0; cin >> nn; cin >> anis; for (int i = 0;i < nn;i++) { if (anis[i] == 'A' || anis[i] == 'a') { a++; } else if (anis[i] == 'B' || anis[i] == 'b') { b++; } else if (anis[i] == 'C' || anis[i] == 'c') { c++; } if (anis[i] == 'D' || anis[i] == 'd') { d++; } else if (anis[i] == 'e' || anis[i] == 'E') { e++; } else if (anis[i] == 'F' || anis[i] == 'f') { f++; } if (anis[i] == 'G' || anis[i] == 'g') { g++; ...
Read more