fork(2) download
copy 
  1. #include <iostream>
  2. #include <string>
  3. #include <vector>
  4. #include <set>
  5. #include <queue>
  6. #include <map>
  7. #include <stack>
  8. #include <algorithm>
  9. #include <bitset>
  10. #include <cstring>
  11. #include <cmath>
  12. #include <cstdlib>
  13. #include <cstdio>
  14. #include <iomanip>
  15.  
  16. #define F first
  17. #define S second
  18. #define ll long long
  19. #define len length()             
  20. #define sqr(x) x*x
  21. #define pb push_back
  22. #define mp make_pair
  23. #define sz(x) ((int) (x).size())
  24. #define all(x) x.begin(), x.end()
  25. #define allr(x) x.rbegin(), x.rend()
  26. #define bp(x) __builtin_popcount(x)            
  27. #define INF numeric_limits<long long int>::max()
  28. #define frp freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
  29. #define forit(it, s) for(__typeof(s.begin()) it = s.begin(); it != s.end(); it++)
  30.  
  31. const int maxn = (int)1e6;
  32. const int mod = (int)1e9 + 7;
  33.  
  34. using namespace std;
  35.  
  36. int StoI(string s){
  37.  	int res=0;
  38.  	for(int i=0; i < s.len; i++){
  39.  		res=res*10+(s[i]-'0');
  40.  	}	
  41. 	return res;
  42. }
  43.  
  44. string s;
  45. string digit,word;
  46. int digits;
  47.  
  48. main(){
  49. 	cin>>s;    
  50.    	for(int i=0; i < s.len; i++){
  51.    		if(isdigit(s[i])){
  52.    			while(isdigit(s[i])){
  53.    				digit+=s[i];
  54.    				i++;
  55.    			}
  56.    			i--;
  57.    		}else{
  58.    			word+=s[i];
  59.    		}
  60.    	}
  61.    	digits=StoI(digit);                       
  62.    	for(int i=0; i < s.len; i++){
  63.    		if(digits < 3){
  64.    			switch(word[i]){
  65.    				case 'A':case 'a':puts("window");break;
  66.    				case 'D':case 'd':puts("window");break;
  67.    				case 'B':case 'b':puts("aisle");break;
  68.    			    case 'C':case 'c':puts("aisle");break;
  69.    			}
  70.    		}
  71.    		if(digits >= 3 && digits <= 20){
  72.    			switch(word[i]){
  73.    				case 'A':case  'a':puts("window");break;
  74.    				case 'F':case  'f':puts("window");break;
  75.    				case 'B':case  'b':puts("aisle");break;	
  76.    				case 'D':case  'd':puts("aisle");break;
  77.    				case 'E':case  'e':puts("aisle");break;
  78.    				case 'C':case  'c':puts("aisle");break;
  79.    			}
  80.    		}
  81.    		if(digits >= 21 && digits <= 65){
  82.    			switch(word[i]){
  83.    				case 'A':case  'a':puts("window");break;
  84.    				case 'K':case  'k':puts("window");break;
  85.    				case 'G':case  'g':puts("aisle");break;		
  86. 	            case 'D':case  'd':puts("aisle");break;
  87. 	            case 'H':case  'h':puts("aisle");break;
  88. 	            case 'C':case  'c':puts("aisle");break;
  89. 	            case 'B':case  'b':puts("neither");break;
  90. 	            case 'E':case  'e':puts("neither");break;
  91. 	            case 'F':case  'f':puts("neither");break;
  92. 	            case 'J':case  'j':puts("neither");break;
  93. 	       	}
  94. 	   	}
  95. 	   	if( digits > 65)
  96. 	   		puts("neither");break;
  97. 	}
  98.  
  99.  
  100.  
  101.     return 0;
  102. }
Success #stdin #stdout 0s 3416KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/4l4WyP
language:
C++ (gcc 8.3)
created:
10 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!