89

00

73

15

#include #include #include #include #include #include #define N 1000#define ll __int64using namespace std;int vis[20]={2,7,2,3,3,4,2,5,1,2};//電梯數(shù)字顯示出現(xiàn)不同程度損壞，可能有一個或幾個stick熄滅，算出每個數(shù)字存在的情況

int main()

{ int n; while(~scanf("%d",&n)) { int ans=1; int a=n%10; int b=n/10; ans*=vis[a]; ans*=vis[b]; cout< 
 
 B. Modular Equations 
 
 
 time limit per test 
 1 second 
 
 
 memory limit per test 
 256 megabytes 
 
 
 input 
 standard input 
 
 
 output 
 standard output 
 
 
Last week, Hamed learned about a new type of equations in his math class called Modular Equations. Lets define i modulo j as the remainder of division of i by j and denote it by . A Modular Equation, as Hamed's teacher described, is an equation of the form in which a and b are two non-negative integers and x is a variable. We call a positive integer x for which a solution of our equation.
 
Hamed didn't pay much attention to the class since he was watching a movie. He only managed to understand the definitions of these equations.
 
Now he wants to write his math exercises but since he has no idea how to do that, he asked you for help. He has told you all he knows about Modular Equations and asked you to write a program which given two numbers a and b determines how many answers the Modular Equation has.
 
 
 Input 
 
In the only line of the input two space-separated integers a and b (0?≤?a,?b?≤?109) are given.
 
 
 Output 
 
If there is an infinite number of answers to our equation, print "infinity" (without the quotes). Otherwise print the number of solutions of the Modular Equation .
 
 
 Sample test(s) 
 
 
 
 Input 
 
21 5

9435152 272

282

10 10

infinity

#include #include #include #include #include #include #define N 10000009#define ll __int64using namespace std;//a=b+kx;因?yàn)閿?shù)據(jù)比較大10^9，所有不能直接暴力，稍微轉(zhuǎn)化一下

int main(){ ll a,b; while(~scanf("%I64d%I64d",&a,&b)) { ll c=a-b; if(a==b) { printf("infinity\n"); continue; } if(ab) { ans++; } if( i*ib) ) ans++; } } cout< 
 
 
 C. Treasure 
 
 
 time limit per test 
 2 seconds 
 
 
 memory limit per test 
 256 megabytes 
 
 
 input 
 standard input 
 
 
 output 
 standard output 
 
 
Malek has recently found a treasure map. While he was looking for a treasure he found a locked door. There was a string s written on the door consisting of characters '(', ')' and '#'. Below there was a manual on how to open the door. After spending a long time Malek managed to decode the manual and found out that the goal is to replace each '#' with one or more ')' characters so that the final string becomes beautiful. 
 
Below there was also written that a string is called beautiful if for each i (1?≤?i?≤?|s|) there are no more ')' characters than '(' characters among the first i characters of s and also the total number of '(' characters is equal to the total number of ')' characters. 
 
Help Malek open the door by telling him for each '#' character how many ')' characters he must replace it with.
 
 
 Input 
 
The first line of the input contains a string s (1?≤?|s|?≤?105). Each character of this string is one of the characters '(', ')' or '#'. It is guaranteed that s contains at least one '#' character.
 
 
 Output 
 
If there is no way of replacing '#' characters which leads to a beautiful string print ?-?1. Otherwise for each character '#' print a separate line containing a positive integer, the number of ')' characters this character must be replaced with.
 
If there are several possible answers, you may output any of them.
 
 
 Sample test(s) 
 
 
 
 Input 
 
(((#)((#)

12

()((#((#(#()

221

(#)

#include #include #include #include #include #include #define N 100009using namespace std;char str[N];vector t;int main(){ while(~scanf("%s",str)) { int a=0,b=0,c=0; int num=0; int len=strlen(str); for(int i=0;i