diff --git a/codeforce/Anton and Danik.py b/codeforce/Anton and Danik.py
new file mode 100644
index 0000000..0e39844
--- /dev/null
+++ b/codeforce/Anton and Danik.py	
@@ -0,0 +1,8 @@
+n = int(input())
+s = input()
+if s.count('A')>s.count('D'):
+    print("Anton")
+if s.count('A')<s.count('D'):
+    print('Danik')
+if s.count('A') == s.count('D'):
+    print('Friendship')
diff --git a/codeforce/Anton and Letters.py b/codeforce/Anton and Letters.py
new file mode 100644
index 0000000..991c7da
--- /dev/null
+++ b/codeforce/Anton and Letters.py	
@@ -0,0 +1,7 @@
+def get_dis(s):
+    return len(set(s))-4
+s = input()
+if len(s) == 2:
+    print(0)
+else:
+    print(abs(get_dis(s)))
diff --git a/codeforce/Anton and Polyhedrons.py b/codeforce/Anton and Polyhedrons.py
new file mode 100644
index 0000000..06fed0f
--- /dev/null
+++ b/codeforce/Anton and Polyhedrons.py	
@@ -0,0 +1,15 @@
+n = int(input())
+t = 0
+for i in range(n):
+     s = input()
+     if s == "Tetrahedron":
+          t = t+4
+     if s == "Cube":
+          t = t+6
+     if s == "Octahedron":
+          t = t+8
+     if s == "Dodecahedron" :
+          t = t+12
+     if s == "Icosahedron" :
+          t = t+20
+print(t)
diff --git a/codeforce/Bear and Big Brother.py b/codeforce/Bear and Big Brother.py
new file mode 100644
index 0000000..c1369d8
--- /dev/null
+++ b/codeforce/Bear and Big Brother.py	
@@ -0,0 +1,9 @@
+a,b = map(int,input().split())
+x = 1
+while True :
+    a = a*3
+    b = b*2
+    if a>b :
+        break
+    x =x+1
+print(x)
diff --git a/codeforce/Beautiful Matrix.cpp b/codeforce/Beautiful Matrix.cpp
new file mode 100644
index 0000000..493af91
--- /dev/null
+++ b/codeforce/Beautiful Matrix.cpp	
@@ -0,0 +1,26 @@
+#include<iostream>
+#include <cstdlib>
+using namespace std;
+int main()
+{
+	int arr[5][5];
+	int b=0,r=0,c=0;
+	for (int i=0;i<5;i++)
+	{
+		for (int j =0;j<5;j++ )
+		{
+			cin>>arr[i][j];
+		}
+	}
+	for(int i=0;i<5;i++)
+	{
+		for(int j=0;j<5;j++)
+		{
+			if (arr[i][j] == 1)
+			{
+				cout<<abs(3-(i+1))+abs(3-(j+1));
+				break;
+			}
+		}
+	}
+}
diff --git a/codeforce/Bit++.py b/codeforce/Bit++.py
new file mode 100644
index 0000000..bf71b08
--- /dev/null
+++ b/codeforce/Bit++.py
@@ -0,0 +1,9 @@
+n = int(input())
+x=0
+for i in range(n):
+    s = input()
+    if '+' in s:
+        x+=1
+    else:
+        x-=1
+print(x)
diff --git a/codeforce/Black square.cpp b/codeforce/Black square.cpp
new file mode 100644
index 0000000..2d718d0
--- /dev/null
+++ b/codeforce/Black square.cpp	
@@ -0,0 +1,33 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+	int sum=0,a=0,b=0,c=0,d=0;
+	int arr[4];
+	for (int i=0;i<4;i++)
+	{
+		cin>>arr[i];
+	}
+	string s;
+	cin>>s;
+	for(int i=0;i<s.length();i++)
+	{
+		if (s[i] == '1')
+		{
+			a++;
+		}
+		else if ( s[i] == '2')
+		{
+			b++;
+		}
+		else if ( s[i] == '3')
+		{
+			c++;
+		}
+		else {
+			d++;
+		}
+	}
+	sum = (a*arr[0])+(b*arr[1])+(c*arr[2])+(d*arr[3]);
+	cout<<sum;
+}
diff --git a/codeforce/Boy or Girl.py b/codeforce/Boy or Girl.py
new file mode 100644
index 0000000..bf1c851
--- /dev/null
+++ b/codeforce/Boy or Girl.py	
@@ -0,0 +1,5 @@
+word = input()
+if len(set(word))%2 == 0:
+    print("CHAT WITH HER!")
+else:
+    print("IGNORE HIM!")
diff --git a/codeforce/Calculating Function.py b/codeforce/Calculating Function.py
new file mode 100644
index 0000000..5fea715
--- /dev/null
+++ b/codeforce/Calculating Function.py	
@@ -0,0 +1,5 @@
+n = int(input())
+if n%2 == 0:
+     print(n//2)
+else:
+     print((-n-1)//2)
diff --git a/codeforce/Free ice cream.cpp b/codeforce/Free ice cream.cpp
new file mode 100644
index 0000000..75343bd
--- /dev/null
+++ b/codeforce/Free ice cream.cpp	
@@ -0,0 +1,17 @@
+#include<iostream>
+#include <bits/stdc++.h>
+using namespace std;
+int main()
+{
+	int a,b;
+	int m;
+		int c;
+	cin>>a>>b;
+	m=max(a,b);
+	c=(6-(a-1))/6;
+	cout<<c;
+	
+	
+	
+	
+}
diff --git a/codeforce/Games.cpp b/codeforce/Games.cpp
new file mode 100644
index 0000000..f76200d
--- /dev/null
+++ b/codeforce/Games.cpp
@@ -0,0 +1,23 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+	int ans=0;
+	int n;cin>>n;
+	int h[n],a[n];
+	for(int k=0;k<n;k++)
+	{
+		cin>>h[k]>>a[k];
+	}
+	for(int i=0;i<n;i++)
+	{
+		for(int j=0;j<n;j++)
+		{
+			if (i!=j && h[i] == a[j]	)
+			{
+				++ans;
+			}
+		}
+	}
+	cout<<ans;
+}
diff --git a/codeforce/Gravity Flip.cpp b/codeforce/Gravity Flip.cpp
new file mode 100644
index 0000000..f50b75b
--- /dev/null
+++ b/codeforce/Gravity Flip.cpp	
@@ -0,0 +1,30 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;cin>>n;
+	int arr[n];
+	int temp;
+	for (int k=0;k<n;k++)
+	{
+		cin>>arr[k];
+	}
+	for(int i = 0;i<n;i++)
+	{
+		for (int j = i+1;j<n;j++)
+		{
+			if(arr[j] <arr[i] )
+			{
+				temp=arr[i];
+				arr[i] = arr[j];
+				arr[j] = temp;
+			}
+		}
+	}
+	for ( int k=0;k<n;k++)
+	{
+		cout<<arr[k]<<" ";
+	}
+	
+	
+}
diff --git a/codeforce/Helpful Maths.py b/codeforce/Helpful Maths.py
new file mode 100644
index 0000000..ef4148d
--- /dev/null
+++ b/codeforce/Helpful Maths.py	
@@ -0,0 +1,16 @@
+word = input()
+l = []
+if len(word) <= 1:
+    print(word)
+else:
+    for i in word:
+        if i.isdigit():
+            l.append(int(i))
+
+    N_word = ""
+    l.sort()
+    for k in l  :
+        N_word = N_word + '+' + str(k)
+
+    print(N_word[1:])
+    
diff --git a/codeforce/Hulk.py b/codeforce/Hulk.py
new file mode 100644
index 0000000..4fc0f85
--- /dev/null
+++ b/codeforce/Hulk.py
@@ -0,0 +1,21 @@
+n = int(input())
+s = ""
+for i in range(1,n+1):
+     s = s+" "+ "I"
+     if i != n:
+          if i%2 != 0:
+               s = s+" "+ "hate that"
+               #print("hate that")
+          else:
+              s = s+" "+ "love that"
+               #print("love that")
+     else:
+          if n%2 != 0:
+               s = s+" "+ "hate"
+               #print("hate")
+          else:
+               s = s+" "+ "love"
+               #print("love")
+s = s+" "+ "it"
+print(s)
+               
diff --git a/codeforce/Insomnia cure.py b/codeforce/Insomnia cure.py
new file mode 100644
index 0000000..d305c8d
--- /dev/null
+++ b/codeforce/Insomnia cure.py	
@@ -0,0 +1,10 @@
+k = int(input())
+l = int(input())
+m = int(input())
+n = int(input())
+d = int(input())
+h = 0
+for i in range(1,d+1):
+     if i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0:
+          h+=1
+print(d-h)
diff --git a/codeforce/Is your horseshoe on the other hoof.py b/codeforce/Is your horseshoe on the other hoof.py
new file mode 100644
index 0000000..69f468f
--- /dev/null
+++ b/codeforce/Is your horseshoe on the other hoof.py	
@@ -0,0 +1,4 @@
+s = input().split()
+S = list(s)
+m = 4 - int(len(set(S)))
+print(m)
diff --git a/codeforce/List of  the problems.xlsx b/codeforce/List of  the problems.xlsx
new file mode 100644
index 0000000..3a6a94b
Binary files /dev/null and b/codeforce/List of  the problems.xlsx differ
diff --git a/codeforce/Magnets.cpp b/codeforce/Magnets.cpp
new file mode 100644
index 0000000..431cbaa
--- /dev/null
+++ b/codeforce/Magnets.cpp
@@ -0,0 +1,24 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;cin>>n;
+	int gp=1;
+	string temp,value;
+	for (int i =0;i<n;i++)
+	{
+		cin>>value;
+		if (i ==0)
+		{
+			temp=value;
+			continue;
+		}
+		if (temp[1] == value[0])
+		{
+			++gp;
+		}
+		temp=value;
+		
+	}
+	cout<<gp;
+}
diff --git a/codeforce/Mahmoud and Longest Uncommon Subsequence.cpp b/codeforce/Mahmoud and Longest Uncommon Subsequence.cpp
new file mode 100644
index 0000000..276d0b4
--- /dev/null
+++ b/codeforce/Mahmoud and Longest Uncommon Subsequence.cpp	
@@ -0,0 +1,19 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main()
+{
+	string a,b;
+	cin>>a>>b;
+	if (a==b)
+	{
+		cout<<-1;
+	}
+	else if (a.length()==b.length() && a!=b)
+	{
+		cout<<a.length();
+	}
+	else
+	{
+		cout<<max(a.length(),b.length());
+	}
+}
diff --git a/codeforce/Minutes Before the New Year.py b/codeforce/Minutes Before the New Year.py
new file mode 100644
index 0000000..31cb7a9
--- /dev/null
+++ b/codeforce/Minutes Before the New Year.py	
@@ -0,0 +1,9 @@
+n = int(input())
+t = 1440
+l = []
+for i in range(n):
+     h,m = map(int,input().split())
+     z = (h*60)+m
+     a = t-z
+     l.append(a)
+print(*l,sep='\n')S
diff --git a/codeforce/Next Round.py b/codeforce/Next Round.py
new file mode 100644
index 0000000..06987ad
--- /dev/null
+++ b/codeforce/Next Round.py	
@@ -0,0 +1,7 @@
+n,k = map(int,input().split())
+l = list(input().split())
+c = 0
+for i in l :
+    if  int(i)!= 0 and int(i)>=int(l[k-1]) :
+        c=c+1
+print(c)
diff --git a/codeforce/Pangram.py b/codeforce/Pangram.py
new file mode 100644
index 0000000..ee258aa
--- /dev/null
+++ b/codeforce/Pangram.py
@@ -0,0 +1,17 @@
+def Pangram(s):
+    L = ['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']
+    s = s.upper()
+    z = set(s)
+    T = []
+    for i in L:
+        if i in z:
+            T.append(True)
+ 
+    if len(T) == 26 :
+        return "Yes"
+    else:
+        return "No"
+ 
+n = int(input())
+s = input()
+print(Pangram(s))
diff --git a/codeforce/Petya and Strings.py b/codeforce/Petya and Strings.py
new file mode 100644
index 0000000..39a49a9
--- /dev/null
+++ b/codeforce/Petya and Strings.py	
@@ -0,0 +1,11 @@
+def retur(s1,s2):
+     if s1 > s2:
+          return 1
+     elif s1 < s2:
+          return -1
+     else:
+          return 0
+
+st1 = str(input().lower())
+st2 = str(input().lower())
+print(retur(st1,st2))
diff --git a/codeforce/Phone Numbers.py b/codeforce/Phone Numbers.py
new file mode 100644
index 0000000..d20c4e0
--- /dev/null
+++ b/codeforce/Phone Numbers.py	
@@ -0,0 +1,11 @@
+t = int(input())
+l = []
+for i in range(t):
+     a,b = map(str,input().split())
+     b = list(b)
+     s = 0
+     for i in b :
+          s = s+int(i)
+     if s%2 == 0:
+          l.append(a)
+print(*l,sep='\n')
diff --git a/codeforce/Police recruits.cpp b/codeforce/Police recruits.cpp
new file mode 100644
index 0000000..03b3d03
--- /dev/null
+++ b/codeforce/Police recruits.cpp	
@@ -0,0 +1,24 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;cin>>n;
+	int sum=0,c=0;
+	int arr[n];
+	for (int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+	}
+	for (int i=0;i<n;i++)
+	{
+		if (sum +arr[i] <0)
+		{
+			c++;
+		}
+		else
+		{
+			sum+=arr[i];
+		}
+	}
+	cout<<c;
+}
diff --git a/codeforce/Presents.py b/codeforce/Presents.py
new file mode 100644
index 0000000..5e96363
--- /dev/null
+++ b/codeforce/Presents.py
@@ -0,0 +1,8 @@
+size = int(input())
+num = list(input().split())
+l=[]
+for i in range(1,size+1):
+    l.append(int(num.index(str(i)))+1)
+
+print(*l,end=" ")
+    
diff --git a/codeforce/Serja and Dima.cpp b/codeforce/Serja and Dima.cpp
new file mode 100644
index 0000000..79a634b
--- /dev/null
+++ b/codeforce/Serja and Dima.cpp	
@@ -0,0 +1,51 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n;cin>>n;
+	int s=0,d=0;
+	int l=0,r=n-1;
+	bool p=true;
+	int arr[n];
+	for (int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+	}
+	while (l<=r)
+	{
+		if (arr[l] > arr[r])
+		{ 
+			if(p){
+				s+=arr[l];
+			}
+			else
+			{
+				d+=arr[l];
+			}
+			l++;
+		}
+		else
+		{
+			if(p)
+			{
+				s+=arr[r];
+			}
+			else
+			{
+				d+=arr[r];
+			}
+			r--;
+		}
+		if (p)
+		{
+			p=false;
+		}
+		else
+		{
+			p=true;
+		}
+	}
+	cout<<s<<" "<<d;
+	
+	
+}
diff --git a/codeforce/Soldier and Bananas.py b/codeforce/Soldier and Bananas.py
new file mode 100644
index 0000000..34acce9
--- /dev/null
+++ b/codeforce/Soldier and Bananas.py	
@@ -0,0 +1,8 @@
+k,n,w=map(int,input().split())
+price = 0
+for i in range(1,w+1):
+    price = price+i*k
+if price>n: 
+    print(price-n)
+else:
+    print(0)
diff --git a/codeforce/Stones on the Table.py b/codeforce/Stones on the Table.py
new file mode 100644
index 0000000..20a24f8
--- /dev/null
+++ b/codeforce/Stones on the Table.py	
@@ -0,0 +1,8 @@
+n = int(input())
+s = input()
+x = 0
+for i in range(0,n-1):
+    if s[i] == s[i+1]:
+        x = x+1
+print(x)
+        
diff --git a/codeforce/Team.py b/codeforce/Team.py
new file mode 100644
index 0000000..4e37d25
--- /dev/null
+++ b/codeforce/Team.py
@@ -0,0 +1,7 @@
+n = int(input())
+count = 0
+for i in range(n):
+    a= input().split()
+    if a.count('1')>=2:
+        count=count+1
+print(count)
diff --git a/codeforce/Ultra-Fast Mathematician.py b/codeforce/Ultra-Fast Mathematician.py
new file mode 100644
index 0000000..cfd057b
--- /dev/null
+++ b/codeforce/Ultra-Fast Mathematician.py	
@@ -0,0 +1,10 @@
+a = input()
+b = input()
+Nn = ''
+for i in range(len(a)):
+    if a[i] != b[i]:
+        Nn = Nn+'1'
+    else:
+         Nn = Nn+'0'
+print(Nn)
+        
diff --git a/codeforce/Vanya and Fence.py b/codeforce/Vanya and Fence.py
new file mode 100644
index 0000000..85485fe
--- /dev/null
+++ b/codeforce/Vanya and Fence.py	
@@ -0,0 +1,9 @@
+n,h = map(int,input().split())
+a = list(input().split())
+w = 0
+for i in a :
+    if int(i) > h:
+        w = w+2
+    else:
+        w = w+1
+print(w)
diff --git a/codeforce/Watermelon.py b/codeforce/Watermelon.py
new file mode 100644
index 0000000..0649a5b
--- /dev/null
+++ b/codeforce/Watermelon.py
@@ -0,0 +1,10 @@
+w = int(input())
+if w==2:
+     print("NO")
+else:
+     if w%2 == 0:
+	     if (w%2)%2==0:
+		     print("YES")
+     else:
+          print("NO")
+	
\ No newline at end of file
diff --git a/codeforce/Way Too Long Words.py b/codeforce/Way Too Long Words.py
new file mode 100644
index 0000000..02aa031
--- /dev/null
+++ b/codeforce/Way Too Long Words.py	
@@ -0,0 +1,11 @@
+def WTLW(s):
+    a = len(s)-2
+    return s[0]+str(a)+s[-1]
+n = int(input())
+for i in range(n):
+    w = input()
+    if len(w)>10:
+        print(WTLW(w))
+    else:
+        print(w)
+    
diff --git a/codeforce/Word Capitalization.py b/codeforce/Word Capitalization.py
new file mode 100644
index 0000000..fa92934
--- /dev/null
+++ b/codeforce/Word Capitalization.py	
@@ -0,0 +1,5 @@
+def capitalization(word):
+     return word[0].upper()+word[1:]
+
+word = input()
+print(capitalization(word))
diff --git a/codeforce/jucier.cpp b/codeforce/jucier.cpp
new file mode 100644
index 0000000..a2a2b39
--- /dev/null
+++ b/codeforce/jucier.cpp
@@ -0,0 +1,31 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+	long long n,b,d,s=0;
+	int x=0;
+	cin>>n>>b>>d;
+	long long a[n];
+	for(int i=0;i<n;i++)
+	{
+		cin>>a[i];
+		
+	}
+	for(int i=0;i<n;i++)
+	{
+		if( a[i] <=b)
+		{
+			s=s+a[i];
+			if (s>d)
+			{
+				++x;
+				s=0;
+			}
+		}
+	}
+	cout<<x;
+	x=0;
+	
+	
+}
+