Codeforces All Solution

1.  Codeforces Solution 4A Watermelon

2.  Codeforces Solution 50A Domino Piling

3.  Codeforces Solution 71A Way Too Words 

4.  Codeforces Solution 110A Nearly Lucky Number 

5.  Codeforces Solution 122A Lucky Division 

6.  Codeforces Solution 118A String Task 

7.  Codeforces Solution 133A HQ9+ 

8.  Codeforces Solution 236A Boy or Girl 

9.  Codeforces Solution 281A Word Capitalization 

10. Codeforces Solution 282A Bit++

11. Codeforces Solution 469A I Wanna Be the Guy

12. Codeforces Solution 486A Calculation Function

13. Codeforces Solution 630A Again Twenty Five!

14. Codeforces Solution 705A Hulk

14. Codeforces Solution 734A Anton and Danik

15. Codeforces Solution 785A Anton and Polyhedrons

16. Codeforces Solution 977A Wrong Subtraction

Comments

Post a Comment

Popular posts from this blog

Uri Solution 2747 Output 1

#include<stdio.h> int main() {     printf("---------------------------------------\n");     printf("|                                     |\n");     printf("|                                     |\n");     printf("|                                     |\n");     printf("|                                     |\n");     printf("|                                     |\n");     printf("---------------------------------------\n");     return 0; }
Read more

Codeforces Solution 230B T-primes

Image
#include < bits / stdc ++. h > using namespace std ; int arr [ 10000000 ]; int main () { int i , j ; arr [ 0 ]= arr [ 1 ]= 1 ; for ( i = 2 ; i * i <= 10000000 ; i ++) { if ( arr [ i ]== 0 ) { for ( j = 2 ; i * j <= 10000000 ; j ++) { arr [ i * j ]= 1 ; } } } int n , t ; cin >> n ; long long int in ; for ( int i = 0 ; i < n ; i ++) { cin >> in ; t = sqrt ( in ); if ( t == sqrt ( in )&& arr [ t ]== 0 ) { cout << "YES" << endl ; } else cout << "NO" << endl ; } return 0 ; }
Read more